| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edwardian (0) - 2 freq edwardians (1) - 3 freq guardian (3) - 13 freq edward's (3) - 1 freq edwards (3) - 5 freq edward (3) - 33 freq wardin (3) - 1 freq rewardin (3) - 2 freq bavarian (4) - 3 freq dwallin (4) - 15 freq eytalian (4) - 1 freq dwainan (4) - 1 freq daarin (4) - 1 freq cardigan (4) - 18 freq dartan (4) - 1 freq wurdin (4) - 1 freq expandin (4) - 9 freq carian (4) - 1 freq rewarding (4) - 1 freq cardiac (4) - 2 freq wadin (4) - 2 freq wardar (4) - 1 freq duardna (4) - 1 freq edwin (4) - 29 freq dwamlin (4) - 1 freq |
edwardian (0) - 2 freq edwardians (2) - 3 freq rewardin (4) - 2 freq edward (4) - 33 freq wardin (4) - 1 freq edwards (4) - 5 freq dirdan (5) - 1 freq wurdin (5) - 1 freq duardna (5) - 1 freq warden (5) - 6 freq wairdin (5) - 1 freq wordin (5) - 3 freq dirdin (5) - 10 freq wirdin (5) - 2 freq rewairdin (5) - 1 freq edward's (5) - 1 freq guardian (5) - 13 freq warman (6) - 2 freq dwam-an (6) - 1 freq jardin (6) - 2 freq dwarvies (6) - 5 freq boardin (6) - 7 freq waddin (6) - 96 freq waadin (6) - 1 freq dorian (6) - 2 freq |
SoundEx code - E363 edward - 33 freq edward's - 1 freq edwards - 5 freq eiderdoon - 2 freq edouard - 1 freq edwardian - 2 freq eidart - 1 freq edwardlongshanks - 5 freq edwardians - 3 freq eidritch - 1 freq edwart - 5 freq eddireader - 22 freq |
MetaPhone code - ETWRTN edwardian - 2 freq |
EDWARDIAN |
| Time to execute Levenshtein function - 0.361019 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.607207 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.027367 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.073129 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.003430 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. |