| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| acrm (0) - 1 freq acre (1) - 20 freq arm (1) - 52 freq acum (1) - 1 freq airm (1) - 358 freq acks (2) - 11 freq atrim (2) - 1 freq wirm (2) - 17 freq rm (2) - 11 freq ard (2) - 4 freq acid (2) - 6 freq karm (2) - 2 freq tairm (2) - 13 freq cfm (2) - 1 freq ack (2) - 42 freq amm (2) - 1 freq aem (2) - 1 freq acis (2) - 3 freq cra (2) - 2 freq arrr (2) - 2 freq waurm (2) - 1 freq arb (2) - 4 freq ahmm (2) - 1 freq aert (2) - 45 freq adam (2) - 189 freq |
acrm (0) - 1 freq cram (2) - 2 freq crum (2) - 1 freq airm (2) - 358 freq crem (2) - 2 freq arm (2) - 52 freq acre (2) - 20 freq acum (2) - 1 freq acorn (3) - 2 freq acrid (3) - 1 freq army (3) - 82 freq cr (3) - 8 freq com (3) - 134 freq creme (3) - 1 freq craem (3) - 1 freq ancrum (3) - 1 freq harm (3) - 22 freq firm (3) - 67 freq cim (3) - 5 freq hairm (3) - 63 freq herm (3) - 51 freq cum (3) - 643 freq wairm (3) - 46 freq icam (3) - 1 freq garm (3) - 1 freq |
SoundEx code - A265 assurance - 6 freq asseerin - 1 freq agreement - 36 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 - AKRM acrm - 1 freq aquarium - 3 freq akram - 1 freq |
ACRM |
| Time to execute Levenshtein function - 0.183129 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.363102 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.037885 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.041928 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.000923 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. |