| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| moorpark (0) - 10 freq carpark (3) - 5 freq mortar (3) - 9 freq moorland (3) - 3 freq bookmark (3) - 1 freq morcar (3) - 4 freq cornpark (3) - 1 freq oarwark (3) - 1 freq moorburn (3) - 1 freq morear (3) - 3 freq hooswark (3) - 1 freq corpach (4) - 1 freq ootward (4) - 6 freq mozart (4) - 12 freq moocher (4) - 2 freq moorit (4) - 8 freq morvern (4) - 1 freq documark (4) - 3 freq motorway (4) - 8 freq morra (4) - 76 freq sooran (4) - 1 freq pooper (4) - 1 freq wor-are (4) - 1 freq anorak (4) - 11 freq morals (4) - 10 freq |
moorpark (0) - 10 freq carpark (4) - 5 freq muirkirk (5) - 47 freq moorburn (5) - 1 freq morear (5) - 3 freq cornpark (5) - 1 freq oarwark (5) - 1 freq mortar (5) - 9 freq carpairk (5) - 1 freq morcar (5) - 4 freq mordor (6) - 2 freq playpark (6) - 1 freq mourner (6) - 2 freq spark (6) - 35 freq morph (6) - 1 freq mourners (6) - 6 freq morecar (6) - 1 freq morra' (6) - 1 freq murrkirk (6) - 2 freq moorky (6) - 1 freq morphed (6) - 1 freq morrae (6) - 2 freq trark (6) - 1 freq owerwark (6) - 1 freq mark (6) - 222 freq |
SoundEx code - M616 marbroy - 1 freq moorpark - 10 freq moorburn - 1 freq morvern - 1 freq €˜moreover - 1 freq morayfirthradio - 2 freq marebearturner - 32 freq |
MetaPhone code - MRPRK moorpark - 10 freq |
MOORPARK |
| Time to execute Levenshtein function - 0.207463 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.386323 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.027027 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.038745 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.000875 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. |