Search results

Jump to navigation Jump to search
  • ...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
  • ...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
  • -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
  • ...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
  • ...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
  • ...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
  • ...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
  • |unknown |REGLA: unknown
    45 KB (7,840 words) - 10:56, 18 September 2017
  • '''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
  • ...m Wikipedia, newspapers, literature, etc.) '''detect the 250 most frequent unknown words''' (words in the source document which are not in the dictionary). S ...opriate <code>.dix</code> or <code>.lexc</code> file) so that they are not unknown anymore. Make sure to categorise stems correctly (this can be hard, so ple
    2 KB (299 words) - 19:44, 30 December 2019
  • ...m Wikipedia, newspapers, literature, etc.) '''detect the 200 most frequent unknown words''' (words in the source document which are not in the bilingual dicti ...ropriate <code>.dix</code> file) in [[bidix]] format (so that they are not unknown anymore), as well as the monolingual analysers if needed. Make sure to cat
    2 KB (320 words) - 15:01, 19 January 2020
  • <pre>LIST unknown = ("\\*.*"r) ; </pre> <pre>SELECT proper-name IF (1 unknown);</pre>
    8 KB (1,211 words) - 23:02, 4 April 2021
  • ...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,679 words) - 12:00, 31 January 2012
  • ...in extending dictionaries by assigning stems and inflectional paradigms to unknown words] (pp.19-26.). EAMT 2014 – 17th Annual conference of the European As ...sites/default/files/FreeRBMT-2012.pdf#33 Choosing the correct paradigm for unknown words in rule-based machine translation systems]. Third International Works
    33 KB (4,418 words) - 11:52, 29 December 2021
  • echo unknown; coverage = 1 - unknown / total
    6 KB (625 words) - 16:54, 1 July 2013
  • The analysis of an unknown word is (ignoring the full stop information):
    10 KB (1,626 words) - 17:46, 13 January 2020
  • | [[Matching unknown words]]
    13 KB (1,601 words) - 23:31, 23 July 2021
  • # Check words in corpus which are analysed, but then have an apostrophe and unknown word after (e.g. case ending) ... perhaps they need to be added as proper n
    2 KB (378 words) - 18:27, 8 March 2018
  • ...ions. The word is the question, and the possible analyses are the answers. Unknown words can be thought of as questions we don't know what the possible answer
    13 KB (2,076 words) - 12:13, 26 September 2016
  • ERROR ALT80590: Transducer has features that are unknown to this version of lttoolbox - upgrade!
    122 bytes (18 words) - 21:46, 31 October 2023

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