tfidf-matcher
A small package that enables super-fast TF-IDF based string matching.
Decision gist · record as of 2026-08-14
Yes, but with caution. Install if you need fast fuzzy matching on large datasets and can tolerate the risk of an abandoned package. The MIT license and low dependency friction are favorable, and it has no known vulnerabilities. However, the last update was in April 2023, there is no active maintenance, and testing is limited to a single use case. Use only if you can verify it works for your specific data and are willing to maintain a fork if needed.AI-flagged interpretation of the facts on this page — verify before relying
Before you install
- Requires Python >=3.5; scikit-learn and pandas must be installed.
- The package is abandoned and untested at scale beyond the author's single use case (640 company names vs.
- >700,000 corpus).
License · maintenance · safety
permissive license (permissive) — Licensed under MIT (permissive), so you can use, modify, and distribute it freely with minimal restrictions. No commercial or proprietary concerns.
last release 2023-04-06 (1226 days) · last repo commit 2023-04-06 · 56 stars
0 known vulnerabilities (OSV.dev, 2026-08-14) · 84,264 downloads/mo, #14,011 on PyPI
Alternatives
Verify before relying
pip install tfidf-matcher
import tfidf_matcher as tm
original = ["apple inc", "microsoft corp"]
lookup = ["Apple Inc.", "Microsoft Corporation", "Amazon.com"]
results = tm.matcher(original, lookup, k_matches=1, ngram_length=2)- Stability and correctness on datasets beyond the author's tested scenario (640 items matched against >700,000) is not documented.
- Whether the package works correctly with current versions of scikit-learn and pandas, given the last update was 2023-04-06.
- Memory and runtime performance characteristics on very large datasets compared to alternatives.
What it is and what it does
tfidf_matcher solves the scalability problem of fuzzy string matching by using TF-IDF vectorization and K-Nearest Neighbours instead of pairwise comparison. It takes two lists—an original list you want to find matches for and a lookup list to search within—and returns a pandas DataFrame with the k closest matches from the lookup list for each item in the original, along with match scores. The approach trades off some matching quality for speed, making it practical for matching hundreds or thousands of items against large reference corpora.
The package depends on scikit-learn for vectorization and KNN, and pandas for result formatting. It exposes two main functions: ngrams() for generating n-grams and matcher() for the core matching operation. The author tested it successfully on 640 company names matched against a corpus of over 700,000 names, but explicitly notes the package is not well-tested beyond that use case and may produce unstable results in other scenarios.
Use it for
- Deduplicate or link company names across two large databases without manual review.
- Match product names from a supplier catalog to your internal inventory.
- Find similar addresses or customer names across datasets for record linkage.
- Bulk fuzzy search of user-provided strings against a large reference corpus.
- Identify near-duplicate entries in a dataset before data cleaning.
Worth the install?
AI-flagged interpretation of the facts on this page. Verify before relying on it.
Yes, but with caution.
Install if you need fast fuzzy matching on large datasets and can tolerate the risk of an abandoned package. The MIT license and low dependency friction are favorable, and it has no known vulnerabilities. However, the last update was in April 2023, there is no active maintenance, and testing is limited to a single use case. Use only if you can verify it works for your specific data and are willing to maintain a fork if needed.
Install
tfidf-matcher on PyPI
Before you install
Low friction to install with only scikit-learn and pandas as dependencies. However, the package is abandoned—last commit was 2023-04-06 and no updates have been made since. The repository remains public but unmaintained, so you should expect no bug fixes or compatibility updates for future Python or dependency versions.
Requires Python >=3.5; scikit-learn and pandas must be installed. The package is abandoned and untested at scale beyond the author's single use case (640 company names vs. >700,000 corpus).
License in practice
Licensed under MIT (permissive), so you can use, modify, and distribute it freely with minimal restrictions. No commercial or proprietary concerns.
Quickstart
pip install tfidf-matcher
import tfidf_matcher as tm
original = ["apple inc", "microsoft corp"]
lookup = ["Apple Inc.", "Microsoft Corporation", "Amazon.com"]
results = tm.matcher(original, lookup, k_matches=1, ngram_length=2)Verify before relying
- Stability and correctness on datasets beyond the author's tested scenario (640 items matched against >700,000) is not documented.
- Whether the package works correctly with current versions of scikit-learn and pandas, given the last update was 2023-04-06.
- Memory and runtime performance characteristics on very large datasets compared to alternatives.
Package facts
| License | permissive license permissive |
| Python support | Supports the current Python release >=3.5 |
| Install friction | Low. Pure-Python wheel |
| Runtime dependencies | 2 packagesscikit-learnpandas |
| Maintenance | Abandoned 1,226 days since the last release |
| Last repo commit | |
| First released | |
| Downloads | 84,264 / month, #14,011 on PyPI 30-day window, as of 2026-08-14 |
| Known vulnerabilities | None known OSV.dev, checked 2026-08-14 |
| Classifiers | License :: OSI Approved :: MIT LicenseOperating System :: OS IndependentProgramming Language :: Python :: 3 |
Evidence: tfidf_matcher-0.3.0-py3-none-any.whl
Tags
Let your AI agent find packages like this
Example. Real query, live index.
You found this page by searching. An agent finds it by wishing: SkillFed indexes 14,416 PyPI packages by what they can do, searchable in plain language.
wish › “fuzzy string matching large scale”
- tfidf-matcherPerforms fast fuzzy string matching on large datasets using TF-IDF…
- pyjarowinklerComputes Jaro and Jaro-Winkler similarity and distance scores between…
- jarowinklerCalculates Jaro and Jaro-Winkler string similarity scores, optimized…
Give your agent the search over MCP, or paste the wish link into any chat.
More Information Analysis packages
A drop-in replacement for Python's standard `re` module that adds advanced regex features like nested sets, fuzzy matching, lookaround in conditionals, and full Unicode case-folding while maintaining backward compatibility.
pyarrow provides Python bindings to Apache Arrow's C++ libraries for efficient columnar data processing, serialization, and interoperability with pandas, NumPy, and other Python ecosystem tools.
NetworkX provides data structures and algorithms for creating, analyzing, and manipulating graphs and networks, supporting everything from simple undirected graphs to complex directed and weighted networks.
Connects Python applications to Snowflake data warehouses using the DB API 2.0 specification, enabling SQL queries, data transfers, and warehouse operations.
ContourPy calculates contours of 2D quadrilateral grids using C++11 algorithms wrapped in Python, offering serial and multithreaded implementations without requiring Matplotlib as a dependency.
Snowpark Python provides APIs to query and process data directly in Snowflake without moving data to your local system, with support for both native Snowpark and pandas-compatible interfaces.
Install it if you use Snowflake and want to process data without moving it to your application layer.
See also string-grouper · fuzzyset2 · multiregex · ngram · fuzzysearch · pfzy · textsearch · strsimpy · fuzzywuzzy · linkify-it-py