| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| esquierdo (0) - 1 freq squerr (4) - 2 freq squiled (4) - 1 freq squeermt (4) - 2 freq enquirin (4) - 3 freq esquiline (4) - 1 freq wierdo (4) - 1 freq swuird (4) - 14 freq squid (4) - 1 freq squirmt (4) - 1 freq enquired (4) - 9 freq squeed (4) - 1 freq enquire (4) - 4 freq squirts (4) - 1 freq squeers (4) - 1 freq swuirds (4) - 6 freq squirt (4) - 4 freq enquirt (4) - 1 freq squirrel (4) - 43 freq squere (4) - 1 freq squire (4) - 2 freq ex-utero (4) - 1 freq enquires (4) - 5 freq enquiry (4) - 7 freq squirm (4) - 5 freq |
esquierdo (0) - 1 freq squared (5) - 6 freq squeed (5) - 1 freq squirt (5) - 4 freq squire (5) - 2 freq squirm (5) - 5 freq enquired (5) - 9 freq squere (5) - 1 freq squeers (5) - 1 freq squerr (5) - 2 freq squiled (5) - 1 freq swuird (5) - 14 freq squid (5) - 1 freq assured (6) - 30 freq squaiked (6) - 8 freq swurd (6) - 5 freq spiered (6) - 182 freq shaerd (6) - 2 freq acquired (6) - 10 freq squars (6) - 1 freq squad (6) - 38 freq squares (6) - 17 freq serd (6) - 1 freq requered (6) - 1 freq squalid (6) - 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 - ESKRT escort - 3 freq aess-cairt - 1 freq esquierdo - 1 freq essikert - 1 freq |
ESQUIERDO |
| Time to execute Levenshtein function - 0.205388 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.368277 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.029488 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.043982 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.001326 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. |