Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4155))

  • 580 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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 

  2. Crammer, K., Singer, Y.: On the algorithmic implementation of multiclass kernel–based vector machines. Journal of Machine Learning Res 2, 265–292 (2002)

    Article  MATH  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 

  4. Ginsberg, M.L.: Dynamic Backtracking. Journal of Artificial Intelligence Research 1, 25–46 (1993)

    MATH  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 

  6. Kwok, C., Etzioni, O., Weld, D.S.: Scaling question answering to the web. ACM Trans. Inf. Syst. 19(3), 242–262 (2001)

    Article  Google Scholar 

  7. Littman, M.L.: Review: computer language games. Journal of Computer and Games 134, 396–404 (2000)

    Google Scholar 

  8. Littman, M.L., Keim, G.A., Shazeer, N.M.: A probabilistic approach to solving crossword puzzles. Journal of Artificial Intelligence 134, 23–55 (2002)

    Article  MATH  Google Scholar 

  9. Mazlack, L.J.: Computer construction of crossword puzzles using precedence relationships. Journal of Artificial Intelligence 7, 1–19 (1976)

    Article  MATH  Google Scholar 

  10. News–Nature: Program crosses web to fill in puzzling words. Nature 431, 620 (2004)

    Google Scholar 

  11. Pohl, I.: Heuristic search viewed as path finding in a graph. Journal of Artificial Intelligence 1, 193–204 (1970)

    Article  MATH  MathSciNet  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gori, M., Ernandes, M., Angelini, G. (2006). Cracking Crosswords: The Computer Challenge. In: Stock, O., Schaerf, M. (eds) Reasoning, Action and Interaction in AI Theories and Systems. Lecture Notes in Computer Science(), vol 4155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11829263_15

Download citation

  • DOI: https://doi.org/10.1007/11829263_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37901-0

  • Online ISBN: 978-3-540-37902-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics