Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
radioborders (0) - 4 freq disorders (4) - 1 freq disorder's (5) - 1 freq kailyarders (5) - 1 freq liveborders (5) - 1 freq mail-order (5) - 1 freq borders (5) - 80 freq disorder (5) - 7 freq radiator's (5) - 1 freq radiators (5) - 3 freq raiders (5) - 5 freq disordert (5) - 2 freq roonders (5) - 2 freq recorders (5) - 2 freq airborne (6) - 4 freq robotars (6) - 1 freq reinforces (6) - 2 freq foonders (6) - 2 freq radiojonnie (6) - 1 freq girders (6) - 12 freq racords (6) - 4 freq radioleary (6) - 5 freq aibirdeen (6) - 1 freq rainforests (6) - 1 freq brooders (6) - 1 freq |
radioborders (0) - 4 freq disorders (6) - 1 freq liveborders (7) - 1 freq recorders (7) - 2 freq borders (7) - 80 freq seabirders (8) - 2 freq ladybirds (8) - 1 freq roonders (8) - 2 freq birders (8) - 2 freq boarders (8) - 1 freq badbirdart (8) - 1 freq brooders (8) - 1 freq radiator's (8) - 1 freq disorder (8) - 7 freq kailyarders (8) - 1 freq disordert (8) - 2 freq raiders (8) - 5 freq disorder's (8) - 1 freq radiators (8) - 3 freq hoarders (9) - 1 freq radioruderham (9) - 1 freq orders (9) - 51 freq 'border' (9) - 1 freq bluborder (9) - 3 freq yarnbombers (9) - 1 freq |
SoundEx code - R316 rid-brick - 4 freq rathfrilan - 4 freq reidbriest - 2 freq reidbreist - 2 freq ruidbreist - 1 freq ruidbreist' - 1 freq ridbreist - 1 freq reidfordshire - 1 freq reid-beirdit - 1 freq radioborders - 4 freq redperoni - 1 freq redbrickz - 1 freq |
MetaPhone code - RTBRTRS radioborders - 4 freq |
RADIOBORDERS |
Time to execute Levenshtein function - 0.239072 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.381018 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.028354 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.038302 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.000916 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. |