|corrections on a dfa's input strings? email@example.com (2008-04-11)|
|Re: corrections on a dfa's input strings? DrDiettrich1@aol.com (Hans-Peter Diettrich) (2008-04-11)|
|Re: corrections on a dfa's input strings? firstname.lastname@example.org (Gene) (2008-04-15)|
|Re: corrections on a dfa's input strings? email@example.com (Stefan Monnier) (2008-05-20)|
|Date:||Fri, 11 Apr 2008 04:50:29 -0700 (PDT)|
|Keywords:||lex, question, errors|
|Posted-Date:||11 Apr 2008 16:26:34 EDT|
I've implemented a dfa with a keyword tree, I'm already adding and
removing keys from it, or even perfoming completion as readline does
for us on a console.
My question is if there's anybody who could tell me about algorithms,
names (I'm not english), or resources I can look for when trying to do
corrrections on input strings against those already registered within
The idea is quite similar to the "did you mean: ..." from google. I
feed the dfa with a string for a lookup operation, and perhaps that
operation returns unsuccesful as there's no key registered matching
exactly the input string, then, an algorithm comes to aid doing some
trial an error, till it deduces that either, the user made a typo, or
that others keys sintactically similar could also match his/her
Any comments really appreciated.
Return to the
Search the comp.compilers archives again.