| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| phelps (0) - 23 freq philps (1) - 1 freq helps (1) - 56 freq help's (2) - 3 freq heips (2) - 2 freq 'help' (2) - 1 freq shelfs (2) - 8 freq whalps (2) - 3 freq heaps (2) - 13 freq shelts (2) - 13 freq helpt (2) - 9 freq sheps (2) - 1 freq philp (2) - 10 freq pleeps (2) - 2 freq cheeps (2) - 2 freq philp's (2) - 1 freq heeps (2) - 1 freq peels (2) - 30 freq help (2) - 1140 freq yelps (2) - 5 freq phils (2) - 1 freq heles (2) - 1 freq whelp (2) - 1 freq shells (2) - 23 freq whelks (2) - 14 freq |
phelps (0) - 23 freq philps (1) - 1 freq helps (2) - 56 freq phil's (3) - 4 freq pleeps (3) - 2 freq whalps (3) - 3 freq phipps (3) - 1 freq halps (3) - 1 freq phils (3) - 1 freq philp's (3) - 1 freq philp (3) - 10 freq €˜helps (4) - 1 freq phelps's (4) - 1 freq pselbs (4) - 10 freq peps (4) - 1 freq helms (4) - 2 freq 'help (4) - 19 freq hells (4) - 1 freq pheelip (4) - 2 freq philip's (4) - 2 freq phallus (4) - 2 freq upholds (4) - 1 freq philip (4) - 19 freq pheelip's (4) - 1 freq phyllis (4) - 1 freq |
SoundEx code - P412 philps - 1 freq pelvis - 2 freq plebs - 5 freq phelps - 23 freq phelps's - 1 freq playpiece - 5 freq philp's - 1 freq philip's - 2 freq pheelip's - 1 freq pleepse - 4 freq pleepsit - 1 freq philibeg - 1 freq playback - 1 freq pleepsin - 1 freq phÃlip's - 1 freq pleepses - 1 freq philiphaugh - 2 freq polly-bag - 1 freq plebes - 1 freq pleeps - 2 freq playoffs - 1 freq paulbsinclair - 1 freq plopj - 1 freq philboswellsnp - 2 freq plebiscite - 1 freq plefoaukf - 1 freq paulbiack - 1 freq philvickerytv - 1 freq |
MetaPhone code - FLPS philps - 1 freq flaps - 8 freq flips - 2 freq phelps - 23 freq flops - 6 freq philp's - 1 freq philip's - 2 freq pheelip's - 1 freq fleps - 1 freq phÃlip's - 1 freq €˜flopsy - 1 freq flopsy - 5 freq vulpis - 1 freq |
PHELPS |
| Time to execute Levenshtein function - 0.334039 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.859179 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.027469 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.099899 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.000891 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. |