| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| escape (0) - 99 freq escapes (1) - 4 freq eschape (1) - 1 freq scape (1) - 1 freq escaped (1) - 28 freq scapa (2) - 10 freq escapade (2) - 2 freq reshape (2) - 1 freq escapit (2) - 5 freq seascape (2) - 1 freq escpae (2) - 1 freq shape (2) - 161 freq snape (2) - 1 freq scope (2) - 12 freq cape (2) - 11 freq escaep (2) - 2 freq scale (2) - 54 freq escapin (2) - 13 freq nescafe (2) - 1 freq scare (2) - 20 freq scrape (2) - 29 freq estate (2) - 88 freq scap (2) - 2 freq smale (3) - 1 freq scarper (3) - 2 freq |
escape (0) - 99 freq scape (1) - 1 freq scap (2) - 2 freq scope (2) - 12 freq escpae (2) - 1 freq escaep (2) - 2 freq scapa (2) - 10 freq escapes (2) - 4 freq eschape (2) - 1 freq escaped (2) - 28 freq scale (3) - 54 freq scaup (3) - 5 freq scare (3) - 20 freq escapin (3) - 13 freq scrape (3) - 29 freq escapade (3) - 2 freq cape (3) - 11 freq seascape (3) - 1 freq escapit (3) - 5 freq snape (3) - 1 freq shape (3) - 161 freq sce (4) - 3 freq sapie (4) - 1 freq slope (4) - 29 freq scrapy (4) - 1 freq |
SoundEx code - E210 escape - 99 freq excep - 14 freq espy - 2 freq eock-a-hoop - 1 freq equip - 1 freq expo - 1 freq eschape - 1 freq escaep - 2 freq eesefu - 3 freq ex-wife - 1 freq escheve - 1 freq egip - 1 freq €™espa - 1 freq escpae - 1 freq eowxf - 1 freq eqvy - 1 freq esp - 10 freq ezb - 1 freq eesfve - 1 freq exp - 1 freq ecb - 1 freq ecv - 1 freq egf - 1 freq |
MetaPhone code - ESKP escape - 99 freq escaep - 2 freq escpae - 1 freq |
ESCAPE |
| Time to execute Levenshtein function - 0.195501 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.323446 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.027221 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.036973 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.000829 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. |