Natural Language Processing in Prolog: An Introduction to Computational LinguisticsExplains how computers can be programmed to recognize the complex ambiguities of human language. Addresses: current techniques in syntax, semantics, and pragmatics; program listings showing applications in Prolog; and question answering and inference. Targeted at professionals in the artificial inte. |
Contents
Introduction | 1 |
Finitestate techniques | 21 |
Recursive and augmented transition networks | 63 |
Copyright | |
9 other sections not shown
Common terms and phrases
abbreviates actions active edge Addressee airline algorithm ambiguity arg0 arg1 argument ATNs bottom-up bottom-up parser Category1 CF-PSG Chapter chart parser clause computational linguistics context data structure database Dr Chan encode English example Exercise feature fgrep Figure finite-state formal FSTN given goal grammar graph Implementing inactive edge inference rules initial input instance intermediate interpretation kind label left recursion Lexeme lexical entries lexicon logical look macro Mayumi meaning MediCenter natural language node notation noun phrase NP VP nurses objects operator parse tree PATR possible predicate problem Prolog prop2 pushdown transducers recognize recursive relevant represent representation script semantic sentence sequence simple sing slash specify stack strategy string subnetwork symbol syn_tV syntactic syntactic category tion top-down top-down parser transducer transition networks translation traversal unification variable verb phrase verb_form:tensed WFST word WordsN