Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nine-bars (0) - 1 freq wine-baurs (2) - 1 freq nigella's (4) - 1 freq vinegary (4) - 1 freq kineddart (4) - 4 freq nighbers (4) - 11 freq nose-bag (4) - 1 freq fingars (4) - 1 freq in-laws (4) - 2 freq pee-bags (4) - 1 freq vinegar (4) - 18 freq nines (4) - 12 freq nae-baud (4) - 1 freq nitemerrs (4) - 1 freq nineties (4) - 6 freq infobears (4) - 1 freq firebaws (4) - 1 freq jing-bang (4) - 15 freq line-ups (4) - 1 freq neeburs (4) - 7 freq linear (4) - 3 freq fife-born (4) - 1 freq neibors (4) - 7 freq vineyard (4) - 7 freq neebors (4) - 79 freq |
nine-bars (0) - 1 freq wine-baurs (3) - 1 freq nibors (6) - 2 freq neebors (6) - 79 freq infobears (6) - 1 freq neebirs (6) - 9 freq neibors (6) - 7 freq neeburs (6) - 7 freq nighbors (6) - 1 freq nighbers (6) - 11 freq miners (7) - 41 freq ninevites (7) - 2 freq non-binary (7) - 3 freq novembar (7) - 1 freq jiners (7) - 6 freq cinnabar (7) - 1 freq niebuhrs (7) - 2 freq diners (7) - 1 freq haunlebars (7) - 1 freq nipnebs (7) - 5 freq liners (7) - 2 freq nighbours (7) - 3 freq new-born (7) - 3 freq nayburs (7) - 1 freq numbers (7) - 64 freq |
SoundEx code - N516 number - 172 freq numbers - 64 freq nine-bars - 1 freq number-plates - 1 freq non-pairty - 1 freq numbered - 5 freq nambarrie - 1 freq number'll - 1 freq nonpareil - 1 freq non-partisan - 1 freq nanbreid - 1 freq nonpairlament - 1 freq €œnumber - 1 freq nhmbr - 1 freq |
MetaPhone code - NNBRS nine-bars - 1 freq |
NINE-BARS |
Time to execute Levenshtein function - 0.226209 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.392531 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.027788 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.038069 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.000887 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. |