Difference between revisions of "Ideas for Google Summer of Code"

From Apertium
Jump to navigation Jump to search
 
(782 intermediate revisions by 63 users not shown)
Line 1: Line 1:
{{TOCD}}
This is the ideas page for [[Google Summer of Code]], here you can find ideas on interesting projects that would make Apertium more useful for people and improve or expand our functionality. If you have an idea please add it below, if you think you could mentor someone in a particular area &mdash; or just have interests or ideas for that, add your name to "Interested parties" using <nowiki>~~~</nowiki>
This is the ideas page for [[Google Summer of Code]], here you can find ideas on interesting projects that would make Apertium more useful for people and improve or expand our functionality.


'''Current Apertium contributors''': If you have an idea please add it below, if you think you could mentor someone in a particular area, add your name to "Interested mentors" using <code><nowiki>~~~</nowiki></code>.
Maybe take a look at some [http://xixona.dlsi.ua.es/bugzilla/ open bugs] ?


'''Prospective GSoC contributors''': The page is intended as an overview of the kind of projects we have in mind. If one of them particularly piques your interest, please come and discuss with us on <code>#apertium</code> on <code>irc.oftc.net</code> ([[IRC|more on IRC]]), mail the [[Contact|mailing list]], or draw attention to yourself in some other way.
Priority = 1 (High) ... 5 (Low)


Note that if you have an idea that isn't mentioned here, we would be very interested to hear about it.
{|class="wikitable sortable"
! Task !! Difficulty !! Priority !! Description !! Rationale !! Requirements !! Interested<br/>parties
|-
| '''Improve interoperability''' || Medium || || Either to modify Apertium to accept different formats, to modify the other tools to accept the Apertium format, or alternatively write some kind of generic "glue" code that converts between them. || There is a lot of great free software that could be used with the Apertium engine. For example the [http://www.ims.uni-stuttgart.de/projekte/gramotron/SOFTWARE/SFST.html Stuttgart FST] (SFST)<ref>Free software, GPL licensed</ref> tools for morphological analysis/generation could be used in place of [[lttoolbox]], and the [http://visl.sdu.dk/constraint_grammar.html constraint grammars] from VISL<ref>Free software, GPL incompatible (MPL variant)</ref> could be used in place of apertium-tagger. Unfortunately these, along with many other tools have incompatible input/output formats. || C, C++, XML || [[User:Francis Tyers|Francis Tyers]]
|-
| '''Accent and diacritic'''<br/>'''restoration''' || Medium || || Create an optional module to restore diacritics and accents on incoming text. || Many languages use diacritics and accents in normal writing, and Apertium is designed to use these, however in some places, especially for example. instant messaging, irc, searching in the web etc. these are often not used or untyped. This causes problems as for the engine, ''traduccion'' is not the same as ''traducción''. || C, C++, XML, familiarity with linguistic issues || [[User:Francis Tyers|Francis Tyers]]
|-
| '''Handling texts without'''<br/>'''accents or diacritics''' || Medium || || Modify the linguistic data in an Apertium language-pair package so that it can accept text without accents or diacritics (or partially diacriticized). No programming expected. Just dictionary modification and retraining. The task may constitute an alternative solution to the problem in the previous task. || see: Accent and diacritic restoration || Perl or Python, familiarity with linguistic issues. || [[User:Mlforcada|Mlforcada]]
|-
| '''Porting''' || Medium || || Port Apertium to Windows and Mac OS/X complete with nice installers and all that jazz. Apertium currently compiles on Windows (see [[Apertium on Windows]]), but we'd like to see it compile with a free toolchain. || While we all might use GNU/Linux, there are a lot of people out there who don't, some of them use Microsoft's Windows, others use Mac OS. It would be nice for these people to be able use Apertium too. || C++, autotools, experience in programming on Windows or Mac || [[User:Francis Tyers|Francis Tyers]]
|-
| '''Lexical selection''' || Very High || || Write a prototype lexical selection module for Apertium using a combination of rule-based and statistical approaches. || Lexical selection is the task of choosing a sense (meaning) for a word out of a number of possible senses (related to [[word sense disambiguation]]), when languages are close, they often share semantic ambiguity, when they are further apart they do not, so for example Spanish "estación" can be either "station", "season" or "resort" in English. Lexical selection is the task of choosing the right one. || C++, XML, good knowledge of statistics. ||
|-
| '''Interfaces''' || Low || || Create plugins or extensions for popular free software applications to include support for translation using Apertium. We'd expect at least OpenOffice and Firefox, but to start with something more easy we have half-finished plugins for Gaim and XChat that could use some love. The more the better! || Apertium currently runs as a stand alone translator. It would be great if it was integrated in other free software applications. For example so instead of copy/pasting text out of your email, you could just click a button and have it translated in place. || Depends on the application chosen, but probably C, C++, Python or Perl. || [[User:Francis Tyers|Francis Tyers]]
|-
| '''Sliding window based'''<br/>'''part-of-speech tagging''' || High || || Writing a complete drop-in replacement for the Apertium part-of-speech tagger based on the sliding-window part-of-speech tagger of Sánchez-Villamil et al. (2004) [http://www.dlsi.ua.es/~mlf/docum/sanchezvillamil04p.pdf] and Sánchez-Villamil et al. (2005) [http://www.dlsi.ua.es/~mlf/docum/sanchezvillamil05p.pdf] (Apertium currently uses hidden Markov models). The specification file should be as similar as possible as the one used now. || The taggers described are very intuitive and may easily be turned into a compact set of finite-state rules (no need to handle probabilities after training), and may be trained in an unsupervised manner. Depending on the language, the sliding window of words to be analyzed may be configured to suit it. || C or C++, basic knowledge of the grammar of the language(s) involved || [[User:Mlforcada|Mlforcada]]
|-
| '''Documentation''' || Low || || Improving, updating and adding to the existing Apertium documentation. Particularly, a HOWTO for writing transfer rules. This will involve either selecting a current language pair with little-transfer, or creating a new language pair, and documenting how you approach writing rules. || Apertium has (or so we've been told) pretty good documentation, but as everyone knows, documentation can always be improved. For example: at the moment we're lacking HOWTO style documentation for transfer rules. || XML, good grammatical knowledge of the syntax of the language pair you're approaching. || [[User:Francis Tyers|Francis Tyers]]
|-
| '''Three-level'''<br/>'''transfer training''' || Very High || || Re-working apertium-transfer-training-tools to generate rules for three-level transfer (chunk, interchunk, postchunk), currently it only generates single-level rules. This would also involve porting it to use Unicode || Apertium-transfer-training-tools is a cool piece of software that generates shallow-transfer rules from aligned parallel corpora. It could greatly speed up the creation of new language pairs by generating rules that would otherwise have to be written by human linguists. || C++, knowledge of Giza++, Perl considered a plus. ||
|-
| '''Automated lexical'''<br/>'''extraction''' || High || || Writing a C++ wrapper around Markus Forsberg's [http://www.cs.chalmers.se/~markus/extract/ Extract] tool (version 2.0) as a library to allow it to be used with Apertium paradigms and TSX files as input into its paradigms and constraints. || One of the things that takes a lot of time when creating a new language pair is constructing the [[monodix|monodices]]. The extract tool can greatly reduce the time this takes by matching lemmas to paradigms based on distribution in a corpus. || Haskell, C++, XML || [[User:Francis Tyers|Francis Tyers]]
|-
| '''Generating grammar'''<br/>'''checkers''' || Medium || || The data that come with Apertium (morphological analysers) could be used to create grammar checkers. This task would be to work on an automatic converter for Apertium formats to other popular grammar checker formats, or alternatively work on a standalone grammar checker. Maybe using something like [http://www.languagetool.org/ languagetool]. || Grammar checkers can be useful, for languages other than English moreso. They are one of the "must have" items of language technology. If we can re-use Apertium data for this purpose it will help both the project (by making creating new language pairs more rewarding) and the language communities (by making more useful software). || XML, whatever programming language and natural language are used for testing. || [[User:Francis Tyers|Francis Tyers]]
|-
| '''Support for agglutinative'''<br/>'''languages''' || High || || Propose a new dictionary format that is suited to languages with agglutinative morphology and modify the morphological compiler/analyser. || Our dictionary format isn't particularly suited to agglutinative languages, and those with complex morphologies. There are many of these types of languages in the world, so it would be good to support them better. || C++, XML, knowledge of a language with these features (e.g. Finnish, Basque, Turkish, Estonian, Aymara, etc.) ||
|-
| '''Complex multiwords''' || High || || Write a bidirectional module for specifying complex multiword units, for example ''dirección general'' and ''zračna luka''. See ''[[Multiwords]]'' for more information. || Although in the Romance languages it is not a big problem, as soon as you start to get to languages with cases (e.g. Serbo-Croatian, Slovenian, German, etc.) the problem comes that you can't define a multiword of <code>adj nom</code> because the adjective has a lot of inflection. || C, C++, XML || [[User:Francis Tyers|Francis Tyers]]
|-
|}


Here are some more things you could look at:
==Notes==
<references/>
==Further reading==


* [[Top tips for GSOC applications]]
;Accent and diacritic restoration
* Get in contact with one of our long-serving [[List of Apertium mentors|mentors]] &mdash; they are nice, honest!
* Simard, Michel (1998). "Automatic Insertion of Accents in French Texts". ''Proceedings of EMNLP-3. Granada, Spain''.
* Pages in the [[:Category:Development|development category]]
* Rada F. Mihalcea. (2002). "Diacritics Restoration: Learning from Letters versus Learning from Words". ''Lecture Notes in Computer Science'' 2276/2002 pp. 96--113
* Resources that could be converted or expanded in the [[incubator]]. Consider doing or improving a language pair (see [[incubator]], [[nursery]] and [[staging]] for pairs that need work)
* "G. De Pauw, P. W. Wagacha; G.M. de Schryver (2007) "Automatic diacritic restoration for resource-scarce languages". ''Proceedings of Text, Speech and Dialogue, Tenth International Conference''. pp. 170--179
* Unhammer's [[User:Unhammer/wishlist|wishlist]]
<!--* The open issues [https://github.com/search?q=org%3Aapertium&state=open&type=Issues on Github] - especially the [https://github.com/search?q=org%3Aapertium+label%3A%22good+first+issue%22&state=open&type=Issues Good First Issues]. -->


__TOC__
;Lexical selection
* Ide, N. and Véronis, J. (1998) "[http://sites.univ-provence.fr/veronis/pdf/1998wsd.pdf Word Sense Disambiguation: The State of the Art]". ''Computational Linguistics'' 24(1)


If you're a prospective GSoC contributor trying to propose a topic, the recommended way is to request a wiki account and then go to <pre>http://wiki.apertium.org/wiki/User:[[your username]]/GSoC2023Proposal</pre> and click the "create" button near the top of the page. It's also nice to include <code><nowiki>[[</nowiki>[[:Category:GSoC_2023_student_proposals|Category:GSoC_2023_student_proposals]]<nowiki>]]</nowiki></code> to help organize submitted proposals.
;Sliding-window based part-of-speech tagging
* [http://es.wikipedia.org/wiki/Desambiguaci%C3%B3n_l%C3%A9xica_basada_en_ventana_deslizante Wikipedia: Desambiguación léxica basada en ventana deslizante] (in Spanish)
* Sanchez-Villamil, E., Forcada, M. L., and Carrasco, R. C. (2005). "[http://www.dlsi.ua.es/~mlf/docum/sanchezvillamil04p.pdf Unsupervised training of a finite-state sliding-window part-of-speech tagger]". ''Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence'', vol. 3230, p. 454-463


== Language Data ==
;Automated lexical extraction


Can you read or write a language other than English (and we do mean any language)? If so, you can help with one of these and we can help you figure out the technical parts.
* M. Forsberg H. Hammarström A. Ranta. "[http://www.cs.chalmers.se/~markus/FinTAL2006.pdf Morphological Lexicon Extraction from Raw Text Data]". ''FinTAL'' 2006, LNAI 4139, pp. 488--499.


{{IdeaSummary
;Support for agglutinative languages
| name = Develop a morphological analyser
| difficulty = easy
| size = either
| skills = XML or HFST or lexd
| description = Write a morphological analyser and generator for a language that does not yet have one
| rationale = A key part of an Apertium machine translation system is a morphological analyser and generator. The objective of this task is to create an analyser for a language that does not yet have one.
| mentors = [[User:Francis Tyers|Francis Tyers]], [[User:Firespeaker|Jonathan Washington]], [[User: Sevilay Bayatlı|Sevilay Bayatlı]], Hossep, nlhowell, [[User:Popcorndude]]
| more = /Morphological analyser
}}


{{IdeaSummary
* Beesley, K. R and Karttunen, L. (2000) "[http://www2.parc.com/istl/members/karttune/publications/comprep/comprep.html Finite-State Non-Concatenative Morphotactics]". ''SIGPHON-2000, Proceedings of the Fifth Workshop of the ACLSpecial Interest Group in Computational Phonology'', pp. 1--12,
| name = apertium-separable language-pair integration
| difficulty = Medium
| size = small
| skills = XML, a scripting language (Python, Perl), some knowledge of linguistics and/or at least one relevant natural language
| description = Choose a language you can identify as having a good number of "multiwords" in the lexicon. Modify all language pairs in Apertium to use the [[Apertium-separable]] module to process the multiwords, and clean up the dictionaries accordingly.
| rationale = Apertium-separable is a newish module to process lexical items with discontinguous dependencies, an area where Apertium has traditionally fallen short. Despite all the module has to offer, many translation pairs still don't use it.
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Popcorndude]]
| more = /Apertium separable
}}

{{IdeaSummary
| name = Bring an unreleased translation pair to releasable quality
| difficulty = Medium
| size = large
| skills = shell scripting
| description = Take an unstable language pair and improve its quality, focusing on testvoc
| rationale = Many Apertium language pairs have large dictionaries and have otherwise seen much development, but are not of releasable quality. The point of this project would be bring one translation pair to releasable quality. This would entail obtaining good naïve coverage and a clean [[testvoc]].
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Seviay Bayatlı|Sevilay Bayatlı]], [[User:Unhammer]], [[User:hectoralos|Hèctor Alòs i Font]]
| more = /Make a language pair state-of-the-art
}}

{{IdeaSummary
| name = Develop a prototype MT system for a strategic language pair
| difficulty = Medium
| size = large
| skills = XML, some knowledge of linguistics and of one relevant natural language
| description = Create a translation pair based on two existing language modules, focusing on the dictionary and structural transfer
| rationale = Choose a strategic set of languages to develop an MT system for, such that you know the target language well and morphological transducers for each language are part of Apertium. Develop an Apertium MT system by focusing on writing a bilingual dictionary and structural transfer rules. Expanding the transducers and disambiguation, and writing lexical selection rules and multiword sequences may also be part of the work. The pair may be an existing prototype, but if it's a heavily developed but unreleased pair, consider applying for "Bring an unreleased translation pair to releasable quality" instead.
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Sevilay Bayatlı| Sevilay Bayatlı]], [[User:Unhammer]], [[User:hectoralos|Hèctor Alòs i Font]]
| more = /Adopt a language pair
}}

{{IdeaSummary
| name = Add a new variety to an existing language
| difficulty = easy
| size = either
| skills = XML, some knowledge of linguistics and of one relevant natural language
| description = Add a language variety to one or more released pairs, focusing on the dictionary and lexical selection
| rationale = Take a released language, and define a new language variety for it: e.g. Quebec French or Provençal Occitan. Then add the new variety to one or more released language pairs, without diminishing the quality of the pre-existing variety(ies). The objective is to facilitate the generation of varieties for languages with a weak standardisation and/or pluricentric languages.
| mentors = [[User:hectoralos|Hèctor Alòs i Font]], [[User:Firespeaker|Jonathan Washington]],[[User:piraye|Sevilaybayatlı]]
| more = /Add a new variety to an existing language
}}

{{IdeaSummary
| name = Leverage and integrate language preferences into language pairs
| difficulty = easy
| size = medium
| skills = XML, some knowledge of linguistics and of one relevant natural language
| description = Update language pairs with lexical and orthographical variations to leverage the new [[Dialectal_or_standard_variation|preferences]] functionality
| rationale = Currently, preferences are implemented via language variant, which relies on multiple dictionaries, increasing compilation time exponentially every time a new preference gets introduced.
| mentors = [[User:Xavivars|Xavi Ivars]] [[User:Unhammer]]
| more = /Use preferences in pair
}}

{{IdeaSummary
| name = Add Capitalization Handling Module to a Language Pair
| difficulty = easy
| size = small
| skills = XML, knowledge of some relevant natural language
| description = Update a language pair to make use make use of the new [[Capitalization_restoration|Capitalization handling module]]
| rationale = Correcting capitalization via transfer rules is tedious and error prone, but putting them in a separate set of rules should allow them to be handled in a more concise and maintainable way. Additionally, it is possible that capitalization rule could be moved to monolingual modules, thus reducing development effort on translators.
| mentors = [[User:Popcorndude]]
| more = /Capitalization
}}

== Data Extraction ==

A lot of the language data we need to make our analyzers and translators work already exists in other forms and we just need to figure out how to convert it. If you know of another source of data that isn't listed, we'd love to hear about it.

{{IdeaSummary
| name = dictionary induction from wikis
| difficulty = Medium
| size = either
| skills = MySQL, mediawiki syntax, perl, maybe C++ or Java; Java, Scala, RDF, and DBpedia to use DBpedia extraction
| description = Extract dictionaries from linguistic wikis
| rationale = Wiki dictionaries and encyclopedias (e.g. omegawiki, wiktionary, wikipedia, dbpedia) contain information (e.g. bilingual equivalences, morphological features, conjugations) that could be exploited to speed up the development of dictionaries for Apertium. This task aims at automatically building dictionaries by extracting different pieces of information from wiki structures such as interlingual links, infoboxes and/or from dbpedia RDF datasets.
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Popcorndude]]
| more = /Dictionary induction from wikis
}}

{{IdeaSummary
| name = Dictionary induction from parallel corpora / Revive ReTraTos
| difficulty = Medium
| size = medium
| skills = C++, perl, python, xml, scripting, machine learning
| description = Extract dictionaries from parallel corpora
| rationale = Given a pair of monolingual modules and a parallel corpus, we should be able to run a program to align tagged sentences and give us the best entries that are missing from bidix. [[ReTraTos]] (from 2008) did this back in 2008, but it's from 2008. We want a program which builds and runs in 2022, and does all the steps for the user.
| mentors = [[User:Unhammer]], [[User:Popcorndude]]
| more = /Dictionary induction from parallel corpora
}}

{{IdeaSummary
| name = Extract morphological data from FLEx
| difficulty = hard
| size = large
| skills = python, XML parsing
| description = Write a program to extract data from [https://software.sil.org/fieldworks/ SIL FieldWorks] and convert as much as possible to monodix (and maybe bidix).
| rationale = There's a lot of potentially useful data in FieldWorks files that might be enough to build a whole monodix for some languages but it's currently really hard to use
| mentors = [[User:Popcorndude|Popcorndude]], [[User:TommiPirinen|Flammie]]
| more = /FieldWorks_data_extraction
}}

== Tooling ==

These are projects for people who would be comfortable digging through our C++ codebases (you will be doing a lot of that).

{{IdeaSummary
| name = Python API for Apertium
| difficulty = medium
| size = medium
| skills = C++, Python
| description = Update the Python API for Apertium to expose all Apertium modes and test with all major OSes
| rationale = The current Python API misses out on a lot of functionality, like phonemicisation, segmentation, and transliteration, and doesn't work for some OSes <s>like Debian</s>.
| mentors = [[User:Francis Tyers|Francis Tyers]]
| more = /Python API
}}

{{IdeaSummary
| name = Robust tokenisation in lttoolbox
| difficulty = Medium
| size = large
| skills = C++, XML, Python
| description = Improve the longest-match left-to-right tokenisation strategy in [[lttoolbox]] to handle spaceless orthographies.
| rationale = One of the most frustrating things about working with Apertium on texts "in the wild" is the way that the tokenisation works. If a letter is not specified in the alphabet, it is dealt with as whitespace, so e.g. you get unknown words split in two so you can end up with stuff like ^G$ö^k$ı^rmak$ which is terrible for further processing. Additionally, the system is nearly impossible to use for languages that don't use spaces, such as Japanese.
| mentors = [[User:Francis Tyers|Francis Tyers]], [[User:TommiPirinen|Flammie]]
| more = /Robust tokenisation
}}

{{IdeaSummary
| name = rule visualization tools
| difficulty = Medium
| size = either
| skills = python? javascript? XML
| description = make tools to help visualize the effect of various rules
| rationale = TODO see https://github.com/Jakespringer/dapertium for an example
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Sevilay Bayatlı|Sevilay Bayatlı]], [[User:Popcorndude]]
| more = /Visualization tools
}}

{{IdeaSummary
| name = Extend Weighted transfer rules
| difficulty = Medium
| size = medium
| skills = C++, python
| description = The weighted transfer module is already applied to the chunker transfer rules. And the idea here is to extend that module to be applied to interchunk and postchunk transfer rules too.
| rationale = As a resource see https://github.com/aboelhamd/Weighted-transfer-rules-module
| mentors = [[User: Sevilay Bayatlı|Sevilay Bayatlı]]
| more = /Make a module
}}

{{IdeaSummary
| name = Automatic Error-Finder / Pseudo-Backpropagation
| difficulty = Hard
| size = large
| skills = python?
| description = Develop a tool to locate the approximate source of translation errors in the pipeline.
| rationale = Being able to generate a list of probable error sources automatically makes it possible to prioritize issues by frequency, frees up developer time, and is a first step towards automated generation of better rules.
| mentors = [[User:Popcorndude]]
| more = /Backpropagation
}}

{{IdeaSummary
| name = More Robust Recursive Transfer
| difficulty = Hard
| size = large
| skills = C++
| description = Ensure [[Apertium-recursive#Further_Documentation|Recursive Transfer]] survives ambiguous or incomplete parse trees
| rationale = 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 [https://github.com/apertium/apertium-recursive/issues/97 97] and [https://github.com/apertium/apertium-recursive/issues/80 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.
| mentors =
| more = /More_robust_recursive_transfer
}}

{{IdeaSummary
| name = CG-based Transfer
| difficulty = Hard
| size = large
| skills = C++
| description = Linguists already write dependency trees in [[Constraint Grammar]]. A following step could use these to reorder into target language trees.
| mentors =
| more =
}}

{{IdeaSummary
| name = Language Server Protocol
| difficulty = Medium
| size = medium
| skills = any programming language
| description = Build a [https://microsoft.github.io/language-server-protocol/|Language Server] for the various Apertium rule formats
| rationale = We have some static analysis tools and syntax highlighters already and it would be great if we could combine and expand them to support more text editors.
| mentors = [[User:Popcorndude]]
| more = /Language Server Protocol
}}

{{IdeaSummary
| name = WASM Compilation
| difficulty = hard
| size = medium
| skills = C++, Javascript
| description = Compile the pipeline modules to WASM and provide JS wrappers for them.
| rationale = There are situations where it would be nice to be able to run the entire pipeline in the browser
| mentors = [[User:Tino Didriksen|Tino Didriksen]]
| more = /WASM
}}

== Web ==

If you know Python and JavaScript, here's some ideas for improving our [https://apertium.org website]. Some of these should be fairly short and it would be a good idea to talk to the mentors about doing a couple of them together.

{{IdeaSummary
| name = Web API extensions
| difficulty = medium
| size = small
| skills = Python
| description = Update the web API for Apertium to expose all Apertium modes
| rationale = The current Web API misses out on a lot of functionality, like phonemicisation, segmentation, transliteration, and paradigm generation.
| mentors = [[User:Francis Tyers|Francis Tyers]], [[User:Firespeaker|Jonathan Washington]], [[User:Xavivars|Xavi Ivars]]
| more = /Apertium APY
}}

{{IdeaSummary
| name = Website Improvements: Misc
| difficulty = Medium
| size = small
| skills = html, css, js, python
| description = Improve elements of Apertium's web infrastructure
| rationale = Apertium's website infrastructure [[Apertium-html-tools]] and its supporting API [[APy|Apertium APy]] have numerous open issues. This project would entail choosing a subset of open issues and features that could realistically be completed in the summer. You're encouraged to speak with the Apertium community to see which features and issues are the most pressing.
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Xavivars|Xavi Ivars]]
| more = /Website improvements
}}

{{IdeaSummary
| name = Website Improvements: Dictionary Lookup
| difficulty = Medium
| size = small
| skills = html, css, js, python
| description = Finish implementing dictionary lookup mode in Apertium's web infrastructure
| rationale = Apertium's website infrastructure [[Apertium-html-tools]] and its supporting API [[APy|Apertium APy]] have numerous open issues, including half-completed features like dictionary lookup. This project would entail completing the dictionary lookup feature. Some additional features which would be good to work would include automatic reverse lookups (so that a user has a better understanding of the results), grammatical information (such as the gender of nouns or the conjugation paradigms of verbs), and information about MWEs.
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Xavivars|Xavi Ivars]], [[User:Popcorndude]]
| more = https://github.com/apertium/apertium-html-tools/issues/105 the open issue on GitHub
}}

{{IdeaSummary
| name = Website Improvements: Spell checking
| difficulty = Medium
| size = small
| skills = html, js, css, python
| description = Add a spell-checking interface to Apertium's web tools
| rationale = [[Apertium-html-tools]] has seen some prototypes for spell-checking interfaces (all in stale PRs and branches on GitHub), but none have ended up being quite ready to integrate into the tools. This project would entail polishing up or recreating an interface, and making sure [[APy]] has a mode that allows access to Apertium voikospell modules. The end result should be a slick, easy-to-use interface for proofing text, with intuitive underlining of text deemed to be misspelled and intuitive presentation and selection of alternatives. [https://github.com/apertium/apertium-html-tools/issues/390 the open issue on GitHub]
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Xavivars|Xavi Ivars]]
| more = /Spell checker web interface
}}

{{IdeaSummary
| name = Website Improvements: Suggestions
| difficulty = Medium
| size = small
| skills = html, css, js, python
| description = Finish implementing a suggestions interface for Apertium's web infrastructure
| rationale = Some work has been done to add a "suggestions" interface to Apertium's website infrastructure [[Apertium-html-tools]] and its supporting API [[APy|Apertium APy]], whereby users can suggest corrected translations. This project would entail finishing that feature. There are some related [https://github.com/apertium/apertium-html-tools/issues/55 issues] and [https://github.com/apertium/apertium-html-tools/pull/252 PRs] on GitHub.
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Xavivars|Xavi Ivars]]
| more = /Website improvements
}}

{{IdeaSummary
| name = Website Improvements: Orthography conversion interface
| difficulty = Medium
| size = small
| skills = html, js, css, python
| description = Add an orthography conversion interface to Apertium's web tools
| rationale = Several Apertium language modules (like Kazakh, Kyrgyz, Crimean Tatar, and Hñähñu) have orthography conversion modes in their mode definition files. This project would be to expose those modes through [[APy|Apertium APy]] and provide a simple interface in [[Apertium-html-tools]] to use them.
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Xavivars|Xavi Ivars]]
| more = /Website improvements
}}

{{IdeaSummary
| name = Add support for NMT to web API
| difficulty = Medium
| size = medium
| skills = python, NMT
| description = Add support for a popular NMT engine to Apertium's web API
| rationale = Currently Apertium's web API [[APy|Apertium APy]], supports only Apertium language modules. But the front end could just as easily interface with an API that supports trained NMT models. The point of the project is to add support for one popular NMT package (e.g., translateLocally/Bergamot, OpenNMT or JoeyNMT) to the APy.
| mentors = [[User:Firespeaker|Jonathan Washington]], [[User:Xavivars|Xavi Ivars]]
| more =
}}

== Integrations ==

In addition to incorporating data from other projects, it would be nice if we could also make our data useful to them.

{{IdeaSummary
| name = OmniLingo and Apertium
| difficulty = medium
| size = either
| skills = JS, Python
| description = OmniLingo is a language learning system for practicing listening comprehension using Common Voice data. There is a lot of text processing involved (for example tokenisation) that could be aided by Apertium tools.
| rationale =
| mentors = [[User:Francis Tyers|Francis Tyers]]
| more = /OmniLingo
}}

{{IdeaSummary
| name = Support for Enhanced Dependencies in UD Annotatrix
| difficulty = medium
| size = medium
| skills = NodeJS
| description = UD Annotatrix is an annotation interface for Universal Dependencies, but does not yet support all functionality.
| rationale =
| mentors = [[User:Francis Tyers|Francis Tyers]]
| more = /Annotatrix enhanced dependencies
}}

<!--
This one was done, but could do with more work. Not sure if it's a full gsoc though?

{{IdeaSummary
| name = User-friendly lexical selection training
| difficulty = Medium
| skills = Python, C++, shell scripting
| description = Make it so that training/inference of lexical selection rules is a more user-friendly process
| rationale = Our lexical selection module allows for inferring rules from corpora and word alignments, but the procedure is currently a bit messy, with various scripts involved that require lots of manual tweaking, and many third party tools to be installed. The goal of this task is to make the procedure as user-friendly as possible, so that ideally only a simple config file would be needed, and a driver script would take care of the rest.
| mentors = [[User:Unhammer|Unhammer]], [[User:Mlforcada|Mikel Forcada]]
| more = /User-friendly lexical selection training
}}
-->

{{IdeaSummary
| name = UD and Apertium integration
| difficulty = Entry level
| size = medium
| skills = python, javascript, HTML, (C++)
| description = Create a range of tools for making Apertium compatible with Universal Dependencies
| rationale = Universal dependencies is a fast growing project aimed at creating a unified annotation scheme for treebanks. This includes both part-of-speech and morphological features. Their annotated corpora could be extremely useful for Apertium for training models for translation. In addition, Apertium's rule-based morphological descriptions could be useful for software that relies on Universal dependencies.
| mentors = [[User:Francis Tyers]], [[User:Firespeaker| Jonathan Washington]], [[User:Popcorndude]]
| more = /UD and Apertium integration
}}

[[Category:Development]]
[[Category:Google Summer of Code]]
[[Category:Google Summer of Code]]

Latest revision as of 09:15, 4 March 2024

This is the ideas page for Google Summer of Code, here you can find ideas on interesting projects that would make Apertium more useful for people and improve or expand our functionality.

Current Apertium contributors: If you have an idea please add it below, if you think you could mentor someone in a particular area, add your name to "Interested mentors" using ~~~.

Prospective GSoC contributors: The page is intended as an overview of the kind of projects we have in mind. If one of them particularly piques your interest, please come and discuss with us on #apertium on irc.oftc.net (more on IRC), mail the mailing list, or draw attention to yourself in some other way.

Note that if you have an idea that isn't mentioned here, we would be very interested to hear about it.

Here are some more things you could look at:


If you're a prospective GSoC contributor trying to propose a topic, the recommended way is to request a wiki account and then go to 

http://wiki.apertium.org/wiki/User:[[your username]]/GSoC2023Proposal

and click the "create" button near the top of the page. It's also nice to include [[Category:GSoC_2023_student_proposals]] to help organize submitted proposals.

Language Data[edit]

Can you read or write a language other than English (and we do mean any language)? If so, you can help with one of these and we can help you figure out the technical parts.


Develop a morphological analyser[edit]

  • Difficulty:
    3. Entry level
  • Size: Multiple lengths possible (discuss with the mentors which option is better for you)
  • Required skills:
    XML or HFST or lexd
  • Description:
    Write a morphological analyser and generator for a language that does not yet have one
  • Rationale:
    A key part of an Apertium machine translation system is a morphological analyser and generator. The objective of this task is to create an analyser for a language that does not yet have one.
  • Mentors:
    Francis Tyers, Jonathan Washington, Sevilay Bayatlı, Hossep, nlhowell, User:Popcorndude
  • read more...


apertium-separable language-pair integration[edit]

  • Difficulty:
    2. Medium
  • Size: Small
  • Required skills:
    XML, a scripting language (Python, Perl), some knowledge of linguistics and/or at least one relevant natural language
  • Description:
    Choose a language you can identify as having a good number of "multiwords" in the lexicon. Modify all language pairs in Apertium to use the Apertium-separable module to process the multiwords, and clean up the dictionaries accordingly.
  • Rationale:
    Apertium-separable is a newish module to process lexical items with discontinguous dependencies, an area where Apertium has traditionally fallen short. Despite all the module has to offer, many translation pairs still don't use it.
  • Mentors:
    Jonathan Washington, User:Popcorndude
  • read more...


Bring an unreleased translation pair to releasable quality[edit]

  • Difficulty:
    2. Medium
  • Size: Large
  • Required skills:
    shell scripting
  • Description:
    Take an unstable language pair and improve its quality, focusing on testvoc
  • Rationale:
    Many Apertium language pairs have large dictionaries and have otherwise seen much development, but are not of releasable quality. The point of this project would be bring one translation pair to releasable quality. This would entail obtaining good naïve coverage and a clean testvoc.
  • Mentors:
    Jonathan Washington, Sevilay Bayatlı, User:Unhammer, Hèctor Alòs i Font
  • read more...


Develop a prototype MT system for a strategic language pair[edit]

  • Difficulty:
    2. Medium
  • Size: Large
  • Required skills:
    XML, some knowledge of linguistics and of one relevant natural language
  • Description:
    Create a translation pair based on two existing language modules, focusing on the dictionary and structural transfer
  • Rationale:
    Choose a strategic set of languages to develop an MT system for, such that you know the target language well and morphological transducers for each language are part of Apertium. Develop an Apertium MT system by focusing on writing a bilingual dictionary and structural transfer rules. Expanding the transducers and disambiguation, and writing lexical selection rules and multiword sequences may also be part of the work. The pair may be an existing prototype, but if it's a heavily developed but unreleased pair, consider applying for "Bring an unreleased translation pair to releasable quality" instead.
  • Mentors:
    Jonathan Washington, Sevilay Bayatlı, User:Unhammer, Hèctor Alòs i Font
  • read more...


Add a new variety to an existing language[edit]

  • Difficulty:
    3. Entry level
  • Size: Multiple lengths possible (discuss with the mentors which option is better for you)
  • Required skills:
    XML, some knowledge of linguistics and of one relevant natural language
  • Description:
    Add a language variety to one or more released pairs, focusing on the dictionary and lexical selection
  • Rationale:
    Take a released language, and define a new language variety for it: e.g. Quebec French or Provençal Occitan. Then add the new variety to one or more released language pairs, without diminishing the quality of the pre-existing variety(ies). The objective is to facilitate the generation of varieties for languages with a weak standardisation and/or pluricentric languages.
  • Mentors:
    Hèctor Alòs i Font, Jonathan Washington,Sevilaybayatlı
  • read more...


Leverage and integrate language preferences into language pairs[edit]

  • Difficulty:
    3. Entry level
  • Size: Medium
  • Required skills:
    XML, some knowledge of linguistics and of one relevant natural language
  • Description:
    Update language pairs with lexical and orthographical variations to leverage the new preferences functionality
  • Rationale:
    Currently, preferences are implemented via language variant, which relies on multiple dictionaries, increasing compilation time exponentially every time a new preference gets introduced.
  • Mentors:
    Xavi Ivars User:Unhammer
  • read more...


Add Capitalization Handling Module to a Language Pair[edit]

  • Difficulty:
    3. Entry level
  • Size: Small
  • Required skills:
    XML, knowledge of some relevant natural language
  • Description:
    Update a language pair to make use make use of the new Capitalization handling module
  • Rationale:
    Correcting capitalization via transfer rules is tedious and error prone, but putting them in a separate set of rules should allow them to be handled in a more concise and maintainable way. Additionally, it is possible that capitalization rule could be moved to monolingual modules, thus reducing development effort on translators.
  • Mentors:
    User:Popcorndude
  • read more...

Data Extraction[edit]

A lot of the language data we need to make our analyzers and translators work already exists in other forms and we just need to figure out how to convert it. If you know of another source of data that isn't listed, we'd love to hear about it.


dictionary induction from wikis[edit]

  • Difficulty:
    2. Medium
  • Size: Multiple lengths possible (discuss with the mentors which option is better for you)
  • Required skills:
    MySQL, mediawiki syntax, perl, maybe C++ or Java; Java, Scala, RDF, and DBpedia to use DBpedia extraction
  • Description:
    Extract dictionaries from linguistic wikis
  • Rationale:
    Wiki dictionaries and encyclopedias (e.g. omegawiki, wiktionary, wikipedia, dbpedia) contain information (e.g. bilingual equivalences, morphological features, conjugations) that could be exploited to speed up the development of dictionaries for Apertium. This task aims at automatically building dictionaries by extracting different pieces of information from wiki structures such as interlingual links, infoboxes and/or from dbpedia RDF datasets.
  • Mentors:
    Jonathan Washington, User:Popcorndude
  • read more...


Dictionary induction from parallel corpora / Revive ReTraTos[edit]

  • Difficulty:
    2. Medium
  • Size: Medium
  • Required skills:
    C++, perl, python, xml, scripting, machine learning
  • Description:
    Extract dictionaries from parallel corpora
  • Rationale:
    Given a pair of monolingual modules and a parallel corpus, we should be able to run a program to align tagged sentences and give us the best entries that are missing from bidix. ReTraTos (from 2008) did this back in 2008, but it's from 2008. We want a program which builds and runs in 2022, and does all the steps for the user.
  • Mentors:
    User:Unhammer, User:Popcorndude
  • read more...


Extract morphological data from FLEx[edit]

  • Difficulty:
    1. Hard
  • Size: Large
  • Required skills:
    python, XML parsing
  • Description:
    Write a program to extract data from SIL FieldWorks and convert as much as possible to monodix (and maybe bidix).
  • Rationale:
    There's a lot of potentially useful data in FieldWorks files that might be enough to build a whole monodix for some languages but it's currently really hard to use
  • Mentors:
    Popcorndude, Flammie
  • read more...

Tooling[edit]

These are projects for people who would be comfortable digging through our C++ codebases (you will be doing a lot of that).


Python API for Apertium[edit]

  • Difficulty:
    2. Medium
  • Size: Medium
  • Required skills:
    C++, Python
  • Description:
    Update the Python API for Apertium to expose all Apertium modes and test with all major OSes
  • Rationale:
    The current Python API misses out on a lot of functionality, like phonemicisation, segmentation, and transliteration, and doesn't work for some OSes like Debian.
  • Mentors:
    Francis Tyers
  • read more...


Robust tokenisation in lttoolbox[edit]

  • Difficulty:
    2. Medium
  • Size: Large
  • Required skills:
    C++, XML, Python
  • Description:
    Improve the longest-match left-to-right tokenisation strategy in lttoolbox to handle spaceless orthographies.
  • Rationale:
    One of the most frustrating things about working with Apertium on texts "in the wild" is the way that the tokenisation works. If a letter is not specified in the alphabet, it is dealt with as whitespace, so e.g. you get unknown words split in two so you can end up with stuff like ^G$ö^k$ı^rmak$ which is terrible for further processing. Additionally, the system is nearly impossible to use for languages that don't use spaces, such as Japanese.
  • Mentors:
    Francis Tyers, Flammie
  • read more...


rule visualization tools[edit]


Extend Weighted transfer rules[edit]


Automatic Error-Finder / Pseudo-Backpropagation[edit]

  • Difficulty:
    1. Hard
  • Size: Large
  • Required skills:
    python?
  • Description:
    Develop a tool to locate the approximate source of translation errors in the pipeline.
  • Rationale:
    Being able to generate a list of probable error sources automatically makes it possible to prioritize issues by frequency, frees up developer time, and is a first step towards automated generation of better rules.
  • Mentors:
    User:Popcorndude
  • read more...


More Robust Recursive Transfer[edit]

  • Difficulty:
    1. Hard
  • Size: Large
  • Required skills:
    C++
  • Description:
    Ensure Recursive Transfer survives ambiguous or incomplete parse trees
  • Rationale:
    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.
  • Mentors:
  • read more...


CG-based Transfer[edit]

  • Difficulty:
    1. Hard
  • Size: Large
  • Required skills:
    C++
  • Description:
    Linguists already write dependency trees in Constraint Grammar. A following step could use these to reorder into target language trees.
  • Rationale:
    {{{rationale}}}
  • Mentors:
  • [[|read more...]]


Language Server Protocol[edit]


WASM Compilation[edit]

  • Difficulty:
    1. Hard
  • Size: Medium
  • Required skills:
    C++, Javascript
  • Description:
    Compile the pipeline modules to WASM and provide JS wrappers for them.
  • Rationale:
    There are situations where it would be nice to be able to run the entire pipeline in the browser
  • Mentors:
    Tino Didriksen
  • read more...

Web[edit]

If you know Python and JavaScript, here's some ideas for improving our website. Some of these should be fairly short and it would be a good idea to talk to the mentors about doing a couple of them together.


Web API extensions[edit]

  • Difficulty:
    2. Medium
  • Size: Small
  • Required skills:
    Python
  • Description:
    Update the web API for Apertium to expose all Apertium modes
  • Rationale:
    The current Web API misses out on a lot of functionality, like phonemicisation, segmentation, transliteration, and paradigm generation.
  • Mentors:
    Francis Tyers, Jonathan Washington, Xavi Ivars
  • read more...


Website Improvements: Misc[edit]

  • Difficulty:
    2. Medium
  • Size: Small
  • Required skills:
    html, css, js, python
  • Description:
    Improve elements of Apertium's web infrastructure
  • Rationale:
    Apertium's website infrastructure Apertium-html-tools and its supporting API Apertium APy have numerous open issues. This project would entail choosing a subset of open issues and features that could realistically be completed in the summer. You're encouraged to speak with the Apertium community to see which features and issues are the most pressing.
  • Mentors:
    Jonathan Washington, Xavi Ivars
  • read more...


Website Improvements: Dictionary Lookup[edit]

  • Difficulty:
    2. Medium
  • Size: Small
  • Required skills:
    html, css, js, python
  • Description:
    Finish implementing dictionary lookup mode in Apertium's web infrastructure
  • Rationale:
    Apertium's website infrastructure Apertium-html-tools and its supporting API Apertium APy have numerous open issues, including half-completed features like dictionary lookup. This project would entail completing the dictionary lookup feature. Some additional features which would be good to work would include automatic reverse lookups (so that a user has a better understanding of the results), grammatical information (such as the gender of nouns or the conjugation paradigms of verbs), and information about MWEs.
  • Mentors:
    Jonathan Washington, Xavi Ivars, User:Popcorndude
  • [the open issue on GitHub|read more...]


Website Improvements: Spell checking[edit]

  • Difficulty:
    2. Medium
  • Size: Small
  • Required skills:
    html, js, css, python
  • Description:
    Add a spell-checking interface to Apertium's web tools
  • Rationale:
    Apertium-html-tools has seen some prototypes for spell-checking interfaces (all in stale PRs and branches on GitHub), but none have ended up being quite ready to integrate into the tools. This project would entail polishing up or recreating an interface, and making sure APy has a mode that allows access to Apertium voikospell modules. The end result should be a slick, easy-to-use interface for proofing text, with intuitive underlining of text deemed to be misspelled and intuitive presentation and selection of alternatives. the open issue on GitHub
  • Mentors:
    Jonathan Washington, Xavi Ivars
  • read more...


Website Improvements: Suggestions[edit]

  • Difficulty:
    2. Medium
  • Size: Small
  • Required skills:
    html, css, js, python
  • Description:
    Finish implementing a suggestions interface for Apertium's web infrastructure
  • Rationale:
    Some work has been done to add a "suggestions" interface to Apertium's website infrastructure Apertium-html-tools and its supporting API Apertium APy, whereby users can suggest corrected translations. This project would entail finishing that feature. There are some related issues and PRs on GitHub.
  • Mentors:
    Jonathan Washington, Xavi Ivars
  • read more...


Website Improvements: Orthography conversion interface[edit]

  • Difficulty:
    2. Medium
  • Size: Small
  • Required skills:
    html, js, css, python
  • Description:
    Add an orthography conversion interface to Apertium's web tools
  • Rationale:
    Several Apertium language modules (like Kazakh, Kyrgyz, Crimean Tatar, and Hñähñu) have orthography conversion modes in their mode definition files. This project would be to expose those modes through Apertium APy and provide a simple interface in Apertium-html-tools to use them.
  • Mentors:
    Jonathan Washington, Xavi Ivars
  • read more...


Add support for NMT to web API[edit]

  • Difficulty:
    2. Medium
  • Size: Medium
  • Required skills:
    python, NMT
  • Description:
    Add support for a popular NMT engine to Apertium's web API
  • Rationale:
    Currently Apertium's web API Apertium APy, supports only Apertium language modules. But the front end could just as easily interface with an API that supports trained NMT models. The point of the project is to add support for one popular NMT package (e.g., translateLocally/Bergamot, OpenNMT or JoeyNMT) to the APy.
  • Mentors:
    Jonathan Washington, Xavi Ivars
  • [[|read more...]]

Integrations[edit]

In addition to incorporating data from other projects, it would be nice if we could also make our data useful to them.


OmniLingo and Apertium[edit]

  • Difficulty:
    2. Medium
  • Size: Multiple lengths possible (discuss with the mentors which option is better for you)
  • Required skills:
    JS, Python
  • Description:
    OmniLingo is a language learning system for practicing listening comprehension using Common Voice data. There is a lot of text processing involved (for example tokenisation) that could be aided by Apertium tools.
  • Rationale:
  • Mentors:
    Francis Tyers
  • read more...


Support for Enhanced Dependencies in UD Annotatrix[edit]

  • Difficulty:
    2. Medium
  • Size: Medium
  • Required skills:
    NodeJS
  • Description:
    UD Annotatrix is an annotation interface for Universal Dependencies, but does not yet support all functionality.
  • Rationale:
  • Mentors:
    Francis Tyers
  • read more...


UD and Apertium integration[edit]

  • Difficulty:
    3. Entry level
  • Size: Medium
  • Required skills:
    python, javascript, HTML, (C++)
  • Description:
    Create a range of tools for making Apertium compatible with Universal Dependencies
  • Rationale:
    Universal dependencies is a fast growing project aimed at creating a unified annotation scheme for treebanks. This includes both part-of-speech and morphological features. Their annotated corpora could be extremely useful for Apertium for training models for translation. In addition, Apertium's rule-based morphological descriptions could be useful for software that relies on Universal dependencies.
  • Mentors:
    User:Francis Tyers, Jonathan Washington, User:Popcorndude
  • read more...
Retrieved from "https://wiki.apertium.org/w/index.php?title=Ideas_for_Google_Summer_of_Code&oldid=75524"