| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pleeps (0) - 2 freq pleepse (1) - 4 freq pleens (1) - 3 freq peeps (1) - 82 freq plees (1) - 6 freq sleeps (1) - 47 freq bleeps (1) - 1 freq pleep (1) - 3 freq pletts (2) - 1 freq preens (2) - 23 freq peeks (2) - 3 freq cheeps (2) - 2 freq plaess (2) - 18 freq bleers (2) - 1 freq peens (2) - 6 freq pleces (2) - 1 freq pleads (2) - 5 freq sleep' (2) - 6 freq weeps (2) - 1 freq pleese (2) - 1 freq pleepsit (2) - 1 freq lepps (2) - 1 freq bleep (2) - 2 freq sleep's (2) - 1 freq lee's (2) - 3 freq |
pleeps (0) - 2 freq pleepse (1) - 4 freq bleeps (2) - 1 freq sleeps (2) - 47 freq pleep (2) - 3 freq pleens (2) - 3 freq peeps (2) - 82 freq plees (2) - 6 freq plaens (3) - 1 freq pleepsin (3) - 1 freq pleas (3) - 9 freq pliers (3) - 2 freq pleats (3) - 4 freq pleepses (3) - 1 freq plaes (3) - 1 freq plens (3) - 17 freq phelps (3) - 23 freq pleeped (3) - 2 freq plumps (3) - 8 freq glaeps (3) - 2 freq plebes (3) - 1 freq peels (3) - 30 freq pleids (3) - 1 freq plets (3) - 1 freq pleuks (3) - 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 - PLPS playpiece - 5 freq pleepse - 4 freq pleeps - 2 freq |
PLEEPS |
| Time to execute Levenshtein function - 0.420015 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.074547 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.090230 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.105715 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.001049 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. |