| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| illtrickit (0) - 2 freq ill-trickit (1) - 14 freq ill-trickid (2) - 3 freq ill-trikkit (2) - 1 freq ill-likit (3) - 1 freq illluckit (3) - 1 freq ill-luckit (3) - 4 freq restrickit (3) - 5 freq illicit (3) - 5 freq trickit (3) - 26 freq instructit (4) - 1 freq distrackit (4) - 1 freq attrackit (4) - 1 freq hallyrackit (4) - 1 freq prickit (4) - 3 freq itricht (4) - 1 freq flickit (4) - 7 freq hallirackit (4) - 1 freq trackit (4) - 1 freq astrictit (4) - 4 freq fair-trickit (4) - 4 freq ill-treatit (4) - 1 freq trickie (4) - 5 freq ill-yokit (4) - 1 freq intristit (4) - 1 freq |
illtrickit (0) - 2 freq ill-trickit (2) - 14 freq ill-trikkit (4) - 1 freq ill-trickid (4) - 3 freq trickit (5) - 26 freq restrickit (5) - 5 freq ill-luckit (5) - 4 freq illluckit (5) - 1 freq haillerackit (6) - 2 freq hallirackit (6) - 1 freq trackit (6) - 1 freq truckit (6) - 1 freq tricket (6) - 9 freq distrackit (6) - 1 freq illicit (6) - 5 freq ill-likit (6) - 1 freq hallyrackit (6) - 1 freq weel-trickit (6) - 3 freq attrackit (6) - 1 freq ill-traetit (7) - 1 freq strick't (7) - 1 freq slickit (7) - 1 freq glaickit (7) - 2 freq fairtricket (7) - 1 freq electricity (7) - 28 freq |
SoundEx code - I436 ill-daers - 1 freq ill-trickit - 14 freq illtrickit - 2 freq ill-traetit - 1 freq ill-turn - 1 freq ill-trickid - 3 freq ill-thraan - 1 freq ill-trivven - 1 freq ill-treatit - 1 freq illeeterate - 2 freq ill-doers - 1 freq illiterate - 3 freq €˜illiteracy - 1 freq ill-trikkit - 1 freq ‘illiterate - 1 freq |
MetaPhone code - ILTRKT ill-trickit - 14 freq illtrickit - 2 freq ill-trickid - 3 freq ill-trikkit - 1 freq |
ILLTRICKIT |
| Time to execute Levenshtein function - 0.374034 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.704658 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.060444 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.038315 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.000910 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. |