| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declared (0) - 26 freq declare (1) - 25 freq declered (1) - 2 freq declaret (1) - 1 freq declares (1) - 5 freq declined (2) - 5 freq delayed (2) - 4 freq declarit (2) - 3 freq declarter (2) - 3 freq deceased (2) - 7 freq declar't (2) - 1 freq declird (2) - 1 freq deflated (2) - 9 freq declaimed (2) - 1 freq deplored (2) - 1 freq declaire (2) - 1 freq decayed (2) - 1 freq declaris (2) - 2 freq declarin (2) - 13 freq decored (2) - 5 freq feared (3) - 35 freq perpared (3) - 1 freq deilward (3) - 1 freq lectured (3) - 3 freq relayed (3) - 1 freq |
declared (0) - 26 freq declered (1) - 2 freq declird (2) - 1 freq declares (2) - 5 freq declare (2) - 25 freq declaret (2) - 1 freq declaris (3) - 2 freq declaimed (3) - 1 freq deplored (3) - 1 freq declarit (3) - 3 freq decored (3) - 5 freq declarin (3) - 13 freq declaire (3) - 1 freq declined (3) - 5 freq claried (4) - 1 freq declir (4) - 1 freq declaart (4) - 1 freq decreyed (4) - 1 freq cleared (4) - 56 freq decreed (4) - 9 freq decried (4) - 3 freq delayed (4) - 4 freq declarter (4) - 3 freq deflated (4) - 9 freq declar't (4) - 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 - 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.207722 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.367333 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.027468 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.037361 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.000909 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. |