| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| portals (0) - 1 freq portal (1) - 3 freq mortals (1) - 11 freq morals (2) - 10 freq partans (2) - 5 freq portaloo (2) - 1 freq porto's (2) - 5 freq mortal (2) - 54 freq porters (2) - 6 freq petals (2) - 22 freq ports (2) - 10 freq portrays (2) - 1 freq horrals (2) - 1 freq portable (2) - 9 freq gorbals (2) - 15 freq postal (2) - 3 freq portaloos (2) - 1 freq orrals (2) - 13 freq roals (3) - 1 freq portie (3) - 3 freq sort'll (3) - 1 freq coral (3) - 5 freq parties (3) - 20 freq pot's (3) - 2 freq orcas (3) - 5 freq |
portals (0) - 1 freq portaloos (2) - 1 freq portal (2) - 3 freq mortals (2) - 11 freq ports (3) - 10 freq portrays (3) - 1 freq porters (3) - 6 freq petals (3) - 22 freq partans (3) - 5 freq portaloo (3) - 1 freq porto's (3) - 5 freq portrayals (4) - 1 freq portions (4) - 6 freq palatals (4) - 1 freq partens (4) - 2 freq pigtails (4) - 13 freq perties (4) - 7 freq porteous (4) - 5 freq prataes (4) - 1 freq partly (4) - 10 freq partial (4) - 8 freq portsoy (4) - 10 freq pistols (4) - 18 freq pirls (4) - 4 freq parts (4) - 24 freq |
SoundEx code - P634 proodly - 39 freq prattle - 29 freq portal - 3 freq pairtly - 15 freq portling - 1 freq pairtylowse - 1 freq proudly - 12 freq partially - 10 freq partial - 8 freq partly - 10 freq parteelcar - 1 freq prood-lookin - 1 freq porthole - 1 freq portals - 1 freq prattle's - 1 freq proodlie - 2 freq pairtlie - 2 freq pairtial - 1 freq proudlie - 1 freq prood-like - 1 freq portaloo - 1 freq pairtlt - 1 freq pertlie - 1 freq pairtially - 2 freq portland - 13 freq proodlik - 1 freq €˜partial - 1 freq portlethen - 1 freq prattlin - 1 freq portaloos - 1 freq |
MetaPhone code - PRTLS pairtylowse - 1 freq portals - 1 freq prattle's - 1 freq portaloos - 1 freq |
PORTALS |
| Time to execute Levenshtein function - 0.223276 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.392577 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.040876 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.039362 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.000910 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. |