Recursive transition network: Difference between revisions

Content deleted Content added
ed ;; synonym reference
 
(7 intermediate revisions by 6 users not shown)
Line 1:
[[File:Fancy noun recursive transition network.svg|350px|thumb|A recursive transition network for "fancy nouns". Note that recursion is created by the nodes labelled "Fancy noun".]]
A '''recursive transition network''' ("RTN") is a [[graph theory|graph theoretical]] [[schematic]] used to represent the rules of a [[context free grammar]]. RTNs have application to [[programming language]]s, [[natural language]] and [[lexical analysis]]. Any [[Sentence (linguistics)|sentence]] that is constructed according to the rules of an RTN <ref>A sentence is generated by a RTN by applying the generative rules specified in the RTN itself. These represent any set of rules or a function consisting of a finite number of steps.</ref> is said to be "well-formed." The structural elements of a well-formed sentence may also be well-formed sentences by themselves, or they may be simpler structures. This is why RTNs are described as [[Recursion|recursive]].
 
A '''recursive transition network''' ("RTN") is a [[graph theory|graph theoretical]] [[schematic]] used to represent the rules of a [[context -free grammar]]. RTNs have application to [[programming language]]s, [[natural language]] and [[lexical analysis]]. Any [[Sentence (linguistics)|sentence]] that is constructed according to the rules of an RTN <ref>A sentence is generated by a RTN by applying the generative rules specified in the RTN itself. These represent any set of rules or a function consisting of a finite number of steps.</ref> is said to be "well-formed.". The structural elements of a well-formed sentence may also be well-formed sentences by themselves, or they may be simpler structures. This is why RTNs are described as [[Recursion|recursive]].<ref name="Kumar2008">{{cite book|author=Ela Kumar|title=Artificial Intelligence|url=https://books.google.com/books?id=rNmAY-RcGKYC&pg=PA324|date=20 September 2008|publisher=I. K. International Pvt Ltd|isbn=978-81-906566-6-5|pages=324–}}</ref>
 
== Notes and references ==
Line 8 ⟶ 10:
* [[Computational linguistics]]
* [[Context free language]]
* [[Finite -state machine]]
* [[Formal grammar]]
* [[Parse tree]]
Line 19 ⟶ 21:
 
 
{{compsciNLP-stub}}
{{ling-stub}}