| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| icgardens (0) - 1 freq gardens (2) - 10 freq lgarden (3) - 1 freq gairdens (3) - 90 freq garden (3) - 67 freq garden' (3) - 2 freq wardens (3) - 2 freq garden's (3) - 1 freq gaerden (4) - 1 freq cadets (4) - 1 freq harden's (4) - 3 freq darkens (4) - 1 freq harden (4) - 21 freq braidens (4) - 2 freq carvins (4) - 4 freq invaders (4) - 8 freq carlene (4) - 1 freq warden (4) - 6 freq innards (4) - 4 freq screens (4) - 22 freq charhe's (4) - 1 freq clarke's (4) - 1 freq regarded (4) - 5 freq inwards (4) - 7 freq carpets (4) - 7 freq |
icgardens (0) - 1 freq gardens (3) - 10 freq gairdens (4) - 90 freq gairdins (5) - 2 freq gordons (5) - 16 freq wardens (5) - 2 freq garden's (5) - 1 freq lgarden (5) - 1 freq garden' (5) - 2 freq garden (5) - 67 freq gardies (6) - 1 freq gardener (6) - 2 freq garrins (6) - 1 freq gowdens (6) - 1 freq recoardeens (6) - 1 freq gairtens (6) - 2 freq burdens (6) - 7 freq girders (6) - 12 freq cardies (6) - 1 freq guardians (6) - 2 freq gairden's (6) - 3 freq cards (6) - 33 freq cravens (6) - 1 freq coards (6) - 1 freq gairden (6) - 500 freq |
SoundEx code - I263 iscariot - 5 freq i'wizard - 2 freq i'chords - 1 freq i'courtroom - 1 freq icgardens - 1 freq |
MetaPhone code - IKKRTNS icgardens - 1 freq |
ICGARDENS |
| Time to execute Levenshtein function - 0.248761 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.375468 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.028033 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.037722 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.001014 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. |