| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| disavou (0) - 1 freq disavous (1) - 1 freq disallou (2) - 1 freq disarm (3) - 1 freq disa- (3) - 1 freq disaise (3) - 2 freq wishfou (3) - 1 freq isaboy (3) - 1 freq divot (3) - 13 freq disno (3) - 35 freq avou (3) - 3 freq savoy (3) - 5 freq mistrou (3) - 1 freq savour (3) - 18 freq diamon (3) - 2 freq disable (3) - 1 freq dialog (3) - 1 freq disco (3) - 43 freq discos (3) - 6 freq disays (3) - 1 freq dismayed (4) - 6 freq div (4) - 506 freq pianos (4) - 1 freq distils (4) - 2 freq bishop (4) - 15 freq |
disavou (0) - 1 freq disavous (2) - 1 freq disays (4) - 1 freq savoy (4) - 5 freq disno (4) - 35 freq disaise (4) - 2 freq disallou (4) - 1 freq disco (4) - 43 freq disa- (4) - 1 freq davie (5) - 229 freq dvo (5) - 2 freq dismay (5) - 15 freq disnae (5) - 586 freq disney (5) - 19 freq dist (5) - 18 freq dosan (5) - 1 freq disny (5) - 5 freq desair (5) - 1 freq disoye (5) - 1 freq kosovo (5) - 4 freq disuk (5) - 1 freq dive (5) - 44 freq disolve (5) - 1 freq divi (5) - 2 freq drave (5) - 61 freq |
SoundEx code - D210 disobey - 5 freq dickiebow - 1 freq day-joab - 1 freq deceive - 7 freq dough-baw - 1 freq doughbaw - 1 freq dug-up - 1 freq digby - 3 freq disavou - 1 freq dookie-up - 1 freq dug-shape - 2 freq dqgeyv - 1 freq dzf - 1 freq doxievee - 1 freq deejaypb - 3 freq dqb - 1 freq djgfyh - 1 freq dtaqzbu - 1 freq dyjvb - 1 freq dsp - 1 freq dickybeau - 1 freq dogpoo - 1 freq dyqpo - 1 freq dczhhb - 2 freq dcibw - 1 freq decaf - 1 freq dxpa - 1 freq |
MetaPhone code - TSF tasefu' - 1 freq deceive - 7 freq tassiefu - 3 freq disavou - 1 freq dzf - 1 freq |
DISAVOU |
| Time to execute Levenshtein function - 0.219224 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.399841 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.031605 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.041744 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.000908 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. |