| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| byaaven (0) - 1 freq byaavin (1) - 1 freq tyaavin (2) - 2 freq tyaave (2) - 2 freq yaavin (2) - 3 freq bygaen (2) - 2 freq blaaen (2) - 1 freq baaken (2) - 1 freq braaken (2) - 2 freq baain (3) - 2 freq baen (3) - 8 freq yappen (3) - 5 freq baakin (3) - 1 freq tyavvin (3) - 1 freq shaavin (3) - 1 freq bygaun (3) - 7 freq tcyaave (3) - 1 freq eyven (3) - 8 freq caasen (3) - 1 freq maave (3) - 4 freq behaved (3) - 9 freq caawen (3) - 1 freq bajen (3) - 1 freq waaken (3) - 16 freq baken (3) - 2 freq |
byaaven (0) - 1 freq byaavin (1) - 1 freq bygaen (3) - 2 freq baaken (3) - 1 freq blaaen (3) - 1 freq yaavin (3) - 3 freq tyaavin (3) - 2 freq baarn (4) - 1 freq bakeen (4) - 2 freq beaten (4) - 20 freq raven (4) - 12 freq caven (4) - 1 freq beivin (4) - 1 freq bydan (4) - 1 freq sayven (4) - 1 freq baleen (4) - 1 freq tyavin (4) - 2 freq blaain (4) - 22 freq heaven (4) - 69 freq bygane (4) - 45 freq bygaein (4) - 1 freq blauen (4) - 1 freq baalin (4) - 3 freq haiven (4) - 34 freq behavin (4) - 4 freq |
SoundEx code - B150 bowfin - 28 freq boabbin - 1 freq babbin - 4 freq bevvyin - 5 freq bobbin - 21 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 beepin - 3 freq bobin - 1 freq boufin - 1 freq baboon - 1 freq befawin - 1 freq boabin - 1 freq bob-on - 1 freq |
MetaPhone code - BYFN byaavin - 1 freq byaaven - 1 freq |
BYAAVEN |
| Time to execute Levenshtein function - 0.205790 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.449063 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.028921 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.038360 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.000802 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. |