Difference between revisions of "Recursive transfer"

From Apertium
Jump to navigation Jump to search
Line 2: Line 2:


==Deliverables==
==Deliverables==

===Deliverable 1===


* Program which takes output of lt-proc -b (biltrans) and applies a grammar, doing only reordering, no tag changes
* Program which takes output of lt-proc -b (biltrans) and applies a grammar, doing only reordering, no tag changes
Line 7: Line 9:
** The grammar can be specified using a simple text-based CFG grammar formalism, converted into bison and compiled.
** The grammar can be specified using a simple text-based CFG grammar formalism, converted into bison and compiled.


;Input:
<pre>
^Hau<prn><dem><sg>/This<prn><dem><sg>$
^irabazle<n>/winner<n><ND>$
^bat<num><sg>/a<det><ind><sg>$
^en<post>/of<pr>$
^historia<n>/story<n><ND>$
^a<det><art><sg>/the<det><def><sg>$
^izan<vbsint><pri><NR_HU>/be<vbser><pri><NR_HU>$
^.<sent>/.<sent>$
</pre>

;Output:
<pre>
^This<prn><dem><sg>$
^be<vbser><pri><NR_HU>$
^the<det><def><sg>$
^story<n><ND>$
^of<pr>$
^a<det><ind><sg>$
^winner<n><ND>$
^.<sent>$
</pre>


==Questions==
==Questions==

Revision as of 17:00, 2 October 2013

Deliverables

Deliverable 1

  • Program which takes output of lt-proc -b (biltrans) and applies a grammar, doing only reordering, no tag changes
    • The input would be ^sl/tl$ and the output would be ^tl$
    • The grammar can be specified using a simple text-based CFG grammar formalism, converted into bison and compiled.
Input
^Hau<prn><dem><sg>/This<prn><dem><sg>$ 
^irabazle<n>/winner<n><ND>$ 
^bat<num><sg>/a<det><ind><sg>$ 
^en<post>/of<pr>$ 
^historia<n>/story<n><ND>$ 
^a<det><art><sg>/the<det><def><sg>$ 
^izan<vbsint><pri><NR_HU>/be<vbser><pri><NR_HU>$
^.<sent>/.<sent>$
Output
^This<prn><dem><sg>$ 
^be<vbser><pri><NR_HU>$
^the<det><def><sg>$ 
^story<n><ND>$ 
^of<pr>$ 
^a<det><ind><sg>$ 
^winner<n><ND>$ 
^.<sent>$

Questions

  • What to do with a parse-fail.
  • Ambiguous grammars -> can be automatically disambiguated ?
    • Learn shift/reduce using target-language information ?
  • Converting right-recursive to left-recursive grammars.

Algorithms

References

  • Prószéky & Tihanyi (2002) "MetaMorpho: A Pattern-Based Machine Translation System"
  • White (1985) "Characteristics of the METAL machine translation system at Production Stage" (§6)
  • Slocum (1982) "The LRC Machine translation system: An application of State-of-the-Art ..." (p.18)

See also

External links