Search results

Jump to navigation Jump to search

There is a page named "Transfer rules" on this wiki. See also the other search results found.

  • ...ven a default tag, a tag determined by a classifier or a tag determined by rules. after apertium-transfer:
    2 KB (356 words) - 21:15, 21 June 2020
  • ...nvolve writing linguistic data, including morphological rules and transfer rules — which are specified in a declarative language. A good intro would be to
    6 KB (1,024 words) - 15:22, 20 April 2021
  • strip tags, so after disambiguation with the following rules: ...ix and parametrized dictionaries]] on ''variants'' in monodix and transfer rules (not quite relevant any longer; most of the xslt features have been built i
    14 KB (2,355 words) - 10:33, 1 November 2022
  • You can also write lexical rules, so for example in Afrikaans, the word "deur" is ambiguous, one meaning is (Clarification: it only works with ''one-stage transfer'', so Apertium 3 pairs which only have t1x can still use it.)
    7 KB (1,058 words) - 07:37, 4 July 2016
  • ...rs for each language, and then making individual dictionaries and transfer rules for every pair. The current status of these goals is listed below.
    6 KB (595 words) - 23:13, 22 December 2014
  • * Add transfer rules, etc.
    2 KB (233 words) - 07:41, 14 August 2018
  • : should be possible to make transfer rules like "NP sein am V.inf" => "NP be V.progressive"
    3 KB (442 words) - 00:36, 5 January 2013
  • * XXX-YYY.t1x.bin :: the compiled transfer rules (stage 1 / chunking, or the only stage if no chunking used) when translatin
    890 bytes (126 words) - 10:10, 14 March 2017
  • ...blob/master/apertium/stream_entities.py https://github.com/krvoje/apertium-transfer-dsl/blob/master/apertium/stream_reader.py ...rtium stream format by declarative Esrap[https://github.com/scymtym/esrap] rules.
    6 KB (797 words) - 07:12, 29 March 2022
  • * [[Preparing to use apertium-transfer-tools]] * [[How to get started with lexical selection rules]]
    5 KB (599 words) - 19:04, 17 February 2020
  • ...mproving the engine, improved source-language analysis, improved bilingual transfer, new end-user application, improve existing end-user application, easing la ...k will be frozen and we will report to Google, to proceed according to the rules of GSoC.
    10 KB (1,500 words) - 16:23, 18 February 2016
  • ...al transfer, so if input is a determiner followed by a noun, and there are rules for "det", "n", and "det n", the "det n" rule will match.
    728 bytes (109 words) - 08:20, 24 February 2023
  • 16th August: Implement transfer rules in both directions based
    2 KB (208 words) - 16:53, 17 June 2010
  • This could make for a number of good transfer rules. ''Para'''t''' haya'' -> You have money. The pattern would be like nominal<
    5 KB (855 words) - 19:23, 27 August 2017
  • ...for X→Y translation with the addition of a CG for language X and transfer rules / dictionary for the pair X→Y. Below is listed development progress for e
    18 KB (2,312 words) - 18:25, 18 September 2016
  • ...an, sme, …) don't get testvoc problems, and possibly change their transfer rules/bidixes (and in some cases the easiest way is to update all the other other
    22 KB (3,325 words) - 14:06, 12 March 2018
  • === Rules === ''Comment'' : just transfer the lexical unit
    323 bytes (27 words) - 16:41, 15 August 2011
  • ...ranslation output by the structural-transfer module to see if the applying rules with new apertium were better or worse than the old apertium. We found out
    2 KB (348 words) - 10:16, 24 October 2018
  • ...pens after bidix lookup (word-translation), but before structural transfer rules. See [[Lexical selection]] for more information.
    4 KB (620 words) - 18:06, 26 September 2016
  • * Having zero-context rules in your .lrx files. Now you can just put the weights directly in your bilin ...efault translation as "1.0" and then all others as >1.0 ... because of how transfer works, it will always take the first, which will be the one with the lowest
    2 KB (353 words) - 09:32, 30 January 2019

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