Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
delusion (0) - 3 freq delusions (1) - 3 freq decision (2) - 87 freq dilution (2) - 2 freq desysion (2) - 1 freq allusion (2) - 2 freq derision (2) - 8 freq seclusion (2) - 1 freq nclusion (2) - 1 freq elision (2) - 2 freq deletion (2) - 1 freq illusion (2) - 10 freq delusional (2) - 4 freq deludin (2) - 1 freq reunion (3) - 6 freq dousin (3) - 1 freq delvin (3) - 3 freq demission (3) - 2 freq yeusin (3) - 1 freq deceesion (3) - 13 freq revulsion (3) - 3 freq devotion (3) - 21 freq eleision (3) - 1 freq elation (3) - 3 freq refusin (3) - 16 freq |
delusion (0) - 3 freq delusions (2) - 3 freq elision (3) - 2 freq deletion (3) - 1 freq illusion (3) - 10 freq delusional (3) - 4 freq deludin (3) - 1 freq dilution (3) - 2 freq derision (3) - 8 freq desysion (3) - 1 freq decision (3) - 87 freq allusion (3) - 2 freq dilutin (4) - 10 freq devosioun (4) - 1 freq division (4) - 17 freq dullion (4) - 1 freq delayin (4) - 3 freq dellin (4) - 5 freq deveesion (4) - 1 freq deusno (4) - 3 freq dereision (4) - 2 freq idolisin (4) - 1 freq deceision (4) - 5 freq emulsion (4) - 1 freq nelson (4) - 8 freq |
SoundEx code - D425 dayligaun - 1 freq dayligaun's - 1 freq dulesome - 18 freq delusions - 3 freq diligently - 5 freq dailygan - 9 freq dailigan - 1 freq delusion - 3 freq dailygaun - 20 freq dayligan - 2 freq doolsome - 4 freq dulesomely - 1 freq dollaghan - 1 freq dualism - 1 freq doulsome - 3 freq dilgent - 1 freq delusional - 4 freq dulesum - 1 freq “dailygan” - 1 freq diligence - 1 freq dulwichhamletfc - 2 freq dulwichhamfc - 1 freq |
MetaPhone code - TLXN delusion - 3 freq tulchan - 1 freq dilution - 2 freq €œdilution - 1 freq deletion - 1 freq tulachan - 1 freq |
DELUSION |
Time to execute Levenshtein function - 0.395429 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.829922 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.030592 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.040727 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.000905 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. |