English string segmentation

Question

2.00/5 (1 vote)

See more:

recently~ i met a question about the english string segmentation in my project.
at first,there is a substring database ,and how to segmentation a input string in at all most through match the substring database.

ie:

C#

inputstring="womenshic++programmerandorcodeproject";
substringdatebase[]={"wo","men","wome",
                     "c","c++","shi",
                    "program","programmer","and",
                    "or","code","project"
                     ..........
                    };

as follow affter segmentation:

C#

outstring={"wo","mem","shi".....};

Posted 6-Jan-12 16:51pm

hengfeng

Updated 6-Jan-12 19:48pm

Mehdi Gholam

v2

Add a Solution

Comments

Sergey Alexandrovich Kryukov 6-Jan-12 23:04pm

Not clear what do you mean by a segment. An example is not a definition. Is it a syllable? Anyway, this is a complex linguistic problem. You probably need a whole knowledge base: known syllables and all flexes, their usage, etc.
--SA

hengfeng 7-Jan-12 21:56pm

thank you~

1 solution

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)

YvesDaoust · Answer 1 · 2012-02-17T02:51:00

For efficiency of the search, you can represent your substrings using a trie data structure (http://en.wikipedia.org/wiki/Trie[^]).

Then repeatedly perform a search for the longest string that matches some substring. Anyway, this is not a bulletproof solution, as long substring matches could supersede shorter substring matches and lead to a dead end.

Example: looking for { "ab", "abc", "ce" } in "abce" would detect "abc" and then fail on "e", whereas there is a solution with "ab" followed by "ce".