| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adept (0) - 2 freq dept (1) - 7 freq adopt (1) - 11 freq adapt (1) - 6 freq appt (2) - 1 freq anet (2) - 1 freq stept (2) - 4 freq deft (2) - 4 freq apt (2) - 45 freq depp (2) - 1 freq alert (2) - 17 freq advert (2) - 32 freq adead (2) - 1 freq dep (2) - 2 freq lept (2) - 2 freq det (2) - 3 freq aweet (2) - 1 freq deat (2) - 1 freq aldest (2) - 1 freq ahent (2) - 102 freq debt (2) - 45 freq adult (2) - 64 freq adews (2) - 1 freq dent (2) - 4 freq avert (2) - 1 freq |
adept (0) - 2 freq adopt (1) - 11 freq adapt (1) - 6 freq dept (1) - 7 freq depot (2) - 1 freq deet (3) - 24 freq adopts (3) - 1 freq sept (3) - 7 freq dopyt (3) - 1 freq adult (3) - 64 freq cept (3) - 25 freq dent (3) - 4 freq deputy (3) - 6 freq delt (3) - 3 freq wept (3) - 7 freq admit (3) - 100 freq nept (3) - 1 freq inept (3) - 1 freq debt (3) - 45 freq depth (3) - 23 freq adeptly (3) - 2 freq apt (3) - 45 freq depp (3) - 1 freq kept (3) - 510 freq deft (3) - 4 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 |
ADEPT |
| Time to execute Levenshtein function - 0.212919 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.329851 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.028056 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.036975 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.004569 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. |