NETEDI: An Augmented Transition Network Editor.

摘要

A traditional model for recognizing sentences in certain types of languages has been the transition network. One of these can be drawn on a piece of paper as a group of circles with labeled directed lines connecting them. The circles are called states. Generally, one will be designated the start state and another the final state. The lines are called arcs and represent ways to get from one state to another if the label is matched by the current input word. Every time an arc is taken, the input advances to the next word.