Inferential memory as the basis of machines which understand natural language
Computers & thought
A Computational Approach to Grammatical Coding of English Words
Journal of the ACM (JACM)
Experiments with a Heuristic Compiler
Journal of the ACM (JACM)
Baseball: an automatic question-answerer
IRE-AIEE-ACM '61 (Western) Papers presented at the May 9-11, 1961, western joint IRE-AIEE-ACM computer conference
Syntactic structure and ambiguity of English
AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
An economical program for limited parsing of English
AFIPS '65 (Fall, part I) Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I
Information storage and retrieval-analysis of the state of the art
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
| Hi-index | 0.00 |
A statement in a spoken language may be regarded as a one-dimensional string of symbols used to communicate an idea from the speaker to a listener. The dimensionality of the statement is limited by the need for presenting words in a single time sequence. However, evidence indicates that most information and ideas are not stored by people in one-dimensional arrays isomorphic to these linear strings. This implies that a speaker must use certain complex information manipulating processes to transform the stored information to a linear output string, and that a listener, in order to "understand" the speaker, must use another set of processes to decode this linear string. In order for communication to take place, the information map of both the listener and the speaker must be approximately the same, at least for the universe of discourse. Most important, the decoding process of the listener must be an approximate inverse of the encoding process of the speaker.