Search results

• Explain translation
  sourceLanguage targetLanguage S S input text
  4 KB (603 words) - 16:13, 6 January 2015
• Testvoc
  When using <code>lt-trim</code>, there's no need to testvoc the analyser→bidix step (the '@'-marks), since the ana However, you still need to look for #'s and /'s with
  9 KB (1,400 words) - 22:30, 18 January 2021
• Ideas for Google Summer of Code/Command-line translation memory fuzzy-match repair
  ...E. Ortega, [[User:mlforcada|Mikel L. Forcada]] and [[User:Fsanchez|Felipe Sánchez Martínez]]. s' = “Connect the printer to the computer”
  5 KB (662 words) - 19:51, 24 March 2020
• User:Pankajksharma/Patcher
  ...job of this patcher is to obtain T' i.e., the corresponding translation of S'. S T S1 LP
  10 KB (1,420 words) - 08:30, 2 June 2016
• Listage des éléments d'Apertium en ligne de commandes
  ...re apertium du dépôt était composé exclusivement de sous-répertoires appelés ''[[Classement des paires de langues selon leur état d'avancement|branches ...actuelle d'Apertium, tous les éléments du projet sont directement implantés dans un sous-répertoire de la racine "apertium" (https://github.com/aperti
  9 KB (1,525 words) - 21:32, 17 February 2019
• Dictionnaire morphologique
  ...transducteurs à états finis, de cette manière ils peuvent aussi être appelés ''transducteurs lexicaux''. La tâche d'un dictionnaire morphologique est d ...ont formés depuis les plus petites unités et comment ces plus petites unités interagissent.
  16 KB (2,423 words) - 12:07, 7 October 2014
• Generating lexical-selection rules from a parallel corpus
  [[Génération de règles de sélection lexicale depuis un corpus parallèle|En français]] ...en-es/europarl-en-es.tagged.es | grep '<' | cut -f2 | sed 's/ /~/g' | sed 's/\$[^\^]*/\$ /g' > data-en-es/europarl-en-es.tagged.new.es
  15 KB (2,206 words) - 13:58, 7 October 2014
• User talk:Francis Tyers
  Francis, there's an import and export feature of the mediawiki engine, If you tweak it someh We have been working on extracting information from Jan Deloof's dictionary of Breton--Dutch, which he let us use under the GPL. Do you know
  47 KB (7,745 words) - 04:47, 10 March 2019
• Morphological dictionary
  * a number of intermediate '''states''', often denoted by <math>S</math> ...'input alphabet''', <math>\Sigma</math> (the characters 'b', 'e', 'r' and 's')
  15 KB (2,200 words) - 12:04, 6 October 2014
• Talk:Welsh to English
  ; gwallt yr eneth - *hair the girl - the hair of the girl - the girl's hair ; llaw y bachgen - *hand the boy - the hand of the boy - the boy's hand
  47 KB (8,338 words) - 18:14, 10 July 2010
• English and Esperanto/Proposed future tests
  =Hèctor Alòs i Font= Nun "told" estas tradukita al *disdiri --[[User:Hectoralos|Hèctor Alòs i Font]] 06:26, 28 January 2009 (UTC)
  34 KB (6,154 words) - 18:44, 5 June 2011
• Apertium, Tvorba novej dvojice jazykov
  ...á, že pracuje zo slovníkmi a pravidlami na preklad, na rozdiel od systémov s hlbokým prenosom, ktoré vykonávajú plnú syntaktickú analýzu. Pravidl ...adať alebo mazať lexikálne položky, ako bude popísané neskôr. Tieto súbory sú:
  32 KB (5,439 words) - 07:05, 16 February 2015
• Talk:Ideas for Google Summer of Code
  ...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. || ...raction''' || 2.&nbsp;Hard || Writing a C++ wrapper around Markus Forsberg's [[Extract]] tool (version 2.0) as a library to allow it to be used with Ape
  71 KB (10,374 words) - 21:14, 18 January 2021
• Talk:Constraint-based lexical selection module
  ...f "match" tags, eg. when we compile, we just expand "list-items" to "match"s. This means that if we want it to be a list in the normal sense, we need to ...in the &lt;or&gt;, should we read them as independent of each other? that's a bit confusing since otherwise they're all required and have a certain ord
  12 KB (1,761 words) - 14:10, 19 August 2014
• Listing Apertium element using command-line
  sed "s/.*$motifsed// s/<\/span>.*//" | sort<br />
  8 KB (1,327 words) - 21:34, 17 February 2019
• User talk:Khannatanmai/GSoC2020Proposal Trimming
  You should see how much secondary information VISL's streams have. Noun semantics, verb frames, dependency, markup tags, etc. Be No, it must be per-reading, because it's tied to each reading.
  13 KB (2,118 words) - 10:04, 3 May 2020
• A long introduction to transfer rules
  ...ompared to many other formalisms,<ref>e.g. Matxin, OpenLogos, ...</ref> it's fairly straightforward. Maybe one of the reasons people struggle is that we ...hat we can. If you come at rule-learning expecting something else, then it's likely to be confusing.
  28 KB (4,478 words) - 12:25, 17 March 2022
• Task ideas for Google Code-in
  * multi = number of students who can do a given task (GCI's "max instances") ...the <tt>kir-eng-transfer</tt> Apertium mode. Determine what rule(s) need(s) to be added (or fixed) to cover this structure, and update <tt>apertium-en
  32 KB (4,862 words) - 06:23, 5 December 2019
• User:Unhammer/wishlist
  See also [[Talk:Northern Sámi and Norwegian#Wishlist / Difficulties with the architecture / Ugly_hack ...e words like "more/most" in t1x if we're translating to/from synthetic adj's, so for that input we can output "adj adj adj n n" (added more/most), or "a
  17 KB (2,774 words) - 07:27, 20 January 2023
• User:Aikoniv/hfst-optimized-lookup.notes
  - constructor takes a FILE* and fread's the various properties - Each contains a list of SymbolNumber's and of more LetterTrie's
  13 KB (1,737 words) - 21:51, 27 May 2010

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