Difference between revisions of "Ideas for Google Summer of Code/Robust recursive transfer"
Jump to navigation
Jump to search
Line 14: | Line 14: | ||
==Previous GSOC projects== |
==Previous GSOC projects== |
||
+ | |||
+ | ==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) |
||
+ | |||
Revision as of 22:23, 3 March 2012
Tasks
- Do a review of the literature on finite-state dependency parsing
Coding challenge
- Install Apertium (see Minimal installation from SVN)
- Parse one or more sentences from the story in your language by hand.
- Formalise some rules to show how the parsed representation could be converted to a representation suitable for generation in another language.
Frequently asked questions
Previous GSOC projects
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)