L-rule - Revision history

imported>Dgaiv at 10:41, 15 February 2014

2014-02-15T10:41:46Z

← Older revision		Revision as of 10:41, 15 February 2014
Line 83:		Line 83:
	{{:Transformation_over_nodes}}		{{:Transformation_over_nodes}}

			== Transformations over hyper-nodes ==
	{{:Transformation_over_hyper-nodes}}		{{:Transformation_over_hyper-nodes}}

imported>MajorLaFrime at 08:57, 3 December 2013

2013-12-03T08:57:05Z

← Older revision		Revision as of 08:57, 3 December 2013
Line 55:		Line 55:
	\|-		\|-
	\|("a")("b")("c"):=("d",%01)("g")(%02)(%03);		\|("a")("b")("c"):=("d",%01)("g")(%02)(%03);
	\|abc > ~~dgc~~		\|abc > dgbc
	\|"a" will be replaced by "d"; "b" and "c" will be preserved; and a new node "g" will be created between "a" and "b"		\|"a" will be replaced by "d"; "b" and "c" will be preserved; and a new node "g" will be created between "a" and "b"
	\|-		\|-
Line 79:		Line 79:
	\|-		\|-
	\|}		\|}


	== Transformations ==		== Transformations ==

imported>Martins at 19:42, 21 August 2013

2013-08-21T19:42:01Z

@@ Line 122: / Line 122: @@
 **"de avoir">"d' ": coindexation is based on ordering and not on features. The third form is deleted because it's not present at the right side; the second form, which is BLK, receives the feature VOW;
- <L-RULE>          ::= ( "("<CONDITION>")" )+ ":=" ( "("<ACTION>")" )+ ";"
+== N-rules and L-rules ==
- <CONDITION>        ::= """<STRING>""" ("," <TAGLIST> )* | "["<STRING>"]" ("," <TAGLIST> )* | <TAGLIST>
+{{:Difference between N-rules and L-rules}}

imported>Martins at 19:41, 21 August 2013

2013-08-21T19:41:16Z

← Older revision		Revision as of 19:41, 21 August 2013
Line 106:		Line 106:

	== Indexes ==		== Indexes ==
	{{:Indexation}}		See: [[Indexation]]

	== Common mistakes ==		== Common mistakes ==

imported>Martins at 19:05, 21 August 2013

2013-08-21T19:05:56Z

@@ Line 106: / Line 106: @@
 == Indexes ==
-Indexes are used to associate nodes in the left side of the rule (CONDITION) to nodes in the right side of the rule (ACTION):
+{{:Indexation}}
 == Common mistakes ==

imported>Martins at 19:01, 21 August 2013

2013-08-21T19:01:06Z

← Older revision		Revision as of 19:01, 21 August 2013
Line 93:		Line 93:
	#:*(X,^Y):=(+Y); (= add the feature Y to a node containing the feature X that does not contain the feature Y yet)		#:*(X,^Y):=(+Y); (= add the feature Y to a node containing the feature X that does not contain the feature Y yet)
	#:*(^".")(STAIL):=(%01)(".")(%02); (Add a period before the end of the sentence if there is not a period yet)		#:*(^".")(STAIL):=(%01)(".")(%02); (Add a period before the end of the sentence if there is not a period yet)
	#Rules are conservative. No feature is changed or deleted unless explicitly ~~indicate~~ through "-".		#Rules are conservative. No feature is changed or deleted unless explicitly indicated through "-".
	#:In the rule ("x",A):=("y"); the string "x" is replaced by the string "y", but the feature A is not altered (i.e.,the final state will be ("y",A));		#:In the rule ("x",A):=("y"); the string "x" is replaced by the string "y", but the feature A is not altered (i.e.,the final state will be ("y",A));
	#:In the rule ("x",A):=("y",A); the string "x" is replaced by the string "y" and the feature A is added to the node (i.e., the final state will be ("y",A,A))		#:In the rule ("x",A):=("y",A); the string "x" is replaced by the string "y" and the feature A is added to the node (i.e., the final state will be ("y",A,A))

imported>Martins at 19:00, 21 August 2013

2013-08-21T19:00:44Z

← Older revision		Revision as of 19:00, 21 August 2013
Line 97:		Line 97:
	#:In the rule ("x",A):=("y",A); the string "x" is replaced by the string "y" and the feature A is added to the node (i.e., the final state will be ("y",A,A))		#:In the rule ("x",A):=("y",A); the string "x" is replaced by the string "y" and the feature A is added to the node (i.e., the final state will be ("y",A,A))
	#:The rule "("a",ART)(BLK)("/a[bcd]e/"):=("an")( )( );" does not affect the status of the second and the third nodes. On the other hand, the rule "("a",VER)(BLK)("il",PPR):=( )("-t-",-BLK)( );" alters the status of the second node by deleting the feature BLK.		#:The rule "("a",ART)(BLK)("/a[bcd]e/"):=("an")( )( );" does not affect the status of the second and the third nodes. On the other hand, the rule "("a",VER)(BLK)("il",PPR):=( )("-t-",-BLK)( );" alters the status of the second node by deleting the feature BLK.
	#Regular expressions may ~~only~~ be used in the left side.<br />		#Regular expressions may be used in order to make reference to the elements of a node, but only in the left (condition) side.<br />
	#:("/[A-Z]/",%x)(".",%y):=(%x);		#:("/[A-Z]/",%x)(".",%y):=(%x);
	#:<strike>("/[A-Z]/")("."):=("/[A-Z]/");</strike>		#:<strike>("/[A-Z]/")("."):=("/[A-Z]/");</strike>
	#In the ACTION field, changes may be expressed by the right side of [[A-rule]]s ~~inside each form. The default is replacement.~~		#In the ACTION field, changes to the elements of a node may be expressed by the right side of [[A-rule]]s
	#:The rule "("a",ART)(BLK)("/[aeiou]./"):=("an")( )( );" could also be expressed as "("a",ART)(BLK)("/[aeiou]./"):=(0>"n")( )( );", i.e., the change from "a" to "an" could be expressed either by "an" or 0>"n".		#:The rule "("a",ART)(BLK)("/[aeiou]./"):=("an")( )( );" could also be expressed as "("a",ART)(BLK)("/[aeiou]./"):=(0>"n")( )( );", i.e., the change from "a" to "an" could be expressed either by "an" or 0>"n".
	#Rules apply only if all conditions are true.		#Rules apply only if all conditions are true.

imported>Martins at 18:59, 21 August 2013

2013-08-21T18:59:24Z

← Older revision		Revision as of 18:59, 21 August 2013
Line 94:		Line 94:
	#:*(^".")(STAIL):=(%01)(".")(%02); (Add a period before the end of the sentence if there is not a period yet)		#:*(^".")(STAIL):=(%01)(".")(%02); (Add a period before the end of the sentence if there is not a period yet)
	#Rules are conservative. No feature is changed or deleted unless explicitly indicate through "-".		#Rules are conservative. No feature is changed or deleted unless explicitly indicate through "-".
	#:In the rule ("x",~~FEA~~):=("y"); the string "x" is replaced by the string "y", but the feature ~~FEA~~ is not altered (i.e.,the final state will be ("y",~~FEA~~));		#:In the rule ("x",A):=("y"); the string "x" is replaced by the string "y", but the feature A is not altered (i.e.,the final state will be ("y",A));
			#:In the rule ("x",A):=("y",A); the string "x" is replaced by the string "y" and the feature A is added to the node (i.e., the final state will be ("y",A,A))
	#:The rule "("a",ART)(BLK)("/a[bcd]e/"):=("an")( )( );" does not affect the status of the second and the third nodes. On the other hand, the rule "("a",VER)(BLK)("il",PPR):=( )("-t-",-BLK)( );" alters the status of the second node by deleting the feature BLK.		#:The rule "("a",ART)(BLK)("/a[bcd]e/"):=("an")( )( );" does not affect the status of the second and the third nodes. On the other hand, the rule "("a",VER)(BLK)("il",PPR):=( )("-t-",-BLK)( );" alters the status of the second node by deleting the feature BLK.
	#Regular expressions may only be used in the left side.<br />		#Regular expressions may only be used in the left side.<br />

imported>Martins at 18:57, 21 August 2013

2013-08-21T18:57:23Z

imported>Martins at 14:24, 21 August 2013

2013-08-21T14:24:29Z

← Older revision		Revision as of 14:24, 21 August 2013
Line 17:		Line 17:
	*<NODE> is a [[node]]		*<NODE> is a [[node]]
	*the left side of the operator := states the condition		*the left side of the operator := states the condition
	*the right side of the operator := states the action to be performed over ~~each string of~~ the condition.		*the right side of the operator := states the action (replacement, change, creation, deletion, division, merge) to be performed over the condition.

	== Examples ==		== Examples ==

← Older revision		Revision as of 18:57, 21 August 2013
Line 87:		Line 87:

	== Properties ==		== Properties ==
	L-rules are recursive<nowiki>:</nowiki> rules will apply while conditions are true:		#L-rules are recursive<nowiki>:</nowiki> rules will apply while conditions are true:
	:The rule "(BLK):=("-");" will transform "a b c d e" into "a-b-c-d-e" (and not only in "a-b c d e")		#:The rule "(BLK):=("-");" will transform "a b c d e" into "a-b-c-d-e" (and not only in "a-b c d e")
	:The rule "(X):=(+Y);" will never stop (i.e., it contains an infinite loop): the feature Y will keep been added eternally (X,Y,Y,Y,Y,Y,Y,Y,...)		#:The rule "(X):=(+Y);" will never stop (i.e., it contains an infinite loop): the feature Y will keep been added eternally (X,Y,Y,Y,Y,Y,Y,Y,...)
	The symbol '''^''' is used for negation and may be used to prevent infinite loops:		#The symbol '''^''' is used for negation and may be used to prevent infinite loops:
	:*(X,^Y):=(+Y); (= add the feature Y to a node containing the feature X that does not contain the feature Y yet)		#:*(X,^Y):=(+Y); (= add the feature Y to a node containing the feature X that does not contain the feature Y yet)
	:*(^".")(STAIL):=(%01)(".")(%02); (Add a period before the end of the sentence if there is not a period yet)		#:*(^".")(STAIL):=(%01)(".")(%02); (Add a period before the end of the sentence if there is not a period yet)
	Rules are conservative. No feature is changed or deleted unless explicitly indicate through "-".		#Rules are conservative. No feature is changed or deleted unless explicitly indicate through "-".
	:In the rule ("x",FEA):=("y"); the string "x" is replaced by the string "y", but the feature FEA is not altered (i.e.,the final state will be ("y",FEA));		#:In the rule ("x",FEA):=("y"); the string "x" is replaced by the string "y", but the feature FEA is not altered (i.e.,the final state will be ("y",FEA));
	:The rule "("a",ART)(BLK)("/a[bcd]e/"):=("an")( )( );" does not affect the status of the second and the third nodes. On the other hand, the rule "("a",VER)(BLK)("il",PPR):=( )("-t-",-BLK)( );" alters the status of the second node by deleting the feature BLK.		#:The rule "("a",ART)(BLK)("/a[bcd]e/"):=("an")( )( );" does not affect the status of the second and the third nodes. On the other hand, the rule "("a",VER)(BLK)("il",PPR):=( )("-t-",-BLK)( );" alters the status of the second node by deleting the feature BLK.
	Regular expressions may only be used in the left side.<br />		#Regular expressions may only be used in the left side.<br />
	:("/[A-Z]/",%x)(".",%y):=(%x);		#:("/[A-Z]/",%x)(".",%y):=(%x);
	:<strike>("/[A-Z]/")("."):=("/[A-Z]/");</strike>		#:<strike>("/[A-Z]/")("."):=("/[A-Z]/");</strike>
	In the ACTION field, changes may be expressed by the right side of [[A-rule]]s inside each form. The default is replacement.		#In the ACTION field, changes may be expressed by the right side of [[A-rule]]s inside each form. The default is replacement.
	:The rule "("a",ART)(BLK)("/[aeiou]./"):=("an")( )( );" could also be expressed as "("a",ART)(BLK)("/[aeiou]./"):=(0>"n")( )( );", i.e., the change from "a" to "an" could be expressed either by "an" or 0>"n".		#:The rule "("a",ART)(BLK)("/[aeiou]./"):=("an")( )( );" could also be expressed as "("a",ART)(BLK)("/[aeiou]./"):=(0>"n")( )( );", i.e., the change from "a" to "an" could be expressed either by "an" or 0>"n".
	Rules apply only if all conditions are true.		#Rules apply only if all conditions are true.
	:The rule "("a")(BLK)("/[aeiou].*/"):=("an")( )( );" will apply only in case of "a" before a blank and a node starting with "a", "e", "i", "o" or "u".		#:The rule "("a")(BLK)("/[aeiou].*/"):=("an")( )( );" will apply only in case of "a" before a blank and a node starting with "a", "e", "i", "o" or "u".

	== Indexes ==		== Indexes ==