Difference between revisions of "Ideas for Google Summer of Code/Robust recursive transfer"
Jump to navigation
Jump to search
(Created page with ' ==Tasks== # Do a review of the literature on finite-state dependency parsing ==Coding challenge== # Install Apertium (see Minimal installation from SVN) # Parse one or …') |
|||
| Line 1: | Line 1: | ||
| + | {{TOCD}} |
||
| − | |||
==Tasks== |
==Tasks== |
||
| Line 16: | Line 16: | ||
| − | [[Category:Ideas for Google Summer of Code |
+ | [[Category:Ideas for Google Summer of Code|Prototype recursive transfer implementations]] |
Revision as of 14:21, 29 February 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.
