| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| qtme (0) - 1 freq ttme (1) - 1 freq qrme (1) - 1 freq tme (1) - 3 freq 'the (2) - 355 freq atm (2) - 3 freq qmh (2) - 1 freq eame (2) - 1 freq tmj (2) - 1 freq fame (2) - 48 freq tume (2) - 14 freq rome (2) - 35 freq stime (2) - 4 freq €™me (2) - 3 freq stae (2) - 1 freq qmy (2) - 1 freq qmqe (2) - 1 freq nme (2) - 2 freq wme (2) - 1 freq etse (2) - 1 freq kte (2) - 1 freq tye (2) - 9 freq qm (2) - 1 freq toe (2) - 22 freq jtmt (2) - 6 freq |
qtme (0) - 1 freq qrme (2) - 1 freq tme (2) - 3 freq ttme (2) - 1 freq 'time (3) - 4 freq tome (3) - 4 freq tame (3) - 23 freq atmo (3) - 1 freq stame (3) - 8 freq mtm (3) - 1 freq 'tm (3) - 2 freq xtmy (3) - 1 freq qjm (3) - 1 freq qtmvu (3) - 1 freq getme (3) - 1 freq time (3) - 5974 freq tyme (3) - 220 freq qtt (3) - 2 freq htm (3) - 17 freq qm (3) - 1 freq tm (3) - 7 freq qt (3) - 5 freq stime (3) - 4 freq qwmi (3) - 1 freq tume (3) - 14 freq |
SoundEx code - Q350 quieten - 2 freq quaitin - 1 freq quaten - 2 freq quotin - 9 freq quotin' - 1 freq quoitin - 1 freq quhitna - 4 freq quittin - 1 freq queetin - 1 freq quotem - 1 freq quaiten - 1 freq quuttin - 1 freq €œquhitna - 1 freq qtme - 1 freq qdtdm - 1 freq |
MetaPhone code - KTM quotem - 1 freq qtme - 1 freq katm - 1 freq kttm - 1 freq |
QTME |
| Time to execute Levenshtein function - 0.212916 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.742401 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.093758 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.104743 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.001262 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. |