|
Theoretical Foundations of Computer Science
A note on the incorrect operation of the Covington parsing algorithm
P. I. Spiritseva Tver State University, Tver
Abstract:
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.
Received: 05.04.2021 Revised: 08.04.2021
Citation:
P. I. Spiritseva, “A note on the incorrect operation of the Covington parsing algorithm”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2021, no. 1, 71–75
Linking options:
https://www.mathnet.ru/eng/vtpmk610 https://www.mathnet.ru/eng/vtpmk/y2021/i1/p71
|
Statistics & downloads: |
Abstract page: | 148 | Full-text PDF : | 81 | References: | 40 |
|