| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ardrishaig (0) - 4 freq arisaig (3) - 1 freq addressin (5) - 19 freq drochaid (5) - 2 freq callishang (5) - 1 freq advisorie (5) - 1 freq arriving (5) - 5 freq arisan (5) - 1 freq dishit (5) - 1 freq relishin (5) - 2 freq airm-shair (5) - 1 freq dishing (5) - 3 freq ayrshir (5) - 1 freq arrochar (5) - 1 freq arrivit (5) - 7 freq addresg (5) - 1 freq cherishin (5) - 1 freq reishil (5) - 6 freq rishi (5) - 4 freq arbrahamic (5) - 1 freq alistair (5) - 22 freq advisin (5) - 3 freq apprisit (5) - 1 freq arrivals (5) - 3 freq disdain (5) - 10 freq |
ardrishaig (0) - 4 freq arisaig (6) - 1 freq redrichie (7) - 1 freq ardross (7) - 1 freq addresg (7) - 1 freq arrestit (8) - 7 freq airbrush (8) - 3 freq drush (8) - 7 freq addressan (8) - 1 freq perishin (8) - 2 freq 'trisha (8) - 1 freq nourishin (8) - 3 freq marisha (8) - 1 freq padraig (8) - 5 freq refraishit (8) - 2 freq airish (8) - 38 freq arrestin (8) - 2 freq refreshin (8) - 6 freq arraheid (8) - 2 freq reddish (8) - 1 freq arra-heid (8) - 1 freq ordering (8) - 3 freq radishes (8) - 1 freq readership (8) - 3 freq a-dressin (8) - 2 freq |
SoundEx code - A636 airtwark - 5 freq arthur - 38 freq ardour - 1 freq artwork - 6 freq aye-retourin - 1 freq arthur's - 4 freq arthritic - 4 freq airtworks - 1 freq arthritis - 4 freq arteries - 5 freq artwirk - 1 freq artur - 1 freq ardrishaig - 4 freq ardross - 1 freq aerodrome - 2 freq artery - 2 freq arthurs - 1 freq airteries - 1 freq airdrie - 9 freq airtery - 1 freq ardern - 1 freq |
MetaPhone code - ARTRXK ardrishaig - 4 freq |
ARDRISHAIG |
| Time to execute Levenshtein function - 0.211395 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.401072 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.036680 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.038038 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.000921 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. |