| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| wanrnin (0) - 1 freq waarnin (1) - 4 freq warnin (1) - 92 freq wairnin (1) - 7 freq daurnin (2) - 1 freq lananin (2) - 1 freq antnin (2) - 1 freq waarkin (2) - 20 freq waarmin (2) - 7 freq swannin (2) - 2 freq wairmin (2) - 2 freq wartin (2) - 1 freq wairin (2) - 1 freq wunnin (2) - 10 freq yarnin (2) - 18 freq warkin (2) - 157 freq darnin (2) - 2 freq cannin (2) - 3 freq warnins (2) - 5 freq mannin (2) - 1 freq wauknin (2) - 1 freq warin (2) - 2 freq fannin (2) - 9 freq bairnin (2) - 2 freq earnin (2) - 8 freq |
wanrnin (0) - 1 freq warnin (2) - 92 freq wairnin (2) - 7 freq waarnin (2) - 4 freq winrin (3) - 2 freq wearnin (3) - 1 freq warnan (3) - 1 freq winnin (3) - 90 freq warnen (3) - 1 freq wunnin (3) - 10 freq laernin (4) - 5 freq warmin (4) - 30 freq warrin (4) - 1 freq hannin (4) - 3 freq wairdin (4) - 1 freq wandrin (4) - 1 freq wardin (4) - 1 freq vannin (4) - 1 freq wanin (4) - 2 freq winnan (4) - 1 freq waunerin (4) - 4 freq winnen (4) - 1 freq waarneen (4) - 1 freq warneen (4) - 3 freq wanerin' (4) - 1 freq |
SoundEx code - W565 waunnerin - 3 freq wannerins - 3 freq wunnerin - 83 freq wunnering - 2 freq waunerin - 4 freq wannerin - 9 freq winnerin - 23 freq wanrnin - 1 freq wonnerin - 9 freq winnermint - 1 freq wunnerment - 2 freq wunnèrin - 5 freq won'erin - 1 freq wunnérin - 1 freq wunn'rin - 1 freq winrin - 2 freq wanerin' - 1 freq wunnerin' - 1 freq waynerooney - 1 freq whenuryoung - 1 freq |
MetaPhone code - WNRNN wanrnin - 1 freq |
WANRNIN |
| Time to execute Levenshtein function - 0.355269 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.595324 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.038351 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.081810 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.000876 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. |