| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| portaloo (0) - 1 freq portaloos (1) - 1 freq portal (2) - 3 freq portals (2) - 1 freq portable (3) - 9 freq mortally (3) - 1 freq portnaboe (3) - 1 freq portion (3) - 22 freq postal (3) - 3 freq orraloon (3) - 6 freq lornalou (3) - 2 freq portico (3) - 1 freq portfolio (3) - 5 freq mortals (3) - 11 freq potato (3) - 11 freq porto (3) - 6 freq portaedoon (3) - 1 freq mortal (3) - 54 freq portsoy (3) - 10 freq boogaloo (3) - 1 freq nortaboot (3) - 1 freq porton (3) - 1 freq borealis (4) - 2 freq portland (4) - 13 freq porty (4) - 1 freq |
portaloo (0) - 1 freq portal (2) - 3 freq portaloos (2) - 1 freq portals (3) - 1 freq portsoy (4) - 10 freq mortal (4) - 54 freq partial (4) - 7 freq partly (4) - 10 freq pertlie (4) - 1 freq portfolio (4) - 5 freq porton (4) - 1 freq porto (4) - 6 freq portion (4) - 22 freq portico (4) - 1 freq portable (4) - 9 freq postal (4) - 3 freq portugal (5) - 10 freq petal (5) - 10 freq porteous (5) - 5 freq bortle (5) - 1 freq portie (5) - 3 freq pairtlie (5) - 2 freq pairtly (5) - 15 freq parton (5) - 4 freq portrayal (5) - 1 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 - PRTL proodly - 38 freq prattle - 29 freq portal - 3 freq pairtly - 15 freq proudly - 12 freq partly - 10 freq proodlie - 2 freq pairtlie - 2 freq proudlie - 1 freq portaloo - 1 freq pertlie - 1 freq |
PORTALOO |
| Time to execute Levenshtein function - 0.196965 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.384562 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.027501 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.037971 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.000815 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. |