StringWithSimilarity

Type Members

case class MatchResults(numberOfMatches: Int = 0, numberOfTransposes: Int = 0) extends Product with Serializable

Instead of making two seperate functions for matching and transposes (which would be terrible since you find the transpose while doing matching), I created this little class to hold the results of both.

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 determineMatchesAndTransposes(lhs: String, rhs: String): MatchResults

Find the all of the matching and transposed characters in two strings
Find the all of the matching and transposed characters in two strings
lhs
First String
rhs
Second String
returns
A Match Result with both the number of matches and number of transposed characters
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 jaroDistance(numMatches: Int, numTransposes: Int, lhsLength: Int, rhsLength: Int): Double

Determine the Jaro Distance.
Determine the Jaro Distance. Winkler stole some of Jaro's thunder by adding some more math onto his algorithm and getting equal parts credit! However, we still need Jaro's Distance to get the Jaro-Winkler Distance. Equation: 1/3 * ((|A| / m) + (|B| / m) + ((m - t) / m)) Where: |A| = length of first string |B| = length of second string m = number of matches t = number of transposes
numMatches
Number of matches
numTransposes
Number of transposes
lhsLength
Length of String one
rhsLength
Length of String two
returns
Jaro Distance
def matchingWindow(lhs: String, rhs: String): Int

Determine the maximum window size to use when looking for matches.
Determine the maximum window size to use when looking for matches. The window is basically a little less than the half the longest string's length. Equation: [ Max(A, B) / 2 ] -1
lhs
First String
rhs
Second String
returns
Max window size
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val prefixScalingFactor: Double
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
val trace: Trace[DefaultLogger]
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( ... )
def winklerCommonPrefix(lhs: String, rhs: String): Int

Find the Winkler Common Prefix of two strings.
Find the Winkler Common Prefix of two strings. In Layman's terms, find the number of character that match at the beginning of the two strings, with a maximum of 4.
lhs
First string
rhs
Second string
returns
Integer between 0 and 4 representing the number of matching characters at the beginning of both strings.

Related Docs: class StringWithSimilarity | package collection

object StringWithSimilarity

Type Members

case class MatchResults(numberOfMatches: Int = 0, numberOfTransposes: Int = 0) extends Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def determineMatchesAndTransposes(lhs: String, rhs: String): MatchResults

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 jaroDistance(numMatches: Int, numTransposes: Int, lhsLength: Int, rhsLength: Int): Double

def matchingWindow(lhs: String, rhs: String): Int

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val prefixScalingFactor: Double

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

def toString(): String

val trace: Trace[DefaultLogger]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def winklerCommonPrefix(lhs: String, rhs: String): Int

Inherited from AnyRef

Inherited from Any

Ungrouped