Uses of Package
org.apache.lucene.util.fst
Packages that use org.apache.lucene.util.fst
Package
Description
Normalization of text before the tokenizer.
A Java implementation of Hunspell stemming and
spell-checking algorithms (
Hunspell
), and a stemming
TokenFilter (HunspellStemFilter
) based on it.Analyzer for Japanese.
Kuromoji dictionary implementation.
Kuromoji utility classes.
Analyzer for Korean.
Korean dictionary implementation.
Nori utility classes.
Miscellaneous Tokenstreams.
Analysis components for Synonyms.
BlockTree terms dictionary.
Uses already seen data (the indexed documents) to classify an input ( can be simple text or a
structured document).
Pluggable term index / block terms dictionary implementations.
Same postings format as Lucene50, except the terms dictionary also supports ords, i.e.
BlockTree terms dictionary.
Term dictionary, DocValues or Postings formats that are read entirely into memory.
Simpletext Codec: writes human readable postings.
Pluggable term index / block terms dictionary implementations.
Misc FST classes.
A primary-key postings format that associates a version (long) with each term and can provide
fail-fast lookups by ID and version.
Analyzer based autosuggest.
Support for document suggestion
Finite-state based autosuggest.
Finite state transducers
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.charfilterClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.Represents the outputs for an FST, providing the basic algebra required for building and traversing the FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.hunspellClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.ja
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.ja.dictClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.ja.util
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.ko
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.ko.dictClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.ko.util
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.miscellaneousClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.analysis.synonymClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.backward_codecs.lucene40.blocktreeClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.Represents the outputs for an FST, providing the basic algebra required for building and traversing the FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.classification
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.codecs.blocktermsClassDescriptionEnumerates all input (BytesRef) + output pairs in an FST.Holds a single input (BytesRef) + output pair.Represents an finite state machine (FST), using a compact byte[] format.Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with outputs.An FST
Outputs
implementation where each output is a non-negative long value. -
Classes in org.apache.lucene.util.fst used by org.apache.lucene.codecs.blocktreeordsClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with outputs.Represents the outputs for an FST, providing the basic algebra required for building and traversing the FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.codecs.lucene90.blocktreeClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with outputs.Represents the outputs for an FST, providing the basic algebra required for building and traversing the FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.codecs.memoryClassDescriptionEnumerates all input (BytesRef) + output pairs in an FST.Holds a single input (BytesRef) + output pair.Represents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with outputs.Represents the outputs for an FST, providing the basic algebra required for building and traversing the FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.codecs.simpletextClassDescriptionEnumerates all input (BytesRef) + output pairs in an FST.Represents an finite state machine (FST), using a compact byte[] format.Holds a single pair of two outputs.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.codecs.uniformsplitClassDescriptionEnumerates all input (BytesRef) + output pairs in an FST.Represents an finite state machine (FST), using a compact byte[] format.Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with outputs.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.misc.util.fstClassDescriptionRepresents the outputs for an FST, providing the basic algebra required for building and traversing the FST.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.sandbox.codecs.idversionClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with outputs.An FST
Outputs
implementation, holding two other outputs.Holds a single pair of two outputs. -
Classes in org.apache.lucene.util.fst used by org.apache.lucene.search.suggest.analyzingClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.Holds a single pair of two outputs.
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.search.suggest.documentClassDescriptionRepresents an finite state machine (FST), using a compact byte[] format.Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with outputs.An FST
Outputs
implementation, holding two other outputs.Holds a single pair of two outputs.Represents a path in TopNSearcher. -
Classes in org.apache.lucene.util.fst used by org.apache.lucene.search.suggest.fst
-
Classes in org.apache.lucene.util.fst used by org.apache.lucene.util.fstClassDescriptionAn FST
Outputs
implementation where each output is a sequence of bytes.Holds a single input (BytesRef) + output pair.An FSTOutputs
implementation where each output is a sequence of characters.Represents an finite state machine (FST), using a compact byte[] format.Represents a single arc.Reads bytes stored in an FST.Specifies allowed range of each int input label for this FST.Builds a minimal FST (maps an IntsRef term to an arbitrary output) from pre-sorted terms with outputs.Expert: holds a pending (seen but not yet serialized) arc.Fluent-style constructor for FSTFSTCompiler
.Reusable buffer for building nodes with fixed length arcs (binary search or direct addressing).Expert: holds a pending (seen but not yet serialized) Node.Can next() and advance() through the terms in an FSTAbstraction for reading/writing bytes necessary for FST.An FSTOutputs
implementation where each output is a sequence of ints.Holds a single input (IntsRef) + output pair.A null FSTOutputs
implementation; use this if you just want to build an FSA.Represents the outputs for an FST, providing the basic algebra required for building and traversing the FST.Holds a single pair of two outputs.An FSTOutputs
implementation where each output is a non-negative long value.Represents a path in TopNSearcher.Holds a single input (IntsRef) + output, returned byshortestPaths()
.Holds the results for a top N search usingUtil.TopNSearcher