| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| edward (0) - 33 freq edwards (1) - 5 freq edwart (1) - 5 freq edvard (1) - 2 freq howard (2) - 4 freq seward (2) - 2 freq edgar (2) - 10 freq toward (2) - 22 freq coward (2) - 12 freq redcard (2) - 1 freq edouard (2) - 1 freq atward (2) - 1 freq inward (2) - 7 freq mcward (2) - 3 freq ward (2) - 89 freq byward (2) - 2 freq reward (2) - 46 freq dwarf (2) - 3 freq onward (2) - 5 freq edward's (2) - 1 freq eard (2) - 1 freq upward (2) - 5 freq akward (2) - 3 freq award (2) - 59 freq weyward (2) - 1 freq |
edward (0) - 33 freq edwart (2) - 5 freq edvard (2) - 2 freq edwards (2) - 5 freq dwarf (3) - 3 freq reward (3) - 46 freq onward (3) - 5 freq award (3) - 59 freq weyward (3) - 1 freq byward (3) - 2 freq akward (3) - 3 freq upward (3) - 5 freq ward (3) - 89 freq coward (3) - 12 freq seward (3) - 2 freq howard (3) - 4 freq edouard (3) - 1 freq toward (3) - 22 freq atward (3) - 1 freq inward (3) - 7 freq aipward (4) - 1 freq dird (4) - 2 freq wayward (4) - 1 freq headword (4) - 1 freq wared (4) - 9 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 - ETWRT edward - 33 freq edwart - 5 freq |
EDWARD |
| Time to execute Levenshtein function - 0.338436 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.756758 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.027133 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.090700 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.000792 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. |