Paper published in a book (Scientific congresses and symposiums)
Syntactic polygraphs - A formalism extending both constituency and dependency
Kahane, Sylvain; Mazziotta, Nicolas
2015In Kuhlmann, Marco; Kanazawa, Makoto; Kobele, Gregory M. (Eds.) Proceedings of the 14th Meeting on Mathematics of Language (MOL 2015)
Peer reviewed
 

Files


Full Text
MOL-34.pdf
Author preprint (271.31 kB)
Request a copy

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
Polygraph; dependency; constituency; syntax; formalism; tree
Abstract :
[en] Syntactic analyses describe grouping operations that explain how words are combined to form utterances. The nature of these operations depends on the approach. In a constituency-based approach, grouping operations are ordered, or stratified, part-whole relations. In a dependency-based approach, grouping operations identify a governor (or head), i.e. they are directed hierarchical relations between words. It is possible to convert a constituency tree into a dependency tree by dereifying the nodes, by identifying the governor and by removing the stratification of the part-whole relations. Polygraphs combine the two types of information into a single structure and are therefore a more powerful formalism. By relaxing constraints, polygraphs also allow to underspecify both kinds of information.
Disciplines :
Mathematics
Languages & linguistics
Author, co-author :
Kahane, Sylvain
Mazziotta, Nicolas  ;  Université de Liège > Département de langues et littératures romanes > Département de langues et littératures romanes
Language :
English
Title :
Syntactic polygraphs - A formalism extending both constituency and dependency
Publication date :
2015
Event name :
14th Meeting on Mathematics of Language (MOL 2015)
Event place :
Chicago, United States
Event date :
from 25-07-2015 to 26-07-2015
Audience :
International
Main work title :
Proceedings of the 14th Meeting on Mathematics of Language (MOL 2015)
Editor :
Kuhlmann, Marco
Kanazawa, Makoto
Kobele, Gregory M.
Publisher :
Association for Computational Linguistics
Pages :
152-164
Peer reviewed :
Peer reviewed
Commentary :
Full paper accepted
Available on ORBi :
since 18 May 2015

Statistics


Number of views
97 (6 by ULiège)
Number of downloads
1 (1 by ULiège)

Scopus citations®
 
19
Scopus citations®
without self-citations
9

Bibliography


Similar publications



Contact ORBi