Difference between revisions of "User:David Nemeskey/GSOC progress 2013"

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


=== Compiler ===
=== Compiler ===

==== Code ====

* Read the [https://apertium.svn.sourceforge.net/svnroot/apertium/branches/fomacg/ fomacg] code<ref>Hulden, Mans. 2011. Constraint Grammar parsing with left and right sequential finite transducers. In: Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing, pages 39--47.</ref> and understand what it does.
* Add comments do a little refactoring (e.g. separate function for creating ''@*word@*'' FSTs).
* Check and test if it works on all grammars, fix it if it isn't.

==== Research ====

* Decrease the number of rules applied (see [[User:David_Nemeskey/GSOC_proposal_2013#Detailed work plan|in the proposal]]).
* When and how can rules be merged?


=== Miscellaneous / Extra ===
=== Miscellaneous / Extra ===
Line 11: Line 22:
Write a simple CG grammar for Hungarian, somewhere around 50-150 rules.
Write a simple CG grammar for Hungarian, somewhere around 50-150 rules.


* Read Pasi Tapnainen's The Constraint Grammar Parser CG-2.
* ''Read Pasi Tapnainen's The Constraint Grammar Parser CG-2.''
* Read the contents of cg_material.zip.
* Read the contents of cg_material.zip.
* Study the CG grammar of an Apertium language.
* Study the CG grammar of an Apertium language.

Revision as of 11:58, 29 May 2013

Tasks

XML format

Compiler

Code

  • Read the fomacg code[1] and understand what it does.
  • Add comments do a little refactoring (e.g. separate function for creating @*word@* FSTs).
  • Check and test if it works on all grammars, fix it if it isn't.

Research

  • Decrease the number of rules applied (see in the proposal).
  • When and how can rules be merged?

Miscellaneous / Extra

Hungarian CG grammar

Write a simple CG grammar for Hungarian, somewhere around 50-150 rules.

  • Read Pasi Tapnainen's The Constraint Grammar Parser CG-2.
  • Read the contents of cg_material.zip.
  • Study the CG grammar of an Apertium language.
  • Write a Hungarian grammar that covers the sentences in this sample file
  • The tags will be based on those in KR-code[2]. See the next task.

Hunmorph converter

Write a converter from ocamorph's output to Apertium's format.

  • Again, use the sentences in this sample file as reference.
  • While a C-based converter would definitely be possible, I opted for a foma-based (xfst -- lexc?) implementation, so that this task also serves for practice.

ATT -> lttoolbox compiler

Write an ATT FST format reading for lttoolbox. A useful practice for moving from foma to lttoolbox. Since lttoolbox lacks some of the functionaty needed, the compiler will most likely stay in foma, but lttoolbox might work as the runtime component.

  • ATT format
  • "<spectie> the ATT->lttoolbox thing should be a simple as : beer = t.insertSingleTransduction(alphabet(L'e',L'e'), beer);"

References

  1. ↑ Hulden, Mans. 2011. Constraint Grammar parsing with left and right sequential finite transducers. In: Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing, pages 39--47.
  2. ↑ András Kornai, Péter Rebrus, Péter Vajda, Péter Halácsy, András Rung, Viktor Trón. 2004. Általános célú morfológiai elemző kimeneti formalizmusa (The output formalism of a general-purpose morphological analyzer). In: Proceedings of the 2nd Hungarian Computational Linguistics Conference.
Retrieved from "https://wiki.apertium.org/w/index.php?title=User:David_Nemeskey/GSOC_progress_2013&oldid=41865"