| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declares (0) - 5 freq declaris (1) - 2 freq declare (1) - 24 freq declared (1) - 26 freq declaret (1) - 1 freq declarter (2) - 3 freq declered (2) - 2 freq declarit (2) - 3 freq declaire (2) - 1 freq declar't (2) - 1 freq declarin (2) - 10 freq declines (2) - 1 freq decades (2) - 47 freq mclaren (3) - 1 freq repares (3) - 1 freq replaces (3) - 1 freq peylades (3) - 1 freq tellaris (3) - 1 freq rteclare (3) - 1 freq flares (3) - 10 freq dentures (3) - 6 freq scares (3) - 5 freq dearest (3) - 19 freq dealers (3) - 10 freq belarus (3) - 3 freq |
declares (0) - 5 freq declaris (1) - 2 freq declaret (2) - 1 freq declared (2) - 26 freq declare (2) - 24 freq declarin (3) - 10 freq declaire (3) - 1 freq declines (3) - 1 freq declered (3) - 2 freq declarit (3) - 3 freq declird (4) - 1 freq deckers (4) - 2 freq declir (4) - 1 freq dealers (4) - 10 freq declarter (4) - 3 freq declaart (4) - 1 freq decals (4) - 1 freq declar't (4) - 1 freq dollars (4) - 6 freq decades (4) - 47 freq decrees (4) - 3 freq clare (5) - 12 freq cares (5) - 58 freq decored (5) - 5 freq pedlars (5) - 1 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 - TKLRS declares - 5 freq declaris - 2 freq |
DECLARES |
| Time to execute Levenshtein function - 0.324084 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.675586 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.027084 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.089932 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.000932 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. |