Calculating the optimal step in shift-reduce dependency parsing : from cubic to linear time
- Submitting institution
-
University of St Andrews
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 260365098
- Type
- D - Journal article
- DOI
-
10.1162/tacl_a_00268
- Title of journal
- Transactions of the Association for Computational Linguistics
- Article number
- -
- First page
- 283
- Volume
- 7
- Issue
- -
- ISSN
- 2307-387X
- Open access status
- Compliant
- Month of publication
- May
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
A - Artificial Intelligence
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work is the latest in a series of papers since 2012 addressing dynamic
oracles, which have been used to improve the accuracy of natural
language parsers.
It adjusted widely held assumptions about the parsing complexity of the
underlying tasks.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -