The fastest way to search a dictionary file

[jb0525283]

hi all, I'm starting the design of a unique spelling program and am not sure how to handle the dictionary file. I need the spell checking to be fast. I thought about just having a file with all the words, and just use the .net-framework's find feature, but does anyone know what algorithm it uses. Would I be ahead to use a database through linq. I need advice as to the fastest possible way to do this.

[markWilson]

Hi,
There are many online tools are available for spell check , google provides API for same also.
but still if you want to create your own spell check yes you can use linq tech which will be fast as compare with other.

[jb0525283]

Thanks KiranK for your reply I had a thought that the find method in text file would be slowest.