An algebra for semantic construction in constraint-based grammars

Authors:
Ann Copestake;Alex Lascarides;Dan Flickinger
Affiliations:
University of Cambridge, Cambridge, UK;University of Edinburgh, Edinburgh, Scotland, UK;Stanford University, Stanford, CA
Venue:
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Year:
2001

Citing 1
Cited 33

Unification-based semantic interpretation

ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics

Semantic construction in feature-based TAG

EACL '03 Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - Volume 1
The LinGO Redwoods treebank motivation and preliminary applications

COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 2
Coupling CCG and hybrid logic dependency semantics

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
An integrated architecture for shallow and deep processing

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
Efficient deep processing of Japanese

COLING '02 Proceedings of the 3rd workshop on Asian language resources and international standardization - Volume 12
The grammar matrix: an open-source starter-kit for the rapid development of cross-linguistically consistent broad-coverage precision grammars

COLING-GEE '02 Proceedings of the 2002 workshop on Grammar engineering and evaluation - Volume 15
Feature selection for a rich HPSG grammar using decision trees

COLING-02 proceedings of the 6th conference on Natural language learning - Volume 20
Minimal recursion semantics as dominance constraints: translation, evaluation, and analysis

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Constraint-based RMRS construction from shallow grammars

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Acquiring an ontology for a fundamental vocabulary

COLING '04 Proceedings of the 20th international conference on Computational Linguistics
From ubgs to cfgs a practical corpus-driven approach

Natural Language Engineering
Active learning and logarithmic opinion pools for hpsg parse selection

Natural Language Engineering
A minimal recursion semantic analysis of locatives

Computational Linguistics
Integrating a unification-based semantics in a large scale lexicalised tree adjoining grammar for French

COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
Capturing disjunction in lexicalization with extensible dependency grammar

CSLP '06 Proceedings of the Third Workshop on Constraints and Language Processing
Semantic composition with (robust) minimal recursion semantics

DeepLP '07 Proceedings of the Workshop on Deep Linguistic Processing
Slacker semantics: why superficiality, dependency and avoidance of commitment can be the right way to go

EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Semantic representations of syntactically marked discourse status in crosslinguistic perspective

STEP '08 Proceedings of the 2008 Conference on Semantics in Text Processing
Paraphrastic grammars

TextMean '04 Proceedings of the 2nd Workshop on Text Meaning and Interpretation
Flexible semantic composition with DUDES

IWCS-8 '09 Proceedings of the Eighth International Conference on Computational Semantics
Exploiting the Russian national corpus in the development of a Russian resource grammar

AdaptLRTtoND '09 Proceedings of the Workshop on Adaptation of Language Resources and Technology to New Domains
Composition of semantic relations: model and applications

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

FG'09 Proceedings of the 14th international conference on Formal grammar
Unsupervised learning of semantic relation composition

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
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
Implementing the syntax of japanese numeral classifiers

IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
Deep analysis of modern greek

IJCNLP'04 Proceedings of the First international joint conference on Natural Language Processing
Large scale semantic construction for tree adjoining grammars

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
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
Generation for grammar engineering

INLG '12 Proceedings of the Seventh International Natural Language Generation Conference
Composition of semantic relations: Theoretical framework and case study

ACM Transactions on Speech and Language Processing (TSLP)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a framework for formalizing semantic construction within grammars expressed in typed feature structure logics, including HPSG. The approach provides an alternative to the lambda calculus; it maintains much of the desirable flexibility of unification-based approaches to composition, while constraining the allowable operations in order to capture basic generalizations and improve maintainability.