Commit 93240df

authored

Merge pull request #63 from mqudsi/patch-1

Update Jaro-Winkler description in README thanks @mqudsi

2 parents 1924ab8 + f97b04b commit 93240dfCopy full SHA for 93240df

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -250,10 +250,10 @@ Will produce:`
`250`	`250`	```
`251`	`251`
`252`	`252`	`## Jaro-Winkler`
`253`		`-Jaro-Winkler is a string edit distance that was developed in the area of record linkage (duplicate detection) (Winkler, 1990). The Jaro–Winkler distance metric is designed and best suited for short strings such as person names, and to detect typos.`
	`253`	`+Jaro-Winkler is a string edit distance that was developed in the area of record linkage (duplicate detection) (Winkler, 1990). The Jaro–Winkler distance metric is designed and best suited for short strings such as person names, and to detect transposition typos.`
`254`	`254`
`255`	`255`	`Jaro-Winkler computes the similarity between 2 strings, and the returned value lies in the interval [0.0, 1.0].`
`256`		`-It is (roughly) a variation of Damerau-Levenshtein, where the substitution of 2 close characters is considered less important then the substitution of 2 characters that a far from each other.`
	`256`	`+It is (roughly) a variation of Damerau-Levenshtein, where the transposition of 2 close characters is considered less important than the transposition of 2 characters that are far from each other. Jaro-Winkler penalizes additions or substitutions that cannot be expressed as transpositions.`
`257`	`257`
`258`	`258`	`The distance is computed as 1 - Jaro-Winkler similarity.`
`259`	`259`

Comments

(0)