| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| williamson (0) - 15 freq williams (2) - 32 freq williams' (2) - 3 freq william' (3) - 4 freq williame (3) - 1 freq william's (3) - 2 freq willingdon (3) - 2 freq william (3) - 239 freq williamsonkev (3) - 2 freq mwilliamsht (3) - 9 freq wollaston (4) - 30 freq willis (4) - 1 freq willie's (4) - 22 freq weilliam (4) - 1 freq 'william (4) - 2 freq million (4) - 156 freq williejohn (4) - 23 freq ailison (4) - 1 freq wellington (4) - 9 freq willin (4) - 59 freq hillington (4) - 2 freq wellinton (4) - 1 freq pillion (4) - 1 freq gillian (4) - 7 freq dillion (4) - 3 freq |
williamson (0) - 15 freq williams (3) - 32 freq williams' (3) - 3 freq william (5) - 239 freq williamsonkev (5) - 2 freq willamina (5) - 1 freq william's (5) - 2 freq william' (5) - 4 freq williame (5) - 1 freq fillims (6) - 2 freq willies (6) - 6 freq wellinton (6) - 1 freq willkommen (6) - 1 freq willans (6) - 1 freq willin (6) - 59 freq wilson (6) - 48 freq willan (6) - 5 freq williemoir (6) - 2 freq wulliam (6) - 10 freq wulliam' (6) - 1 freq willie's (6) - 22 freq wollaston (6) - 30 freq weilliam (6) - 1 freq willingdon (6) - 2 freq willis (6) - 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 - WLMSN williamson - 15 freq |
WILLIAMSON |
| Time to execute Levenshtein function - 0.194061 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.373438 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.029799 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.038936 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.000994 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. |