Ideas for Google Summer of Code/Robust recursive transfer

Tasks

1. Do a review of the literature on finite-state dependency parsing

Coding challenge

1. Install Apertium (see Minimal installation from SVN)
2. Parse one or more sentences from the story in your language by hand.
3. Formalise some rules to show how the parsed representation could be converted to a representation suitable for generation in another language.

Further reading

• Elworthy, D. (1999) "A Finite-State Parser with Dependency Structure Output"
• Öflazer, K. (1999) "Dependency Parsing with an Extended Finite State Approach"
• Alshawi, H., Douglas, S., Bangalore, S. (2000) "Learning Dependency Translation Models as Collections of Finite-State Head Transducers". Computational Linguistics 26(1)