Undirected Dependency Parsing. (24th January 2014)

• Record Type: Journal Article
• Authors: Gómez‐Rodríguez, Carlos; Fernández‐González, Daniel; Bilbao, Víctor Manuel Darriba
• Is Part Of: Computational intelligence. Volume 31:Number 2(2015:May)
• Page Start: 348
• Page End: 384
• Publication Date: 2014-01-24
• Subjects: Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12027
• Languages: English
• ISSNs: 0824-7935

Abstract

<abstract abstract-type="main" id="coin12027-abs-0001"> <title> <x xml:space="preserve">Abstract</x> </title> <p>Dependency parsers, which are widely used in natural language processing tasks, employ a representation of syntax in which the structure of sentences is expressed in the form of directed links (dependencies) between their words. In this article, we introduce a new approach to transition‐based dependency parsing in which the parsing algorithm does not directly construct dependencies, but rather undirected links, which are then assigned a direction in a postprocessing step. We show that this alleviates error propagation, because undirected parsers do not need to observe the single‐head constraint, resulting in better accuracy.</p> <p>Undirected parsers can be obtained by transforming existing directed transition‐based parsers as long as they satisfy certain conditions. We apply this approach to obtain undirected variants of three different parsers (the Planar, 2‐Planar, and Covington algorithms) and perform experiments on several data sets from the CoNLL‐X shared tasks and on the <italic>Wall Street Journal</italic> portion of the Penn Treebank, showing that our approach is successful in reducing error propagation and produces improvements in parsing accuracy in most of the cases and achieving results competitive with state‐of‐the‐art transition‐based parsers.</p> </abstract>