| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| porters (0) - 6 freq posters (1) - 30 freq corters (1) - 1 freq porkers (1) - 2 freq potters (1) - 12 freq torters (1) - 1 freq porter (1) - 14 freq porter's (1) - 2 freq pynters (2) - 1 freq garters (2) - 2 freq footers (2) - 3 freq poofters (2) - 1 freq workers (2) - 34 freq pointers (2) - 2 freq potter (2) - 29 freq horter (2) - 1 freq putters (2) - 1 freq ports (2) - 10 freq loiters (2) - 1 freq corners (2) - 36 freq patters (2) - 3 freq dowters (2) - 1 freq orders (2) - 51 freq borders (2) - 80 freq reporters (2) - 3 freq |
porters (0) - 6 freq porter (2) - 14 freq porter's (2) - 2 freq potters (2) - 12 freq torters (2) - 1 freq corters (2) - 1 freq posters (2) - 30 freq porkers (2) - 2 freq penters (3) - 2 freq merters (3) - 1 freq pelters (3) - 9 freq porteous (3) - 5 freq porto's (3) - 5 freq portrays (3) - 1 freq pousters (3) - 1 freq peters (3) - 4 freq porres (3) - 1 freq picters (3) - 44 freq pryers (3) - 1 freq pikters (3) - 1 freq portals (3) - 1 freq partens (3) - 2 freq plouters (3) - 1 freq pertners (3) - 1 freq pinters (3) - 1 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 - PRTRS porters - 6 freq porter's - 2 freq parterres - 1 freq portrays - 1 freq |
PORTERS |
| Time to execute Levenshtein function - 0.190851 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.378080 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.027914 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.041506 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.000946 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. |