how to find whether the input string is meaningful

[Chuthu]

I'm writing a C program where the user enters a string and the program aims at finding whether the input string is meaningful English word or not. Comparing each and every input word with the dictionary words kept in another file is highly impossible. Is there any another way to do this?

[sicarie]

I'm writing a C program where the user enters a string and the program aims at finding whether the input string is meaningful English word or not. Comparing each and every input word with the dictionary words kept in another file is highly impossible. Is there any another way to do this?

Why is that impossible?

[Chuthu]

Why is that impossible?

What I assumed was to keep a list of all meaningful English words in a separate text file and get the usr input.The user may enter any text and any amount of text at run rime. To check if each entered word is meaningful or not, it has to be compared with every word in the text file and if it matches, it's meaningful or else it's not. But is it really feasible to have all the words in the dictionary (which may run to lakhs of words) in a file and check for text matching? Is there a better alternative for this?

[weaknessforcats]

To check if each entered word is meaningful or not, it has to be compared with every word in the text file

Yes there is. It comes down to your lookup. If a words starts with H, maybe you only check the words that start with H and not then entire dictionary.

Here's where functions can help you.

You an write a Lookup() that does a complete dictionary search and call it to find a word. Later you can rewrite Lookup() to do a more efficicent search. Then all you need to is recompile your code to use the new function.

[Chuthu]

Yes there is. It comes down to your lookup. If a words starts with H, maybe you only check the words that start with H and not then entire dictionary.

Here's where functions can help you.

You an write a Lookup() that does a complete dictionary search and call it to find a word. Later you can rewrite Lookup() to do a more efficicent search. Then all you need to is recompile your code to use the new function.

Okay. Searching can be narrowed down. But can all the words found in the dictionary be made to fit in the file?

[weaknessforcats]

Probably. Do understand a dictionary does not have to be in one file. You could have a lot of files and those files could be organized as trees so you don't have to search the entire file evey time.

[Chuthu]

Probably. Do understand a dictionary does not have to be in one file. You could have a lot of files and those files could be organized as trees so you don't have to search the entire file evey time.

Can you please tell me how to organize the collection of files as a tree hierarchy?

[weaknessforcats]

You just use a file rather than memory for your tree:

struct Word
{
     char theWord[20];
     char theDefinition[500];
     size_t  theLocation;           //seek to this for theWord
     //Left:
     size_t   Left;                    //seek to this for the next word less in sequence
     //Right
    size_t    Right;                  //seek to this for the next word greater in sequence
 
 
};
 

New words are always added to the end of the file.

Off you go, and your tree is now a disc file.