| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kirkyard (0) - 24 freq kirkyaird (1) - 81 freq kirkyerd (1) - 2 freq kirkyairds (2) - 10 freq kirk-yaird (2) - 4 freq kirkwall (3) - 15 freq airnhard (3) - 1 freq kyrard (3) - 1 freq farmyard (3) - 1 freq kirklands (3) - 3 freq cornyard (3) - 2 freq kirkaldy (3) - 2 freq yirbard (3) - 1 freq kirky (3) - 12 freq kirkcaddy (3) - 1 freq kailyard (3) - 5 freq kyard (3) - 3 freq kirkyaird's (3) - 1 freq kaleyard (3) - 1 freq backyard (3) - 1 freq kirkgate (3) - 4 freq kirkman (3) - 1 freq kirkcaldy (3) - 23 freq kirkwud (3) - 2 freq vineyard (3) - 7 freq |
kirkyard (0) - 24 freq kirkyerd (1) - 2 freq kirkyaird (1) - 81 freq kirk-yaird (3) - 4 freq kirkyairds (3) - 10 freq kirkaldy (4) - 2 freq kirkwud (4) - 2 freq kyrard (4) - 1 freq kaleyard (5) - 1 freq kirkyaird's (5) - 1 freq backyard (5) - 1 freq kierkegaard (5) - 2 freq kirkcaldy (5) - 23 freq kirkgate (5) - 4 freq kyard (5) - 3 freq kirkman (5) - 1 freq kailyard (5) - 5 freq farmyard (5) - 1 freq cornyard (5) - 2 freq yirbard (5) - 1 freq kirkcaddy (5) - 1 freq kirky (5) - 12 freq kinkeind (6) - 7 freq warkar (6) - 1 freq reward (6) - 46 freq |
SoundEx code - K626 kirkyaird - 81 freq kirkyard - 24 freq kirkyerd - 2 freq kirk-yaird - 4 freq kirkyairds - 10 freq kirkyaird-hoast - 1 freq kirkyaird's - 1 freq karcher - 1 freq keyworkerlife - 1 freq kerrsremovals - 1 freq |
MetaPhone code - KRKYRT kirkyaird - 81 freq kirkyard - 24 freq kirkyerd - 2 freq kirk-yaird - 4 freq |
KIRKYARD kirkyaird - 81 freq kirkyard - 24 freq kirkyairds - 10 freq kirkyerd - 2 freq kirkyards - freq kirkyaird's - 1 freq kirk-yaird - 4 freq |
| Time to execute Levenshtein function - 0.199316 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.368075 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.027822 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.037511 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.001014 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. |