Scribd
Upload
14 views16 pages

AI Module 3 Lecture 4

The document discusses transition networks as a method to represent natural languages using directed graphs and finite state automata. It describes two types of transition networks: Recursive Transition Networks (RTN) and Augmented Transition Networks (ATN), highlighting their structures and functionalities. RTNs allow recursive definitions while ATNs extend RTNs with additional capabilities for parsing and semantic processing.

Uploaded by

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

AI Module 3 Lecture 4

The document discusses transition networks as a method to represent natural languages using directed graphs and finite state automata. It describes two types of transition networks: Recursive Transition Networks (RTN) and Augmented Transition Networks (ATN), highlighting their structures and functionalities. RTNs allow recursive definitions while ATNs extend RTNs with additional capabilities for parsing and semantic processing.

Uploaded by

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

Amity School of Engineering and Technology

MODULE III
Understanding Natural Languages
B.Tech.(AI), IV
Artificial Intelligence (CSE 401)

Dr. Nidhi Mishra, Assistant Professor


Department of CSE, ASET
TRANSITION NETWORK

• It is a method to represent the natural


languages. It is based on applications of
directed graphs and finite state automata.
• The transition network can be constructed
by the help of some inputs, states and
outputs.
• A transition network may consist of some
states or nodes, some labeled arcs from
one state to the next state through which it
will move. 2
• The arc represents the rule or some
conditions upon which the transition is
made from one state to another state.
• For example, a transition network is used
to recognize a sentence consisting of an
article, a noun, an auxiliary, a verb, an
article, a noun would be represented by
the transition network as follows.

3
4
• The transition from N1 to N2 will be made if
an article is the first input symbol.
• If successful, state N2 is entered.
• The transition from N2 to N3 can be made
if a noun is found next.
• If successful, state N3 is entered.
• The transition from N3 to N4 can be made
if an auxiliary is found and so on.
5
• Suppose consider a sentence “A boy is
eating a banana”.
• So if the sentence is parsed in the above
transition network then, first ‘A’ is an
article.
• So successful transition t o the node N1 to
N2. Then boy is a noun (so N2 to N3), “is” is
an auxiliary (N5 to N6) and finally “banana”
is a noun (N 6 to N7) is done successfully.
• So the above sentence is successfully
parsed in the transition network. 6
TYPES OF TRANSITION
NETWORK

• There are generally two types of transition


networks like
1.Recursive Transition networks (RTN)
2.Augmented Transition networks (ATN)

7
Recursive Transition Networks (RTN)

• RTNs are considered as development for


finite state automata with some essential
conditions to take the recursive
complexion for some definitions in
consideration.
• A recursive transition network consists of
nodes (states) and labeled arcs
(transitions).

8
• It permits arc labels to refer to other
networks and they in turn may refer back
to the referring network rather than just
permitting word categories.
• It is a modified version of transition
network.
• It allows arc labels that refer to other
networks rather than word category.

9
A recursive transition network can have 5 types of arcs (Allen’s, JM’s) like

1) CAT: Current word must belong to category

2) WORD: Current word must match label exactly.

3) PUSH: Named network must be successfully traversed.

4) JUMP: Can always be traversed.

5) POP: Can always be traversed and indicates that input string has
been accepted by the network. In RTN, one state is specified as a
start state. A string is accepted by an RTN if a POP arc is reached and
all the input has been consumed.

Let us consider a sentence “The stone was dark black”. 10


Here The: ART

Stone: ADJ NOUN

Was: VERB

Dark: ADJ

Black: ADJ NOUN

11
12
Augmented Transition Network
(ATN)

• An ATN is a modified transition network.


• It is an extension of RTN.
• The ATN uses a top down parsing
procedure to gather various types of
information to be later used for
understanding system.
• It produces the data structure suitable for
further processing and capable of storing
semantic details.
13
• An augmented transition network (ATN) is
a recursive transition network that can
perform tests and take actions during arc
transitions.
• An ATN uses a set of registers to store
information.
• A set of actions is defined for each arc and
the actions can look at and modify the
registers.
• An arc may have a test associated with it.
14
• The arc is traversed (and its action) is
taken only if the test succeeds.
• When a lexical arc is traversed, it is put in
a special variable (*) that keeps track of
the current word.
• The ATN was first used in LUNAR system.
• In ATN, the arc can have a further
arbitrary test and an arbitrary action.

15
The structure of ATN

16

You might also like