LevenshteinDistance

Levenshtein com.nexthink.utils.parsing.distance is the classical string difference metric. It is the minimum number of single-character edits (i.e. insertions, deletions or substitutions) required to change one word into another. It is typically implemented with a dynamic programming approach.

See https://en.wikipedia.org/wiki/Levenshtein_distance

Linear Supertypes

EditDistance[Char], AnyRef, Any

Type Members

case class EditWeights(insertion: WeightComputation, deletion: WeightComputation, substitution: WeightComputation, maxPossibleWeight: Int) extends Product with Serializable

Definition Classes
EditDistance
type WeightComputation = (Char, Char) ⇒ Int

Definition Classes
EditDistance

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
val LevenshteinWeights: EditWeights
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def constantWeightOfOne(a: Char, b: Char): Int
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def normalizedEditDistance(a: Seq[Char], b: Seq[Char], weights: EditWeights): Double

Attributes
protected
Definition Classes
EditDistance
def normalizedLevenshteinDistance(a: String, b: String): Double
def normalizedLevenshteinSimilarity(a: String, b: String): Double
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package distance

object LevenshteinDistance extends EditDistance[Char]

Type Members

case class EditWeights(insertion: WeightComputation, deletion: WeightComputation, substitution: WeightComputation, maxPossibleWeight: Int) extends Product with Serializable

type WeightComputation = (Char, Char) ⇒ Int

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val LevenshteinWeights: EditWeights

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def constantWeightOfOne(a: Char, b: Char): Int

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def normalizedEditDistance(a: Seq[Char], b: Seq[Char], weights: EditWeights): Double

def normalizedLevenshteinDistance(a: String, b: String): Double

def normalizedLevenshteinSimilarity(a: String, b: String): Double

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from EditDistance[Char]

Inherited from AnyRef

Inherited from Any

Ungrouped