| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declaimed (0) - 1 freq reclaimed (1) - 3 freq exclaimed (2) - 36 freq declaire (2) - 1 freq declined (2) - 5 freq declaim (2) - 1 freq 'claimed (2) - 1 freq claimed (2) - 35 freq declared (2) - 26 freq delayed (3) - 4 freq declaret (3) - 1 freq decanted (3) - 1 freq decline (3) - 21 freq deflated (3) - 9 freq relaided (3) - 1 freq despaired (3) - 2 freq detailed (3) - 14 freq declarter (3) - 3 freq declird (3) - 1 freq clammed (3) - 1 freq declines (3) - 2 freq sclimed (3) - 2 freq reclaimt (3) - 1 freq declinet (3) - 1 freq exclaimet (3) - 1 freq |
declaimed (0) - 1 freq reclaimed (2) - 3 freq 'claimed (3) - 1 freq declaim (3) - 1 freq claimed (3) - 35 freq declared (3) - 26 freq exclaimed (3) - 36 freq declined (3) - 5 freq declered (4) - 2 freq becalmed (4) - 2 freq sclimed (4) - 2 freq clamed (4) - 2 freq declaire (4) - 1 freq declird (4) - 1 freq decided (5) - 210 freq reclaimin (5) - 3 freq reclaim (5) - 7 freq deceased (5) - 7 freq defamed (5) - 1 freq deceived (5) - 2 freq decried (5) - 3 freq declare (5) - 25 freq claiked (5) - 1 freq decayed (5) - 1 freq proclaimed (5) - 17 freq |
SoundEx code - D245 decline - 21 freq declined - 5 freq declaimed - 1 freq disclaimers - 1 freq dazzling - 2 freq declines - 2 freq declan - 35 freq declaim - 1 freq dakklin - 1 freq daizzlement - 1 freq daghlian's - 1 freq daizzlin - 1 freq duachlin - 1 freq deuklins - 2 freq declinet - 1 freq declint - 1 freq declinin - 1 freq declin - 1 freq deklain - 1 freq declining - 2 freq declang - 1 freq dougalmcshoogle - 3 freq ducklings - 1 freq declanokane - 9 freq declanq - 5 freq |
MetaPhone code - TKLMT declaimed - 1 freq |
DECLAIMED |
| Time to execute Levenshtein function - 0.317151 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.442725 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.028353 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.037545 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.000900 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. |