| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aquarium (0) - 3 freq aquavit (3) - 1 freq atrium (3) - 1 freq squarish (3) - 1 freq squarie (3) - 1 freq quantum (3) - 5 freq squarin (3) - 1 freq alarum (3) - 1 freq aquaint (3) - 4 freq quorum (3) - 1 freq aurum (3) - 1 freq squaring (3) - 1 freq aquatic (3) - 1 freq dualism (4) - 1 freq quait (4) - 131 freq quakin (4) - 3 freq laburnum (4) - 1 freq aquad (4) - 1 freq palladium (4) - 1 freq aboorum (4) - 1 freq urzum (4) - 1 freq aqueous (4) - 1 freq quality (4) - 138 freq varius (4) - 1 freq aatum (4) - 1 freq |
aquarium (0) - 3 freq quorum (3) - 1 freq atrium (4) - 1 freq alarum (4) - 1 freq aurum (4) - 1 freq quiri (5) - 1 freq arrum (5) - 7 freq querious (5) - 2 freq squirm (5) - 5 freq alarm (5) - 42 freq atrim (5) - 1 freq quares (5) - 1 freq warum (5) - 5 freq tarim (5) - 1 freq purim (5) - 1 freq qualm (5) - 2 freq queried (5) - 4 freq quare (5) - 245 freq quarry (5) - 61 freq quarely (5) - 5 freq quarz (5) - 2 freq squarin (5) - 1 freq aquaint (5) - 4 freq quairs (5) - 3 freq quantum (5) - 5 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 |
AQUARIUM |
| Time to execute Levenshtein function - 0.214931 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.378049 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.028170 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.037002 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.000922 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. |