Difference between revisions of "Automatic Evaluation Method"

From Cohen Courses
Jump to navigationJump to search
Line 24: Line 24:
  
 
== References ==
 
== References ==
 +
[1] John Lafferty, Fernando Pereira, and Andrew McCallum. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML.

Revision as of 23:13, 30 September 2010

Summary

Automatic evaluation methods usually come into place where there is hard to define a ground truth (for example in machine translation) or the labeled data is very expensive (for example in co-reference resolution). This topic has been developed a lot since last decade, and showed its applicability in many different NLP tasks.

Main Ideas

The main ideas behind automatic evaluation methods (or metrics) is that there is an alternative measure A to the original measure B. The measure B requires ground truth (or labeled data) where usually measure A does not require ground truth (or a small set of it).

A few example of alternative measures are

  • Entropy, it measures how well is the mapping function between two sets and serves in the cases that the mapping function is a crucial indicator of the overall performance.
  • N-gram statistics, it measures how n-gram patterns in the output text are formed, which performs well as an alternative measure for text generation tasks.

The proof of applicability for automatic evaluation methods in different task usually starts with a hypothesis and requires a correlation analysis of the alternative measure with original measure.

Applications in NLP Tasks

  • BLEU for Machine Translation

The most famous application of automatic evaluation is the BLEU score for machine translation which takes the matched n-gram statistics of the system output with human generated output. The most innovative idea behind BLEU is that there is no well-defined ground truth in machine translation where many outputs are acceptable, BLEU removes the needs of human grader and allows large-scale testing, which then speeds up the development of the machine translation field. It is the groundbreaking work in this area, which inspires the rest three.

  • ROUGE for Text Summarization

As another text generation task, the case for text summarization is very similar to machine translation. In text summarization, many different outputs are acceptable too. Thus ROUGE is proposed after the idea of BLEU to measure the performance of text summarization system by matched n-gram statistics.

  • Alignment Entropy for Machine Transliteration

Alignment entropy is a whole new idea in automatic evaluation methods. The alignment process is a very important process for training a machine transliteration system. And experiments show that the performance of machine transliteration is largely determined by the performance of its alignment process. And entropy is a good measurement for mapping functions, it shows great applicability and scalability for this task.

References

[1] John Lafferty, Fernando Pereira, and Andrew McCallum. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of ICML.