| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yard (0) - 43 freq ard (1) - 4 freq yad (1) - 1 freq yare (1) - 1 freq yaud (1) - 2 freq card (1) - 61 freq yards (1) - 24 freq nard (1) - 3 freq yark (1) - 8 freq yrd (1) - 1 freq hard (1) - 782 freq eard (1) - 1 freq yerd (1) - 7 freq yar (1) - 3 freq kyard (1) - 3 freq gard (1) - 4 freq bard (1) - 57 freq lard (1) - 4 freq cyard (1) - 1 freq yird (1) - 204 freq ward (1) - 89 freq sard (1) - 3 freq yarn (1) - 49 freq yaird (1) - 88 freq yarl (1) - 18 freq |
yard (0) - 43 freq ard (1) - 4 freq yrd (1) - 1 freq eard (1) - 1 freq yaird (1) - 88 freq yird (1) - 204 freq yerd (1) - 7 freq rd (2) - 63 freq yarl (2) - 18 freq yarn (2) - 49 freq ird (2) - 1 freq aird (2) - 3 freq arid (2) - 4 freq raid (2) - 25 freq erd (2) - 11 freq raed (2) - 21 freq yirdy (2) - 6 freq rad (2) - 3 freq raod (2) - 2 freq sard (2) - 3 freq ward (2) - 89 freq yards (2) - 24 freq nard (2) - 3 freq card (2) - 61 freq yaud (2) - 2 freq |
SoundEx code - Y630 yaird - 88 freq yird - 204 freq yirth - 41 freq yirdie - 2 freq yirdy - 6 freq yard - 43 freq yerd - 7 freq year'd - 1 freq €˜yirth - 6 freq yrd - 1 freq |
MetaPhone code - YRT yaird - 88 freq yird - 204 freq yirdie - 2 freq yirdy - 6 freq yard - 43 freq wyert - 1 freq yerd - 7 freq year'd - 1 freq |
YARD |
| Time to execute Levenshtein function - 0.188682 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.479426 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.031571 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.084822 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.000895 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. |