An algorithm for generating quantifier scopings
Computational Linguistics
Categorial semantics and scoping
Computational Linguistics
Computational Linguistics
Unification in a &lgr;-calculus with intersection types
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Training and scaling preference functions for disambiguation
Computational Linguistics
Unification encodings of grammatical notations
Computational Linguistics
Quantifiers, Anaphora, and Intensionality
Journal of Logic, Language and Information
Corrections and Higher-Order Unification
Natural Language Processing and Speech Technology, Results of the 3rd KONVENS Conference
Decidable Higher-Order Unification Problems
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Ambiguity and reasoning
Deriving database queries from logical forms by abductive definition expansion
ANLC '92 Proceedings of the third conference on Applied natural language processing
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A theory of parallelism and the case of VP ellipsis
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
On interpreting f-structures as UDRSs
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Some uses of higher-order logic in computational linguistics
ACL '86 Proceedings of the 24th annual meeting on Association for Computational Linguistics
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
Higher-Order Coloured Unification and natural language semantics
ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics
Monotonic semantic interpretation
ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
A quantifier scoping algorithm without a Free Variable Constraint
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Reversible resolution with an application to paraphrasing
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 1
Focus and Higher-Order Unification
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
Computing parallelism in discourse
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
| Hi-index | 0.00 |
This paper describes a formalism and implementation for the interpretation and generation of sentences containing context-dependent constructs like determiners, pronouns, focus, and ellipsis. A variant of quasi-logical form is used as an underspecified meaning representation, related to resolved logical forms via conditional equivalences. These equivalences define the interpretation of contextually dependent constructs with respect to a given context. Higher-order unification and abduction are used in relating expressions to contexts. The conditional equivalences can be used unchanged in both the interpretation and the generation direction.