Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
adherent (0) - 1 freq adherents (1) - 8 freq adhered (2) - 2 freq coherent (2) - 10 freq inherent (2) - 7 freq adherence (2) - 3 freq adhere (2) - 7 freq degerent (3) - 1 freq atheen (3) - 1 freq adornt (3) - 1 freq apparent (3) - 23 freq unherkent (3) - 1 freq 'here't (3) - 1 freq ahent (3) - 102 freq haterent (3) - 1 freq herkent (3) - 3 freq here't (3) - 2 freq decent (3) - 116 freq referent (3) - 3 freq abhorrent (3) - 2 freq daecent (3) - 8 freq advert (3) - 32 freq reverent (3) - 4 freq derwent (3) - 2 freq werent (3) - 1 freq |
adherent (0) - 1 freq adherents (2) - 8 freq adherence (3) - 3 freq inherent (3) - 7 freq coherent (3) - 10 freq adornt (4) - 1 freq degerent (4) - 1 freq dernt (4) - 1 freq adhered (4) - 2 freq adhere (4) - 7 freq durrant (5) - 2 freq whereat (5) - 1 freq querent (5) - 1 freq ahern (5) - 1 freq darnt (5) - 1 freq herdent (5) - 1 freq deeferent (5) - 4 freq daurnt (5) - 1 freq deiferent (5) - 5 freq dernit (5) - 4 freq adjacent (5) - 6 freq werent (5) - 1 freq emerent (5) - 1 freq advent (5) - 8 freq herkent (5) - 3 freq |
SoundEx code - A365 adorin - 1 freq adrenaline - 20 freq adrienne - 1 freq adherents - 8 freq adherence - 3 freq adherent - 1 freq adornt - 1 freq adorn - 6 freq adorns - 2 freq adorned - 2 freq atrim - 1 freq attorney - 1 freq adrenaline-fueled - 1 freq atrms - 1 freq adoring - 1 freq atremble - 1 freq aitherins - 1 freq aw-terrain - 1 freq adrenalin - 4 freq adornin - 1 freq atrium - 1 freq adornments - 1 freq a-tearin - 1 freq awtroon - 26 freq adrian - 4 freq audreymarks - 2 freq adrianmckinty - 1 freq adrianflux - 1 freq adriandlambert - 1 freq adrianlambert - 2 freq |
MetaPhone code - ATHRNT adherent - 1 freq |
ADHERENT |
Time to execute Levenshtein function - 0.196203 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.379719 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.027824 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.038236 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.000883 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. |