Getting alike letters from a paragraph in c# win. form

Question

2.11/5 (6 votes)

See more:

.NET3.5

How to get alike letters from a paragraph which occur more than one in a paragraph in c# win. form.

Example:-"My name is jonathan. I prefer science than humanties."

The above example should give output than & ie as it appears twice in the paragraph. [minimum match for letters should be 2 or more letters]
Can somebody give me an idea how to achieve this?

Thanks in Advance

Posted 9-May-14 4:07am

agent_kruger

Updated 9-May-14 4:30am

v3

Add a Solution

Comments

[no name] 9-May-14 10:24am

And what is with "ie" which occurs in science and humanties?

agent_kruger 9-May-14 10:30am

nice observation sir, updated the question.

Sergey Alexandrovich Kryukov 9-May-14 10:50am

Besides, "I prefer science than humanties" is not correct usage. "Prefer" does not assume comparison, so it is incompatible with "than". "Humanties" is misspelled. If this is supposed to be a tool for improving the writing, it won't really help much. :-)
—SA

agent_kruger 10-May-14 0:34am

sorry sir, for the wrong spelling but sir, do you have the knowledge how to achieve this?

Sergey Alexandrovich Kryukov 10-May-14 19:07pm

Please, no need to apologize; I just wanted to help you with usage/spelling. I don't think the problem is too difficult, but solving it with reasonable efficiency needs some thinking...
—SA

[no name] 9-May-14 11:03am

So you are generally for equal sequences...think about "sub sequences"...You need to first write down the rules...
Btw in your example there are other 2char sequences, e.g. "an", "na"...maybe more

agent_kruger 10-May-14 0:35am

sir, i need to get those records which occur more than once and are of 2 or more chars.

Kschuler 9-May-14 10:55am

You may want to research regular expressions. I think that's going to be your best bet.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Richard MacCutchan · Answer 1 · 2014-05-09T05:24:00

Solution 1

You need to write a string parser that looks for similar sequences in each word. So you start by extracting the various sets from the first word in the sentence, and search for all other occurrences in the remaining words. Keep a note and count of all matches. Then repeat the process for all the other words in the sentence until you have processed everything.

Posted 9-May-14 5:24am

Richard MacCutchan

Updated 9-May-14 21:18pm

v3

Comments

agent_kruger 10-May-14 0:39am

sir, do you mean that i have to loop each char. and check if the paragraph contains more than 1 occurrences.

Richard MacCutchan 10-May-14 3:17am

Yes; after all, how else could you find all occurrences?

agent_kruger 10-May-14 4:43am

sir suppose a word is "pneumonoultramicroscopicsilicovolcanoconiosis" then it will check all 45 letters but how will it check if 2 or more letters are same here?

Richard MacCutchan 10-May-14 5:09am

Start with 'p' and compare it against all the remaining letters. Next go to 'n' and check it against all the remaining letters. Repeat until you have checked them all.

agent_kruger 10-May-14 6:45am

sir, that is ok but what about i have to check it with more than 1 letters like in the above word "si" appears twice

Richard MacCutchan 10-May-14 6:48am

Then you need to decide how many letters to select in each group before you start searching. So if you decide you want 2 letters you start with "pn", then "ne", and so on. If 3 letters, the start with "pne", then "neu" etc. It's all fairly logical.

agent_kruger 10-May-14 6:50am

sir, it cannot be decided as it depends on the length of the line it can go till 1000 in your case sir.

Richard MacCutchan 10-May-14 6:52am

Well how else can you find common strings?

agent_kruger 10-May-14 6:57am

sir, that is why i posted the question because if the content contains 100 lines and 1,000,000 char it will take about 30 min to calculate multiple occurrences.

Richard MacCutchan 10-May-14 7:01am

Well you could look into the use of Suffix Trees as suggested below by Matt.

agent_kruger 10-May-14 7:29am

same question to you sir, can you give me an example how to use your "Suffix Trees"?

Richard MacCutchan 10-May-14 8:06am

I have no examples, you will have to follow the links and figure it out for yourself.

agent_kruger 11-May-14 4:21am

sir, actually that's the problem i cannot figure out how to use it.

Richard MacCutchan 11-May-14 4:25am

Then I suggest you try a simpler project.

agent_kruger 11-May-14 4:24am

sir, for example when you compare 2 versions of questions in code project. I want the same thing in my case.

Richard MacCutchan 11-May-14 4:27am

Sorry, but what does that have to do with your original question? Text comparison is handled quite easily with the String class.

agent_kruger 11-May-14 4:38am

srry sir, was posting this comment to different question.

Sergey Alexandrovich Kryukov 10-May-14 19:08pm

That would be really simple for words, but OP also requires matches in all fragments of words, which is harder because there are no special delimiters in those fragments...
—SA

Richard MacCutchan 11-May-14 3:37am

Sorry, where does he say that?

Sergey Alexandrovich Kryukov 11-May-14 10:13am

Oh, it's apparent from the OP's example: "then" from "jonathan" is matched with the word "than"; "ie" from "science" and "humanities".
—SA

Richard MacCutchan 11-May-14 10:37am

There is no "then" in "jonathan"; I think you are confused.

Sergey Alexandrovich Kryukov 11-May-14 14:41pm

It's "than". Please look again...
—SA

Richard MacCutchan 11-May-14 15:33pm

That's what I said!

Sergey Alexandrovich Kryukov 11-May-14 21:29pm

No, there is "than" in "jonathan" (even if this is another typo; please see my comment on the top).
—SA

Richard MacCutchan 12-May-14 5:06am

That is what I said! You started talking about "then".

Matt T Heffron · Answer 2 · 2014-05-09T06:56:00

Solution 2

This looks like a job for Suffix Trees[^].
A book reference is: Algorithms on Strings, Trees, and Sequences[^]

Posted 9-May-14 6:56am

Matt T Heffron

Comments

[no name] 9-May-14 12:59pm

That is a good hint, my 5

Matt T Heffron 9-May-14 13:02pm

Thanks

agent_kruger 10-May-14 0:37am

sir, can you give me an example how to use your "Suffix Trees"?