View source for Paper: Zhang and Johnson, CoNLL 2003

From Cohen Courses

← Paper: Zhang and Johnson, CoNLL 2003

You do not have permission to edit this page, for the following reason:

---

You can view and copy the source of this page.

== Citation == Robust Risk Minimization based Named Entity Recognition System, Zhang and Johnson, CoNLL 2003 == Online Version == [http://www.cnts.ua.ac.be/conll2003/pdf/20407zha.pdf Here] is the online version of the paper. == Summary == This [[category::paper]] describes a robust linear classification system for [[AddressesProblem::Named Entity Recognition]]. Earlier reports suggested accuracy (F1) of machine learning based systems to be in the lower 90s, but these studies were often performed on relatively restricted domains. Performance of a statistically based named entity extraction system can vary significantly depending on the underlying domain. The advantage of the proposed system in this [[category::paper]] is that it can easily incorporate a large number of linguistic features. The main focus of this paper is to investigate the impact of some local features and to show how the system performance can be enhanced significantly with some relatively simple token-based features. More sophisticated linguistic features, although helpful, yield much less improvement in system performance than might be expected. This study provides useful insight into usefulness of various available local linguistic features. Since these simple features are readily available for many languages, it suggests the possibility of setting up a language independent [[AddressesProblem::Named Entity Recognition]] system quickly so that its performance is close to a system that uses much more sophisticated, language dependent features. == Brief description of the method == The authors treat the [[AddressesProblem::Named Entity Recognition]] problem as a sequential token-based tagging problem. The sequence of tokenized text is denoted by <math>\{w_{i}\}(i = 0, 0, \ldots, m)</math>. The goal is to assign a class-label <math>t_{i}</math> to every token <math>w_{i}</math>. In this paper, IOB1 encoding scheme provided in the CoNLL-2003 shared task is used. The system estimates the conditional probability <math>P(t_{i}=c|x_i)=P(t_i=c|\{w_i\},\{t_j\}_{j \leq i})</math>, where <math>x_i</math> is the feature vector and can depend on previously predicted class labels <math>\{t_j\}_{j \leq i}</math>, but the dependency is typically assumed to be local. The conditional probability model has the following parametric form: <math>P(t_i = c|x_i , \{t_{i-l}, \ldots , t_{i-1}\}) = T(w_{c}^{T}x_i = b_c)</math> where <math>T(y)</math> = min(1, max(0,y)) is the truncation of <math>y</math> into the interval [0,1]. <math>w_c</math> is a linear weight vector and <math>b_c</math> is a constant. Given the training data <math>(x_i , t_i)</math> for <math>i = 1, \ldots , n</math>. It was shown in [[paper::Zhang et al., 2002]] that such a model can be estimated by solving the following optimization problem for each <math>c</math>: <math>\underset{w,b}{\text{inf}}\frac{1}{n}\sum_{i=1}^{n}f(w_c^T x_i + b_c , y_c^i)</math>, where <math>y_c^i = 1</math> when <math>t_i = c</math> and <math>y_c^i = -1</math> otherwise. The function <math>f</math> is defined as: [[File:CoNLL2003_pic1.jpg]] The author calls a classification method that is based on approximately minimizing this risk function ''robust risk minimization''. == Experimental Result == The authors study the performance of the system with different feature combinations on the English development set. Table 1 shows features used, and Table 2 shows the results. [[File:CoNLL2003_results.jpg]] The following points are worth noting - * Experiment 1 and Experiment 2 implies that tokens by themselves, whether represented as mixed case text or not, do not significantly affect the system performance. * Experiment 3 shows that even without case information, the performance of a statistical named entity recognition system can be greatly enhanced with token prefix and suffix information. * Experiment 4 suggests that capitalization is a very useful feature for mixed case text. * Experiment 5 shows that with token prefix and suffix information that incorporates a character-based entity model, the system performance is further enhanced. * In Experiment 6 the POS and chunking information was added, and it lead to only a relatively small improvement * Experiment 7 shows that by adding four supplied dictionary a small but statistically significant improvement is observed. * Experiment 8 adds a number of additional dictionaries from different sources and it lead to a slight improvement in the system. Most of the performance improvements can be achieved with some relatively simple token features that are easy to construct. Although, more sophisticated linguistic features are helpful, they provide much less improvement than might be expected. == Related papers == Similar kind of risk minimization method is implemented in [[paper::Zhang et al., 2002]].

Return to Paper: Zhang and Johnson, CoNLL 2003.