| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| playlist (0) - 7 freq playlists (1) - 1 freq playit (2) - 4 freq playleet (2) - 1 freq players (3) - 152 freq plaidit (3) - 5 freq playtime (3) - 24 freq bayliss (3) - 1 freq plampish (3) - 1 freq blaist (3) - 1 freq plaise (3) - 10 freq plaesis (3) - 1 freq alist (3) - 2 freq aflist (3) - 1 freq paist (3) - 1 freq plays (3) - 129 freq populist (3) - 6 freq payit (3) - 1 freq placit (3) - 1 freq plantit (3) - 36 freq blacklist (3) - 1 freq stylist (3) - 2 freq playin (3) - 347 freq laist (3) - 110 freq plist (3) - 1 freq |
playlist (0) - 7 freq playlists (2) - 1 freq playleet (3) - 1 freq populist (4) - 6 freq plist (4) - 1 freq polist (4) - 4 freq plaisit (4) - 1 freq loyalist (4) - 9 freq playit (4) - 4 freq papist (5) - 3 freq play's (5) - 2 freq sallust (5) - 2 freq pleasit (5) - 5 freq poalis (5) - 1 freq pallas (5) - 2 freq psalmist (5) - 2 freq plainit (5) - 1 freq plappit (5) - 5 freq pianist (5) - 1 freq tallest (5) - 6 freq pleast (5) - 6 freq ballast (5) - 5 freq palls (5) - 5 freq pallet (5) - 3 freq pullit (5) - 1 freq |
SoundEx code - P442 pulley-wheels - 1 freq playlist - 7 freq philologist - 1 freq paulwheelhouse - 5 freq playlists - 1 freq philology - 1 freq |
MetaPhone code - PLLST playlist - 7 freq |
PLAYLIST |
| Time to execute Levenshtein function - 0.380650 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.595439 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.028288 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.069151 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.001008 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. |