Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
memorial (0) - 37 freq memoriam (1) - 5 freq memorials (1) - 4 freq immemorial (2) - 1 freq memorie (2) - 13 freq memories (2) - 110 freq memorise (2) - 2 freq manorial (2) - 1 freq emorra (3) - 1 freq memorably (3) - 1 freq tutorial (3) - 2 freq memor (3) - 1 freq memtrie (3) - 1 freq mortal (3) - 54 freq memorable (3) - 10 freq memores (3) - 1 freq serial (3) - 4 freq memoir (3) - 3 freq merrital (3) - 1 freq aerial (3) - 5 freq meemories (3) - 1 freq moral (3) - 88 freq memory' (3) - 1 freq mayoral (3) - 1 freq temporal (3) - 8 freq |
memorial (0) - 37 freq memorials (2) - 4 freq memoriam (2) - 5 freq immoral (3) - 5 freq manorial (3) - 1 freq memorise (3) - 2 freq memorie (3) - 13 freq immemorial (3) - 1 freq memories (3) - 110 freq memory (4) - 170 freq memries (4) - 9 freq material (4) - 86 freq memrie (4) - 5 freq mamories (4) - 1 freq memoirs (4) - 1 freq gomoral (4) - 1 freq immortal (4) - 21 freq mayoral (4) - 1 freq amoral (4) - 1 freq memore (4) - 3 freq 'moral (4) - 1 freq memory' (4) - 1 freq memores (4) - 1 freq memor (4) - 1 freq memorably (4) - 1 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.232740 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.399321 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.027632 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.038254 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.000873 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. |