| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| monie-leidit (0) - 1 freq mony-heidit (3) - 1 freq wan-leidit (4) - 1 freq one-leggit (4) - 1 freq ae-leidit (4) - 1 freq blondie-heidit (4) - 1 freq three-leidit (4) - 2 freq brosie-heidit (4) - 4 freq monie-leiditness (4) - 1 freq multi-leidit (4) - 1 freq blonde-heidit (4) - 3 freq tousie-heidit (4) - 2 freq hie-heidit (4) - 1 freq tow-heidit (5) - 1 freq big-heidit (5) - 3 freq sappie-heidit (5) - 4 freq hale-heidit (5) - 5 freq moneylender (5) - 2 freq sodie-heid (5) - 1 freq condescendit (5) - 1 freq tuim-heidit (5) - 4 freq bee-heidit (5) - 1 freq bowdie-leggit (5) - 1 freq pig-heidit (5) - 1 freq twa-leidit (5) - 15 freq |
monie-leidit (0) - 1 freq mony-heidit (4) - 1 freq wan-leidit (5) - 1 freq ae-leidit (6) - 1 freq multi-leidit (6) - 1 freq tousie-heidit (7) - 2 freq twa-leidit (7) - 15 freq doun-loadit (7) - 1 freq doon-loadit (7) - 4 freq monieplied (7) - 1 freq hie-heidit (7) - 1 freq three-leidit (7) - 2 freq one-leggit (7) - 1 freq monie-leiditness (7) - 1 freq lang-heidit (8) - 15 freq mell-heidit (8) - 1 freq muin-licht (8) - 1 freq peerie-heidit (8) - 4 freq fair-heidit (8) - 2 freq snake-heidit (8) - 1 freq mouldit (8) - 1 freq moldit (8) - 2 freq mniled (8) - 1 freq concludit (8) - 7 freq rid-heidit (8) - 2 freq |
SoundEx code - M543 mummled - 11 freq mummelt - 13 freq moonlit - 5 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 - MNLTT monie-leidit - 1 freq |
MONIE-LEIDIT |
| Time to execute Levenshtein function - 0.324568 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.544074 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.030894 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.046173 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.001047 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. |