| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lissenin (0) - 6 freq lissnin (1) - 2 freq listenin (1) - 176 freq lessenin (1) - 1 freq rissenin (1) - 1 freq lstenin (2) - 1 freq lissens (2) - 2 freq listenan (2) - 9 freq kirsenin (2) - 1 freq lissen (2) - 10 freq listenin' (2) - 2 freq lissened (2) - 1 freq glistenin (2) - 5 freq lippenin (2) - 29 freq leistenin (2) - 1 freq glissnin (2) - 1 freq listienin (2) - 1 freq discenin (2) - 1 freq loosenin (2) - 2 freq listenit (2) - 1 freq lissnen (2) - 1 freq listnin (2) - 5 freq listening (2) - 47 freq likenin (2) - 2 freq lessened (3) - 1 freq |
lissenin (0) - 6 freq lessenin (1) - 1 freq lissnin (1) - 2 freq lissnen (2) - 1 freq rissenin (2) - 1 freq listenin (2) - 176 freq listienin (3) - 1 freq glissnin (3) - 1 freq listnin (3) - 5 freq leistenin (3) - 1 freq loosenin (3) - 2 freq lissened (3) - 1 freq lissen (3) - 10 freq lissens (3) - 2 freq lstenin (3) - 1 freq listenan (3) - 9 freq lessen (4) - 10 freq lissance (4) - 1 freq listnen (4) - 1 freq lessens (4) - 1 freq lessened (4) - 1 freq lossen (4) - 1 freq lossin (4) - 32 freq listening (4) - 47 freq discenin (4) - 1 freq |
SoundEx code - L255 like-myndit - 2 freq loosenin - 2 freq lissenin - 6 freq liegeman - 1 freq like-mindit - 3 freq lugmince's - 1 freq lugmince - 2 freq lissnin - 2 freq likenin - 2 freq lessenin - 1 freq likeminded - 1 freq lissnen - 1 freq luggin-in - 2 freq loosening - 1 freq loosewomen - 1 freq lichenometry - 1 freq |
MetaPhone code - LSNN loosenin - 2 freq lissenin - 6 freq lissnin - 2 freq lessenin - 1 freq lissnen - 1 freq |
LISSENIN |
| Time to execute Levenshtein function - 0.264341 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.407143 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.028814 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.040403 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.000978 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. |