| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| carpairk (0) - 1 freq carpark (1) - 5 freq car-pairk (1) - 3 freq craick (3) - 1 freq carpin (3) - 2 freq cartain (3) - 1 freq campfire (3) - 3 freq carrick (3) - 6 freq tarlair (3) - 7 freq cornpark (3) - 1 freq appairt (3) - 5 freq campaign (3) - 103 freq captir (3) - 1 freq compair (3) - 1 freq campain (3) - 3 freq caspar (3) - 1 freq carpit (3) - 2 freq pairk (3) - 35 freq apairt (3) - 197 freq craik (3) - 39 freq carstairs (3) - 1 freq corsair (3) - 1 freq oarwark (3) - 1 freq spairk (3) - 8 freq campaine (3) - 14 freq |
carpairk (0) - 1 freq carpark (1) - 5 freq car-pairk (2) - 3 freq cornpark (4) - 1 freq compair (5) - 1 freq carpit (5) - 2 freq caspar (5) - 1 freq oarwark (5) - 1 freq moorpark (5) - 10 freq spairk (5) - 8 freq corsair (5) - 1 freq pairk (5) - 35 freq craik (5) - 39 freq craick (5) - 1 freq carrick (5) - 6 freq carpin (5) - 2 freq carpeted (6) - 1 freq spirk (6) - 3 freq spark (6) - 37 freq caur-parks (6) - 1 freq ckriyk (6) - 1 freq carr (6) - 3 freq craack (6) - 1 freq mararyk (6) - 2 freq cerbuird (6) - 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 |
CARPAIRK |
| Time to execute Levenshtein function - 0.315123 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.391919 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.029907 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.037598 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.000981 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. |