| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| playpark (0) - 1 freq playback (2) - 1 freq players (3) - 152 freq playpen (3) - 1 freq pleyar (3) - 1 freq playfair (3) - 20 freq carpark (3) - 5 freq playan (3) - 15 freq placard (3) - 2 freq player (3) - 131 freq payback (3) - 1 freq playmate (3) - 1 freq lanark (3) - 29 freq papar (3) - 2 freq pypar (3) - 1 freq playock (3) - 1 freq flayan (4) - 2 freq carpairk (4) - 1 freq playit (4) - 4 freq flappan (4) - 4 freq plaisant (4) - 5 freq platypus (4) - 4 freq playlist (4) - 7 freq apart (4) - 115 freq plaags (4) - 1 freq |
playpark (0) - 1 freq playback (4) - 1 freq lanark (5) - 29 freq player (5) - 131 freq papar (5) - 2 freq pypar (5) - 1 freq lapraik (5) - 1 freq placard (5) - 2 freq playock (5) - 1 freq pleyar (5) - 1 freq playpen (5) - 1 freq playfair (5) - 20 freq players (5) - 152 freq carpark (5) - 5 freq papper (6) - 1 freq spark (6) - 37 freq plank (6) - 29 freq appar (6) - 2 freq primark (6) - 6 freq pasport (6) - 5 freq ploppan (6) - 1 freq leopard (6) - 5 freq paepers (6) - 2 freq paper (6) - 526 freq plenary (6) - 2 freq |
SoundEx code - P416 palaver - 10 freq pulverisin - 1 freq pilaaver - 1 freq palfrey - 6 freq playpark - 1 freq plover - 9 freq palaiver - 2 freq pley-fere - 1 freq pulverise - 1 freq pluffert - 2 freq playfair - 20 freq playfair's - 2 freq pullover - 1 freq pleyferes - 1 freq plavver - 2 freq €˜pulverised - 1 freq pluffer - 7 freq pulverised - 1 freq polvara - 2 freq paulbernaluk - 2 freq pluperfect- - 1 freq philipbrannan - 1 freq |
MetaPhone code - PLPRK playpark - 1 freq |
PLAYPARK |
| Time to execute Levenshtein function - 0.198517 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.454777 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.029279 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.038525 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.000866 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. |