This repo is based on:
- https://github.com/mitchellstern/minimal-span-parser
- https://github.com/junekihong/beam-span-parser
Conducting experiments on the well-known and publicly available Vietnamese Treebank corpus from the VLSP project with bracketed structure format (similar to English Penn Treebank).
Constructing train/valid/test sets with 18:1:1 ratio.
Where T is predicted tree (, where
is a span and
is the corresponding label) and
T* is golden tree.
| Model | F1 Dev | F1 Test |
|---|---|---|
| Shift-reduce parser (J.Cross & L.Huang, 2016) [1] | 67.47 | 68.65 (R: 64.24, P: 73.70) |
| Beam parser (J.Hong & L.Huang, 2018) [2] | 75.02 | 74.84 (R: 75.47, P: 74.22) |
| Minimal top-down parser (M.Stern et al., 2017) [3] | 74.18 | 74.36 (R: 74.02, P: 74.70) |
| Minimal chart parser (M.Stern et al., 2017) [3] | 75.24 | 76.14 (R: 75.04, P: 77.27) |
| Fasttext minimal parser (our test) | 75.35 | 76.30 (R: 76.45, P: 76.14) |
| Using BERT as feature (our work) [4] | 79.49 | 79.82 (R: 78.29; P: 81.41) |
| Using BERT with fine-tuning (our work) [4] | 80.95 | 81.29 (R: 80.47, P: 82.12) |
[1] James Cross & Liang Huang, Span-based constituency parsing with a structure-label system and provably optimal dynamic oracles, EMNLP, 2016.
[2] Juneki Hong & Liang Huang, Linear-Time Constituency Parsing with RNNs and Dynamic Programming, Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Short Papers), trang 477-483, Melbourne, Australia, 15-20/07/2018.
[3] Mitchell Stern, Jacob Andreas, Dan Klein, A minimal span-based neural constituency parser, In Proceedings of the Association for Computational Linguistics, 2017a.
[4] Thi-Phuong-Uyen PHAN, Ngoc-Thanh-Tung HUYNH, Hung-Thinh TRUONG, Tuan-An DAO, Dien Dinh, Vietnamese Span-based Constituency Parsing with BERT Embedding, 2019, 1-7. 10.1109/KSE.2019.8919467.