| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blairites (0) - 1 freq blairite (1) - 1 freq blairius (2) - 1 freq plaikies (3) - 1 freq slairit (3) - 2 freq lairicks (3) - 1 freq bleirit (3) - 2 freq dairies (3) - 3 freq blackies (3) - 1 freq latrines (3) - 3 freq cairies (3) - 4 freq bladrie (3) - 1 freq blirted (3) - 1 freq lairit (3) - 2 freq blawpipes (3) - 2 freq painites (3) - 1 freq bairnies (3) - 46 freq bairges (3) - 1 freq blairen (3) - 1 freq pairities (3) - 1 freq birit's (3) - 1 freq blair's (3) - 1 freq bathites (3) - 1 freq flairit (3) - 1 freq hairies (3) - 4 freq |
blairites (0) - 1 freq blairite (2) - 1 freq blairius (3) - 1 freq blirted (4) - 1 freq blair's (4) - 1 freq bleirit (4) - 2 freq clairts (4) - 1 freq blurts (4) - 8 freq blasts (5) - 14 freq lairdies (5) - 16 freq cairtes (5) - 1 freq bailies (5) - 2 freq blatts (5) - 5 freq blurtet (5) - 3 freq blaikit (5) - 4 freq larries (5) - 8 freq bairdies (5) - 1 freq brits (5) - 5 freq flairit (5) - 1 freq salyerites (5) - 1 freq barries (5) - 1 freq clarts (5) - 2 freq bathites (5) - 1 freq blurten (5) - 1 freq birts (5) - 1 freq |
SoundEx code - B463 bleert - 1 freq bleart - 5 freq billiards - 2 freq blawhard - 3 freq blurted - 6 freq blurred - 6 freq bollard - 3 freq blirt - 8 freq blurtet - 3 freq blurten - 1 freq blurts - 8 freq blirted - 1 freq blared - 3 freq bleared - 7 freq blewarts - 2 freq bleered - 1 freq bleirit - 2 freq billiart - 1 freq bleary-eyed - 1 freq ballarat - 1 freq bollards - 2 freq bullert - 2 freq blaewort-fu - 1 freq blawhards - 1 freq bleerie-eed - 1 freq billiard - 1 freq blurt - 1 freq blurtit - 2 freq blear-eyed - 1 freq blirtin - 2 freq blairite - 1 freq blairites - 1 freq blairdaff - 1 freq boilyirheed - 1 freq |
MetaPhone code - BLRTS billiards - 2 freq blurts - 8 freq bollards - 2 freq blairites - 1 freq |
BLAIRITES |
| Time to execute Levenshtein function - 0.239371 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.403620 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.027857 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.040058 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.000949 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. |