| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kingrip (0) - 1 freq kinrik (2) - 37 freq kingrick (2) - 2 freq kinship (2) - 4 freq kingie (2) - 1 freq kintrie (2) - 37 freq kingriks (2) - 1 freq kingis (2) - 2 freq ingrid (2) - 17 freq kingship (2) - 8 freq ungrip (2) - 1 freq hingir (3) - 1 freq windrin (3) - 4 freq kinriks (3) - 2 freq gingin (3) - 11 freq kiggerin (3) - 1 freq hingmie (3) - 1 freq lingerie (3) - 1 freq hingie (3) - 1 freq king (3) - 824 freq cantrip (3) - 7 freq winrin (3) - 2 freq kinlin (3) - 2 freq kinnik (3) - 1 freq gingie (3) - 1 freq |
kingrip (0) - 1 freq ungrip (3) - 1 freq ingrid (4) - 17 freq kinrik (4) - 37 freq kongir (4) - 1 freq kingis (4) - 2 freq kingship (4) - 8 freq kingriks (4) - 1 freq kingrick (4) - 2 freq kingie (4) - 1 freq kinship (4) - 4 freq kintrie (4) - 37 freq kingly (5) - 1 freq kintras (5) - 57 freq fingrs (5) - 1 freq kingdom (5) - 69 freq kintra' (5) - 1 freq kindred (5) - 4 freq kintrae (5) - 46 freq fingirin (5) - 1 freq kinnoir (5) - 3 freq kings (5) - 92 freq grip (5) - 123 freq lingerin (5) - 12 freq fingir (5) - 55 freq |
SoundEx code - K526 knickers - 42 freq knackered - 16 freq knacker - 4 freq knackerin - 1 freq knackerit - 1 freq kingriks - 1 freq knockroe - 1 freq knocker - 2 freq knicker - 2 freq knockers - 2 freq kincardine - 5 freq kangaroos - 1 freq kangaroo - 2 freq kïngrick - 5 freq keingryke - 5 freq kincorth - 2 freq kangrick - 6 freq kongir - 1 freq kingrip - 1 freq kincardineshire - 1 freq knackers - 2 freq kin-carers - 1 freq €œkeingryke - 1 freq knackeroso - 1 freq kinkardine - 1 freq konservative - 1 freq knackert - 1 freq konzrbzyuw - 1 freq kingrick - 2 freq kimmycricket - 1 freq kennacraig - 1 freq kanachrine - 1 freq kinochers - 2 freq kymqr - 1 freq kmcharg - 13 freq kennygrainger - 1 freq |
MetaPhone code - KNKRP cannae-creep - 1 freq kingrip - 1 freq |
KINGRIP |
| Time to execute Levenshtein function - 0.291880 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.533505 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.062786 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.037355 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.000867 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. |