Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Althaus, E., Duchier, D., Koller, A., Mehlhorn, K., Niehren, J., Thiel, S.: An efficient graph algorithm for dominance constraints. Journal of Algorithms 48, 194–219 (2003)
Bos, J.: Predicate logic unplugged. In: Proc. 10th Amsterdam Colloquium, pp. 133–143 (1996)
Bodirsky, M., Duchier, D., Niehren, J., Miele, S.: An efficient algorithm for weakly normal dominance constraints. In: ACM-SIAM Symposium on Discrete Algorithms. The ACM Press, New York (2004)
Copestake, A., Flickinger, D.: An open-source grammar development environment and broad-coverage English grammar using HPSG. In: Conference on Language Resources and Evaluations (2000)
Copestake, A., Lascarides, A., Flickinger, D.: An Algebra for Semantic Construction in Constraint-Based Grammars. In: ACL 2001, Toulouse, France (2001)
Copestake, A., Flickinger, D., Pollard, C., Sag, I.: Minimal Recursion Semantics: An Introduction. Research on Language and Computation 3(4), 281–332 (2005)
Egg, M., Koller, A., Niehren, J.: The constraint language for lambda structures. Journal of Logic, Language, and Information 10, 457–485 (2001)
Fuchss, R., Koller, A., Niehren, J., Thater, S.: Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. In: ACL 2004, Barcelona, Spain (2004)
Hobbs, J., Shieber, S.M.: An Algorithm for Generating Quantifier Scopings. Computational Linguistics 13, 47–63 (1987)
Manshadi, M., Allen, J., Swift, M.: Toward a Universal Underspecifed Semantic Representation. In: 13th Conference on Formal Grammar (FG 2008), Hamburg, Germany (2008)
Niehren, J., Thater, S.: Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints. In: ACL 2003, Sapporo, Japan (2003)
Oepen, S., Callahan, E., Flickinger, D., Manning, C.: LinGO Redwoods. A Rich and Dynamic Treebank for HPSG. In: Beyond PARSEVAL, LREC 2002, Las Palmas, Spain (2002)
Thater, S.: Minimal Recursion Semantics as Dominance Constraints: Graph-Theoretic Foundation and Application to Grammar Engineering. PhD Thesis, Universität des SaarlandesWoods (2007)
SaarlandesWoods, W.A.: Semantics and Quantification in Natural Language Questiom Answering. Advances in Computers 17, 1–87 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manshadi, M., Allen, J., Swift, M. (2011). An Efficient Enumeration Algorithm for Canonical Form Underspecified Semantic Representations. In: de Groote, P., Egg, M., Kallmeyer, L. (eds) Formal Grammar. FG 2009. Lecture Notes in Computer Science(), vol 5591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20169-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-20169-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20168-4
Online ISBN: 978-3-642-20169-1
eBook Packages: Computer ScienceComputer Science (R0)