Efficient typo-tolerant search in 76 lines of code, with no dependencies.
searchsearch-enginefuzzy-searchtriefuzzy-matchinglevenshtein-distancelevenshtein-automatonlevenshtein-algorithmtrie-structuretypo-tolerant
-
Updated
Apr 6, 2024 - Python
Efficient typo-tolerant search in 76 lines of code, with no dependencies.
Shortens the paragraph depending on the given keywords using Levenshtein distance
Bot Dialog Flow Telegram untuk memenuhi Tugas Akhir Matakuliah Multi Channel Access
Find the best match for a token word with dictionary via min edit distance and levenshtein
Finding matching concepts in OCL MSF Source
Python scripts used to calculate 3 basic similarity measures, suitable for ad hoc information retrieval systems: Levenshtein Edit Distance, Jaccard, and a Term-Document matrix.
To associate your repository with the levenshtein-algorithm topic, visit your repo's landing page and select "manage topics."