| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thorow-lik (0) - 1 freq thrawn-lik (3) - 1 freq thrawnlik (3) - 1 freq throwawiy (4) - 1 freq throu-pit (4) - 2 freq throu-lat (4) - 1 freq thorow (4) - 1 freq throw-han (4) - 2 freq throwin (4) - 34 freq throwback (4) - 2 freq thrawn-like (4) - 1 freq thrawnlie (4) - 2 freq joco-lik (4) - 3 freq three-fit (5) - 2 freq shortlie (5) - 1 freq thorslips (5) - 1 freq trawlin (5) - 12 freq throuly (5) - 1 freq thorouness (5) - 1 freq thor'll (5) - 1 freq thortie (5) - 6 freq prowlin (5) - 3 freq throngin (5) - 2 freq thoomin (5) - 2 freq throwan (5) - 4 freq |
thorow-lik (0) - 1 freq thrawnlik (4) - 1 freq thrawn-lik (4) - 1 freq thrawn-like (5) - 1 freq thrawnlie (6) - 2 freq throwback (6) - 2 freq throw-han (6) - 2 freq throu-lat (6) - 1 freq thrawback (7) - 2 freq throwe- (7) - 1 freq thing-like (7) - 1 freq sherp-like (7) - 2 freq thrawnly (7) - 1 freq timorous-like (7) - 1 freq tailor-like (7) - 1 freq shairp-lik (7) - 1 freq thorow (7) - 1 freq throwin (7) - 34 freq throwawiy (7) - 1 freq throu-pit (7) - 2 freq throwt (8) - 1 freq thrower (8) - 1 freq tentie-lik (8) - 2 freq thirty-six (8) - 1 freq thrapplin (8) - 3 freq |
SoundEx code - T642 three-leggit - 2 freq threeleggit - 2 freq trial's - 14 freq trials - 19 freq thirls - 5 freq trellis - 1 freq trails - 14 freq tirlis - 1 freq 'troilus - 1 freq tirls - 4 freq tirelessly - 1 freq threi-legged - 2 freq three-legget - 1 freq threelegget - 1 freq thrills - 6 freq tarelgin - 2 freq trolleys - 4 freq treeless - 3 freq trawls - 2 freq three-leiged - 2 freq twirls - 1 freq trills - 2 freq thirlstane - 1 freq trollach - 1 freq thirlestane - 3 freq trölligarth - 1 freq trollies - 1 freq thorow-lik - 1 freq trolls - 6 freq tireless - 1 freq trilogy - 2 freq trials- - 1 freq turlygod - 4 freq trail's - 1 freq |
MetaPhone code - 0RLK thorow-lik - 1 freq |
THOROW-LIK |
| Time to execute Levenshtein function - 0.212822 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.377745 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.058598 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.038745 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.000898 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. |