Formal aspects and parsing issues of dependency theory
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Pseudo-projectivity: a polynomially parsable non-projective dependency grammar
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
| Hi-index | 0.00 |
The paper presents a formal lexicalized dependency grammar based on Meaning-Text theory. This grammar associates semantic graphs with sentences. We propose a fragment of a grammar for French, including the description of extractions. The main particularity of our grammar is it that it builds bubble trees as syntactic representations, that is, trees whose nodes can be filled by bubbles, which can contain others nodes. Our grammar needs more complex operations of combination of elementary structures than other lexicalized grammars, such as TAG or CG, but avoids the multiplication of elementary structures and provides linguistically well-motivated treatments.1