| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| memorial (0) - 37 freq memoriam (1) - 5 freq memorials (1) - 4 freq memorise (2) - 2 freq manorial (2) - 1 freq immemorial (2) - 1 freq memories (2) - 106 freq memorie (2) - 13 freq amoral (3) - 1 freq temporal (3) - 8 freq memorisin (3) - 1 freq memor (3) - 1 freq melodical (3) - 1 freq material (3) - 86 freq emorra (3) - 1 freq memoir (3) - 3 freq gomoral (3) - 1 freq serial (3) - 3 freq memory' (3) - 1 freq mortal (3) - 54 freq memorie's (3) - 1 freq beerial (3) - 10 freq moral (3) - 88 freq memory's (3) - 8 freq aerial (3) - 5 freq |
memorial (0) - 37 freq memorials (2) - 4 freq memoriam (2) - 5 freq immoral (3) - 5 freq memories (3) - 106 freq memorie (3) - 13 freq memorise (3) - 2 freq immemorial (3) - 1 freq manorial (3) - 1 freq memries (4) - 9 freq immortal (4) - 19 freq 'moral (4) - 1 freq memrie (4) - 5 freq mamories (4) - 1 freq memorable (4) - 10 freq meemories (4) - 1 freq memory (4) - 166 freq memoirs (4) - 1 freq memorably (4) - 1 freq mayoral (4) - 1 freq memores (4) - 1 freq memore (4) - 3 freq moral (4) - 88 freq gomoral (4) - 1 freq material (4) - 86 freq |
SoundEx code - M564 mineral - 8 freq memorial - 37 freq minerals - 4 freq memorials - 4 freq mannerly - 1 freq mennerly - 2 freq manorial - 1 freq €”memorials - 1 freq minerwell - 1 freq |
MetaPhone code - MMRL memorial - 37 freq |
MEMORIAL |
| Time to execute Levenshtein function - 0.187893 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.332389 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.027247 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.037178 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.000847 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. |