| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declaration (0) - 69 freq declaration' (1) - 4 freq declarations (1) - 3 freq declartin (2) - 1 freq decoration (2) - 4 freq declarative (2) - 1 freq reclamation (2) - 5 freq desecration (3) - 2 freq delegation (3) - 7 freq deflation (3) - 1 freq exclamation (3) - 4 freq desperation (3) - 20 freq decoratin (3) - 6 freq acclamation (3) - 2 freq separation (3) - 5 freq denegration (3) - 1 freq declarin (3) - 10 freq decorations (3) - 12 freq relaxation (3) - 3 freq degradation (3) - 1 freq relegation (4) - 4 freq reparations (4) - 1 freq dedication (4) - 8 freq duration (4) - 5 freq declarter (4) - 3 freq |
declaration (0) - 69 freq declartin (2) - 1 freq declaration' (2) - 4 freq declarations (2) - 3 freq declarative (3) - 1 freq decoration (3) - 4 freq decoratin (4) - 6 freq declarin (4) - 10 freq reclamation (4) - 5 freq declarit (5) - 3 freq decorations (5) - 12 freq declaret (5) - 1 freq clartin (5) - 4 freq declarter (5) - 3 freq acceleration (5) - 1 freq denegration (5) - 1 freq delegation (5) - 7 freq deflation (5) - 1 freq exclamation (5) - 4 freq desperation (5) - 20 freq acclamation (5) - 2 freq desecration (5) - 2 freq dictation (6) - 1 freq clarion (6) - 1 freq secretion (6) - 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 - TKLRXN declaration - 69 freq declaration' - 4 freq |
DECLARATION |
| Time to execute Levenshtein function - 0.220048 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.371202 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.028078 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.038376 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.000895 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. |