NGramDistance

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

Definition Classes
NGramDistance → WeightedDistanceAlgorithm
def distance(s1: String, s2: String, n: Int): Int

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

Definition Classes
NGramDistance → WeightedDistanceAlgorithm
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] )
def foldNGram[T, R](s1: Array[T], s2: Array[T], n: Int = 1)(err: ⇒ R)(success: (Int) ⇒ R)(fuzzy: (List[List[T]], List[List[T]], Int) ⇒ R): R

Attributes
protected
Definition Classes
NGramTokenizer
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def intersectLength[T]: (List[List[T]], List[List[T]]) ⇒ Int

Attributes
protected
Definition Classes
NGramTokenizer
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def nGram[T](s1: Array[T], s2: Array[T], n: Int = 1): Double

Attributes
protected
Definition Classes
NGramImpl
def nGramDist[T](s1: Array[T], s2: Array[T], n: Int = 1): Int

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

Definition Classes
AnyRef
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
def tokenizeNGram[T](a: Array[T], n: Int): List[List[T]]

Attributes
protected
Definition Classes
NGramTokenizer
def tokensAsJava[T](a: Array[T], n: Int): List[List[T]]

Attributes
protected
Definition Classes
NGramTokenizer
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 NGramDistance extends NGramImpl with WeightedDistanceAlgorithm[NGramAlgorithm, Int]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def distance(s1: String, s2: String): Int

def distance(s1: String, s2: String, n: Int): Int

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def foldNGram[T, R](s1: Array[T], s2: Array[T], n: Int = 1)(err: ⇒ R)(success: (Int) ⇒ R)(fuzzy: (List[List[T]], List[List[T]], Int) ⇒ R): R

final def getClass(): Class[_]

def hashCode(): Int

def intersectLength[T]: (List[List[T]], List[List[T]]) ⇒ Int

final def isInstanceOf[T0]: Boolean

def nGram[T](s1: Array[T], s2: Array[T], n: Int = 1): Double

def nGramDist[T](s1: Array[T], s2: Array[T], n: Int = 1): Int

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

def tokenizeNGram[T](a: Array[T], n: Int): List[List[T]]

def tokensAsJava[T](a: Array[T], n: Int): List[List[T]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from WeightedDistanceAlgorithm[NGramAlgorithm, Int]

Inherited from NGramImpl

Inherited from NGramTokenizer

Inherited from AnyRef

Inherited from Any

Ungrouped