| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beleevin (0) - 1 freq believin (1) - 13 freq eleevin (1) - 4 freq belevit (2) - 1 freq belieivin (2) - 1 freq jleevin (2) - 1 freq eleivin (2) - 1 freq believing (2) - 2 freq bleedin (2) - 23 freq re-leevin (2) - 1 freq leevin (2) - 195 freq eleeven (2) - 35 freq eeleeven (2) - 1 freq beleeve (2) - 5 freq bleezin (2) - 77 freq eleevan (2) - 1 freq beseekin (2) - 2 freq aleevin (2) - 1 freq bleepin (2) - 2 freq believit (2) - 3 freq relievin (2) - 3 freq arreevin (3) - 1 freq betterin (3) - 3 freq behavin (3) - 4 freq deleevirt (3) - 1 freq |
beleevin (0) - 1 freq believin (1) - 13 freq belieivin (2) - 1 freq eleevin (2) - 4 freq eleevan (3) - 1 freq beleeve (3) - 5 freq bleezin (3) - 77 freq believit (3) - 3 freq relievin (3) - 3 freq eeleeven (3) - 1 freq bleepin (3) - 2 freq aleevin (3) - 1 freq eleivin (3) - 1 freq belevit (3) - 1 freq eleeven (3) - 35 freq believing (3) - 2 freq jleevin (3) - 1 freq leevin (3) - 195 freq bleedin (3) - 23 freq bileev (4) - 5 freq bile-in (4) - 1 freq believet (4) - 1 freq beelin (4) - 22 freq bevvin (4) - 1 freq beivin (4) - 1 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 |
BELEEVIN |
| Time to execute Levenshtein function - 0.358628 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.495870 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.028703 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.041382 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.001233 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. |