| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| player (0) - 131 freq prayer (1) - 96 freq layer (1) - 15 freq pleyer (1) - 2 freq players (1) - 152 freq payer (1) - 1 freq planer (1) - 1 freq plater (1) - 1 freq playen (1) - 2 freq played (1) - 256 freq iplayer (1) - 5 freq plaen (2) - 1 freq playpen (2) - 1 freq playit (2) - 4 freq lawer (2) - 10 freq layers (2) - 21 freq paper (2) - 526 freq praper (2) - 1 freq plaet (2) - 5 freq play (2) - 748 freq pler (2) - 1 freq playin (2) - 347 freq plates (2) - 58 freq plane (2) - 68 freq elyer (2) - 1 freq |
player (0) - 131 freq iplayer (1) - 5 freq pleyer (1) - 2 freq played (2) - 256 freq pler (2) - 1 freq pleyar (2) - 1 freq plater (2) - 1 freq playen (2) - 2 freq players (2) - 152 freq prayer (2) - 96 freq payer (2) - 1 freq planer (2) - 1 freq layer (2) - 15 freq plays (3) - 129 freq placey (3) - 2 freq palaver (3) - 10 freq pleyers (3) - 7 freq playt (3) - 3 freq place (3) - 1701 freq playyy (3) - 1 freq pityer (3) - 1 freq pager (3) - 1 freq plover (3) - 9 freq laayer (3) - 5 freq laer (3) - 1 freq |
SoundEx code - P460 pillar - 15 freq player - 131 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 - 131 freq pleyer - 2 freq pleyar - 1 freq |
PLAYER play - 748 freq playing - 58 freq playin - 347 freq plays - 129 freq played - 256 freq player - 131 freq players - 152 freq |
| Time to execute Levenshtein function - 0.224508 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.391115 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.028505 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.036967 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.000971 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. |