Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
westburn (0) - 4 freq western (2) - 30 freq whitburn (2) - 5 freq hertburn (2) - 2 freq woodburn (3) - 3 freq westlin (3) - 3 freq wastern (3) - 5 freq weston (3) - 7 freq besturt (3) - 1 freq return (3) - 130 freq hepburn (3) - 6 freq gesture (3) - 32 freq woburn (3) - 1 freq westren (3) - 4 freq heartburn (3) - 1 freq gesturt (3) - 1 freq wester (3) - 6 freq gestern (3) - 1 freq owerturn (3) - 2 freq westerns (3) - 1 freq gesturin (3) - 18 freq westward (3) - 1 freq wudburn (3) - 11 freq westlan (3) - 2 freq westerne (3) - 1 freq |
westburn (0) - 4 freq whitburn (3) - 5 freq western (3) - 30 freq westren (4) - 4 freq wastern (4) - 5 freq hertburn (4) - 2 freq westerne (4) - 1 freq wudburn (5) - 11 freq westerns (5) - 1 freq westlan (5) - 2 freq gesturin (5) - 18 freq westward (5) - 1 freq wastren (5) - 7 freq westernau (5) - 1 freq wastrin (5) - 1 freq owerturn (5) - 2 freq lisburn (5) - 1 freq westport (5) - 3 freq seturn (5) - 12 freq woodburn (5) - 3 freq westlin (5) - 3 freq woburn (5) - 1 freq gestern (5) - 1 freq heartburn (5) - 1 freq weston (5) - 7 freq |
SoundEx code - W231 westburn - 4 freq westfold - 1 freq waste-paper - 2 freq wistfully - 3 freq westport - 3 freq waistband - 2 freq waist-deep - 1 freq wistful - 4 freq wastepaper-basket - 1 freq weskit-pocket - 2 freq waste-bins - 1 freq wastepaper - 1 freq wastburrafirt - 1 freq westbromel - 3 freq washydeaffc - 2 freq |
MetaPhone code - WSTBRN westburn - 4 freq |
WESTBURN |
Time to execute Levenshtein function - 0.244593 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.407008 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.031216 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.041798 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.000823 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. |