ATN

E41481

computational model finite state machine formalism natural language processing technique parsing formalism

ATN most likely refers to Augmented Transition Network, a type of finite state machine used in computational linguistics and natural language processing for parsing sentences.

Aliases (1)

Augmented Transition Network ×48

Statements (49)

Predicate	Object
instanceOf	computational model → finite state machine formalism → natural language processing technique → parsing formalism →
abbreviation	ATN →
allows	recursive descent-like behavior → subnetwork calls →
basedOn	finite state automaton →
category	automata-based parser → formal grammar →
comparedTo	recursive transition network →
component	actions → arcs → register set → states → tests →
extends	finite state grammar →
field	computational linguistics → natural language processing →
goal	model human sentence processing more realistically than simple finite state models →
hasAdvantage	greater expressive power than simple finite state automata → procedural control over parsing →
hasFeature	actions on arcs → augmented states → conditions on arcs → procedural attachments → recursive transitions → registers →
influenced	later parsing formalisms →
parses	input string as path through network →
refersTo	Augmented Transition Network →
relatedTo	chart parser → context-free grammar → pushdown automaton → transition network grammar →
represents	grammar as network of states →
supports	backtracking → context-sensitive constraints → nondeterministic parsing → top-down parsing → unbounded dependencies modeling →
timePeriod	developed in late 1960s → popular in 1970s →
usedFor	natural language understanding → sentence parsing → syntactic parsing →
usedIn	dialogue systems research → early natural language understanding systems → machine translation research →

Referenced by (2)

Subject (surface form when different)	Predicate
Augmented Transition Network →	abbreviation
IFC →	distinctFrom