Augmented transition network
||This article includes a list of references, but its sources remain unclear because it has insufficient inline citations. (April 2009)|
||This article may be unbalanced towards certain viewpoints. (April 2009)|
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. An ATN can, theoretically, analyze the structure of any sentence, however complicated.
ATNs build on the idea of using finite state machines (Markov model) to parse sentences. W. A. Woods in "Transition Network Grammars for Natural Language Analysis" claims that by adding a recursive mechanism to a finite state model, parsing can be achieved much more efficiently. Instead of building an automaton for a particular sentence, a collection of transition graphs are built. A grammatically correct sentence is parsed by reaching a final state in any state graph. Transitions between these graphs are simply subroutine calls from one state to any initial state on any graph in the network. A sentence is determined to be grammatically correct if a final state is reached by the last word in the sentence.
This model meets many of the goals set forth by the nature of language in that it captures the regularities of the language. That is, if there is a process that operates in a number of environments, the grammar should encapsulate the process in a single structure. Such encapsulation not only simplifies the grammar, but has the added bonus of efficiency of operation. Another advantage of such a model is the ability to postpone decisions. Many grammars use guessing when an ambiguity comes up. This means that not enough is yet known about the sentence. By the use of recursion, ATNs solve this inefficiency by postponing decisions until more is known about a sentence.
- Augmented syntax diagram
- Context free language
- Finite state machine
- Formal grammar
- Recursive transition network
- Wanner, Eric (1980). "The ATN and the Sausage Machine: which one is baloney?". Cognition 8 (2): 209–225. doi:10.1016/0010-0277(80)90013-X. PMID 7389289.
- Wanner, Eric; Maratsos, Michael (1978). "An ATN approach to comprehension". In M. Halle, J. Bresnan, and G.A. Miller. Linguistic Theory and Psychological Reality. Cambridge: MIT Press.
- 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): 591–606. doi:10.1145/355598.362773.