| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| queer-lookin (0) - 1 freq queer-lookan (1) - 1 freq queer-luikin (2) - 1 freq queer-leukin (2) - 1 freq queerluikin (3) - 1 freq gweed-lookin (3) - 1 freq queer-lyeukin (3) - 1 freq unco-lookin (4) - 1 freq owerlookin (4) - 4 freq square-lookin (4) - 1 freq rum-lookin (4) - 1 freq fine-lookin (4) - 2 freq guid-lookin (4) - 4 freq queer-like (4) - 5 freq creepy-lookin (4) - 1 freq tender-lookin (4) - 1 freq baitter-lookin (5) - 1 freq daft-lookin (5) - 1 freq tough-lookin (5) - 1 freq radge-lookin (5) - 2 freq ill-lookin (5) - 3 freq overlooking (5) - 2 freq frail-lookin (5) - 1 freq ower-luikin (5) - 1 freq sarky-lookin (5) - 1 freq |
queer-lookin (0) - 1 freq queer-lookan (1) - 1 freq queer-leukin (2) - 1 freq queer-luikin (2) - 1 freq queer-lyeukin (3) - 1 freq queerluikin (4) - 1 freq queer-like (5) - 5 freq square-lookin (5) - 1 freq creepy-lookin (6) - 1 freq oorie-lookin (6) - 1 freq ower-luikin (6) - 1 freq guid-lookin (6) - 4 freq gweed-lookin (6) - 1 freq owerlookin (6) - 4 freq rum-lookin (6) - 1 freq fine-lookin (6) - 2 freq unco-lookin (6) - 1 freq queerlik (7) - 1 freq waxy-lookin (7) - 1 freq odd-lookin (7) - 1 freq braw-lookin (7) - 4 freq sair-leukin (7) - 1 freq iver-lovin (7) - 1 freq queerlike (7) - 3 freq prood-lookin (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 |
QUEER-LOOKIN |
| Time to execute Levenshtein function - 0.216255 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.552555 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.029299 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.066370 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.000869 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. |