如何查找最小替换字符串或正则表达式以将字符串转换为另一个字符串

Question

Ok the title may be not correct but this is what i came as best

My question is this

Example 1

see , saw

I can convert see to saw with as

replace ee with aw

        string srA = "see";
        string srB = "saw";

        srA = srB.Replace("aw", "ee");

Or lets say

show , shown

add n to original string

Now what i want it is, with minimum length of code, generating such procedures to any compared strings

Looking for your ideas how can i make it? Can i generate regexes automatically to apply and convert?

c# 6

Answer 1

Check diffplex and and see if it is what you need. If you want to create a custom algorithm, instead of using a 3rd party library just go through the code -it's open source.

You might also want to check this work for optimizations, but it might get complicated.

Then there's also Diff.NET .

Also this blog post is part of a series in implementing a diff tool.

If you're simply interested in learning more about the subject, your googling efforts should be directed to the Levenshtein algorithm .

I can only assume what your end goal is, and the time you're willing to invest in this, but I believe the first library should be enough for most needs.