Our method consists of preparing data for the guesser, building a finite state automaton from that data, cutting out useless information, and using the automaton to recognize meaningful word endings. In the automaton, each transition is labeled with one character.
We use a particular format of data that is very important for the way the guesser is constructed. Please refer to the section 3.3 for its detailed description.