Recursive transfer

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

• CKY (bottom-up)
• LALR(1) (bottom-up)
• GLR (bottom-up)
• Earley (top-down)

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)

See also

• https://svn.code.sf.net/p/apertium/svn/branches/transfer4