Difference between revisions of "Earley-based structural transfer for Apertium"

From Apertium
Jump to navigation Jump to search
m
Line 7: Line 7:
 
* We should check whether this has been done before.
 
* We should check whether this has been done before.
 
* In case there is more than one parse of a sentence, there should be a way to select the most likely.
 
* In case there is more than one parse of a sentence, there should be a way to select the most likely.
  +
  +
==Existing parsers==
  +
  +
Current free-software parsers which might be worth looking at:
  +
  +
* [http://www.agfl.cs.ru.nl/ AGFL parser] (GPL)
   
 
==Further reading==
 
==Further reading==

Revision as of 13:46, 3 August 2007

Perhaps 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.
  • In case there is more than one parse of a sentence, there should be a way to select the most likely.

Existing parsers

Current free-software parsers which might be worth looking at:

Further reading

This paper proposes the use of "pattern-based" context-free grammars as a basis for building machine translation (MT) systems.