| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assumin (0) - 10 freq assuman (1) - 1 freq assuming (1) - 6 freq resumin (2) - 1 freq assumed (2) - 12 freq assume (2) - 25 freq 'assuming (2) - 1 freq unassumin (2) - 2 freq assumet (2) - 1 freq assuir (2) - 2 freq soumin (2) - 2 freq assumt (2) - 1 freq sumin (2) - 6 freq assumes (2) - 4 freq spuin (3) - 7 freq issymil (3) - 3 freq saemin (3) - 1 freq passin (3) - 156 freq 'suhin (3) - 1 freq assure (3) - 21 freq shamin (3) - 2 freq slumpin (3) - 3 freq abuin (3) - 346 freq autumn (3) - 60 freq assie (3) - 1 freq |
assumin (0) - 10 freq assuman (1) - 1 freq assuming (2) - 6 freq soumin (3) - 2 freq assumt (3) - 1 freq assumes (3) - 4 freq assumet (3) - 1 freq sumin (3) - 6 freq unassumin (3) - 2 freq assumed (3) - 12 freq assume (3) - 25 freq resumin (3) - 1 freq issin (4) - 1 freq subsumin (4) - 1 freq summin (4) - 36 freq skymin (4) - 1 freq asseerin (4) - 1 freq somin (4) - 1 freq soomin (4) - 7 freq sumyin (4) - 1 freq assemlie (4) - 7 freq seemin (4) - 15 freq easslin (4) - 1 freq essayin (4) - 1 freq stymin (4) - 1 freq |
SoundEx code - A255 assuming - 6 freq aa-kennin - 3 freq asinine - 2 freq assumin - 10 freq auchmannoch - 1 freq assonance - 1 freq awesomeness - 2 freq aagmint - 1 freq 'assuming - 1 freq aisement - 2 freq aisment - 1 freq ajynin - 1 freq augmentin - 1 freq agiements - 1 freq awaukenin - 3 freq awakenin - 2 freq agamemnon's - 2 freq assuman - 1 freq augment - 2 freq awakening - 1 freq awakenings - 1 freq acoming - 1 freq assinments - 1 freq ajmomauntieann - 1 freq |
MetaPhone code - ASMN assumin - 10 freq assuman - 1 freq |
ASSUMIN |
| Time to execute Levenshtein function - 0.182578 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.323733 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.027509 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.038322 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.000871 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. |