Earley-based structural transfer for Apertium - Revision history

Francis Tyers: /* Open questions */

2013-10-02T21:21:38Z

Open questions

2013-09-24T06:45:23Z

cat

2012-03-24T11:31:42Z

Category:Documentation in English

2011-09-03T19:41:09Z

Open questions: new name of the page

2008-05-10T14:03:57Z

Open questions

2008-05-10T13:55:35Z

2007-12-22T10:58:29Z

Existing parsers

2007-11-08T08:29:38Z

Change of Takeda's paper link

2007-11-07T20:00:13Z

Change of Sharp & Streiter paper's link

2007-08-08T13:23:44Z

@@ Line 4: / Line 4: @@
 * 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.
+* <s>When would one call the bilingual dictionary? Apertium Level 2 calls it in the first stage.</s>
 * We should check whether this has been done before.
 ::The English → Urdu translation system linked [[Specific resources per language#Urdu|here]] seems to use LFG and Earley-based parsing.

@@ Line 25: / Line 25: @@
 [[Category:Development]]
 [[Category:Documentation in English]]
+[[Category:Transfer]]

← Older revision		Revision as of 11:31, 24 March 2012
Line 24:		Line 24:

	[[Category:Development]]		[[Category:Development]]
			[[Category:Documentation in English]]

@@ Line 6: / Line 6: @@
 * 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.
-::The English → Urdu translation system linked [[Incubator#Urdu|here]] seems to use LFG and Earley-based parsing.
+::The English → Urdu translation system linked [[Specific resources per language#Urdu|here]] seems to use LFG and Earley-based parsing.
 * In case there is more than one parse of a sentence,  there should be a way to select the most likely.

@@ Line 6: / Line 6: @@
 * 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.
+::The English → Urdu translation system linked [[Incubator#Urdu|here]] seems to use LFG and Earley-based parsing.
 * In case there is more than one parse of a sentence,  there should be a way to select the most likely.

@@ Line 18: / Line 18: @@
 * Koichi Takeda [http://acl.ldc.upenn.edu/P/P96/P96-1020.pdf Pattern-Based Context-Free Grammars for Machine Translation] (private access)
 :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://www.iai.uni-sb.de/docs/meta93.pdf Simplifying the Complexity of Machine Translation]
+* Randall Sharp and Oliver Streiter [http://www.iai.uni-sb.de/docs/meta93.pdf Simplifying the Complexity of Machine Translation]
+* J. Earley, (1970) "[http://portal.acm.org/citation.cfm?doid=362007.362035 An efficient context-free parsing algorithm]", ''Communications of the Association for Computing Machinery'', 13:2:94--102, 1970.
 [[Category:Development]]

@@ Line 9: / Line 9: @@
 ==Existing parsers==
+{{main|Parsers}}
 Current free-software parsers which might be worth looking at: