| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assure (0) - 21 freq assurt (1) - 1 freq asure (1) - 1 freq assume (1) - 25 freq assuret (1) - 4 freq assured (1) - 30 freq pasture (2) - 11 freq ashore (2) - 35 freq 'sure (2) - 6 freq issue (2) - 100 freq allure (2) - 2 freq insure (2) - 2 freq assuired (2) - 1 freq assumes (2) - 4 freq assuir (2) - 2 freq shure (2) - 12 freq afure (2) - 2 freq ensure (2) - 19 freq misure (2) - 8 freq assuires (2) - 1 freq swure (2) - 3 freq reassure (2) - 12 freq €œsure (2) - 1 freq azure (2) - 3 freq ssre (2) - 1 freq |
assure (0) - 21 freq assuir (2) - 2 freq ssre (2) - 1 freq assuret (2) - 4 freq assured (2) - 30 freq assurt (2) - 1 freq asure (2) - 1 freq assume (2) - 25 freq assert (3) - 7 freq apsire (3) - 1 freq assie (3) - 1 freq unsure (3) - 6 freq assize (3) - 1 freq maisure (3) - 1 freq sture (3) - 6 freq aspire (3) - 4 freq asseer (3) - 1 freq ussr (3) - 3 freq assuage (3) - 3 freq sure (3) - 1001 freq missure (3) - 1 freq assyse (3) - 1 freq fissure (3) - 1 freq 'sure (3) - 6 freq misure (3) - 8 freq |
SoundEx code - A260 agree - 159 freq assure - 21 freq assuir - 2 freq aisier - 12 freq azr - 1 freq ashore - 35 freq augury - 1 freq aggro - 3 freq aesir - 4 freq aiger - 2 freq ashaor - 1 freq ashoar - 3 freq accur - 1 freq acroo - 1 freq acre - 20 freq ajar - 4 freq azor - 4 freq asher - 1 freq azariah - 2 freq aser - 1 freq aesier - 13 freq acquire - 3 freq azure - 3 freq acer - 1 freq aikeray - 2 freq a'haacro - 1 freq auskerry - 1 freq akker - 1 freq asseer - 1 freq ackir - 1 freq acair - 1 freq asseir - 1 freq augur - 1 freq €™azur - 1 freq aesyir - 1 freq acher - 1 freq agr - 1 freq augher - 1 freq agri - 1 freq ajr - 1 freq ajer - 2 freq asure - 1 freq |
MetaPhone code - ASR assure - 21 freq assuir - 2 freq aisier - 12 freq azr - 1 freq azor - 4 freq azariah - 2 freq aser - 1 freq azure - 3 freq acer - 1 freq asseer - 1 freq asseir - 1 freq €™azur - 1 freq asure - 1 freq |
ASSURE |
| Time to execute Levenshtein function - 0.204427 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.339152 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.028087 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.041998 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.001230 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. |