| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| abject (0) - 1 freq object (1) - 75 freq inject (2) - 4 freq abet (2) - 1 freq affect (2) - 10 freq eject (2) - 1 freq oobject (2) - 1 freq adjecf (2) - 1 freq abjoot (2) - 1 freq subject (2) - 157 freq abiech (2) - 3 freq abduct (2) - 1 freq reject (2) - 11 freq abeit (2) - 1 freq objects (2) - 43 freq objeck (2) - 18 freq absent (2) - 12 freq aspect (2) - 21 freq aspeck (3) - 13 freq advent (3) - 8 freq elect (3) - 9 freq apert (3) - 12 freq rejeck (3) - 2 freq affeck (3) - 7 freq bpecs (3) - 1 freq |
abject (0) - 1 freq object (1) - 75 freq oobject (2) - 1 freq abjoot (3) - 1 freq reject (3) - 11 freq subject (3) - 157 freq eject (3) - 1 freq inject (3) - 4 freq objeck (3) - 18 freq objects (3) - 43 freq abduct (3) - 1 freq objectin (4) - 1 freq objeckit (4) - 1 freq objected (4) - 2 freq aspect (4) - 21 freq objick (4) - 1 freq objectit (4) - 1 freq abiech (4) - 3 freq abeit (4) - 1 freq affect (4) - 10 freq absent (4) - 12 freq abet (4) - 1 freq adjecf (4) - 1 freq jeit (5) - 2 freq adjust (5) - 10 freq |
SoundEx code - A122 abacus - 2 freq abuses - 4 freq apaches - 3 freq abgezählte - 1 freq abject - 1 freq afchistory - 1 freq abscess - 3 freq abcess - 2 freq abbswise - 2 freq |
MetaPhone code - ABJKT abject - 1 freq |
ABJECT |
| Time to execute Levenshtein function - 0.180424 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.343346 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.027199 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.037370 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.000864 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. |