| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| portaloos (0) - 1 freq portaloo (1) - 1 freq portals (2) - 1 freq porto's (3) - 5 freq portaedoon (3) - 1 freq porteous (3) - 5 freq orraloon (3) - 6 freq potatoes (3) - 7 freq nortaboot (3) - 1 freq portions (3) - 6 freq portal (3) - 3 freq mortals (3) - 11 freq poalis (4) - 1 freq vindaloos (4) - 1 freq potato (4) - 11 freq aloos (4) - 4 freq morals (4) - 10 freq poraamis (4) - 1 freq mortality (4) - 10 freq boogaloo (4) - 1 freq porter's (4) - 2 freq porto (4) - 6 freq torturous (4) - 2 freq fitaloon (4) - 1 freq baloos (4) - 1 freq |
portaloos (0) - 1 freq portals (2) - 1 freq portaloo (2) - 1 freq portions (4) - 6 freq mortals (4) - 11 freq portal (4) - 3 freq porteous (4) - 5 freq porto's (4) - 5 freq parasols (5) - 2 freq portrays (5) - 1 freq perilous (5) - 1 freq parlous (5) - 1 freq portrayals (5) - 1 freq ports (5) - 10 freq portsoy (5) - 10 freq partans (5) - 5 freq porters (5) - 6 freq petals (5) - 22 freq portaedoon (5) - 1 freq potatoes (5) - 7 freq potamus (6) - 1 freq particles (6) - 6 freq pirls (6) - 4 freq parts (6) - 23 freq pirates (6) - 7 freq |
SoundEx code - P634 proodly - 38 freq prattle - 29 freq portal - 3 freq pairtly - 15 freq portling - 1 freq pairtylowse - 1 freq proudly - 12 freq partly - 10 freq partial - 7 freq parteelcar - 1 freq prood-lookin - 1 freq porthole - 1 freq partially - 9 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 |
PORTALOOS |
| Time to execute Levenshtein function - 0.280992 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.438557 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.029029 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.042027 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.000930 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. |