article وصول مفتوح

Unlexicalized Transition-based Discontinuous Constituency Parsing

  • Transactions of the Association for Computational Linguistics
  • Association for Computational Linguistics
Research footprint

At a glance

الاستشهادات
24
المراجع
59
Comments
0
Paper overview

Abstract

Abstract Lexicalized parsing models are based on the assumptions that (i) constituents are organized around a lexical head and (ii) bilexical statistics are crucial to solve ambiguities. In this paper, we introduce an unlexicalized transition-based parser for discontinuous constituency structures, based on a structure-label transition system and a bi-LSTM scoring system. We compare it with lexicalized parsing models in order to address the question of lexicalization in the context of discontinuous constituency parsing. Our experiments show that unlexicalized models systematically achieve higher results than lexicalized models, and provide additional empirical evidence that lexicalization is not necessary to achieve strong parsing results. Our best unlexicalized model sets a new state of the art on English and German discontinuous constituency treebanks. We further provide a per-phenomenon analysis of its errors on discontinuous constituents.

Record transparency

Publication details

DOI
10.1162/tacl_a_00255
OpenAlex
W2916601778
Document type
article
Language
EN
Source
Transactions of the Association for Computational Linguistics
Last metadata update
المجتمع

Comments

تسجيل الدخول للانضمام إلى النقاش.

  1. لا توجد تعليقات بعد. ابدأ النقاش.