| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declarative (0) - 1 freq declaration (2) - 69 freq decorative (2) - 2 freq declarations (3) - 3 freq declartin (3) - 1 freq declaration' (3) - 4 freq decoration (4) - 4 freq decoratit (4) - 7 freq comparative (4) - 2 freq clartie (4) - 4 freq relative (4) - 29 freq lucrative (4) - 2 freq derivative (4) - 3 freq deliberative (4) - 1 freq reclamation (4) - 5 freq recreative (4) - 1 freq deceptive (4) - 2 freq democratie (4) - 3 freq declaris (4) - 2 freq decorate (4) - 5 freq feigurative (4) - 2 freq declarter (4) - 3 freq decoratin (4) - 6 freq restorative (4) - 3 freq decoratin' (4) - 4 freq |
declarative (0) - 1 freq decorative (3) - 2 freq declaration (3) - 69 freq declartin (4) - 1 freq declarit (5) - 3 freq declaret (5) - 1 freq declarter (5) - 3 freq declaration' (5) - 4 freq declarations (5) - 3 freq secretive (6) - 1 freq declare (6) - 25 freq decoratin (6) - 6 freq declaire (6) - 1 freq declaart (6) - 1 freq decorate (6) - 5 freq decriptive (6) - 1 freq declaring (6) - 1 freq declarin (6) - 13 freq declar't (6) - 1 freq lucrative (6) - 2 freq clartie (6) - 4 freq declaris (6) - 2 freq decoratit (6) - 7 freq recreative (6) - 1 freq deliberative (6) - 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 - TKLRTF declarative - 1 freq |
DECLARATIVE |
| Time to execute Levenshtein function - 0.335643 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.469098 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.029190 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.042943 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.000847 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. |