Viewing Thread:
"JAVA Help needed"

Ok I need a bit of help, I have to write a Java program that acts as a spell checker, it reads in a file (used as a dictionary) and places the words in a binary tree. It then reads in another file to check, if any words are incorrect it asks if the user wants to add them to the dictionary. Then output the correct words and write the dictionary to a file.

I was thinking I will need to use string tokenizer to break each line down into words and a Binary search tree to store the dictionary then check each word with them.
Just wondering if anyone out there who knows their java would be willing to give me help or pointers of I get stuck.

thanks if you are able to help.

Bit stuck, I am trying to search for a word in the binary tree which should be filled with words loaded in from the dictionary. I use string tokenizer to get the word but I need to know how to get it to search for the word and give some sort of output

ie
If the word is found move on to the next one but if it isn't found (how do you know if it isn't found?) then inform the user and ask them if they want to add it to the dictionary.

Ok need a little help to do with tree balancing. Anyone out there offer any kind of help on this?

Wasn't sure if you were still around. Good to see you are still around.
I have quite a bit done, got the code to load in the files (the dictionary automatically and the other one the user enters into the DOS window) I have set up the string tokenizer to read each word (space being the terminating character) and have a little code for the tree set up but no methods like add, remove, find etc so i'll need to do them soon.

One of the problems I have is dealing with apostrophes and " - " within words, Im not sure how to handle them and to make sorting easier I know I would need to balance the tree so I need to look up how to do that.

String tokenizer is easy enough to code. I would have to think about the binary sorting.

Ok I need a bit of help, I have to write a Java program that acts as a spell checker, it reads in a file (used as a dictionary) and places the words in a binary tree. It then reads in another file to check, if any words are incorrect it asks if the user wants to add them to the dictionary. Then output the correct words and write the dictionary to a file.

I was thinking I will need to use string tokenizer to break each line down into words and a Binary search tree to store the dictionary then check each word with them.
Just wondering if anyone out there who knows their java would be willing to give me help or pointers of I get stuck.

thanks if you are able to help.