String cannot contain any part of another string .NET 2.0

Question

I'm looking for a simple way to discern if a string contains any part of another string (be that regex, built in function I don't know about, etc...). For Example:

string a = "unicorn";
string b = "cornholio";
string c = "ornament";
string d = "elephant";

if (a <comparison> b)
{
    // match found ("corn" from 'unicorn' matched "corn" from 'cornholio')
}

if (a <comparison> c)
{
    // match found ("orn" from 'unicorn' matched "orn" from 'ornament')
}

if (a <comparison> d)
{
    // this will not match
}

something like if (a.ContainsAnyPartOf(b)) would be too much to hope for.

Also, I only have access to .NET 2.0.

Thanks in advance!

So a and d don't match, even though they both contain the substring "n"? — Marcelo Cantos
– Marcelo Cantos, Commented Apr 21, 2010 at 13:15

juharr · Accepted Answer · 2010-04-21 13:17:47Z

5

This method should work. You'll want to specify a minimum length for the "part" that might match. I'd assume you'd want to look for something of at least 2, but with this you can set it as high or low as you want. Note: error checking not included.

public static bool ContainsPartOf(string s1, string s2, int minsize)
{
    for (int i = 0; i <= s2.Length - minsize; i++)
    {
        if (s1.Contains(s2.Substring(i, minsize)))
            return true;
    }
    return false;
}

answered Apr 21, 2010 at 13:17

juharr

32.4k4 gold badges60 silver badges95 bronze badges

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

1 Comment

Aaron Over a year ago

Perfect. I was hoping there would be something in .NET for it but this works just as well!

great_llama · Accepted Answer · 2010-04-21 13:21:00Z

3

I think you're looking for this implementation of longest common substring?

answered Apr 21, 2010 at 13:21

great_llama

11.7k4 gold badges36 silver badges29 bronze badges

Comments

Benjamin Podszun · Accepted Answer · 2010-04-21 13:19:47Z

1

Your best bet, according to my understanding of the question, is to compute the Levenshtein (or related values) distance and compare that against a threshold.

answered Apr 21, 2010 at 13:19

Benjamin Podszun

9,8573 gold badges37 silver badges46 bronze badges

Comments

Justin Niessner · Accepted Answer · 2010-04-21 13:19:13Z

0

Your requirements are a little vague.

You need to define a minimum length for the match...but implementing an algorithm shouldn't be too difficult when you figure that part out.

I'd suggest breaking down the string into character arrays and then using tail recursion to find matches for the parts.

answered Apr 21, 2010 at 13:19

Justin Niessner

246k40 gold badges416 silver badges546 bronze badges

Collectives™ on Stack Overflow

String cannot contain any part of another string .NET 2.0

4 Answers 4

1 Comment

Comments

Comments

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

4 Answers 4

1 Comment

Comments

Comments

Comments

Your Answer

Sign up or log in

Post as a guest

Related