| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| queerluikin (0) - 1 freq queer-luikin (1) - 1 freq queerlik (3) - 1 freq queerlike (3) - 3 freq queer-lookin (3) - 1 freq queer-leukin (3) - 1 freq owerluikin (3) - 6 freq queelin (4) - 1 freq ower-luikin (4) - 1 freq owerluikit (4) - 2 freq fine-luikin (4) - 1 freq queer-like (4) - 5 freq queeryin (4) - 1 freq queer-lookan (4) - 1 freq weel-luikin (4) - 1 freq queer-lyeukin (4) - 1 freq queerly (5) - 1 freq queeried (5) - 3 freq queerie (5) - 8 freq ill-luikin (5) - 1 freq luikin (5) - 201 freq ferliein (5) - 3 freq owerluikt (5) - 1 freq unnerlinin (5) - 2 freq squeelin (5) - 2 freq |
queerluikin (0) - 1 freq queer-luikin (2) - 1 freq owerluikin (4) - 6 freq queer-lookin (4) - 1 freq queer-leukin (4) - 1 freq queerlike (4) - 3 freq queerlik (4) - 1 freq queer-lyeukin (5) - 1 freq queer-lookan (5) - 1 freq owerlookin (6) - 4 freq owerleukin (6) - 4 freq dearleukin (6) - 1 freq queeryin (6) - 1 freq ower-luikin (6) - 1 freq queelin (6) - 1 freq queer-like (6) - 5 freq owerluikit (6) - 2 freq quietlike (7) - 10 freq €˜luikin (7) - 1 freq owerluik (7) - 2 freq quaetlike (7) - 1 freq ye-raikin (7) - 1 freq owerkeikin (7) - 1 freq owerluiked (7) - 2 freq quietlik (7) - 1 freq |
SoundEx code - Q642 queer-lookin - 1 freq queer-luikin - 1 freq queerluikin - 1 freq queer-like - 5 freq queerlike - 3 freq queer-leukin - 1 freq queer-lookan - 1 freq queer-lyeukin - 1 freq quarrels - 1 freq queerlik - 1 freq |
MetaPhone code - KRLKN queer-lookin - 1 freq queer-luikin - 1 freq queerluikin - 1 freq queer-leukin - 1 freq queer-lookan - 1 freq cròileagain - 1 freq |
QUEERLUIKIN |
| Time to execute Levenshtein function - 0.206923 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.392741 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.027816 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.038855 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.000954 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. |