| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| larder (0) - 9 freq lauder (1) - 6 freq warder (1) - 3 freq larger (1) - 3 freq harder (1) - 67 freq yarder (1) - 1 freq farder (1) - 31 freq oarder (1) - 5 freq ladder (1) - 35 freq lander (1) - 13 freq laded (2) - 1 freq wander (2) - 36 freq lgarden (2) - 1 freq farrer (2) - 27 freq balder (2) - 1 freq launer (2) - 1 freq louder (2) - 40 freq parker (2) - 19 freq haurder (2) - 18 freq dander (2) - 61 freq border (2) - 145 freq furder (2) - 53 freq lawyer (2) - 33 freq laser (2) - 4 freq earner (2) - 2 freq |
larder (0) - 9 freq farder (2) - 31 freq oarder (2) - 5 freq lander (2) - 13 freq yarder (2) - 1 freq ladder (2) - 35 freq harder (2) - 67 freq lauder (2) - 6 freq warder (2) - 3 freq larger (2) - 3 freq faarder (3) - 1 freq girder (3) - 2 freq ledder (3) - 23 freq learner (3) - 7 freq lender (3) - 2 freq aalder (3) - 24 freq lairger (3) - 9 freq forder (3) - 95 freq leader (3) - 58 freq order (3) - 271 freq nearder (3) - 1 freq ferder (3) - 10 freq alder (3) - 1 freq looder (3) - 36 freq boarder (3) - 5 freq |
SoundEx code - L636 larder - 9 freq laird-run - 1 freq |
MetaPhone code - LRTR larder - 9 freq |
LARDER |
| Time to execute Levenshtein function - 0.184251 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.463408 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.027306 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.070401 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.001039 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. |