| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lavender (0) - 58 freq 'lavender (1) - 1 freq laedder (2) - 1 freq livener (2) - 1 freq lavender's (2) - 4 freq lender (2) - 2 freq lander (2) - 13 freq avenger (2) - 1 freq avenues (3) - 5 freq bender (3) - 4 freq daener (3) - 2 freq lairner (3) - 5 freq capener (3) - 36 freq rander (3) - 2 freq tender (3) - 23 freq avever (3) - 1 freq leader (3) - 58 freq lavee (3) - 1 freq launer (3) - 1 freq slander (3) - 3 freq daunder (3) - 40 freq landed (3) - 67 freq laeter (3) - 1 freq callender (3) - 1 freq gender (3) - 19 freq |
lavender (0) - 58 freq 'lavender (2) - 1 freq lender (3) - 2 freq lander (3) - 13 freq livener (3) - 1 freq alexender (4) - 1 freq balvinder (4) - 20 freq vendor (4) - 1 freq lunder (4) - 1 freq laedder (4) - 1 freq avenger (4) - 1 freq lavender's (4) - 4 freq asunder (5) - 5 freq daander (5) - 1 freq anunder (5) - 44 freq defender (5) - 5 freq laidder (5) - 10 freq landers (5) - 10 freq laanded (5) - 5 freq likener (5) - 1 freq ngender (5) - 1 freq landen (5) - 1 freq blender (5) - 3 freq landet (5) - 5 freq waander (5) - 5 freq |
SoundEx code - L153 lippent - 13 freq lavender - 58 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 - 58 freq 'lavender - 1 freq |
LAVENDER |
| Time to execute Levenshtein function - 0.288578 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.503430 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.027926 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.069177 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.000820 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. |