The DOI matches its Crossref record; 21 of the 22 references it cites were found in a registry or an index.
Multilingual dependency analysis with a two-stage discriminative parser
Open accessAbstract
We present a two-stage multilingual dependency parser and evaluate it on 13 diverse languages. The first stage is based on the unlabeled dependency parsing models described by McDonald and Pereira (2006) augmented with morphological features for a subset of the languages. The second stage takes the output from the first and labels all the edges in the dependency graph with appropriate syntactic categories using a globally trained sequence classifier over components of the graph. We report results on the CoNLL-X shared task (Buchholz et al., 2006) data sets and present an error analysis.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The average length of Arabic sentence is widely higher than other languages, it is around 35 words per sentence [38].”
From 2L-APD: A Two-Level Plagiarism Detection System for Arabic Documents (2018) · cites this paper as [38]
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
Dependency Syntax: Theory and Practice
Mel’čuk, I. (1987) · Medical Entomology and Zoology · Cited by 1,417
CoNLL-X shared task on multilingual dependency parsing
Buchholz, S., & Marsi, E. (2006) · Conference on Computational Natural Language Learning · doi:10.3115/1596276.1596305 · Cited by 961
Non-projective dependency parsing using spanning tree algorithms
McDonald, R., Pereira, F. M. B., Ribarov, K., & Hajič, J. (2005) · doi:10.3115/1220575.1220641 · Cited by 851
Self-citationOnline large-margin training of dependency parsers
McDonald, R., Crammer, K., & Pereira, F. M. B. (2005) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/1219840.1219852 · Cited by 795
Self-citationOnline Learning of Approximate Dependency Parsing Algorithms.
McDonald, R., & Pereira, F. C. N. (2006) · Cited by 465
Self-citationOflazer, K., Say, B., Hakkani-Tür, D. Z., & Tür, G. (2003) · Text, speech and language technology · doi:10.1007/978-94-010-0201-1_15 · Cited by 233
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
Treebanks Building and Using Parsed Corpora
Abeillé, A. (2014) · Cited by 217
Machine translation using probabilistic synchronous dependency insertion grammars
Ding, Y., & Palmer, M. S. (2005) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/1219840.1219907 · Cited by 199
The Alpino Dependency Treebank
van der Beek, L., Bouma, G., Malouf, R., & van Noord, G. (2002) · BRILL eBooks · doi:10.1163/9789004334038_003 · Cited by 175
Research works printed but not linked: 1
- R. McDonald. 2006. Discriminative sentence compres- sion with soft syntactic constraints. In Proc. EACL.
Cited by
Sorted by citations
CoNLL-X shared task on multilingual dependency parsing
Buchholz, S., & Marsi, E. (2006) · Conference on Computational Natural Language Learning · doi:10.3115/1596276.1596305 · Cited by 961
Algorithms for Deterministic Incremental Dependency Parsing
Nivre, J. (2008) · Computational Linguistics · doi:10.1162/coli.07-056-r1-07-027 · Cited by 440
Characterizing the Errors of Data-Driven Dependency Parsing Models
McDonald, R., & Nivre, J. (2007) · Cited by 265
Self-citationIntegrating Graph-Based and Transition-Based Dependency Parsers
Nivre, J., & McDonald, R. (2008) · Cited by 231
Self-citationNon-projective dependency parsing in expected linear time
Nivre, J. (2009) · doi:10.3115/1687878.1687929 · Cited by 227
Metadata
- Authors
- McDonald, R., Lerman, K., & Pereira, F.
- Affiliations
- University of Pennsylvania (US)
- ORCID
- Pereira, Fernando
- Venue
- Proceedings of the Tenth Conference on Computational Natural Language Learning - CoNLL-X '06
- Published
- 2006
- Pages
- 216
- OpenAlex
- W2143541936
- Cited by
- 223
- References
- 22
- Citations by year
- 2022: 3 · 2021: 5 · 2020: 8 · 2019: 2 · 2018: 12 · 2017: 8 · 2016: 9 · 2015: 15 · 2014: 14 · 2013: 25 · 2012: 29
- FWCI
- 13.17
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Conference on Computational Natural Language Learning (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Speech and dialogue systems
- Social Sciences › Arts and Humanities › Language and Linguistics › Syntax, Semantics, Linguistic Variation
- Keywords
- multilingual dependency parsing, morphological features, sequence classification, error analysis
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
