Name
Abstract | ||
|---|---|---|
Abstract We develop a finite-state transducer for translating unranked trees into general graphs. This work is motivated by recent advancements in semantic parsing for natural language, where sentences are first mapped into syntactic representations which are tree-shaped, and in a second step these trees are translated into semantic representations which are graphs. We investigate formal properties of our tree-to-graphs transducers and develop a polynomial time algorithm for translating a weighted language of input trees into a packed representation, from which best-score graphs can efficiently be recovered. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/J.TCS.2020.12.012 | FSMNLP |
Field | DocType | Volume |
Graph,Computer science,Top-down and bottom-up design,Theoretical computer science | Conference | 870 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johanna Björklund | 1 | 5 | 6.23 |
| Shay B. Cohen | 2 | 298 | 29.56 |
| F. Drewes | 3 | 104 | 6.85 |
| Giorgio Satta | 4 | 902 | 90.85 |