Parsing Algorithms and Metrics

Details Parsing Algorithms and Metrics Parsing Algorithms and Metrics

1996-05-30

arxiv.org/abs/cmp-lg/9605036v1

Proceedings of the 34th Meeting of the Association for Computational Linguistics (ACL'96)

Computer Science

Computation and Language

Scientific paper

Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algorithms, including the Viterbi algorithm, attempt to optimize the same metric, namely the probability of getting the correct labelled tree. By choosing a parsing algorithm appropriate for the evaluation metric, better performance can be achieved. We present two new algorithms: the ``Labelled Recall Algorithm,'' which maximizes the expected Labelled Recall Rate, and the ``Bracketed Recall Algorithm,'' which maximizes the Bracketed Recall Rate. Experimental results are given, showing that the two new algorithms have improved performance over the Viterbi algorithm on many criteria, especially the ones that they optimize.

Affiliated with

Also associated with

No associations

Rating

Parsing Algorithms and Metrics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parsing Algorithms and Metrics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parsing Algorithms and Metrics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696363