Skip to content

About

Levenshtein Distance Matcher

Resources

Stars

0 stars

Watchers

1 watching

Forks

Latest commit

 

History

23 Commits

Folders and files

Repository files navigation

Levenshtein Distance Matcher

Description

This project is a text-matching tool that uses the Levenshtein distance algorithm to find the similarity between sets of strings. Built with Python and Streamlit, this tool allows users to upload CSV files or manually input strings for comparison. Users can also fine-tune the matching criteria using automatic or manual sliders.

Screenshot

Table of Contents

What is Levenshtein Distance?

Learn more about Levenshtein distance on Wikipedia

Installation

Clone the repository:

git clone https://github.com/dvonpasecky/fuzzy-matcher.git
cd fuzzy-matcher

Using pip

Install the required packages:

pip install -r requirements.txt

Usage

Upload CSV

  1. Choose "Upload CSV" from the sidebar.
  2. Upload your CSV file. The file should contain two columns of strings to be compared.

Manual Input

  1. Choose "Manual Input" from the sidebar.
  2. Manually enter strings in the columns that appear.

Filtering Method

Choose either the "Automatic Slider" or the "Manual Slider" to adjust the matching criteria.

Case Sensitivity

Toggle the "Case Sensitive" option on for case-sensitive matching.

Download CSV

Download the filtered results as a CSV file.

Contributing

Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.

License

MIT License

Hosted WebApp

You can access the hosted webapp here.

About

Levenshtein Distance Matcher

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Used by

Contributors

Languages