| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| car-pairk (0) - 3 freq carpairk (1) - 1 freq carpark (2) - 5 freq carstairs (3) - 1 freq ker-park (3) - 1 freq cornpark (3) - 1 freq caur-parks (3) - 1 freq war-paint (3) - 1 freq farmyaird (4) - 1 freq artwirk (4) - 1 freq repairs (4) - 6 freq craick (4) - 1 freq repair (4) - 15 freq warpaint (4) - 1 freq campfire (4) - 3 freq landmairk (4) - 4 freq tarlair (4) - 7 freq caspar (4) - 1 freq corsair (4) - 1 freq carpin (4) - 2 freq camstairy (4) - 2 freq tae-pairty (4) - 2 freq remairk (4) - 5 freq campaign (4) - 103 freq campaine (4) - 14 freq |
car-pairk (0) - 3 freq carpairk (2) - 1 freq carpark (3) - 5 freq cornpark (4) - 1 freq ker-park (4) - 1 freq caur-parks (4) - 1 freq war-paint (6) - 1 freq carstairs (6) - 1 freq tay-pairty (7) - 1 freq craik (7) - 39 freq oarwark (7) - 1 freq twa-pairt (7) - 1 freq carpit (7) - 2 freq compair (7) - 1 freq pairk (7) - 35 freq cut-price (7) - 1 freq moorpark (7) - 10 freq re-pack (7) - 1 freq crapper (7) - 1 freq cropper (7) - 3 freq carapace (7) - 1 freq lea-perk (7) - 2 freq spairk (7) - 8 freq carrick (7) - 6 freq caspar (7) - 1 freq |
SoundEx code - C616 carefree - 6 freq carbrini - 1 freq cerebrum - 1 freq carberry - 2 freq caur-parks - 1 freq cerberus - 15 freq car-pairk - 3 freq corporate - 26 freq corporation - 5 freq corporations - 4 freq care-free - 1 freq crawford - 5 freq cerebral - 1 freq crapper - 1 freq cropper - 3 freq carpairk - 1 freq corporal - 22 freq cerbuird - 1 freq crafurds - 1 freq crawfurd - 1 freq creepers - 1 freq crawford's - 2 freq cerberus's - 1 freq chair-frame - 1 freq carpark - 5 freq currieboram - 1 freq carver - 14 freq corporately - 1 freq crobertsonuk - 15 freq corfuarts - 1 freq crawfor - 1 freq crowberries - 1 freq |
MetaPhone code - KRPRK car-pairk - 3 freq carpairk - 1 freq ker-park - 1 freq carpark - 5 freq |
CAR-PAIRK |
| Time to execute Levenshtein function - 0.237776 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.413524 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.028479 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.050571 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.000851 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. |