| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bluffin (0) - 1 freq bouffin (1) - 1 freq pluffin (1) - 2 freq luftin (2) - 2 freq bluffed (2) - 1 freq guffin (2) - 1 freq gluffit (2) - 1 freq blurrin (2) - 1 freq pluffit (2) - 1 freq skuffin (2) - 1 freq pluffins (2) - 2 freq bowffin (2) - 1 freq buffin' (2) - 1 freq baffin (2) - 1 freq stuffin (2) - 10 freq pluffen (2) - 4 freq snuffin (2) - 7 freq whuffin (2) - 2 freq blue-in (2) - 1 freq boufin (2) - 3 freq flaffin (2) - 6 freq bluff (2) - 4 freq bluimin (2) - 1 freq ruffin (2) - 2 freq puffin (2) - 43 freq |
bluffin (0) - 1 freq pluffin (2) - 2 freq bouffin (2) - 1 freq pluffen (3) - 4 freq boffin (3) - 2 freq flaffin (3) - 6 freq bluff (3) - 4 freq baffin (3) - 1 freq laffin (3) - 7 freq bowffin (3) - 1 freq bluffed (3) - 1 freq laffan (4) - 1 freq blaff (4) - 2 freq buffoon (4) - 1 freq puffin (4) - 43 freq scuffin (4) - 2 freq bluidin (4) - 3 freq muffin (4) - 16 freq ruffin (4) - 2 freq huffin (4) - 7 freq blumin (4) - 1 freq pluffie (4) - 1 freq fuffin (4) - 2 freq blushin (4) - 2 freq luftin (4) - 2 freq |
SoundEx code - B415 believin - 13 freq blaeveined - 1 freq bleepin - 2 freq belhaven - 2 freq bluffin - 1 freq bliban - 1 freq blaebummer - 1 freq belieivin - 1 freq blue-bonnet - 1 freq balbinus - 1 freq blabbin - 1 freq blue-finskit - 1 freq bloohievin - 1 freq blioohievin - 1 freq bleepan - 1 freq ballyabanagh - 1 freq bolivians - 1 freq balvinder - 20 freq believing - 2 freq bloobank - 2 freq 'believing - 1 freq beleevin - 1 freq |
MetaPhone code - BLFN believin - 13 freq bluffin - 1 freq belieivin - 1 freq beleevin - 1 freq |
BLUFFIN |
| Time to execute Levenshtein function - 0.695414 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 - 1.213041 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.094398 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.114925 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.001254 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. |