Reputation: 3506
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.
Upvotes: 3
Views: 4551
Reputation: 8231
Search for "Levenshtein algorithm" and/or "diff algorithm" on stackoverflow.
Upvotes: 3
Reputation: 2043
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
Upvotes: 2