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.

  • ==Transfer rules==
    2 KB (248 words) - 13:34, 10 December 2010
  • * Write transfer rules for function words * Write transfer rules for nominals
    4 KB (423 words) - 17:08, 14 June 2018
  • ...hrase co-ordinators from noun phrase co-ordinators lets you write transfer rules to merge two co-ordinated NPs. ...nting part of it can prove useful in writing transfer or lexical selection rules.
    7 KB (922 words) - 08:16, 8 October 2014
  • ...th the Ordbank, and the constraint grammar, and wrote a series of transfer rules. ...en another week converting the Oslo-Bergen tagger. Three weeks on transfer rules, and then another three weeks expanding the dictionaries. Two weeks were th
    12 KB (1,679 words) - 12:00, 31 January 2012
  • ...th the Ordbank, and the constraint grammar, and wrote a series of transfer rules. ...en another week converting the Oslo-Bergen tagger. Three weeks on transfer rules, and then another three weeks expanding the dictionaries. Two weeks were th
    12 KB (1,683 words) - 08:42, 10 May 2013
  • ===Visual interface for editing transfer rules===
    2 KB (200 words) - 08:21, 13 January 2015
  • ...th the Ordbank, and the constraint grammar, and wrote a series of transfer rules. ...en another week converting the Oslo-Bergen tagger. Three weeks on transfer rules, and then another three weeks expanding the dictionaries. Two weeks were th
    12 KB (1,683 words) - 11:00, 30 October 2015
  • ...k. Use the relations GF returns (all of which are hard-coded for different rules). Bonus: use closely related language treebanks in UDPipe; transfer the lemmas, assume the POS tags remain the same (reasonable assumption). Us
    4 KB (657 words) - 08:58, 3 April 2017
  • ===Transfer rules=== Adding to section <section-rules>
    2 KB (240 words) - 09:55, 24 April 2018
  • ==Editing XML (dix, transfer rules) in vim==
    2 KB (359 words) - 16:00, 2 January 2021
  • ...s also contained in the transducers generated by <code>apertium-preprocess-transfer</code>. ...e rules which generate different output in different situations as well as rules which generate multiple outputs, the simplest way do deal with them is to t
    3 KB (525 words) - 06:12, 1 June 2023
  • | 142 || apertium-preprocess-transfer doesn't allow DOCTYPE declaration.... | 140 || apertium-transfer -b outputs tl tag when asked for sl tag if sl tag empty...
    12 KB (1,254 words) - 22:08, 7 March 2018
  • ...', but it's un- or under-documented how this should be done using apertium-transfer. <transfer default="chunk">
    2 KB (209 words) - 11:06, 24 March 2012
  • ==Transfer== * [[A long introduction to transfer rules]]
    2 KB (182 words) - 08:35, 16 May 2013
  • This page provides general documentation on the transfer rules used in the Romanian-Catalan pair. The tables are generated from the data a === Extra transfer (T4X) ===
    14 KB (1,989 words) - 10:06, 28 November 2018
  • The t2x rules may have completely "correct" blank handling in that they output all input # Transfer modules have to treat the inline-blanks differently from other superblanks
    10 KB (1,676 words) - 18:32, 21 June 2020
  • [[VM for transfer|In English]] | align=center | Header || <code>#<assembly><br /> #<transfer default="chunk"></code> || align=center | ---- || Cette section établit le
    14 KB (2,144 words) - 14:05, 7 October 2014
  • Lexical transfer: Lexical selection rules:
    6 KB (412 words) - 23:31, 31 January 2020
  • ...0]. We would like linguists to be able to fearlessly write recursive (rtx) rules based on what makes linguistic sense, and have rtx-proc/rtx-comp deal with ...Google_Summer_of_Code/Robust_recursive_transfer]] The first GsoC recursive transfer project
    1 KB (211 words) - 09:22, 6 February 2024
  • ...ning corpus by taking into account the patterns detected by the structural transfer module, and translates to the target language all possible disambiguation p ...ansfer rules (right now, it only "understands" one-level, shallow-transfer rules).
    2 KB (260 words) - 19:55, 24 March 2020

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