| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| dayspring (0) - 1 freq aspiring (3) - 1 freq affspring (3) - 5 freq drawstring (3) - 1 freq offspring (3) - 5 freq gasping (3) - 2 freq 'spring (3) - 1 freq spring (3) - 263 freq asprin (3) - 1 freq bedspring (3) - 1 freq daring (3) - 1 freq dashing (3) - 4 freq dreeping (4) - 1 freq rassling (4) - 2 freq typing (4) - 4 freq hashing (4) - 2 freq passing (4) - 24 freq lapwing (4) - 1 freq dissing (4) - 1 freq springs (4) - 34 freq masking (4) - 1 freq aisling (4) - 1 freq raising (4) - 7 freq causing (4) - 8 freq daeing (4) - 2 freq |
dayspring (0) - 1 freq 'spring (4) - 1 freq aspiring (4) - 1 freq bedspring (4) - 1 freq spring (4) - 263 freq despising (5) - 1 freq sprang (5) - 18 freq sparing (5) - 2 freq inspiring (5) - 1 freq springy (5) - 6 freq sprung (5) - 22 freq dashing (5) - 4 freq offspring (5) - 5 freq affspring (5) - 5 freq asprin (5) - 1 freq gasping (5) - 2 freq daring (5) - 1 freq spreng (5) - 1 freq dipping (6) - 3 freq speiring (6) - 1 freq drying (6) - 6 freq spiering (6) - 1 freq dundering (6) - 2 freq aspirins (6) - 1 freq adoring (6) - 1 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 - TSPRNK dayspring - 1 freq |
DAYSPRING |
| Time to execute Levenshtein function - 0.389510 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.503872 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.032730 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.048936 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.001294 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. |