Paper: Efficient Solving And Exploration Of Scope Ambiguities

ACL ID P05-3003
Title Efficient Solving And Exploration Of Scope Ambiguities
Venue Annual Meeting of the Association of Computational Linguistics
Session System Demonstration
Year 2005
Authors

We present the currently most efficient solver for scope underspecification; it also converts between different underspecifica- tion 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.