The Wayback Machine - http://web.archive.org/web/20220411041609/https://github.com/topics/jaro-winkler
Skip to content
#

jaro-winkler

Here are 42 public repositories matching this topic...

📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

  • Updated Jan 31, 2022
  • Go

A fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..

  • Updated Jan 7, 2022
  • Scala
OlivierBinette
OlivierBinette commented Apr 1, 2022

Create a user example (see #2) which shows how StringCompare can be used to match business names.

That is, suppose we have a long list L of business names. Given another business name provided by a user, we want to be able to find the name in L which most closely matches it.

We can address this problem in a few steps:

  1. Identify an open dataset to work with for the case study.
  2. Iden
good first issue

Improve this page

Add a description, image, and links to the jaro-winkler topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the jaro-winkler topic, visit your repo's landing page and select "manage topics."

Learn more