Name
Abstract | ||
|---|---|---|
Motivated by the task of semantic parsing, we describe a transition system that generalizes standard transition-based dependency parsing techniques to generate a graph rather than a tree. Our system includes a cache with fixed size m, and we characterize the relationship between the parameter m and the class of graphs that can be produced through the graph-theoretic concept of tree decomposition. We find empirically that small cache sizes cover a high percentage of sentences in existing semantic corpora.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1162/COLI_a_00308 | Computational Linguistics |
Field | DocType | Volume |
Transition system,Graph,Cache,Computer science,Tree decomposition,Dependency grammar,Artificial intelligence,Natural language processing,Parsing | Journal | 44 |
Issue | ISSN | Citations |
1 | 0891-2017 | 0 |
PageRank | References | Authors |
0.34 | 25 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Gildea | 1 | 2269 | 193.43 |
| Giorgio Satta | 2 | 902 | 90.85 |
| Xiaochang Peng | 3 | 54 | 5.31 |