Cracking Crosswords: The Computer Challenge
Crosswords is over 90 years old, yet it is still one of the most popular puzzles around the world. It is in fact a linguistic game which requires a wide knowledge in different domains and the ability to crack enigmatic clues, that are often regarded as inherent human capabilities. Unlike chess, crossword solving does not require strong skills for the actuation of strategic plans, but the linguistic specifications is in itself a source of enormous difficulty for machines.
This paper discusses the problem of automatic crossword solving with special emphasis to the WebCrow project carried out at the University of Siena. After a brief historical description of the evolution of crosswords, the paper gives a formalization of the main problems to be faced and provides a number of relevant architectural issues behind cracking crosswords. In particular, it is claimed that the Web is likely to be the most important source for the development of challenging programs based on clue answering, a sort of question answering mechanism in which the machine is expected to return candidate word solutions.
KeywordsCorrect Answer Candidate List Compound Word Statistical Filter Correct Word
Unable to display preview. Download preview PDF.
- 1.Bosco, C., Lombardo, V., Vassallo, D., Lesmo, L.: Building a Treebank for Italian: a Data–driven Annotation Schema. In: Proceedings of LREC (2002)Google Scholar
- 3.Ginsberg, M.L., Frank, M., Halping, M.P., Torrance, M.C.: Search lessons learned from crossword puzzles. In: Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI 1990), pp. 210–215 (1990)Google Scholar
- 5.Keim, G.A., Shazeer, N.M., Littman, M.L.: PROVERB: the probabilistic cruciverbalis. In: AAAI 1999: Proceedings of the sixteenth national conference on Artificial Intelligence, pp. 710–717 (1999)Google Scholar
- 7.Littman, M.L.: Review: computer language games. Journal of Computer and Games 134, 396–404 (2000)Google Scholar
- 10.News–Nature: Program crosses web to fill in puzzling words. Nature 431, 620 (2004)Google Scholar
- 12.Schmid, H.: Probabilistic Part–of–Speech Tagging Using Decision Trees. In: International Conference on New Methods in Language Processing (1994)Google Scholar
- 13.Schmid, H.: Improvements in Part-of-speech Tagging with an Application to German. In: Proceedings of the EACL SIGDAT Workshop (1995)Google Scholar
- 14.Shazeer, N.M., Keim, G.A., Littman, M.L.: Solving crosswords as probabilistic contraint satisfaction. In: AAAI 1999: Proceedings of the sixteenth national conference on Artificial Intelligence, pp. 156–152 (1999)Google Scholar
- 15.Tsochantaridis, I., Hofmann, T., Joachims, T., Altun, Y.: Support vector machine learning for interdependent and structured output spaces. In: ICML 2004: Twenty–first international conference on Machine learning (2004)Google Scholar
- 16.Voorhees, E.M., Tice, D.M.: Overview of the TREC–9 Question Answering Track. In: Proceedings of the Ninth Text REtrieval Conference (TREC–9) (2000)Google Scholar