The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Non-projective dependency parsing using spanning tree algorithms
Open accessAbstract
We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) is sufficient for searching over all projective trees in O(n3) time. More surprisingly, the representation is extended naturally to non-projective parsing using Chu-Liu-Edmonds (Chu and Liu, 1965; Edmonds, 1967) MST algorithm, yielding an O(n2) parsing algorithm. We evaluate these methods on the Prague Dependency Treebank using online large-margin learning techniques (Crammer et al., 2003; McDonald et al., 2005) and show that MST parsing increases efficiency and accuracy for languages with non-projective dependencies.
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
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
Collins, M. (2002) · Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02 · doi:10.3115/1118693.1118694 · Cited by 1,862
Taskar, B., Guestrin, C., & Koller, D. (2003) · Cited by 1,206
Dependency tree kernels for relation extraction
Culotta, A., & Sorensen, J. (2004) · Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04 · doi:10.3115/1218955.1219009 · Cited by 814
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
Self-citationLearning Syntactic Patterns for Automatic Hypernym Discovery
Snow, R., Jurafsky, D. S., & Ng, A. Y. (2004) · neural information processing systems · Cited by 658
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
Statistical Dependency Analysis with Support Vector Machines
Yamada, H., & Matsumoto, Y. (2003) · Cited by 600
Tarjan, R. E. (1977) · Networks · doi:10.1002/net.3230070103 · Cited by 365
Pseudo-projective dependency parsing
Nivre, J., & Nilsson, J. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219853 · Cited by 292
Taskar, B., Klein, D., Collins, M., Koller, D., & Manning, C. D. (2004) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · Cited by 229
Ultraconservative Online Algorithms for Multiclass Problems
Crammer, K., & Singer, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_7 · Cited by 221
Deterministic dependency parsing of English text
Nivre, J., & Scholz, M. (2004) · Proceedings of the 20th international conference on Computational Linguistics - COLING '04 · doi:10.3115/1220355.1220365 · Cited by 220
Machine translation using probabilistic synchronous dependency insertion grammars
Ding, Y., & Palmer, M. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219907 · Cited by 197
A statistical parser for Czech
Collins, M., Ramshaw, L., Hajič, J., & Tillmann, C. (1999) · Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics - · doi:10.3115/1034678.1034754 · Cited by 193
Self-citationAutomatic paraphrase acquisition from news articles
Shinyama, Y., Sekine, S., & Sudo, K. (2002) · Proceedings of the second international conference on Human Language Technology Research - · doi:10.3115/1289189.1289218 · Cited by 187
Online Passive-Aggressive Algorithms
Shalev‐Shwartz, S., Crammer, K., Dekel, O., & Singer, Y. (2003) · neural information processing systems · Cited by 75
Learning and robust learning of product distributions
Höffgen, K.-U. (1993) · Conference on Learning Theory · doi:10.1145/168304.168314 · Cited by 59
Arborescence optimization problems solvable by Edmonds’ algorithm
Georgiadis, L. (2003) · Theoretical Computer Science · doi:10.1016/s0304-3975(02)00888-5 · Cited by 41
Cited by
Statistical machine translation
(2010) · Choice Reviews Online · doi:10.5860/choice.47-6293 · Cited by 1,309
CoNLL-X shared task on multilingual dependency parsing
Buchholz, S., & Marsi, E. (2006) · Proceedings of the Tenth Conference on Computational Natural Language Learning - CoNLL-X '06 · doi:10.3115/1596276.1596305 · Cited by 963
Ensemble of feature sets and classification algorithms for sentiment classification
Xia, R., Zong, C., & Li, S. (2011) · Information Sciences · doi:10.1016/j.ins.2010.11.023 · Cited by 583
The CoNLL-2008 shared task on joint parsing of syntactic and semantic dependencies
Surdeanu, M., Johansson, R., Meyers, A., Màrquez, L., & Nivre, J. (2008) · Proceedings of the Twelfth Conference on Computational Natural Language Learning - CoNLL '08 · doi:10.3115/1596324.1596352 · Cited by 491
Algorithms for Deterministic Incremental Dependency Parsing
Nivre, J. (2008) · Computational Linguistics · doi:10.1162/coli.07-056-r1-07-027 · Cited by 435
Metadata
- Authors
- McDonald, R., Pereira, F., Ribarov, K., & Hajič, J.
- Venue
- Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05
- Published
- 2005
- Pages
- 523-530
- OpenAlex
- W2122922578
- Cited by
- 847
- References
- 21
- FWCI
- 24.09
- Type
- conference paper
- Language
- en
- Open access
- gold
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.