| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kailyard (0) - 5 freq kailyaird (1) - 10 freq kailyairds (2) - 1 freq halyard (2) - 1 freq kaleyard (2) - 1 freq railcard (2) - 1 freq kyard (3) - 3 freq farmyard (3) - 1 freq kailyarders (3) - 1 freq lanyard (3) - 1 freq mallard (3) - 1 freq backyard (3) - 1 freq 'willard (3) - 1 freq kailyardism (3) - 1 freq halyards (3) - 1 freq tullyard (3) - 2 freq shipyard (3) - 4 freq wullyard (3) - 1 freq kailas (3) - 1 freq cailyardis (3) - 1 freq dalyrd (3) - 1 freq kildare (3) - 2 freq kirkyard (3) - 24 freq ainward (3) - 4 freq kaird (3) - 1 freq |
kailyard (0) - 5 freq kailyaird (1) - 10 freq kaleyard (2) - 1 freq kailyairds (3) - 1 freq halyard (3) - 1 freq kaird (4) - 1 freq railcard (4) - 1 freq kyard (4) - 3 freq dalyrd (4) - 1 freq kilted (5) - 6 freq klyned (5) - 1 freq kaald (5) - 4 freq killed (5) - 81 freq aakward (5) - 6 freq kiltered (5) - 1 freq aukward (5) - 1 freq 'loard (5) - 10 freq kaylied (5) - 1 freq keilled (5) - 2 freq keyboard (5) - 17 freq kilda (5) - 3 freq kyrard (5) - 1 freq laird (5) - 172 freq lard (5) - 4 freq tailored (5) - 3 freq |
SoundEx code - K463 kailyard - 5 freq kaleyard - 1 freq kulirt - 1 freq kullirt - 1 freq kailyaird - 10 freq klerty - 2 freq kailyarders - 1 freq kailyairds - 1 freq kailyardism - 1 freq koolradiouk - 1 freq killertron - 1 freq |
MetaPhone code - KLYRT kailyard - 5 freq kaleyard - 1 freq kailyaird - 10 freq |
KAILYARD |
| Time to execute Levenshtein function - 0.194129 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.356479 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.027438 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.036800 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.000795 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. |