| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| declarin (0) - 10 freq declaring (1) - 1 freq declaris (1) - 2 freq declarit (1) - 3 freq declartin (1) - 1 freq declaret (2) - 1 freq declar't (2) - 1 freq declinin (2) - 1 freq delcarin (2) - 1 freq declared (2) - 26 freq deklain (2) - 1 freq delayin (2) - 3 freq declare (2) - 24 freq declaim (2) - 1 freq declin (2) - 1 freq declan (2) - 35 freq declares (2) - 5 freq decayin (2) - 1 freq recurrin (3) - 2 freq departin (3) - 7 freq wearin (3) - 190 freq blarin (3) - 13 freq ecrin (3) - 1 freq seafarin (3) - 1 freq decoratin (3) - 6 freq |
declarin (0) - 10 freq declarit (2) - 3 freq declartin (2) - 1 freq declaris (2) - 2 freq declaring (2) - 1 freq declare (3) - 24 freq declin (3) - 1 freq declan (3) - 35 freq declared (3) - 26 freq declares (3) - 5 freq declaret (3) - 1 freq declinin (3) - 1 freq declaart (4) - 1 freq mclaren (4) - 1 freq decline (4) - 20 freq clairin (4) - 1 freq clearin (4) - 27 freq declered (4) - 2 freq deklain (4) - 1 freq declaration (4) - 69 freq decern (4) - 2 freq declar't (4) - 1 freq declaim (4) - 1 freq delcarin (4) - 1 freq delayin (4) - 3 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 - TKLRN declarin - 10 freq |
DECLARIN |
| Time to execute Levenshtein function - 0.204213 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.342619 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.026870 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.036758 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.000872 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. |