Search results

• Spanish and Esperanto/Quality tests
  Number of unknown words (marked with a star) in test: 117<br/> Percentage of unknown words: 3,87 %<br/>
  98 KB (16,331 words) - 20:28, 30 September 2011
• Evaluation
  Note: Reference translation MUST have no unknown-word marks, even if systems that do not mark unknown words with a star.
  6 KB (981 words) - 09:13, 21 November 2021
• Starting a new language with lttoolbox
  hsb.dix:25: element s: validity error : IDREF attribute n references an unknown ID "nom" hsb.dix:33: element s: validity error : IDREF attribute n references an unknown ID "nom"
  19 KB (3,440 words) - 12:10, 26 September 2016
• Matching unknown words
  ...interchunk, this is quite easy, as each unknown word has the chunk lemma 'unknown', but it's un- or under-documented how this should be done using apertium-t
  2 KB (209 words) - 11:06, 24 March 2012
• Как использовать lttoolbox, чтобы разработать новый морфологический анализатор
  hsb.dix:25: element s: validity error : IDREF attribute n references an unknown ID "nom" hsb.dix:33: element s: validity error : IDREF attribute n references an unknown ID "nom"
  25 KB (2,260 words) - 18:36, 12 January 2012
• Morphology of Turkmen
  === Unknown ===
  4 KB (682 words) - 11:14, 16 April 2012
• Xml grep
  ==I get "Unknown option --xpath"==
  5 KB (863 words) - 09:04, 10 October 2017
• Jorgal
  ==How do I see unknown words?==
  2 KB (331 words) - 12:03, 28 February 2017
• Bosnian-Croatian-Montenegrin-Serbian and Slovenian
  echo unknown; coverage = 1 - unknown / total
  6 KB (625 words) - 16:54, 1 July 2013
• Improved corpus-based paradigm matching
  ...orpus, using your existing analyser, and tagger to give possible values to unknown words <spectie> you would assign possible values for case/number/gender to the unknown surface forms of *fizikalne and *matematične based
  4 KB (611 words) - 14:26, 10 February 2015
• Helsinki Apertium Workshop/Session 8
  ...high, and compares with commercial systems -- over 95% coverage (around 5 unknown words out of 100 words), and between 3-7% word-error rate (out of 100 words ...final coverage of the system was around 90%, e.g. over a set of corpora 10 unknown words out of 100 on average. The word-error rate was around 17%, meaning th
  12 KB (1,683 words) - 08:42, 10 May 2013
• Task ideas for Google Code-in/Add words
  ...from Wikipedia, newspapers, literature, etc.) detect the 50 most frequent unknown words (source words which are not in the dictionaries of the language pair # add these words to the source dictionary (so that they are not unknown anymore), add the correspondence to the bilingual dictionary, and add the w
  2 KB (271 words) - 05:34, 17 December 2015
• Tatar and Russian
  ...rus-nova.txt, -ref = tat-rus-posted.txt). WER / PER results are given when unknown-word marks (stars) are not removed. ...if it's usable by that time. || '''Midterm evaluation'''<br/>Results when unknown word-marks (stars) are not removed<br/>tat-rus/texts/text1.* (full coverage
  8 KB (1,006 words) - 12:48, 9 March 2018
• Lttoolbox-java
  -e: morphological analysis, with compound analysis on unknown words -n: morph. generation without unknown word marks
  9 KB (1,370 words) - 09:49, 7 April 2020
• Tartu Apertium Course/Session 8
  ...high, and compares with commercial systems -- over 95% coverage (around 5 unknown words out of 100 words), and between 3-7% word-error rate (out of 100 words ...final coverage of the system was around 90%, e.g. over a set of corpora 10 unknown words out of 100 on average. The word-error rate was around 17%, meaning th
  12 KB (1,683 words) - 11:00, 30 October 2015
• Automated extraction of lexical resources
  ...verb conjugations, declensions, etc. More generically, upon finding a new unknown word, we can productively generate all its inflections according to every p ...ome constraints, which we can use in order to gather information about an unknown word. More generically, we can gather information about a word knowing whic
  6 KB (928 words) - 13:57, 3 April 2009
• Matxin New Language Pair HOWTO
  ...smi="v|tv|fut|p1|sg" si="root" UpCase="none" lem="iç" mi="v|tv|fut|p1|sg" unknown="transfer"> ...="0" slem="bira" smi="n|acc" si="dobj" UpCase="none" lem="bira" mi="n|acc" unknown="transfer">
  53 KB (8,811 words) - 04:05, 21 January 2017
• Norwegian Nynorsk and Norwegian Bokmål/arkiv
  ...analysis. This could happen by changing lt-proc (fst_processor.cc) so that unknown words are sent to a decompounding-function that tries various strategies (l * If the first member is unknown, choose the analysis with the longest last member.
  13 KB (2,051 words) - 10:24, 22 September 2010
• English and Catalan/Transfer Rules
  |unknown |REGLA: unknown
  45 KB (7,840 words) - 10:56, 18 September 2017
• Ideas for Google Summer of Code/Detect hidden unknown words
  '''Detect hidden unknown words by using the probabilities of the HMM-based part-of-speech tagger in ...orms for which there exists at least one lexical form cannot be considered unknown and there is no way to know whether the set of possible lexical forms provi
  2 KB (277 words) - 19:51, 24 March 2020

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