Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
disappear (0) - 48 freq dizappear (1) - 1 freq disappeard (1) - 1 freq disappeart (1) - 43 freq dissappear (1) - 1 freq disappears (1) - 19 freq disappear't (2) - 1 freq disappeared (2) - 57 freq disappeird (2) - 3 freq disappearit (2) - 3 freq disappearin (2) - 31 freq reappear (3) - 6 freq appear (3) - 98 freq dapper (3) - 4 freq disaster (3) - 45 freq disappynt (3) - 5 freq dissappeared (3) - 1 freq drapper (3) - 1 freq dipper (3) - 3 freq re-appear (3) - 1 freq appar (4) - 2 freq rapper (4) - 4 freq disposer (4) - 1 freq diaster (4) - 1 freq disabled (4) - 7 freq |
disappear (0) - 48 freq disappears (2) - 19 freq dissappear (2) - 1 freq disappeart (2) - 43 freq dizappear (2) - 1 freq disappeard (2) - 1 freq disappearit (3) - 3 freq disappeird (3) - 3 freq disappearin (3) - 31 freq disappeared (3) - 57 freq drapper (4) - 1 freq dapper (4) - 4 freq dipper (4) - 3 freq disappear't (4) - 1 freq sipper (5) - 6 freq supper (5) - 173 freq disappruve (5) - 1 freq disposer (5) - 1 freq dispair (5) - 1 freq dispare (5) - 1 freq disrepair (5) - 3 freq dissappeared (5) - 1 freq appear (5) - 98 freq reappear (5) - 6 freq disappynt (5) - 5 freq |
SoundEx code - D216 disappear - 48 freq disappeared - 57 freq disappearin - 31 freq disappears - 19 freq discovery - 22 freq desperate - 94 freq despair - 58 freq despairinly - 1 freq disappeart - 43 freq dayspring - 1 freq discovers - 2 freq disappearance - 7 freq discovert - 19 freq discover - 32 freq disperse - 3 freq desperation - 20 freq dispert - 2 freq dispraise - 3 freq discovered - 43 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 desperately - 31 freq disapproval - 3 freq despert - 4 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 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 - 48 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 |
DISAPPEAR |
Time to execute Levenshtein function - 0.197621 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.363826 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.027878 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.038880 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.000865 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. |