| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| utq (0) - 2 freq otq (1) - 2 freq uth (1) - 1 freq utv (1) - 1 freq uq (1) - 2 freq uiq (1) - 2 freq utb (1) - 1 freq utd (1) - 11 freq utj (1) - 1 freq ut (1) - 9 freq tq (1) - 2 freq uaq (1) - 1 freq tp (2) - 5 freq 'tt (2) - 4 freq ita (2) - 10 freq itc (2) - 1 freq usta (2) - 1 freq usb (2) - 2 freq un (2) - 31 freq its (2) - 3335 freq rwq (2) - 2 freq us (2) - 3687 freq ti (2) - 4171 freq uzp (2) - 1 freq 'te (2) - 1 freq |
utq (0) - 2 freq tq (1) - 2 freq otq (1) - 2 freq ut (2) - 9 freq uth (2) - 1 freq toq (2) - 1 freq utj (2) - 1 freq uaq (2) - 1 freq utv (2) - 1 freq uq (2) - 2 freq uiq (2) - 2 freq utd (2) - 11 freq utb (2) - 1 freq ett (3) - 97 freq yaq (3) - 1 freq tw (3) - 6 freq itz (3) - 2 freq mtqu (3) - 1 freq tql (3) - 1 freq itv (3) - 4 freq outa (3) - 6 freq mq (3) - 4 freq otz (3) - 1 freq yt (3) - 12 freq xiq (3) - 1 freq |
SoundEx code - U320 uouadays - 1 freq udqa - 1 freq udkja - 1 freq uwtk - 1 freq utq - 2 freq utj - 1 freq uwtx - 1 freq |
MetaPhone code - UTK udqa - 1 freq uwtk - 1 freq utq - 2 freq |
UTQ |
| Time to execute Levenshtein function - 0.208708 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.391616 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.027905 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.039034 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.001070 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. |