Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
blawbag (0) - 1 freq bawbag (1) - 13 freq bawbags (2) - 2 freq blawing (2) - 3 freq blawan (2) - 1 freq blowing (3) - 2 freq blakaz (3) - 1 freq blaw's (3) - 1 freq bawbaws (3) - 1 freq teabag (3) - 1 freq blazan (3) - 1 freq blawhard (3) - 3 freq snawba (3) - 25 freq blaming (3) - 4 freq blackad (3) - 1 freq blawd (3) - 1 freq bawbee (3) - 23 freq clashbag (3) - 1 freq blaad (3) - 2 freq blag (3) - 1 freq blawit (3) - 3 freq blab (3) - 3 freq blaas (3) - 3 freq blowan (3) - 5 freq blanca (3) - 2 freq |
blawbag (0) - 1 freq bawbag (2) - 13 freq blawing (3) - 3 freq blawan (4) - 1 freq blowing (4) - 2 freq bawbags (4) - 2 freq blabbit (5) - 1 freq blaring (5) - 2 freq blawn (5) - 79 freq blabbin (5) - 1 freq blawed (5) - 9 freq blaw-in (5) - 1 freq blawen (5) - 1 freq bliban (5) - 1 freq blawin (5) - 90 freq blawy (5) - 1 freq lawbur (5) - 1 freq lambeg (5) - 5 freq blaws (5) - 55 freq blawin' (5) - 2 freq blawoot (5) - 1 freq blaaing (5) - 1 freq blaw (5) - 200 freq bean-bag (5) - 1 freq bla'ing (5) - 1 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 - BLBK bellabeg - 1 freq blawbag - 1 freq |
BLAWBAG |
Time to execute Levenshtein function - 0.204385 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.452350 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.033038 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.042985 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.001052 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. |