An algorithm for generating quantifier scopings
Computational Linguistics
Prolog and natural-language analysis
Prolog and natural-language analysis
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A logic programming language with Lambda-abstraction, function variables, and simple unification
Proceedings of the international workshop on Extensions of logic programming
Semantic interpretation as higher-order deduction
JELIA '90 Proceedings of the European workshop on Logics in AI
Characterizing mildly context-sensitive grammar formalisms
Characterizing mildly context-sensitive grammar formalisms
Type-driven natural language analysis
Type-driven natural language analysis
Some uses of higher-order logic in computational linguistics
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
Unification-based semantic interpretation
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Quantifier scope and constituency
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
A unification-based semantic interpretation for coordinate constructs
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Quantifier scope and constituency
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
| Hi-index | 0.00 |
Many theories of semantic interpretation use λ-term manipulation to compositionally compute the meaning of a sentence. These theories are usually implemented in a language such as Prolog that can simulate λ-term operations with first-order unification. However, for some interesting cases, such as a Combinatory Categorial Grammar account of coordination constructs, this can only be done by obscuring the underlying linguistic theory with the "tricks" needed for implementation. This paper shows how the use of abstract syntax permitted by higher-order logic programming allows an elegant implementation of the semantics of Combinatory Categorial Grammar, including its handling of coordination constructs.