| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| assurance (0) - 6 freq assurances (1) - 2 freq insurance (2) - 17 freq reassurance (2) - 5 freq assonance (2) - 1 freq re-assurance (3) - 1 freq ambulance (3) - 37 freq assure (3) - 20 freq apperance (3) - 2 freq assuage (3) - 3 freq endurance (3) - 3 freq assuman (3) - 1 freq assistance (3) - 10 freq askance (3) - 6 freq asure (4) - 1 freq allouance (4) - 3 freq scunce (4) - 6 freq €œstrange (4) - 1 freq instance (4) - 158 freq esh-lance (4) - 1 freq seance (4) - 2 freq utterance (4) - 4 freq clairance (4) - 1 freq audiance (4) - 1 freq arrogance (4) - 7 freq |
assurance (0) - 6 freq assurances (2) - 2 freq assonance (3) - 1 freq reassurance (3) - 5 freq insurance (3) - 17 freq askance (5) - 6 freq assistance (5) - 10 freq ossomancy (5) - 1 freq essence (5) - 12 freq assuman (5) - 1 freq soverance (5) - 3 freq endurance (5) - 3 freq re-assurance (5) - 1 freq assure (5) - 20 freq apperance (5) - 2 freq appearance (6) - 48 freq torrance (6) - 1 freq occurence (6) - 1 freq france (6) - 84 freq beirance (6) - 1 freq clearance (6) - 16 freq susanne (6) - 1 freq assuredly (6) - 1 freq absence (6) - 20 freq ignorance (6) - 32 freq |
SoundEx code - A265 assurance - 6 freq asseerin - 1 freq agreement - 35 freq assurances - 2 freq ayegreen - 3 freq agrund - 3 freq acorns-only - 1 freq acrm - 1 freq accurense - 1 freq acurren - 1 freq agrun - 1 freq accurenses - 1 freq agreein - 8 freq agreemint - 3 freq aquarium - 3 freq aground - 1 freq acquiring - 1 freq acorns - 1 freq achernar - 1 freq agreements - 2 freq agreean - 1 freq acorn - 2 freq akram - 1 freq aye-growein - 1 freq acquirin - 3 freq aswerin - 1 freq aye-growin - 1 freq ashram - 6 freq €˜ashram - 1 freq akraness - 1 freq aiajrnhh - 1 freq agreement- - 1 freq agreeing - 2 freq askramsey - 1 freq acrimonious - 1 freq agrandadathome - 6 freq agri-env - 1 freq |
MetaPhone code - ASRNS assurance - 6 freq |
ASSURANCE |
| Time to execute Levenshtein function - 0.371754 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.693251 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.081872 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.038094 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.000766 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. |