acl acl2013 acl2013-280 acl2013-280-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Mehdi Manshadi ; Daniel Gildea ; James Allen
Abstract: Recent work on statistical quantifier scope disambiguation (QSD) has improved upon earlier work by scoping an arbitrary number and type of noun phrases. No corpusbased method, however, has yet addressed QSD when incorporating the implicit universal of plurals and/or operators such as negation. In this paper we report early, though promising, results for automatic QSD when handling both phenomena. We also present a general model for learning to build partial orders from a set of pairwise preferences. We give an n log n algorithm for finding a guaranteed approximation of the optimal solution, which works very well in practice. Finally, we significantly improve the performance of the pre- vious model using a rich set of automatically generated features.
Hiyan Alshawi and Richard Crouch. 1992. Monotonic semantic interpretation. In Proceedings of Association for Computational Linguistics, pages 32–39. Johan Bos. 1996. Predicate logic unplugged. In Proceedings of the 10th Amsterdam Colloquium, pages 133–143. Nathanael Chambers and Dan Jurafsky. 2008. Jointly combining implicit constraints improves temporal ordering. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP ’08, pages 698–706, Stroudsburg, PA. William W. Cohen, Robert E. Schapire, and Yoram Singer. 1999. Learning to order things. Journal of Artificial Intelligence Research, 10:243–270. Ann Copestake, Alex Lascarides, and Dan Flickinger. 2001. An algebra for semantic construction in constraint-based grammars. In Proceedings of Association for Computational Linguistics ’01, pages 140–147. Marie-Catherine de Marneffe and Christopher D. Manning. 2008. The Stanford typed dependencies representation. In Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation, CrossParser ’08, pages 1–8. Marie-Catherine de Marneffe, Bill MacCartney, and Christopher D. Manning. 2006. Generating typed dependency parses from phrase structure trees. In Proceedings of International Conference on Language Resources and Evaluation ’12. Johannes Furnkranz and Eyke Hullermeier. 2003. Pairwise preference learning and ranking. In Proceedings of the 14th European Conference on Ma- chine Learning, volume 2837, pages 145–156. Andrew Galen and Bill MacCartney. 2004. Statistical resolution of scope ambiguity in natural language. http://nlp.stanford.edu/nlkr/scoper.pdf. Fritz Hamm and Edward W. Hinrichs. 2010. Plurality and Quantification. Studies in Linguistics and Philosophy. Springer. Aurelie Herbelot and Ann Copestake. 2010. Annotating underquantification. In Proceedings of the Fourth Linguistic Annotation Workshop, LAW IV ’ 10, pages 73–81. Derrick Higgins and Jerrold M. Sadock. 2003. A machine learning approach to modeling scope preferences. Computational Linguistics, 29(1):73–96. Eyke Hullermeier, Johannes Furnkranz, Weiwei Cheng, and Klaus Brinker. 2008. Label ranking by learning pairwise preferences. Artificial Intelligence, 172(1617): 1897 1916. Sven Hurum. 1988. Handling scope ambiguities in English. In Proceedings of the second conference on Applied natural language processing, ANLC ’88, pages 58–65. – Thorsten Joachims. 1999. Making large-scale sup- port vector machine learning practical. In Bernhard Sch o¨lkopf, Christopher J. C. Burges, and Alexander J. Smola, editors, Advances in kernel methods, pages 169–184. MIT Press, Cambridge, MA, USA. Dan Klein and Christopher D. Manning. 2003. Accurate unlexicalized parsing. In Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1, ACL ’03, pages 423– 430. Alexander Koller and Stefan Thater. 2010. Computing weakest readings. In Proceedings of the 48th Annual Meeting on Association for Computational Linguistics, Uppsala, Sweden. Alexander Koller, Michaela Regneri, and Stefan Thater. 2008. Regular tree grammars as a formalism for scope underspecification. In Proceedings of Annual Meeting on Association for Computational Linguistics and Human Language Technologies ’08. Fred Landmann. 2000. Events and plurality. Kluwer Academic Publishers, Dordrecht. Percy Liang, Michael I. Jordan, and Dan Klein. 2011. Learning dependency-based compositional semantics. In Proceedings of Association for Computational Linguistics (ACL). Mehdi Manshadi and James Allen. 2011a. Unre- stricted quantifier scope disambiguation. In Proceedings of Association for Computational Linguistics ’11, Workshop on Graph-based Methods for NLP (TextGraph-6). Mehdi Manshadi, James Allen, and Mary Swift. 2011b. A corpus of scope-disambiguated English text. In Proceedings of Association for Computational Linguistics and Human Language Technologies ’11: short papers, pages 141–146. Mehdi Manshadi, James Allen, and Mary Swift. 2012. An annotation scheme for quantifier scope disambiguation. In Proceedings of International Conference on Language Resources and Evaluation ’12. Douglas Moran. 1988. Quantifier scoping in the SRI core language engine. In Proceedings of the 26th Annual Meeting on Association for Computational Linguistics. Lance Ramshaw and Mitch Marcus. 1995. Text Chunking Using Transformation-Based Learning. In Proceedings of the Third Workshop on Very Large Corpora, pages 82–94, Somerset, New Jersey. Prakash Srinivasan and Alexander Yates. 2009. Quantifier scope disambiguation using extracted pragmatic knowledge: preliminary results. In Proceedings of EMNLP ’09. 72