| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| queen-sized (0) - 1 freq green-niled (4) - 1 freq queeried (4) - 3 freq queer-shaped (4) - 1 freq queer-like (4) - 5 freq bite-sized (4) - 1 freq life-sized (4) - 1 freq ower-sized (4) - 1 freq queen-it (4) - 1 freq queenies (4) - 1 freq bairn-sized (4) - 1 freq queenie (4) - 3 freq breath-sized (5) - 1 freq squeezed (5) - 27 freq queenis (5) - 1 freq tree-lined (5) - 2 freq queens (5) - 40 freq undersized (5) - 2 freq neep-shed (5) - 1 freq queesitive (5) - 1 freq queen'd (5) - 1 freq oversized (5) - 4 freq queeksilver (5) - 1 freq queerlike (5) - 3 freq weel-iled (5) - 1 freq |
queen-sized (0) - 1 freq life-sized (6) - 1 freq ower-sized (6) - 1 freq bite-sized (6) - 1 freq bairn-sized (6) - 1 freq man-size (7) - 1 freq yin-sided (7) - 2 freq wan-sided (7) - 2 freq queenies (7) - 1 freq queen-it (7) - 1 freq fair-sized (7) - 2 freq ham-sized (7) - 1 freq queer-shaped (7) - 1 freq feeneshed (8) - 2 freq een-tide (8) - 1 freq funsize (8) - 1 freq life-size (8) - 2 freq queen- (8) - 1 freq queen's (8) - 55 freq fantasized (8) - 1 freq ae-sided (8) - 2 freq weel-uised (8) - 1 freq share-sized (8) - 1 freq feenished (8) - 166 freq queensbury (8) - 1 freq |
SoundEx code - Q522 queen-sized - 1 freq quinces - 1 freq queencactus - 1 freq |
MetaPhone code - KNSST consist - 6 freq queen-sized - 1 freq qounzset - 1 freq |
QUEEN-SIZED |
| Time to execute Levenshtein function - 0.222897 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.433973 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.028886 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.039452 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.000953 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. |