Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
whurlan (0) - 1 freq whirlan (1) - 1 freq hurlan (1) - 4 freq whurlin (1) - 1 freq whurls (2) - 1 freq whurlit (2) - 1 freq wheelan (2) - 1 freq whorlin (2) - 1 freq hurtan (2) - 1 freq whirran (2) - 1 freq curlan (2) - 2 freq wurkan (2) - 2 freq hurlin (2) - 21 freq whurang (2) - 1 freq whurl (2) - 2 freq whuppan (2) - 1 freq whurled (2) - 1 freq hurla (2) - 1 freq whirlin (2) - 5 freq shetlan (3) - 12 freq howlan (3) - 11 freq harkan (3) - 2 freq heelan (3) - 7 freq whirls (3) - 3 freq hurley (3) - 2 freq |
whurlan (0) - 1 freq whirlan (1) - 1 freq whurlin (1) - 1 freq whirlin (2) - 5 freq whorlin (2) - 1 freq hurlan (2) - 4 freq whurls (3) - 1 freq hurlin (3) - 21 freq whurlit (3) - 1 freq whirran (3) - 1 freq whurl (3) - 2 freq whurled (3) - 1 freq wheelan (3) - 1 freq whaurin (4) - 5 freq wharvin (4) - 1 freq whilin (4) - 1 freq chirlin (4) - 1 freq whalin (4) - 24 freq whirl (4) - 10 freq whorls (4) - 1 freq whirrin (4) - 4 freq whicrlin (4) - 1 freq thirlin (4) - 7 freq harlin (4) - 3 freq wharein (4) - 1 freq |
SoundEx code - W645 whirlin - 5 freq whirling - 3 freq whurlin - 1 freq whorlin - 1 freq whirlwin - 1 freq whirlan - 1 freq worl'an' - 1 freq whurlan - 1 freq whirlmagig - 2 freq whirlwind - 3 freq |
MetaPhone code - WRLN whirlin - 5 freq whurlin - 1 freq whorlin - 1 freq whirlan - 1 freq worl'an' - 1 freq whurlan - 1 freq |
WHURLAN |
Time to execute Levenshtein function - 0.356029 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.592683 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.035847 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.078401 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.000927 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. |