Terminal function - Revision history

EmausBot: Bot: Fixing double redirect to Parse tree#Nomenclature

2020-09-22T19:49:53Z

Bot: Fixing double redirect to Parse tree#Nomenclature

← Previous revision		Revision as of 19:49, 22 September 2020
Line 1:		Line 1:
	#REDIRECT [[~~Terminal~~ ~~and nonterminal functions~~]] {{R from merge}}		#REDIRECT [[Parse tree#Nomenclature]] {{R from merge}}

Shhhnotsoloud: Change target after target page move

2017-04-12T10:52:22Z

Change target after target page move

← Previous revision		Revision as of 10:52, 12 April 2017
Line 1:		Line 1:
	#REDIRECT [[Terminal and ~~non-terminal~~ functions]] {{R from merge}}		#REDIRECT [[Terminal and nonterminal functions]] {{R from merge}}

Extra999: content merged

2012-05-09T08:47:29Z

content merged

← Previous revision		Revision as of 08:47, 9 May 2012
Line 1:		Line 1:
			#REDIRECT [[Terminal and non-terminal functions]] {{R from merge}}
	{{merge\|Non-terminal function\|discuss=Talk:Non-terminal function#Merge proposal\|date=December 2011}}
	{{Unreferenced\|date=December 2009}}
	{{Orphan\|date=December 2009}}

	In [[computer science]], a '''terminal function''' is a function (node) in a [[parse tree]] which is a leaf in that parse tree.

	==Background==
	A [[parse tree]] is made up of nodes and branches. 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).

	[[Image:parseTree.svg\|frame\|none\|A simple parse tree]]

	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 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==
	*[[Non-terminal function]]

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

AnomieBOT: Dating maintenance tags: {{Merge}}

2011-12-02T21:24:01Z

Dating maintenance tags: {{Merge}}

← Previous revision		Revision as of 21:24, 2 December 2011
Line 1:		Line 1:
	{{merge\|Non-terminal function\|discuss=Talk:Non-terminal function#Merge proposal}}		{{merge\|Non-terminal function\|discuss=Talk:Non-terminal function#Merge proposal\|date=December 2011}}
	{{Unreferenced\|date=December 2009}}		{{Unreferenced\|date=December 2009}}
	{{Orphan\|date=December 2009}}		{{Orphan\|date=December 2009}}

Ruud Koot: {{merge|Non-terminal function|discuss=Talk:Non-terminal function#Merge proposal}}

2011-12-02T21:03:49Z

{{merge|Non-terminal function|discuss=Talk:Non-terminal function#Merge proposal}}

← Previous revision		Revision as of 21:03, 2 December 2011
Line 1:		Line 1:
			{{merge\|Non-terminal function\|discuss=Talk:Non-terminal function#Merge proposal}}
	{{Unreferenced\|date=December 2009}}		{{Unreferenced\|date=December 2009}}
	{{Orphan\|date=December 2009}}		{{Orphan\|date=December 2009}}

	A '''terminal function''' is a function (node) in a [[parse tree]] which is a leaf in that parse tree.		In [[computer science]], a '''terminal function''' is a function (node) in a [[parse tree]] which is a leaf in that parse tree.

	==Background==		==Background==

Nick Number: /* Nodes as functions */ sp linguistics WP:TYPO

2010-08-27T15:49:06Z

Nodes as functions: sp linguistics WP:TYPO

← Previous revision		Revision as of 15:49, 27 August 2010
Line 18:		Line 18:
	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 [[~~lingustics~~]] 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]].

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

SmackBot: remove Erik9bot category,outdated, tag and general fixes, added orphan tag

2009-12-17T12:09:22Z

remove Erik9bot category,outdated, tag and general fixes, added orphan tag

← Previous revision		Revision as of 12:09, 17 December 2009
Line 1:		Line 1:
			{{Unreferenced\|date=December 2009}}
			{{Orphan\|date=December 2009}}

	A '''terminal function''' is a function (node) in a [[parse tree]] which is a leaf in that parse tree.		A '''terminal function''' is a function (node) in a [[parse tree]] which is a leaf in that parse tree.

	== Background ==		==Background==
	A [[parse tree]] is made up of nodes and branches. 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. 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).

Line 10:		Line 13:
	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.

Line 20:		Line 23:
	*[[Non-terminal function]]		*[[Non-terminal function]]

			{{DEFAULTSORT:Terminal Function}}
	[[Category:Parsing]]		[[Category:Parsing]]
	[[Category:Articles lacking sources (Erik9bot)]]

Erik9bot: add Category:Articles lacking sources (Erik9bot)

2009-09-02T02:32:54Z

add Category:Articles lacking sources (Erik9bot)

← Previous revision		Revision as of 02:32, 2 September 2009
Line 21:		Line 21:

	[[Category:Parsing]]		[[Category:Parsing]]
			[[Category:Articles lacking sources (Erik9bot)]]

Radagast83 at 07:52, 9 November 2008

2008-11-09T07:52:51Z

← Previous revision		Revision as of 07:52, 9 November 2008
Line 1:		Line 1:
	{{Merge \|Non-terminal function\|Talk:Non-terminal function#Merge proposal \|date=August 2007\|User:Tobias Bergemann}}
	A '''terminal function''' is a function (node) in a [[parse tree]] which is a leaf in that parse tree.		A '''terminal function''' is a function (node) in a [[parse tree]] which is a leaf in that parse tree.

Tea2min: Suggest merge with Non-terminal function

2007-08-22T11:29:22Z

Suggest merge with Non-terminal function

← Previous revision		Revision as of 11:29, 22 August 2007
Line 1:		Line 1:
	{{Merge \|Non-terminal function\|Talk:Non-terminal function#Merge proposal \|date=August 2007\|[[User:Tobias Bergemann~~\|Tobias Bergemann]]~~}}		{{Merge \|Non-terminal function\|Talk:Non-terminal function#Merge proposal \|date=August 2007\|User:Tobias Bergemann}}
	A '''terminal function''' is a function (node) in a [[parse tree]] which is a leaf in that parse tree.		A '''terminal function''' is a function (node) in a [[parse tree]] which is a leaf in that parse tree.