The Constraint Language for Lambda Structures

Authors:
Markus Egg;Alexander Koller;Joachim Niehren
Affiliations:
Department of Computational Linguistics, University of the Saarland, P.O. Box 15 11 50, 66041 Saarbrü/cken, Germany/ E-mail: egg@coli.uni-sb.de;Department of Computational Linguistics, University of the Saarland, P.O. Box 15 11 50, 66041 Saarbrü/cken, Germany/ E-mail: koller@coli.uni-sb.de;Programming Systems Lab, University of the Saarland, P.O. Box 15 11 50, 66041 Saarbrü/cken, Germany/ E-mail: niehren@ps.uni-sb.de
Venue:
Journal of Logic, Language and Information
Year:
2001

Citing 14
Cited 33

Using descriptions of trees in a tree adjoining grammar

Computational Linguistics
Interpreting cohesive forms in the context of discourse inference

Interpreting cohesive forms in the context of discourse inference
On the Exponent of Periodicity of Minimal Solutions of Context Equation

RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Parallelism Constraints

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
A discourse copying algorithm for ellipsis and anaphora resolution

EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Ellipsis and quantification: a substitutional approach

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
A uniform approach to underspecification and parallelism

ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Constraints over Lambda-Structures in semantic underspecification

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
D-tree grammars

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Monotonic semantic interpretation

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
On underspecified processing of dynamic semantics

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Underspecified beta reduction

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
A polynomial-time fragment of dominance constraints

ACL '00 Proceedings of the 38th Annual Meeting on Association for Computational Linguistics

Dominance constraints with Boolean connectives: a model-eliminative treatment

Theoretical Computer Science - Algebraic methods in language processing
Pure Dominance Constraints

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Beta Reduction Constraints

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Parallelism and Tree Regular Constraints

LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A new algorithm for normal dominance constraints

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An efficient graph algorithm for dominance constraints

Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Well-nested parallelism constraints for ellipsis resolution

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Bridging the gap between underspecification formalisms: hole semantics as dominance constraints

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
Underspecified beta reduction

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Ellipsis resolution with underspecified scope

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Bridging the gap between underspecification formalisms: minimal recursion semantics as dominance constraints

ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Minimal recursion semantics as dominance constraints: translation, evaluation, and analysis

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
An improved redundancy elimination algorithm for underspecified representations

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
A relational syntax-semantics interface based on dependency grammar

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Dominance constraints in stratified context unification

Information Processing Letters
Efficient solving and exploration of scope ambiguities

ACLdemo '05 Proceedings of the ACL 2005 on Interactive poster and demonstration sessions
Determining the consistency of partial tree descriptions

Artificial Intelligence
Dependency Tree Semantics: Branching Quantification in Underspecification

AI*IA '07 Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing
A logic of semantic representations for shallow parsing

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
The evolution of dominance constraint solvers

Software '05 Proceedings of the Workshop on Software
Disambiguating quantifier scope in DTS

IWCS-8 '09 Proceedings of the Eighth International Conference on Computational Semantics
Interaction Grammars

Research on Language and Computation
Improving the quality of text understanding by delaying ambiguity resolution

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
An efficient enumeration algorithm for canonical form underspecified semantic representations

FG'09 Proceedings of the 14th international conference on Formal grammar
A corpus of scope-disambiguated English text

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
Unrestricted quantifier scope disambiguation

TextGraphs-6 Proceedings of TextGraphs-6: Graph-based Methods for Natural Language Processing
Dependency tree semantics

ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Well-nested context unification

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
The other syntax: approaching natural language semantics through logical form composition

CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
Multi-dimensional graph configuration for natural language processing

CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
Describing lambda terms in context unification

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Flexible disambiguation in DTS

CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing
Expanding the range of tractable scope-underspecified semantic representations

SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the Constraint Language for Lambda Structures(CLLS), a first-order language for semantic underspecification thatconservatively extends dominance constraints. It is interpreted overlambda structures, tree-like structures that encode λ-terms. Based onCLLS, we present an underspecified, uniform analysis of scope,ellipsis, anaphora, and their interactions. CLLS solves a variablecapturing problem that is omnipresent in scope underspecification andcan be processed efficiently.