Dependency parsing with finite state transducers and compression rules. Issue 6 (November 2018)

• Record Type: Journal Article
• Authors: Gamallo, Pablo; Garcia, Marcos
• Is Part Of: Information processing & management. Volume 54:Issue 6(2018:Nov.)
• Page Start: 1244
• Page End: 1261
• Publication Date: 2018-11
• Subjects: Information storage and retrieval systems -- Periodicals; Information science -- Periodicals; Systèmes d'information -- Périodiques; Sciences de l'information -- Périodiques; Information science; Information storage and retrieval systems; Periodicals; 658.4038
• DOI: 10.1016/j.ipm.2018.05.003
• Languages: English
• ISSNs: 0306-4573

Abstract

Highlights: A finite-state approach to syntactic parsing based on dependency grammar. The parsing strategy makes use of a compression technique which reduces grammar complexity. Experiments showed that the system's performance remains stable across related languages and different domains. Software released under GPL. Abstract: This article proposes a syntactic parsing strategy based on a dependency grammar containing formal rules and a compression technique that reduces the complexity of those rules. Compression parsing is mainly driven by the 'single-head' constraint of Dependency Grammar, and can be seen as an alternative method to the well-known constructive strategy. The compression algorithm simplifies the input sentence by progressively removing from it the dependent tokens as soon as binary syntactic dependencies are recognized. This strategy is thus similar to that used in deterministic dependency parsing. A compression parser was implemented and released under General Public License, as well as a cross-lingual grammar with Universal Dependencies, containing only broad-coverage rules applied to Romance languages. The system is an almost delexicalized parser which does not need training data to analyze Romance languages. The rule-based cross-lingual parser was submitted to CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies . The performance of our system was compared to the other supervised systems participating in the competition, paying special attention to the parsing of different treebanks of the same language. We also trained a supervised delexicalized parser for Romance languages in order to compare it to our rule-based system. The results show that the performance of our cross-lingual method does not change across related languages and across different treebanks, while most supervised methods turn out to be very dependent on the text domain used to train the system.