Partial string matching algorithms

Question

Good morning,

Does anyone know about efficient algorithms for partial string matching? For example, given the two strings "woods" and "woodes", the algorithm could/should possibly return "wood+s", or " | e".

Thank you very much.

Sounds like you are looking for a stemming algorithm. en.wikipedia.org/wiki/Stemming — Gazler
– Gazler, Commented Oct 22, 2010 at 8:38
That's not what I am looking for. Anyway, thank you very much. — Miguel
– Miguel, Commented Oct 22, 2010 at 8:47

hmuelner · Accepted Answer · 2010-10-22 13:09:16Z

3

Search for "Levenshtein algorithm" and/or "diff algorithm" on stackoverflow.

answered Oct 22, 2010 at 13:09

hmuelner

8,2351 gold badge31 silver badges40 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

mkind · Accepted Answer · 2010-10-22 08:33:03Z

2

that's a quite complex problem and named "sequence alignment problem". do you want to implement it by yourself? for a first look wikipedia provides a nice article: http://en.wikipedia.org/wiki/Sequence_alignment

answered Oct 22, 2010 at 8:33

mkind

2,0433 gold badges20 silver badges25 bronze badges

Collectives™ on Stack Overflow

Partial string matching algorithms

2 Answers 2

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related