The metagrammar compiler: an NLP application with a multi-paradigm architecture

Authors:
Denys Duchier;Joseph Le Roux;Yannick Parmentier
Affiliations:
LORIA, Vandœuvre-lès-Nancy, France;LORIA, Vandœuvre-lès-Nancy, France;LORIA, Vandœuvre-lès-Nancy, France
Venue:
MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz
Year:
2004

Citing 5
Cited 10

Tree-adjoining grammars

Handbook of formal languages, vol. 3
Extended DCG notation: A Tool for

Extended DCG notation: A Tool for
Reasoning with descriptions of trees

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics
Structure sharing in lexicalized tree-adjoining grammars

COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 1
Interaction Grammars

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2

The Non-associativity of Polarized Tree-Based Grammars

CICLing '07 Proceedings of the 8th International Conference on Computational Linguistics and Intelligent Text Processing
Associative Grammar Combination Operators for Tree-Based Grammars

Journal of Logic, Language and Information
SemTAG: a platform for specifying tree adjoining grammars and performing TAG-based semantic construction

ACL '07 Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions
A toolchain for grammarians

COLING '08 22nd International Conference on on Computational Linguistics: Demonstration Papers
TuLiPA: towards a multi-formalism parsing environment for grammar engineering

GEAF '08 Proceedings of the Workshop on Grammar Engineering Across Frameworks
A constraint driven metagrammar

TAGRF '06 Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Interaction Grammars

Research on Language and Computation
Metagrammar redux

CSLP'04 Proceedings of the First international conference on Constraint Solving and Language Processing
Grammatical development with XMG

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
Large scale semantic construction for tree adjoining grammars

LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of metagrammar has been introduced to factorize information contained in a grammar. A metagrammar compiler can then be used to compute an actual grammar from a metagrammar. In this paper, we present a new metagrammar compiler based on 2 important concepts from logic programming, namely (1) the Warren's Abstract Machine and (2) constraints on finite set.