| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| agreement (0) - 35 freq 'greement (1) - 13 freq greement (1) - 20 freq agreement- (1) - 1 freq agreemint (1) - 3 freq agreements (1) - 2 freq griement (2) - 1 freq 'greements (2) - 2 freq airgiement (3) - 2 freq greenest (3) - 2 freq atonement (3) - 1 freq agreeing (3) - 2 freq arrengment (3) - 1 freq amusement (3) - 6 freq agreeit (3) - 2 freq airgyment (3) - 6 freq agreet (3) - 17 freq argiment (3) - 2 freq argyment (3) - 2 freq argiement (3) - 25 freq agreean (3) - 1 freq greent (3) - 1 freq agreein (3) - 8 freq preezent (3) - 1 freq amazement (3) - 5 freq |
agreement (0) - 35 freq agreemint (1) - 3 freq greement (1) - 20 freq agreements (2) - 2 freq griement (2) - 1 freq agreement- (2) - 1 freq 'greement (2) - 13 freq greent (4) - 1 freq 'greements (4) - 2 freq garment (4) - 1 freq airgument (5) - 6 freq ameesement (5) - 2 freq disagreement (5) - 3 freq aisement (5) - 2 freq abatement (5) - 1 freq argument (5) - 80 freq ferment (5) - 3 freq augment (5) - 2 freq remant (5) - 1 freq raiment (5) - 2 freq gradient (5) - 1 freq agiements (5) - 1 freq remeent (5) - 2 freq goverment (5) - 30 freq govrement (5) - 1 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 - AKRMNT agreement - 35 freq agreemint - 3 freq agreement- - 1 freq |
AGREEMENT |
| Time to execute Levenshtein function - 0.230988 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.438313 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.032615 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.041032 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.000870 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. |