Uses of Class
morfologik.fsa.FSA
Packages that use FSA
-
Uses of FSA in morfologik.fsa
Subclasses of FSA in morfologik.fsaModifier and TypeClassDescriptionfinal classCFSA (Compact Finite State Automaton) binary format implementation.final classCFSA (Compact Finite State Automaton) binary format implementation, version 2:CFSA2.BIT_TARGET_NEXTapplicable 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 bytefinal classFSA binary format implementation for version 5.Fields in morfologik.fsa declared as FSAModifier and TypeFieldDescriptionprivate final FSAByteSequenceIterator.fsaThe FSA to which this iterator belongs.private final FSAFSATraversal.fsaTarget automaton.Methods in morfologik.fsa with type parameters of type FSAModifier and TypeMethodDescriptionstatic <T extends FSA>
TFSA.read(InputStream stream, Class<? extends T> clazz) A factory for reading a specific FSA subclass, including proper casting.Methods in morfologik.fsa that return FSAModifier and TypeMethodDescriptionstatic FSAFSA.read(InputStream stream) A factory for reading automata in any of the supported versions.Constructors in morfologik.fsa with parameters of type FSAModifierConstructorDescriptionByteSequenceIterator(FSA fsa) Create an instance of the iterator iterating over all automaton sequences.ByteSequenceIterator(FSA fsa, int node) Create an instance of the iterator for a given node.FSATraversal(FSA fsa) Traversals of the given FSA. -
Uses of FSA in morfologik.fsa.builders
Subclasses of FSA in morfologik.fsa.buildersModifier and TypeClassDescription(package private) final classAn FSA with constant-size arc representation produced directly byFSABuilder.Fields in morfologik.fsa.builders declared as FSAModifier and TypeFieldDescriptionprivate final FSAFSAInfo.FinalStateVisitor.fsaprivate final FSAFSAInfo.NodeVisitor.fsaMethods in morfologik.fsa.builders that return FSAModifier and TypeMethodDescriptionstatic FSAFSABuilder.build(byte[][] input) Build a minimal, deterministic automaton from a sorted list of byte sequences.static FSABuild a minimal, deterministic automaton from an iterable list of byte sequences.FSABuilder.complete()Methods in morfologik.fsa.builders with parameters of type FSAModifier and TypeMethodDescriptionFSAUtils.calculateFanOuts(FSA fsa, int root) Calculate fan-out ratio (how many nodes have a given number of outgoing arcs).private com.carrotsearch.hppc.IntIntHashMapCFSA2Serializer.computeInlinkCount(FSA fsa) Compute in-link count for each state.private voidCFSA2Serializer.computeLabelsIndex(FSA fsa) Compute a set of labels to be integrated with the flags field.private booleanFSA5Serializer.emitArcs(FSA fsa, OutputStream os, int[] linearized, int gtl, int nodeDataLength) Update arc offsets assuming the given goto length.private intCFSA2Serializer.emitNodeArcs(FSA fsa, OutputStream os, int state, int nextState) Emit all arcs of a single node.private intCFSA2Serializer.emitNodes(FSA fsa, OutputStream os, com.carrotsearch.hppc.IntArrayList linearized) Update arc offsets assuming the given goto length.private com.carrotsearch.hppc.IntArrayListLinearization of states.private int[]Linearization of states.private intCFSA2Serializer.linearizeAndCalculateOffsets(FSA fsa, com.carrotsearch.hppc.IntArrayList states, com.carrotsearch.hppc.IntArrayList linearized, com.carrotsearch.hppc.IntIntHashMap offsets) Linearize all states, puttingstatesin front of the automaton and calculating stable state offsets.private voidCFSA2Serializer.linearizeState(FSA fsa, com.carrotsearch.hppc.IntStack nodes, com.carrotsearch.hppc.IntArrayList linearized, BitSet visited, int node) Add a state to linearized list.static com.carrotsearch.hppc.IntIntHashMapFSAUtils.rightLanguageForAllStates(FSA fsa) Calculate the size of "right language" for each state in an FSA.<T extends OutputStream>
T<T extends OutputStream>
TSerialize root statesto an output stream inFSA5format.<T extends OutputStream>
TSerialize a finite state automaton to an output stream.static voidSaves the right-language reachable from a given FSA node, formatted as an input for the graphviz package (expressed in thedotlanguage), to the given writer.static StringReturns the right-language reachable from a given FSA node, formatted as an input for the graphviz package (expressed in thedotlanguage).private static voidConstructors in morfologik.fsa.builders with parameters of type FSAModifierConstructorDescription(package private)FinalStateVisitor(FSA fsa) (package private)NodeVisitor(FSA fsa) -
Uses of FSA in morfologik.speller
Fields in morfologik.speller declared as FSA -
Uses of FSA in morfologik.stemming
Fields in morfologik.stemming declared as FSAModifier and TypeFieldDescriptionfinal FSADictionary.fsaFSAautomaton with the compiled dictionary data.private final FSADictionaryLookup.fsaThe FSA we are using.Constructors in morfologik.stemming with parameters of type FSAModifierConstructorDescriptionDictionary(FSA fsa, DictionaryMetadata metadata) It is strongly recommended to use static methods in this class for reading dictionaries.