An improved non-monotonic transition system for dependency parsing

Matthew Honnibal, Mark Johnson

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

Abstract

Transition-based dependency parsers usually use transition systems that monotonically extend partial parse states until they identify a complete parse tree. Honnibal et al. (2013) showed that greedy onebest parsing accuracy can be improved by adding additional non-monotonic transitions that permit the parser to "repair" earlier parsing mistakes by "over-writing" earlier parsing decisions. This increases the size of the set of complete parse trees that each partial parse state can derive, enabling such a parser to escape the "garden paths" that can trap monotonic greedy transition-based dependency parsers. We describe a new set of non-monotonic transitions that permits a partial parse state to derive a larger set of completed parse trees than previous work, which allows our parser to escape from a larger set of garden paths. A parser with our new nonmonotonic transition system has 91.85% directed attachment accuracy, an improvement of 0.6% over a comparable parser using the standard monotonic arc-eager transitions.

LanguageEnglish
Title of host publicationConference on Empirical Methods in Natural Language Processing, EMNLP 2015
Subtitle of host publicationConference Proceedings
Place of PublicationRed Hook, NY
PublisherAssociation for Computational Linguistics (ACL)
Pages1373-1378
Number of pages6
ISBN (Electronic)9781941643327
Publication statusPublished - 2015
EventConference on Empirical Methods in Natural Language Processing, EMNLP 2015 - Lisbon, Portugal
Duration: 17 Sep 201521 Sep 2015

Other

OtherConference on Empirical Methods in Natural Language Processing, EMNLP 2015
CountryPortugal
CityLisbon
Period17/09/1521/09/15

Fingerprint

Repair

Cite this

Honnibal, M., & Johnson, M. (2015). An improved non-monotonic transition system for dependency parsing. In Conference on Empirical Methods in Natural Language Processing, EMNLP 2015: Conference Proceedings (pp. 1373-1378). Red Hook, NY: Association for Computational Linguistics (ACL).
Honnibal, Matthew ; Johnson, Mark. / An improved non-monotonic transition system for dependency parsing. Conference on Empirical Methods in Natural Language Processing, EMNLP 2015: Conference Proceedings. Red Hook, NY : Association for Computational Linguistics (ACL), 2015. pp. 1373-1378
@inproceedings{db53758908e444f1a0f3f62db2b39d2b,
title = "An improved non-monotonic transition system for dependency parsing",
abstract = "Transition-based dependency parsers usually use transition systems that monotonically extend partial parse states until they identify a complete parse tree. Honnibal et al. (2013) showed that greedy onebest parsing accuracy can be improved by adding additional non-monotonic transitions that permit the parser to {"}repair{"} earlier parsing mistakes by {"}over-writing{"} earlier parsing decisions. This increases the size of the set of complete parse trees that each partial parse state can derive, enabling such a parser to escape the {"}garden paths{"} that can trap monotonic greedy transition-based dependency parsers. We describe a new set of non-monotonic transitions that permits a partial parse state to derive a larger set of completed parse trees than previous work, which allows our parser to escape from a larger set of garden paths. A parser with our new nonmonotonic transition system has 91.85{\%} directed attachment accuracy, an improvement of 0.6{\%} over a comparable parser using the standard monotonic arc-eager transitions.",
author = "Matthew Honnibal and Mark Johnson",
year = "2015",
language = "English",
pages = "1373--1378",
booktitle = "Conference on Empirical Methods in Natural Language Processing, EMNLP 2015",
publisher = "Association for Computational Linguistics (ACL)",

}

Honnibal, M & Johnson, M 2015, An improved non-monotonic transition system for dependency parsing. in Conference on Empirical Methods in Natural Language Processing, EMNLP 2015: Conference Proceedings. Association for Computational Linguistics (ACL), Red Hook, NY, pp. 1373-1378, Conference on Empirical Methods in Natural Language Processing, EMNLP 2015, Lisbon, Portugal, 17/09/15.

An improved non-monotonic transition system for dependency parsing. / Honnibal, Matthew; Johnson, Mark.

Conference on Empirical Methods in Natural Language Processing, EMNLP 2015: Conference Proceedings. Red Hook, NY : Association for Computational Linguistics (ACL), 2015. p. 1373-1378.

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionResearchpeer-review

TY - GEN

T1 - An improved non-monotonic transition system for dependency parsing

AU - Honnibal, Matthew

AU - Johnson, Mark

PY - 2015

Y1 - 2015

N2 - Transition-based dependency parsers usually use transition systems that monotonically extend partial parse states until they identify a complete parse tree. Honnibal et al. (2013) showed that greedy onebest parsing accuracy can be improved by adding additional non-monotonic transitions that permit the parser to "repair" earlier parsing mistakes by "over-writing" earlier parsing decisions. This increases the size of the set of complete parse trees that each partial parse state can derive, enabling such a parser to escape the "garden paths" that can trap monotonic greedy transition-based dependency parsers. We describe a new set of non-monotonic transitions that permits a partial parse state to derive a larger set of completed parse trees than previous work, which allows our parser to escape from a larger set of garden paths. A parser with our new nonmonotonic transition system has 91.85% directed attachment accuracy, an improvement of 0.6% over a comparable parser using the standard monotonic arc-eager transitions.

AB - Transition-based dependency parsers usually use transition systems that monotonically extend partial parse states until they identify a complete parse tree. Honnibal et al. (2013) showed that greedy onebest parsing accuracy can be improved by adding additional non-monotonic transitions that permit the parser to "repair" earlier parsing mistakes by "over-writing" earlier parsing decisions. This increases the size of the set of complete parse trees that each partial parse state can derive, enabling such a parser to escape the "garden paths" that can trap monotonic greedy transition-based dependency parsers. We describe a new set of non-monotonic transitions that permits a partial parse state to derive a larger set of completed parse trees than previous work, which allows our parser to escape from a larger set of garden paths. A parser with our new nonmonotonic transition system has 91.85% directed attachment accuracy, an improvement of 0.6% over a comparable parser using the standard monotonic arc-eager transitions.

UR - http://www.scopus.com/inward/record.url?scp=84959908883&partnerID=8YFLogxK

M3 - Conference proceeding contribution

SP - 1373

EP - 1378

BT - Conference on Empirical Methods in Natural Language Processing, EMNLP 2015

PB - Association for Computational Linguistics (ACL)

CY - Red Hook, NY

ER -

Honnibal M, Johnson M. An improved non-monotonic transition system for dependency parsing. In Conference on Empirical Methods in Natural Language Processing, EMNLP 2015: Conference Proceedings. Red Hook, NY: Association for Computational Linguistics (ACL). 2015. p. 1373-1378