| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declarations (0) - 3 freq declaration' (1) - 4 freq declaration (1) - 69 freq decorations (2) - 12 freq reclamation (3) - 5 freq decoration (3) - 4 freq reparations (3) - 1 freq declartin (3) - 1 freq declarative (3) - 1 freq exclamations (3) - 1 freq preparations (4) - 7 freq dilations (4) - 1 freq denotations (4) - 2 freq exclaimations (4) - 1 freq degradation (4) - 1 freq exclamation (4) - 4 freq proclamations (4) - 2 freq detonations (4) - 1 freq generations (4) - 112 freq decoratin' (4) - 4 freq decoratin (4) - 6 freq declaris (4) - 2 freq carnations (4) - 1 freq relaetions (4) - 2 freq acclamation (4) - 2 freq |
declarations (0) - 3 freq declaration (2) - 69 freq declaration' (2) - 4 freq decorations (3) - 12 freq declartin (4) - 1 freq exclamations (5) - 1 freq clartians (5) - 2 freq declarative (5) - 1 freq decoration (5) - 4 freq inclinations (6) - 1 freq celebrations (6) - 15 freq declaris (6) - 2 freq decoratin (6) - 6 freq dalmations (6) - 3 freq secretions (6) - 1 freq declarin (6) - 13 freq explorations (6) - 3 freq decoratin' (6) - 4 freq declaring (6) - 1 freq exclaimations (6) - 1 freq reclamation (6) - 5 freq reparations (6) - 1 freq dilations (6) - 1 freq distortions (7) - 2 freq relegations (7) - 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 - TKLRXNS declarations - 3 freq |
DECLARATIONS |
| Time to execute Levenshtein function - 0.229796 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.420293 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.032576 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.047134 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.000958 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. |