Abstract
In language games, word meanings play a central role. This means that closed world assumptions that are so powerful in many games cannot be depended on. This paper describes implemented systems that play the language games of American-style crosswords, cryptic crosswords, Trivial Pursuitâ„¢, and punning riddles. These early efforts illustrate the challenge of language games, demonstrate some emerging ideas for tackling language games by computer, and indicate fruitful areas for future research.
Acknowledgement
I received valuable help from Justin Boyan, Peter Stone,William Tunstall-Pedoe, David Reiter, Lisa Littman, Jennifer Davis, Giles Davis, Kim Binsted, Amit Singhal, Steve Abney, Satinder Singh, and Jonathan Schaeffer during the preparation of this paper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Steven Abney, Michael Collins, and Amit Singhal. Answer extraction. In Proceedings of the 6th Applied Natural Language Processing Conference, pages 296–301, 2000.
Kim Binsted and Graeme Ritchie. An implemented model of punning riddles. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), 1994.
Kim Binsted and Osamu Takizawa. A model of Japanese puns and its implementation. In Proceedings of the 4th conference of the Australian Cognitive Science Society, 1998.
Justin Andrew Boyan. Learning Evaluation Functions for Global Optimization. PhD thesis, School of Computer Science, Carnegie Mellon University, 1998.
Paul R. Cohen and Edward A. Feigenbaum, editors. The Handbook of Artificial Intelligence: Volume III. William Kaufmann Inc., 1982.
M. L. Ginsberg, M. Frank, M. P. Halpin, and M. C. Torrance. Search lessons learned from crossword puzzles. In Proceedings of the Eighth National Conference on Artificial Intelligence, pages 210–215, 1990.
Greg A. Keim, Noam Shazeer, Michael L. Littman, Sushant Agarwal, Catherine M. Cheves, Joseph Fitzgerald, Jason Grosland, Fan Jiang, Shannon Pollard, and Karl Weinmeister. Proverb: The probabilistic cruciverbalist. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pages 710–717, 1999.
Richard E. Korf. Finding optimal solutions to Rubik’s cube using pattern databases. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 700–705. AAAI Press/The MIT Press, 1997.
Thomas K. Landauer and Susan T. Dumais. Asolution to Plato’s problem: The latent semantic analysis theory of acquisition, induction and representation of knowledge. Psychological Review, 104(2):211–240, 1997.
Jonathan Schaeffer. One Jump Ahead: Challenging Human Supremacy in Checkers. Springer-Verlag, 1997.
Noam M. Shazeer, Michael L. Littman, and Greg A. Keim. Solving crossword puzzles as probabilistic constraint satisfaction. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pages 156–162, 1999.
Brian Sheppard. Computers and language games. IEEE Intelligent Systems, 14(6):15–16, November/December 1999. In Trends and Controversies, Playing with AI (Haym Hirsch, editor).
Ellen M. Voorhees and Dawn M. Tice. Building a question answering test collection. In SIGIR 2000: Proceedings of the 23rd Annual International ACM SIGIR COnference on Research and Development in Information Retrieval, pages 200–207. ACM Press, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Littman, M.L. (2001). Review: Computer Language Games. In: Marsland, T., Frank, I. (eds) Computers and Games. CG 2000. Lecture Notes in Computer Science, vol 2063. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45579-5_26
Download citation
DOI: https://doi.org/10.1007/3-540-45579-5_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43080-3
Online ISBN: 978-3-540-45579-0
eBook Packages: Springer Book Archive