| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ecairriet (0) - 1 freq ecairrit (1) - 1 freq eairriet (1) - 1 freq cairriet (1) - 70 freq hairriet (2) - 2 freq cairrien (2) - 1 freq carriet (2) - 15 freq eairrit (2) - 3 freq 'cairrie (2) - 1 freq mairriet (2) - 55 freq cairries (2) - 36 freq cairiet (2) - 7 freq cairret (2) - 2 freq cairried (2) - 143 freq cairrier (2) - 13 freq nairriet (2) - 1 freq cairrit (2) - 27 freq cairrie (2) - 35 freq cairryit (3) - 2 freq nairret (3) - 4 freq ecairted (3) - 1 freq cairie (3) - 4 freq nairrie (3) - 1 freq ecairry (3) - 1 freq cairryen (3) - 2 freq |
ecairriet (0) - 1 freq cairriet (1) - 70 freq ecairrit (1) - 1 freq cairrit (2) - 27 freq cairret (2) - 2 freq carriet (2) - 15 freq eairriet (2) - 1 freq cairrier (3) - 13 freq nairriet (3) - 1 freq cairryt (3) - 1 freq carret (3) - 3 freq cairrie (3) - 35 freq cairried (3) - 143 freq cairryit (3) - 2 freq eairrit (3) - 3 freq cairiet (3) - 7 freq hairriet (3) - 2 freq cairrien (3) - 1 freq cairries (3) - 36 freq mairriet (3) - 55 freq cairier (4) - 1 freq hairrit (4) - 1 freq ecairriage (4) - 1 freq harriet (4) - 1 freq cairtie (4) - 12 freq |
SoundEx code - E263 exertin - 1 freq ecairt-wheels - 1 freq ecairrit - 1 freq escort - 3 freq esartshall - 1 freq exertion - 4 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 - EKRT ecairrit - 1 freq ekurt - 1 freq ecairriet - 1 freq |
ECAIRRIET |
| Time to execute Levenshtein function - 0.186530 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.339602 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.027201 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.036986 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.000793 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. |