Scribd
Upload
472 views8 pages

Augmented Transition Networks: An Augmented Transition Network (ATN) Is A Type of Graph

Augmented transition networks (ATNs) are graph structures used in parsing natural languages. ATNs build on finite state machines by adding recursion, allowing entire sentences to be parsed. An ATN represents a language as a collection of state transition graphs. A sentence is parsed by traversing arcs between states, matching words to transitions until a final state is reached. Optional components are represented by "jump" transitions without input. Parsing involves setting an ATN pointer to the start state and matching words to transitions, pushing and popping states to traverse multiple graphs as needed.

Uploaded by

shweta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
472 views8 pages

Augmented Transition Networks: An Augmented Transition Network (ATN) Is A Type of Graph

Augmented transition networks (ATNs) are graph structures used in parsing natural languages. ATNs build on finite state machines by adding recursion, allowing entire sentences to be parsed. An ATN represents a language as a collection of state transition graphs. A sentence is parsed by traversing arcs between states, matching words to transitions until a final state is reached. Optional components are represented by "jump" transitions without input. Parsing involves setting an ATN pointer to the start state and matching words to transitions, pushing and popping states to traverse multiple graphs as needed.

Uploaded by

shweta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 8

Augmented Transition Networks

An augmented transition network (ATN) is a type of graph


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.
Components of an ATN
ATNs build on the idea of using finite state machines to parse
sentences. ATNs have states to mark the progress in processing a
string. Transitions correspond to individual words or phrases
from a syntactic type. 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.
Examples of ATNs
NP verb
S1 S2
S

det NP1
NP noun
pronoun

name NP2

The top ATN specifies the structure of a sentence.


The bottom ATN corresponds to its NP transition and
would be used to process a noun phrase as subject of
the sentence.
A more complex example of an ATN for a sentence

NP
S S1 S4
verb NP
NP
S2 S3 jump
jump
The jump transitions are for optional components
and consume no input.

ATN for parsing


Mary gave me a new picture
Mary sings.
etc
Parsing with an ATN

1. Set the ATN pointer to [S] and the source pointer to the 1st word of the sentence. The
ATN pointer points to the current node.
2. Select an arc out of the current node which satisfies any associated test and, if the arc is
labeled with a word category, the current word must be a member of that category.
3. Execute any actions associated with the arc and:
If the arc is a word category, update the current position in the source sentence by
one word and change the current node to the destination of the arc
If the arc corresponds to another ATN, push the starting node of the ATN onto the
ATN pointer
If the arc is jump, chage the current node to the destination of that arc
If the arc is done, pop the current node off of the ATN pointer and set * to the
value returned by this node. If the ATN pointer is now empty and all of the text
has been processed, return *. If the ATN pointer is empty and there is remaining
text, fail. Otherwise, return to step 2.
Example parse : Mary gave me a new picture

ATN Pointer Source Pointer Variables and Values


S Mary
NP S Mary
NP2 S gave Name = Mary
S gave * = (NP (Name Mary))
S1 gave
S2 me Verb = (V (Verb give))
NP S2 me Pronoun = me
NP2 S2 a
S2 a
S3 a OJB = (NP (Pronoun M))
NP S3 a
NP1 S3 new DET = a
NP1 S3 picture ADJS = (new)
NP2 S3 NOUN = picture
S3
S4
A more complex example of an ATN for a sentence

NP
S S1 S4
verb NP
NP
S2 S3 jump
jump
The jump transitions are for optional components
and consume no input.

ATN for parsing


Mary gave me a new picture
Mary sings.
etc
Example parse : Mary gave me a new picture

ATN Pointer Source Pointer Variables and Values


S Mary
NP S Mary
NP2 S gave Name = Mary
S gave * = (NP (Name Mary))
S1 gave
S2 me Verb = (V (Verb give))
NP S2 me Pronoun = me
NP2 S2 a
S2 a
S3 a OJB = (NP (Pronoun M))
NP S3 a
NP1 S3 new DET = a
NP1 S3 picture ADJS = (new)
NP2 S3 NOUN = picture
S3
S4

You might also like