| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| queer-lookan (0) - 1 freq queer-lookin (1) - 1 freq queer-luikin (3) - 1 freq queer-leukin (3) - 1 freq queerluikin (4) - 1 freq queer-lyeukin (4) - 1 freq queer-like (4) - 5 freq gweed-lookin (4) - 1 freq square-lookin (5) - 1 freq tender-lookin (5) - 1 freq owerlookin (5) - 4 freq unco-lookin (5) - 1 freq queerlike (5) - 3 freq queenamoan (5) - 1 freq creepy-lookin (5) - 1 freq rum-lookin (5) - 1 freq guid-lookin (5) - 4 freq queerlik (5) - 1 freq fine-lookin (5) - 2 freq ill-lookin (6) - 3 freq owerlook (6) - 1 freq lookan (6) - 30 freq daft-lookin (6) - 1 freq queestion (6) - 17 freq seeslogan (6) - 1 freq |
queer-lookan (0) - 1 freq queer-lookin (1) - 1 freq queer-leukin (3) - 1 freq queer-luikin (3) - 1 freq queer-lyeukin (4) - 1 freq queer-like (5) - 5 freq queerluikin (5) - 1 freq square-lookin (6) - 1 freq guid-lookin (7) - 4 freq rum-lookin (7) - 1 freq queerlik (7) - 1 freq ower-luikin (7) - 1 freq oorie-lookin (7) - 1 freq fine-lookin (7) - 2 freq creepy-lookin (7) - 1 freq gweed-lookin (7) - 1 freq owerlookin (7) - 4 freq unco-lookin (7) - 1 freq queerlike (7) - 3 freq quaet-like (8) - 2 freq quiet-like (8) - 5 freq sair-leukin (8) - 1 freq waxy-lookin (8) - 1 freq quarrelan (8) - 2 freq braw-lookin (8) - 4 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 |
QUEER-LOOKAN |
| Time to execute Levenshtein function - 0.202527 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.412586 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.028185 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.039325 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.000907 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. |