| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pullover (0) - 1 freq puller (2) - 1 freq plover (2) - 9 freq allover (2) - 3 freq culler (3) - 1 freq clover (3) - 17 freq bellower (3) - 1 freq culloes (3) - 1 freq culloden (3) - 13 freq passover (3) - 3 freq follower (3) - 8 freq duller (3) - 2 freq pullitzer (3) - 1 freq pullen (3) - 1 freq palaiver (3) - 2 freq pulled (3) - 167 freq pulley (3) - 9 freq wulver (3) - 1 freq poller (3) - 1 freq pallor (3) - 4 freq walloper (3) - 6 freq guller (3) - 1 freq lover (3) - 27 freq pullar (3) - 5 freq hungover (3) - 3 freq |
pullover (0) - 1 freq plover (3) - 9 freq allover (3) - 3 freq puller (3) - 1 freq plavver (4) - 2 freq pullar (4) - 5 freq pilaaver (4) - 1 freq palaver (4) - 10 freq poller (4) - 1 freq pallor (4) - 4 freq palaiver (4) - 2 freq lover (5) - 27 freq guller (5) - 1 freq auller (5) - 1 freq plooter (5) - 1 freq pillar (5) - 15 freq walloper (5) - 6 freq fuller (5) - 3 freq pillowed (5) - 1 freq cullour (5) - 6 freq pullet (5) - 3 freq clover (5) - 17 freq follower (5) - 8 freq passover (5) - 3 freq wulver (5) - 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 |
PULLOVER |
| Time to execute Levenshtein function - 0.200880 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.337938 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.026924 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.038445 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.000843 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. |