Difference between revisions of "Recursive transfer"
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
{{TOCD}} |
{{TOCD}} |
||
==Deliverables== |
|||
* Program which takes output of lt-proc -b (biltrans) and applies a grammar, doing only reordering, no tag changes |
|||
** The input would be ^sl/tl$ and the output would be ^tl$ |
|||
** The grammar can be specified using a simple text-based CFG grammar formalism, converted into bison and compiled. |
|||
==Questions== |
==Questions== |
||
Revision as of 16:53, 2 October 2013
Deliverables
- Program which takes output of lt-proc -b (biltrans) and applies a grammar, doing only reordering, no tag changes
- The input would be ^sl/tl$ and the output would be ^tl$
- The grammar can be specified using a simple text-based CFG grammar formalism, converted into bison and compiled.
Questions
- What to do with a parse-fail.
- Ambiguous grammars -> can be automatically disambiguated ?
- Learn shift/reduce using target-language information ?
- Converting right-recursive to left-recursive grammars.
Algorithms
References
- Prószéky & Tihanyi (2002) "MetaMorpho: A Pattern-Based Machine Translation System"
- White (1985) "Characteristics of the METAL machine translation system at Production Stage" (§6)
- Slocum (1982) "The LRC Machine translation system: An application of State-of-the-Art ..." (p.18)
