| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ayreshire (0) - 2 freq ayreshires (1) - 1 freq ayrshire (1) - 96 freq ayrshires (2) - 1 freq ayrshir (2) - 1 freq yorkshire (3) - 24 freq threshie (3) - 2 freq cheshire (3) - 10 freq foreshore (3) - 3 freq fifeshire (3) - 1 freq preshure (3) - 1 freq berkshire (3) - 4 freq ayrshire's (3) - 2 freq sure-fire (4) - 1 freq meshie (4) - 2 freq aesir (4) - 4 freq thresher (4) - 2 freq maeshie (4) - 1 freq treshin (4) - 1 freq brexshite (4) - 1 freq adressin (4) - 1 freq affshore (4) - 2 freq prescibe (4) - 1 freq ayrsh (4) - 1 freq airships (4) - 3 freq |
ayreshire (0) - 2 freq ayrshire (1) - 96 freq ayreshires (2) - 1 freq ayrshir (2) - 1 freq ayrshires (3) - 1 freq foreshore (4) - 3 freq preshure (4) - 1 freq yorkshire (4) - 24 freq rasher (5) - 1 freq ayrsh (5) - 1 freq restore (5) - 9 freq ashore (5) - 35 freq reeshie (5) - 1 freq reshape (5) - 1 freq morayshire (5) - 1 freq rashie (5) - 1 freq fresher (5) - 3 freq berkshire (5) - 4 freq fifeshire (5) - 1 freq cheshire (5) - 10 freq ayrshire's (5) - 2 freq shire (5) - 26 freq ayesha (6) - 1 freq ayres (6) - 1 freq retire (6) - 11 freq |
SoundEx code - A626 ayrshire - 96 freq ayrshire's - 2 freq airchers - 7 freq arecord - 1 freq aircraft - 9 freq archer - 9 freq ayrshires - 1 freq ayreshires - 1 freq argyre - 1 freq 'awrighr - 1 freq ayrshire'll - 1 freq ayreshire - 2 freq €œaircraiftsman - 1 freq ayrshireman - 2 freq aircher - 1 freq arrochar - 1 freq air-source - 1 freq archers - 1 freq ayrshir - 1 freq arwgrkole - 1 freq archrose - 1 freq archerfield - 1 freq |
MetaPhone code - ARXR ayrshire - 96 freq archer - 9 freq ayreshire - 2 freq aircher - 1 freq arrochar - 1 freq ayrshir - 1 freq |
AYRESHIRE |
| Time to execute Levenshtein function - 0.217677 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.364894 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.027443 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.039366 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.000925 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. |