| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| plavver (0) - 2 freq palaver (2) - 10 freq plater (2) - 1 freq plaster (2) - 14 freq planner (2) - 4 freq player (2) - 131 freq pilaaver (2) - 1 freq claiver (2) - 4 freq planer (2) - 1 freq plainer (2) - 3 freq plover (2) - 9 freq praver (2) - 1 freq palaiver (2) - 2 freq clivver (2) - 38 freq slaver (2) - 6 freq pivver (2) - 1 freq claver (2) - 14 freq slaiver (2) - 1 freq planter (2) - 6 freq platter (2) - 11 freq clavier (2) - 1 freq clairer (3) - 1 freq placies (3) - 4 freq slabber (3) - 9 freq naver (3) - 3 freq |
plavver (0) - 2 freq pivver (3) - 1 freq plover (3) - 9 freq palaiver (3) - 2 freq clivver (3) - 38 freq pilaaver (3) - 1 freq palaver (3) - 10 freq claver (4) - 14 freq slivvery (4) - 1 freq pullover (4) - 1 freq slaiver (4) - 1 freq clavier (4) - 1 freq platter (4) - 11 freq clivvir (4) - 12 freq planter (4) - 6 freq plaster (4) - 14 freq player (4) - 131 freq planner (4) - 4 freq claiver (4) - 4 freq planer (4) - 1 freq praver (4) - 1 freq slaver (4) - 6 freq plainer (4) - 3 freq plater (4) - 1 freq nivver (5) - 977 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 - PLFR palaver - 10 freq pilaaver - 1 freq palfrey - 6 freq plover - 9 freq palaiver - 2 freq pley-fere - 1 freq playfair - 20 freq pullover - 1 freq plavver - 2 freq pluffer - 7 freq polvara - 2 freq |
PLAVVER |
| Time to execute Levenshtein function - 0.288647 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.489606 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.029641 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.037889 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.000885 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. |