| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blioohievin (0) - 1 freq bloohievin (1) - 1 freq blooterin (4) - 3 freq flichterin (5) - 14 freq flooerin (5) - 4 freq plooterin (5) - 7 freq botherin (5) - 13 freq sloosterin (5) - 1 freq brichtenin (5) - 5 freq lichtenin (5) - 9 freq listienin (5) - 1 freq cooriein (5) - 2 freq blisterin (5) - 2 freq blousterin (5) - 2 freq floorishin (5) - 2 freq thievin (5) - 16 freq shoogiein (5) - 1 freq flochterin (5) - 2 freq bloomin (5) - 28 freq flicherin (5) - 1 freq bloodied (5) - 1 freq belieivin (5) - 1 freq bloodstain (5) - 1 freq blowsterin (5) - 2 freq bleatherin (5) - 1 freq |
blioohievin (0) - 1 freq bloohievin (1) - 1 freq believin (6) - 13 freq blooterin (6) - 3 freq belieivin (6) - 1 freq bloomeen (7) - 1 freq bloomin (7) - 28 freq belhaven (7) - 2 freq bletherin (7) - 81 freq achievin (7) - 3 freq thievin (7) - 16 freq beleevin (7) - 1 freq bleatherin (7) - 1 freq behavin (7) - 4 freq botherin (7) - 13 freq leivin (8) - 62 freq bleepin (8) - 2 freq bohemian (8) - 2 freq theevin (8) - 1 freq blaikin (8) - 1 freq bluidin (8) - 3 freq relievin (8) - 3 freq blisseen (8) - 1 freq bluimin (8) - 1 freq oblivion (8) - 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 - BLHFN belhaven - 2 freq bloohievin - 1 freq blioohievin - 1 freq |
BLIOOHIEVIN |
| Time to execute Levenshtein function - 0.391060 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.872723 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.030027 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.104032 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.000877 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. |