Content deleted Content added
categ ;; see also |
|||
(23 intermediate revisions by 17 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]] that is constructed according to the rules of a RTN 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 [[recursive]].▼
▲A '''recursive transition network''' ("RTN") is a [[graph theory|graph theoretical]] [[schematic]] used to represent the rules of a [[context
==See also==▼
== Notes and references ==
{{reflist}}
▲==See also==
* [[Syntax diagram]]
* [[Computational linguistics]]
* [[Context free language]]
* [[Finite
* [[Formal grammar]]
* [[Parse tree]]
* [[Parsing]]
* [[
{{DEFAULTSORT:Recursive Transition Network}}
[[Category:Diagrams]]
[[Category:Natural language processing]]
{{
|