| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yarder (0) - 1 freq farder (1) - 31 freq oarder (1) - 5 freq larder (1) - 9 freq harder (1) - 67 freq warder (1) - 3 freq yaer (2) - 1 freq garde (2) - 1 freq yonder (2) - 67 freq yare (2) - 1 freq parler (2) - 2 freq yarned (2) - 2 freq harper (2) - 3 freq farer (2) - 1 freq wadder (2) - 21 freq girder (2) - 2 freq wander (2) - 41 freq yammer (2) - 5 freq larger (2) - 3 freq yirders (2) - 2 freq lander (2) - 13 freq oardert (2) - 3 freq ladder (2) - 35 freq border (2) - 145 freq yardarm (2) - 1 freq |
yarder (0) - 1 freq oarder (1) - 5 freq order (2) - 277 freq raider (2) - 1 freq oardir (2) - 1 freq warder (2) - 3 freq farder (2) - 31 freq harder (2) - 67 freq larder (2) - 9 freq yunder (3) - 10 freq oarders (3) - 2 freq yorker (3) - 1 freq ardern (3) - 1 freq eader (3) - 1 freq vader (3) - 3 freq alder (3) - 1 freq aider (3) - 2 freq faarder (3) - 1 freq faeder (3) - 4 freq murder (3) - 86 freq rander (3) - 2 freq herder (3) - 3 freq aalder (3) - 24 freq arden (3) - 2 freq forder (3) - 97 freq |
SoundEx code - Y636 yairdairm - 1 freq yirders - 2 freq yarder - 1 freq yardarm - 1 freq |
MetaPhone code - YRTR yarder - 1 freq |
YARDER |
| Time to execute Levenshtein function - 0.199392 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.355340 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.028087 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.037045 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.000881 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. |