Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
assonance (0) - 1 freq assurance (2) - 6 freq resonance (2) - 5 freq allooance (3) - 1 freq resonances (3) - 1 freq ossomancy (3) - 1 freq assurances (3) - 2 freq allouance (3) - 3 freq aroonwance (3) - 1 freq assistance (3) - 10 freq askance (3) - 6 freq allowance (3) - 14 freq arrogance (3) - 9 freq annoyance (3) - 12 freq esh-lance (4) - 1 freq audiance (4) - 1 freq nance (4) - 7 freq insolence (4) - 4 freq antonine (4) - 2 freq seelance (4) - 1 freq penance (4) - 2 freq essoyne (4) - 1 freq announce (4) - 7 freq reassurance (4) - 5 freq sclance (4) - 1 freq |
assonance (0) - 1 freq resonance (3) - 5 freq assurance (3) - 6 freq ossomancy (4) - 1 freq assistance (5) - 10 freq askance (5) - 6 freq sustinance (5) - 1 freq sustenance (5) - 2 freq essence (5) - 12 freq annoyance (5) - 12 freq assurances (5) - 2 freq resonances (5) - 1 freq manance (6) - 2 freq sassanach (6) - 1 freq 'nance (6) - 1 freq ascendancy (6) - 1 freq finance (6) - 14 freq ordinance (6) - 2 freq anoonce (6) - 1 freq annoonce (6) - 4 freq séance (6) - 1 freq resonant (6) - 1 freq sconce (6) - 2 freq annoyince (6) - 2 freq instance (6) - 158 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 - ASNNS assonance - 1 freq |
ASSONANCE |
Time to execute Levenshtein function - 0.235002 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.380846 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.028933 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.037420 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.000978 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. |