Ideas for Google Summer of Code/More robust recursive transfer

From Apertium
< Ideas for Google Summer of Code
Revision as of 09:22, 6 February 2024 by Unhammer (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Currently, one has to be very careful in writing recursive transfer rules to ensure they don't get too deep or ambiguous, and that they cover full sentences. See in particular issues 97 and 80. We would like linguists to be able to fearlessly write recursive (rtx) rules based on what makes linguistic sense, and have rtx-proc/rtx-comp deal with the computational/performance side.


Tasks[edit]

  • There has been lots of research on parsing. Document relevant methods that might help solve the issues.
  • Implement solutions to the parse performance issues in the apertium-recursive code-base
  • If there is time, solve other open issues

Coding challenge[edit]

then

  • write a short grammar for a language you know that doesn't have one yet, to get to know the formalism

or

Frequently asked questions[edit]

  • none yet, ask us something! :)

See also[edit]


Further reading[edit]