paper-with-me

Papers

Revisiting Supertagging for Faster HPSG Pasing

2023-09-14 · Olga Zamaraeva, Carlos Gómez-Rodríguez

We present new supertaggers trained on English grammar-based treebanks and test the effects of the best tagger on parsing speed and accuracy. The treebanks are produced automatically by large manually built grammars and feature high-quality annotation based on a well-developed linguistic theory (HPSG). The English Resource Grammar treebanks include diverse and challenging test datasets, beyond the usual WSJ section 23 and Wikipedia data. HPSG supertagging has previously relied on MaxEnt-based models. We use SVM and neural CRF- and BERT-based methods and show that both SVM and neural supertaggers achieve considerably higher accuracy compared to the baseline and lead to an increase not only in the parsing speed but also the parser accuracy with respect to gold dependency structures. Our fine-tuned BERT-based tagger achieves 97.26\% accuracy on 950 sentences from WSJ23 and 93.88% on the out-of-domain technical essay The Cathedral and the Bazaar (cb). We present experiments with integrating the best supertagger into an HPSG parser and observe a speedup of a factor of 3 with respect to the system which uses no tagging at all, as well as large recall gains and an overall precision gain. We also compare our system to an existing integrated tagger and show that although the well-integrated tagger remains the fastest, our experimental system can be more accurate. Finally, we hope that the diverse and difficult datasets we used for evaluation will gain more popularity in the field: we show that results can differ depending on the dataset, even if it is an in-domain one. We contribute the complete datasets reformatted for Huggingface token classification.

📄 PDF Abstract BibTeX arXiv:2309.07590

Code (0)

등록된 구현이 없습니다.

Tasks

token-classificationToken Classification

Methods 이 논문이 사용한 방법론

SVM A Support Vector Machine, or SVM, is a non-parametric supervised learning model. For non-linear classification and regression, they utilise the kernel trick to map inputs…

Similar Papers 제목 키워드 기반

Revisiting Supertagging and Parsing: How to Use Supertags in Transition-Based Parsing

2016-06-01 · WS 2016 6 · Wonchang Chung, Suhas Siddhesh Mhatre, Alexis Nasr, Owen Rambow 외
Word Embeddings

Head-driven Phrase Structure Parsing in O($n^3$) Time Complexity

2021-05-20 · Zuchao Li, Junru Zhou, Hai Zhao, Kevin Parnow

Constituent and dependency parsing, the two classic forms of syntactic parsing, have been found to benefit from joint training and decoding under a uniform formalism, Head-driven Phrase Structure Grammar (HPSG). However,…

Dependency Parsing

An Attempt to Develop a Neural Parser based on Simplified Head-Driven Phrase Structure Grammar on Vietnamese

2024-11-26 · Duc-Vu Nguyen, Thang Chau Phan, Quoc-Nam Nguyen, Kiet Van Nguyen 외

In this paper, we aimed to develop a neural parser for Vietnamese based on simplified Head-Driven Phrase Structure Grammar (HPSG). The existing corpora, VietTreebank and VnDT, had around 15% of constituency and dependenc…

ARCConstituency ParsingDependency ParsingPOS

Deconstructing Supertagging into Multi-Task Sequence Prediction

2019-11-01 · CONLL 2019 11 · Zhenqi Zhu, Anoop Sarkar

Supertagging is a sequence prediction task where each word is assigned a piece of complex syntactic structure called a supertag. We provide a novel approach to multi-task learning for Tree Adjoining Grammar (TAG) superta…

Multi-Task LearningPredictionTAG

Supertagging Combinatory Categorial Grammar with Attentive Graph Convolutional Networks

2020-10-13 · EMNLP 2020 11 · Yuanhe Tian, Yan Song, Fei Xia

Supertagging is conventionally regarded as an important task for combinatory categorial grammar (CCG) parsing, where effective modeling of contextual information is highly important to this task. However, existing studie…

CCG Supertagging