An algorithm for generating quantifier scopings
Computational Linguistics
The Constraint Language for Lambda Structures
Journal of Logic, Language and Information
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
An algebra for semantic construction in constraint-based grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Minimal recursion semantics as dominance constraints: translation, evaluation, and analysis
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Unrestricted quantifier scope disambiguation
TextGraphs-6 Proceedings of TextGraphs-6: Graph-based Methods for Natural Language Processing
Expanding the range of tractable scope-underspecified semantic representations
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
| Hi-index | 0.00 |
We give polynomial-time algorithms for satisfiability and enumeration of underspecified semantic representations in a canonical form. This canonical form brings several underspecification formalisms together into a uniform framework (Manshadi et al., 2008), so the algorithms can be applied to any underspecified representation that can be converted to this form. In particular, our algorithm can be applied to Canonical Form Minimal Recursion Semantics (CF-MRS). An efficient satisfiability and enumeration algorithm has been found for a subset of MRS (Niehren and Thater, 2003). This subset, however, is not broad enough to cover all the meaningful MRS structures occurring in practice. CF-MRS, on the other hand, provably covers all MRS structures generated by the MRS semantic composition process.