| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| whillans (0) - 1 freq shillans (1) - 2 freq willans (1) - 1 freq hallans (2) - 1 freq shillins (2) - 19 freq shillan (2) - 1 freq whirlan (2) - 1 freq wuidlans (2) - 1 freq chileans (2) - 1 freq millans (2) - 1 freq shullans (2) - 1 freq willan (2) - 5 freq hielans (2) - 17 freq whiskas (3) - 1 freq shills (3) - 3 freq millan (3) - 1 freq wilkins (3) - 1 freq whillie (3) - 2 freq widland (3) - 10 freq wheelan (3) - 1 freq fillan's (3) - 1 freq ghillies (3) - 1 freq wittans (3) - 2 freq whizzan (3) - 1 freq shillings (3) - 4 freq |
whillans (0) - 1 freq willans (2) - 1 freq shillans (2) - 2 freq shullans (3) - 1 freq shillins (3) - 19 freq hallans (3) - 1 freq hielans (4) - 17 freq shilliens (4) - 1 freq shullins (4) - 1 freq whillie's (4) - 1 freq willan (4) - 5 freq whirlan (4) - 1 freq shillan (4) - 1 freq chileans (4) - 1 freq wuidlans (4) - 1 freq millans (4) - 1 freq whiles (5) - 479 freq willis (5) - 1 freq millins (5) - 1 freq ullans (5) - 32 freq whilk's (5) - 1 freq willni (5) - 2 freq wills (5) - 3 freq hillies (5) - 11 freq hallan (5) - 1 freq |
SoundEx code - W452 willans - 1 freq william's - 2 freq williamson - 15 freq weelness' - 1 freq williams - 32 freq williams' - 3 freq willing - 10 freq willingdon - 2 freq weelness - 1 freq walawaying - 1 freq willingness - 6 freq wileness - 1 freq willingly - 2 freq wellington - 9 freq waulliam's - 1 freq walins - 2 freq weelins - 1 freq well-hung - 1 freq €˜wulness - 2 freq wulness - 1 freq wailing - 1 freq walings - 2 freq wullinness - 1 freq williamsbrewery - 2 freq whillans - 1 freq williamcrawley - 1 freq willmackie - 1 freq williamsonkev - 2 freq williemackenzie - 3 freq walunacrew - 2 freq |
MetaPhone code - WLNS willans - 1 freq weelness' - 1 freq weelness - 1 freq wileness - 1 freq walins - 2 freq weelins - 1 freq €˜wulness - 2 freq wulness - 1 freq wullinness - 1 freq whillans - 1 freq |
WHILLANS |
| Time to execute Levenshtein function - 0.235165 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.490357 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.030570 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.040864 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.000947 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. |