Extended Tree Transducers in Natural Language Processing
Code (0)
등록된 구현이 없습니다.
Tasks
Machine TranslationSimilar Papers 제목 키워드 기반
Composing extended top-down tree transducers
2012-04-01 · EACL 2012 4
· Aur{\'e}lie Lagoutte, Fabienne Braune, Daniel Quernheim, Andreas Maletti
Machine Translation
Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers
2012-04-01 · WS 2012 4
· Nina Seemann, Daniel Quernheim, Fabienne Braune, Andreas Maletti
Language ModellingMachine Translation
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 ParsingTranslationNatural Language Inference for Arabic Using Extended Tree Edit Distance with Subtrees
2014-02-04
· Maytham Alabbas, Allan Ramsay
Many natural language processing (NLP) applications require the computation of similarities between pairs of syntactic or semantic trees. Many researchers have used tree edit distance for this task, but this technique su…
Natural Language InferenceOn the Compression of Lexicon Transducers
2019-09-01 · WS 2019 9
· Marco Cognetta, Cyril Allauzen, Michael Riley
In finite-state language processing pipelines, a lexicon is often a key component. It needs to be comprehensive to ensure accuracy, reducing out-of-vocabulary misses. However, in memory-constrained environments (e.g., mo…