Unsupervised Constituency Parsing on CTB word-level gold trees (test)
49.95F1 ScoreC-PCFG
Evaluation Results
| Method | Links | |
|---|---|---|
| C-PCFGInput type=Word, Complexity=O(n^3)2021.07 | 49.95 | |
| R2D2Input type=Word-piece, Complexity=O(n), Evaluation target=Word-level gold trees2021.07 | 44.85 | |
| BERT-MASKInput type=Word-piece, Complexity=O(n^4)2021.07 | 33.24 | |
| Right BranchingInput type=Word, Complexity=O(n)2021.07 | 27.53 | |
| ON-LSTMInput type=Word, Complexity=O(n)2021.07 | 24.73 | |
| Random TreesInput type=Word2021.07 | 20.17 | |
| Left BranchingInput type=Word, Complexity=O(n)2021.07 | 11.28 |