Search results

Jump to navigation Jump to search
  • '''In progress''' A '''superblank''' is something that we don't want to translate, but keep in the output, often things like formatting tags.
    8 KB (1,364 words) - 12:15, 14 May 2017
  • ...make unrecommended changes. A lint tester would help people write standard code for dictionaries and transfer files. * Write a program which parses a <code>.dix</code> file and for each (surface form, lexical form) pair, lists entries/paradig
    5 KB (789 words) - 10:36, 31 May 2016
  • The language detection in the [[simple-html]] interface currently uses a 2.9M javascript file. The ob ===Implement language detection in apertium-apy===
    1 KB (205 words) - 20:49, 13 November 2013
  • [[File:pairviewer.png|right|thumb|350px|The Pairviewer in action.]] ...ally developed sometime before the [[GCI|Google Code-In]] 2013. Its source code can be [https://github.com/apertium/pairviewer found on GitHub] and an onli
    5 KB (702 words) - 01:34, 9 December 2018
  • ...ting Universal Dependencies. The objective of this project is to extend it in useful ways: * Server: The code that runs the server (Python)
    3 KB (302 words) - 19:03, 17 July 2018
  • ===Work in progress=== # Send us a pull request with your code.
    2 KB (305 words) - 01:43, 8 March 2018
  • # Write a number of transfer rules in this formalism for translating between a language pair. # Reimplement an existing language pair in trunk using your new formalism. This will involve rewriting the existing ru
    2 KB (307 words) - 19:16, 28 February 2019
  • ...English Pair is also a candidate for adoption as part of Google Summer of Code 2013 ideas for Apertium. Some ideas that you can base your proposal on: * Adding more words in the bdix and monodix
    1 KB (137 words) - 06:41, 27 April 2013
  • ...L tree-walking implementation. The job of this task is to optimise the C++ code to make it faster than XML tree-walking. ...nale 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 ar
    1 KB (181 words) - 13:41, 21 March 2013
  • ! Part-of-speech !! Code | Noun || <code>n</code>
    3 KB (286 words) - 22:00, 8 December 2019
  • Daniel Huang, Google Code In 2012 * C.B. van Haeringen, Netherlandic language research. Men and works in the study of Dutch, 2nd edition, Leiden: Brill 1960
    11 KB (1,584 words) - 15:59, 15 December 2012
  • ...nt efforts for the [[Maltese and Arabic]] translator in [[Google Summer of Code]] 2012. ...gual dictionary of the pair, that is, only containing stems which are also in the bilingual dictionary (but omissions leading to generation errors do not
    4 KB (404 words) - 15:28, 8 March 2013
  • The objective of these tasks is to write code to intersect two finite-state transducers. One transducer is a [[morphologi ...the set of strings in the morphological dictionary which have translations in the bilingual dictionary.
    5 KB (798 words) - 14:01, 17 March 2020
  • Google Code-In 2017 was certainly an overall success for Apertium. Students completed upwa ...an be improved so that mentors and students have an even better experience in the future.
    10 KB (1,668 words) - 02:46, 10 February 2018
  • This task is almost done, see -r59428 and -r57945 in apy SVN. * _e in mode names turns into underlined e in the dropdown, should just be _e
    4 KB (652 words) - 12:52, 26 March 2015
  • ...[http://wiki.apertium.org/wiki/User:Deltamachine/proposal Google Summer of Code 2017 project] ...was built. It works with fastText embeddings for every tag which was seen in the corpus: an embedding for a word is just a sum of all word's tags embedd
    5 KB (764 words) - 01:40, 8 March 2018
  • Words can have more than one possible interpretation, for example, "tie" in English can be a noun denoting an item of clothing "she put on her tie" or ...That is, for each ambiguous word you choose the appropriate interpretation in context.
    3 KB (574 words) - 16:30, 11 January 2020
  • This is the report for my 2016 Google Summer of Code project, Kurmanji-English Machine Translation. ...release quality. I have worked on adding vocabulary, disambiguation rules in CG, transfer rules and lexical selection.
    2 KB (335 words) - 10:29, 23 August 2016
  • ...odified by a number of people, including by BenStobaugh during Google Code-In 2013, and can be cloned from GitHub at [https://github.com/apertium/WikiExt ...outputs the text to one file. To use it, simply use the following command in your terminal, where dump.xml is the Wikipedia dump
    2 KB (360 words) - 18:55, 30 January 2023
  • * Implement in C++ and integrate into Apertium. * Set up a pair and train the existing weighted transfer rule code.
    5 KB (804 words) - 11:54, 9 March 2017

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)