Eckhard Bick - VISL

node without branches matching the next word or word class), the algorithm retraces its
steps back to the last viable branching alternative. This way, the whole tree of possible
constituent analyses is searched in a finite number of steps, and if a given sentence falls
into the subsegment of a language described by the grammar in question, the algorithm
will print out an analysis each time it encounters the ‘end’ symbol (i.e. takes a path
matched by the last word of the sentence).
An example for a simple finite state transition network is shown below:
Example for finite state transition network:
S -> pron VP
VP -> v
VP -> v NP
NP -> n
NP -> det ANP
NP -> adj N
ANP -> adj ANP
ANP -> adj N
N -> n
N -> prop
N -> n ConjNP
ConjNP -> cc NP
- 142 -
cc
adj
ConjNP
S pron VP v NP det ANP adj N n End-node
det adj prop
v prop n
E.g. She offers green tea and red oranges and a song.
He loves a fine story and Shakespeare.