| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| adopts (0) - 1 freq adopt (1) - 11 freq depts (2) - 3 freq dots (2) - 8 freq adapt (2) - 6 freq admits (2) - 2 freq adoptit (2) - 14 freq adopted (2) - 13 freq doots (2) - 35 freq douts (2) - 18 freq aboots (2) - 15 freq adoptin (2) - 5 freq dorts (2) - 8 freq adonis (2) - 3 freq adoptet (2) - 1 freq adept (2) - 2 freq dowts (2) - 4 freq adults (2) - 49 freq adorns (2) - 2 freq aiorts (2) - 1 freq dolts (2) - 2 freq awopls (2) - 1 freq adores (2) - 2 freq adoptid (2) - 1 freq dope (3) - 11 freq |
adopts (0) - 1 freq depts (2) - 3 freq adopt (2) - 11 freq adoptet (3) - 1 freq dorts (3) - 8 freq adept (3) - 2 freq dolts (3) - 2 freq adoptin (3) - 5 freq adults (3) - 49 freq dowts (3) - 4 freq adoptid (3) - 1 freq adoptit (3) - 14 freq dots (3) - 8 freq adapt (3) - 6 freq adopted (3) - 13 freq admits (3) - 2 freq douts (3) - 18 freq doots (3) - 35 freq pyots (4) - 2 freq poats (4) - 2 freq pots (4) - 46 freq spots (4) - 31 freq doobts (4) - 1 freq dists (4) - 1 freq adoption (4) - 16 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 - ATPTS adopts - 1 freq |
ADOPTS |
| Time to execute Levenshtein function - 0.194757 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.389643 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.027191 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.036948 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.000948 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. |