Difference between revisions of "Earley-based structural transfer for Apertium"
Jump to navigation
Jump to search
(Added some more ideas) |
|||
| Line 1: | Line 1: | ||
| − | Perhaps [Earley's algorithm http://en.wikipedia.org/wiki/Earley's_algorithm] to parse context-free grammars (which has a left-to-right longest-match philosophy as Apertium) could be used to perform more complex syntactical transformations; this could be useful for distant language pairs. |
+ | Perhaps [Earley's algorithm http://en.wikipedia.org/wiki/Earley's_algorithm] to parse context-free grammars (which has a left-to-right longest-match philosophy as Apertium) could be used to perform more complex syntactical transformations; this could be useful for distant language pairs containing embedded structures. |
| + | |||
| + | Open questions: |
||
| + | |||
| + | * Currently, Apertium uses text streams to communicate. I assume this would not be possible here. |
||
| + | * When would one call the bilingual dictionary? Apertium Level 2 calls it in the first stage. |
||
| + | * We should check whether this has been done before. |
||
Revision as of 13:19, 20 May 2007
Perhaps [Earley's algorithm http://en.wikipedia.org/wiki/Earley's_algorithm] to parse context-free grammars (which has a left-to-right longest-match philosophy as Apertium) could be used to perform more complex syntactical transformations; this could be useful for distant language pairs containing embedded structures.
Open questions:
- Currently, Apertium uses text streams to communicate. I assume this would not be possible here.
- When would one call the bilingual dictionary? Apertium Level 2 calls it in the first stage.
- We should check whether this has been done before.
