🎓 👾 My master's thesis
-
Updated
Jun 22, 2021 - HTML
🎓 👾 My master's thesis
NormNumSuM (normalised Number of Substring Movements) is a string comparison algorithm designed to be token order invariant.
Transform an array into another array or a string into another string using only basic transformations
A weighted levenshtein that takes typiness into consideration
An ML+NLP solution for linking misspelled titles with the true titles
A command line implementation of levenshtein distance of two strings written in rust
Levenshtein distance of two text files
Levenshtein distance implementation using a trie for fast string similarity searching
Kotlin multiplatform library offering various algorithms to measure string similarity and distance
Android library for string matching based on the JavaWuzzy Python algorithm. The algorithm uses Levenshtein distance to calculate similarity between strings.
Approximate pattern matching with Counting Filter on q-grams using SSE instructions (CF2)
A key/value store with JSON serialization
A parameterizable Damerau Levenshtein aligner in Java.
Fast implementation of the Levenshtein edit distance
The PHP package for calculate similarity and Levenshtein distance between strings
Investigating approaches for computing Edit Distance of 2 strings
transpose words
✅ UTF-8 supported Levenshtein PHP function. A Function that finds similarity distance between two strings.
Add a description, image, and links to the levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein topic, visit your repo's landing page and select "manage topics."