In Response.
Saved in:
| Title: | In Response. |
|---|---|
| Authors: | Loebner, Hugh Gene1 |
| Source: | Communications of the ACM. Jun94, Vol. 37 Issue 6, p79-82. 4p. |
| Subjects: | Macro instructions (Electronic computers), Macro processors, Communications of the ACM (Periodical), Savings, Macroprogramming, Computer software |
| Abstract: | The article presents the response of the author to the article "Lessons from a Restricted Turing Test," published in June,1994, issue of the journal "Communications of the ACM." Input for a MACRO program is text streams. In an initial declarative section of a MACRO program, tokens are defined as strings of characters. The procedure section consists of a collection of macros. These are sub-routines each of which is headed by a pattern of tokens. As the input text stream is read by a program it is tokenized. When a pattern of tokens in the input stream matches a pattern defined for a macro, that macro is activated. MACRO is recursive and it allows associative subscripting. MACRO's ability to create and match patterns of tokens seemed ideal for natural language analysis. There are two advantages to an unrestricted test. The first is that it is the Turing Test, and it is time when it was conducted. The second reason is that it is much simpler and less expensive. |
| Database: | Engineering Source |
| Abstract: | The article presents the response of the author to the article "Lessons from a Restricted Turing Test," published in June,1994, issue of the journal "Communications of the ACM." Input for a MACRO program is text streams. In an initial declarative section of a MACRO program, tokens are defined as strings of characters. The procedure section consists of a collection of macros. These are sub-routines each of which is headed by a pattern of tokens. As the input text stream is read by a program it is tokenized. When a pattern of tokens in the input stream matches a pattern defined for a macro, that macro is activated. MACRO is recursive and it allows associative subscripting. MACRO's ability to create and match patterns of tokens seemed ideal for natural language analysis. There are two advantages to an unrestricted test. The first is that it is the Turing Test, and it is time when it was conducted. The second reason is that it is much simpler and less expensive. |
|---|---|
| ISSN: | 00010782 |
| DOI: | 10.1145/175208.175218 |
