Class LuceneLevenshteinDistance
Damerau-Levenshtein (optimal string alignment) implemented in a consistent way as Lucene's FuzzyTermsEnum with the transpositions option enabled.
Notes:
- This metric treats full unicode codepoints as characters
- This metric scales raw edit distances into a floating point score based upon the shortest of the two terms
- Transpositions of two adjacent codepoints are treated as primitive edits.
- Edits are applied in parallel: for example, "ab" and "bca" have distance 3.
NOTE: this class is not particularly efficient. It is only intended for merging results from multiple DirectSpellCheckers.
Implements
Inherited Members
Namespace: Lucene.Net.Search.Spell
Assembly: Lucene.Net.Suggest.dll
Syntax
public sealed class LuceneLevenshteinDistance : IStringDistance
Constructors
LuceneLevenshteinDistance()
Creates a new comparer, mimicing the behavior of Lucene's internal edit distance.
Declaration
public LuceneLevenshteinDistance()
Methods
GetDistance(string, string)
Returns a float between 0 and 1 based on how similar the specified strings are to one another.
Returning a value of 1 means the specified strings are identical and 0 means the
string are maximally different.
Declaration
public float GetDistance(string target, string other)
Parameters
Type | Name | Description |
---|---|---|
string | target | |
string | other |
Returns
Type | Description |
---|---|
float | a float between 0 and 1 based on how similar the specified strings are to one another. |