| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yairds (0) - 51 freq cairds (1) - 88 freq gairds (1) - 16 freq yaird's (1) - 1 freq eairds (1) - 2 freq bairds (1) - 3 freq airds (1) - 15 freq lairds (1) - 28 freq yards (1) - 24 freq yairns (1) - 14 freq yaird (1) - 88 freq mairks (2) - 15 freq guairds (2) - 21 freq yirs (2) - 4 freq cairts (2) - 34 freq 'birds (2) - 2 freq laird's (2) - 10 freq bairdy (2) - 2 freq yids (2) - 2 freq pair's (2) - 1 freq yird's (2) - 9 freq wuirds (2) - 2 freq yard (2) - 43 freq yirdy (2) - 6 freq baird's (2) - 1 freq |
yairds (0) - 51 freq eairds (1) - 2 freq yards (1) - 24 freq airds (1) - 15 freq yairns (2) - 14 freq raids (2) - 4 freq yerds (2) - 4 freq yaird (2) - 88 freq ards (2) - 14 freq yaird's (2) - 1 freq lairds (2) - 28 freq cairds (2) - 88 freq gairds (2) - 16 freq bairds (2) - 3 freq wards (3) - 30 freq girds (3) - 5 freq yaard's (3) - 1 freq yeirs (3) - 45 freq cards (3) - 33 freq airrs (3) - 2 freq hirds (3) - 8 freq taids (3) - 2 freq weirds (3) - 1 freq aids (3) - 9 freq yarras (3) - 1 freq |
SoundEx code - Y632 yards - 24 freq yairds - 51 freq yaard's - 1 freq yerds - 4 freq yerd-daeks - 1 freq yird's - 9 freq yirdquaak - 2 freq €˜yirth-centred - 2 freq yairdstick - 2 freq yaird's - 1 freq yardstick - 1 freq |
MetaPhone code - YRTS yards - 24 freq yairds - 51 freq yaard's - 1 freq yerds - 4 freq yird's - 9 freq yaird's - 1 freq |
YAIRDS |
| Time to execute Levenshtein function - 0.222843 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.382219 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.028365 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.041080 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.000968 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. |