| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| auchmannoch (0) - 1 freq lochwinnoch (4) - 1 freq shannoch (4) - 1 freq rannoch (5) - 9 freq auchentocher (5) - 1 freq auchencloich (5) - 3 freq auchinleck (5) - 13 freq echnaloch (5) - 1 freq auchencorth (5) - 1 freq aul'mannie (5) - 1 freq albannach (5) - 8 freq such-an-such (5) - 1 freq eichmann (5) - 1 freq buchanness (5) - 2 freq dutchman (6) - 2 freq automation (6) - 1 freq hannah (6) - 10 freq bladnoch (6) - 3 freq channels (6) - 13 freq atchoooh (6) - 1 freq auroch (6) - 2 freq buchan (6) - 65 freq auchinblae (6) - 1 freq wunnock (6) - 2 freq ummanhood (6) - 1 freq |
auchmannoch (0) - 1 freq shannoch (6) - 1 freq lochwinnoch (6) - 1 freq echnaloch (7) - 1 freq eichmann (7) - 1 freq carmunnock (8) - 7 freq comanche (8) - 1 freq connach (8) - 9 freq albannach (8) - 8 freq auchencloich (8) - 3 freq auchentocher (8) - 1 freq rannoch (8) - 9 freq auchinleck (8) - 13 freq craunch (9) - 1 freq chyach (9) - 1 freq clannish (9) - 1 freq channel' (9) - 2 freq sasannach (9) - 1 freq chancy (9) - 6 freq corynoch (9) - 1 freq chooch (9) - 1 freq themanacho (9) - 1 freq cumnock (9) - 35 freq mcconnach (9) - 1 freq chance (9) - 548 freq |
SoundEx code - A255 assuming - 6 freq aa-kennin - 3 freq asinine - 2 freq assumin - 10 freq auchmannoch - 1 freq assonance - 1 freq awesomeness - 2 freq aagmint - 1 freq 'assuming - 1 freq aisement - 2 freq aisment - 1 freq ajynin - 1 freq augmentin - 1 freq agiements - 1 freq awaukenin - 3 freq awakenin - 2 freq agamemnon's - 2 freq assuman - 1 freq augment - 2 freq awakening - 1 freq awakenings - 1 freq acoming - 1 freq assinments - 1 freq ajmomauntieann - 1 freq |
MetaPhone code - AXMNX auchmannoch - 1 freq |
AUCHMANNOCH |
| Time to execute Levenshtein function - 0.446103 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.587255 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.031000 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.051793 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.000895 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. |