Augmented Transition Networks (1970) › Legacy
History of Language AIAll chapters Augmented Transition Networks (1970) › LegacyOne section · Sections in this chapter6 / 7 ↓
Reading tools Definitions & inline links
Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.
Article links
Make inline references clickable
ATNs captured a useful engineering pattern: a grammar could be represented as a graph whose execution simultaneously recognized input and built an interpretation. Registers made intermediate state explicit, while recursive calls factored phrase types into reusable networks.
Later parsers retained some of these concerns but did not simply inherit the ATN design. Feature structures offered a declarative way to carry agreement information. Chart algorithms stored partial results in a table, and statistical models supplied preferences among parses. Modern transition-based parsers also make state-changing moves, but that family resemblance does not establish a direct technical lineage from Woods's interpreter.
The decline of ATNs coincided with a shift from hand-written grammars to parsers estimated from annotated corpora. Data-driven systems reduced manual grammar work, but they replaced explicit arc code with learned parameters and a new dependency on training data.
ATNs are now mainly of historical and pedagogical interest. They show, in a compact notation, how recursion handles nested constituents, how mutable state supports agreement checks, and how semantic actions can be interleaved with recognition. LUNAR demonstrated that this machinery could support a working natural-language interface over a restricted scientific database.