A-rule

From UNL Wiki
(Difference between revisions)
Jump to: navigation, search
(→When not to use a-rules)
Line 30: Line 30:
 
   CONDITION := DELETED : "ADDED";
 
   CONDITION := DELETED : "ADDED";
 
Where:
 
Where:
−
*CONDITION = tag (such as “PLR”, “FEM”, etc) or list of tags (“FEM&PLR”) that indicates when the rule should be applied
+
*CONDITION = tag (such as "PLR", "FEM", etc) or list of tags ("FEM&PLR") that indicates when the rule should be applied
 
*ADDED (between quotes) = the string to be added ;
 
*ADDED (between quotes) = the string to be added ;
 
*REFERENCE (between square brackets) = the reference string (between quotes) or the position (without quotes) of the string to be added;
 
*REFERENCE (between square brackets) = the reference string (between quotes) or the position (without quotes) of the string to be added;
Line 43: Line 43:
 
! AFTER
 
! AFTER
 
|-
 
|-
−
|width=100| X:=”y”<”z”;
+
|width=100| X:="y"<"z";
−
|width=300| if X replace the string “z” by the string “y” in the beginning of the string
+
|width=300| if X replace the string "z" by the string "y" in the beginning of the string
 
|width=50| '''z'''abc
 
|width=50| '''z'''abc
 
|width=50| '''y'''abc
 
|width=50| '''y'''abc
 
|-
 
|-
−
| X:=”y”<1;
+
| X:="y"<1;
−
| if X replace the first character of the string  by “y”
+
| if X replace the first character of the string  by "y"
 
| '''z'''abc
 
| '''z'''abc
 
| '''y'''abc
 
| '''y'''abc
 
|-
 
|-
−
| X:=”y”<0;
+
| X:="y"<0;
−
| if X add the string “y” to the beginning of the string
+
| if X add the string "y" to the beginning of the string
 
| zabc
 
| zabc
 
| '''y'''zabc
 
| '''y'''zabc
 
|-
 
|-
−
| X:=”y”<;<ref>This feature is not supported by the UNL<sup>dev</sup>. The empty field is automatically replaced, in the UNL<sup>arium</sup>, by a "0".</ref>
+
| X:="y"<;<ref>This feature is not supported by the UNL<sup>dev</sup>. The empty field is automatically replaced, in the UNL<sup>arium</sup>, by a "0".</ref>
−
| if X add the string “y” to the beginning of the string (idem previous)
+
| if X add the string "y" to the beginning of the string (idem previous)
 
| zabc
 
| zabc
 
| '''y'''zabc
 
| '''y'''zabc
 
|-
 
|-
−
| X:=”y”<<0;
+
| X:="y"<<0;
−
| if X add the string “y” and a blank space to the beginning of the string
+
| if X add the string "y" and a blank space to the beginning of the string
 
| zabc
 
| zabc
 
| '''y''' zabc
 
| '''y''' zabc
 
|-
 
|-
−
| X:=”y”<<;
+
| X:="y"<<;
−
| if X add the string “y” and a blank space to the beginning of the string (idem previous)
+
| if X add the string "y" and a blank space to the beginning of the string (idem previous)
 
| zabc
 
| zabc
 
| '''y''' zabc
 
| '''y''' zabc
Line 81: Line 81:
 
! AFTER
 
! AFTER
 
|-
 
|-
−
|width=100| X:=”z”>”y”;
+
|width=100| X:="z">"y";
−
|width=300| if X replace the string “z” by the string “y” in the end of the string
+
|width=300| if X replace the string "z" by the string "y" in the end of the string
 
|width=50| abc'''z'''
 
|width=50| abc'''z'''
 
|width=50| abc'''y'''
 
|width=50| abc'''y'''
 
|-
 
|-
−
| X:=1>”y”;
+
| X:=1>"y";
−
| if X replace the last character of the string  by “y”
+
| if X replace the last character of the string  by "y"
 
| abc'''z'''
 
| abc'''z'''
 
| abc'''y'''
 
| abc'''y'''
 
|-
 
|-
−
| X:=0>”y”;
+
| X:=0>"y";
−
| if X add the string “y” to the end of the string
+
| if X add the string "y" to the end of the string
 
| abcz
 
| abcz
 
| abcz'''y'''
 
| abcz'''y'''
 
|-
 
|-
−
| X:=>”y”;<ref>This feature is not supported by the UNL<sup>dev</sup>. The empty field is automatically replaced, in the UNL<sup>arium</sup>, by a "0".</ref>
+
| X:=>"y";<ref>This feature is not supported by the UNL<sup>dev</sup>. The empty field is automatically replaced, in the UNL<sup>arium</sup>, by a "0".</ref>
−
| if X add the string “y” to the end of the string (idem previous)
+
| if X add the string "y" to the end of the string (idem previous)
 
| abcz
 
| abcz
 
| abcz'''y'''
 
| abcz'''y'''
 
|-
 
|-
−
| X:=0>>”y”;
+
| X:=0>>"y";
−
| if X add a blank space  and the string “y” to the end of the string
+
| if X add a blank space  and the string "y" to the end of the string
 
| abcz
 
| abcz
 
| abcz '''y'''
 
| abcz '''y'''
 
|-
 
|-
−
| X:=>>”y”;
+
| X:=>>"y";
−
| if X add a blank space  and the string “y” to the end of the string (idem previous)
+
| if X add a blank space  and the string "y" to the end of the string (idem previous)
 
| abcz
 
| abcz
 
| abcz '''y'''
 
| abcz '''y'''
Line 129: Line 129:
 
| ab'''y'''c
 
| ab'''y'''c
 
|-
 
|-
−
| X:=["b"]>”y”;
+
| X:=["b"]>"y";
 
| if X add "y" to the right of "b";
 
| if X add "y" to the right of "b";
 
| abc
 
| abc
Line 147: Line 147:
 
! AFTER
 
! AFTER
 
|-
 
|-
−
|width=100| X:=”y”;
+
|width=100| X:="y";
−
|width=300| if X replace the whole by “y”
+
|width=300| if X replace the whole by "y"
 
|width=50| X
 
|width=50| X
 
|width=50| '''y'''
 
|width=50| '''y'''
 
|-
 
|-
−
| X:=”z”:”y”;
+
| X:="z":"y";
−
| if X replace the string “z” by “y”
+
| if X replace the string "z" by "y"
 
| a'''z'''bc
 
| a'''z'''bc
 
| a'''y'''bc
 
| a'''y'''bc
 
|-
 
|-
−
| X:=[2-3]:”y”;
+
| X:=[2-3]:"y";
−
| if X replace the second to the third character by “z”
+
| if X replace the second to the third character by "z"
 
| a'''bc'''z
 
| a'''bc'''z
 
| a'''y'''z
 
| a'''y'''z
Line 165: Line 165:
 
=== Observations ===
 
=== Observations ===
 
;Rules will only be applied if all conditions are true:  
 
;Rules will only be applied if all conditions are true:  
−
:X:=”y”<”z”; ( “zabc” changes to “yabc”, but “abc” remains “abc” since there is no "z" to be replaced)
+
:X:="y"<"z"; ( "zabc" changes to "yabc", but "abc" remains "abc" since there is no "z" to be replaced)
 
;String fields are necessarily continuous:  
 
;String fields are necessarily continuous:  
−
:X:=”aaa”<”xyz”; ( “xyzbbb” changes to “aaabbb”, but “bxbybz” remains “bxbybz” since there is no continuous string "xyz" to be replaced)
+
:X:="aaa"<"xyz"; ( "xyzbbb" changes to "aaabbb", but "bxbybz" remains "bxbybz" since there is no continuous string "xyz" to be replaced)
 
;Prefixation, infixation and suffixation rules apply only once (i.e, rules are not exhaustive)
 
;Prefixation, infixation and suffixation rules apply only once (i.e, rules are not exhaustive)
−
:PLR:=0>”s”; ("X" becomes "Xs", and not "Xssssss...")
+
:PLR:=0>"s"; ("X" becomes "Xs", and not "Xssssss...")
 
;Replacement rules apply as long as the conditions are true:
 
;Replacement rules apply as long as the conditions are true:
−
:X:=”a”:”b”; ( “aaa” becomes “bbb” and not “abb”)
+
:X:="a":"b"; ( "aaa" becomes "bbb" and not "abb")
 
;In prefixation and suffixation rules, the part to be deleted may be represented by the number of characters (without quotes):
 
;In prefixation and suffixation rules, the part to be deleted may be represented by the number of characters (without quotes):
 
{|align=center cellpadding=2
 
{|align=center cellpadding=2
 
|-
 
|-
−
|width=150|PLR := “X”<””;
+
|width=150|PLR := "X"<"";
 
|=
 
|=
−
|width=150|PLR := “X”<0;
+
|width=150|PLR := "X"<0;
 
|(ABC becomes XABC)
 
|(ABC becomes XABC)
 
|-
 
|-
−
|PLR:= “X”<”A”;
+
|PLR:= "X"<"A";
 
|=
 
|=
−
|PLR:= “X”<1;
+
|PLR:= "X"<1;
 
|(ABC becomes XBC)
 
|(ABC becomes XBC)
 
|-
 
|-
−
|PLR:= “XY”<”AB”;
+
|PLR:= "XY"<"AB";
 
|=
 
|=
−
|PLR:= “XY”<2;
+
|PLR:= "XY"<2;
 
|(ABC becomes XYC)
 
|(ABC becomes XYC)
 
|-
 
|-
−
|PLR:=””>”X”;
+
|PLR:="">"X";
 
|=
 
|=
−
|PLR:= 0>”X”;
+
|PLR:= 0>"X";
 
|(ABC becomes ABCX)
 
|(ABC becomes ABCX)
 
|-
 
|-
−
|PLR:=”C”>”X”;
+
|PLR:="C">"X";
 
|=
 
|=
−
|PLR:= 1>”X”;
+
|PLR:= 1>"X";
 
|(ABC becomes ABX)
 
|(ABC becomes ABX)
 
|-
 
|-
−
|PLR:=”BC”>”XY”;
+
|PLR:="BC">"XY";
 
|=
 
|=
−
|PLR:= 2>”XY”;
+
|PLR:= 2>"XY";
 
|(ABC becomes AXY)
 
|(ABC becomes AXY)
 
|}
 
|}
Line 235: Line 235:
 
{|cellpadding=2
 
{|cellpadding=2
 
|-
 
|-
−
|width=150|PLR:=”ABC”:”XYZ”;
+
|width=150|PLR:="ABC":"XYZ";
 
|=
 
|=
−
|width=150|PLR:=”XYZ”
+
|width=150|PLR:="XYZ"
 
|(ABC becomes XYZ)
 
|(ABC becomes XYZ)
 
|}
 
|}
Line 243: Line 243:
 
{|cellpadding=3
 
{|cellpadding=3
 
|-
 
|-
−
|width=150|PLR:=”B”:”X”;
+
|width=150|PLR:="B":"X";
 
|=
 
|=
−
|width=150|PLR:=[2-2]:”X”;
+
|width=150|PLR:=[2-2]:"X";
 
|(ABC becomes AXC)
 
|(ABC becomes AXC)
 
|}
 
|}
−
;The symbol “^” is used for negation (“^MCL” means “not MCL”):  
+
;The symbol "^" is used for negation ("^MCL" means "not MCL"):  
−
:NOU&^MCL:=”x”:”y”; (If NOU and not MCL then replace “x” by “y”)
+
:NOU&^MCL:="x":"y"; (If NOU and not MCL then replace "x" by "y")
−
;“<<” and “>>” add blank spaces<ref>This feature is not supported by the UNL<sup>dev</sup> and it is automatically replaced, in the UNL<sup>arium</sup>, by a blank space.</ref>
+
;"<<" and ">>" add blank spaces<ref>This feature is not supported by the UNL<sup>dev</sup> and it is automatically replaced, in the UNL<sup>arium</sup>, by a blank space.</ref>
−
:X:=”a”<<”b” (“bc” becomes “a bc” and not “abc”)
+
:X:="a"<<"b" ("bc" becomes "a bc" and not "abc")
 
;A-rules do not generate new words but only modify the existing ones.
 
;A-rules do not generate new words but only modify the existing ones.
 
:The A-rule "FUT:="will"<<0;" (i.e, generate "will" as a prefix to the base form in case of future) will transform "love" into "will love", which will be considered, however, as a single word and not as a compound. Notice that this is the reason why compound tenses must never be generated through A-rules; otherwise, it would never be possible to generate other words (such as "not", "always", etc) between "will" and "love".
 
:The A-rule "FUT:="will"<<0;" (i.e, generate "will" as a prefix to the base form in case of future) will transform "love" into "will love", which will be considered, however, as a single word and not as a compound. Notice that this is the reason why compound tenses must never be generated through A-rules; otherwise, it would never be possible to generate other words (such as "not", "always", etc) between "will" and "love".
  
 
=== Common mistakes ===
 
=== Common mistakes ===
−
*nou:= ”y”<”z”;  (WRONG: Tags are case sensitive)
+
*nou:= "y"<"z";  (WRONG: Tags are case sensitive)
−
*NNN:= ”y”<”z”;  (WRONG: NNN is not defined in the tagset)
+
*NNN:= "y"<"z";  (WRONG: NNN is not defined in the tagset)
−
*NOUFEM:=”y”<”z”; (WRONG: Tags must be separated by “&”)
+
*NOUFEM:="y"<"z"; (WRONG: Tags must be separated by "&")
−
*NOU,FEM:=”y”<”z”; (WRONG: Tags must be separated by “&”)
+
*NOU,FEM:="y"<"z"; (WRONG: Tags must be separated by "&")
−
*NOU & FEM:=”y”<”z”;  (WRONG: There can be no blank spaces between tags)
+
*NOU & FEM:="y"<"z";  (WRONG: There can be no blank spaces between tags)
 
*X:=1<1; (WRONG: The left side must always be a string in a prefixation rule)
 
*X:=1<1; (WRONG: The left side must always be a string in a prefixation rule)
 
*X:=1>1; (WRONG: The right side must always be a string in a suffixation rule)
 
*X:=1>1; (WRONG: The right side must always be a string in a suffixation rule)
Line 277: Line 277:
 
<br>
 
<br>
 
'''circumfixation'''  
 
'''circumfixation'''  
−
  CONDITION := “ADDED” < DELETED , DELETED > "ADDED";
+
  CONDITION := "ADDED" < DELETED , DELETED > "ADDED";
 
'''prefixation + infixation'''  
 
'''prefixation + infixation'''  
−
  CONDITION := “ADDED” < DELETED , DELETED > "ADDED";
+
  CONDITION := "ADDED" < DELETED , DELETED > "ADDED";
 
'''infixation + suffixation'''
 
'''infixation + suffixation'''
 
  CONDITION := DELETED > "ADDED" , "DELETED" > "ADDED";
 
  CONDITION := DELETED > "ADDED" , "DELETED" > "ADDED";
Line 292: Line 292:
 
! AFTER
 
! AFTER
 
|-
 
|-
−
|width=100| X:=”x”<0, 0>"y";
+
|width=100| X:="x"<0, 0>"y";
 
|width=300| if X add "x" to the beginning and "y" to the end of the string
 
|width=300| if X add "x" to the beginning and "y" to the end of the string
 
|width=50| A
 
|width=50| A
 
|width=50| '''x'''A'''y'''
 
|width=50| '''x'''A'''y'''
 
|-
 
|-
−
| X:=”x”<0, "A":"y";
+
| X:="x"<0, "A":"y";
 
| if X add "x" to the beginning and replace "A" by "y"
 
| if X add "x" to the beginning and replace "A" by "y"
 
| ABC
 
| ABC
Line 307: Line 307:
 
| '''y'''BC'''x'''
 
| '''y'''BC'''x'''
 
|-
 
|-
−
| X:=”x”<0, "A":"y", 0>"z";
+
| X:="x"<0, "A":"y", 0>"z";
 
| if X add "x" to the beginning, replace "A" by "y" and add "z" to the end of the string
 
| if X add "x" to the beginning, replace "A" by "y" and add "z" to the end of the string
 
| ABC
 
| ABC
Line 326: Line 326:
 
A-rules comply with the following syntax:
 
A-rules comply with the following syntax:
  
−
  <A-RULE>          ::= <CONDITION> “:=” <ACTION> ("," <ACTION>)* “;”
+
  <A-RULE>          ::= <CONDITION> ":=" <ACTION> ("," <ACTION>)* ";"
−
  <CONDITION>        ::= <ATAG>(“&”(“^”)?<ATAG>)*
+
  <CONDITION>        ::= <ATAG>("&"("^")?<ATAG>)*
 
  <ATAG>            ::= {one of the tags defined in the [[Tagset|UNDLF Tagset]]}
 
  <ATAG>            ::= {one of the tags defined in the [[Tagset|UNDLF Tagset]]}
 
  <ACTION>          ::= <PREFIXATION> | <SUFFIXATION> | <INFIXATION> | <REPLACEMENT>
 
  <ACTION>          ::= <PREFIXATION> | <SUFFIXATION> | <INFIXATION> | <REPLACEMENT>
−
  <PREFIXATION>      ::= <ADDED> {“<” | “<<”} (<DELETED>)?
+
  <PREFIXATION>      ::= <ADDED> {"<" | "<<"} (<DELETED>)?
−
  <SUFFIXATION>      ::= (<DELETED>)? {“>” | “>>”} <ADDED>
+
  <SUFFIXATION>      ::= (<DELETED>)? {">" | ">>"} <ADDED>
 
  <INFIXATION>      ::= "["<DELETED"]" ">" <ADDED> | <ADDED> "<" "["<DELETED"]"
 
  <INFIXATION>      ::= "["<DELETED"]" ">" <ADDED> | <ADDED> "<" "["<DELETED"]"
 
  <REPLACEMENT>      ::= ( <STRING> ":" )? <ADDED> | "[" <INTEGER> "-" <INTEGER> "]" ":"  <ADDED>
 
  <REPLACEMENT>      ::= ( <STRING> ":" )? <ADDED> | "[" <INTEGER> "-" <INTEGER> "]" ":"  <ADDED>
 
  <ADDED>            ::= <STRING>  
 
  <ADDED>            ::= <STRING>  
 
  <DELETED>          ::= <STRING> | <INTEGER>   
 
  <DELETED>          ::= <STRING> | <INTEGER>   
−
  <STRING>          ::= “ “ “ [a..Z]+ “ “ “
+
  <STRING>          ::= " " " [a..Z]+ " " "
 
  <INTEGER>          ::= [0..9]+
 
  <INTEGER>          ::= [0..9]+
  
Line 342: Line 342:
  
 
<a> = a is a non-terminal symbol<br />
 
<a> = a is a non-terminal symbol<br />
−
“a“ = a is a constant<br />
+
"a" = a is a constant<br />
 
a | b = a or b<br />
 
a | b = a or b<br />
 
{ a | b } = either a or b<br />
 
{ a | b } = either a or b<br />

Revision as of 16:37, 22 July 2013

A-rule (affixation rule) is the formalism used for generating affixes (prefixes, suffixes, infixes) in the UNLarium framework.

Contents

When to use a-rules

A-rules are used for prefixation, suffixation and infixation, i.e., for adding morphemes to a given base form. They are used for generating inflections (such as "book">"books", "love">"loved") or derivations (such as "dress">"undress", "write">"writer").

When not to use a-rules

A-rules are not used for composition (i.e., to form new words by combining or putting together old words), as in "give">"give in", "go">"have gone" or "man">"fireman"). This should be treated by composition rules.

Types of a-rules

There are two types of a-rules:

  • simple a-rules involve a single action (such as prefixation, suffixation, infixation and replacement); and
  • complex a-rules involve more than one action (such as circumfixation).

Simple a-rules

There are four types of simple a-rules:

  • prefixation, for adding morphemes at the beginning of a base form.
  • suffixation, for adding morphemes at the end of a base form
  • infixation, for adding morphemes to the middle of the base form
  • replacement, for changing the base form

Syntax

The syntax for simple a-rules is the following:

prefixation 

CONDITION := "ADDED" < DELETED;

suffixation 

CONDITION := DELETED > "ADDED";

infixation 

CONDITION := [REFERENCE] > "ADDED";
CONDITION := "ADDED" < [REFERENCE];

replacement 

 CONDITION := DELETED : "ADDED";

Where:

  • CONDITION = tag (such as "PLR", "FEM", etc) or list of tags ("FEM&PLR") that indicates when the rule should be applied
  • ADDED (between quotes) = the string to be added ;
  • REFERENCE (between square brackets) = the reference string (between quotes) or the position (without quotes) of the string to be added;
  • DELETED = the string (between quotes) or the number of characters (without quotes) to be deleted.

Examples

Prefixation
RULE BEHAVIOR BEFORE AFTER
X:="y"<"z"; if X replace the string "z" by the string "y" in the beginning of the string zabc yabc
X:="y"<1; if X replace the first character of the string by "y" zabc yabc
X:="y"<0; if X add the string "y" to the beginning of the string zabc yzabc
X:="y"<;[1] if X add the string "y" to the beginning of the string (idem previous) zabc yzabc
X:="y"<<0; if X add the string "y" and a blank space to the beginning of the string zabc y zabc
X:="y"<<; if X add the string "y" and a blank space to the beginning of the string (idem previous) zabc y zabc


Suffixation
RULE BEHAVIOR BEFORE AFTER
X:="z">"y"; if X replace the string "z" by the string "y" in the end of the string abcz abcy
X:=1>"y"; if X replace the last character of the string by "y" abcz abcy
X:=0>"y"; if X add the string "y" to the end of the string abcz abczy
X:=>"y";[2] if X add the string "y" to the end of the string (idem previous) abcz abczy
X:=0>>"y"; if X add a blank space and the string "y" to the end of the string abcz abcz y
X:=>>"y"; if X add a blank space and the string "y" to the end of the string (idem previous) abcz abcz y


Infixation
RULE BEHAVIOR BEFORE AFTER
X:=[2]>"y"; if X add "y" to the right of the second character abc abyc
X:="y"<[3]; if X add "y" to the left of the third character abc abyc
X:=["b"]>"y"; if X add "y" to the right of "b"; abc abyc
X:="y"<["c"]; if X add "y" to the left of "c" abc abyc


Replacement
RULE BEHAVIOR BEFORE AFTER
X:="y"; if X replace the whole by "y" X y
X:="z":"y"; if X replace the string "z" by "y" azbc aybc
X:=[2-3]:"y"; if X replace the second to the third character by "z" abcz ayz

Observations

Rules will only be applied if all conditions are true
X:="y"<"z"; ( "zabc" changes to "yabc", but "abc" remains "abc" since there is no "z" to be replaced)
String fields are necessarily continuous
X:="aaa"<"xyz"; ( "xyzbbb" changes to "aaabbb", but "bxbybz" remains "bxbybz" since there is no continuous string "xyz" to be replaced)
Prefixation, infixation and suffixation rules apply only once (i.e, rules are not exhaustive)
PLR:=0>"s"; ("X" becomes "Xs", and not "Xssssss...")
Replacement rules apply as long as the conditions are true
X:="a":"b"; ( "aaa" becomes "bbb" and not "abb")
In prefixation and suffixation rules, the part to be deleted may be represented by the number of characters (without quotes)
PLR := "X"<""; = PLR := "X"<0; (ABC becomes XABC)
PLR:= "X"<"A"; = PLR:= "X"<1; (ABC becomes XBC)
PLR:= "XY"<"AB"; = PLR:= "XY"<2; (ABC becomes XYC)
PLR:="">"X"; = PLR:= 0>"X"; (ABC becomes ABCX)
PLR:="C">"X"; = PLR:= 1>"X"; (ABC becomes ABX)
PLR:="BC">"XY"; = PLR:= 2>"XY"; (ABC becomes AXY)
In infixation rules, the position of the addition may be made with reference to the end of string by using "-".
RULE BEHAVIOR BEFORE AFTER
X:=[1]>"y"; if X add "y" to the right of the first character abc aybc
X:=[-1]>"y"; if X add "y" to the right of the last character abc abyc
X:="y"<[2]; if X add "y" to the left of the second character abcde aybc
X:="y"<[-2]; if X add "y" to the left of the second last character abcde abcyde
In replacement rules, the part to be deleted may be omitted if the whole string is to be replaced
PLR:="ABC":"XYZ"; = PLR:="XYZ" (ABC becomes XYZ)
In replacement rules, the part to be deleted may be represented by an interval of characters in the format [beginning-end]
PLR:="B":"X"; = PLR:=[2-2]:"X"; (ABC becomes AXC)
The symbol "^" is used for negation ("^MCL" means "not MCL")
NOU&^MCL:="x":"y"; (If NOU and not MCL then replace "x" by "y")
"<<" and ">>" add blank spaces[3]
X:="a"<<"b" ("bc" becomes "a bc" and not "abc")
A-rules do not generate new words but only modify the existing ones.
The A-rule "FUT:="will"<<0;" (i.e, generate "will" as a prefix to the base form in case of future) will transform "love" into "will love", which will be considered, however, as a single word and not as a compound. Notice that this is the reason why compound tenses must never be generated through A-rules; otherwise, it would never be possible to generate other words (such as "not", "always", etc) between "will" and "love".

Common mistakes

  • nou:= "y"<"z"; (WRONG: Tags are case sensitive)
  • NNN:= "y"<"z"; (WRONG: NNN is not defined in the tagset)
  • NOUFEM:="y"<"z"; (WRONG: Tags must be separated by "&")
  • NOU,FEM:="y"<"z"; (WRONG: Tags must be separated by "&")
  • NOU & FEM:="y"<"z"; (WRONG: There can be no blank spaces between tags)
  • X:=1<1; (WRONG: The left side must always be a string in a prefixation rule)
  • X:=1>1; (WRONG: The right side must always be a string in a suffixation rule)
  • X:=1; (WRONG: Replacement rules do not allow for numbers)
  • X:=1:1; (WRONG: Replacement rules do not allow for numbers)

Complex a-rules

Complex a-rules are formed from the combination of simple a-rules:

  • circumfixation (prefixation + suffixation), to add a prefix and a suffix at the same time
  • prefixation + infixation, to add a prefix and a suffix at the same time
  • infixation + suffixation, to add an infix and a suffix at the same time
  • prefixation + infixation + suffixation, to add a prefix, an infix and a suffix at the same time

Syntax

Complex a-rules are formed by concatenating simple a-rules with ",":

circumfixation 

CONDITION := "ADDED" < DELETED , DELETED > "ADDED";

prefixation + infixation 

CONDITION := "ADDED" < DELETED , DELETED > "ADDED";

infixation + suffixation 

CONDITION := DELETED > "ADDED" , "DELETED" > "ADDED";

etc.

Examples

Complex m-rules
RULE BEHAVIOR BEFORE AFTER
X:="x"<0, 0>"y"; if X add "x" to the beginning and "y" to the end of the string A xAy
X:="x"<0, "A":"y"; if X add "x" to the beginning and replace "A" by "y" ABC xyBC
X:="A":"y", 0>"x"; if X replace "A" by "y" and add "x" to the end of the string ABC yBCx
X:="x"<0, "A":"y", 0>"z"; if X add "x" to the beginning, replace "A" by "y" and add "z" to the end of the string ABC xyBCz

Observations

Complex a-rules are also used to integrate different simple a-rules
ORD:="1">"1st";
ORD:="2">"2nd";
ORD:="3">"3rd"; 		ORD:="1">"1st", "2">"2nd", "3">"3rd";
Actions are applied from left to right (i.e., order is important)
PLR := "s" > "ses", "y" > "ies"; (kiss > kisses, city > cities)
PLR := "y" > "ies", "s" > "ses"; (kiss > kisses, city>cities>citieses)

Formal syntax

A-rules comply with the following syntax: 

<A-RULE>           ::= <CONDITION> ":=" <ACTION> ("," <ACTION>)* ";"
<CONDITION>        ::= <ATAG>("&"("^")?<ATAG>)*
<ATAG>             ::= {one of the tags defined in the UNDLF Tagset}
<ACTION>           ::= <PREFIXATION> | <SUFFIXATION> | <INFIXATION> | <REPLACEMENT>
<PREFIXATION>      ::= <ADDED>	 {"<" | "<<"} 	(<DELETED>)?
<SUFFIXATION>      ::= (<DELETED>)? {">" | ">>"} 	<ADDED>
<INFIXATION>       ::= "["<DELETED"]" ">" <ADDED> | <ADDED> "<" "["<DELETED"]"
<REPLACEMENT>      ::= ( <STRING> ":" )? <ADDED> | "[" <INTEGER> "-" <INTEGER> "]" ":"  <ADDED>
<ADDED>            ::= <STRING> 
<DELETED>          ::= <STRING> | <INTEGER>  
<STRING>           ::= " " " [a..Z]+ " " "
<INTEGER>          ::= [0..9]+

where

<a> = a is a non-terminal symbol
"a" = a is a constant
a | b = a or b
{ a | b } = either a or b
(a)? = a can occur 0 or 1 time
(a)* = a can be repeated 0 or more times
(a)+ = a can be repeated 1 or more times

Notes

  1. ↑ This feature is not supported by the UNLdev. The empty field is automatically replaced, in the UNLarium, by a "0".
  2. ↑ This feature is not supported by the UNLdev. The empty field is automatically replaced, in the UNLarium, by a "0".
  3. ↑ This feature is not supported by the UNLdev and it is automatically replaced, in the UNLarium, by a blank space.
Retrieved from "http://unlweb.net/wiki/index.php?title=A-rule&oldid=6142"
Software