FQAS

[moses woldeselassie <moses@kampsax.dtu.dk>]

Hi All

I'm currently doing a project for a Flexible Query Answering Systems.

I wanted to know if anyone knows where I could find
Algorithms or source code in C/java for the following problems, which is

approximate string matching.

1. Lists over Synonymies strings.
    (E.g. good=well=nice, bad=awful etc.)

2. Lists over strings combinations, which is equivalents
   (E.g. s = ss, ch = ck = k, ph=f, etc.)

3. Sub-strings matching by wildcard.
    (E.g.
    A:  a single character wildcard-1
      mus?? ==> mussie or mussae
    B:  the optional char wildcard
     colo$r ==> color or colour
    C:  String wildcard
       math* ==> math, mathematics or mathematical. )
4. Longest common Sub-string
   (I may use the Boyer moore algorithm)

If u need more information just send me an e-mail.

I'm looking forward to get your e-mail.

Best regards,
Moses