Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs
We propose a formal model for translating unranked syntactic trees, such as dependency trees, into semantic graphs. These tree-to-graph transducers can serve as a formal basis of transition systems for semantic parsing which recently have been shown to perform very well, yet hitherto lack formalization. Our model features {``}extended{''} rules and an arc-factored normal form, comes with an efficient translation algorithm, and can be equipped with weights in a straightforward manner.
Code (0)
등록된 구현이 없습니다.
Tasks
ARCSemantic ParsingTranslationSimilar Papers 제목 키워드 기반
On the String Translations Produced by Multi Bottom--Up Tree Transducers
2012-01-01 · CL 2012 1
· Daniel Gildea
Machine Translation
Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation
2013-08-01 · ACL 2013 8
· Fabienne Braune, Nina Seemann, Daniel Quernheim, Andreas Maletti
Machine TranslationTranslation
String-to-Tree Multi Bottom-up Tree Transducers
2015-07-01 · IJCNLP 2015 7
· Nina Seemann, Fabienne Braune, Andreas Maletti
Machine Translation
Exact Decoding with Multi Bottom-Up Tree Transducers
2015-09-01 · WS 2015 9
· Daniel Quernheim
Language ModellingMachine Translation
Travatar: A Forest-to-String Machine Translation Engine based on Tree Transducers
2013-08-01 · ACL 2013 8
· Graham Neubig
Machine TranslationTranslation