Dependency parsing with finite state transducers and compression rules

作者：

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.

摘要

•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.

论文关键词：

论文评审过程：Received 24 February 2016, Revised 23 April 2018, Accepted 13 May 2018, Available online 5 June 2018, Version of Record 3 September 2018.

论文官网地址：https://doi.org/10.1016/j.ipm.2018.05.003