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.

Page title matches

  • 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
  • Some pointers to useful Wiki pages for writing transfer rules: * [[A long introduction to transfer rules]]
    520 bytes (44 words) - 17:12, 20 December 2016
  • ...[Ideas_for_Google_Summer_of_Code/Weighted_transfer_rules|Weighted transfer rules project]] conducted by [[User:Nikita Medyankin|Nikita Medyankin]] at Google ...e takes exclusive precedence and blocks out all its ambiguous peers during transfer precompilation stage.
    9 KB (1,387 words) - 13:37, 23 August 2016
  • 14 KB (1,120 words) - 12:59, 28 November 2018
  • This page provides general documentation on the transfer rules used in the English-Catalan pair. The tables are generated from the data an |Adds 'més' before an adjective in comparative or superlative form (for rules with two adjectives).
    45 KB (7,840 words) - 10:56, 18 September 2017
  • https://svn.code.sf.net/p/apertium/svn/branches/weighted-transfer/ ...nsfer module from https://svn.code.sf.net/p/apertium/svn/branches/weighted-transfer/apertium/.
    11 KB (1,215 words) - 14:43, 17 April 2018
  • Writing transfer rules seems to be tricky. People generally understand the basic concepts, but the * There are no recursive rules. Rules match fixed-length patterns. There is no optionality at the level of words.
    28 KB (4,478 words) - 12:25, 17 March 2022
  • ...of this task is to allow rules to conflict and to select the most adequate rules for an input using weights. ; Lexicalised rules weights: Depend on one or more of the lemmas of the input words. e.g.
    5 KB (804 words) - 11:54, 9 March 2017
  • ==Transfer rules German->Danish== ===Single word rules German->Danish===
    2 KB (351 words) - 18:50, 30 October 2016
  • Apertium structural transfer rules are currently encoded in XML-based formats. These are very overt and clear, ...rrent XML-based language, allows for a graphical, intuitive editing of the rules, and writes compilable .t1x, .t2x or .t3x files)
    1 KB (162 words) - 01:11, 18 August 2015
  • ...ting transfer rules who chose to do that. The examples given are the first rules written to translate a group of one, two or three Esperanto words into a gr ...ool ''apertium-transfer''. Writing tags used for [[chunking]] in a 3-stage transfer is not approached there.
    58 KB (8,365 words) - 20:16, 26 June 2018

Page text matches

  • ...bytecode transfer gives exactly the same result''' as the old interpreted transfer, down to the handling of wrong clip statements (but excluding invoking macr ....svn.sourceforge.net/viewvc/apertium/trunk/lttoolbox-java/src/org/apertium/transfer/development/FindAndCompareAllReleasedTransferFiles.java?revision=20387&view
    67 KB (9,057 words) - 06:52, 24 September 2013
  • analysis of Apertium) and in the transfer and generation, the transducers from The design is based on the classic transfer architecture of machine translation,
    58 KB (8,964 words) - 11:11, 14 May 2016
  • Writing transfer rules seems to be tricky. People generally understand the basic concepts, but the * There are no recursive rules. Rules match fixed-length patterns. There is no optionality at the level of words.
    28 KB (4,478 words) - 12:25, 17 March 2022
  • ...ting transfer rules who chose to do that. The examples given are the first rules written to translate a group of one, two or three Esperanto words into a gr ...ool ''apertium-transfer''. Writing tags used for [[chunking]] in a 3-stage transfer is not approached there.
    58 KB (8,365 words) - 20:16, 26 June 2018
  • ...clude mainly dictionaries (monolingual and bilingual), structural transfer rules that perform grammatical and other transformations between the two language ...nly the bilingual data (lexical selection, bilingual transfer and transfer rules) in the "pair" directory.
    50 KB (7,915 words) - 00:04, 10 March 2019
  • ...s of interesting grammatical features that we're going to use to write the rules. First we define some part-of-speech and morphological tags, e.g. After we've defined our terms, next come the rules, in the first section we're going to map the relations to the words in the
    53 KB (8,811 words) - 04:05, 21 January 2017
  • ...how how basic (that is, single level) morphological and syntactic transfer rules can be made in Apertium. ...atures they share, and how they are distinguished. When working on shallow-transfer machine translation, we can consider for example, both morphological contra
    16 KB (2,302 words) - 12:00, 31 January 2012
  • ...how how basic (that is, single level) morphological and syntactic transfer rules can be made in Apertium. ...atures they share, and how they are distinguished. When working on shallow-transfer machine translation, we can consider for example, both morphological contra
    16 KB (2,303 words) - 08:22, 10 May 2013
  • ...how how basic (that is, single level) morphological and syntactic transfer rules can be made in Apertium. ...atures they share, and how they are distinguished. When working on shallow-transfer machine translation, we can consider for example, both morphological contra
    16 KB (2,303 words) - 10:57, 30 October 2015
  • ...MT, but also to be able to intervene on the code to modify and change the rules. ...attiva.it/uri-res/N2Ls?urn:nir:stato:costituzione:1947-12-27!vig=.*], and "Rules on protection of historical linguistic minorities" [http://www.camera.it/pa
    21 KB (3,171 words) - 14:34, 3 April 2017
  • ...trange rules and also rules that may not be correct. Try to understand the rules we have. * Make sure all new rules have the correct superblank management
    20 KB (2,856 words) - 06:26, 27 May 2021
  • ===Transfer=== ...from this representation using both bilingual dictionaries and grammatical rules.
    12 KB (1,464 words) - 12:00, 31 January 2012
  • ===Transfer=== ...from this representation using both bilingual dictionaries and grammatical rules.
    11 KB (1,519 words) - 06:51, 11 May 2013
  • ===Transfer=== ...from this representation using both bilingual dictionaries and grammatical rules.
    11 KB (1,519 words) - 18:27, 16 October 2015
  • ...data. The data consists, on a basic level, of three dictionaries and a few rules (to deal with word re-ordering and other grammatical stuff). ...ished from deep-transfer in that it doesn't do full syntactic parsing, the rules are typically operations on groups of lexical units, rather than operations
    36 KB (5,933 words) - 16:14, 22 February 2021
  • ...stvoc clean -- it is missing some dictionary entries, and some rules. Some rules have been worked on, but are in an incomplete state. ...ysers for Czech and Polish, along with a lot of manual work. Some transfer rules were added for different phenomena between Polish and Czech.
    16 KB (2,571 words) - 12:21, 20 June 2019
  • There are two main issues with transfer in this case, the first is re-ordering, from <code>OVS → SVO</code>, the ...or word-category disambiguation and for specifying chunking and dependency rules. There are two more stages that come before morphological analysis, tokenis
    26 KB (4,167 words) - 13:05, 11 May 2016
  • ...[Ideas_for_Google_Summer_of_Code/Weighted_transfer_rules|Weighted transfer rules project]] conducted by [[User:Nikita Medyankin|Nikita Medyankin]] at Google ...e takes exclusive precedence and blocks out all its ambiguous peers during transfer precompilation stage.
    9 KB (1,387 words) - 13:37, 23 August 2016
  • ===Lexical transfer/Translation/bidex lookup=== This tool runs the bilingual dictionary transfer,
    29 KB (4,687 words) - 16:28, 5 June 2020
  • ...ransfer module is necessary. This session describes the Apertium 3+ level transfer system which was designed to allow easier treatment of longer patterns, and ===Chunking-based transfer===
    14 KB (1,969 words) - 12:00, 31 January 2012

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