| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lfrmr (0) - 1 freq lrmy (2) - 1 freq tfrm (2) - 1 freq ofrer (2) - 1 freq lir (3) - 16 freq alarms (3) - 2 freq laer (3) - 1 freq airer (3) - 1 freq later (3) - 550 freq limo (3) - 9 freq marmor (3) - 2 freq lire (3) - 2 freq limn (3) - 2 freq lum (3) - 139 freq flr (3) - 3 freq 'free (3) - 3 freq larry (3) - 105 freq afroe (3) - 1 freq frw (3) - 1 freq afaur (3) - 4 freq lager (3) - 38 freq lrst (3) - 1 freq rmv (3) - 1 freq norma (3) - 2 freq urr (3) - 43 freq |
lfrmr (0) - 1 freq fermer (4) - 194 freq lorimer (4) - 30 freq farmer (4) - 9 freq firmer (4) - 4 freq former (4) - 38 freq ofrer (4) - 1 freq tfrm (4) - 1 freq lrmy (4) - 1 freq lifier (5) - 1 freq farer (5) - 1 freq farms (5) - 2 freq murmer (5) - 2 freq hermer (5) - 1 freq lorrimer (5) - 1 freq limmer (5) - 19 freq furm (5) - 20 freq lorry (5) - 14 freq fermi (5) - 5 freq warmer (5) - 25 freq airmor (5) - 1 freq dormer (5) - 2 freq murmur (5) - 6 freq frump (5) - 1 freq fremt (5) - 1 freq |
SoundEx code - L165 labyrinth - 22 freq lipperin - 8 freq labourin - 3 freq lipperan - 2 freq laburnum - 1 freq life-rent - 1 freq labyrinthine - 1 freq leverin - 2 freq labyrinths - 1 freq labour-men - 1 freq labouring - 2 freq labourin' - 1 freq life-worn - 1 freq lawbourin - 3 freq labour-intensive - 1 freq lfrmr - 1 freq libran - 1 freq loveworms - 1 freq 'laverni' - 1 freq 'liverni' - 1 freq |
MetaPhone code - LFRMR lfrmr - 1 freq |
LFRMR |
| Time to execute Levenshtein function - 0.206810 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.358827 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.028307 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.046165 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.001152 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. |