Computer processing of natural language
This exploration of computerized linguistic analysis focuses on the grammars that describe and generate the sentences that make up a given language, and why a language's grammar has important implications for the way in which it can be processed.
What people are saying - Write a review
We haven't found any reviews in the usual places.
TRANSFORMATIONAL GRAMMARS FOR NATURAL
6 other sections not shown
accepting sequence acceptor Active addition ALGOL 60 algorithm alternative appear apply assigned Aux/m backtracking CF grammar Chapter Chomsky Normal Form clause coindexed complete consider construct context-free grammar D-structure data base defined definition derivation sequence derivation tree discussion example formal function deterministically given grammatical form Greibach Normal Form initial symbol input instantiation introduced John left parse left-recursion lexical linguistics main verb metagrammar metavariable modal modal verb natural language node nondeterministic nonterminal Noun NP VP Numb2 Number Agreement output pair Passive phrase marker Plural possible predicate Prep NP PrepP processing proposition pushdown store Ques question QY/N recursive refer registers representation right-linear grammar rules s-form secondary network semantic interpretation sentence sentential form shown in Figure stack step structure syntactic T-rule Tense Numb terminal categories terminal symbol tion transformational grammar transition network translation two-level grammar Type VAux VComp Voice well-formed