| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| palaiver (0) - 2 freq palaver (1) - 10 freq plavver (2) - 2 freq faaiver (2) - 1 freq claiver (2) - 4 freq slaiver (2) - 1 freq pilaaver (2) - 1 freq plainer (2) - 3 freq aleive (3) - 1 freq palava (3) - 1 freq palace' (3) - 2 freq planner (3) - 4 freq fariver (3) - 10 freq player (3) - 131 freq daiver (3) - 4 freq pals've (3) - 1 freq plaine (3) - 1 freq faniver (3) - 1 freq fativer (3) - 1 freq pleiter (3) - 1 freq paiper (3) - 7 freq deliver (3) - 47 freq laiter (3) - 4 freq palate (3) - 4 freq praver (3) - 1 freq |
palaiver (0) - 2 freq palaver (1) - 10 freq pilaaver (2) - 1 freq plainer (3) - 3 freq slaiver (3) - 1 freq plover (3) - 9 freq claiver (3) - 4 freq plavver (3) - 2 freq planer (4) - 1 freq claver (4) - 14 freq liver (4) - 34 freq cliver (4) - 12 freq oliver (4) - 10 freq sliver (4) - 8 freq allover (4) - 3 freq deleiver (4) - 4 freq slaver (4) - 6 freq praver (4) - 1 freq pullover (4) - 1 freq palmer (4) - 3 freq plaisir (4) - 3 freq plater (4) - 1 freq player (4) - 131 freq palava (4) - 1 freq pleiter (4) - 1 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 |
PALAIVER |
| Time to execute Levenshtein function - 0.481900 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.807559 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.068980 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.050782 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.000919 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. |