Stemming Algorithe in c# windows .net

This website is very helpful it contains code for steaming in many programming language, Maybe It can help you.

http://tartarus.org/~martin/PorterStemmer/

It's a kids' joke using regualr expressions

First you add the namespace
System.Text.RegularExpressions

Then you have to stock all suffixes within a data base or a table. I put them in an array to simplify the issue. Then you retrive all sufixes in a list. You retrieve also all targeted words in a list here an example of what to do exactly:

 string[] instances = {"hopeless","powerful","freedom"};
            string[] suffixes = { "less", "ful", "dom" };

            string result = "";
            foreach (string instance in instances)
            {
                foreach (string suffix in suffixes)
                {
                    if (Regex.IsMatch(instance, suffix))
                    {
                        result = Regex.Replace(instance, suffix, "", RegexOptions.None);
                        Console.WriteLine(result);
                    }
                }
            }
            Console.WriteLine("The job is done");
           Console.Read();

Hi,

Stemming means,If i enter "playing cicket" the algorithen return

"play","cricket"

it remove ing ,ed,and join words etc.

some example

watched->watch

crying->cry

dangerous->danger

What do you mean by stemming do you mean searching particular word within a text or somthing else