Packages

implicit object DamerauLevenshteinDistance extends LevenshteinDistanceImpl with DistanceAlgorithm[DamerauLevenshteinAlgorithm] with ScorableFromDistance[DamerauLevenshteinAlgorithm]

Implicit definition of damerau levenshtein distance for DamerauLevenshteinAlgorithm.

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DamerauLevenshteinDistance
  2. ScorableFromDistance
  3. ScoringAlgorithm
  4. DistanceAlgorithm
  5. LevenshteinDistanceImpl
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  6. def damerauLevenshtein[T](a: Array[T], b: Array[T]): Int
    Attributes
    protected
    Definition Classes
    LevenshteinDistanceImpl
  7. def distance(s1: String, s2: String): Int

    The score method takes two strings and returns the damerau levenshtein distance between them.

    The score method takes two strings and returns the damerau levenshtein distance between them.

    s1

    The 1st String.

    s2

    The 2nd String.

    returns

    Returns the damerau levenshtein distance between Strings s1 and s2.

    Definition Classes
    DamerauLevenshteinDistanceDistanceAlgorithm
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  11. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. def levenshtein[T](a: Array[T], b: Array[T]): Int
    Attributes
    protected
    Definition Classes
    LevenshteinDistanceImpl
  15. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  17. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  18. 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
    ScorableFromDistanceScoringAlgorithm
  19. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  20. def toString(): String
    Definition Classes
    AnyRef → Any
  21. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  22. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  23. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from LevenshteinDistanceImpl

Inherited from AnyRef

Inherited from Any

Ungrouped