Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
apen-mindit (0) - 1 freq absent-mindit (3) - 1 freq waik-mindit (4) - 1 freq like-mindit (4) - 4 freq open-windae (4) - 1 freq remindit (4) - 7 freq open-haundit (4) - 1 freq yin-mintit (4) - 1 freq ower-hingit (5) - 1 freq mindit (5) - 163 freq ae-leidit (5) - 1 freq peintit (5) - 8 freq un-findin (5) - 1 freq appointit (5) - 4 freq evenhaundit (5) - 1 freq beaminit (5) - 1 freq openin't (5) - 1 freq amendment (5) - 3 freq ill-kindit (5) - 1 freq cute-myndit (5) - 1 freq gran-minnie (5) - 1 freq weel-tendit (5) - 1 freq apenin (5) - 10 freq termintit (5) - 2 freq amendit (5) - 2 freq |
apen-mindit (0) - 1 freq open-haundit (5) - 1 freq yin-mintit (6) - 1 freq open-windae (6) - 1 freq like-mindit (6) - 4 freq absent-mindit (6) - 1 freq waik-mindit (6) - 1 freq cute-myndit (7) - 1 freq apen-mou'd (7) - 1 freq open-handed (7) - 1 freq hauf-myndit (7) - 1 freq like-myndit (7) - 2 freq remindit (7) - 7 freq hie-bendit (8) - 1 freq apprehendit (8) - 1 freq pin-point (8) - 1 freq remindet (8) - 4 freq pennit (8) - 1 freq yin-sidit (8) - 1 freq narrae-mindit (8) - 1 freq pre-eminent (8) - 1 freq apartmint (8) - 3 freq appintmint (8) - 8 freq demandit (8) - 45 freq open-haanded (8) - 1 freq |
SoundEx code - A155 apenin - 10 freq apinion - 1 freq appenin - 3 freq appenan - 3 freq abomination - 5 freq aipenin - 5 freq apen-mindit - 1 freq abomination's - 1 freq abominable - 1 freq apennines - 1 freq abomonation - 1 freq abuinmentionit - 1 freq |
MetaPhone code - APNMNTT apen-mindit - 1 freq |
APEN-MINDIT |
Time to execute Levenshtein function - 0.242179 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.394025 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.027546 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.037567 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.000933 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. |