| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| moorpark (0) - 10 freq cornpark (3) - 1 freq moorland (3) - 3 freq carpark (3) - 5 freq hooswark (3) - 1 freq morcar (3) - 4 freq morear (3) - 3 freq moorburn (3) - 1 freq bookmark (3) - 1 freq oarwark (3) - 1 freq mortar (3) - 9 freq boorach (4) - 31 freq moothaa (4) - 1 freq playpark (4) - 1 freq moornin' (4) - 9 freq moorit (4) - 8 freq moppan (4) - 1 freq honorar (4) - 1 freq orpah (4) - 2 freq soopaa (4) - 2 freq cooper (4) - 18 freq coupar (4) - 3 freq pooran (4) - 1 freq orrawark (4) - 1 freq forsak (4) - 1 freq |
moorpark (0) - 10 freq carpark (4) - 5 freq oarwark (5) - 1 freq mortar (5) - 9 freq mararyk (5) - 2 freq moorburn (5) - 1 freq muirkirk (5) - 47 freq carpairk (5) - 1 freq cornpark (5) - 1 freq morcar (5) - 4 freq morear (5) - 3 freq moorland (6) - 3 freq morvern (6) - 1 freq morpeth (6) - 2 freq owerwark (6) - 1 freq trark (6) - 1 freq ker-park (6) - 1 freq morra- (6) - 1 freq morra' (6) - 1 freq morrae (6) - 2 freq murrkirk (6) - 2 freq spark (6) - 37 freq bookmark (6) - 1 freq mourner (6) - 2 freq morro (6) - 18 freq |
SoundEx code - M616 marbroy - 1 freq mariboro - 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.258988 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.691336 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.030675 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.069158 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.000884 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. |