Augmented Transition Network
E216137
computational model
finite-state machine formalism
natural language processing technique
parsing formalism
Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Augmented Transition Network canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1937739 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Augmented Transition Network Context triple: [ATN, refersTo, Augmented Transition Network]
-
A.
General and Rational Grammar
General and Rational Grammar is a 17th-century French linguistic treatise from the Port-Royal school that seeks to explain the universal, rational principles underlying all human languages.
-
B.
Mathematical Structures of Language
Mathematical Structures of Language is a foundational work in mathematical linguistics that applies formal and algebraic methods to analyze the structure of natural languages.
-
C.
Backus–Naur Form
Backus–Naur Form is a formal notation used to define the syntax of programming languages and other formal grammars in a precise, structured way.
-
D.
Principles and Parameters Theory
Principles and Parameters Theory is a framework in generative linguistics that explains how universal grammatical principles and language-specific parameter settings account for the diversity and acquisition of human languages.
-
E.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Augmented Transition Network Target entity description: Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
-
A.
General and Rational Grammar
General and Rational Grammar is a 17th-century French linguistic treatise from the Port-Royal school that seeks to explain the universal, rational principles underlying all human languages.
-
B.
Mathematical Structures of Language
Mathematical Structures of Language is a foundational work in mathematical linguistics that applies formal and algebraic methods to analyze the structure of natural languages.
-
C.
Backus–Naur Form
Backus–Naur Form is a formal notation used to define the syntax of programming languages and other formal grammars in a precise, structured way.
-
D.
Principles and Parameters Theory
Principles and Parameters Theory is a framework in generative linguistics that explains how universal grammatical principles and language-specific parameter settings account for the diversity and acquisition of human languages.
-
E.
Chomsky hierarchy
The Chomsky hierarchy is a classification of formal grammars into four types that correspond to increasing levels of generative power and computational complexity in formal language theory.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
computational model
ⓘ
finite-state machine formalism ⓘ natural language processing technique ⓘ parsing formalism ⓘ |
| abbreviation | ATN ⓘ |
| basedOn | finite-state automaton ⓘ |
| canBeViewedAs | pushdown automaton with procedural extensions ⓘ |
| canEncode | feature information in registers ⓘ |
| comparedTo |
context-free grammar
ⓘ
pushdown automaton ⓘ recursive transition network ⓘ |
| enables |
goal-directed parsing
ⓘ
mixed procedural-declarative grammar representation ⓘ top-down parsing ⓘ |
| extends | transition network ⓘ |
| formalismFor |
context-free aspects of natural language
ⓘ
some context-sensitive phenomena ⓘ |
| hasComponent |
arcs
ⓘ
procedural actions ⓘ registers ⓘ stack-based memory ⓘ states ⓘ |
| hasFeature |
actions on arcs
ⓘ
backtracking ⓘ conditions on arcs ⓘ procedural control ⓘ register manipulation ⓘ stack operations ⓘ subnetwork calls ⓘ |
| hasLimitation |
formal properties depend on allowed procedural extensions
ⓘ
parsers can be difficult to debug ⓘ procedural descriptions can reduce declarative clarity ⓘ |
| influenced | later parsing systems in NLP ⓘ |
| introducedInField | computational linguistics ⓘ |
| represents | grammar as network of states and arcs ⓘ |
| supports |
nested constituents
ⓘ
recursive structures ⓘ unbounded dependencies ⓘ |
| supportsImplementationIn | LISP ⓘ |
| usedFor |
natural language understanding
ⓘ
parsing complex sentence structures ⓘ syntactic parsing ⓘ |
| usedIn |
computational linguistics
ⓘ
natural language processing ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Augmented Transition Network Description of subject: Augmented Transition Network is a type of finite-state machine extended with stack-based memory and procedural actions, widely used in natural language processing for parsing complex sentence structures.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.