DocumentCode
1595471
Title
Approximate string matching and the automation of word games
Author
Berghel, Hal ; Roach, David ; Talburt, John
Author_Institution
Arkansas Univ., Fayetteville, AR, USA
fYear
1990
Firstpage
209
Lastpage
213
Abstract
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
Keywords
artificial intelligence; computational linguistics; games of skill; pattern recognition; approximate sting matching; computational linguistics; heuristics; lexical processing; word games; Automation; Computational intelligence; Computational linguistics; Cryptography; Expert systems; Geometry; Heart; Knowledge representation; Pressing; Shape;
fLanguage
English
Publisher
ieee
Conference_Titel
Applied Computing, 1990., Proceedings of the 1990 Symposium on
Conference_Location
Fayetteville, AR
Print_ISBN
0-8186-2031-5
Type
conf
DOI
10.1109/SOAC.1990.82170
Filename
82170
Link To Document