DR.FILL: crosswords and an implemented solver for singly weighted CSPs

Authors:
Matthew L. Ginsberg
Affiliations:
On Time Systems, Inc., Eugene, Oregon
Venue:
Journal of Artificial Intelligence Research
Year:
2011

Citing 21
Cited 0

WordNet: a lexical database for English

Communications of the ACM
Nonsystematic backtracking search

Nonsystematic backtracking search
Foundations of statistical natural language processing

Foundations of statistical natural language processing
A probabilistic approach to solving crossword puzzles

Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Deep Blue

Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
Solving weighted CSP by maintaining arc consistency

Artificial Intelligence
Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques

Constraints
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models

Artificial Intelligence
WebCrow: a WEB-based system for crossword solving

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
"Squeaky Wheel" optimization

Journal of Artificial Intelligence Research
Taking advantage of stable sets of variables in constraint satisfaction problems

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Bounds arc consistency for weighted CSPs

Journal of Artificial Intelligence Research
Existential arc consistency: getting closer to full arc consistency in weighted CSPs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Open constraint programming

Artificial Intelligence - Special issue: Distributed constraint satisfaction
Reasoning from last conflict(s) in constraint programming

Artificial Intelligence
Soft arc consistency revisited

Artificial Intelligence
Search lessons learned from crossword puzzles

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Total-order multi-agent task-network planning for contract bridge

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Improved limited discrepancy search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe Dr. Fill, a program that solves American-style crossword puzzles. From a technical perspective, Dr. Fill works by converting crosswords to weighted csps, and then using a variety of novel techniques to find a solution. These techniques include generally applicable heuristics for variable and value selection, a variant of limited discrepancy search, and postprocessing and partitioning ideas. Branch and bound is not used, as it was incompatible with postprocessing and was determined experimentally to be of little practical value. Dr. Fill's performance on crosswords from the American Crossword Puzzle Tournament suggests that it ranks among the top fifty or so crossword solvers in the world.