Words in bold indicate how you should refer to the item when discussing it with me or others.
These items should get done within a release or two.
Things items will eventually be implemented as I know they are important however I am not sure when they will get done.
These items will eventually be implemented. I hope to have them all done before I move aspell to beta testing. They are in the approximate order of when they will get done.
I plan on doing these things eventually. It is just a matter of getting around to it.
These items all sound like good ideas however I am not sure when I will get to implementing then if ever. If you are looking for a way to contribute picking up on one of these ideas would be a great way to start. They are presented in no particular order.
Theses ideas are not likely to get implemented any time soon.
Due to the current way my spell checker works implementing affix compression would be next to impossible. Nevertheless, I do realize that for some languages affix compression is very important.
So to solve this dilemma I plan on having two different modes of my spell checker: One with affix compression that does not use soundslike pairs (much like ispell) and one without affix compression that does use soundslike.
I plan to extract the affix manipulation code from Ispell with the help of an Ispell author. The tricky part would be getting this to getting this all to work properly at tun time bases on the dictionary used.
This problem extends back to the fact of the way words are index is Aspell. This problem will get resolved when I implanted the affix compression mode as only one index would be used.
Iwant to implement this give other people an idea of how it should be done and because I am really sick of having to spell check through url and email address.
This was posted on the Aspell mailing list on January 1, 1999:
I had an idea on a great general way to determine if a word should be skipped. Determine the words to skip based on the symbols that (almost) always surround the word.
For example when asked to check the following C++ code:
Given the following html code.
So I was wondering if anyone on this list has any experience in writing this sort of context recognition code or could give me some pointers in the right direction.
This sort of word skipping will be very powerful if done right. I imagine that it could replace specific spell checker modes for Tex, Nroff, SGML etc because it will automatically be able to figure out where it should skip words. It could also probably do a very good job on programming languages code.
If you are interested in helping be out with this or just have general comments about the idea please let me know.
Geoff Kuenning (one of the Ispell authors) gave me this idea. He suggest that I table-drive the conversion instead of hard wiring the code to encourage other people to come up with a to_soundslike method for their language. ``My experience with ispell leads me to believe that if we could give fairly explicit instructions about how to design a metaphone algorithm for a language, there are people out there who are eager to do the work.''
This sounds like a good idea to and it is something I hope to implement eventually as it would surely beat my current crude method of just deleting all the values for languages without a customized to_soundslike method for the language.
Knud Haugaard Sørensen suggested this one. From his email on the Aspell mailing list:
consider this examples.
a fone number. -> a phone number.
a fone dress. -> a fine dress.
the example illustrates that the right corection might depend on the context of the word. So I suggest that you take a look on HMM to solve this problem.
This might also provide a good base to include gramma correction in aspell.
see this link http://www.cse.ogi.edu/CSLU/HLTsurvey/ch1node7.htmlI think it is a great idea. However unfortunately it will probably be very complicated to implement. Perhaps in the far future...