| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| porter (0) - 14 freq porters (1) - 6 freq pooter (1) - 1 freq torter (1) - 1 freq poster (1) - 24 freq potter (1) - 29 freq horter (1) - 1 freq punter (2) - 15 freq porres (2) - 1 freq parted (2) - 1 freq poller (2) - 1 freq powker (2) - 5 freq porto (2) - 7 freq moter (2) - 5 freq border (2) - 145 freq corters (2) - 1 freq pooster (2) - 5 freq forster (2) - 4 freq pores (2) - 5 freq picter (2) - 89 freq torters (2) - 1 freq plooter (2) - 1 freq porter's (2) - 2 freq hotter (2) - 8 freq parten (2) - 3 freq |
porter (0) - 14 freq potter (2) - 29 freq portree (2) - 1 freq poster (2) - 24 freq horter (2) - 1 freq torter (2) - 1 freq porters (2) - 6 freq pooter (2) - 1 freq portia (3) - 2 freq portal (3) - 3 freq partey (3) - 3 freq portie (3) - 3 freq port' (3) - 1 freq pester (3) - 2 freq peter (3) - 148 freq poofter (3) - 1 freq ports (3) - 10 freq porton (3) - 1 freq porty (3) - 1 freq plater (3) - 1 freq barter (3) - 3 freq putter (3) - 1 freq propter (3) - 1 freq portray (3) - 1 freq parker (3) - 19 freq |
SoundEx code - P636 portrait - 18 freq partridge - 7 freq portraits - 12 freq porter - 14 freq porters - 6 freq prittier - 1 freq porterfield - 1 freq porter's - 2 freq protrudin - 3 freq parturition - 1 freq portray - 1 freq portraiture - 1 freq paratrooper - 1 freq porturfeeld - 1 freq protractit - 3 freq portrayals - 1 freq portrayin - 2 freq porrtrait - 1 freq parterres - 1 freq €œporter - 1 freq pairtrick - 1 freq preterite - 2 freq pre-drinks - 1 freq pairtricks - 1 freq partricides - 1 freq protractin - 1 freq portrayed - 2 freq preterites - 2 freq pooer-hauders - 1 freq perturbation - 1 freq portrush - 1 freq prodrill - 3 freq protradeuk - 1 freq portrayal - 1 freq portrays - 1 freq prettier - 2 freq portree - 1 freq |
MetaPhone code - PRTR porter - 14 freq prittier - 1 freq portray - 1 freq €œporter - 1 freq prettier - 2 freq portree - 1 freq |
PORTER |
| Time to execute Levenshtein function - 0.198556 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.366621 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.029274 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.039856 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.000953 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. |