| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| palaver (0) - 10 freq palaiver (1) - 2 freq palates (2) - 1 freq cadaver (2) - 1 freq palava (2) - 1 freq slaver (2) - 6 freq claver (2) - 14 freq palate (2) - 4 freq player (2) - 131 freq plavver (2) - 2 freq palmer (2) - 3 freq pilaaver (2) - 1 freq palace (2) - 98 freq palaces (2) - 9 freq plover (2) - 9 freq palace' (2) - 2 freq praver (2) - 1 freq plater (2) - 1 freq haaver (2) - 4 freq planer (2) - 1 freq walpaper (3) - 1 freq planner (3) - 4 freq plates (3) - 58 freq papar (3) - 2 freq maaker (3) - 1 freq |
palaver (0) - 10 freq palaiver (1) - 2 freq plover (2) - 9 freq pilaaver (2) - 1 freq palava (3) - 1 freq planer (3) - 1 freq praver (3) - 1 freq plater (3) - 1 freq plavver (3) - 2 freq palmer (3) - 3 freq slaver (3) - 6 freq claver (3) - 14 freq player (3) - 131 freq pullover (4) - 1 freq cleaver (4) - 4 freq pivver (4) - 1 freq pelter (4) - 1 freq claiver (4) - 4 freq oliver (4) - 10 freq plyter (4) - 3 freq filever (4) - 1 freq silver (4) - 121 freq pler (4) - 1 freq wulver (4) - 1 freq pallor (4) - 4 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 |
PALAVER |
| Time to execute Levenshtein function - 0.189296 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.347786 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.027936 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.037808 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.000965 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. |