| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| pairtly (0) - 15 freq pairtlt (1) - 1 freq pairty (1) - 293 freq partly (1) - 10 freq pairl (2) - 3 freq spairkly (2) - 2 freq party (2) - 157 freq paisely (2) - 2 freq airly (2) - 20 freq bairnly (2) - 1 freq pairte (2) - 1 freq laistly (2) - 2 freq paartcy (2) - 1 freq paisty (2) - 1 freq smairtly (2) - 3 freq lairdly (2) - 2 freq pairtlie (2) - 2 freq hairdly (2) - 55 freq pairtie (2) - 44 freq parly (2) - 2 freq faintly (2) - 12 freq paisly (2) - 1 freq partey (2) - 3 freq sairly (2) - 28 freq pairls (2) - 4 freq |
pairtly (0) - 15 freq partly (1) - 10 freq pairtlie (2) - 2 freq pairty (2) - 293 freq pairtlt (2) - 1 freq parly (3) - 2 freq pairtie (3) - 44 freq pairtit (3) - 21 freq pairtys (3) - 5 freq partey (3) - 3 freq pairently (3) - 1 freq pairts (3) - 230 freq pairtic (3) - 1 freq pairtisy (3) - 1 freq pairted (3) - 5 freq paartcy (3) - 1 freq pairt' (3) - 3 freq party (3) - 157 freq pairth (3) - 1 freq pairl (3) - 3 freq pairtin (3) - 19 freq pairt (3) - 933 freq puirly (3) - 3 freq pairte (3) - 1 freq pairtial (3) - 1 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 - PRTL proodly - 39 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 |
PAIRTLY |
| Time to execute Levenshtein function - 0.238070 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.361324 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.027770 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.037620 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.000897 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. |