An Efficient Enumeration Algorithm for Canonical Form Underspecified Semantic Representations
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 85-101
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Minimal Recursion Semantics: An IntroductionResearch on Language and Computation, 2005
- Minimal recursion semantics as dominance constraints2004
- An efficient graph algorithm for dominance constraintsJournal of Algorithms, 2003
- Bridging the gap between underspecification formalisms2003
- The Constraint Language for Lambda StructuresJournal of Logic, Language and Information, 2001
- An algebra for semantic construction in constraint-based grammars2001
- Semantics and Quantification in Natural Language Question Answering1978