| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iplayer (0) - 5 freq player (1) - 131 freq i-player (1) - 2 freq pleyer (2) - 2 freq 'prayer (2) - 1 freq played (2) - 256 freq payer (2) - 1 freq prayer (2) - 96 freq plater (2) - 1 freq playen (2) - 2 freq players (2) - 152 freq planer (2) - 1 freq layer (2) - 15 freq splayed (2) - 2 freq 'play (3) - 1 freq flamer (3) - 1 freq place (3) - 1701 freq paper (3) - 526 freq play's (3) - 2 freq playeen (3) - 1 freq lawyer (3) - 33 freq layert (3) - 2 freq later (3) - 554 freq prayed (3) - 42 freq playit (3) - 4 freq |
iplayer (0) - 5 freq player (1) - 131 freq pleyer (2) - 2 freq i-player (2) - 2 freq players (3) - 152 freq planer (3) - 1 freq playen (3) - 2 freq pleyar (3) - 1 freq pler (3) - 1 freq layer (3) - 15 freq played (3) - 256 freq plater (3) - 1 freq payer (3) - 1 freq prayer (3) - 96 freq plane (4) - 68 freq plae (4) - 1 freq play (4) - 748 freq playyy (4) - 1 freq plays (4) - 129 freq aplate (4) - 1 freq claer (4) - 22 freq paer (4) - 3 freq iper (4) - 7 freq laer (4) - 1 freq playd (4) - 2 freq |
SoundEx code - I146 i'fleer - 3 freq i'flair - 2 freq i'floories - 2 freq iplayer - 5 freq i-player - 2 freq iblrg - 1 freq |
MetaPhone code - IPLYR iplayer - 5 freq i-player - 2 freq |
IPLAYER |
| Time to execute Levenshtein function - 0.184487 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.318125 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.027577 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.037220 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.000901 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. |