| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| memorable (0) - 10 freq memorably (1) - 1 freq meesrable (2) - 2 freq meeserable (3) - 6 freq memorial (3) - 37 freq memorie (3) - 13 freq meisurable (3) - 2 freq meiserable (3) - 1 freq bearable (3) - 5 freq miserable (3) - 57 freq remerkable (3) - 4 freq morale (3) - 6 freq reperable (3) - 1 freq temporale (3) - 1 freq remarkable (3) - 14 freq mermarble (3) - 1 freq desirable (3) - 4 freq merble (3) - 2 freq inexorable (3) - 1 freq membrane (3) - 3 freq venerable (3) - 1 freq adorable (3) - 8 freq meeracle (3) - 5 freq memore (3) - 3 freq memorise (3) - 2 freq |
memorable (0) - 10 freq memorably (1) - 1 freq meesrable (3) - 2 freq miserable (4) - 57 freq merble (4) - 2 freq meiserable (4) - 1 freq meisurable (4) - 2 freq mermarble (4) - 1 freq meeserable (4) - 6 freq memorial (4) - 37 freq meeserably (5) - 1 freq immoral (5) - 5 freq memorials (5) - 4 freq memorise (5) - 2 freq mairble (5) - 4 freq miserably (5) - 3 freq marble (5) - 21 freq memore (5) - 3 freq mumble (5) - 3 freq immutable (5) - 1 freq immoveable (5) - 1 freq meeracle (5) - 5 freq remarkable (5) - 14 freq bearable (5) - 5 freq reperable (5) - 1 freq |
SoundEx code - M561 memorable - 10 freq mau-maurebellion-kenyan-victims-compensation-claim - 1 freq mainnerable - 1 freq memorably - 1 freq |
MetaPhone code - MMRBL memorable - 10 freq memorably - 1 freq |
MEMORABLE |
| Time to execute Levenshtein function - 0.226405 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.377075 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.028518 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.041143 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.000990 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. |