|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use morfologik.fsa | |
|---|---|
| morfologik.fsa | |
| morfologik.fsa.bytes | |
| morfologik.stemming | |
| Classes in morfologik.fsa used by morfologik.fsa | |
|---|---|
| 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). |
|
| FSAFinalStatesIterator
An iterator that traverses all final states reachable from a given node and returns byte sequences corresponding to final states. |
|
| FSAFlags
FSA automaton flags. |
|
| FSAMatch
A matching result returned from FSATraversalHelper. |
|
| FSAMatchType
Type of the match returned as part of FSAMatch. |
|
| FSATraversalHelper
This class implements some common matching and scanning operations on a generic FSA. |
|
| Visitor
Visitor interface for traversals. |
|
| Classes in morfologik.fsa used by morfologik.fsa.bytes | |
|---|---|
| FSAInfo
Compute additional information about an FSA: number of arcs, nodes, etc. |
|
| Traversable
Graph traversal acceptors. |
|
| Visitor
Visitor interface for traversals. |
|
| Classes in morfologik.fsa used by morfologik.stemming | |
|---|---|
| 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). |
|
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||