| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assume (0) - 24 freq assumes (1) - 4 freq assumt (1) - 1 freq assumet (1) - 1 freq assumed (1) - 12 freq assure (1) - 20 freq assured (2) - 30 freq assumin (2) - 10 freq a'sum (2) - 1 freq assie (2) - 1 freq awsome (2) - 2 freq aesum (2) - 2 freq spume (2) - 3 freq assuret (2) - 4 freq assuir (2) - 2 freq assyse (2) - 1 freq resume (2) - 6 freq sume (2) - 2 freq astute (2) - 1 freq assurt (2) - 1 freq assam (2) - 1 freq issue (2) - 99 freq assize (2) - 1 freq aesome (2) - 6 freq assuage (2) - 3 freq |
assume (0) - 24 freq assam (2) - 1 freq assumes (2) - 4 freq assumed (2) - 12 freq assure (2) - 20 freq assumt (2) - 1 freq assumet (2) - 1 freq assize (3) - 1 freq issue (3) - 99 freq sume (3) - 2 freq ssm (3) - 1 freq assuman (3) - 1 freq sesame (3) - 2 freq resume (3) - 6 freq soume (3) - 1 freq assuage (3) - 3 freq aesome (3) - 6 freq awsome (3) - 2 freq assie (3) - 1 freq assumin (3) - 10 freq assyse (3) - 1 freq aesum (3) - 2 freq a'sum (3) - 1 freq assuir (3) - 2 freq spume (3) - 3 freq |
SoundEx code - A250 again - 2645 freq askin - 176 freq agin - 700 freq agane - 334 freq aesum - 2 freq aesome - 6 freq axiom - 1 freq akin - 11 freq agony - 19 freq awauken - 5 freq awkin - 2 freq aknow - 1 freq assume - 24 freq again- - 1 freq ashen - 2 freq ackin - 5 freq aixin - 1 freq again' - 6 freq acan - 1 freq achan - 2 freq aksin - 13 freq achin - 14 freq agonie - 4 freq ayginee - 1 freq asken - 4 freq agayn - 4 freq askin' - 5 freq asian - 13 freq acne - 1 freq ae-same - 1 freq aisan - 1 freq axin - 25 freq agnne - 1 freq akim - 2 freq agane' - 1 freq aye-gaun - 1 freq azwiéhin - 1 freq agaen - 24 freq ax'in - 1 freq agnew - 1 freq 'awesome - 1 freq achim - 2 freq a'sum - 1 freq aekin - 1 freq ¬‚aggan - 1 freq ageen - 111 freq a-goin - 1 freq awesome - 35 freq agein - 13 freq acheen - 1 freq askan - 10 freq aisin - 1 freq awaw-gaun - 1 freq aesin - 2 freq agen - 12 freq assam - 1 freq awsome - 2 freq aiken - 11 freq aakin - 3 freq aegean - 4 freq aye-gauin - 1 freq agyen - 2 freq agaiun - 1 freq ayegaun - 1 freq a-sayin - 1 freq agin- - 1 freq awoken - 2 freq asma - 1 freq aw-seein - 2 freq awaken - 1 freq agun - 1 freq €˜ajami - 1 freq aegin - 1 freq aigan - 1 freq €™again - 2 freq ahsan - 1 freq aken - 1 freq again” - 1 freq agm - 2 freq agam - 1 freq awsom - 1 freq aoxnu - 1 freq acum - 1 freq asn - 1 freq agno - 1 freq acnh - 2 freq ajm - 1 freq aquiania - 1 freq axemn - 1 freq awqhn - 1 freq |
MetaPhone code - ASM assume - 24 freq a'sum - 1 freq assam - 1 freq awsome - 2 freq asma - 1 freq awsom - 1 freq |
ASSUME |
| Time to execute Levenshtein function - 0.224691 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.327165 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.028409 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.040556 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.000946 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. |