acl acl2010 acl2010-67 acl2010-67-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Alexander Koller ; Stefan Thater
Abstract: We present an efficient algorithm for computing the weakest readings of semantically ambiguous sentences. A corpus-based evaluation with a large-scale grammar shows that our algorithm reduces over 80% of sentences to one or two readings, in negligible runtime, and thus makes it possible to work with semantic representations derived by deep large-scale grammars.
E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, and S. Thiel. 2003. An efficient graph algorithm for dominance constraints. Journal of Algorithms, 48: 194–219. F. Baader and T. Nipkow. 1999. Term rewriting and all that. Cambridge University Press. J. Barwise and R. Cooper. 1981 . Generalized quantifiers and natural language. Linguistics and Philosophy, 4: 159–219. J. Bos. 2008. Let’s not argue about semantics. In Proceedings of the 6th international conference on Language Resources and Evaluation (LREC 2008). M. Butt, H. Dyvik, T. Holloway King, H. Masuichi, and C. Rohrer. 2002. The parallel grammar project. In Proceedings of COLING-2002 Workshop on Grammar Engineering and Evaluation. R. P. Chaves. 2003. Non-redundant scope disambiguation in underspecified semantics. In Proceedings of the 8th ESSLLI Student Session. H. Comon, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. 2007. Tree automata techniques and applications. Available on: http : / /www .grappa . univ-l i le 3 . fr /t at a. l A. Copestake and D. Flickinger. 2000. An opensource grammar development environment and broad-coverage english grammar using HPSG. In Proceedings of the 2nd International Conference on Language Resources and Evaluation (LREC). A. Copestake, D. Flickinger, C. Pollard, and I. Sag. 2005. Minimal recursion semantics: An introduction. Journal of Language and Computation. D. Flickinger, A. Koller, and S. Thater. 2005. A new well-formedness criterion for semantics debugging. In Proceedings of the 12th International Conference on HPSG, Lisbon. M. Gabsdil and K. Striegnitz. 1999. Classifying scope ambiguities. In Proceedings of the First Intl. Workshop on Inference in Computational Semantics. J. Graehl, K. Knight, and J. May. 2008. Training tree transducers. Computational Linguistics, 34(3):391 427. D. Higgins and J. Sadock. 2003. A machine learning approach to modeling scope preferences. Computational Linguistics, 29(1). J. Hobbs. 1983. An improper treatment of quantification in ordinary English. In Proceedings of the 21st Annual Meeting of the Association for Computational Linguistics (ACL’83). R. Kempson and A. Cormack. 1981. Ambiguity and quantification. Linguistics and Philosophy, 4:259– 309. D. Knuth and P. Bendix. 1970. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, Oxford. A. Koller and J. Niehren. 2000. On underspecified processing of dynamic semantics. In Proceedings of the 18th International Conference on Computational Linguistics (COLING-2000). A. Koller and S. Thater. 2005. Efficient solving and exploration of scope ambiguities. In ACL-05 Demonstration Notes, Ann Arbor. A. Koller and S. Thater. 2010. Computing relative normal forms in regular tree languages. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA). A. Koller, J. Niehren, and S. Thater. 2003. Bridging the gap between underspecification formalisms: Hole semantics as dominance constraints. In Proceedings of the 10th EACL. A. Koller, M. Regneri, and S. Thater. 2008. Regular tree grammars as a formalism for scope underspecification. In Proceedings of ACL-08: HLT. P. Lasersohn. 1993. Existence presuppositions and background knowledge. Journal of Semantics, 10: 113–122. B. MacCartney and C. Manning. 2008. Modeling semantic containment and exclusion in natural language inference. In Proceedings of the 22nd International Conference on Computational Linguistics (COLING). R. Montague. 1974. The proper treatment of quantification in ordinary English. In R. Thomason, editor, Formal Philosophy. Selected Papers of Richard Montague. Yale University Press, New Haven. C. Monz and M. de Rijke. 2001. Deductions with meaning. In Michael Moortgat, editor, Logical Aspects of Computational Linguistics, Third International Conference (LACL’98), volume 2014 of LNAI. Springer-Verlag, Berlin/Heidelberg. S. Oepen, K. Toutanova, S. Shieber, C. Manning, D. Flickinger, and T. Brants. 2002. The LinGO Redwoods treebank: Motivation and preliminary applications. In Proceedings of the 19th International Conference on Computational Linguistics (COLING). Uwe Reyle. 1995. On reasoning with ambiguities. In Proceedings of the 7th Conference of the European Chapter of the Association for Computational Linguistics (EACL’95). K. van Deemter. 1996. Towards a logic of ambiguous expressions. In Semantic Ambiguity and Underspecification. CSLI Publications, Stanford. E. Vestre. 1991 . An algorithm for generating nonredundant quantifier scopings. In Proc. of EACL, Berlin. 39