| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| poller (1) - 1 freq planer (2) - 1 freq puller (2) - 1 freq follaer (2) - 10 freq roller (2) - 27 freq pilsner (2) - 1 freq pollner's (2) - 1 freq polnar (2) - 1 freq pollen (2) - 3 freq holler (2) - 2 freq voller (2) - 2 freq collier (2) - 2 freq ponner (2) - 1 freq goller (2) - 7 freq pallor (3) - 4 freq pouther (3) - 7 freq yollert (3) - 2 freq rouner (3) - 2 freq yonner (3) - 67 freq colonel (3) - 8 freq powder (3) - 10 freq poster (3) - 24 freq guller (3) - 1 freq poles (3) - 30 freq follaers (3) - 108 freq |
poller (2) - 1 freq pollen (3) - 3 freq planer (3) - 1 freq pilsner (3) - 1 freq polnar (3) - 1 freq puller (3) - 1 freq plunner (4) - 1 freq polling (4) - 3 freq pullar (4) - 5 freq planner (4) - 4 freq pullen (4) - 1 freq plainer (4) - 3 freq pullover (4) - 1 freq pillar (4) - 15 freq ponner (4) - 1 freq holler (4) - 2 freq pollner's (4) - 1 freq roller (4) - 27 freq follaer (4) - 10 freq voller (4) - 2 freq collier (4) - 2 freq pallor (4) - 4 freq goller (4) - 7 freq pollin (4) - 10 freq taller (5) - 24 freq |
SoundEx code - P456 plainer - 3 freq polnar - 1 freq palmerio - 1 freq plunnér - 1 freq palmer - 3 freq plunner - 1 freq planner - 4 freq planer - 1 freq pollner's - 1 freq palm-reinged - 1 freq planners - 2 freq plunnerin - 1 freq plenary - 2 freq plummer - 1 freq palmers - 1 freq palmerston - 2 freq |
MetaPhone code - PLNR plainer - 3 freq polnar - 1 freq plunnér - 1 freq plunner - 1 freq planner - 4 freq planer - 1 freq plenary - 2 freq |
POLLNER |
| Time to execute Levenshtein function - 0.228450 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.414579 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.030017 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.043615 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.000855 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. |