Object

com.johnsnowlabs.nlp.annotators.spell.util

Utilities

Related Doc: package util

Permalink

object Utilities

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Utilities
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def computeConfidenceValue[A](list: List[A]): Double

    Permalink
  7. def computeHammingDistance(word1: String, word2: String): Long

    Permalink

    distance measure between two words

  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  12. def getFrequency(word: String, wordCount: Map[String, Long]): Long

    Permalink

    retrieve frequency

  13. def getRandomValueFromList[A](list: List[A]): Option[A]

    Permalink
  14. def getVowelSwaps(word: String, vowelSwapLimit: Int): List[String]

    Permalink

    flattens vowel possibilities

  15. def hashCode(): Int

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

    Permalink
    Definition Classes
    Any
  17. def levenshteinDistance(s1: String, s2: String): Int

    Permalink

    Computes Levenshtein distance : Metric of measuring difference between two sequences (edit distance) Source: https://rosettacode.org/wiki/Levenshtein_distance

  18. def limitDuplicates(duplicatesLimit: Int, text: String, overrideLimit: Option[Int] = None): String

    Permalink
  19. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  20. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. def reductions(word: String, reductionsLimit: Int): List[String]

    Permalink

    possible variations of the word by removing duplicate letters

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

    Permalink
    Definition Classes
    AnyRef
  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  25. def variants(targetWord: String): List[String]

    Permalink

    Possibilities analysis

  26. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped