Class SlowFuzzyQuery
Implements the classic fuzzy search query. The similarity measurement is based on the Levenshtein (edit distance) algorithm.
Note that, unlike FuzzyQuery, this query will silently allow for a (possibly huge) number of edit distances in comparisons, and may be extremely slow (comparing every term in the index).
Inherited Members
Assembly: Lucene.Net.Sandbox.dll
Syntax
[Obsolete("Use FuzzyQuery instead.")]
[Serializable]
public class SlowFuzzyQuery : MultiTermQuery
Constructors
Name | Description |
---|---|
SlowFuzzyQuery(Term) | Calls SlowFuzzyQuery(Term, Single). |
SlowFuzzyQuery(Term, Single) | Calls SlowFuzzyQuery(Term, Single). |
SlowFuzzyQuery(Term, Single, Int32) | Calls SlowFuzzyQuery(Term, Single). |
SlowFuzzyQuery(Term, Single, Int32, Int32) | Create a new SlowFuzzyQuery that will match terms with a similarity
of at least |
Fields
Name | Description |
---|---|
defaultMaxExpansions | |
defaultMinSimilarity | |
defaultPrefixLength | |
m_term |
Properties
Name | Description |
---|---|
MinSimilarity | Gets the minimum similarity that is required for this query to match. Returns float value between 0.0 and 1.0. |
PrefixLength | Gets the non-fuzzy prefix length. This is the number of characters at the start of a term that must be identical (not fuzzy) to the query term if the query is to match that term. |
Term | Gets the pattern term. |
Methods
Name | Description |
---|---|
Equals(Object) | |
GetHashCode() | |
GetTermsEnum(Terms, AttributeSource) | |
ToString(String) |