| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lee-lang (0) - 4 freq lee-lane (1) - 6 freq leelang (1) - 3 freq lyfe-lang (2) - 1 freq life-lang (2) - 3 freq lei-lane (2) - 3 freq baelang (3) - 1 freq lifelang (3) - 2 freq legoland (3) - 2 freq bee-line (3) - 3 freq fit-lang (3) - 2 freq leilane (3) - 1 freq seedling (3) - 3 freq geeang (3) - 1 freq feelans (3) - 2 freq reevlan (3) - 2 freq ae-lane (3) - 2 freq leef-alane (3) - 1 freq jet-lag (3) - 1 freq feeling (3) - 64 freq owerlang (3) - 2 freq ley-lanns (3) - 1 freq lee-wark (3) - 1 freq leeving (3) - 1 freq lellan (3) - 1 freq |
lee-lang (0) - 4 freq leelang (2) - 3 freq lee-lane (2) - 6 freq lei-lane (3) - 3 freq lyfe-lang (3) - 1 freq life-lang (3) - 3 freq day-lang (4) - 1 freq year-lang (4) - 3 freq lifelang (4) - 2 freq life-sang (5) - 2 freq lifelong (5) - 4 freq sea-sang (5) - 1 freq lellan (5) - 1 freq heidlang (5) - 4 freq endlang (5) - 4 freq headlang (5) - 2 freq leeving (5) - 1 freq belang (5) - 86 freq leeing (5) - 1 freq beelong (5) - 1 freq ower-lang (5) - 1 freq declang (5) - 1 freq ley-lanns (5) - 1 freq leilane (5) - 1 freq seedling (5) - 3 freq |
SoundEx code - L452 lallans - 136 freq 'lallans' - 3 freq ley-lanns - 1 freq lowlans - 1 freq lee-lang - 4 freq leelang - 3 freq lallans' - 1 freq lawlans - 6 freq 'lallans - 1 freq low-lying - 1 freq lallanses - 1 freq €˜lallans - 4 freq €œlallans - 2 freq lywlnhzckw - 1 freq lulinspector - 1 freq lilyyinnes - 1 freq |
MetaPhone code - LLNK lee-lang - 4 freq leelang - 3 freq |
LEE-LANG |
| Time to execute Levenshtein function - 0.387812 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.603185 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.028607 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.067598 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.000908 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. |