Hi,
I am trying to recognize patterns. Given a input of multiple sentences, the program needs to detect if there are any recurring patterns of words (or groups of words) in them. The program does not have a set of patterns to begin searching with. It is just supposed to detect any and all patterns that exist in more than one sentence.
I really appreciate your help Guys
thanks
This Question has been solved and asker verified All Experts Exchange premium technology solutions are available to subscription members.
Experts Exchange has been collecting answers to technology questions since 1996…3 million and counting! If you have a question, chances are we already have your answer.
If you can't find the exact answer you're looking for, ask our exclusive community of 50,000 experts. You’ll get a personalized answer from a trusted professional.
Thousands of free tech tips, tricks, how-to’s and tutorials are available in our peer reviewed articles section. See for yourself how smart our experts are, no login required.
Save solutions to your questions, answers you’ve discovered through searching plus helpful articles in your personal knowledgebase for easy future access.
Access the answers to your technology questions today.
30-day free trial. Register in 60 seconds.
Members of the expert community talk about why the experience at Experts Exchange is different than what you will find anywhere else.
Try it out and discover for yourself.
30-day free trial. Register in 60 seconds.
Join the community of experts here and help other tech pros by answering question in your area of expertise. You can earn FREE access to all Experts Exchange's premium features and resources.
I think I got u, you wont stablish the pattern in the beginning. But how do u know what would be a pattern? For example the first sentence
aaa bbb cc
the second
aa bb bcc
In this case would you say that the first pattern is aa? or bbb?
What I want to tell is that you need to define for example if the blank space will be part of the pattern.
Sorry. I should have given examples to make it more clear.
you are right.
I would say any group of consecutive words (including the space or , etc) can be considered a possible pattern.
Say I have 5 groups of words as input.
Say 1st group of words is : bb asc ddd vhjk jksdjk lddsd
Say 2nd group of words is : vhjk jksdjk lddsd
Say 3rd group of words is : khjsd jhjksd jkhsd ui jkhkd
Say 4th group of words is : bb asc ddd vhjk jksdjk lddsd jik hsd bn
I like to take group 1, and make a list of possible patterns (groups of cosecutive words)
bb asc ddd vhjk jksdjk lddsd
bb asc ddd vhjk jksdjk
bb asc ddd vhjk
bb asc ddd
bb asc
asc ddd vhjk jksdjk lddsd
asc ddd vhjk jksdjk
asc ddd vhjk
asc ddd
ddd vhjk jksdjk lddsd
ddd vhjk jksdjk
ddd vhjk
vhjk jksdjk lddsd
vhjk jksdjk
jksdjk lddsd
And detect occurrences of these in the other groups. then I repeat the same process with other groups
On the face of it, it looks like just string matching might work but I like to check with people who have experience with regular expressions if its the best way to go. I would be grateful for any other suggestions to do this in a more efficient way : coding wise and performance wise
You can use the split method of String class. split receives the regular expression to match in a given String. For example:
String s will be the groups where you will search, and String g into split method will be your group that will reduce its size. So my advice is that you use StringTokenizer to separate your String g in order to pass all the patterns to split method:
bb asc ddd vhjk jksdjk lddsd
bb asc ddd vhjk jksdjk
bb asc ddd vhjk
bb asc ddd
bb asc
Business Accounts
Answer for Membership
by: javaexpertoPosted on 2009-03-26 at 14:24:14ID: 23995495
In java you can use Pattern and Matcher classes.
With Pattern class you stablish your pattern that u'll look for. With Matcher class you pass your input or string where the patterns are.
For example in the code below, you are looking for the pattern a*b, that's means cero or mora 'a' followed by one b.
The String you look for that pattern is "aaaaab". Finally you ask with Matcher object if there is any pattern and save the result into a boolean.
If you want the words instead of just know if there is a pattern, then u can use split method from String class, it method will return an array with the "words" matched in your string, for example
String s = "aaaaab"
String arrayResult[] = s.split("a*b")
Select allOpen in new window