Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
wgbh (0) - 1 freq gbh (1) - 3 freq wgh (1) - 1 freq weih (2) - 1 freq wghx (2) - 1 freq wub (2) - 1 freq wg (2) - 4 freq webs (2) - 2 freq wdbhr (2) - 1 freq wlnh (2) - 1 freq web (2) - 18 freq wirh (2) - 1 freq wach (2) - 9 freq jgjh (2) - 1 freq wyth (2) - 1 freq kgb (2) - 3 freq woth (2) - 1 freq obh (2) - 2 freq agh (2) - 11 freq cbh (2) - 1 freq wush (2) - 36 freq jgvh (2) - 1 freq fzbh (2) - 1 freq wfh (2) - 1 freq sibh (2) - 2 freq |
wgbh (0) - 1 freq gbh (2) - 3 freq wgh (2) - 1 freq wish (4) - 376 freq gdh (4) - 2 freq tbh (4) - 35 freq wch (4) - 1 freq ugb (4) - 1 freq zhbh (4) - 1 freq webb (4) - 1 freq lgbt (4) - 4 freq wgf (4) - 1 freq wich (4) - 1 freq wuh (4) - 1 freq wfb (4) - 1 freq wab (4) - 126 freq gb (4) - 2 freq dubh (4) - 4 freq lbh (4) - 1 freq gkh (4) - 1 freq bh (4) - 13 freq wth (4) - 1 freq wnvh (4) - 1 freq gbn (4) - 1 freq ugh (4) - 12 freq |
SoundEx code - W210 wisp - 7 freq wak-up - 1 freq wishfu - 1 freq wispy - 5 freq whispy - 1 freq wasp' - 1 freq wishfou - 1 freq wake-up - 1 freq wasp - 5 freq weespy - 1 freq wgbh - 1 freq wash-wife - 1 freq €˜wusp - 1 freq wusp - 1 freq wauk-up - 2 freq wiuqkeb - 1 freq wuzf - 1 freq wqcv - 1 freq wcjxf - 1 freq whassup - 1 freq wsf - 1 freq wjob - 1 freq whackjob - 1 freq wjop - 1 freq wgf - 1 freq wjp - 1 freq wcqoyp - 1 freq wqhab - 1 freq |
MetaPhone code - KB gab - 32 freq cowboy - 18 freq gob - 15 freq cb - 3 freq gub - 30 freq cube - 5 freq gub' - 2 freq gabbie - 1 freq cub - 3 freq cubbie - 2 freq goab - 1 freq cab - 16 freq gbh - 3 freq cowboay' - 1 freq qub - 4 freq go-by - 2 freq wgbh - 1 freq gaub - 1 freq gabe - 1 freq cabbie - 3 freq kb - 4 freq keb - 2 freq kubby - 1 freq cubby - 1 freq qb - 2 freq hkhb - 1 freq gooby - 2 freq qby - 1 freq cbb - 4 freq gb - 2 freq gbbo - 1 freq cuby - 1 freq coyb - 1 freq kabb - 1 freq cbh - 1 freq gabby - 1 freq ckb - 1 freq |
WGBH |
Time to execute Levenshtein function - 0.368166 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.419376 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.037260 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.043646 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.001039 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. |