Unsupervised Constituency Parsing on WSJ word-level gold trees (test)
54.08F1C-PCFG
Evaluation Results
| Method | Links | ||
|---|---|---|---|
| C-PCFGInput type=Word, Complexity=O(n^3)2021.07 | 54.08 | 60.1 | |
| DIORAInput type=Word, Complexity=O(n^3)2021.07 | 51.42 | 58.9 | |
| R2D2Input type=Word-piece, Complexity=O(n), Evaluation target=Word-level gold trees2021.07 | 48.11 | — | |
| ON-LSTMInput type=Word, Complexity=O(n)2021.07 | 47.72 | 50 | |
| Right BranchingInput type=Word, Complexity=O(n)2021.07 | 39.62 | — | |
| BERT-MASKInput type=Word-piece, Complexity=O(n^4)2021.07 | 37.39 | — | |
| Random TreesInput type=Word2021.07 | 17.76 | — | |
| Left BranchingInput type=Word, Complexity=O(n)2021.07 | 8.15 | — |