| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| balvinder (0) - 20 freq blinder (2) - 3 freq allander (3) - 1 freq asinder (3) - 1 freq balder (3) - 1 freq malinger (3) - 1 freq cylinder (3) - 6 freq binder (3) - 22 freq jaswinder (3) - 1 freq glinder (3) - 4 freq callender (3) - 1 freq blender (3) - 3 freq lavender (3) - 58 freq blunder (3) - 3 freq blinders (3) - 2 freq bainner (3) - 2 freq blinter (3) - 2 freq blinded (3) - 4 freq ballondor (3) - 1 freq salinger (3) - 1 freq bollinger (3) - 1 freq callander (3) - 2 freq tinder (4) - 8 freq raider (4) - 1 freq slander (4) - 3 freq |
balvinder (0) - 20 freq blinder (3) - 3 freq blunder (4) - 3 freq blender (4) - 3 freq lavender (4) - 58 freq ballondor (4) - 1 freq callander (5) - 2 freq bollinger (5) - 1 freq blinders (5) - 2 freq blinter (5) - 2 freq blinded (5) - 4 freq 'lavender (5) - 1 freq binder (5) - 22 freq cylinder (5) - 6 freq balder (5) - 1 freq callender (5) - 1 freq glinder (5) - 4 freq allander (5) - 1 freq bellenden (6) - 3 freq brander (6) - 2 freq bladder (6) - 6 freq byvind (6) - 1 freq blindly (6) - 1 freq blondes (6) - 2 freq bellinderry (6) - 1 freq |
SoundEx code - B415 believin - 13 freq blaeveined - 1 freq bleepin - 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 belhaven - 1 freq 'believing - 1 freq beleevin - 1 freq |
MetaPhone code - BLFNTR balvinder - 20 freq |
BALVINDER |
| Time to execute Levenshtein function - 0.206883 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.367176 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.027340 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.044989 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.001073 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. |