Talk:Ideas for Google Summer of Code

From Apertium
Jump to navigation Jump to search

So, was your organization a part of the google summer of code last year too?

Nope, but we're hoping to be included this year -- Francis Tyers 02:45, 16 March 2008 (UTC)

From old Projects page

Writing extensions to Apertium could be the ideal undergraduate (major) project. Here are some suggestions, along with brief outlines for how you might go about starting it.

A word compounder for Germanic languages

Most Germanic languages have compound words, we can analyse the compounds using LRLM (see Agglutination and compounds), but we cannot generate them without having them in the dictionary (a laborious task). The idea of this project it to create a post-generation module that takes series of words, e.g. in Afrikaans:

 vlote bestorming fase
 naval assault    phase

and turn them into compounds:

 vlootbestormingfase
 naval+assault+phase

We don't want to compound all words, but it might be a good idea to compound those which have been seen before . There are many large wordlists of compound words that could be used for this. Of course if they aren't found maybe some kind of heuristics could be used. Probably we'd only want to compound where words are >= 5 characters long.

Automatic accent and diacritic insertion

One of the problems in machine translating text in real time chat environments (and generally) is the lack of accents or diacritic marks. This makes machine translation hard, because without the (´), traducción is an unknown word.

There is a need for a module for Apertium which would automatically replace the accents/diacritics on unaccented/diacritic'd words.

References
  • Simard, Michel (1998). "Automatic Insertion of Accents in French Texts". Proceedings of EMNLP-3. Granada, Spain.
  • Rada F. Mihalcea. (2002). "Diacritics Restoration: Learning from Letters versus Learning from Words". Lecture Notes in Computer Science 2276/2002 pp. 96--113


2017

Back-off morphological generation with RNNs

  • Difficulty:
    1. Hard
  • Required skills:
    c++
  • Description:
    Write a pared-down RNN library to do morphological generation, add it as a backoff to lt-proc in case of a generation fail.
  • Rationale:
    One of the most frustrating things when developing a new language pair is that you have to get the tags just right in order to be able to generate, if they come in the wrong order, or if you're missing a tag or if you have too many tags, then you don't get any surface form generated. For many languages it is possible to train RNNs to a high-level of accuracy.
  • Mentors:
    User:Francis Tyers User:Mlforcada
  • read more...

Shallow-function labeller

  • Difficulty:
    2. Medium
  • Required skills:
    Python, shell scripting
  • Description:
    Implement a prototype shallow syntactic function labeller for Apertium
  • Rationale:
    In many pairs it is useful to know in addition to the morphological tags of a word, syntactic function tags in order to make an adequate translation. For instance, you might want to know in an ergative language if an absolutive is subject or object while translating. A shallow function labeller takes an annotated corpus and produces a model which can annotate new text.
  • Mentors:
    Unhammer, Francis Tyers, Mikel Forcada
  • read more...

Discontiguous multiwords

  • Difficulty:
    2. Medium
  • Required skills:
    C++, Knowledge of FSTs
  • Description:
    The task will be to develop, or adapt a module to deal with these kind of contiguous multiword expressions, for example, taking 'liggja ekki fyrir' and reordering it as 'liggja# fyrir ekki'.
  • Rationale:
    In many languages, such as English, Norwegian and Icelandic, there are discontiguous multiwords, e.g. phrasal verbs, that we cannot easily support. For example 'liggja ekki fyrir' in Icelandic should be translated in English as 'to be not clear', but we cannot have 'liggja fyrir' as a traditional multiword because of the extra 'adverb', or it could even be a whole NP.
  • Mentors:
    Francis Tyers
  • read more...



Old ideas

Task Difficulty Description Rationale Requirements Interested
mentors
Porting read more... 4. Entry level Port Apertium to Windows complete with nice installers and all that jazz. Apertium currently compiles on Windows (see Apertium on Windows) 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. It would be nice for these people to be able use Apertium too. C++, autotools, experience in programming on Windows.
Tree-based transfer read more... 1. Very hard Create a new XML-based transfer language for tree-based transfer and a prototype implementation, and transfer rules for an existing language pair. Apertium currently works on finite-state chunking, which works well, but is problematic for less-closely related languages and for getting the final few percent in closely-related languages. A tree-based transfer would allow us to work on real syntactic constituents, and probably simplify many existing pairs. There are some existing non-free implementations.[1] [2] XML, Knowledge of parsing, implementation language largely free.
Interfaces 4. Entry level Create plugins or extensions for popular free software applications to include support for translation using Apertium. We'd expect at least Firefox and Evolution (or Thunderbird), but to start with something more easy we have half-finished plugins for Pidgin and XChat that could use some love. The more the better! Further ideas on plugins page 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. This should use a local installation with optional fallback to the webservice. Depends on the application chosen, but probably Java, C, C++, Python or Perl.
Automated lexical
extraction
2. Hard Writing a C++ wrapper around Markus Forsberg's Extract tool (version 2.0) as a library to allow it to be used with Apertium paradigms and TSX files / Constraint grammars 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 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
Bytecode for transfer 2. Hard Adapt transfer to use bytecode instead of tree walking. Apertium is pretty fast, but it could be faster, and the transfer is dominating the CPU usage. This task would be write a compiler and interpreter for Apertium transfer rules into the format of an an off-the-shelf bytecode engine (e.g. Java, v8, kjs, ...). If Java bytecode was chosen this might eventually make Apertium run on J2ME devices. See also: Bytecode for transfer C++ and for the bytecode Java or Javascript
VM for the transfer module read more... 3. Medium VM for the current transfer architecture of Apertium and for the future transfers, pure C++ Define an instruction set for a virtual machine that processes transfer code, then implement a prototype in Python, then porting to C++. The rationale behind this is that XML tree-walking is quite slow and CPU intensive. In modern (3 or more stage) pairs, transfer takes up most of the CPU. There are other options, like Bytecode for transfer, but we would like something that does not require external libraries and is adapted specifically for Apertium. Python, C/C++, XML, XSLT, code optimisation, JIT techniques, etc. Sortiz
Linguistically-driven bilingual-phrase filtering for inferring transfer rules 3. Medium Re-working apertium-transfer-training-tools to filter the set of bilingual phrases automatically obtained from a word-aligned sentence pair by using linguistic criteria. 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++, general knowledge of GIZA++, Perl considered a plus. Jimregan
Context-dependent lexicalised categories for inferring transfer rules 2. Hard Re-working apertium-transfer-training-tools to use context-dependent lexicalised categories in the inference of shallow-transfer rules. Apertium-transfer-training-tools generates shallow-transfer rules from aligned parallel corpora. It uses an small set of lexicalised categories, categories that are usually involved in lexical changes, such as prepositions, pronouns or auxiliary verbs. Lexicalised categories differentiate from the rest of categories because their lemmas are taken into account in the generation of rules. C++, general knowledge of GIZA++, XML. Jimregan
Corpus-assisted dictionary expansion 4. Entry level Semi-automatic bilingual word equivalence retrieval from a bitext and a monolingual word list. Improve an existing Python script to retrieve the best translations (suggestions) of a word (typically an unknown word) given a particular parallel text corpus. Perhaps combine the result with automatic paradigm guessing (also suggestions) to improve the productivity of the lexical work for most contributors Python, C/C++, AWK, Bash, perhaps web interface in PHP, Python, Ruby on Rails Sortiz, Jimregan
Detect 'hidden' unknown words read more... 3. Medium The part-of-speech tagger of Apertium can be modified to work out the likelihood of each 'tag' in a certain context, this can be used to detect missing entries in the dictionary. Apertium dictionaries may have incomplete entries, that is, surface forms (lexical units as they appear in running texts) for which the dictionary does not provide all the possible lexical forms (consisting of lemma, part-of-speech and morphological inflection information). As those surface form for which there is at least one lexical form cannot be considered unknown words, it is difficult to know whether all lexical forms for a given surface form have been included in the dictionaries or not. This feature will detect 'possible' missing lexical forms for those surface forms in the dictionaries. C++ if you plan to modify the part-of-speech tagger; whatever if rewriting it from scratch. Felipe Sánchez-Martínez
Improvements to target-language tagger training read more... 2. Hard Modify apertium-tagger-training-tools so that it can deals with n-stage transfer rules when segmenting the input source-language text, and applies a k-best viterbi pruning approach that does not require to compute the a-priori likelihood of every disambiguation path before pruning. apertium-tagger-training-tools is a program for doing target-language tagger training, meaning it improves POS tagging performance specifically for the translation task, achieving a result for unsupervised training comparable with supervised training. This task would also require switching the default perl-based language model to either IRSTLM or RandLM (or both!). C++, XML, XSLT Felipe Sánchez-Martínez
Hybrid MT 2. Hard Building Apertium-Marclator rule-based/corpus-based hybrids Both the rule-based machine translation system Apertium and the corpus-based machine translation system Marclator do some kind of chunking of the input as well as use a relatively straightforward left-to-right machine translation strategy. This has been explored before but there are other ways to organize hybridization which should be explored (the mentor is happy to discuss). Hybridization may make it easier to adapt Apertium to a particular corpus by using chunk pairs derived from it. Knowledge of Java, C++, and scripting languages, and appreciation for research-like coding projects Mlforcada, Jimregan

List

Note: The table below is sortable by column. Click on the little squares below or next to the headers.

Task Difficulty Description Rationale Requirements Interested
mentor
Improve integration of
lttoolbox in libvoikko and libhfst read more...
3. Medium Dictionaries from lttoolbox can now be used for spellchecking directly with libvoikko (see Spell checking). The idea of this project is to improve the integration. Fix bugs, look at ways of codifying "standard"/"sub-standard" forms in our dictionaries. Spell 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, C++. Francis Tyers
Regular expressions in lt-tmxproc read more... 2. Hard Adding regex support to lt-tmxproc would maximise the amount of translations we can get from an available TMX. lt-tmxproc already includes some limited support for making translation units in a TMX file into something of a template, but only for digits. Gintrowicz and Jassem describe an interesting idea, using user-definable regular expressions, to turn items such as dates into templates. lttoolbox already has support for a subset of regular expressions; add a mechanism to allow the user to make use of this, and to include these regular expressions in processing. C++, Knowledge of FSTs Jimregan
Quality control framework 3. Medium Write a unified testing framework for released language pairs in Apertium. The system should be able to track both regressions with respect to previous versions, and quality checks with respect to previous quality evaluations. We are gradually improving our quality control, with (semi-)automated tests, but these are done on the Wiki on an ad-hoc basis. Having a unified testing framework would allow us to be able to more easily track quality improvements over all language pairs, and more easily deal with regressions. See [1] PHP or Python Francis Tyers
Tree-based reordering read more... 2. Hard Currently we have a problem with very distantly related languages that have long-distance constituent reordering. Some languages have dependency parsers which create graphs of words. The purpose of this task would be to create a module that comes before or after apertium-transfer which reorders the graph. XML, C++ Francis Tyers
Dictionary induction from wikis 3. Medium Extract dictionaries from linguistic wikis 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. MySQL, mediawiki syntax, perl, maybe C++ or Java; Java, Scala, RDF, and DBpedia to use DBpedia extraction Atoral, Jimregan (dbpedia extraction only)
Inferring transfer rules with active learning 2. Hard Re-working apertium-transfer-training-tools to get more general rules. The right level of generalisation can be achieved by asking non-expert users to validate examples. Apertium-transfer-training-tools generates shallow-transfer rules from aligned parallel corpora. The corpus-extracted rules provide a translation quality comparable with the expert-written ones. However, human-written rules are more general and easier to mantain. The purpose of this task is to reduce the number of inferred rules while keeping translation quality. Gaps in the information elicited from the parallel corpus are filled with knowledge from non-expert users to achieve the right degree of generalisation. C++, general knowledge of GIZA++, XML. Víctor M. Sánchez-Cartagena
Active learning to choose among paradigms which share superficial forms 2. Hard Developing an active learning algorithm to choose the most appropriate paradigm (in a monolingual dictionary) for a new word. Previous research work allows us to reduce the problem to a set of paradigms which share superficial forms but not lexical forms. Current research on the addition of entries to a monolingual dictionary by non-expert users has partially solved the problem of choosing the best paradigm for a new word. However, when different paradigms share all the lexical forms the problem becomes harder. In such case, it is necessary to ask the users to validate sentences in which the word to be added acts as different lexical forms. Such sentences may be extracted from a monolingual corpus. XML, Java, Web technologies. Víctor M. Sánchez-Cartagena, Miquel Esplà-Gomis
Optimising paradigms 3. Medium Developing a tool to simplify the paradigms in monolingual dictionaries in order to minimise the redundancy. The collaborative improvement of dictionaries can cause some degree of redundancy in paradigms (it is frequent to find paradigms generating a very similar set of lexical forms). Although apertium-dixtools includes an option to remove identical paradigms, this task consists in the implementation of a tool to reduce the redundancy in paradigms by generating all the lexical forms and restructuring the paradigms. XML, Java. Miquel Esplà-Gomis
Corpus-based distinction between verb/pronoun
combinations in Romance languages
2. Hard Write a module which learns to distinguish between different translations of pronouns/verbs in Romance languages, e.g. "se come bien", "él se come", etc. Some constructions are ambiguous in Romance languages (e.g. Spanish). One of these are verb/pronoun combinations, however, with any verb, some combinations are more likely than others. C++, XML
Corpus-based definiteness transfer 3. Medium Develop a program that uses information from corpora to improve the transfer of definiteness between language pairs which have it. Languages treat definiteness differently, some using it more than others, in Apertium we typically just transfer it as is, but this has problems. read more... C++, XML, python linguistics Francis Tyers


Old further reading

Automated lexical extraction
Support for agglutinative languages
Transfer rule learning
Target-language driven part-of-speech tagger training
Regular expressions in lt-tmxproc

Apertium on Android with Necessitas QT

First off: "work on a smartphone and would be the first translator to work without Internet connection" - not true. There's at least one for the iPhone.

"A mechanism (i.e. temporary files) must be instrumented to overcome the unavailability of pipelines in Android." -- Pasquale implemented a pipeline replacement using memory-based pseudo files in apertium-service. Consider that problem solved. (Also, pipelines are not unavailable, they're just not standard).

Beyond that, I think the premise is flawed. The primary issue(s) with Apertium on Android were, chronologically: 1) lack of C++ support, 2) lack of STL support, 3) lack of wstring support. The first two are solved, the third, I'm not sure. Qt cannot help with that.

I don't see any major appeal in using a non-standard GUI, particularly when it's likely to involve as much effort as building a JNI interface. An optimal Android version would provide a translation interface as an Intent, rather than tightly coupling a GUI.

If the wstring issue no longer exists, it should be possible to run apertium-service unmodified. A JNI wrapper around it is the best way forward for a C++ port. Necessitas QT is a dead end idea. -- Jimregan 15:53, 29 February 2012 (UTC)

According to Boyán: "Parece ser que sí que soporta STL. ... por lo visto la propuesta de Sergio de pasar Apertium a Android sigue siendo viable y tarde o temprano habrá que hacerlo. Tiene Jim la razón en que no se usaría QT para nada, sino un Intent de Android" - Francis Tyers 21:08, 29 February 2012 (UTC)
STL support: that's what I was saying. Rephrased: first, the primary issue was lack of C++ support; that resolved, the primary issue became lack of STL support; that resolved, the primary issue became lack of wstring support. I've done some checking, and can't seem to find a straight answer, so "probably not". There is an alternative version of stlport for android, that seems to have the necessary pieces, here. I still say Qt is a dead end. Even if it's possible to create an Intent with Qt -- and it's by no means certain that it is: http://comments.gmane.org/gmane.comp.lib.qt.android/2719 -- it seems a lot of trouble to go to for an outcome that will never be truly satisfactory. Either way, there's going to be a lot of dicking around with JNI, so it would probably just be best to wrap Apertium in a Java shim. On the plus side, there are tools like jnaerator to automate most of that. -- Jimregan 19:39, 2 March 2012 (UTC)

2013 ideas

Template-based bilingual dictionary
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
XML, C++, python Design a format similar to bidix (declarative XML establishing language 1 <> language 2 correspondences) that allows the use of templates, as well as the back-end to process it (i.e., it should compile into an FST). It should deal with discontiguous multiwords and complex multiwords, allowing them to be easily translated, and should provide some mechanism (some sort of ranking) to deal with multiple matching sets of templates for a given translation (similar to CG). It should essentially allow one to bypass transfer rules and disambiguation and produce similar (if not better) accuracy in translation. A templatic bidix forces the designer of a language pair to be more explicit, and also consolidates pair development. Furthermore, there are several types of phenomenon such a system could deal with that are currently highly problematic. Firespeaker Francis Tyers
1. Hard read more...
Improved bilingual dictionary induction
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
Python, XML Write a set of scripts that can generate valid and consistent Apertium bilingual dictionary entries from a word-aligned parallel corpus. This will involve making a basic templating system. The scripts should ideally be able to incorporate quality measures to determine how reliable the translations extracted from the corpus are. There are some tools to make bilingual dictionaries from parallel corpora (such as retratos) but they don't take into account that words in different languages can require different entries in the bilingual dictionary depending on their morphological characteristics. This means that although finding the translations is automatic, most generated entries have to be checked, which can greatly increase the amount of time it takes to make a new translation system. Francis Tyers
3. Entry level read more...
Improvements in lexical-selection module
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
C++, python Implement a number of improvements to the lexical selection module, particularly involving the rule-learning scripts. The lexical selection module in Apertium is currently a prototype. There are many optimisations that could be made to make it faster and more efficient. There are a number of scripts which can be used for learning lexical-selection rules, but the scripts are not particularly well written. Part of the task will be to rewrite the scripts taking into account all possible corner cases. Francis Tyers
2. Medium read more...
Visual interface to write structural transfer rules
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
C++, scripting languages, GUI design Write a graphical user interface to write structural transfer rules (one that reads in (a subset of) the current XML-based language, allows for a graphical, intuitive editing of the rules, and writes compilable .t1x, .t2x or .t3x files) Apertium structural transfer rules are currently encoded in XML-based formats. These are very overt and clear, but clumsy and may be hard to write. The idea is to design a visual programming language of the style of like Scratch, where jigsaw-puzzle-style pieces corresponding to statements and control structures fit only if the syntax is right. Mikel Forcada, mentors wanted!
1. Hard read more

2014 ideas

Apertium in chat clients (2014 project)
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
Good command of Java, interfaces, Android, and scripting languages Make it possible to use Apertium seamlessly from inside Telegram, XChat, Pidgin. Telegram is a free/open-source, documented-API alternative to Whatsapp. Using the existing offline Apertium code base it should be possible to integrate it in the Android version of Telegram or in the Chrome/Chromium plugin. XChat is one of the most popular IRC programs. Apertium has come a long way to becoming a machine translation system that may be easily installed (e.g. apertium-caffeine). This means that it should be easy to interface that so that it works as a plugin to XChat (see XChat 2.0 Plugin interface) mlforcada, other mentors wanted.
2. Medium read more...
Unify the metadix formats
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
Good command of XML, XSLT, scripting languages Unify and extend the various "metadix" formats used in Apertium and deploy the modifications In some language pairs, dictionaries are not written directly in the .dix format understood by lt-comp, but rather in a higher-level format called .metadix which is converted to .dix using a cascade of XSLT stylesheets and scripts. However, the .metadix format is different in each language pair, and, therefore, each language pair contains its own scripts and XSLT stylesheets. There are basically two such formats. The idea is to unify them in a single format that can be processed with scripts that would then be part of lttoolbox or apertium, and, if possible, extend it so that it allows for "variables " in bilingual dictionaries, so that one can have a single entry for (e.g.) 'foodstock'/'foodstocks' (en) = 'matèria primera'/'matèries primeres' (ca), which is currently not possible. mlforcada
2. Medium read more...
Command-line translation memory fuzzy-match repair (2014 project)
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
Any command-line scripting language or Java, or C++ ... Extend the Apertium capability to deal with translation memory so that it can "repair" some fuzzy matches when it is "safe" to do so. Currently Apertium has support for translation memories, basically as follows: If an input sentence is found exactly in the translation memory, it is not machine translated but instead retrieved from the translation memory. However, it may be the case that one finds, for instance, sentences that differ only in one or two words. In that case, it may make sense to try and use Apertium only to "patch" the translation in the memory. It is actually possible to do this in a "safe" way. mlforcada
1. Hard read more...
Rule-based finite-state disambiguation (2013 project)
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
XML, C++ or Java Implement a disambiguation framework for Apertium that can be expressed as a finite-state transducer. It might be a good idea to express this as constraint rules, in a novel XML-based file format. It would be a good idea to look at LanguageTool, and IceParser and Apertium's own apertium-lex-tools to get ideas on how this might be accomplished. Currently Apertium only has a bigram/trigram part-of-speech tagger. For most languages, bigram/trigram POS disambiguation really doesn't work, especially when you want to disambiguate morphology (e.g. number, case) along with part-of-speech. So far we've been using constraint grammar for some of these languages. But although Constraint Grammar is great and powerful, it is also pretty slow. Francis Tyers (C++), Jacob Nordfalk (Java)
1. Hard read more...
Complex multiwords (2014 project)
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
Java or C++, XML, Knowledge of FSTs 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 adj nom because the adjective has a lot of inflection. Jimregan
1. Hard read more...
Optimise the VM for transfer (2014 project)
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
Python, C++, XML, code optimisation, JIT techniques, etc. The current VM for the transfer architecture of Apertium is up to five times slower than the XML tree-walking implementation. The job of this task is to optimise the C++ code to make it faster than XML tree-walking. The rationale behind this is that XML tree-walking is quite slow and CPU intensive. In modern (3 or more stage) pairs, transfer takes up most of the CPU. There are other options, like Bytecode for transfer, but we would like something that does not require external libraries and is adapted specifically for Apertium. Sortiz
2. Medium read more...
Accent and diacritic restoration
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
C, C++, XML, familiarity with linguistic issues, knowledge of FSTs preferable Create an optional module to restore diacritics and accents on input text, and integrate it into the Apertium pipeline. 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. Kevin Scannell, Trondtr
3. Entry level read more...
Geriaoueg vocabulary assistant
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
PHP, C++, XML Extend Geriaoueg so that it works more reliably with broken HTML, with any given language pair (e.g. support for both lttoolbox and HFST. Geriaoueg is a program that provides "popup" vocabulary assistance, something like BBC Vocab or Lingro. Currently it only works with Breton--French, Welsh--English and Spanish--Breton. This task would be to develop it to work with any language in our SVN and fix problems with processing and displaying non-standard HTML. Francis Tyers
3. Entry level read more...
Closer integration with HFST
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
C++, Autotools, XML This is a set of subtasks to make it easier for Apertium developers to use the Helsinki Finite-State Toolkit (HFST). It will involve: Adjusting the HFST build process to allow for an Apertium-tailored install. Making an XML format for lexc designed with machine translation in mind. Adjusting the tokenisation code in hfst-proc. Making lttoolbox a possible backend for HFST. HFST is a great toolkit for working with morphological transducers, but it is pretty difficult to install, and also not very well integrated with Apertium / doesn't really follow the Apertium way of doing things. We'd like to make it more closely integrated. Francis Tyers, Tommi A Pirinen
2. Medium read more...
Plain-text formats for Apertium data
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
XSLT, XML, flex, bison Apertium data is currently largely encoded in XML-based formats. These are very overt and clear, but clumsy and hard to write. The idea is to make a plain-text format (based on the old MorphTrans format) and write converters to/from the existing XML based format. Many of our developers like the XML-based transfer and dictionary formats, but there are always some who would prefer a more texty format. This idea would make them happier. Happy developers write more code! Mlforcada
2. Medium read more...
Improving support for non-standard text input (2014 project)
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
Python, XML, familiarity with linguistic issues, knowledge of FSTs preferable Create a module that will standardise non-standard input. For example, slang, abbreviations. Machine translation systems, especially rule-based systems, are pretty fragile when it comes to non-standard input. Get a comma, space, apostrophe or hyphen in the wrong place and it can come out all wrong. But, we definitely want to be able to translate IRC, SMS, Tweets and Youtube comments... Francis Tyers
3. Entry level read more...
Apertium assimilation evaluation toolkit (2014 project)
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
A scripting language Starting from files containing sentences in the source language and reference translations, generate tests for human evaluation consisting of: (1) (optionally) the source sentence, (2) (optionally) the machine-translated version of the source sentences and (3) a reference translation of the sentence in which one or more content words have been deleted. The idea is to measure how the ability of human subjects to fill in the holes improves when the source or a machine translation of it are presented. The task involves also generating a program that computes the success as a function of the information presented to the user, and utilities to make the whole process automatic given an Apertium language pair. Many Apertium language pairs are designed for assimilation (gisting) purposes. The evaluation described would measure how helpful they are in the task. Francis Tyers, Mikel Forcada
3. Entry level read more...
Corpus-based lexicalised feature transfer
How ?
(required skills)
What ?
(description)
Why ?
(rationale)
Who ?
(mentors)
C++, NLP Make a module that sits somewhere in the Apertium pipeline (somewhere after the lexical selection and before morphological generation) that sets features (eg. tags) based on a model generated from a corpus. Let's get down to brass tacks, sometimes we get really inadequate translations even though you'd never hear stuff like that. One of those things is when we output something as definite when it is never used as definite. One way of dealing with this is a lot of rules and lists in transfer, but those are hard to do. So, how about looking at a corpus for information about some features like definiteness, aspect, evidentiality, impersonal/reflexive pronoun use in Romance languages etc. Francis Tyers, Jimregan
1. Hard read more... (2012 project)
  1. Koichi Takeda "Pattern-Based Context-Free Grammars for Machine Translation"
  2. Gábor PRÓSZÉKY and László TIHANYI "MetaMorpho: A Pattern-Based Machine Translation System"