| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iplayer (0) - 5 freq player (1) - 116 freq i-player (1) - 2 freq played (2) - 255 freq playen (2) - 2 freq splayed (2) - 2 freq payer (2) - 1 freq pleyer (2) - 2 freq prayer (2) - 95 freq players (2) - 151 freq 'prayer (2) - 1 freq plater (2) - 1 freq layer (2) - 13 freq planer (2) - 1 freq imployed (3) - 2 freq spacer (3) - 2 freq splyter (3) - 2 freq planter (3) - 6 freq plate (3) - 180 freq layers (3) - 20 freq pleyers (3) - 7 freq plae (3) - 1 freq i'lower (3) - 1 freq employer (3) - 10 freq fayer (3) - 3 freq |
iplayer (0) - 5 freq player (1) - 116 freq pleyer (2) - 2 freq i-player (2) - 2 freq plater (3) - 1 freq pler (3) - 1 freq players (3) - 151 freq planer (3) - 1 freq layer (3) - 13 freq playen (3) - 2 freq prayer (3) - 95 freq pleyar (3) - 1 freq payer (3) - 1 freq played (3) - 255 freq place (4) - 1675 freq playit (4) - 4 freq palaver (4) - 10 freq plaes (4) - 1 freq plaet (4) - 5 freq plaen (4) - 1 freq playan (4) - 15 freq plover (4) - 9 freq paer (4) - 3 freq plyter (4) - 3 freq laayer (4) - 5 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.188695 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.317278 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.026837 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.036738 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.000813 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. |