| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| itet (0) - 1 freq item (1) - 17 freq tet (1) - 1 freq itt (1) - 2 freq ite (1) - 3 freq it't (1) - 1 freq baet (2) - 27 freq motet (2) - 3 freq it' (2) - 32 freq cited (2) - 3 freq txt (2) - 8 freq iste (2) - 1 freq iwer (2) - 5 freq licet (2) - 1 freq ieed (2) - 1 freq iden (2) - 2 freq seet (2) - 5 freq stat (2) - 1 freq att (2) - 451 freq cite (2) - 2 freq itsa (2) - 1 freq spet (2) - 1 freq itc (2) - 1 freq gteat (2) - 1 freq fittet (2) - 3 freq |
itet (0) - 1 freq itt (1) - 2 freq tet (1) - 1 freq tot (2) - 4 freq tit (2) - 26 freq tat (2) - 16 freq ett (2) - 97 freq teat (2) - 1 freq yitt (2) - 1 freq tite (2) - 2 freq tt (2) - 36 freq tut (2) - 67 freq ytt (2) - 1 freq att (2) - 451 freq teet (2) - 13 freq ott (2) - 4 freq ite (2) - 3 freq item (2) - 17 freq it't (2) - 1 freq lite (3) - 3 freq geet (3) - 10 freq meet (3) - 349 freq its (3) - 3335 freq votet (3) - 1 freq yitey (3) - 3 freq |
SoundEx code - I330 ithout - 11 freq idiot - 24 freq ithoot - 53 freq idoot - 1 freq itida - 1 freq €˜ithoot - 3 freq 'ithoot - 1 freq €™ithoot - 6 freq €˜idiot - 1 freq €œidiot - 1 freq idot - 1 freq itet - 1 freq |
MetaPhone code - ITT it'd - 67 freq idiot - 24 freq idoot - 1 freq 'it'd - 1 freq itida - 1 freq it't - 1 freq €˜idiot - 1 freq €œidiot - 1 freq idot - 1 freq itÂ’d - 3 freq id'd - 1 freq itet - 1 freq |
ITET |
| Time to execute Levenshtein function - 0.178631 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.325209 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.027034 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.036982 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.000894 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. |