Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nonsensicaledonian (0) - 1 freq nonsensical (7) - 1 freq hotelcaledonia (7) - 1 freq bellacaledonia (8) - 27 freq caledonian (8) - 10 freq caledonia (9) - 16 freq €œcaledonia (9) - 1 freq caladonian (9) - 1 freq caledonians (9) - 2 freq caledonia' (9) - 1 freq monicalennon (9) - 2 freq conversational (10) - 4 freq non-shaetlan (10) - 1 freq conseederin (10) - 5 freq nonsense (10) - 77 freq nae-dialectial (10) - 1 freq nonsense' (10) - 1 freq septicaemia (10) - 3 freq conservationist (10) - 1 freq nonagenarian (10) - 1 freq onniaaldting (10) - 1 freq ronniecowan (10) - 1 freq watsoncomedian (10) - 2 freq cameronian (10) - 3 freq condescendin (10) - 5 freq |
nonsensicaledonian (0) - 1 freq nonsensical (10) - 1 freq caledonian (13) - 10 freq hotelcaledonia (13) - 1 freq monicalennon (14) - 2 freq non-inclusion (14) - 1 freq caladonian (14) - 1 freq bellacaledonia (14) - 27 freq nonsence (15) - 1 freq condescendin (15) - 5 freq nonsense- (15) - 2 freq no-sae-clean (15) - 1 freq consensual (15) - 1 freq newsonscotland (15) - 1 freq nonsense' (15) - 1 freq watsoncomedian (15) - 2 freq nonsense (15) - 77 freq caledonia' (15) - 1 freq €œcaledonia (15) - 1 freq caledonians (15) - 2 freq caledonia (15) - 16 freq insensed (16) - 4 freq concludin (16) - 3 freq unnerstanin (16) - 2 freq transylvanian (16) - 2 freq |
SoundEx code - N525 nonsense - 77 freq nonsense' - 1 freq non-accent - 1 freq nonagenarian - 1 freq non-committal - 1 freq non-commonity - 1 freq nansense - 1 freq name-caain - 1 freq nine-coonty - 1 freq noncommittal - 1 freq non-smoker - 1 freq noncombatant - 1 freq €œnonsense - 1 freq nonsensicaledonian - 1 freq naehamecomforts - 1 freq nonsinse - 1 freq nonsense- - 2 freq nonsence - 1 freq nonsensical - 1 freq nonacjiims - 1 freq |
MetaPhone code - NNSNSKLT |
NONSENSICALEDONIAN |
Time to execute Levenshtein function - 0.249246 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.430974 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.027926 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.039245 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.001032 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. |