Name
Abstract | ||
|---|---|---|
We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at most 1, with the same complexity as the best existing parsers for constituency formalisms of equivalent generative power; all well-nested structures with gap degree bounded by any constant k; and a new class of structures with gap degree up to k that includes some ill-nested structures. The third case includes all the gap degree k structures in a number of dependency treebanks. |
Year | Venue | Keywords |
|---|---|---|
2009 | EACL | non-projective dependency structure,dependency treebanks,gap degree k structure,existing parsers,constant k,gap degree,ill-nested structure,constituency formalisms,non-projective dependency formalisms,equivalent generative power,well-nested structure |
Field | DocType | Citations |
Generative power,Computer science,Theoretical computer science,Parsing,Rotation formalisms in three dimensions,Projective test,Bounded function | Conference | 16 |
PageRank | References | Authors |
0.85 | 17 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Gómez-Rodríguez | 1 | 347 | 41.18 |
| David J. Weir | 2 | 840 | 83.84 |
| John Carroll | 3 | 1971 | 222.19 |