Ideas for Google Summer of Code/More robust recursive transfer

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

• 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

• Install Apertium (see Minimal installation from SVN)
• Compile apertium-recursive from source

then

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

or

• Add a compiler warning, e.g. https://github.com/apertium/apertium-recursive/issues/89 https://github.com/apertium/apertium-recursive/issues/78

Frequently asked questions

• none yet, ask us something! :)

See also

• Ideas_for_Google_Summer_of_Code/Robust_recursive_transfer The first GsoC recursive transfer project