| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adapt (0) - 6 freq adept (1) - 2 freq adopt (1) - 11 freq drapt (2) - 35 freq anat (2) - 1 freq rapt (2) - 1 freq alaft (2) - 2 freq dart (2) - 16 freq adair (2) - 1 freq ada (2) - 4 freq damt (2) - 2 freq adays (2) - 3 freq admit (2) - 100 freq agape (2) - 2 freq soapt (2) - 1 freq avant (2) - 1 freq avast (2) - 3 freq dant (2) - 1 freq stapt (2) - 30 freq adams (2) - 9 freq addet (2) - 25 freq anaht (2) - 1 freq apart (2) - 115 freq addit (2) - 97 freq atap (2) - 23 freq |
adapt (0) - 6 freq adopt (1) - 11 freq adept (1) - 2 freq dept (2) - 7 freq heapt (3) - 1 freq dap (3) - 1 freq lapt (3) - 3 freq depot (3) - 1 freq adult (3) - 64 freq leapt (3) - 11 freq adopts (3) - 1 freq apt (3) - 45 freq papt (3) - 6 freq adaptit (3) - 6 freq appt (3) - 1 freq adapted (3) - 2 freq daupit (3) - 3 freq dopyt (3) - 1 freq dat (3) - 1391 freq inapt (3) - 1 freq dampt (3) - 3 freq adaptin (3) - 1 freq dalt (3) - 1 freq daft (3) - 444 freq hapt (3) - 5 freq |
SoundEx code - A313 adoption - 16 freq adapted - 2 freq adoptit - 14 freq adopt - 11 freq adopted - 13 freq adaptabeility - 1 freq adoptin - 5 freq adapt - 6 freq adoptet - 1 freq adaption - 1 freq adoptin' - 2 freq adaptit - 6 freq adaptin - 1 freq adoptive - 1 freq adoppit - 1 freq adaptation - 4 freq adoptions - 2 freq adaptable - 1 freq adeptly - 2 freq adept - 2 freq adoptid - 1 freq adaptabilitee - 1 freq adoptagreyhound - 1 freq adaptivecoach - 1 freq adopts - 1 freq |
MetaPhone code - ATPT adopt - 11 freq adapt - 6 freq adoppit - 1 freq adept - 2 freq |
ADAPT |
| Time to execute Levenshtein function - 0.241914 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.423430 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.028751 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.039455 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.000959 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. |