Search results

Jump to navigation Jump to search
  • This page was written by Jatin Luthra, a 2016 Google Code-in student, which explains how to install Apertium on FreeBSD
    595 bytes (84 words) - 02:55, 9 March 2018
  • * Writing a method for <code>liblttoolbox</code> which would allow analysis of a string as opposed to a file stream. [[Category:Ideas for Google Summer of Code|Improve integration of lttoolbox in libvoikko]]
    932 bytes (130 words) - 14:22, 29 February 2012
  • * Propose ways in which they might be solved. [[Category:Ideas for Google Summer of Code|Improving support for non-standard text input]]
    902 bytes (121 words) - 12:50, 10 March 2014
  • * Fix [https://sourceforge.net/p/hfst/bugs/153/ this bug] in <code>hfst-proc</code> tokenisation. * Make <code>hfst-expand</code> obey flag diacritics.
    1 KB (170 words) - 23:58, 5 April 2013
  • * Write a XSLT sheet that transforms as many entries <e> as possible in the standard section of the dictionary as follows: [[Category:Ideas for Google Summer of Code|Unify the metadix formats]]
    1 KB (243 words) - 11:47, 14 February 2014
  • ...e transducer. It might be a good idea to express this as constraint rules, in a novel XML-based file format. ...rocessor (see [[Apertium stream format]]) for the output of <code>lt-proc</code> that parses character by character, respecting [[superblanks]].
    2 KB (237 words) - 00:53, 24 March 2013
  • You could make a graph out of these dictionaries where each node is a word in a language, and each arc is a language pair. For example like: http://i.img * [[Ideas for Google Summer of Code/Improved bilingual dictionary induction]]
    3 KB (487 words) - 00:02, 22 March 2018
  • ...orts for the [[Indonesian and Malaysian]] translator in [[Google Summer of Code]] 2012. ...| <code><ij> <cnjcoo> <cnjsub> <cnjadv> <det> <pr> <num> <prn> <np> <adv></code>|| ||
    3 KB (402 words) - 17:05, 22 August 2012
  • [[Category:Tasks for Google Code-in|Unigram tagger]]
    255 bytes (43 words) - 14:56, 26 October 2014

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