From mboxrd@z Thu Jan  1 00:00:00 1970
Date: Thu, 11 Nov 1999 13:10:29 +0200
From: Lucio De Re lucio@proxima.alt.za
Subject: [9fans] Brian Kernighan?
Topicbox-Message-UUID: 9be18dec-eac8-11e9-9e20-41e7f4b1d025
Message-ID: <19991111111029.9k23Ljq0l8sfibC0GgL4v7dL1Yg7L6zcgdAWJaSfnXo@z>

On Thu, Nov 11, 1999 at 11:56:05AM +0100, Elliott Hughes wrote:
>
> anyway, back to the point: the original questioner might be
> interested in "Finding Approximate Matches in Large Lexicons"
> by Justin Zobel (jz@cs.rmit.oz.au) and Philip Dart (philip@cs.mu.oz.au),
> which was the best paper i found when trying to come up with
> decent guesses in a "dict"-like program.
>
Thank you for the additional information.  As it happens, I'm
looking to match full mail names against potential spelling
errors.  The dictionary is consequently not very large, and the
problem should be tractable.  It's just that regular expressions
don't quite cut it :-(

++L