| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bighollywood (0) - 3 freq hollywood (3) - 19 freq 'hollywood (3) - 1 freq bollywood (3) - 1 freq hollyrood (4) - 2 freq holywood (4) - 1 freq michaelswood (5) - 4 freq gollywogs (5) - 1 freq boyywood (5) - 1 freq hollywood's (5) - 1 freq holyrood (5) - 45 freq boyhood (6) - 6 freq ballysnod (6) - 1 freq billiehood (6) - 1 freq bignold (6) - 1 freq plywood (6) - 1 freq billygoat (6) - 2 freq billowed (6) - 1 freq billy-o (6) - 1 freq hollyjo (6) - 1 freq 'holyrood' (6) - 1 freq bindwood (6) - 2 freq heywood (6) - 1 freq wildwood (6) - 1 freq billymcd (6) - 10 freq |
bighollywood (0) - 3 freq 'hollywood (5) - 1 freq bollywood (5) - 1 freq hollywood (5) - 19 freq holywood (7) - 1 freq hollyrood (7) - 2 freq billowed (8) - 1 freq michaelswood (8) - 4 freq hollowed (8) - 4 freq bignold (9) - 1 freq hallowed (9) - 4 freq wellwood (9) - 13 freq bellowed (9) - 2 freq billiehood (9) - 1 freq boyywood (9) - 1 freq gollywogs (9) - 1 freq hollywood's (9) - 1 freq holyrood (9) - 45 freq signalled (10) - 2 freq billed (10) - 2 freq ragdolled (10) - 1 freq disallowed (10) - 2 freq highland (10) - 31 freq billows (10) - 1 freq hollows (10) - 5 freq |
SoundEx code - B243 bauchled - 6 freq bogleheid - 1 freq buckled - 7 freq bauchelt - 3 freq bakelite - 3 freq booklet - 5 freq bachlt - 1 freq boggle-eed - 1 freq bachled - 1 freq bucklt - 2 freq bekalite - 1 freq backslide - 1 freq basalt - 2 freq buik-leet - 1 freq buik-leets - 1 freq bauchilt - 2 freq bi-cultural - 1 freq bucklit - 1 freq buckelt - 2 freq becloods - 1 freq backcloth - 1 freq backlit - 1 freq back-claiths - 1 freq backslider - 1 freq backsliders - 1 freq bauchlet - 1 freq bucklet - 1 freq boglet - 1 freq bzlitwvj - 1 freq backsliding - 1 freq bighollywood - 3 freq |
MetaPhone code - BFLWT bighollywood - 3 freq |
BIGHOLLYWOOD |
| Time to execute Levenshtein function - 0.206770 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.391628 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.027902 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.037333 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.000846 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. |