| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| asseerin (0) - 1 freq steerin (2) - 46 freq a-seekin (2) - 1 freq sneerin (2) - 2 freq assertin (2) - 2 freq aswerin (2) - 1 freq assessin (2) - 4 freq sweerin (2) - 12 freq answerin (2) - 21 freq asseert (2) - 1 freq speerin (2) - 9 freq asseer (2) - 1 freq usherin (3) - 2 freq gleerin (3) - 1 freq agreein (3) - 8 freq steedin (3) - 1 freq seenin (3) - 1 freq assertit (3) - 2 freq seemin (3) - 14 freq steerins (3) - 5 freq sweepin (3) - 15 freq steekin (3) - 10 freq steerie (3) - 2 freq festerin (3) - 5 freq asseir (3) - 1 freq |
asseerin (0) - 1 freq sweerin (3) - 12 freq asseer (3) - 1 freq aswerin (3) - 1 freq asseert (3) - 1 freq assertin (3) - 2 freq steerin (3) - 46 freq sneerin (3) - 2 freq speerin (3) - 9 freq swearin (4) - 16 freq severin (4) - 1 freq spierin (4) - 23 freq sweirin (4) - 16 freq spearin (4) - 1 freq serrin (4) - 5 freq speirin (4) - 166 freq assert (4) - 7 freq soberin (4) - 2 freq saberin (4) - 1 freq searin (4) - 4 freq sneeran (4) - 1 freq sheeriin (4) - 1 freq steeren (4) - 2 freq aspirin (4) - 3 freq aistern (4) - 2 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 - ASRN asseerin - 1 freq |
ASSEERIN |
| Time to execute Levenshtein function - 0.227158 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.362227 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.030007 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.038310 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.000822 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. |