| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declared (0) - 26 freq declaret (1) - 1 freq declares (1) - 5 freq declered (1) - 2 freq declare (1) - 24 freq declaris (2) - 2 freq decayed (2) - 1 freq declarin (2) - 10 freq declined (2) - 5 freq declaire (2) - 1 freq deflated (2) - 9 freq declarter (2) - 3 freq delayed (2) - 4 freq declird (2) - 1 freq decored (2) - 5 freq deplored (2) - 1 freq declaimed (2) - 1 freq declarit (2) - 3 freq declar't (2) - 1 freq deceased (2) - 7 freq perpared (3) - 1 freq debased (3) - 1 freq declartin (3) - 1 freq claaed (3) - 2 freq dilated (3) - 1 freq |
declared (0) - 26 freq declered (1) - 2 freq declird (2) - 1 freq declare (2) - 24 freq declares (2) - 5 freq declaret (2) - 1 freq decored (3) - 5 freq declaimed (3) - 1 freq declarit (3) - 3 freq deplored (3) - 1 freq declaire (3) - 1 freq declaris (3) - 2 freq declined (3) - 5 freq declarin (3) - 10 freq declir (4) - 1 freq decreed (4) - 8 freq claried (4) - 1 freq decried (4) - 3 freq decreyed (4) - 1 freq declaart (4) - 1 freq cleared (4) - 56 freq delayed (4) - 4 freq deceased (4) - 7 freq declar't (4) - 1 freq deflated (4) - 9 freq |
SoundEx code - D246 declar't - 1 freq declare - 24 freq declaart - 1 freq declares - 5 freq declared - 26 freq declaration - 69 freq declird - 1 freq declir - 1 freq discoloured - 3 freq declarter - 3 freq declartin - 1 freq declarations - 3 freq declarin - 10 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 - TKLRT declar't - 1 freq declaart - 1 freq declared - 26 freq declird - 1 freq declered - 2 freq declarit - 3 freq declaret - 1 freq |
DECLARED |
| Time to execute Levenshtein function - 0.214169 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.385426 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.027484 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.036783 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.000818 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. |