Package morfologik.fsa

Class Summary
FSA This class implements Finite State Automaton traversal as described in Jan Daciuk's Incremental Construction of Finite-State Automata and Transducers, and Their Use in the Natural Language Processing (PhD thesis, Technical University of Gdansk).
FSAFinalStatesIterator An iterator that traverses all final states reachable from a given node and returns byte sequences corresponding to final states.
FSAHelpers This class has several static utility methods for use with the FSA package.
FSAMatch A matching result returned from FSATraversalHelper.
FSATraversalHelper This class implements some common matching and scanning operations on a generic FSA.
FSAVer5Impl FSA (Finite State Automaton) dictionary traversal implementation for version 5 of the FSA automaton.
 

Enum Summary
FSAFlags FSA automaton flags.
FSAMatchType Type of the match returned as part of FSAMatch.