[PDF][PDF] An improved non-monotonic transition system for dependency parsing
M Honnibal, M Johnson - Proceedings of the 2015 conference on …, 2015 - aclanthology.org
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) …
extend partial parse states until they identify a complete parse tree. Honnibal et al.(2013) …
Yara parser: A fast and accurate dependency parser
MS Rasooli, J Tetreault - ar** from transition-based parsing algorithms that read sentences from left
to right to sequence labeling encodings of syntactic trees. This not only establishes a …
to right to sequence labeling encodings of syntactic trees. This not only establishes a …
Tackling error propagation through reinforcement learning: A case of greedy dependency parsing
Error propagation is a common problem in NLP. Reinforcement learning explores erroneous
states during training and can therefore be more robust when mistakes are made early in a …
states during training and can therefore be more robust when mistakes are made early in a …
[HTML][HTML] Triplet extraction leveraging sentence transformers and dependency parsing
Abstract Knowledge Graphs are a tool to structure (entity, relation, entity) triples. One
possible way to construct these knowledge graphs is by extracting triples from unstructured …
possible way to construct these knowledge graphs is by extracting triples from unstructured …
On the relation between dependency distance, crossing dependencies, and parsing: Comment on “Dependency distance: a new perspective on syntactic patterns in …
C Gómez-Rodríguez - Physics of Life Reviews, 2017 - Elsevier
Liu et al.[1] provide a comprehensive account of research on dependency distance in
human languages. While the article is a very rich and useful report on this complex subject …
human languages. While the article is a very rich and useful report on this complex subject …
[PDF][PDF] Panparser: a modular implementation for efficient transition-based dependency parsing
Abstract We present PanParser, a Python framework dedicated to transition-based
structured prediction, and notably suitable for dependency parsing. On top of providing an …
structured prediction, and notably suitable for dependency parsing. On top of providing an …
Fine-tuning Transformer-based MT Using Syntactic Guides
J Makwisai, P Boonkwan, S Usanavasin… - … Joint Symposium on …, 2023 - ieeexplore.ieee.org
This paper explores the profound impact of incorporating dependency tree information into
the fine-tuning process of Transformer-based machine translation (MT) systems. The study …
the fine-tuning process of Transformer-based machine translation (MT) systems. The study …
Left-corner parsing for dependency grammar
H Noji, Y Miyao - Information and Media Technologies, 2016 - jstage.jst.go.jp
In this article, we present an incremental dependency parsing algorithm with an arc-eager
variant of the left-corner parsing strategy. Our algorithm's stack depth captures the center …
variant of the left-corner parsing strategy. Our algorithm's stack depth captures the center …