The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations
Open accessAbstract
We present a simple and effective scheme for dependency parsing which is based on bidirectional-LSTMs (BiLSTMs). Each sentence token is associated with a BiLSTM vector representing the token in its sentential context, and feature vectors are constructed by concatenating a few BiLSTM vectors. The BiLSTM is trained jointly with the parser objective, resulting in very effective feature extractors for parsing. We demonstrate the effectiveness of the approach by applying it to a greedy transition-based parser as well as to a globally optimized graph-based parser. The resulting parsers have very simple architectures, and match or surpass the state-of-the-art accuracies on English and Chinese.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
Bidirectional recurrent neural networks
Schuster, M., & Paliwal, K. K. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.650093 · Cited by 10,172
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
Caruana, R. (1997) · Machine Learning · doi:10.1023/a:1007379606734 · Cited by 6,636
Neural Architectures for Named Entity Recognition
Lample, G., Ballesteros, M., Subramanian, S., Kawakami, K., & Dyer, C. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/n16-1030 · Cited by 4,401
Supervised Sequence Labelling with Recurrent Neural Networks
Graves, A. (2012) · Studies in Computational Intelligence · doi:10.1007/978-3-642-24797-2 · Cited by 3,120
Named Entity Recognition with Bidirectional LSTM-CNNs
Chiu, J. P. C., & Nichols, E. (2016) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00104 · Cited by 1,909
A Fast and Accurate Dependency Parser using Neural Networks
Chen, D., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1082 · Cited by 1,795
A Primer on Neural Network Models for Natural Language Processing
Goldberg, Y. (2016) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4992 · Cited by 1,201
Self-citationCaruana, R. (1998) · Cited by 1,110
Visualizing and Understanding Recurrent Networks
Karpathy, A., Johnson, J., & Fei-Fei, L. (2015) · arXiv · doi:10.48550/arxiv.1506.02078 · Cited by 845
A Tutorial on Energy-Based Learning
LeCun, Y., Chopra, S., Hadsell, R. T., Ranzato, A., & Huang, F. J. (2006) · Cited by 842
Online large-margin training of dependency parsers
McDonald, R., Crammer, K., & Pereira, F. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219852 · Cited by 791
Deep Unordered Composition Rivals Syntactic Methods for Text Classification
Iyyer, M., Manjunatha, V., Boyd-Graber, J., & Daumé III, H. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1162 · Cited by 714
Three new probabilistic models for dependency parsing: an exploration
Eisner, J. M. (1996) · Proceedings of the 16th conference on Computational linguistics - · doi:10.3115/992628.992688 · Cited by 609
Transition-Based Dependency Parsing with Stack Long Short-Term Memory
Dyer, C., Ballesteros, M., Ling, W., Matthews, A., & Smith, N. A. (2015) · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · doi:10.48550/arxiv.1505.08075 · Cited by 470
Learning structured prediction models: a large margin approach
Taskar, B., Chatalbashev, V., Koller, D., & Guestrin, C. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102464 · Cited by 444
Algorithms for Deterministic Incremental Dependency Parsing
Nivre, J. (2008) · Computational Linguistics · doi:10.1162/coli.07-056-r1-07-027 · Cited by 435
Simple Semi-supervised Dependency Parsing
Koo, T., Carreras, X., & Collins, M. (2008) · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · Cited by 428
Opinion Mining with Deep Recurrent Neural Networks
Irsoy, O., & Cardie, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1080 · Cited by 384 · cited 3×
“Our proposal (Section 3) is centered around BiRNNs (Irsoy and Cardie, 2014; Schuster and Paliwal, 1997), and more specifically BiLSTMs (Graves, 2008), which are strong and trainable sequence models (see Section 2.3).”
BackgroundMethodInfluentialSproat, R., Samuelsson, C., Chu‐Carroll, J., & Carpenter, B. (2003) · The Handbook of Linguistics · doi:10.1002/9780470756409.ch25 · Cited by 376
(2009) · Cited by 352
Incrementality in deterministic dependency parsing
Nivre, J. (2004) · Proceedings of the Workshop on Incremental Parsing Bringing Engineering and Cognition Together - IncrementParsing '04 · doi:10.3115/1613148.1613156 · Cited by 275
Dynamic Programming for Linear-Time Incremental Parsing
Huang, L., & Sagae, K. (2010) · Cited by 208
Structured Training for Neural Network Transition-Based Parsing
Weiss, D., Alberti, C., Collins, M., & Petrov, S. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1032 · Cited by 180
Concise integer linear programming formulations for dependency parsing
Martins, A. F. T., Smith, N. A., & Xing, E. P. (2009) · doi:10.3115/1687878.1687928 · Cited by 164
A Dynamic Oracle for Arc-Eager Dependency Parsing
Goldberg, Y., & Nivre, J. (2012) · International Conference on Computational Linguistics · Cited by 158
Self-citationTraining Deterministic Parsers with Non-Deterministic Oracles
Goldberg, Y., & Nivre, J. (2013) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00237 · Cited by 112
Self-citationLow-Rank Tensors for Scoring Dependency Structures
Lei, T., Xin, Y., Zhang, Y., Barzilay, R., & Jaakkola, T. (2014) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/v1/p14-1130 · Cited by 103
A Latent Variable Model for Generative Dependency Parsing
Titov, I., & Henderson, J. (2010) · Text, speech and language technology · doi:10.1007/978-90-481-9352-3_3 · Cited by 82
Incremental Parsing with Minimal Features Using Bi-Directional LSTM
Cross, J., & Huang, L. (2016) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/p16-2006 · Cited by 81
Vaswani, A., Bisk, Y., Sagae, K., & Musa, R. (2016) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/n16-1027 · Cited by 74
The Inside-Outside Recursive Neural Network model for Dependency Parsing
Le, P., & Zuidema, W. H. (2014) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1081 · Cited by 73
Lewis, M., Lee, K., & Zettlemoyer, L. (2016) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/n16-1026 · Cited by 73
Training with Exploration Improves a Greedy Stack LSTM Parser
Ballesteros, M., Goldberg, Y., Dyer, C., & Smith, N. A. (2016) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d16-1211 · Cited by 65
Self-citationEasy-First Dependency Parsing with Hierarchical Tree LSTMs
Kiperwasser, E., & Goldberg, Y. (2016) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00110 · Cited by 57
Self-citationNatural Language Understanding with Distributed RepresentationPreprint
Cho, K. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.07916 · Cited by 55
Cited by
Encoding Sentences with Graph Convolutional Networks for Semantic Role Labeling
Marcheggiani, D., & Titov, I. (2017) · Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d17-1159 · Cited by 907
Assessing the Ability of LSTMs to Learn Syntax-Sensitive Dependencies
Linzen, T., Dupoux, E., & Goldberg, Y. (2016) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00115 · Cited by 737
Self-citationRecurrent Neural Networks: A Comprehensive Review of Architectures, Variants, and Applications
Mienye, I. D., Swart, T. G., & Obaido, G. (2024) · Information · doi:10.3390/info15090517 · Cited by 732
Deep Biaffine Attention for Neural Dependency Parsing
Atmani, M., & Lafourcade, M. (2016) · arXiv (Cornell University) · doi:10.4230/oasics.ldk.2021.24 · Cited by 693
Analysis Methods in Neural Language Processing: A Survey
Belinkov, Y., & Glass, J. (2019) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00254 · Cited by 477
Metadata
- Authors
- Kiperwasser, E., & Goldberg, Y.
- Venue
- Transactions of the Association for Computational Linguistics
- Publisher
- MIT Press - Journals
- Published
- 2016-12
- Volume
- 4
- Pages
- 313-327
- ISSN
- 2307-387X (ISSN-L)
- OpenAlex
- W2301095666
- Cited by
- 615
- References
- 39
- FWCI
- 91.57
- Type
- journal article
- Language
- en
- Open access
- diamond
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.