Synchronous Linear Context-Free Rewriting Systems for Machine Translation
Code (0)
등록된 구현이 없습니다.
Tasks
Machine TranslationTranslationSimilar Papers 제목 키워드 기반
Efficient parsing with Linear Context-Free Rewriting Systems
2012-04-01 · EACL 2012 4
· Andreas van Cranenburgh
On the Parameterized Complexity of Linear Context-Free Rewriting Systems
2013-08-01 · WS 2013 8
· Martin Berglund, Henrik Bj{\"o}rklund, Frank Drewes
Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems
2013-01-01 · CL 2013 1
· Laura Kallmeyer, Wolfgang Maier
Re-thinking Supertags in Linear Context-free Rewriting Systems for Constituency Parsing
2021-11-16 · ACL ARR November 2021 11
· Anonymous
Recently, a supertagging-based approach for parsing discontinuous constituent trees with linear context-free rewriting systems (LCFRS) was introduced. We reformulate their algorithm for the extraction of supertags from t…
Constituency ParsingLexicalization of Probabilistic Linear Context-free Rewriting Systems
2020-07-01 · WS 2020 7
· Richard M{\"o}rbitz, Thomas Ruprecht
In the field of constituent parsing, probabilistic grammar formalisms have been studied to model the syntactic structure of natural language. More recently, approaches utilizing neural models gained lots of traction in t…