| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| behavin (0) - 4 freq behaving (1) - 4 freq behavior (2) - 1 freq beamin (2) - 26 freq behaved (2) - 9 freq deavin (2) - 8 freq bearin (2) - 28 freq behaudin (2) - 3 freq bhain (2) - 24 freq beatin (2) - 34 freq behuvit (2) - 1 freq belhaven (2) - 2 freq beakin (2) - 1 freq havin (2) - 73 freq behaves (2) - 3 freq bevvin (2) - 1 freq befawin (2) - 1 freq bealin (2) - 32 freq leavin (2) - 187 freq beivin (2) - 1 freq chavin (2) - 4 freq weavin (2) - 34 freq bravin (2) - 3 freq shavin (2) - 11 freq behaiv (2) - 1 freq |
behavin (0) - 4 freq behaving (2) - 4 freq chavin (3) - 4 freq beivin (3) - 1 freq behaves (3) - 3 freq bravin (3) - 3 freq bevvin (3) - 1 freq byaavin (3) - 1 freq heavin (3) - 18 freq behin (3) - 41 freq behave (3) - 38 freq havin (3) - 73 freq behaiv (3) - 1 freq shavin (3) - 11 freq bhain (3) - 24 freq behaved (3) - 9 freq behaudin (3) - 3 freq behavior (3) - 1 freq behuvit (3) - 1 freq belhaven (3) - 2 freq hivin (4) - 27 freq bevyin (4) - 1 freq haivin (4) - 3 freq haevin (4) - 2 freq unhovin (4) - 1 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 - BHFN behavin - 4 freq |
BEHAVIN |
| Time to execute Levenshtein function - 0.323883 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.435796 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.030744 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.041210 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.000864 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. |