Greedy Transition-Based Dependency Parsing with Discrete and Continuous Supertag Features

2020-07-09 · Ali Basirat, Joakim Nivre

We study the effect of rich supertag features in greedy transition-based dependency parsing. While previous studies have shown that sparse boolean features representing the 1-best supertag of a word can improve parsing accuracy, we show that we can get further improvements by adding a continuous vector representation of the entire supertag distribution for a word. In this way, we achieve the best results for greedy transition-based parsing with supertag features with $88.6\%$ LAS and $90.9\%$ UASon the English Penn Treebank converted to Stanford Dependencies.

📄 PDF Abstract BibTeX arXiv:2007.04686

Code (0)

등록된 구현이 없습니다.

Tasks

Dependency ParsingTransition-Based Dependency Parsing

Combining Discrete and Continuous Features for Deterministic Transition-based Dependency Parsing

2015-09-01 · EMNLP 2015 9 · Meishan Zhang, Yue Zhang

Dependency Parsing Transition-Based Dependency Parsing

Global Greedy Dependency Parsing

2019-11-20 · Zuchao Li, Hai Zhao, Kevin Parnow

Most syntactic dependency parsing models may fall into one of two categories: transition- and graph-based models. The former models enjoy high inference efficiency with linear time complexity, but they rely on the stacki…

ARC Dependency Parsing Re-Ranking Sentence

Initial Explorations of CCG Supertagging for Universal Dependency Parsing

2017-08-01 · CONLL 2017 8 · Burak Kerim Akkus, Heval Azizoglu, Ruket Cakici

In this paper we describe the system by METU team for universal dependency parsing of multilingual text. We use a neural network-based dependency parser that has a greedy transition approach to dependency parsing. CCG su…

CCG Supertagging Dependency Parsing Machine Translation

Dependency Parsing with Backtracking using Deep Reinforcement Learning

2022-06-28 · Franck Dary, Maxime Petit, Alexis Nasr

Greedy algorithms for NLP such as transition based parsing are prone to error propagation. One way to overcome this problem is to allow the algorithm to backtrack and explore an alternative solution in cases where new ev…

Deep Reinforcement Learning Dependency Parsing POS POS Tagging+3

Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles

2016-12-20 · EMNLP 2016 11 · James Cross, Liang Huang

Parsing accuracy using efficient greedy transition systems has improved dramatically in recent years thanks to neural networks. Despite striking results in dependency parsing, however, neural models have not surpassed st…

Constituency Parsing Dependency Parsing Reranking Sentence