| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| loaf-ends (0) - 2 freq fag-ends (3) - 1 freq forfends (3) - 1 freq loanens (3) - 4 freq road-end (3) - 3 freq offends (3) - 1 freq lends (4) - 9 freq dowp-end (4) - 2 freq loudens (4) - 1 freq loads (4) - 87 freq lag-en (4) - 2 freq fiends (4) - 2 freq leaf-veins (4) - 1 freq lowdens (4) - 4 freq amends (4) - 3 freq loaves (4) - 5 freq loafer (4) - 1 freq boatmens (4) - 3 freq fends (4) - 5 freq afens (4) - 2 freq fat-end (4) - 1 freq lyfienes (4) - 1 freq launds (4) - 19 freq offrands (4) - 1 freq loanen (4) - 22 freq |
loaf-ends (0) - 2 freq offends (5) - 1 freq fag-ends (5) - 1 freq legends (6) - 36 freq offrands (6) - 1 freq launds (6) - 19 freq lyfienes (6) - 1 freq bed-ends (6) - 1 freq boyfriends (6) - 2 freq lawlands (6) - 4 freq defends (6) - 1 freq leigends (6) - 1 freq laands (6) - 2 freq fends (6) - 5 freq lowlands (6) - 5 freq lands (6) - 59 freq fiends (6) - 2 freq forfends (6) - 1 freq road-end (6) - 3 freq lends (6) - 9 freq leaf-veins (6) - 1 freq loanens (6) - 4 freq hint-ends (7) - 1 freq loanins (7) - 7 freq laens (7) - 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 - LFNTS loaf-ends - 2 freq |
LOAF-ENDS |
| Time to execute Levenshtein function - 0.202889 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.397986 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.028679 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.039168 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.000924 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. |