| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declarationofarbroath (0) - 1 freq declaration (10) - 69 freq declaration' (10) - 4 freq declarations (10) - 3 freq abairnabroad (12) - 1 freq decoration (12) - 4 freq declarative (12) - 1 freq reclamation (12) - 5 freq declartin (12) - 1 freq decorations (12) - 12 freq declarin (13) - 13 freq recreational (13) - 7 freq carboniferous (13) - 1 freq delegation's (13) - 1 freq carltonkirby (13) - 2 freq dictionary' (13) - 5 freq desecration (13) - 2 freq eweraskinforthat (13) - 1 freq arbroath (13) - 16 freq martingirth (13) - 1 freq declaring (13) - 1 freq derivational (13) - 6 freq educationscot (13) - 33 freq scarredparrot (13) - 1 freq declanokane (13) - 9 freq |
declarationofarbroath (0) - 1 freq declarations (16) - 3 freq declaration (16) - 69 freq declaration' (16) - 4 freq declartin (18) - 1 freq educationreddit (19) - 1 freq chuckinbroth (19) - 1 freq martingirth (19) - 1 freq bartoncreeth (19) - 2 freq declarter (19) - 3 freq clusterbourach (19) - 1 freq education-reform (19) - 1 freq declarative (19) - 1 freq datartanspartan (19) - 3 freq decorations (19) - 12 freq decoration (19) - 4 freq dictionaries' (20) - 1 freq decoratin (20) - 6 freq chrisdarroch (20) - 1 freq dictionaries (20) - 40 freq decoratin' (20) - 4 freq declaart (20) - 1 freq decorator (20) - 1 freq clean-forgot (20) - 1 freq rabindranath (20) - 1 freq |
SoundEx code - D246 declar't - 1 freq declare - 25 freq declaart - 1 freq declares - 5 freq declared - 26 freq declaration - 69 freq declarin - 13 freq declird - 1 freq declir - 1 freq discoloured - 3 freq declarter - 3 freq declartin - 1 freq declarations - 3 freq declaration' - 4 freq declered - 2 freq declarative - 1 freq declarit - 3 freq declaris - 2 freq dazler - 2 freq dazzler - 2 freq declaret - 1 freq declaire - 1 freq declarationofarbroath - 1 freq declaring - 1 freq |
MetaPhone code - TKLRXNFR |
DECLARATIONOFARBROATH |
| Time to execute Levenshtein function - 0.244310 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.416837 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.027661 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.036780 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.000860 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. |