A note on the incorrect operation of the Covington parsing algorithm
Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 1 (2021), pp. 71-75
The Covington algorithm LSUP for the syntactic analysis of projective dependencies is considered. It is shown that the algorithm does not analyze all the projective structures (in particular, those specified in the article itself), so the use of this algorithm leads to incorrect results.
Keywords:
syntactic analysis, projective dependency, corpus linguistics, dependency trees.
@article{VTPMK_2021_1_a5,
author = {P. I. Spiritseva},
title = {A note on the incorrect operation of the {Covington} parsing algorithm},
journal = {Vestnik Tverskogo gosudarstvennogo universiteta. Seri\^a Prikladna\^a matematika},
pages = {71--75},
year = {2021},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VTPMK_2021_1_a5/}
}
TY - JOUR AU - P. I. Spiritseva TI - A note on the incorrect operation of the Covington parsing algorithm JO - Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika PY - 2021 SP - 71 EP - 75 IS - 1 UR - http://geodesic.mathdoc.fr/item/VTPMK_2021_1_a5/ LA - ru ID - VTPMK_2021_1_a5 ER -
P. I. Spiritseva. A note on the incorrect operation of the Covington parsing algorithm. Vestnik Tverskogo gosudarstvennogo universiteta. Seriâ Prikladnaâ matematika, no. 1 (2021), pp. 71-75. http://geodesic.mathdoc.fr/item/VTPMK_2021_1_a5/
[1] Covington M. A., “A fundamental algorithm for dependency parsing”, Proceedings of the 39th annual ACM Southeast Conference, 2001, 95–102
[2] Gomez-Rodriguez C., Carroll J., Weir D. J., “Dependency Parsing Schemata and Mildly Non-Projective Dependency Parsing”, Computational Linguistics, 37:3 (2011), 541–586 | DOI | MR