{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T16:10:40Z","timestamp":1760976640360},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4223,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0004-3702(01)00114-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:06:09Z","timestamp":1027577169000},"page":"23-55","source":"Crossref","is-referenced-by-count":32,"title":["A probabilistic approach to solving crossword puzzles"],"prefix":"10.1016","volume":"134","author":[{"given":"Michael L.","family":"Littman","sequence":"first","affiliation":[]},{"given":"Greg A.","family":"Keim","sequence":"additional","affiliation":[]},{"given":"Noam","family":"Shazeer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(01)00114-X_BIB001","series-title":"The Balancing Act","article-title":"Statistical methods and linguistics","author":"Abney","year":"1996"},{"issue":"6","key":"10.1016\/S0004-3702(01)00114-X_BIB002","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","article-title":"Indexing by latent semantic analysis","volume":"41","author":"Deerwester","year":"1990","journal-title":"J. Amer. Soc. Inform. Sci."},{"key":"10.1016\/S0004-3702(01)00114-X_BIB003","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB004","series-title":"Proc. AAAI-90, Boston, MA","first-page":"210","article-title":"Search lessons learned from crossword puzzles","author":"Ginsberg","year":"1990"},{"issue":"2","key":"10.1016\/S0004-3702(01)00114-X_BIB005","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"SSC-4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Systems Sci. Cybernet."},{"issue":"1","key":"10.1016\/S0004-3702(01)00114-X_BIB006","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/281250.281253","article-title":"Real life information retrieval: A study of user queries on the web","volume":"32","author":"Jansen","year":"1998","journal-title":"SIGIR Forum"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB007","series-title":"Proc. AAAI-99, Orlando, FL","first-page":"710","article-title":"Proverb: The probabilistic cruciverbalist","author":"Keim","year":"1999"},{"issue":"2","key":"10.1016\/S0004-3702(01)00114-X_BIB008","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1037\/0033-295X.104.2.211","article-title":"A solution to Plato's problem: The latent semantic analysis theory of acquisition, induction and representation of knowledge","volume":"104","author":"Landauer","year":"1997","journal-title":"Psychological Review"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB009","series-title":"Computers and Games 2000","article-title":"Review: Computer language games","volume":"2063","author":"Littman","year":"2001"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB010","series-title":"Encyclopedia of Artificial Intelligence, Vol. 1","first-page":"285","article-title":"Constraint satisfaction","author":"Mackworth","year":"1992"},{"issue":"1","key":"10.1016\/S0004-3702(01)00114-X_BIB011","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(01)00114-X_BIB012","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1109\/49.661103","article-title":"Turbo decoding as an instance of Pearl's \u2018belief propagation\u2019 algorithm","volume":"16","author":"McEliece","year":"1998","journal-title":"IEEE J. Selected Areas in Communication"},{"issue":"4","key":"10.1016\/S0004-3702(01)00114-X_BIB013","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/ijl\/3.4.235","article-title":"Introduction to WordNet: An one-line lexical database","volume":"3","author":"Miller","year":"1990","journal-title":"Internat. J. Lexicography"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB014","series-title":"Topology, A First Course","author":"Munkres","year":"1975"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB015","series-title":"Probabilistic Reasoning in Intelligent Systems","author":"Pearl","year":"1988"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(01)00114-X_BIB016","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","article-title":"On the hardness of approximate reasoning","volume":"82","author":"Roth","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB017","series-title":"Introduction to Modern Information Retrieval","author":"Salton","year":"1983"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB018","series-title":"Proc. IJCAI-95, Montreal, Quebec","first-page":"631","article-title":"Valued constraint satisfaction problems: Hard and easy problems","author":"Schiex","year":"1995"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB019","series-title":"Proc. AAAI-99, Orlando, FL","first-page":"156","article-title":"Solving crossword puzzles as probabilistic constraint satisfaction","author":"Shazeer","year":"1999"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB020","series-title":"American Championship Crosswords","year":"1990"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB021","series-title":"Introduction to The New York Times Daily Crossword Puzzles, Vol. 47","year":"1997"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB022","series-title":"Introduction to The New York Times Daily Crossword Puzzles, Vol. 53","year":"1999"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB023","series-title":"Analysis of a very large AltaVista query log","author":"Silverstein","year":"1998"},{"key":"10.1016\/S0004-3702(01)00114-X_BIB024","series-title":"Belief propagation and revision in networks with loops","author":"Weiss","year":"1997"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437020100114X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S000437020100114X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T05:57:22Z","timestamp":1556863042000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S000437020100114X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S000437020100114X"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00114-x","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}