| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blibes (0) - 1 freq bribes (1) - 2 freq blokes (2) - 8 freq bribed (2) - 3 freq jibes (2) - 2 freq plebes (2) - 1 freq blinds (2) - 16 freq likes (2) - 524 freq blide (2) - 19 freq glipes (2) - 8 freq slides (2) - 8 freq blisses (2) - 3 freq elites (2) - 5 freq obliges (2) - 1 freq slices (2) - 19 freq clipes (2) - 1 freq bibles (2) - 6 freq bies (2) - 2 freq bides (2) - 230 freq alibis (2) - 2 freq plies (2) - 3 freq bikes (2) - 31 freq blists (2) - 2 freq buises (2) - 1 freq baines (2) - 1 freq |
blibes (0) - 1 freq blobs (2) - 4 freq bribes (2) - 2 freq blebs (2) - 1 freq belies (3) - 1 freq blades (3) - 22 freq babes (3) - 6 freq glebes (3) - 1 freq blues (3) - 29 freq blaes (3) - 4 freq bliban (3) - 1 freq bliss (3) - 59 freq bulbs (3) - 8 freq blames (3) - 4 freq globes (3) - 2 freq libs (3) - 1 freq alibis (3) - 2 freq biles (3) - 14 freq blis (3) - 1 freq blazes (3) - 1 freq obliges (3) - 1 freq plebes (3) - 1 freq blokes (3) - 8 freq blens (4) - 1 freq elbas (4) - 9 freq |
SoundEx code - B412 boolie-backit - 1 freq balbogie - 2 freq beliefs - 24 freq blobs - 4 freq bulbs - 8 freq bellabeg - 1 freq believes - 18 freq bulbous - 4 freq bleeps - 1 freq bailiffs - 1 freq bilfawst - 35 freq belfast - 46 freq belfast's - 1 freq blawbag - 1 freq blebs - 1 freq bulovka - 3 freq blae-faced - 2 freq bouillabaisse - 1 freq belíeves - 1 freq blibes - 1 freq blae-backit - 1 freq beleves - 1 freq belfastpride - 1 freq belfastbooks - 2 freq belfastcc - 1 freq belfastman - 1 freq belfastblogs - 1 freq byleaveswelive - 49 freq bilbaokultura - 1 freq belfastairport - 1 freq belfastunionist - 1 freq billyvacant - 3 freq belfastbhoy - 1 freq |
MetaPhone code - BLBS blobs - 4 freq bulbs - 8 freq bulbous - 4 freq blebs - 1 freq bouillabaisse - 1 freq blibes - 1 freq |
BLIBES |
| Time to execute Levenshtein function - 0.219857 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.395041 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.028308 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.039727 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.000899 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. |