| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declartin (0) - 1 freq declarin (1) - 13 freq clartin (2) - 4 freq declaris (2) - 2 freq declaring (2) - 1 freq declaration (2) - 69 freq departin (2) - 7 freq declarter (2) - 3 freq declarit (2) - 3 freq deflation (3) - 1 freq plartin (3) - 1 freq declare (3) - 25 freq depairtin (3) - 2 freq delayin (3) - 3 freq declaart (3) - 1 freq decoratin (3) - 6 freq clartie (3) - 4 freq dlastin (3) - 1 freq clarkin (3) - 1 freq dartin (3) - 5 freq clarten (3) - 1 freq debatin (3) - 3 freq declaret (3) - 1 freq dertin (3) - 1 freq deflectin (3) - 1 freq |
declartin (0) - 1 freq declarin (2) - 13 freq declaration (2) - 69 freq declarit (3) - 3 freq declarter (3) - 3 freq clartin (3) - 4 freq declarations (4) - 3 freq declaret (4) - 1 freq declaart (4) - 1 freq decoratin (4) - 6 freq declarative (4) - 1 freq declaring (4) - 1 freq declaration' (4) - 4 freq declaris (4) - 2 freq clarten (4) - 1 freq departin (4) - 7 freq decoration (5) - 4 freq declin (5) - 1 freq clautin (5) - 1 freq declan (5) - 35 freq scartin (5) - 18 freq desertin (5) - 2 freq clartit (5) - 15 freq dictatin (5) - 2 freq declared (5) - 26 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 - TKLRTN declartin - 1 freq |
DECLARTIN |
| Time to execute Levenshtein function - 0.250796 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.466380 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.029328 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.052621 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.001219 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. |