String-to-Tree Multi Bottom-up Tree Transducers
Code (0)
등록된 구현이 없습니다.
Tasks
Machine TranslationSimilar Papers 제목 키워드 기반
On the String Translations Produced by Multi Bottom--Up Tree Transducers
2012-01-01 · CL 2012 1
· Daniel Gildea
Machine Translation
Recursive prosody is not finite-state
2021-08-01 · ACL (SIGMORPHON) 2021 8
· Hossep Dolatian, Aniello De Santo, Thomas Graf
This paper investigates bounds on the generative capacity of prosodic processes, by focusing on the complexity of recursive prosody in coordination contexts in English (Wagner, 2010). Although all phonological processes …
Exact Decoding with Multi Bottom-Up Tree Transducers
2015-09-01 · WS 2015 9
· Daniel Quernheim
Language ModellingMachine 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
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs
2019-09-01 · WS 2019 9
· Johanna Bj{\"o}rklund, Shay B. Cohen, Frank Drewes, Giorgio Satta
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 w…
ARCSemantic ParsingTranslation