| Author |
java exercise help
|
henry dias
Greenhorn
Joined: Mar 22, 2011
Posts: 2
|
|
Find the 10 most common and 10 least common words in the textfile.
Find the 10 most common and 10 least common bigrams in the file. (A bigram is two words following each other in the text. (F.ex. "The red fox" contains 2 bigrams: "The red" and "red fox". - See http://en.wikipedia.org/wiki/Bigram) )
Find the longest phrase that also appears at least twice.
("longest phrase" here means the number of words, NOT letters)
|
 |
Henry Wong
author
Sheriff
Joined: Sep 28, 2004
Posts: 16692
|
|
Please tell us what you have done so far. Please tell us *exactly* what issue you are running into. We can't help you if we don't know where you are stuck.
Henry
|
Books: Java Threads, 3rd Edition, Jini in a Nutshell, and Java Gems (contributor)
|
 |
henry dias
Greenhorn
Joined: Mar 22, 2011
Posts: 2
|
|
The issue i am facing is for correct regexp
i am getting words as citizen. citzen, and citizen; i want to remove the , . ; after words and then check for thier repetition in file .
|
 |
Rob Spoor
Sheriff
Joined: Oct 27, 2005
Posts: 19216
|
|
|
Please UseCodeTags next time. I've added them for you this time.
|
SCJP 1.4 - SCJP 6 - SCWCD 5
How To Ask Questions How To Answer Questions
|
 |
Campbell Ritchie
Sheriff
Joined: Oct 13, 2005
Posts: 32675
|
|
Welcome to the Ranch
I do not think a regular expression will help you at all. Go through the Java™ Tutorials Collections section and you will find a counting application example.
|
 |
 |
|
|
subject: java exercise help
|
|
|