All Classes and Interfaces

Class
Description
A view over a range of an array.
 
 
 
An iterator that traverses the right language of a given node (all sequences reachable from a given node).
CFSA (Compact Finite State Automaton) binary format implementation.
CFSA (Compact Finite State Automaton) binary format implementation, version 2: CFSA2.BIT_TARGET_NEXT applicable on all arcs, not necessarily the last one. v-coded goto field v-coded perfect hashing numbers, if any 31 most frequent labels integrated with flags byte
Serializes in-memory FSA graphs to CFSA2.
Base class for command-line applications.
An FSA with constant-size arc representation produced directly by FSABuilder.
 
 
Applies a morphological dictionary automaton to the input.
Decompiles morphological dictionary automaton back to source state.
Decompiles morphological dictionary automaton back to source state.
A dictionary combines FSA automaton and DictionaryMetadata describing the way terms are encoded in the automaton.
Attributes applying to Dictionary and DictionaryMetadata.
An iterator over WordData entries of a Dictionary.
This class implements a dictionary lookup of an inflected word over a dictionary previously compiled using the dict_compile tool.
Description of attributes, their types and default values.
Helper class to build DictionaryMetadata instances.
 
 
This is a top abstract class for handling finite state automata.
FSA binary format implementation for version 5.
Serializes in-memory FSA graphs to a binary format compatible with Jan Daciuk's fsa's package FSA5 format.
Deprecated.
Fast, memory-conservative finite state automaton builder, returning an in-memory FSA that is a tradeoff between construction speed and memory consumption.
Debug and information constants.
Build finite state automaton out of text input.
Dump all byte sequences encoded in a finite state automaton.
Deprecated.
FSA automaton flags.
Standard FSA file header, as described in fsa package documentation.
Compute additional information about an FSA: number of arcs, nodes, etc.
Print extra information about a compiled automaton file.
Computes the exact number of final states.
Computes the exact number of states and nodes by recursively traversing the FSA.
All FSA serializers (to binary formats) will implement this interface.
This class implements some common matching and scanning operations on a generic FSA.
Other FSA-related utilities not directly associated with the class hierarchy.
 
Keeps track of already computed values of edit distance.
The logic of encoding one sequence of bytes relative to another sequence of bytes.
A generic "stemmer" interface in Morfologik.
JAR entry point.
A matching result returned from FSATraversal.
No relative encoding at all (full target form is returned).
A dictionary-based stemmer for the Polish language.
The serialization and encoding format to use for compressing the automaton.
Finds spelling suggestions.
State visitor.
Encodes dst relative to src by trimming whatever non-equal suffix and infix src and dst have.
Encodes dst relative to src by trimming whatever non-equal suffix and prefix src and dst have.
Encodes dst relative to src by trimming whatever non-equal suffix src has.
Thrown when some input cannot be mapped using the declared charset (bytes to characters or the other way around).
 
 
Stem and tag data associated with a given word.