| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| unmeanan (0) - 1 freq bemeanan (2) - 1 freq meanan (2) - 12 freq unmovan (3) - 1 freq unlearn (3) - 2 freq unenin (3) - 1 freq uneaten (3) - 1 freq unean (3) - 1 freq unecan (3) - 1 freq nearan (3) - 1 freq sneakan (3) - 2 freq demeanin (3) - 3 freq moanan (3) - 1 freq cleanan (3) - 2 freq meanen (3) - 1 freq meanin (3) - 201 freq bemeanin (3) - 2 freq unreason (3) - 1 freq unkennin (3) - 3 freq undeeman (3) - 2 freq leanan (3) - 4 freq unlearnin (3) - 1 freq unread (4) - 3 freq spreadan (4) - 2 freq nearhan (4) - 28 freq |
unmeanan (0) - 1 freq bemeanan (3) - 1 freq meanan (3) - 12 freq meanen (4) - 1 freq meanin (4) - 201 freq demeanin (4) - 3 freq bemeanin (4) - 2 freq moanan (4) - 1 freq unenin (4) - 1 freq unmovan (4) - 1 freq inmaname (5) - 1 freq inginan (5) - 1 freq meinin (5) - 1 freq uncanny (5) - 9 freq 'moanin (5) - 1 freq meaneen (5) - 18 freq meynen (5) - 1 freq remainan (5) - 2 freq mann (5) - 15 freq menna (5) - 3 freq meenin (5) - 1 freq antennae (5) - 2 freq menin (5) - 2 freq meinen (5) - 1 freq wumann (5) - 1 freq |
SoundEx code - U555 un-announced - 1 freq unannounced - 1 freq unanimous - 2 freq unmeanan - 1 freq unenin - 1 freq unanimously - 3 freq |
MetaPhone code - UNMNN unmeanan - 1 freq |
UNMEANAN |
| Time to execute Levenshtein function - 0.208133 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.361220 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.027605 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.037034 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.000883 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. |