Transition Network

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. 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.

The transition from N₁ to N₂ will be made if an article is the first input symbol. If successful, state N₂ is entered. The transition from N₂ to N₃ can be made if a noun is found next. If successful, state N₃ is entered. The transition from N₃ to N₄ can be made if an auxiliary is found and so on. Suppose consider a sentence “A boy is eating a banana”. So if the sent ence is parsed in the above transition network then, first ‘A’ is an article. So successful transition t o the node N₁ to N₂. Then boy is a noun (so N₂ to N₃), “is” is an auxiliary (N₅ to N₆) and finally “banana” is a noun (N ₆ to N₇) is done successfully. So the above sentence is successfully parsed in the transition network.