Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
joeedwyer (0) - 1 freq feeder (4) - 5 freq jooder (4) - 1 freq jeedged (4) - 3 freq weedower (4) - 2 freq heeder (4) - 1 freq roadwye (4) - 1 freq somewye (4) - 67 freq reeder (4) - 3 freq somewye- (4) - 1 freq peedier (4) - 7 freq needler (4) - 2 freq eesyer (4) - 1 freq jeedge (4) - 8 freq headwye (4) - 1 freq speeder (4) - 16 freq creeler (5) - 2 freq blender (5) - 3 freq dowter (5) - 8 freq heedge (5) - 1 freq 'ower (5) - 12 freq seerer (5) - 1 freq leyder (5) - 1 freq tower (5) - 46 freq onywyes (5) - 2 freq |
joeedwyer (0) - 1 freq jooder (5) - 1 freq weedower (5) - 2 freq jeedge (6) - 8 freq icedower (6) - 1 freq dewer (6) - 2 freq reedware (6) - 1 freq needler (6) - 2 freq headwear (6) - 1 freq dowier (6) - 1 freq headwye (6) - 1 freq heeder (6) - 1 freq peedier (6) - 7 freq roadwye (6) - 1 freq jeedged (6) - 3 freq feeder (6) - 5 freq dower (6) - 2 freq reeder (6) - 3 freq jewel (7) - 19 freq hedder (7) - 11 freq moder (7) - 2 freq sower (7) - 1 freq reider (7) - 5 freq janwar (7) - 2 freq jouker (7) - 2 freq |
SoundEx code - J360 jotter - 31 freq jittery - 3 freq jooder - 1 freq jethro - 2 freq jater - 1 freq joeedwyer - 1 freq |
MetaPhone code - JTYR joeedwyer - 1 freq |
JOEEDWYER |
Time to execute Levenshtein function - 0.329970 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 - 1.067524 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.091109 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.105349 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.001199 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. |