Conference Proceedings

Efficient solving and exploration of scope ambiguities

ACL-05 - 43rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (2005) 9-12
DOI: 10.3115/1225753.1225756
11Citations
Citations of this article
83Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present the currently most efficient solver for scope underspecification; it also converts between different underspecification formalisms and counts readings. Our tool makes the practical use of large-scale grammars with (underspecified) semantic output more feasible, and can be used in grammar debugging. © 2005 Association for Computational Linguistics.

Cite

CITATION STYLE

APA

Koller, A., & Thater, S. (2005). Efficient solving and exploration of scope ambiguities. In ACL-05 - 43rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (pp. 9–12). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1225753.1225756

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free