| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buckiehighlib (0) - 1 freq buckiehigheng (3) - 1 freq buckingham (6) - 4 freq buckie's (7) - 3 freq fuckinshit (7) - 1 freq buckelt (7) - 2 freq quhytehillis (7) - 1 freq buckie (7) - 45 freq buckhind (7) - 4 freq buckies (7) - 11 freq heighlit (7) - 1 freq skreighin (7) - 4 freq bucklin (7) - 7 freq buckihame (7) - 1 freq bucketin (7) - 2 freq kiejittlin (7) - 1 freq bucklit (7) - 1 freq muckle-ish (7) - 1 freq bullshittin (8) - 1 freq bbckile (8) - 1 freq mucklie (8) - 1 freq chillin (8) - 6 freq bucolic (8) - 1 freq cock-height (8) - 1 freq luckily (8) - 34 freq |
buckiehighlib (0) - 1 freq buckiehigheng (5) - 1 freq buckingham (9) - 4 freq bucklit (11) - 1 freq buckhind (11) - 4 freq buckihame (11) - 1 freq heighlit (11) - 1 freq bucklin (11) - 7 freq buckelt (11) - 2 freq buckle (12) - 12 freq buckled (12) - 7 freq €˜highly (12) - 1 freq mockingly (12) - 1 freq mickhill (12) - 3 freq highly (12) - 17 freq buckles (12) - 2 freq bauchlin (12) - 1 freq bauchlie (12) - 1 freq sauchiehall (12) - 7 freq buckshee (12) - 3 freq bucklet (12) - 1 freq buckpool (12) - 3 freq backshift (12) - 1 freq bauchilt (12) - 2 freq heighly (12) - 1 freq |
SoundEx code - B224 basically - 35 freq bicycle - 8 freq bi-sexual - 1 freq bicycles - 1 freq bisexuality - 1 freq bbchighlands - 1 freq beckyexcell - 1 freq buckiehighlib - 1 freq |
MetaPhone code - BKHFLB buckiehighlib - 1 freq |
BUCKIEHIGHLIB |
| Time to execute Levenshtein function - 0.500567 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.890433 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.079765 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.039418 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.000911 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. |