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

From Apertium
Jump to navigation Jump to search
Line 19: Line 19:
:This paper proposes the use of "pattern-based" context-free grammars as a basis for building machine translation (MT) systems.
:This paper proposes the use of "pattern-based" context-free grammars as a basis for building machine translation (MT) systems.
*Randall Sharp and Oliver Streiter [http://66.102.9.104/search?q=cache:QJHB-s5Ze8cJ:www.iai.uni-sb.de/docs/meta93.pdf+earley+algorithm+%22machine+translation%22&hl=en&ct=clnk&cd=7&client=iceweasel-a Simplifying the Complexity of Machine Translation]
*Randall Sharp and Oliver Streiter [http://66.102.9.104/search?q=cache:QJHB-s5Ze8cJ:www.iai.uni-sb.de/docs/meta93.pdf+earley+algorithm+%22machine+translation%22&hl=en&ct=clnk&cd=7&client=iceweasel-a Simplifying the Complexity of Machine Translation]

[[Category:Development]]

Revision as of 13:23, 8 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.