Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
player (0) - 116 freq layer (1) - 13 freq iplayer (1) - 5 freq playen (1) - 2 freq pleyer (1) - 2 freq played (1) - 255 freq players (1) - 151 freq payer (1) - 1 freq planer (1) - 1 freq plater (1) - 1 freq prayer (1) - 95 freq plated (2) - 3 freq pager (2) - 1 freq prayers (2) - 54 freq splayed (2) - 2 freq plates (2) - 58 freq paer (2) - 3 freq playyy (2) - 1 freq play'd (2) - 1 freq playan (2) - 15 freq planes (2) - 19 freq planner (2) - 4 freq playsed (2) - 1 freq plyter (2) - 3 freq lawer (2) - 10 freq |
player (0) - 116 freq pleyer (1) - 2 freq iplayer (1) - 5 freq pleyar (2) - 1 freq prayer (2) - 95 freq plater (2) - 1 freq pler (2) - 1 freq planer (2) - 1 freq playen (2) - 2 freq layer (2) - 13 freq played (2) - 255 freq payer (2) - 1 freq players (2) - 151 freq pityer (3) - 1 freq place (3) - 1675 freq playin (3) - 338 freq placey (3) - 2 freq plaen (3) - 1 freq plaet (3) - 5 freq play (3) - 719 freq playt (3) - 3 freq claer (3) - 22 freq plate (3) - 180 freq playeen (3) - 1 freq pleyers (3) - 7 freq |
SoundEx code - P460 pillar - 15 freq player - 116 freq pallor - 4 freq polar - 24 freq puller - 1 freq pleyer - 2 freq powlar - 1 freq pleyar - 1 freq pullar - 5 freq peeler - 3 freq poller - 1 freq pleure - 1 freq pler - 1 freq |
MetaPhone code - PLYR player - 116 freq pleyer - 2 freq pleyar - 1 freq |
PLAYER play - 719 freq playing - 51 freq playin - 338 freq plays - 123 freq played - 255 freq player - 116 freq players - 151 freq |
Time to execute Levenshtein function - 0.192455 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.365749 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.064039 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.038376 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.000969 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. |