| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| moonlit (0) - 4 freq hoondit (2) - 1 freq mootit (2) - 1 freq moonlight (2) - 3 freq oolit (2) - 2 freq moorit (2) - 8 freq mooslim (2) - 1 freq foondit (2) - 41 freq muinlit (2) - 1 freq soondit (2) - 61 freq soonit (2) - 1 freq moonie (2) - 1 freq moonlicht (2) - 8 freq roondit (2) - 13 freq doonsit (2) - 1 freq mountit (2) - 9 freq coontit (2) - 30 freq moontin (2) - 13 freq woondit (2) - 1 freq moont (2) - 22 freq booncin (3) - 10 freq hookit (3) - 1 freq molip (3) - 1 freq boondin (3) - 1 freq mornnin (3) - 1 freq |
moonlit (0) - 4 freq muinlit (2) - 1 freq moont (3) - 22 freq mountit (3) - 9 freq montie (4) - 1 freq meinit (4) - 28 freq myntit (4) - 3 freq mantit (4) - 2 freq muntit (4) - 3 freq minnit (4) - 5 freq mankit (4) - 8 freq menit (4) - 2 freq sinlit (4) - 1 freq modelt (4) - 1 freq monolith (4) - 2 freq wanlit (4) - 4 freq myndit (4) - 28 freq morality (4) - 8 freq marlit (4) - 1 freq mendit (4) - 9 freq mynit (4) - 1 freq monoglot (4) - 3 freq haunlit (4) - 1 freq mannit (4) - 2 freq manglit (4) - 3 freq |
SoundEx code - M543 mummled - 11 freq mummelt - 13 freq moonlit - 4 freq monolith - 2 freq mummlet - 2 freq monolithic - 4 freq monie-leiditness - 1 freq mummlit - 2 freq mummilt - 1 freq muinlit - 1 freq monie-leidit - 1 freq |
MetaPhone code - MNLT moonlit - 4 freq mniled - 1 freq muinlit - 1 freq |
MOONLIT |
| Time to execute Levenshtein function - 0.179612 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.322843 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.026625 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.036511 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.000939 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. |