nlp:dependency_parsing
Table of Contents
Dependency Parsing
See also NLP Progress - Dependency Parsing
Graph-Based Dependency Parsing
Early papers (pre-neural):
- The paper that started graph-based dependency parsing: McDonald et al 2005 - Non-projective Dependency Parsing using Spanning Tree Algorithms
Neural graph-based dependency parsing
- Kiperwasser & Goldberg 2016 - Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations An early neural graph-based parser. One of the early papers to advocate using BiLSTMs as features in NLP models.
- Zhang et al 2016 - Dependency Parsing as Head Selection Applies MST and Eisner's algorithm to a neural network trained to predict the head of each word.
- Wang & Chang 2016 - Graph-based Dependency Parsing with Bidirectional LSTM Similar and concurrent (but slightly later) than Kiperwasser & Goldberg
- Dozat & Manning 2017 - Deep Biaffine Attention for Neural Dependency Parsing Popular neural graph-based parser, often used as a baseline model.
Neural graph-based models with higher-order features
Transition-Based Dependency Parsing
- Chen & Manning 2014 - A Fast and Accurate Dependency Parser using Neural Networks The first neural dependency parser.
- Ma et al 2018 - Stack-Pointer Networks for Dependency Parsing Has a good overview of existing parsers at the time.
Unsupervised Dependency Parsing
- Overviews
- Concise summary of prior work in Nishida 2020.
- Key papers
- Klein & Manning 2001 - Corpus-Based Induction of Syntactic Structure: Models of Dependency and Constituency Dependency Model with Valence (DMV). What made Dan Klein famous
Software
- Stanza This parser is very good, better than Stanford Core NLP, NLTK, or other tools
People
Related Pages
- Semantic Dependencies (Semantic Dependency Parsing)
nlp/dependency_parsing.txt · Last modified: 2023/06/15 07:36 by 127.0.0.1