An augmented transition network (ATN) is a type of graph theoretic structure used in the operational definition of formal languages, used especially in parsing relatively complex natural languages, and having wide application in artificial intelligence. A labeled graph with 6 vertices and 7 edges. ... In mathematics, logic, and computer science, a formal language is a set of finite-length words (i. ... In computer science, parsing is the process of analyzing an input sequence (read from a file or a keyboard, for example) in order to determine its grammatical structure with respect to a given formal grammar. ... The term natural language is used to distinguish languages spoken and signed (by hand signals and facial expressions) by humans for general-purpose communication from constructs such as writing, computer-programming languages or the languages used in the study of formal logic, especially mathematical logic. ... Hondas intelligent humanoid robot AI redirects here. ...
References
Winograd, Terry (1983), Language as a Cognitive Process, Volume 1: Syntax, Addison–Wesley, Reading, MA.
Woods, William A. (1970), "Transition Network Grammars for Natural Language Analysis", Communications of the ACM 13:10 (1970), 591–606.
Terry Allen Winograd (born February 24, 1946) is a professor of computer science at Stanford University. ... Communications of the ACM (CACM) is the flagship monthly magazine of the Association for Computing Machinery. ...
TransitionNetwork Grammars developed out of the concept of the transitionnetwork of a finite-state automaton, but are equivalent to push-down automata because the arcs comprising the network of a TransitionNetwork Grammar represent transcriptions of the rules of a context-free grammar (Woods (1970)).
Note that, although the foregoing observations cite FSA transitionnetworks, these statements apply equally to PDA networks, with the exception that in the case of the latter machines, arcs corresponding to lambda/pop transitions are not labelled by terminal symbols of the equivalent grammar.
Hence, recursive transitionnetworks are equivalent to context-free grammars, and to push-down automata.
Feeds |
Contact