Grammar - Revision history

imported>Dgaiv at 08:39, 27 May 2014

2014-05-27T08:39:18Z

← Older revision		Revision as of 08:39, 27 May 2014
Line 32:		Line 32:
	*'''Word-driven grammars''' process words in isolation		*'''Word-driven grammars''' process words in isolation
	Text-driven grammars are normally used in summarization and simplification, when the rhetorical structure of the source document is important. Sentence-driven grammars are used mostly in translation, when the source document can be treated as a list of non-semantically related units, to be processed one at a time. Word-driven grammars are used in information retrieval and opinion mining, when each word or node can be treated in isolation. <br />		Text-driven grammars are normally used in summarization and simplification, when the rhetorical structure of the source document is important. Sentence-driven grammars are used mostly in translation, when the source document can be treated as a list of non-semantically related units, to be processed one at a time. Word-driven grammars are used in information retrieval and opinion mining, when each word or node can be treated in isolation. <br />
	[http://andreweweww.wordpress.com/2014/01/19/lovely-mwo-muslim-wedding-organizer Wedding organizer], [http://andreweweww.wordpress.com/2014/01/19/lovely-mwo-muslim-wedding-organizer Muslim wedding organizer]

	== Recall ==		== Recall ==

imported>Domtheo at 04:48, 2 May 2014

2014-05-02T04:48:59Z

← Older revision		Revision as of 04:48, 2 May 2014
Line 32:		Line 32:
	*'''Word-driven grammars''' process words in isolation		*'''Word-driven grammars''' process words in isolation
	Text-driven grammars are normally used in summarization and simplification, when the rhetorical structure of the source document is important. Sentence-driven grammars are used mostly in translation, when the source document can be treated as a list of non-semantically related units, to be processed one at a time. Word-driven grammars are used in information retrieval and opinion mining, when each word or node can be treated in isolation. <br />		Text-driven grammars are normally used in summarization and simplification, when the rhetorical structure of the source document is important. Sentence-driven grammars are used mostly in translation, when the source document can be treated as a list of non-semantically related units, to be processed one at a time. Word-driven grammars are used in information retrieval and opinion mining, when each word or node can be treated in isolation. <br />
			[http://andreweweww.wordpress.com/2014/01/19/lovely-mwo-muslim-wedding-organizer Wedding organizer], [http://andreweweww.wordpress.com/2014/01/19/lovely-mwo-muslim-wedding-organizer Muslim wedding organizer]

	== Recall ==		== Recall ==

imported>Martins at 18:26, 19 August 2013

2013-08-19T18:26:24Z

← Older revision		Revision as of 18:26, 19 August 2013
Line 8:		Line 8:

	== Rules ==		== Rules ==
	:~~''main article: [[~~Rule~~]]s''~~		{{:Rule}}
	~~Grammars are sets of rules used to go from UNL into natural language, or from natural language into UNL. In the UNL framework, there can be two different types of rules:~~
	~~:*[[T-rule]]s, or transformation rules, are used to perform changes to nodes or relations~~
	~~:*[[D-rule]]s, or disambiguation rules, are used to control changes over nodes or relations~~
	~~T-rules Follow the very general formalism~~

	~~α:=β;~~

	~~where the left side α is a condition statement, and the right side β is an action to be performed over α.~~

	~~D-rules follow a slightly different formalism:~~

	~~α=P;~~

	~~where the left side α is a statement and the right side P is an integer from 0 to 255 that indicates the probability of occurrence of α.~~
	== Modules ==		== Modules ==
	In the UNL framework there are three types of grammar:		In the UNL framework there are three types of grammar:

imported>Martins at 17:37, 19 August 2013

2013-08-19T17:37:09Z

← Older revision		Revision as of 17:37, 19 August 2013
Line 5:		Line 5:

	== Basic Concepts ==		== Basic Concepts ==
	{{:~~Basic Concepts~~}}		{{:Grammar units}}

	== Rules ==		== Rules ==

imported>Martins at 17:36, 19 August 2013

2013-08-19T17:36:54Z

@@ Line 5: / Line 5: @@
 == Basic Concepts ==
-[[file:grammar.png|center]]
+{{:Basic Concepts}}
 == Rules ==

imported>Martins at 17:11, 19 August 2013

2013-08-19T17:11:52Z

@@ Line 1: / Line 1: @@
 In the UNL framework, a '''grammar''' is a set of rules that is used to generate UNL out of natural language, and natural language out of UNL. Along with [[Dictionary|dictionaries]], they constitute the basic resource for [[UNLization]] and [[NLization]].
 == Rules ==
-:''main article: [[Grammar Specs]]''
+:''main article: [[Rule]]s''
 Grammars are sets of rules used to go from UNL into natural language, or from natural language into UNL. In the UNL framework, there can be two different types of rules:
 :*[[T-rule]]s, or transformation rules, are used to perform changes to nodes or relations

imported>Martins at 16:52, 19 August 2013

2013-08-19T16:52:39Z

← Older revision		Revision as of 16:52, 19 August 2013
Line 1:		Line 1:
	In the UNL framework, a '''grammar''' is a set of rules that is used to generate UNL out of natural language, and natural language out of UNL. Along with ~~the~~ [[Dictionary\|dictionaries]], they constitute the basic resource for [[UNLization]] and [[NLization]].		In the UNL framework, a '''grammar''' is a set of rules that is used to generate UNL out of natural language, and natural language out of UNL. Along with [[Dictionary\|dictionaries]], they constitute the basic resource for [[UNLization]] and [[NLization]].

	== Rules ==		== Rules ==

imported>Martins at 18:27, 16 August 2013

2013-08-16T18:27:00Z

← Older revision		Revision as of 18:27, 16 August 2013
Line 2:		Line 2:

	== Rules ==		== Rules ==
	:''main article: [[~~Rule~~]]''		:''main article: [[Grammar Specs]]''
	Grammars are sets of rules used to go from UNL into natural language, or from natural language into UNL. In the UNL framework, there can be two different types of rules:		Grammars are sets of rules used to go from UNL into natural language, or from natural language into UNL. In the UNL framework, there can be two different types of rules:
	:*[[T-rule]]s, or transformation rules, are used to perform changes to nodes or relations		:*[[T-rule]]s, or transformation rules, are used to perform changes to nodes or relations

imported>Martins at 18:26, 16 August 2013

2013-08-16T18:26:30Z

← Older revision		Revision as of 18:26, 16 August 2013
Line 6:		Line 6:
	:*[[T-rule]]s, or transformation rules, are used to perform changes to nodes or relations		:*[[T-rule]]s, or transformation rules, are used to perform changes to nodes or relations
	:*[[D-rule]]s, or disambiguation rules, are used to control changes over nodes or relations		:*[[D-rule]]s, or disambiguation rules, are used to control changes over nodes or relations
			T-rules Follow the very general formalism

			α:=β;

			where the left side α is a condition statement, and the right side β is an action to be performed over α.

			D-rules follow a slightly different formalism:

			α=P;

			where the left side α is a statement and the right side P is an integer from 0 to 255 that indicates the probability of occurrence of α.
	== Modules ==		== Modules ==
	In the UNL framework there are three types of grammar:		In the UNL framework there are three types of grammar:

imported>Martins at 18:25, 16 August 2013

2013-08-16T18:25:38Z

← Older revision		Revision as of 18:25, 16 August 2013
Line 1:		Line 1:
	In the UNL framework, a '''grammar''' is a set of rules that is used to generate UNL out of natural language, and natural language out of UNL. Along with the [[Dictionary\|dictionaries]], they constitute the basic resource for [[UNLization]] and [[NLization]].		In the UNL framework, a '''grammar''' is a set of rules that is used to generate UNL out of natural language, and natural language out of UNL. Along with the [[Dictionary\|dictionaries]], they constitute the basic resource for [[UNLization]] and [[NLization]].

	~~== Basic concepts ==~~
	~~;[[Node]]~~
	:A node is the most elementary unit in the graph. It is the result of the [[tokenization]] process, and corresponds to the notion of "lexical item". At the surface level, a natural language sentence is considered a list of nodes, and a UNL graph a set of relations between nodes.
	~~;[[Relation]]~~
	:In order to form a natural language sentence or a UNL graph, nodes are inter-related by relations. In the UNL framework, there can be three different types of relations: linear, syntactic or semantic.
	~~;[[Hyper-Node]]~~
	~~:A hyper-node is a sub-graph, i.e., a node containing relations between nodes.~~
	~~;[[Hyper-Relation]]~~
	~~:A hyper-relation is a relation between relations.~~

	== Rules ==		== Rules ==