| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| terraces (0) - 4 freq terrace (1) - 24 freq terracin (2) - 2 freq traces (2) - 6 freq terrains (2) - 1 freq merrynes (3) - 2 freq nerrae (3) - 2 freq serrated (3) - 1 freq terence (3) - 1 freq services (3) - 66 freq herries (3) - 4 freq trace (3) - 35 freq terre (3) - 1 freq sorraes (3) - 3 freq menaces (3) - 1 freq teries (3) - 1 freq berries (3) - 25 freq tracks (3) - 49 freq replaces (3) - 1 freq refracts (3) - 1 freq traeces (3) - 1 freq enrages (3) - 2 freq tracts (3) - 4 freq errants (3) - 4 freq morrices (3) - 6 freq |
terraces (0) - 4 freq terrace (2) - 24 freq terrains (3) - 1 freq traces (3) - 6 freq terracin (3) - 2 freq tirricks (4) - 5 freq traeces (4) - 1 freq morrices (4) - 6 freq terrs (4) - 1 freq turra's (4) - 1 freq torres (4) - 1 freq terrors (4) - 3 freq terriers (4) - 1 freq torrs (5) - 2 freq werrocks (5) - 1 freq traced (5) - 14 freq terrafeet (5) - 1 freq fornaces (5) - 2 freq termes (5) - 1 freq torrance (5) - 1 freq terreg (5) - 1 freq races (5) - 17 freq eerrans (5) - 1 freq interfaces (5) - 1 freq terrain (5) - 10 freq |
SoundEx code - T622 traces - 6 freq turkish - 23 freq triggest - 1 freq trackies - 8 freq tragic - 16 freq turquoise - 4 freq terraces - 4 freq targes - 2 freq tarshish - 1 freq torche's - 1 freq torches - 14 freq tracy's - 1 freq torsos - 1 freq tricycle - 2 freq tregijo - 13 freq 'tregijo - 1 freq 'turkish - 1 freq turkeys - 3 freq trochs - 5 freq turkey's - 1 freq trokes - 1 freq troughs - 4 freq trosky's - 1 freq tresses - 1 freq turkeesh - 1 freq traeces - 1 freq torquoise - 1 freq trossachs - 7 freq tharsis - 1 freq tras-os-montes - 1 freq tragically - 2 freq trajectory - 4 freq tragicomic - 1 freq thiriggies - 1 freq turkistan - 2 freq trashcan - 1 freq traceysmith - 1 freq |
MetaPhone code - TRSS traces - 6 freq dresses - 18 freq terraces - 4 freq tracy's - 1 freq torsos - 1 freq doris's - 3 freq tresses - 1 freq traeces - 1 freq |
TERRACES |
| Time to execute Levenshtein function - 0.199012 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.356613 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.027372 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.038246 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.000811 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. |