| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| memorials (0) - 4 freq memorial (1) - 37 freq memoriam (2) - 5 freq memoriés (2) - 1 freq memorie's (2) - 1 freq memories (2) - 106 freq €”memorials (2) - 1 freq memorised (3) - 1 freq memoirs (3) - 1 freq meemories (3) - 1 freq beirials (3) - 1 freq materials (3) - 60 freq memorable (3) - 10 freq morals (3) - 10 freq tutorials (3) - 3 freq mem'ries (3) - 2 freq mamories (3) - 1 freq memory's (3) - 8 freq memores (3) - 1 freq memorisin (3) - 1 freq manorial (3) - 1 freq memorably (3) - 1 freq immemorial (3) - 1 freq immortals (3) - 2 freq beerials (3) - 4 freq |
memorials (0) - 4 freq memorial (2) - 37 freq memorie's (3) - 1 freq memories (3) - 106 freq immortals (4) - 2 freq materials (4) - 60 freq morals (4) - 10 freq memries (4) - 9 freq memory's (4) - 8 freq mamories (4) - 1 freq meemories (4) - 1 freq €”memorials (4) - 1 freq memoriés (4) - 1 freq memores (4) - 1 freq memorise (4) - 2 freq memoirs (4) - 1 freq memoriam (4) - 5 freq admirals (5) - 2 freq morales (5) - 1 freq gomerils (5) - 5 freq murals (5) - 8 freq minerals (5) - 4 freq numerals (5) - 4 freq memers (5) - 1 freq medials (5) - 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 - MMRLS memorials - 4 freq €”memorials - 1 freq |
MEMORIALS |
| Time to execute Levenshtein function - 0.237452 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.349725 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.027186 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.036700 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.000823 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. |