{"id":6070,"date":"2023-10-21T00:01:57","date_gmt":"2023-10-21T07:01:57","guid":{"rendered":"https:\/\/c-for-dummies.com\/blog\/?p=6070"},"modified":"2023-10-28T08:32:44","modified_gmt":"2023-10-28T15:32:44","slug":"finding-the-long-words","status":"publish","type":"post","link":"https:\/\/c-for-dummies.com\/blog\/?p=6070","title":{"rendered":"Finding the Long Words"},"content":{"rendered":"

Beyond knowing how many words are in the computer’s dictionary, another good measure to know is how many characters are in the longest word. Together, these two values give you a profile for the complete word matrix.
\n
\nContinuing the exploration of the Linux\/Unix\/macOS dictionary from last week’s Lesson<\/a>, the task at hand is to find the longest word stored in the dictionary file, \/usr\/share\/dictionary\/words<\/code>. In last week’s code, defined constant SIZE<\/code> is set to 32 and used in the fgets()<\/em> function to scoop out lines of text from the file and output the words.<\/p>\n

The value 32 is a guess. When a word is longer, the fgets()<\/em> function truncates it, which is okay, but the total word count would be off. That’s because the file position indicator remains on the same line as the truncated word, which alters the total word count output. I know this situation didn’t occur because the second program (from last week’s Lesson) just counted newlines and the results are same — at least for the dictionary I installed.<\/p>\n

Knowing the maximum size of a word in the dictionary is important if you want to manipulate the stored words. The value 32 is just a guess. For this week’s dictionary-reading program, I set a larger SIZE<\/code> value to read all the words in the dictionary file. The word count is monitored and successive larger words are output. The result shows the maximum word size.<\/p>\n

2023_10_21-Lesson.c<\/a><\/h3>\n
\r\n#include <stdio.h>\r\n#include <stdlib.h>\r\n#include <string.h>\r\n\r\n\/* this code assumes the following path is valid *\/<\/span>\r\n#define DICTIONARY \"\/usr\/share\/dict\/words\"\r\n#define SIZE 1024\r\n\r\nint main()\r\n{\r\n    FILE *dict;\r\n    int maxlen;\r\n    char word[SIZE],*r;\r\n\r\n    \/* open the dictionary *\/<\/span>\r\n    dict = fopen(DICTIONARY,\"r\");\r\n    if( dict==NULL )\r\n    {\r\n        fprintf(stderr,\"Unable to open %s\\n\",DICTIONARY);\r\n        exit(1);\r\n    }\r\n\r\n    \/* find the longest word *\/<\/span>\r\n    maxlen = 0;\r\n    while( !feof(dict) )\r\n    {\r\n        r = fgets(word,SIZE,dict);    \/* read a word *\/<\/span>\r\n        if( r==NULL )\r\n            break;\r\n        if( strlen(word) > maxlen )\r\n        {\r\n            printf(\"%s\",word);\r\n            maxlen = strlen(word);\r\n        }\r\n    }\r\n\r\n    \/* results *\/<\/span>\r\n    printf(\"The longest word is %d characters long\\n\",maxlen);\r\n\r\n    \/* close *\/<\/span>\r\n    fclose(dict);\r\n\r\n    return(0);\r\n}<\/pre>\n
Defined constant SIZE<\/code> is set to 1024 (1K), which should be adequate for any word in my mother tongue.<\/p>\n
After the dictionary file is opened, variable maxlen<\/code> is initialized to zero: maxlen = 0;<\/code><\/p>\n
A while<\/em> loop scans the dictionary file reading words just like last week’s Lesson The strlen()<\/em> function returns the word’s length and compares it with the value stored in maxlen<\/code>: if( strlen(word) > maxlen )<\/code> When the value is greater, the word is output and a new value for maxlen<\/code> is set.<\/p>\n
The program ends with a printf()<\/em> statement that outputs the character count for the longest word.<\/p>\n
Here’s a sample run:<\/p>\n
A
\nAA
\nAAA
\nAA's
\nABC's
\nACLU's
\nANZUS's
\nAachen's
\nAaliyah's
\nAberdeen's
\nAbernathy's
\nAbyssinian's
\nAdirondacks's
\nAfrocentrism's
\nAmericanization
\nAmericanization's
\nAndrianampoinimerina
\nAndrianampoinimerina's
\nelectroencephalograph's
\nThe longest word is 24 characters long<\/code><\/p>\n
Pretty!<\/p>\n
My initial guess value from last week’s Lesson was close, seeing how the longest word in my system’s dictionary is 24 characters and the original SIZE<\/code> value was set to 32. Different dictionaries yield different results, with the obnoxiously huge dictionary files containing scientific and technical words that may greatly exceed 24 characters.<\/p>\n
The point of this exercise isn’t just to know the type of matrix in which the words are stored (total word count and word size), but to avoid potential overflow. It’s too easy to guess at a shorter buffer, which not only can crop the output but can lead to misreading the words and messing up the results.<\/p>\n
I have more fun with the dictionary in next week’s Lesson<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"
To properly manipulate the word dictionary, you must know both the number of words and the size of the longest word. Continue reading →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-6070","post","type-post","status-publish","format-standard","hentry","category-main"],"_links":{"self":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/6070","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=6070"}],"version-history":[{"count":4,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/6070\/revisions"}],"predecessor-version":[{"id":6089,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/6070\/revisions\/6089"}],"wp:attachment":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=6070"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=6070"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=6070"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}