An improved redundancy elimination algorithm for underspecified representations
Pages 409 - 416
Abstract
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by large-scale grammars. We evaluate the algorithm on a corpus, and show that it reduces the degree of ambiguity significantly while taking negligible runtime.
References
[1]
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.
[2]
P. Blackburn and J. Bos. 2005. Representation and Inference for Natural Language. A First Course in Computational Semantics. CSLI Publications.
[3]
R. P. Chaves. 2003. Non-redundant scope disambiguation in underspecified semantics. In Proc. 8th ESSLLI Student Session.
[4]
A. Copestake, D. Flickinger, C. Pollard, and I. Sag. 2004. Minimal recursion semantics: An introduction. Journal of Language and Computation. To appear.
[5]
M. Egg, A. Koller, and J. Niehren. 2001. The Constraint Language for Lambda Structures. Logic, Language, and Information, 10.
[6]
D. Flickinger. 2002. On building a more efficient grammar by exploiting types. In J. Tsujii S. Oepen, D. Flickinger and H. Uszkoreit, editors, Collaborative Language Engineering. CSLI Publications, Stanford.
[7]
R. Fuchss, A. Koller, J. Niehren, and S. Thater. 2004. Minimal recursion semantics as dominance constraints: Translation, evaluation, and analysis. In Proc. of the 42nd ACL.
[8]
A. Koller and S. Thater. 2005a. Efficient solving and exploration of scope ambiguities. In ACL-05 Demonstration Notes, Ann Arbor.
[9]
A. Koller and S. Thater. 2005b. The evolution of dominance constraint solvers. In Proceedings of the ACL-05 Workshop on Software, Ann Arbor.
[10]
A. Koller and S. Thater. 2006. Towards a redundancy elimination algorithm for underspecified descriptions. In Proc. 5th Intl. Workshop on Inference in Computational Semantics (ICoS-5).
[11]
A. Koller, J. Niehren, and S. Thater. 2003. Bridging the gap between underspecification formalisms: Hole semantics as dominance constraints. In Proc. 10th EACL.
[12]
J. Niehren and S. Thater. 2003. Bridging the gap between underspecification formalisms: Minimal recursion semantics as dominance constraints. In Proc. of the 41st ACL.
[13]
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 COLING'02.
[14]
K. van Deemter and S. Peters. 1996. Semantic Ambiguity and Underspecification. CSLI, Stanford.
[15]
E. Vestre. 1991. An algorithm for generating non-redundant quantifier scopings. In Proc. of the Fifth EACL, Berlin.
- An improved redundancy elimination algorithm for underspecified representations
Recommendations
Link-Time Path-Sensitive Memory Redundancy Elimination
HPCA '04: Proceedings of the 10th International Symposium on High Performance Computer ArchitectureOptimizations performed at link-time or directly applied to final program executables have received increased attention in recent years. This paper discusses the discovery and elimination of redundant memory operations in the context of a link-time ...
Redundancy Elimination in Distributed Matrix Computation
SIGMOD '22: Proceedings of the 2022 International Conference on Management of DataAs matrix computation becomes increasingly prevalent in large-scale data analysis, distributed matrix computation solutions have emerged. These solutions support query interfaces of linear algebra expressions, which often contain redundant subexpressions,...
Direct and underspecified interpretations of LFG f-structures
COLING '96: Proceedings of the 16th conference on Computational linguistics - Volume 1We describe an approach to interpreting LFG f-structures (Kaplan & Bresnan, 1982) truth-conditionally as underspecified quasi-logical forms. F-structures are either interpreted indirectly in terms of a homomorphic embedding into Quasi Logical Form (QLF) ...
Comments
Information & Contributors
Information
Published In
July 2006
1214 pages
Publisher
Association for Computational Linguistics
United States
Publication History
Published: 17 July 2006
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 85 of 443 submissions, 19%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 220Total Downloads
- Downloads (Last 12 months)39
- Downloads (Last 6 weeks)2
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in