LevenshteinDistance

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
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def damerauLevenshtein[T](a: Array[T], b: Array[T]): Int

Attributes
protected
Definition Classes
LevenshteinDistanceImpl
def distance(s1: String, s2: String): Int

The score method takes two strings and returns the levenshtein distance between them.
The score method takes two strings and returns the levenshtein distance between them.
s1
The 1st String.
s2
The 2nd String.
returns
Returns the levenshtein distance between Strings s1 and s2.

Definition Classes
LevenshteinDistance → DistanceAlgorithm
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
def levenshtein[T](a: Array[T], b: Array[T]): Int

Attributes
protected
Definition Classes
LevenshteinDistanceImpl
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def score(s1: String, s2: String): Double

The score method takes two strings and returns a fuzzy score (0-1) between them.
The score method takes two strings and returns a fuzzy score (0-1) between them. This mix-in implements the fuzzy score based on the distance. Score = (l - distance) / l, where l is the maximum length of strings s1 and s2.
s1
The 1st String.
s2
The 2nd String.
returns
Returns the fuzzy score between Strings s1 and s2.

Definition Classes
ScorableFromDistance → ScoringAlgorithm
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 DistanceDefinitions

implicit object LevenshteinDistance extends LevenshteinDistanceImpl with DistanceAlgorithm[LevenshteinAlgorithm] with ScorableFromDistance[LevenshteinAlgorithm]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def damerauLevenshtein[T](a: Array[T], b: Array[T]): Int

def distance(s1: String, s2: String): 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

def levenshtein[T](a: Array[T], b: Array[T]): Int

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def score(s1: String, s2: String): Double

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 ScorableFromDistance[LevenshteinAlgorithm]

Inherited from ScoringAlgorithm[LevenshteinAlgorithm]

Inherited from DistanceAlgorithm[LevenshteinAlgorithm]

Inherited from LevenshteinDistanceImpl

Inherited from AnyRef

Inherited from Any

Ungrouped