| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bogleheid (0) - 1 freq bonnieheid (3) - 1 freq tableheid (3) - 1 freq boggle-eed (3) - 1 freq owreheid (3) - 2 freq beheid (3) - 3 freq baeheid (3) - 1 freq foreheid (3) - 23 freq braeheid (3) - 3 freq mort-heid (4) - 1 freq burnheid (4) - 2 freq coneheids (4) - 1 freq house-heid (4) - 1 freq loan-heid (4) - 1 freq hollered (4) - 5 freq chilehuid (4) - 1 freq coulered (4) - 1 freq byleid (4) - 9 freq boglet (4) - 1 freq foreheed (4) - 1 freq hullheid (4) - 1 freq bolshoi' (4) - 1 freq fauseheid (4) - 1 freq gollered (4) - 11 freq blytheheid (4) - 1 freq |
bogleheid (0) - 1 freq bonnieheid (5) - 1 freq braeheid (5) - 3 freq baeheid (5) - 1 freq beheid (5) - 3 freq tableheid (5) - 1 freq boggle-eed (5) - 1 freq bouled (6) - 1 freq baw-heid (6) - 1 freq bogged (6) - 3 freq beleved (6) - 2 freq bawheid (6) - 6 freq gleid (6) - 1 freq boalted (6) - 1 freq big-ee'd (6) - 1 freq braehead (6) - 1 freq brig-heid (6) - 3 freq hillheid (6) - 2 freq bairnheid (6) - 39 freq booled (6) - 2 freq bleed (6) - 81 freq gleed (6) - 7 freq bracheid (6) - 2 freq bogle (6) - 45 freq ba-heid (6) - 1 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 - BKLHT bogleheid - 1 freq |
BOGLEHEID |
| Time to execute Levenshtein function - 0.225606 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.464985 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.029427 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.038902 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.000987 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. |