| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bloviation (0) - 1 freq bloatin (3) - 1 freq bloviate (3) - 1 freq elevation (3) - 3 freq novation (3) - 1 freq location (3) - 35 freq norration (4) - 1 freq seitiation (4) - 3 freq isolation (4) - 20 freq rotation (4) - 1 freq locations (4) - 9 freq evocation (4) - 1 freq seetiation (4) - 8 freq nomination (4) - 1 freq initiation (4) - 2 freq leviathan (4) - 3 freq litigation (4) - 1 freq sitiation (4) - 1 freq flirtation (4) - 1 freq donation (4) - 12 freq salvation (4) - 17 freq convintion (4) - 1 freq volition (4) - 2 freq elevatin (4) - 1 freq provision (4) - 37 freq |
bloviation (0) - 1 freq bloatin (4) - 1 freq elevation (4) - 3 freq bloviate (4) - 1 freq elevatin (5) - 1 freq bleatin (5) - 7 freq salvation (5) - 17 freq location (5) - 35 freq novation (5) - 1 freq obligation (5) - 6 freq blirtin (5) - 2 freq bulderation (6) - 1 freq relocation (6) - 2 freq blastin (6) - 11 freq boulton (6) - 1 freq gloatin (6) - 5 freq elation (6) - 3 freq ablution (6) - 2 freq oblivion (6) - 2 freq innovation (6) - 6 freq abomination (6) - 5 freq elocution (6) - 3 freq bolton (6) - 2 freq blottan (6) - 1 freq belovit (6) - 5 freq |
SoundEx code - B413 beloved - 25 freq believe't - 4 freq believed - 49 freq belovit - 5 freq believt - 1 freq bluffed - 1 freq bloviation - 1 freq bluebottle - 8 freq bluebottle's - 4 freq bluebottles - 3 freq believ't - 1 freq beluvit - 7 freq beluved - 1 freq bileeved - 1 freq bowl-fitted - 1 freq baeloved - 1 freq baelieved - 1 freq believit - 3 freq bull-bait - 2 freq bull-bate - 3 freq bull-bait's - 2 freq blabbit - 1 freq belly-button - 1 freq belevit - 1 freq beleved - 2 freq blue-bottle - 1 freq believet - 1 freq bloviate - 1 freq balbutt - 8 freq belouvit - 1 freq bull-beat - 2 freq belabedboots - 4 freq blipped - 1 freq |
MetaPhone code - BLFXN bloviation - 1 freq |
BLOVIATION |
| Time to execute Levenshtein function - 0.267301 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.428111 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.028051 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.038001 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.000913 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. |