| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ivy-like (0) - 1 freq ivy-leaf (3) - 1 freq wice-like (3) - 3 freq saw-like (3) - 1 freq pey-line (3) - 1 freq wirm-like (3) - 1 freq rat-like (3) - 1 freq by-line (3) - 3 freq cat-like (3) - 1 freq sic-like (3) - 11 freq nippy-like (3) - 3 freq odd-like (3) - 1 freq gay-lik (3) - 1 freq och-like (3) - 1 freq awfy-like (3) - 1 freq wise-like (3) - 3 freq cosy-like (3) - 2 freq -like (3) - 1 freq firm-like (3) - 1 freq body-like (3) - 1 freq bird-like (3) - 1 freq kin-like (3) - 1 freq jimp-like (3) - 1 freq waa-like (3) - 1 freq ill-lik (3) - 1 freq |
ivy-like (0) - 1 freq waa-like (4) - 1 freq -like (4) - 1 freq gay-lik (4) - 1 freq ivy-leaf (4) - 1 freq wise-like (5) - 3 freq awfy-like (5) - 1 freq cosy-like (5) - 2 freq kin-like (5) - 1 freq sae-lik (5) - 2 freq sik-like (5) - 2 freq ill-lik (5) - 1 freq och-like (5) - 1 freq body-like (5) - 1 freq saw-like (5) - 1 freq odd-like (5) - 1 freq rat-like (5) - 1 freq pey-line (5) - 1 freq by-line (5) - 3 freq sic-like (5) - 11 freq cat-like (5) - 1 freq wice-like (5) - 3 freq €™like (6) - 2 freq samelike (6) - 2 freq quiet-like (6) - 5 freq |
SoundEx code - I142 ivy-like - 1 freq i'blues - 1 freq i'billies - 1 freq i'flicks - 1 freq i'place - 2 freq i'feels - 1 freq i'polis - 1 freq i'village - 1 freq i'placie - 1 freq ivulxy - 1 freq ipals - 1 freq |
MetaPhone code - IFLK ivy-like - 1 freq |
IVY-LIKE |
| Time to execute Levenshtein function - 0.201405 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.388876 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.030164 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.038019 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000963 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |