The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Recurrent Continuous Translation Models
Open accessAbstract
We introduce a class of probabilistic continuous translation models called Recurrent Continuous Translation Models that are purely based on continuous representations for words, phrases and sentences and do not rely on alignments or phrasal translation units.The models have a generation and a conditioning aspect.The generation of the translation is modelled with a target Recurrent Language Model, whereas the conditioning on the source sentence is modelled with a Convolutional Sentence Model.Through various experiments, we show first that our models obtain a perplexity with respect to gold translations that is > 43% lower than that of stateof-the-art alignment-based translation models.Secondly, we show that they are remarkably sensitive to the word order, syntax, and meaning of the source sentence despite lacking alignments.Finally we show that they match a state-of-the-art system when rescoring n-best lists of translations.
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
(2010) · Cited by 8,261
Recurrent neural network based language model
Mikolov, T., Karafiát, M., Burget, L., Černocký, J., & Khudanpur, S. (2010) · Interspeech 2010 · doi:10.21437/interspeech.2010-343 · Cited by 5,390 · cited 4×
“The RLM is trained by backpropagation through time (Mikolov et al., 2010).”
BackgroundMethodInfluentialA 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 · cited 1×
“Continuous representations for words are able to capture their morphological, syntactic and semantic similarity (Collobert and Weston, 2008).”
BackgroundThe mathematics of statistical machine translation: parameter estimation
Brown, P. F., Pietra, V. J. D., Pietra, S. A. D., & Mercer, R. L. (1993) · Cited by 3,973
Generating Text with Recurrent Neural Networks
Sutskever, I., Martens, J., & Hinton, G. E. (2011) · International Conference on Machine Learning · Cited by 1,783
Extensions of recurrent neural network language model
Mikolov, T., Kombrink, S., Burget, L., Cernocky, J., & Khudanpur, S. (2011) · 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2011.5947611 · Cited by 1,568
Semantic Compositionality through Recursive Matrix-Vector Spaces
Socher, R., Huval, B., Manning, C. D., & Ng, A. Y. (2012) · Cited by 1,259
Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection
Socher, R., Huang, E., Pennin, J., Manning, C. D., & Ng, A. Y. (2011) · neural information processing systems · Cited by 782
A Simple, Fast, and Effective Reparameterization of IBM Model 2
Dyer, C., Chahuneau, V., & Smith, N. A. (2018) · doi:10.1184/r1/6472985 · Cited by 767
Context dependent recurrent neural network language model
Mikolov, T., & Zweig, G. (2012) · 2012 IEEE Spoken Language Technology Workshop (SLT) · doi:10.1109/slt.2012.6424228 · Cited by 560
Cited by
Items 101–104 of 104
Challenges in Building Highly Interactive Dialogue Systems
Ward, N. G., & DeVault, D. (2016) · AI Magazine · doi:10.1609/aimag.v37i4.2687 · Cited by 46
(2019) · doi:10.1609/aaai.v33i01.33016618 · Cited by 31
Question Generation With Doubly Adversarial Nets
Bao, J., Gong, Y., Duan, N., Zhou, M., & Zhao, T. (2018) · IEEE/ACM Transactions on Audio, Speech, and Language Processing · doi:10.1109/taslp.2018.2859777 · Cited by 14
Order Matters: Sequence to sequence for sets
Vinyals, O., Bengio, S., & Kudlur, M. (2015) · arXiv · doi:10.48550/arxiv.1511.06391
Metadata
- Authors
- Kalchbrenner, N., & Blunsom, P.
- Venue
- Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing
- Published
- 2013
- Pages
- 1700-1709
- OpenAlex
- W1753482797
- Cited by
- 1,232
- References
- 17
- FWCI
- 50.95
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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.