| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bevyin (0) - 1 freq bevvin (1) - 1 freq bevvyin (1) - 5 freq bewvyin (1) - 1 freq weyin (2) - 3 freq bevie (2) - 2 freq beein (2) - 14 freq beinin (2) - 1 freq befylin (2) - 1 freq hevin (2) - 20 freq defyin (2) - 2 freq beakin (2) - 1 freq evin (2) - 64 freq beeryin (2) - 1 freq eelyin (2) - 1 freq beyon (2) - 1 freq levin (2) - 1 freq peyin (2) - 75 freq becin (2) - 1 freq bettin (2) - 12 freq bealin (2) - 32 freq seyin (2) - 21 freq devydin (2) - 1 freq berlin (2) - 14 freq eevin (2) - 5 freq |
bevyin (0) - 1 freq bewvyin (2) - 1 freq beivin (2) - 1 freq bevvyin (2) - 5 freq bevvin (2) - 1 freq begin (3) - 104 freq beirin (3) - 4 freq pevin (3) - 1 freq bearin (3) - 28 freq beepin (3) - 3 freq be-in (3) - 29 freq beatin (3) - 34 freq vyin (3) - 1 freq bevy (3) - 5 freq bein (3) - 1776 freq beamin (3) - 26 freq ievin (3) - 1 freq buyin (3) - 84 freq bayin (3) - 2 freq beemin (3) - 1 freq evein (3) - 3 freq buryin (3) - 6 freq bedein (3) - 2 freq beekin (3) - 10 freq bevvie (3) - 2 freq |
SoundEx code - B150 bowfin - 28 freq boabbin - 1 freq babbin - 4 freq bevvyin - 5 freq bobbin - 22 freq buffoon - 1 freq bowfin' - 1 freq bevyin - 1 freq bobban - 2 freq behavin - 4 freq bewvyin - 1 freq 'bowfin - 1 freq buffin' - 1 freq 'boffin' - 1 freq bevvin - 1 freq bovine - 2 freq byaavin - 1 freq byaaven - 1 freq baffin - 1 freq beivin - 1 freq bebbin - 1 freq bouffin - 1 freq boffin - 2 freq bowffin - 1 freq boppin - 1 freq boufin - 3 freq beepin - 3 freq bobin - 1 freq baboon - 1 freq befawin - 1 freq boabin - 1 freq bob-on - 1 freq |
MetaPhone code - BFYN bevvyin - 5 freq bevyin - 1 freq bewvyin - 1 freq |
BEVYIN |
| Time to execute Levenshtein function - 0.312080 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.671208 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.085778 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.044428 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.001064 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. |