Distributional Neural Networks for Automatic Resolution of Crossword Puzzles

Automatic resolution of Crossword Puzzles (CPs) heavily depends on the quality of the answer candidate lists produced by a retrieval system for each clue of the puzzle grid. Previous work has shown that such lists can be generated using Information Retrieval (IR) search algorithms applied to the databases containing previously solved CPs and reranked with tree kernels (TKs) applied to a syntactic tree representation of the clues. In this paper, we create a labelled dataset of 2 million clues on which we apply an innovative Distributional Neural Network (DNN) for reranking clue pairs. Our DNN is computationally efficient and can thus take advantage of such large datasets showing a large improvement over the TK approach, when the latter uses small training data. In contrast, when data is scarce, TKs outperform DNNs.

• Type: Journal
• Year: 2015
• Where: ACL
• Authors: Aliaksei Severyn, Massimo Nicosia, Gianni Barlacchi, Alessandro Moschitti
• Keywords: ACL 2015, Computational Linguistics