An efficient context-free parsing algorithm
Communications of the ACM
Understanding Natural Language
Understanding Natural Language
The Theory and Practice of Augmented Transition Network Grammars
Natural Language Communication with Computers
Syntax and semantics in parsing: an application to montague grammar.
Syntax and semantics in parsing: an application to montague grammar.
Translating English into logical form
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
Montagovian Definite Clause Grammar
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
In natural language processing, the question of the appropriate interaction of syntax and semantics during sentence analysis has long been of interest. Montague grammar with its fully formalized syntax and semantics provides a complete, well-defined context in which these questions can be considered. This paper describes how semantics can be used during parsing to reduce the combinatorial explosion of syntactic ambiguity in Montague grammar. A parsing algorithm, called semantic equivalence parsing, is presented and examples of its operation are given. The algorithm is applicable to general non-context-free grammars that include a formal semantic component. The second portion of the paper places semantic equivalence parsing in the context of the very general definition of an interpreted language as a homomorphism between syntactic and semantic algebras (Montague 1970).