Findings the Unmatched Strings

Question

Lets say that I have two strings:

"The System is in halt state."
"The System is in [A] state."

Is it possible to find the difference between the two strings ,I need both [A] and halt as output.

As of now i'm splitting every word and check for the match.

Is there any better way...?

Similar question (and answer) can be found [here](http://stackoverflow.com/questions/208094/how-to-find-difference-between-two-strings) — JleruOHeP, Mar 30 '12 at 05:30

score 1 · Accepted Answer · answered Mar 30 '12 at 06:05

1

string a = "The System is in halt state."; string b = "The System is in [A] state.";

        var vardiff =( a.Split(new char[] { ' ' }).Except(b.Split(new char[] { ' ' }))).ToList<string>();
        var vardiff1 = (b.Split(new char[] { ' ' }).Except(a.Split(new char[] { ' ' }))).ToList<string>();

answered Mar 30 '12 at 06:05

Vetrivel mp

1,214
1
14
29

will it not fail if the 2nd line is "The System is in [A] Marina state." ? – Dhananjay Mar 30 '12 at 06:31

score 0 · Answer 2 · answered Mar 30 '12 at 05:33

0

Check this out:Diff Algorithm

Also: Longest common subsequence

There is also an implementation described here: sample code

answered Mar 30 '12 at 05:33

ganesshkumar

1,317
1
16
35

ganeeesh. pathutaen da,, i have used Longest common sub sequence logic dhan da.. Is there any Regular Expression ?.. – gout Mar 30 '12 at 05:38

score 0 · Answer 3 · answered Mar 30 '12 at 06:13

Really, the question isn't entirely clear on what you mean by "difference". Is it simply the number of characters that are the same, or a more heuristic way of comparing unmatched strings?

One algorithm you might want to explore is the Approximate String Comparisons Using Levenshtein Distance.

Findings the Unmatched Strings

3 Answers3