| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lavender (0) - 57 freq 'lavender (1) - 1 freq avenger (2) - 1 freq lender (2) - 2 freq lavender's (2) - 4 freq livener (2) - 1 freq lander (2) - 13 freq laedder (2) - 1 freq likener (3) - 1 freq tender (3) - 23 freq landers (3) - 10 freq €˜gender (3) - 1 freq daunder (3) - 40 freq lunder (3) - 1 freq larder (3) - 9 freq zander (3) - 43 freq sander (3) - 1 freq fuvende (3) - 1 freq veneer (3) - 1 freq daenner (3) - 1 freq bender (3) - 5 freq vendor (3) - 1 freq laeter (3) - 1 freq daener (3) - 2 freq sender (3) - 2 freq |
lavender (0) - 57 freq 'lavender (2) - 1 freq livener (3) - 1 freq lander (3) - 13 freq lender (3) - 2 freq lunder (4) - 1 freq balvinder (4) - 20 freq alexender (4) - 1 freq vendor (4) - 1 freq avenger (4) - 1 freq lavender's (4) - 4 freq laedder (4) - 1 freq landry (5) - 1 freq leader (5) - 59 freq landet (5) - 5 freq livelier (5) - 1 freq callender (5) - 1 freq landed (5) - 70 freq render (5) - 8 freq lauder (5) - 6 freq gender (5) - 19 freq blender (5) - 3 freq leyder (5) - 1 freq calendar (5) - 23 freq daander (5) - 1 freq |
SoundEx code - L153 lippent - 13 freq lavender - 57 freq loup-hunter - 1 freq leavin't - 2 freq loaf-ends - 2 freq lippend - 1 freq 'lavender - 1 freq lavender's - 4 freq leavent - 1 freq lippened - 11 freq lovematch - 1 freq life-mate - 1 freq lavin-time - 1 freq |
MetaPhone code - LFNTR lavender - 57 freq 'lavender - 1 freq |
LAVENDER |
| Time to execute Levenshtein function - 0.243190 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.414939 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.035342 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.046352 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.000847 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. |