| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| williams (0) - 32 freq williams' (1) - 3 freq williame (1) - 1 freq william' (1) - 4 freq william's (1) - 2 freq william (1) - 238 freq gillians (2) - 1 freq willis (2) - 1 freq wulliam' (2) - 1 freq weilliam (2) - 1 freq williamson (2) - 15 freq willicks (2) - 2 freq 'william (2) - 2 freq lillias (2) - 1 freq willies (2) - 6 freq willie's (2) - 22 freq wulliam (2) - 10 freq fillims (2) - 2 freq willans (2) - 1 freq killings (3) - 2 freq willin (3) - 58 freq wellies (3) - 16 freq fillings (3) - 2 freq jillings (3) - 10 freq willum (3) - 5 freq |
williams (0) - 32 freq william's (2) - 2 freq william' (2) - 4 freq william (2) - 238 freq williame (2) - 1 freq williams' (2) - 3 freq willie's (3) - 22 freq willies (3) - 6 freq fillims (3) - 2 freq willans (3) - 1 freq wulliam (3) - 10 freq weilliam (3) - 1 freq wulliam' (3) - 1 freq willis (3) - 1 freq williamson (3) - 15 freq will's (4) - 1 freq waulliam's (4) - 1 freq willows (4) - 4 freq illums (4) - 1 freq willum' (4) - 1 freq wullie's (4) - 19 freq waltams (4) - 4 freq willem (4) - 1 freq wallies (4) - 16 freq waulliam (4) - 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 - WLMS william's - 2 freq williams - 32 freq williams' - 3 freq waulliam's - 1 freq |
WILLIAMS |
| Time to execute Levenshtein function - 0.289206 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.533163 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.064585 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.037758 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.049029 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. |