| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| abomonation (0) - 1 freq abomination (1) - 5 freq 'coronation (3) - 1 freq abomination's (3) - 1 freq coronation (3) - 8 freq admonition (3) - 3 freq domination (3) - 1 freq nomination (3) - 1 freq adoration (4) - 6 freq commination (4) - 2 freq promotion (4) - 21 freq crocanation (4) - 1 freq admiration (4) - 14 freq absolution (4) - 3 freq dominatin (4) - 6 freq aberration (4) - 2 freq acoontin (4) - 1 freq coronatioun (4) - 1 freq exemination (4) - 1 freq animation (4) - 6 freq admonitions (4) - 1 freq non-nation (4) - 1 freq culmination (4) - 3 freq ammunition (4) - 8 freq molocation (4) - 1 freq |
abomonation (0) - 1 freq abomination (1) - 5 freq nomination (4) - 1 freq domination (4) - 1 freq admonition (4) - 3 freq exemination (5) - 1 freq dominatin (5) - 6 freq lamination (5) - 1 freq nominatin (5) - 1 freq ammunition (5) - 8 freq damnation (5) - 3 freq examination (5) - 8 freq abomination's (5) - 1 freq coronation (5) - 8 freq abdication (6) - 1 freq absentin (6) - 1 freq intonation (6) - 11 freq abjuration (6) - 1 freq combination (6) - 23 freq moontin (6) - 13 freq mention (6) - 147 freq emanatin (6) - 3 freq automation (6) - 1 freq exeminatioun (6) - 1 freq bayonetin (6) - 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 - ABMNXN abomination - 5 freq abomonation - 1 freq |
ABOMONATION |
| Time to execute Levenshtein function - 0.221393 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.427958 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.027717 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.038752 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.000919 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. |