|
Class Summary |
| CFSA |
CFSA (Compact Finite State Automaton) binary format implementation. |
| CFSAEncoder |
Re-encode FSA5 automaton to a more compact representation (CFSA). |
| FSA |
This is a top interface for walking Finite State Automata 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). |
| FSA5 |
FSA binary format implementation for version 5. |
| FSAFinalStatesIterator |
An iterator that traverses all final states reachable from a given node and
returns byte sequences corresponding to final states. |
| FSAInfo |
Compute additional information about an FSA: number of arcs, nodes, etc. |
| FSAMatch |
A matching result returned from FSATraversalHelper. |
| FSATraversalHelper |
This class implements some common matching and scanning operations on a
generic FSA. |