[ Date Index ][
Thread Index ]
[ <= Previous by date /
thread ]
[ Next by date /
thread => ]
On Mon, Apr 08, 2002 at 09:45:15PM +0100, Adrian Midgley wrote:
but how dictionaries for spell checking are stored hasn't leapt out at me yet.
Well, you can index the words and index them phonetically encoded using a balanced binary tree. You can't index the hamming distance checks, it's just too much. Hamming distance checking on phonetically encoded words is quite effective. You can always store "common" mistakes, and check them first. Steve -- The Mailing List for the Devon & Cornwall LUG Mail majordomo@xxxxxxxxxxxx with "unsubscribe list" in the message body to unsubscribe.