| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sharger (0) - 1 freq charger (1) - 7 freq sharged (1) - 1 freq shagger (1) - 1 freq sharper (1) - 1 freq shargered (2) - 1 freq stanger (2) - 1 freq shoarter (2) - 1 freq shargeret (2) - 8 freq scarper (2) - 2 freq scarier (2) - 1 freq sharpek (2) - 1 freq sharet (2) - 3 freq shalter (2) - 4 freq changer (2) - 3 freq shaner (2) - 3 freq sharped (2) - 1 freq shaker (2) - 1 freq shorter (2) - 24 freq shanner (2) - 1 freq share (2) - 285 freq share' (2) - 1 freq shargit (2) - 2 freq hargey (2) - 7 freq harper (2) - 3 freq |
sharger (0) - 1 freq charger (2) - 7 freq shergar (2) - 1 freq sharper (2) - 1 freq shagger (2) - 1 freq sharged (2) - 1 freq shargin (3) - 1 freq shorter (3) - 24 freq chairger (3) - 2 freq sherper (3) - 2 freq shargs (3) - 1 freq sharg (3) - 2 freq shargit (3) - 2 freq shearer (3) - 4 freq shugger (3) - 4 freq shairper (3) - 3 freq shargeret (3) - 8 freq shoarter (3) - 1 freq shargered (3) - 1 freq shairer (3) - 1 freq sharpe (4) - 10 freq shares (4) - 27 freq swagger (4) - 14 freq starmer (4) - 3 freq sharkey (4) - 1 freq |
SoundEx code - S626 sorcerer' - 1 freq sorcerer's - 1 freq scourger - 2 freq surgery - 29 freq scarecrow - 5 freq scorcher - 4 freq scroag-airch't - 1 freq shargered - 1 freq sorcery - 1 freq scarecraw - 3 freq schwarzer - 1 freq surgeries - 1 freq scorecard - 3 freq surchargit - 1 freq sharger - 1 freq shargeret - 8 freq surcharge - 1 freq sorcerer - 1 freq screechyer - 1 freq sarasheridan - 11 freq scoresjournal - 3 freq shergar - 1 freq |
MetaPhone code - XRJR chairger - 2 freq charger - 7 freq sharger - 1 freq |
SHARGER |
| Time to execute Levenshtein function - 0.189411 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.373233 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.028026 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.038899 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.000914 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. |