Terminal and nonterminal functions - Revision history

Klbrain: Merged content to Parse tree#Nomenclature, redirecting; unopposed 2019 proposal (easy-merge)

2020-09-20T09:29:27Z

Merged content to Parse tree#Nomenclature, redirecting; unopposed 2019 proposal (easy-merge)

← Previous revision		Revision as of 09:29, 20 September 2020
Line 1:		Line 1:
	~~{{merge~~ ~~to\|~~Parse tree~~\|date=September 2019}}~~		#REDIRECT [[Parse tree#Nomenclature]]

			{{R from merge}}
	In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.
			{{R to section}}

	==Background==
	[[Image:parseTree.svg\|right\|150px\|thumb\|A simple [[parse tree]].]]
	A [[parse tree]] is made up of nodes and branches.<ref>{{Cite web\|url=https://www1.essex.ac.uk/linguistics/external/clmt/latex4ling/trees/parsetree/\|title=The parsetree Package for Drawing Trees in LaTeX\|website=www1.essex.ac.uk}}</ref> In the picture below the parse tree is the entire structure, starting from S and ending in each of the leaf nodes (John,ball,the,hit).

	In a parse tree, each node is either a ''root'' node, a ''branch'' node, or a ''leaf'' node. In the above example, S is a root node, NP and VP are branch nodes, while John, ball, the, and hit are all leaf nodes.

	Nodes can also be referred to as parent nodes and child nodes. A ''parent'' node is one which has at least one other node linked by a branch under it. In the example, S is a parent of both NP and VP. A ''child'' node is one which has at least one node directly above it to which it is linked by a branch of the tree. Again from our example, hit is a child node of V.

	==See also==
	*[[Parse tree]]
	*[[Terminal and nonterminal symbols]]

	==References==
	{{reflist}}

	{{DEFAULTSORT:Non-Terminal Function}}
	[[Category:Parsing]]

Klbrain: Filled in 1 bare reference(s) with reFill 2

2020-05-16T21:24:00Z

Filled in 1 bare reference(s) with reFill 2

← Previous revision		Revision as of 21:24, 16 May 2020
Line 5:		Line 5:
	==Background==		==Background==
	[[Image:parseTree.svg\|right\|150px\|thumb\|A simple [[parse tree]].]]		[[Image:parseTree.svg\|right\|150px\|thumb\|A simple [[parse tree]].]]
	A [[parse tree]] is made up of nodes and branches.<ref>~~http~~://~~www~~.essex.ac.uk/linguistics/external/clmt/latex4ling/trees/parsetree/</ref> In the picture below the parse tree is the entire structure, starting from S and ending in each of the leaf nodes (John,ball,the,hit).		A [[parse tree]] is made up of nodes and branches.<ref>{{Cite web\|url=https://www1.essex.ac.uk/linguistics/external/clmt/latex4ling/trees/parsetree/\|title=The parsetree Package for Drawing Trees in LaTeX\|website=www1.essex.ac.uk}}</ref> In the picture below the parse tree is the entire structure, starting from S and ending in each of the leaf nodes (John,ball,the,hit).

	In a parse tree, each node is either a ''root'' node, a ''branch'' node, or a ''leaf'' node. In the above example, S is a root node, NP and VP are branch nodes, while John, ball, the, and hit are all leaf nodes.		In a parse tree, each node is either a ''root'' node, a ''branch'' node, or a ''leaf'' node. In the above example, S is a root node, NP and VP are branch nodes, while John, ball, the, and hit are all leaf nodes.

Klbrain: Replacing merge template; alternative target (arising from discussion); see Talk:Terminal and nonterminal symbols#Proposed merge with Terminal and nonterminal functions

2019-09-28T20:59:07Z

Replacing merge template; alternative target (arising from discussion); see Talk:Terminal and nonterminal symbols#Proposed merge with Terminal and nonterminal functions

← Previous revision		Revision as of 20:59, 28 September 2019
Line 1:		Line 1:
			{{merge to\|Parse tree\|date=September 2019}}
	{{merge to\|Terminal and nonterminal symbols\|discuss=Talk:Terminal and nonterminal symbols#Proposed merge with Terminal and nonterminal functions\|date=September 2018}}

	In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.		In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.

Enterprisey: rm old merge tag

2018-09-12T20:42:36Z

rm old merge tag

← Previous revision		Revision as of 20:42, 12 September 2018
Line 1:		Line 1:
	{{merge to\|Terminal and nonterminal symbols\|discuss=Talk:Terminal and nonterminal symbols#Proposed merge with Terminal and nonterminal functions\|date=September 2018}}		{{merge to\|Terminal and nonterminal symbols\|discuss=Talk:Terminal and nonterminal symbols#Proposed merge with Terminal and nonterminal functions\|date=September 2018}}
	{{merge\|terminal and nonterminal symbols\|date=March 2018}}

	In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.		In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.

Enterprisey: Added {{merge to}} tag to article (TW)

2018-09-12T05:32:00Z

Added {{merge to}} tag to article (TW)

← Previous revision		Revision as of 05:32, 12 September 2018
Line 1:		Line 1:
			{{merge to\|Terminal and nonterminal symbols\|discuss=Talk:Terminal and nonterminal symbols#Proposed merge with Terminal and nonterminal functions\|date=September 2018}}
	{{merge\|terminal and nonterminal symbols\|date=March 2018}}		{{merge\|terminal and nonterminal symbols\|date=March 2018}}

AnomieBOT: Dating maintenance tags: {{Merge}}

2018-03-21T05:40:33Z

Dating maintenance tags: {{Merge}}

← Previous revision		Revision as of 05:40, 21 March 2018
Line 1:		Line 1:
	{{merge\|terminal and nonterminal symbols}}		{{merge\|terminal and nonterminal symbols\|date=March 2018}}

	In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.		In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.

C. A. Russell: rm uncited original research that also happens to turn out to be nonsense

2018-03-21T05:20:26Z

rm uncited original research that also happens to turn out to be nonsense

← Previous revision		Revision as of 05:20, 21 March 2018
Line 10:		Line 10:

	Nodes can also be referred to as parent nodes and child nodes. A ''parent'' node is one which has at least one other node linked by a branch under it. In the example, S is a parent of both NP and VP. A ''child'' node is one which has at least one node directly above it to which it is linked by a branch of the tree. Again from our example, hit is a child node of V.		Nodes can also be referred to as parent nodes and child nodes. A ''parent'' node is one which has at least one other node linked by a branch under it. In the example, S is a parent of both NP and VP. A ''child'' node is one which has at least one node directly above it to which it is linked by a branch of the tree. Again from our example, hit is a child node of V.

	==Nodes as functions==
	Each of these nodes can also be called a function. However, this type of function (i.e. a node in a parse tree) is ''not'' the same as a function in mathematics or computer programming. A function in mathematics takes in zero or more inputs and returns a value.

	In parse trees, a function can be a true mathematical function which ''uses'' its child nodes as inputs, and returns a single output to its parent. More often, however, a node in a parse tree is a static symbol such as a number, letter, or word.

	The use of parse tree functions is highly dependent on the area which is using it. In the branch of [[evolutionary computation]] called [[genetic programming]], for instance, tree functions are quite often (but not exclusively) used as mathematical-style function. In [[linguistics]] and linguistic theory, tree functions are never mathematical functions, except in certain areas of [[computational linguistics]].

	==See also==		==See also==

C. A. Russell: +template:merge with terminal and nonterminal symbols; it's baffling that this would be a separate article, since they're the same thing. (Anything that can't be covered in the other article is original research and needs to be removed, anyway.) Only reason I'm not replacing everything with a redirect right now is that terminal and nonterminal symbols is too technical, and this one is gentler

2018-03-21T05:18:05Z

+template:merge with terminal and nonterminal symbols; it's baffling that this would be a separate article, since they're the same thing. (Anything that can't be covered in the other article is original research and needs to be removed, anyway.) Only reason I'm not replacing everything with a redirect right now is that terminal and nonterminal symbols is too technical, and this one is gentler

← Previous revision		Revision as of 05:18, 21 March 2018
Line 1:		Line 1:
			{{merge\|terminal and nonterminal symbols}}

	In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.		In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.

Shhhnotsoloud: Copyedit

2017-04-12T10:50:39Z

Copyedit

← Previous revision		Revision as of 10:50, 12 April 2017
Line 1:		Line 1:
	In [[computer science]], a '''~~non-terminal~~ function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.		In [[computer science]], a '''nonterminal function''' is a function (node) in a [[parse tree]] which is either a root or a branch in that tree whereas a '''terminal function''' is a function (node) in a parse tree which is a leaf.

	==Background==		==Background==
Line 5:		Line 5:
	A [[parse tree]] is made up of nodes and branches.<ref>http://www.essex.ac.uk/linguistics/external/clmt/latex4ling/trees/parsetree/</ref> In the picture below the parse tree is the entire structure, starting from S and ending in each of the leaf nodes (John,ball,the,hit).		A [[parse tree]] is made up of nodes and branches.<ref>http://www.essex.ac.uk/linguistics/external/clmt/latex4ling/trees/parsetree/</ref> In the picture below the parse tree is the entire structure, starting from S and ending in each of the leaf nodes (John,ball,the,hit).

	In a parse tree, each node is either a '''root''' node, a '''branch''' node, or a '''leaf''' node. In the above example, S is a root node, NP and VP are branch nodes, while John, ball, the, and hit are all leaf nodes.		In a parse tree, each node is either a ''root'' node, a ''branch'' node, or a ''leaf'' node. In the above example, S is a root node, NP and VP are branch nodes, while John, ball, the, and hit are all leaf nodes.

	Nodes can also be referred to as parent nodes and child nodes. A '''parent''' node is one which has at least one other node linked by a branch under it. In the example, S is a parent of both NP and VP. A '''child''' node is one which has at least one node directly above it to which it is linked by a branch of the tree. Again from our example, hit is a child node of V.		Nodes can also be referred to as parent nodes and child nodes. A ''parent'' node is one which has at least one other node linked by a branch under it. In the example, S is a parent of both NP and VP. A ''child'' node is one which has at least one node directly above it to which it is linked by a branch of the tree. Again from our example, hit is a child node of V.

	==Nodes as ~~Functions~~==		==Nodes as functions==
	Each of these nodes can also be called a function. However, this type of function (i.e. a node in a parse tree) is '''not''' the same as a function in mathematics or computer programming. A function in mathematics takes in zero or more inputs and returns a value.		Each of these nodes can also be called a function. However, this type of function (i.e. a node in a parse tree) is ''not'' the same as a function in mathematics or computer programming. A function in mathematics takes in zero or more inputs and returns a value.

	In parse trees, a function can be a true mathematical function which "uses" its child nodes as inputs, and returns a single output to its parent. More often, however, a node in a parse tree is a static symbol such as a number, letter, or word.		In parse trees, a function can be a true mathematical function which ''uses'' its child nodes as inputs, and returns a single output to its parent. More often, however, a node in a parse tree is a static symbol such as a number, letter, or word.

	The use of parse tree functions is highly dependent on the area which is using it. In the branch of [[evolutionary computation]] called [[genetic programming]], for instance, tree functions are quite often (but not exclusively) used as mathematical-style function. In [[linguistics]] and linguistic theory, tree functions are never mathematical functions, except in certain areas of [[computational linguistics]].		The use of parse tree functions is highly dependent on the area which is using it. In the branch of [[evolutionary computation]] called [[genetic programming]], for instance, tree functions are quite often (but not exclusively) used as mathematical-style function. In [[linguistics]] and linguistic theory, tree functions are never mathematical functions, except in certain areas of [[computational linguistics]].

Shhhnotsoloud: Shhhnotsoloud moved page Terminal and non-terminal functions to Terminal and nonterminal functions: Consistent with related subject Terminal and nonterminal symbols

2017-04-12T10:48:21Z

Shhhnotsoloud moved page Terminal and non-terminal functions to Terminal and nonterminal functions: Consistent with related subject Terminal and nonterminal symbols

← Previous revision	Revision as of 10:48, 12 April 2017
(No difference)