Syntax of Programming Languages: Theory and Practice
Syntax of Programming Languages: Theory and Practice
ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING
ON MEMORY LIMITATIONS IN NATURAL LANGUAGE PROCESSING
Coping with syntactic ambiguity or how to put the block in the box on the table
Computational Linguistics
Using restriction to extend parsing algorithms for complex-feature-based formalisms
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
GE-CMU: description of the SHOGUN system used for MUC-5
MUC5 '93 Proceedings of the 5th conference on Message understanding
SRI International: description of the FASTUS system used for MUC-4
MUC4 '92 Proceedings of the 4th conference on Message understanding
Pattern matching in a linguistically-motivated text understanding system
HLT '94 Proceedings of the workshop on Human Language Technology
TIPSTER '93 Proceedings of a workshop on held at Fredericksburg, Virginia: September 19-23, 1993
Pattern matching and discourse processing in information extraction from Japanese text
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Grammars for spoken language systems are subject to the conflicting requirements of language modeling for recognition and of language analysis for sentence interpretation. Current recognition algorithms can most directly use finite-state acceptor (FSA) language models. However, these models are inadequate for language interpretation, since they cannot express the relevant syntactic and semantic regularities. Augmented phrase structure grammar (APSG) formalisms, such as unification grammars, can express many of those regularities, but they are computationally less suitable for language modeling, because of the inherent cost of computing state transitions in APSG parsers.