The Metagrammar Compiler: An NLP Application with a Multi-paradigm Architecture

Duchier, Denys; Roux, Joseph Le; Parmentier, Yannick

doi:10.1007/978-3-540-31845-3_15

Cited by 14 publications

(11 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results of the previous section bear relevance to the metagrammar paradigm and specifically to XMG (Duchier, Le Roux, and Parmentier, 2004;Crabbé, 2005). In particular, the forest-based grammar combination operation can be instrumental for defining an alternative semantics for XMG, which we sketch in this section.…”

Section: Forest Combination and Xmgmentioning

confidence: 94%

See 1 more Smart Citation

Associative Grammar Combination Operators for Tree-Based Grammars

Sygal

Wintner

2009

J of Log Lang and Inf

View full text Add to dashboard Cite

Polarized unification grammar (PUG) is a linguistic formalism which uses polarities to better control the way grammar fragments interact. The grammar combination operation of PUG was conjectured to be associative. We show that PUG grammar combination is not associative, and even attaching polarities to objects does not make it order-independent. Moreover, we prove that no non-trivial polarity system exists for which grammar combination is associative. We then redefine the grammar combination operator, moving to the powerset domain, in a way that guarantees associativity. The method we propose is general and is applicable to a variety of tree-based grammar formalisms.

show abstract

Section: Forest Combination and Xmgmentioning

confidence: 94%

“…Moreover, the method we propose is general, and therefore applicable to a variety of formalisms. In section 5 we show that our results can be used to define an alternative semantics for XMG (Duchier, Le Roux, and Parmentier, 2004;Crabbé, 2005), a commonly used metagrammar formalism. We then conclude with suggestions for future research.…”

mentioning

confidence: 99%

Associative Grammar Combination Operators for Tree-Based Grammars

Sygal

Wintner

2009

J of Log Lang and Inf

View full text Add to dashboard Cite

show abstract

“…eXtensible MetaGrammar (XMG, [13,12]) is a tool for designing large scale grammars for natural languages. Following [9], XMG uses colors to sanction tree node identification.…”

Section: Xmg Colorsmentioning

confidence: 99%

The Non-associativity of Polarized Tree-Based Grammars

Cohen-Sygal

Wintner

2007

Computational Linguistics and Intelligent Text Processing

View full text Add to dashboard Cite

Abstract. Polarities are used to sanction grammar fragment combination in high level tree-based formalisms such as eXtenssible MetaGrammar (XMG) and polarized unification grammars (PUG). We show that attaching polarities to tree nodes renders the combination operation non-associative, and in practice leads to overgeneration. We first provide some examples of non-associative combination operators in existing polarity-based formalisms. We then prove that there is no other nontrivial polarity system for which grammar combination is associative. This property of polarities casts doubt on the usability of polarity-based grammars for grammar engineering.

show abstract

“…If a relatively efficient parser is a first condition to get a realistic formalism, a second condition is to be able to build large coverage grammars and lexicons. With an appropriate tool, XMG (Duchier et al 2004), we have built a French interaction grammar with a relatively large coverage (Perrier 2007). This grammar is designed in such a way that it can be linked with a lexicon independent of any formalism.…”

Section: Introductionmentioning

confidence: 99%

Interaction Grammars

Guillaume

Perrier

2009

Res on Lang and Comput

View full text Add to dashboard Cite

Interaction Grammars are a grammatical formalism based on the notion of polarity. Polarities express the resource sensitivity of natural languages by modelling the distinction between saturated and unsaturated syntactic structures. Syntactic composition is represented as a chemical reaction guided by the saturation of polarities. It is expressed in a model-theoretic framework where grammars are constraint systems using the notion of tree description and parsing appears as a process of building tree description models satisfying criteria of saturation and minimality.

show abstract

The Metagrammar Compiler: An NLP Application with a Multi-paradigm Architecture

Cited by 14 publications

References 5 publications

Associative Grammar Combination Operators for Tree-Based Grammars

Associative Grammar Combination Operators for Tree-Based Grammars

The Non-associativity of Polarized Tree-Based Grammars

Interaction Grammars

Contact Info

Product

Resources

About