Search results

Create the page "B" on this wiki!

• UNLization
  <b>UNLization</b>, formerly known as enconversion, is the process of "representing" the cont |F,B
  6 KB (977 words) - 19:38, 21 September 2012
• Basic Symbols
  |<nowiki>{a|b}</nowiki> = a or b
  877 B (128 words) - 13:12, 27 August 2013
• Relations
  ...ween two nodes: one having the string "a" and the other having the string "b" *L("a";"b") (the same as above)
  5 KB (828 words) - 18:35, 21 August 2013
• Node
  *rel("a";"b") (a relation rel between the nodes ("a") and ("b")) #:rel("a";"b") (relation rel between the nodes ("a") and ("b"))
  9 KB (1,512 words) - 10:21, 14 February 2014
• Anchor
  | &lt;b&gt; || Defines bold text ...ed to have two anchors: <nowiki><i>ABC</i></nowiki> and <nowiki><b>ABCDEF</b></nowiki>.
  4 KB (727 words) - 14:23, 22 July 2013
• N-gram
  ...am “a b . d”, i.e., if there is at least one “a x . d” where x ≠ b.=
  4 KB (669 words) - 14:03, 12 May 2015
• N-rule
  *assign sentence boundaries: "ab" > "a"<STAIL>"b" ...):=("-");" will transform "a b c d e" into "a-b-c-d-e" (and not only in "a-b c d e")
  7 KB (1,085 words) - 15:25, 16 July 2014
• A-rule
  | X:=["b"]>"y"; | if X add "y" to the right of "b";
  12 KB (1,892 words) - 14:00, 5 September 2014
• Degree
  :<nowiki>more <A> than <B> = bas(A.@more, B)</nowiki> :<nowiki>less <A> than <B> = bas(A.@less, B)</nowiki>
  3 KB (425 words) - 12:35, 15 April 2014
• Inflection
  *"a","b","c","d" and "e" are appending forms (affixes, adpositions, particles, auxi
  9 KB (1,371 words) - 14:24, 30 January 2014
• NL Reference Corpus
  ...a part of the NC corpus: the training corpora (A) and the testing corpora (B). !colspan=6|Test Corpora (B)
  5 KB (816 words) - 13:44, 18 April 2014
• D-rule
  ...ity is blocked, <b>try first other candidate tokens for the other strings</b> before trying other candidate tokens for this string" ...ility is blocked, <b>do not try any other candidate token for this string</b>, i.e., try only other candidate tokens for the other strings"
  14 KB (2,227 words) - 11:53, 30 January 2015
• L-rule
  *reordering nodes in a list: a b c > a c b *replacing nodes in a list: a b c > a x c
  6 KB (1,067 words) - 10:41, 15 February 2014
• Hyper-node
  *(("a")("b")) - a hyper-node containing a list relation between two nodes *(L("a";"b")) - the same as above
  7 KB (1,091 words) - 13:23, 24 June 2014
• Regular expression
  *[/[abc]/] matches the natural language entries "a", "b" and "c" |match "a" plus "b", "c" or "d", plus "e"
  3 KB (534 words) - 13:43, 16 June 2014
• S-rule
  #*rel("a";"b"); (relation with two arguments) #*rel("a";"b";"c"); (relation with three arguments)
  6 KB (904 words) - 17:33, 24 June 2014
• Syntactic structures
  ...guration of the sentence, while <b>head-driven relations (XC, XS, XA, XH)</b> :*PB(PB("a";"b");"c"); is different from PB(PB("a";"c");"b");
  6 KB (1,037 words) - 01:59, 14 August 2013
• Semantic network
  ...sumption that, given rel(a;b) and rel(b;c), "a" is related to "c" through "b". As for (3g), this is another source of problem. We know that the scope of
  8 KB (1,430 words) - 08:23, 5 January 2014
• Movement
  :*X(%a;%b)Y(%c;%d):=Z(%a;%b); (the relation "Y(%c;%d)" will be deleted, even if it's not affected by th :*X(%a;%b)Y(%c;%d):=Z(%a;%b)Y(%c;%d); (the relation "Y(%c;%d)" is preserved)
  3 KB (443 words) - 13:33, 28 March 2010
• Tokenization
  |a b |["a b"], where "a b" = TEMP
  15 KB (2,369 words) - 11:28, 30 January 2015
• Issues
  :*(%a,A,B,C):=((%a,+E); (This rule is being accepted by the system) ::XB:%a(%x;%y)XB:%b(%x;%z):=XB:%a(XB(%x;%y);%z); the relation XB(%x;%y) will be created as a sc
  8 KB (1,265 words) - 14:55, 3 February 2014
• Localization
  **::<nowiki>("a",[b],[[c]],D=E,F,%g):=(%g)("g")</nowiki>; **::IF there is node whose string is "a", whose natural language word is "b", whose UW is "c", and which has the feature D with the value E, and the fe
  7 KB (1,159 words) - 19:06, 14 August 2013
• Default grammar
  :("a")(" ")("b") > ("a")("b")
  11 KB (1,823 words) - 22:14, 7 November 2012
• T-rule
  ...e>(%x,A):=(%x,+B);</strike> (creates an infinite loop, because the feature B will be added infinitely to the node %x)<br /> ... endless repetition, the condition side must be changed to (%x,A,^B):=(%x,+B); (the rule applies only once)
  36 KB (6,277 words) - 09:15, 28 May 2014
• BRUNO
  The project BRUNO ('''B'''asic '''R'''esources for '''UN'''Lizati'''O'''n) is devoted to the creati
  7 KB (1,089 words) - 08:47, 28 May 2014
• FoR-UNL
  *'''B''' - Intermediate Level
  3 KB (356 words) - 14:49, 20 February 2014
• Transformation over hyper-nodes
  ...:=(%a,"c");(the string of the hyper-node is set to "c"; the internal node %b is not affected) ...)):=(%a,"");(the string of the hyper-node is set to ""; the internal node %b is not affected)
  5 KB (983 words) - 19:54, 6 December 2013
• Index
  :*(%a)(%b)(%c):=(%b); (delete the first and the third nodes, and keep the second) :*(%a)(%b)(%c):=(%c)(%b)(%a); (reverse the order)
  4 KB (825 words) - 15:58, 30 June 2014
• Hyper-relation
  *XP(XB(%a;%b);%c) - the source argument of the hyper-relation XP is a relation *XP(%a;XB(%b;%c)) - the target argument of the hyper-relation XP is a relation
  2 KB (323 words) - 20:05, 26 August 2013
• Transformation over nodes
  ...ted by the rule; all other elements are preserved. The resulting node is ("b",[a],<nowiki>[[a]]</nowiki>,A) ) :*("a"):=(+"b"); (the string of the node is set from "a" to "b")
  12 KB (2,089 words) - 14:20, 16 June 2014
• Transformation over relations
  *rel(%x,A;%y,B):=rel(%x,+C;%y,+D); (add the feature C to %x and D to %y) *rel(%x,A;%y,B):=rel(%x,C;%y,D);(the same as above)
  3 KB (559 words) - 11:51, 5 November 2013
• II UNL Panel
  :b) agt(killled,disappointment.@metaphor), i.e., as an agent relation between :b) under(book,table), i.e., as a specific relation "under" between "book" and
  11 KB (1,689 words) - 11:23, 5 December 2014
• Constituency score
  For instance, given the n-gram “a b c” and the corpus below: x a b c #
  7 KB (1,204 words) - 14:03, 9 April 2015