| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| manchester (0) - 10 freq barchester (2) - 1 freq winchester (2) - 1 freq ancestor (3) - 16 freq machetes (3) - 1 freq mannyster (3) - 4 freq chichester (3) - 1 freq chester (3) - 1 freq heychester (3) - 1 freq lancaster (3) - 3 freq manifesto (4) - 18 freq dauchter (4) - 18 freq lachter (4) - 16 freq ancestirs (4) - 1 freq wance-aer (4) - 1 freq bangster (4) - 4 freq wanceower (4) - 1 freq ancestor- (4) - 1 freq macheen (4) - 2 freq dachter (4) - 2 freq munster (4) - 7 freq mankiest (4) - 1 freq manifest (4) - 6 freq marches (4) - 16 freq mcmaster (4) - 2 freq |
manchester (0) - 10 freq winchester (3) - 1 freq barchester (4) - 1 freq chester (5) - 1 freq lancaster (5) - 3 freq chichester (5) - 1 freq heychester (5) - 1 freq mannyster (5) - 4 freq ancestor (5) - 16 freq mcmaster (6) - 2 freq mecnister (6) - 1 freq meenester (6) - 8 freq monster (6) - 52 freq minister (6) - 67 freq munster (6) - 7 freq ancestry (6) - 6 freq unchasten (6) - 1 freq enchanter (6) - 2 freq doncaster (6) - 4 freq machetes (6) - 1 freq sneester (7) - 3 freq lachter (7) - 16 freq laachter (7) - 3 freq maister (7) - 216 freq meinister (7) - 34 freq |
SoundEx code - M522 monkey's - 3 freq manages - 14 freq menchies - 1 freq monica's - 1 freq munages - 1 freq monkhoose - 1 freq mungo's - 1 freq monkeys - 18 freq munchkin - 3 freq minces - 1 freq munch's - 4 freq meniscus - 1 freq menzies - 17 freq munka-hooses - 1 freq mankiest - 1 freq mansie's - 3 freq mumsake - 1 freq menaces - 1 freq manchester - 10 freq mangos - 1 freq mingus - 1 freq €œmingus - 1 freq mowences - 1 freq monkey-chatter - 1 freq menses - 1 freq man-size - 1 freq munchkins - 3 freq munchies - 2 freq memesisdeen - 2 freq managagin - 1 freq munchausen's - 1 freq mungoshifi - 1 freq monkeysmedia - 2 freq |
MetaPhone code - MNXSTR manchester - 10 freq |
MANCHESTER |
| Time to execute Levenshtein function - 0.220539 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.392614 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.029054 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.040612 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.000876 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. |