Difference between revisions of "Earley-based structural transfer for Apertium"
Jump to navigation
Jump to search
(A new idea for Apertium transfer) |
|||
| 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. |
+ | 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. |
Revision as of 13:12, 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.
