object Utilities
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Utilities
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
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[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
- def computeConfidenceValue[A](list: List[A]): Double
-
def
computeHammingDistance(word1: String, word2: String): Long
distance measure between two words
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getFrequency(word: String, wordCount: Map[String, Long]): Long
retrieve frequency
- def getRandomValueFromList[A](list: List[A]): Option[A]
-
def
getVowelSwaps(word: String, vowelSwapLimit: Int): List[String]
flattens vowel possibilities
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
levenshteinDistance(s1: String, s2: String): Int
Computes Levenshtein distance : Metric of measuring difference between two sequences (edit distance) Source: https://rosettacode.org/wiki/Levenshtein_distance
- def limitDuplicates(duplicatesLimit: Int, text: String, overrideLimit: Option[Int] = None): String
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
reductions(word: String, reductionsLimit: Int): List[String]
possible variations of the word by removing duplicate letters
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
variants(targetWord: String): List[String]
Possibilities analysis
-
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( ... ) @native()