scispace - formally typeset
Search or ask a question
Institution

Uppsala University

EducationUppsala, Sweden
About: Uppsala University is a education organization based out in Uppsala, Sweden. It is known for research contribution in the topics: Population & Gene. The organization has 36485 authors who have published 107509 publications receiving 4220668 citations. The organization is also known as: Uppsala universitet & uu.se.


Papers
More filters
Journal ArticleDOI
Joakim Nivre1
TL;DR: This article presents a general framework for describing and analyzing algorithms for deterministic incremental dependency parsing, formalized as transition systems and shows that all four algorithms give competitive accuracy, although the non-projective list-based algorithm generally outperforms the projective algorithms for languages with a non-negligible proportion of non- projective constructions.
Abstract: Parsing algorithms that process the input from left to right and construct a single derivation have often been considered inadequate for natural language parsing because of the massive ambiguity typically found in natural language grammars. Nevertheless, it has been shown that such algorithms, combined with treebank-induced classifiers, can be used to build highly accurate disambiguating parsers, in particular for dependency-based syntactic representations. In this article, we first present a general framework for describing and analyzing algorithms for deterministic incremental dependency parsing, formalized as transition systems. We then describe and analyze two families of such algorithms: stack-based and list-based algorithms. In the former family, which is restricted to projective dependency structures, we describe an arc-eager and an arc-standard variant; in the latter family, we present a projective and a non-projective variant. For each of the four algorithms, we give proofs of correctness and complexity. In addition, we perform an experimental evaluation of all algorithms in combination with SVM classifiers for predicting the next parsing action, using data from thirteen languages. We show that all four algorithms give competitive accuracy, although the non-projective list-based algorithm generally outperforms the projective algorithms for languages with a non-negligible proportion of non-projective constructions. However, the projective algorithms often produce comparable results when combined with the technique known as pseudo-projective parsing. The linear time complexity of the stack-based algorithms gives them an advantage with respect to efficiency both in learning and in parsing, but the projective list-based algorithm turns out to be equally efficient in practice. Moreover, when the projective algorithms are used to implement pseudo-projective parsing, they sometimes become less efficient in parsing (but not in learning) than the non-projective list-based algorithm. Although most of the algorithms have been partially described in the literature before, this is the first comprehensive analysis and evaluation of the algorithms within a unified framework.

489 citations

Proceedings Article
01 Aug 2013
TL;DR: A new collection of treebanks with homogeneous syntactic dependency annotation for six languages: German, English, Swedish, Spanish, French and Korean is presented, made freely available in order to facilitate research on multilingual dependency parsing.
Abstract: We present a new collection of treebanks with homogeneous syntactic dependency annotation for six languages: German, English, Swedish, Spanish, French and Korean. To show the usefulness of such a resource, we present a case study of crosslingual transfer parsing with more reliable evaluation than has been possible before. This ‘universal’ treebank is made freely available in order to facilitate research on multilingual dependency parsing. 1

489 citations

Proceedings ArticleDOI
27 Nov 2000
TL;DR: A network friendly bandwidth measurement method, TOPP, that is based on active probing and includes analysis by segmented regression that can estimate two complementing available bandwidth metrics in addition to the link bandwidth of the congested link.
Abstract: We present a network friendly bandwidth measurement method, TOPP, that is based on active probing and includes analysis by segmented regression. This method can estimate two complementing available bandwidth metrics in addition to the link bandwidth of the congested link. Contrary to traditional packet pair estimates of the bottleneck link bandwidth, our estimate is not limited by the rate at which we can inject probe packets into the network. We also show that our method is able to detect bottlenecks that are invisible to methods such as the C-probe. Further more, we describe scenarios where our analysis method is able to calculate bandwidth estimates for several congested hops based on a single end-to-end probe session.

488 citations

Journal ArticleDOI
Morad Aaboud, Georges Aad1, Brad Abbott2, Jalal Abdallah3  +2845 moreInstitutions (197)
TL;DR: This paper presents a short overview of the changes to the trigger and data acquisition systems during the first long shutdown of the LHC and shows the performance of the trigger system and its components based on the 2015 proton–proton collision data.
Abstract: During 2015 the ATLAS experiment recorded 3.8 fb(-1) of proton-proton collision data at a centre-of-mass energy of 13 TeV. The ATLAS trigger system is a crucial component of the experiment, respons ...

488 citations

Journal ArticleDOI
TL;DR: Conclusions from clinical trial results that are derived from model‐based analyses rely on the model adequately describing the underlying system and without an understanding of the properties of thesediagnostics, development and use of new diagnostics, and additional information pertaining to the diagnosis, there is risk that adequate models will be rejected and inadequate models accepted.
Abstract: Conclusions from clinical trial results that are derived from model-based analyses rely on the model adequately describing the underlying system. The traditionally used diagnostics intended to provide information about model adequacy have seldom discussed shortcomings. Without an understanding of the properties of these diagnostics, development and use of new diagnostics, and additional information pertaining to the diagnostics, there is risk that adequate models will be rejected and inadequate models accepted. Thus, a diagnosis of available diagnostics is desirable.

488 citations


Authors

Showing all 36854 results

NameH-indexPapersCitations
Zhong Lin Wang2452529259003
Lewis C. Cantley196748169037
Darien Wood1602174136596
Kaj Blennow1601845116237
Christopher J. O'Donnell159869126278
Tomas Hökfelt158103395979
Peter G. Schultz15689389716
Frederik Barkhof1541449104982
Deepak L. Bhatt1491973114652
Svante Pääbo14740784489
Jan-Åke Gustafsson147105898804
Hans-Olov Adami14590883473
Hermann Kolanoski145127996152
Kjell Fuxe142147989846
Jan Conrad14182671445
Network Information
Related Institutions (5)
Imperial College London
209.1K papers, 9.3M citations

93% related

Centre national de la recherche scientifique
382.4K papers, 13.6M citations

93% related

McGill University
162.5K papers, 6.9M citations

93% related

University of Minnesota
257.9K papers, 11.9M citations

93% related

University of Oxford
258.1K papers, 12.9M citations

93% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023240
2022643
20216,080
20205,811
20195,393
20185,067