Name
Abstract | ||
|---|---|---|
PARSEVAL, the default paradigm for evaluating constituency parsers, calculates parsing success (Precision/Recall) as a function of the number of matching labeled brackets across the test set. Nodes in constituency trees, however, are connected together to reflect important linguistic relations such as predicate-argument and direct-dominance relations between categories. In this paper, we present FREVAL, a generalization of PARSEVAL, where the precision and recall are calculated not only for individual brackets, but also for co-occurring, connected brackets (i.e. fragments). FREVAL fragments precision (FLP) and recall (FLR) interpolate the match across the whole spectrum of fragment sizes ranging from those consisting of individual nodes (labeled brackets) to those consisting of full parse trees. We provide evidence that FREVAL is informative for inspecting relative parser performance by comparing a range of existing parsers. |
Year | Venue | Keywords |
|---|---|---|
2014 | LREC 2014 - NINTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION | fragments,parsing,evaluation |
Field | DocType | Citations |
Computer science,Precision and recall,Interpolation,Speech recognition,Parseval's theorem,Bracket,Ranging,Artificial intelligence,Natural language processing,Parsing,Recall,Test set | Conference | 1 |
PageRank | References | Authors |
0.34 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joost Bastings | 1 | 48 | 2.92 |
| Khalil Sima'an | 2 | 443 | 50.32 |