Abstract
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.
Cite
CITATION STYLE
Kahane, S. (2001). A fully lexicalized grammar for french based on meaning-text theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2004, pp. 18–31). Springer Verlag. https://doi.org/10.1007/3-540-44686-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
