The basic method of the parser is that it tries to recognise possible dependents for each token of a word category moving out from the nearest neighbour. As the parser is modelled with two-way automata, it can recognise subordinates both from the left and right context of the current input word. For each word category possible dependents are described in automaton networks. Rn s are dependency relations. Possible orderings of dependent and regent are stated in left and right-side automaton descriptions.
Dependency relations are the only rules that are used.
Our kind of description is rather far from the Haysian classical dependency notation. Especially the word order restrictions are currently described rather clumsily. Possible word orders are blurred into paths of the automaton network. As a linguistic description this is not satisfying and a new way for describing the word order should be found. The second major problem is that lexical knowledge is stated in two places.