All Classes
-
All Classes Interface Summary Class Summary Enum Summary Class Description BufferingTermFreqIteratorWrapper This wrapper buffers incoming elements.BytesRefList A simple append only random-accessBytesRef
array that stores full copies of the appended bytes in aByteBlockPool
.BytesRefSorter CollectsBytesRef
and then allows one to iterate over their sorted order.Dictionary A simple interface representing a Dictionary.ExternalRefSorter Builds and iterates over sequences stored on disk.FileDictionary Dictionary represented by a text file.FSTCompletion Finite state automata based implementation of "autocomplete" functionality.FSTCompletion.Completion A single completion for a given key.FSTCompletionBuilder Finite state automata based implementation of "autocomplete" functionality.FSTCompletionLookup An adapter fromLookup
API toFSTCompletion
.FSTLookup Deprecated. UseFSTCompletionLookup
instead.HighFrequencyDictionary HighFrequencyDictionary: terms taken from the given field of a Lucene index, which appear in a number of documents above a given threshold.InMemorySorter AnBytesRefSorter
that keeps all the entries in memory.JaroWinklerDistance Similarity measure for short strings such as person names.JaspellLookup JaspellTernarySearchTrie Implementation of a Ternary Search Trie, a data structure for storingString
objects that combines the compact size of a binary search tree with the speed of a digital search trie, and is therefore ideal for practical use in sorting and searching data.LevensteinDistance Levenstein edit distance class.Lookup Simple Lookup interface forCharSequence
suggestions.Lookup.LookupPriorityQueue APriorityQueue
collecting a fixed size of high priorityLookup.LookupResult
Lookup.LookupResult Result of a lookup.LuceneDictionary Lucene Dictionary: terms taken from the given field of a Lucene index.NGramDistance N-Gram version of edit distance based on paper by Grzegorz Kondrak, "N-gram similarity and distance".PlainTextDictionary Dictionary represented by a text file.Sort On-disk sorting of byte arrays.Sort.BufferSize A bit more descriptive unit for constructors.Sort.ByteSequencesReader Utility class to read length-prefixed byte[] entries from an input.Sort.ByteSequencesWriter Utility class to emit length-prefixed byte[] entries to an output stream for sorting.SortedTermFreqIteratorWrapper This wrapper buffers incoming elements and makes sure they are sorted based on given comparator.SpellChecker Spell Checker class (Main class)
(initially inspired by the David Spencer code).StringDistance Interface for string distances.SuggestMode Set of strategies for suggesting related termsSuggestWord SuggestWord, used in suggestSimilar method in SpellChecker class.SuggestWordFrequencyComparator Frequency first, then score.SuggestWordQueue Sorts SuggestWord instancesSuggestWordScoreComparator Score first, then frequencyTermFreqIterator Interface for enumerating term,weight pairs.TermFreqIterator.TermFreqIteratorWrapper Wraps a BytesRefIterator as a TermFreqIterator, with all weights set to1
TernaryTreeNode The class creates a TST node.TSTAutocomplete TSTLookup UnsortedTermFreqIteratorWrapper This wrapper buffers the incoming elements and makes sure they are in random order.WFSTCompletionLookup Suggester based on a weighted FST: it first traverses the prefix, then walks the n shortest paths to retrieve top-ranked suggestions.