| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| escortit (0) - 2 freq scornit (2) - 1 freq escorted (2) - 1 freq escort (2) - 3 freq scootit (2) - 3 freq scartit (2) - 23 freq exportit (2) - 1 freq snortit (2) - 16 freq sortit (2) - 51 freq assortit (2) - 3 freq escorts (2) - 1 freq scoutit (2) - 1 freq snirtit (3) - 2 freq courtit (3) - 1 freq scrartit (3) - 1 freq scotlit (3) - 38 freq startit (3) - 157 freq snortin (3) - 13 freq ectit (3) - 1 freq deportit (3) - 1 freq exportin (3) - 6 freq coortit (3) - 5 freq scort (3) - 1 freq scantit (3) - 1 freq escalatit (3) - 1 freq |
escortit (0) - 2 freq scartit (2) - 23 freq sortit (3) - 51 freq scoutit (3) - 1 freq snortit (3) - 16 freq escorts (3) - 1 freq assortit (3) - 3 freq scornit (3) - 1 freq escorted (3) - 1 freq escort (3) - 3 freq scootit (3) - 3 freq sortet (4) - 4 freq skartit (4) - 8 freq sclatit (4) - 1 freq scurrit (4) - 2 freq scuttit (4) - 2 freq scotti (4) - 2 freq scentit (4) - 2 freq spartit (4) - 2 freq scrit (4) - 6 freq scott (4) - 309 freq assertit (4) - 2 freq scottie (4) - 3 freq soartit (4) - 1 freq scordet (4) - 1 freq |
SoundEx code - E263 exertin - 1 freq ecairt-wheels - 1 freq ecairrit - 1 freq escort - 3 freq esartshall - 1 freq exertion - 3 freq ecairt-cuddy - 1 freq ecairted - 1 freq exert - 1 freq ekurt - 1 freq exerted - 1 freq escortit - 2 freq ex-scorrie-ation - 1 freq esquierdo - 1 freq exertit - 2 freq ecairriet - 1 freq eco-riots - 2 freq exertions - 2 freq escorts - 1 freq escorted - 1 freq eaccreative - 2 freq |
MetaPhone code - ESKRTT escortit - 2 freq escorted - 1 freq |
ESCORTIT |
| Time to execute Levenshtein function - 0.500198 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.807823 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.076446 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.088211 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.001079 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. |