The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Learning to Rank Short Text Pairs with Convolutional Deep Neural Networks
Abstract
Learning a similarity function between pairs of objects is at the core of learning to rank approaches. In information retrieval tasks we typically deal with query-document pairs, in question answering -- question-answer pairs. However, before learning can take place, such pairs needs to be mapped from the original space of symbolic words into some feature space encoding various aspects of their relatedness, e.g. lexical, syntactic and semantic. Feature engineering is often a laborious task and may require external knowledge sources that are not always available or difficult to obtain. Recently, deep learning approaches have gained a lot of attention from the research community and industry for their ability to automatically learn optimal feature representation for a given task, while claiming state-of-the-art performance in many tasks in computer vision, speech recognition and natural language processing. In this paper, we present a convolutional neural network architecture for reranking pairs of short texts, where we learn the optimal representation of text pairs and a similarity function to relate them in a supervised way from the available training data. Our network takes only words in the input, thus requiring minimal preprocessing. In particular, we consider the task of reranking short text pairs where elements of the pair are sentences. We test our deep learning system on two popular retrieval tasks from TREC: Question Answering and Microblog Retrieval. Our model demonstrates strong performance on the first task beating previous state-of-the-art systems by about 3\% absolute points in both MAP and MRR and shows comparable results on tweet reranking, while enjoying the benefits of no manual feature engineering and no additional syntactic parsers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2014) · Cited by 33,419
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Convolutional Neural Networks for Sentence Classification
Kim, Y. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1181 · Cited by 14,831
(2010) · International Conference on Machine Learning · Cited by 13,995
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
(2010) · Cited by 8,261
ADADELTA: An Adaptive Learning Rate Method
Zeiler, M. D. (2012) · arXiv · doi:10.48550/arxiv.1212.5701 · Cited by 5,322
A unified architecture for natural language processing: deep neural networks with multitask learning
Collobert, R., & Weston, J. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390177 · Cited by 5,058
(2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1953039 · Cited by 4,051
A Convolutional Neural Network for Modelling Sentences
Kalchbrenner, N., Grefenstette, E., & Blunsom, P. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.3115/v1/p14-1062 · Cited by 3,601
A neural probabilistic language model
BengioYoshua, DucharmeRéjean, VincentPascal, & JanvinChristian (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944966 · Cited by 2,644
Learning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960 · cited 1×
“The third method, referred to as a listwise approach [6], treats a query with its list of candidates as a single instance in learning, thus able to capture considerably more information about the ground truth ordering of input candidates.”
MethodStochastic Pooling for Regularization of Deep Convolutional Neural Networks
Zeiler, M. D., & Fergus, R. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3557 · Cited by 755
Question Answering with Subgraph Embeddings
Bordes, A., Chopra, S., & Weston, J. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1067 · Cited by 635
Query chains: learning to rank from implicit feedback
Radlinski, F., & Joachims, T. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081899 · Cited by 476
Finding similar questions in large question and answer archives
Jeon, J., Croft, W. B., & Lee, J. H. (2005) · Proceedings of the 14th ACM international conference on Information and knowledge management · doi:10.1145/1099554.1099572 · Cited by 430
Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing
Yarowsky, D., Baldwin, T., Korhonen, A., Livescu, K., & Bethard, S. J. (2013) · Empirical Methods in Natural Language Processing · Cited by 422
What is the Jeopardy Model? A Quasi-Synchronous Grammar for QA
Wang, M., Smith, N. A., & Mitamura, T. (2007) · Cited by 396
Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
(2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2021068 · Cited by 346
Deep Learning for Answer Sentence Selection
Yu, L., Hermann, K. M., Blunsom, P., & Pulman, S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1412.1632 · Cited by 340
A Neural Network for Factoid Question Answering over Paragraphs
Iyyer, M., Boyd-Graber, J., Claudino, L., Socher, R., & Daumé III, H. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1070 · Cited by 301
Open Question Answering with Weakly Supervised Embedding Models
Bordes, A., Weston, J., & Usunier, N. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44848-9_11 · Cited by 300
Question Answering Using Enhanced Lexical Semantic Models
Yih, W.-T., Chang, M., Meek, C., & Pastusiak, A. (2013) · Cited by 270
Tree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
Heilman, M., & Smith, N. A. (2018) · doi:10.1184/r1/6473795 · Cited by 234
Answer Extraction as Sequence Tagging with Tree Edit Distance
Yao, X., Durme, B. V., Callison-Burch, C., & Clark, P. E. (2013) · North American Chapter of the Association for Computational Linguistics · Cited by 213
Overview of the TREC-2011 Microblog Track
Ounis, I., Macdonald, C., Lin, J., & Soboroff, I. M. (2011) · Cited by 192
Exploiting Syntactic and Shallow Semantic Kernels for Question Answer Classification
Moschitti, A., Quarteroni, S., Basili, R., & Manandhar, S. (2007) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 190
Self-citationWang, M., & Manning, C. D. (2010) · International Conference on Computational Linguistics · Cited by 174
Learning to Rank Answers to Non-Factoid Questions from Web Collections
Surdeanu, M., Ciaramita, M., & Zaragoza, H. (2011) · Computational Linguistics · doi:10.1162/coli_a_00051 · Cited by 159
A noisy-channel approach to question answering
Echihabi, A., & Marcu, D. (2003) · Annual Meeting of the Association for Computational Linguistics (ACL) · doi:10.3115/1075096.1075099 · Cited by 155
Overview of the trec 2012 microblog track
Soboroff, I. M., Ounis, I., Macdonald, C., & Lin, J. (2012) · Cited by 147
Automatic Feature Engineering for Answer Selection and Extraction
Severyn, A., & Moschitti, A. (2013) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d13-1044 · Cited by 131
Self-citationModelling, Visualising and Summarising Documents with a Single Convolutional Neural NetworkPreprint
Denil, M., Demiraj, A., Kalchbrenner, N., Blunsom, P., & de Freitas, N. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.3830 · Cited by 106
Learning to rank for robust question answering
Agarwal, A. K., Raghavan, H., Subbian, K., Melville, P., Lawrence, R. D., Gondek, D. C., & Fan, J. (2012) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/2396761.2396867 · Cited by 59
SVM answer selection for open-domain question answering
Suzuki, J., Sasaki, Y., & Maeda, E. (2002) · International Conference on Computational Linguistics · doi:10.3115/1072228.1072347 · Cited by 55
Reranking answers for definitional QA using language modeling
Chen, Y., Zhou, M., & Wang, S. (2006) · International Conference on Computational Linguistics · doi:10.3115/1220175.1220311 · Cited by 44
Pseudo test collections for training and tuning microblog rankers
Berendsen, R., Tsagkias, M., Weerkamp, W., & de Rijke, M. (2013) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2484028.2484063 · Cited by 30
Cited by
Deep Learning--based Text Classification: A Comprehensive Review
Minaee, S., Kalchbrenner, N., Cambria, E., Nikzad, N., Chenaghlu, M., & Gao, J. (2022) · ACM Computing Surveys · doi:10.1145/3439726 · Cited by 1,538
Text Classification Algorithms: A Survey
Kowsari, K., Jafari Meimandi, K., Heidarysafa, M., Mendu, S., Barnes, L., & Brown, D. (2019) · Information · doi:10.3390/info10040150 · Cited by 1,312
An introduction to Deep Learning in Natural Language Processing: Models, techniques, and tools
Lauriola, I., Lavelli, A., & Aiolli, F. (2022) · Neurocomputing · doi:10.1016/j.neucom.2021.05.103 · Cited by 691
A Survey of Deep Learning: Platforms, Applications and Emerging Research Trends
Hatcher, W. G., & Yu, W. (2018) · IEEE Access · doi:10.1109/access.2018.2830661 · Cited by 654
“[116] A. Severyn and A. Moschitti, ‘‘Learning to rank short text pairs with convolutional deep neural networks,’’ in Proc.”
MethodIRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models
Wang, J., Yu, L., Zhang, W., Gong, Y., Xu, Y., Wang, B., Zhang, P., & Zhang, D. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080786 · Cited by 567
Metadata
- Authors
- Severyn, A., & Moschitti, A.
- Venue
- Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2015-08-09
- Pages
- 373-382
- OpenAlex
- W1966443646
- Cited by
- 722
- References
- 38
- FWCI
- 94.72
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.