Noam Chomsky's transformational-generative grammar model may effectively be translated into an equivalent computer model. Phrase-structure rules and transformations are tested as to their validity and ordering by the computer via the process of random lexical substitution. Errors appearing in the grammar are detected and rectified, and formal…

The possible usefulness of computer poetry is concerned with what the programmer can learn about language, about poetry, and about poets. The problems in designing computer programs to construct poetry include considerations in generating well-formed sentences which have the added restrictions that poetry requires: meter, rhyme, logic, diction,…

At present a computer system cannot be constructed for handling the totality of a natural language in any significant way. It is, however, possible to construct a system for communication in a narrow field of discourse. A working model for a specialized discourse based on a recognition grammar is discussed. Some properties of the recognition…