| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| williams (0) - 32 freq william (1) - 239 freq williams' (1) - 3 freq william' (1) - 4 freq william's (1) - 2 freq williame (1) - 1 freq willies (2) - 6 freq williamson (2) - 15 freq willans (2) - 1 freq wulliam (2) - 10 freq willis (2) - 1 freq willie's (2) - 22 freq 'william (2) - 2 freq fillims (2) - 2 freq weilliam (2) - 1 freq wulliam' (2) - 1 freq lillias (2) - 1 freq willicks (2) - 2 freq gillians (2) - 1 freq gillhaus (3) - 1 freq killings (3) - 2 freq willnae (3) - 101 freq billies (3) - 14 freq williew (3) - 1 freq billiards (3) - 2 freq |
williams (0) - 32 freq williame (2) - 1 freq william' (2) - 4 freq william's (2) - 2 freq william (2) - 239 freq williams' (2) - 3 freq fillims (3) - 2 freq wulliam' (3) - 1 freq willie's (3) - 22 freq weilliam (3) - 1 freq wulliam (3) - 10 freq willis (3) - 1 freq williamson (3) - 15 freq willies (3) - 6 freq willans (3) - 1 freq illums (4) - 1 freq willows (4) - 4 freq waulliam's (4) - 1 freq waulliam (4) - 1 freq fillums (4) - 5 freq willum' (4) - 1 freq wullie's (4) - 19 freq wills (4) - 3 freq waltams (4) - 4 freq wellies (4) - 16 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.222186 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.526825 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.063348 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.037330 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.000902 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. |