| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inner (0) - 44 freq sinner (1) - 10 freq winner (1) - 138 freq onner (1) - 3 freq hinner (1) - 46 freq cinner (1) - 1 freq tinner (1) - 1 freq innes (1) - 14 freq inver (1) - 1 freq binner (1) - 2 freq inter (1) - 2 freq linner (1) - 2 freq rinner (1) - 13 freq infer (1) - 1 freq dinner (1) - 130 freq unner (1) - 454 freq idder (2) - 286 freq inked (2) - 4 freq insert (2) - 3 freq miner (2) - 6 freq linger (2) - 5 freq winder (2) - 112 freq linne (2) - 1 freq intr (2) - 1 freq winnen (2) - 1 freq |
inner (0) - 44 freq onner (1) - 3 freq unner (1) - 454 freq dinner (2) - 130 freq rinner (2) - 13 freq infer (2) - 1 freq yonner (2) - 67 freq aonner (2) - 1 freq linner (2) - 2 freq innoyer (2) - 1 freq onnir (2) - 1 freq sinner (2) - 10 freq cinner (2) - 1 freq inter (2) - 2 freq winner (2) - 138 freq hinner (2) - 46 freq binner (2) - 2 freq inver (2) - 1 freq innes (2) - 14 freq tinner (2) - 1 freq inn' (3) - 2 freq insear (3) - 1 freq inower (3) - 10 freq inunner (3) - 1 freq inane (3) - 2 freq |
SoundEx code - I560 inower - 10 freq inner - 44 freq immer - 2 freq innywhaur - 1 freq i'winner - 1 freq i'mower - 1 freq i'mair - 1 freq ianuare - 1 freq innoyer - 1 freq imrie - 1 freq ianmaher - 1 freq |
MetaPhone code - INR inner - 44 freq ianuare - 1 freq |
INNER |
| Time to execute Levenshtein function - 0.370657 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.568186 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.029070 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.058858 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.000775 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. |