F1 score: 91.92
Papers with Code · CC BY-SA 4.0
Constituency Parsing
Constituency parsing aims to extract a constituency-based parse tree from a sentence that represents its syntactic structure according to a phrase structure grammar.
Example:
Sentence (S)
|
+-------------+------------+
| |
Noun (N) Verb Phrase (VP)
| |
John +-------+--------+
| |
Verb (V) Noun (N)
| |
sees Bill
Recent approaches convert the parse tree into a sequence following a depth-first traversal in order to be able to apply sequence-to-sequence models to it. The linearized version of the above parse tree looks as follows: (S (N) (VP V N)).
논문
F1 score: 89.40
F1 score: 92.66
F1 score: 92.33
F1 score: 87.43
F1 score: 92.50
F1 score: 93.52
F1 score: 95.6
F1 score: 94.47
F1 score: 95.5
F1 score: 94.66
F1 score: 95.92
F1 score: 91.75
F1 score: 96.38
F1 score: 95.44