Approximate string matching and the automation of word games
Hal Berghel, David Roach, John R. Talburt · 2002
It is shown how approximate sting matching can be involved in the automation of various aspects of word game construction or solution. In the discussion, the authors try to identify and explicate the underlying issues in computational linguistics and suggest techniques which have been used to address these issues. It is shown that the two main issues which arise in this context have to do with lexical processing and heuristics, issues which arise in more practical contexts as well.>