Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
dispare (0) - 1 freq dispure (1) - 1 freq despare (1) - 2 freq spare (2) - 98 freq dispute (2) - 6 freq discard (2) - 1 freq dispone (2) - 2 freq disarm (2) - 1 freq disperse (2) - 3 freq dispose (2) - 2 freq dispeace (2) - 1 freq dismae (2) - 1 freq dissae (2) - 1 freq dispert (2) - 2 freq disnae (2) - 577 freq €œspare (2) - 1 freq disease (2) - 44 freq dispair (2) - 1 freq dispern (2) - 1 freq disparate (2) - 2 freq despair (3) - 58 freq impyre (3) - 2 freq kildare (3) - 2 freq sware (3) - 1 freq uisage (3) - 9 freq |
dispare (0) - 1 freq dispure (1) - 1 freq despare (1) - 2 freq dispair (2) - 1 freq despair (3) - 58 freq disparate (3) - 2 freq dispern (3) - 1 freq dispeace (3) - 1 freq dispert (3) - 2 freq disperse (3) - 3 freq spare (3) - 98 freq dispute (3) - 6 freq dispone (3) - 2 freq diaspora (3) - 28 freq dispose (3) - 2 freq despert (4) - 4 freq dispez (4) - 1 freq despirt (4) - 1 freq despyte (4) - 1 freq dipper (4) - 3 freq desire (4) - 50 freq despaired (4) - 2 freq despite (4) - 97 freq caspar (4) - 1 freq disagree (4) - 35 freq |
SoundEx code - D216 disappear - 44 freq disappeared - 54 freq disappearin - 31 freq disappears - 18 freq discovery - 21 freq desperate - 91 freq despair - 58 freq despairinly - 1 freq disappeart - 43 freq dayspring - 1 freq discovers - 2 freq disappearance - 7 freq discovert - 19 freq discover - 31 freq disperse - 3 freq desperation - 20 freq dispert - 2 freq dispraise - 3 freq discovered - 40 freq disparagin - 2 freq disproportionately - 1 freq diasporas - 1 freq disappear't - 1 freq despaired - 2 freq deceiver - 2 freq disappearit - 3 freq dispersit - 1 freq discuvert - 1 freq dessapeert - 1 freq deesapeert - 1 freq disapeeren - 1 freq decipher - 4 freq despert - 4 freq desperately - 29 freq desperados - 3 freq dispersed - 4 freq deceiverie - 2 freq despirt - 1 freq desperate-leukin - 1 freq disbarrin - 1 freq disparate - 2 freq disappeird - 3 freq disappruve - 1 freq desperadoes - 1 freq despertly - 1 freq discoverin - 3 freq discoverland - 1 freq diaspora - 28 freq desprait - 2 freq 'desprait - 1 freq discoveries - 4 freq 'discovered - 1 freq discovry - 1 freq disapproval - 2 freq dispure - 1 freq discoveran - 1 freq disparaged - 4 freq dispersal - 1 freq disportin - 1 freq diskivert - 3 freq doggy-friend - 1 freq desprit - 3 freq discoverin' - 1 freq discuivert - 1 freq disparity - 2 freq dispair - 1 freq disappeard - 1 freq despare - 2 freq dispare - 1 freq diskivvert - 1 freq dispern - 1 freq €˜disperse - 1 freq discoverie - 1 freq disperses - 1 freq dashboard - 3 freq disapprovin - 2 freq discovering - 1 freq dykefur - 1 freq dizappear - 1 freq disparately - 1 freq disproportionate - 1 freq dissappear - 1 freq dissapearin - 1 freq diskiveran - 1 freq dkgfrhy - 1 freq disapproving - 1 freq dougburnett - 2 freq dissappeared - 1 freq diskivered - 1 freq dcfrqtoea - 1 freq dajvr - 1 freq discoverkelpies - 5 freq ducksaberlady - 1 freq |
MetaPhone code - TSPR disappear - 44 freq despair - 58 freq tazper - 1 freq diaspora - 28 freq dispure - 1 freq dispair - 1 freq despare - 2 freq dispare - 1 freq dizappear - 1 freq dissappear - 1 freq |
DISPARE |
Time to execute Levenshtein function - 0.195907 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.355471 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.027470 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.037324 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.000858 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. |