Title: TOWARDS INTERPRETABLE EVALUATIONS: A CASE STUDY OF NAMED ENTITY RECOGNITION

Abstract: With the proliferation of models for natural language processing (NLP) tasks, it is even harder to understand the differences between models and their relative merits. Simply looking at differences between holistic metrics such as accuracy, BLEU, or F1 do not tell us why or how a particular method is better and how dataset biases influence the choices of model design. In this paper, we present a general methodology for interpretable evaluation of NLP systems and choose the task of named entity recognition (NER) as a case study, which is a core task of identifying people, places, or organizations in text. The proposed evaluation method enables us to interpret the model biases, dataset biases, and how the differences in the datasets affect the design of the models, identifying the strengths and weaknesses of current approaches. By making our analysis tool available, we make it easy for future researchers to run similar analyses and drive the progress in this area.
Under review as a conference paper at ICLR 2020 of the models). We draw on the complementary strengths of the fine-grained evaluation and multidataset evaluation, driving fine-grained analysis to the multi-dataset setting. To this end, we devise a generalized evaluation methodology and choose the NER task as a case study. More specifically, we introduce the notion of attribute, which can be defined flexibly as the evaluation task needs. Here, we utilize the attribute to describe the property of each test entity for the NER task (i.e., entity length). Then, the test set will be divided into a set of buckets by different attributes of test entities. This makes it possible to evaluate recognition accuracy of different varieties of entities, achieving much more fine-grained analysis than standard corpus-level measures.

1. INTRODUCTION:

The development of deep neural networks has greatly sped the evolution of NLP systems. However, these advances have also come with a plethora of design decisions: should we choose a CNN-based (Kalchbrenner et al., 2014; Kim, 2014) , RNN-based (Sutskever et al., 2014; Bahdanau et al., 2014) or Transformer-based (Vaswani et al., 2017; Dai et al., 2018) architecture? What variety of pre-training method should we use (Le & Mikolov, 2014; Peters et al., 2018; Devlin et al., 2018; Akbik et al., 2018) ? The proliferation of model variants pose a great challenge for current evaluation methodology, which are usually opaque and simply give a single holistic score (Papineni et al., 2002; Banerjee & Lavie, 2005; Popović & Ney, 2011) .

To alleviate this problem, researchers have made efforts, mainly focusing in two directions. First, some works (Farrús Cabeceran et al., 2010; Popović & Ney, 2011; Lommel et al., 2014) have attempted to shift the granularity of evaluation from holistic to fine-grained by conducting error analysis. Despite its effectiveness, the process of error analysis usually requires manual examination and depends on some pre-existing assumptions, suffering from confirmation bias, and risking ignoring new types of errors (Neubig et al., 2019) . Additionally, this evaluation method based on error analysis is usually applied to only a single dataset (Karpathy et al., 2015; Kummerfeld & Klein, 2013; Kummerfeld et al., 2012) , lacking discussion of fine-grained analysis in a multi-dataset setting. As a result, many important questions remain unclear: how to characterize the factors that influence the tasks for different datasets? how do the different choices of datasets influence the models' performance?

Another way to improve the evaluation strategy is common in our routine experimental design. That is to evaluate our models on multiple datasets with a holistic metric (Peters et al., 2018; Devlin et al., 2018) . Currently, researchers are making efforts along this direction by setting up general evaluation benchmarks, such as GLUE (Wang et al., 2018) and SuperGLUE (Wang et al., 2019) , which involve a diverse set of datasets. Although it enables us to gain a more comprehensive assessment of the models, the influence of different datasets on models is simply reflected by a holistic metric, which is not interpretable, and consequently, we are not clear about how different datasets influence the choices of model architectures.

In this paper, we argue that a complete evaluation method should not only reflect the individual performance of the model on one dataset or multiple datasets but also be able to interpret the model biases, dataset biases, and their correlation (how the difference in the datasets affects the design A t t r ib u t e -w is e < l a t e x i t s h a 1 _ b a s e 6 4 = " T 0 8 N T b z v V z q T X r g 6 V t F D q D W f e P I = " > A

A A C 0 X i c j V H L S s N A F D 2 N r 1 p f V Z d u g k V w Y 0 m K o M u K G 5 c V 7 Q N q l W Q 6 r U P T J E w m S i m C u P U H 3 O p P i X + g f + G d M Y J a R C c k O X P u P W f m 3 u v H g U i U 4 7 z k r K n p m d m 5 / H x h Y X F p e a W 4 u t Z I o l Q y X m d R E M m W 7 y U 8 E C G v K 6 E C 3 o o l 9 4 Z + w J v + 4 F D H m 1 d c J i I K T 9 U o 5 p 2 h 1 w 9 F T z B P E X V + o J Q U f q r 4 z r V I + E W x 5 J Q d s + x J 4 G a g h G z V o u I z z t B F B I Y U Q 3 C E U I Q D e E j o a c O F g 5 i 4 D s b E S U L C x D l u U C B t S

l m c M j x i B / T t 0 6 6 d s S H t t W d i 1 I x O C e i V p L S x R Z q I 8 i R h f Z p t 4 q l x 1 u x v 3 m P j q e 8 2 o r + f e Q 2 J V b g k 9 i / d Z + Z / d b o W h R 7 2 T Q 2 C a o o N o 6 t j m U t q u q J v b n + p S p F D T J z G X Y p L w s w o P / t s G 0 1 i a t e 9 9 U z 8 1 W R q V u 9 Z l p v i T d + S B u z + H O c k a F T K r l N 2 j y u l 6 m 4 2 6 j w 2 s I l t m u c e q j h C D X X y l n j A I 5 6 s E 2 t k 3 V p 3 H 6 l W L t O s 4 9 u y 7 t 8 B p Q S V E A = = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " T 0 8 N T b z v V z q T X r g 6 V t F D q D W f e P I = " > A

A A C 0 X i c j V H L S s N A F D 2 N r 1 p f V Z d u g k V w Y 0 m K o M u K G 5 c V 7 Q N q l W Q 6 r U P T J E w m S i m C u P U H 3 O p P i X + g f + G d M Y J a R C c k O X P u P W f m 3 u v H g U i U 4 7 z k r K n p m d m 5 / H x h Y X F p e a W 4 u t Z I o l Q y X m d R E M m W 7 y U 8 E C G v K 6 E C 3 o o l 9 4 Z + w J v + 4 F D H m 1 d c J i I K T 9 U o 5 p 2 h 1 w 9 F T z B P E X V + o J Q U f q r 4 z r V I + E W x 5 J Q d s + x J 4 G a g h G z V o u I z z t B F B I Y U Q 3 C E U I Q D e E j o a c O F g 5 i 4 D s b E S U L C x D l u U C B t S l m c M j x i B / T t 0 6 6 d s S H t t W d i 1 I x O C e i V p L S x R Z q I 8 i R h f Z p t 4 q l x 1 u x v 3 m P j q e 8 2 o r + f e Q 2 J V b g k 9 i / d Z + Z / d b o W h R 7 2 T Q 2 C a o o N o 6 t j m U t q u q J v b n + p S p F D T J z G X Y p L w s w o P / t s G 0 1 i a t e 9 9 U z 8 1 W R q V u 9 Z l p v i T d + S B u z + H O c k a F T K r l N 2 j y u l 6 m 4 2 6 j w 2 s I l t m u c e q j h C D X X y l n j A I 5 6 s E 2 t k 3 V p 3 H 6 l W L t O s 4 9 u y 7 t 8 B p Q S V E A = = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " T 0 8 N T b z v V z q T X r g 6 V t F D q D W f e P I = " > A A A C 0 X i c j V H L S s N A F D 2 N r 1 p f V Z d u g k V w Y 0 m K o M u K G 5 c V 7 Q N q l W Q 6 r U P T J E w m S i m C u P U H 3 O p P i X + g f + G d M Y J a R C c k O X P u P W f m 3 u v H g U i U 4 7 z k r K n p m d m 5 / H x h Y X F p e a W 4 u t Z I o l Q y X m d R E M m W 7 y U 8 E C G v K 6 E C 3 o o l 9 4 Z + w J v + 4 F D H m 1 d c J i I K T 9 U o 5 p 2 h 1 w 9 F T z B P E X V + o J Q U f q r 4 z r V I + E W x 5 J Q d s + x J 4 G a g h G z V o u I z z t B F B I Y U Q 3 C E U I Q D e E j o a c O F g 5 i 4 D s b E S U L C x D l u U C B t S l m c M j x i B / T t 0 6 6 d s S H t t W d i 1 I x O C e i V p L S x R Z q I 8 i R h f Z p t 4 q l x 1 u x v 3 m P j q e 8 2 o r + f e Q 2 J V b g k 9 i / d Z + Z / d b o W h R 7 2 T Q 2 C a o o N o 6 t j m U t q u q J v b n + p S p F D T J z G X Y p L w s w o P / t s G 0 1 i a t e 9 9 U z 8 1 W R q V u 9 Z l p v i T d + S B u z + H O c k a F T K r l N 2 j y u l 6 m 4 2 6 j w 2 s I l t m u c e q j h C D X X y l n j A I 5 6 s E 2 t k 3 V p 3 H 6 l W L t O s 4 9 u y 7 t 8 B p Q S V E A = = < / l a t e x i t > Tab. 5 < l a t e x i t s h a 1 _ b a s e 6 4 = " q h Z b P P m U 3 I t O K w h b E W b x E Q k F 4 F w = " > A A A C 7 n i c j V H L S s N A F D 2 N 7 / i K u n Q T L I K C l K R Q d S m 4 c a l g t d A W S d K x B t M k T C Z i C f 0 G d + 7 E r T / g V j 9 D / A P 9 C + + M U 1 C L 6 I T M n D n 3 n j N z 5 / p p F G b C c V 5 L x t j 4 x O T U 9 I w 5 O z e / s G g t L Z 9 k S c 4 D V g + S K O E N 3 8 t Y F M a s L k I R s U b K m d f z I 3 b q X + 7 L + O k V 4 1 m Y x M e i n 7 J 2 z + v G 4 X k Y e I K o M 2 u z J d i 1 U D 5 N 3 v X b h V N x t m w 9 1 W q D 4 t j z K 3 Z t Y J p n V p l o N e x R 4 G p Q h h 6 H i f W C F j p I E C B H D w w x B O E I H j L 6 m n D h I C W u j Y I 4 T i h U c Y Y B T N L m l M U o w y P 2 k u Y u 7 Z q a j W k v P T O l D u i U i H 5 O S h v r p E k o j x O W p 9 k q n i t n y f 7 m X S h P e b c + r b 7 2 6 h E r c E H s X 7 p h 5 n 9 1 s h a B c + y q G k K q K V W M r C 7 Q L r l 6 F X l z + 0 t V g h x S 4 i T u U J w T D p R y + M 6 2 0 m S q d v m 2 n o q / q U z J y n 2 g c 3 O 8 y 1 t S g 9 2 f 7 R w F J 9 W K 6 1 T c o 2 p 5 b 1 u 3 e h q r W M M G 9 X M H e z j A I e r k f Y N H P O H Z S I 1 b 4 8 6 4 / 0 w 1 S l q z g m / D e P g A H K 2 d B Q = = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " q h Z b P P m U 3 I t O K w h b E W b x E Q k F 4 F w = " > A A A C 7 n i c j V H L S s N A F D 2 N 7 / i K u n Q T L I K C l K R Q d S m 4 c a l g t d A W S d K x B t M k T C Z i C f 0 G d + 7 E r T / g V j 9 D / A P 9 C + + M U 1 C L 6 I T M n D n 3 n j N z 5 / p p F G b C c V 5 L x t j 4 x O T U 9 I w 5 O z e / s G g t L Z 9 k S c 4 D V g + S K O E N 3 8 t Y F M a s L k I R s U b K m d f z I 3 b q X + 7 L + O k V 4 1 m Y x M e i n 7 J 2 z + v G 4 X k Y e I K o M 2 u z J d i 1 U D 5 N 3 v X b h V N x t m w 9 1 W q D 4 t j z K 3 Z t Y J p n V p l o N e x R 4 G p Q h h 6 H i f W C F j p I E C B H D w w x B O E I H j L 6 m n D h I C W u j Y I 4 T i h U c Y Y B T N L m l M U o w y P 2 k u Y u 7 Z q a j W k v P T O l D u i U i H 5 O S h v r p E k o j x O W p 9 k q n i t n y f 7 m X S h P e b c + r b 7 2 6 h E r c E H s X 7 p h 5 n 9 1 s h a B c + y q G k K q K V W M r C 7 Q L r l 6 F X l z + 0 t V g h x S 4 i T u U J w T D p R y + M 6 2 0 m S q d v m 2 n o q / q U z J y n 2 g c 3 O 8 y 1 t S g 9 2 f 7 R w F J 9 W K 6 1 T c o 2 p 5 b 1 u 3 e h q r W M M G 9 X M H e z j A I e r k f Y N H P O H Z S I 1 b 4 8 6 4 / 0 w 1 S l q z g m / D e P g A H K 2 d B Q = = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " q h Z b P P m U 3 I t O K w h b E W b x E Q k F 4 F w = " > A A A C 7 n i c j V H L S s N A F D 2 N 7 / i K u n Q T L I K C l K R Q d S m 4 c a l g t d A W S d K x B t M k T C Z i C f 0 G d + 7 E r T / g V j 9 D / A P 9 C + + M U 1 C L 6 I T M n D n 3 n j N z 5 / p p F G b C c V 5 L x t j 4 x O T U 9 I w 5 O z e / s G g t L Z 9 k S c 4 D V g + S K O E N 3 8 t Y F M a s L k I R s U b K m d f z I 3 b q X + 7 L + O k V 4 1 m Y x M e i n 7 J 2 z + v G 4 X k Y e I K o M 2 u z J d i 1 U D 5 N 3 v X b h V N x t m w 9 1 W q D 4 t j z K 3 Z t Y J p n V p l o N e x R 4 G p Q h h 6 H i f W C F j p I E C B H D w w x B O E I H j L 6 m n D h I C W u j Y I 4 T i h U c Y Y B T N L m l M U o w y P 2 k u Y u 7 Z q a j W k v P T O l D u i U i H 5 O S h v r p E k o j x O W p 9 k q n i t n y f 7 m X S h P e b c + r b 7 2 6 h E r c E H s X 7 p h 5 n 9 1 s h a B c + y q G k K q K V W M r C 7 Q L r l 6 F X l z + 0 t V g h x S 4 i T u U J w T D p R y + M 6 2 0 m S q d v

m 2 n o q / q U z J y n 2 g c 3 O 8 y 1 t S g 9 2 f 7 R w F J 9 W K 6 1 T c o 2 p 5 b 1 u 3 e h q r W M M G 9 X M H e z j A I e r k f Y N H P O H Z S I 1 b 4 8 6 4 / 0 w 1 S l q z g m / D e P g A H K 2 d B Q = = < / l a t e x i t > Tab. 3 Additionally, the proposed attribute-aided evaluation methodology encourages us to introduce multiple attributes to find more potential factors which affect the NER models on different datasets. We further propose three analytical approaches as shown in Fig. 1 : attribute-wise, model-wise, and bucketwise analyses that have the following characteristics accordingly: Attribute-wise (Sec. 3.3.2) analysis could instruct us to find which factors matter for the NER tasks and figure out the commonality of factors across different NER datasets; Model-wise (Sec. 3.3.1) analysis aims to investigate how different attributes influence the performance of models with different architectures and pre-trained knowledge; Bucket-wise (Sec. 3.3.3) analysis diagnoses the strengths and weaknesses of existing models and helps us understand how different choices of datasets influence the model performance.

< l a t e x i t s h a 1 _ b a s e 6 4 = " 7 j L u R 4 C b Y + Z 9 7 B l S 1 S X 5 v 5 2 v u 8 8 = " > A A A C 7 n i c j V H L S s N A F D 2 N r 1 p f V Z d u g k V Q k J A o P p Y F N y 4 r 9 A V t k S S O N Z g m Y T I R S + g 3 u H M n b v 0 B t / o Z 4 h / o X 3 h n H M E H o h M y c + b c e 8 7 M n e s l Y Z A K 2 3 4 u G G P j E 5 N T x e n S z O z c / E J 5 c a m Z x h n 3 W c O P w 5 i 3 P T d l Y R C x h g h E y N o J Z + 7 A C 1 n L O z + Q 8 d Y F 4 2 k Q R 3 U x T F h v 4 P a j 4 D T w X U H U c X m j K 9 i l U D 4 d 3 v d 6 u W 3 Z m 6 a e d n Z G e d 3 1 L H N 7 V C o d l y t E q 2 H + B I 4 G F e h R i 8 t P 6 O I E M X x k G I A h g i A c w k V K X w c O b C T E 9 Z A T x w k F K s 4 w Q o m 0 G W U x y n C J P a e 5 T 7 u O Z i P a S 8 9 U q X 0 6 J a S f k 9 L E G m l i y u O E 5 W m m i m f K W b K / e e f K U 9 5 t S K u n v Q b E C p w R + 5 f u I / O / O l m L w C n 2 V Q 0 B 1 Z Q o R l b n a 5 d M v Y q 8 u f m p K k E O C X E S n 1 C c E / a V 8 u O d T a V J V e 3 y b V 0 V f 1 G Z k p V 7 X + d m e J W 3 p A Y 7 3 9 v 5 E z S 3 L M e 2 n K O t S n V X t 7 q I F a x i n f q 5 h y o O U U O D v K 9 w j w c 8 G o l x b d w Y t + + p R k F r l v F l G H d v F + e d A w = = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " 7 j L u R 4 C b Y + Z 9 7 B l S 1 S X 5 v 5 2 v u 8 8 = " > A A A C 7 n i c j V H L S s N A F D 2 N r 1 p f V Z d u g k V Q k J A o P p Y F N y 4 r 9 A V t k S S O N Z g m Y T I R S + g 3 u H M n b v 0 B t / o Z 4 h / o X 3 h n H M E H o h M y c + b c e 8 7 M n e s l Y Z A K 2 3 4 u G G P j E 5 N T x e n S z O z c / E J 5 c a m Z x h n 3 W c O P w 5 i 3 P T d l Y R C x h g h E y N o J Z + 7 A C 1 n L O z + Q 8 d Y F 4 2 k Q R 3 U x T F h v 4 P a j 4 D T w X U H U c X m j K 9 i l U D 4 d 3 v d 6 u W 3 Z m 6 a e d n Z G e d 3 1 L H N 7 V C o d l y t E q 2 H + B I 4 G F e h R i 8 t P 6 O I E M X x k G I A h g i A c w k V K X w c O b C T E 9 Z A T x w k F K s 4 w Q o m 0 G W U x y n C J P a e 5 T 7 u O Z i P a S 8 9 U q X 0 6 J a S f k 9 L E G m l i y u O E 5 W m m i m f K W b K / e e f K U 9 5 t S K u n v Q b E C p w R + 5 f u I / O / O l m L w C n 2 V Q 0 B 1 Z Q o R l b n a 5 d M v Y q 8 u f m p K k E O C X E S n 1 C c E / a V 8 u O d T a V J V e 3 y b V 0 V f 1 G Z k p V 7 X + d m e J W 3 p A Y 7 3 9 v 5 E z S 3 L M e 2 n K O t S n V X t 7 q I F a x i n f q 5 h y o O U U O D v K 9 w j w c 8 G o l x b d w Y t + + p R k F r l v F l G H d v F + e d A w = = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " 7 j L u R 4 C b Y + Z 9 7 B l S 1 S X 5 v 5 2 v u 8 8 = " > A A A C 7 n i c j V H L S s N A F D 2 N r 1 p f V Z d u g k V Q k J A o P p Y F N y 4 r 9 A V t k S S O N Z g m Y T I R S + g 3 u H M n b v 0 B t / o Z 4 h / o X 3 h n H M E H o h M y c + b c e 8 7 M n e s l Y Z A K 2 3 4 u G G P j E 5 N T x e n S z O z c / E J 5 c a m Z x h n 3 W c O P w 5 i 3 P T d l Y R C x h g h E y N o J Z + 7 A C 1 n L O z + Q 8 d Y F 4 2 k Q R 3 U x T F h v 4 P a j 4 D T w X U H U c X m j K 9 i l U D 4 d 3 v d 6 u W 3 Z m 6 a e d n Z G e d 3 1 L H N 7 V C o d l y t E q 2 H + B I 4 G F e h R i 8 t P 6 O I E M X x k G I A h g i A c w k V K X w c O b C T E 9 Z A T x w k F K s 4 w Q o m 0 G W U x y n C J P a e 5 T 7 u O Z i P a S 8 9 U q X 0 6 J a S f k 9 L E G m l i y u O E 5 W m m i m f K W b K / e e f K U 9 5 t S K u n v Q b E C p w R + 5 f u I / O / O l m L w C n 2 V Q 0 B 1 Z Q o R l b n a 5 d M v Y q 8 u f m p K k E O C X E S n 1 C c E / a V 8 u O d T a V J V e 3 y b V 0 V f 1 G Z k p V 7 X + d m e J W 3 p A Y 7 3 9 v 5 E z S 3 L M e 2 n K O t S n V X t 7 q I F a x i n f q 5 h y o O U U O D v K 9 w j w c 8 G o l x b d w Y t + + p R k F r l v F l G H d v F + e d A w = = < / l a t e x i t > T a b . 4 < l a t e x i t s h a 1 _ b a s e 6 4 = " 7 X t p / P M 1 m / C N 0 y b 5 g h r H k g N 4 E Z k = " > A A A C 7 n i c j V H L S s N A F D 2 N r 1 p f V Z d u g k V Q k J C I r 2 X B j c s K f U F b J I l j D a Z J m E z E E v o N 7 t y J W 3 / A r X 6 G + A f 6 F 9 4 Z R / C B 6 I T M n D n 3 n j N z 5 3 p J G K T C t p 8 L x t j 4 x O R U c b o 0 M z s 3 v 1 B e X G q m c c Z 9 1 v D j M O Z t z 0 1 Z G E S s I Q I R s n b C m T v w Q t b y z g 9 k v H X B e B r E U V 0 M E 9 Y b u P 0 o O A 1 8 V x B 1 X N 7 o C n Y p l E + H 9 7 1 e b l v 2 p q m n n Z 1 R X n c 9 y 9 w e l U r H 5 Q r R a p g / g a N B B X r U 4 v I T u j h B D B 8 Z B m C I I A i H c J H S 1 4 E D G w l x P e T E c U K B i j O M U C J t R l m M M l x i z 2 n u 0 6 6 j 2 Y j 2 0 j N V a p 9 O C e n n p D S x R p q Y 8 j h h e Z q p 4 p l y l u x v 3 r n y l H c b 0 u p p r w G x A m f E / q X 7 y P y v T t Y i c I p 9 V U N A N S W K k d X 5 2 i V T r y J v b n 6 q S p B D Q p z E J x T n h H 2 l / H h n U 2 l S V b t 8 W 1 f F X 1 S m Z O X e 1 7 k Z X u U t q c H O 9 3 b + B M 0 t y 7 E t 5 2 i r U t 3 V r S 5 i B a t Y p 3 7 u o Y p D 1 N A g 7 y v c 4 w G P R m J c G z f G 7 X u q U d C a Z X w Z x t 0 b G k q d B A = = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " 7 X t p / P M 1 m / C N 0 y b 5 g h r H k g N 4 E Z k = " > A A A C 7 n i c j V H L S s N A F D 2 N r 1 p f V Z d u g k V Q k J C I r 2 X B j c s K f U F b J I l j D a Z J m E z E E v o N 7 t y J W 3 / A r X 6 G + A f 6 F 9 4 Z R / C B 6 I T M n D n 3 n j N z 5 3 p J G K T C t p 8 L x t j 4 x O R U c b o 0 M z s 3 v 1 B e X G q m c c Z 9 1 v D j M O Z t z 0 1 Z G E S s I Q I R s n b C m T v w Q t b y z g 9 k v H X B e B r E U V 0 M E 9 Y b u P 0 o O A 1 8 V x B 1 X N 7 o C n Y p l E + H 9 7 1 e b l v 2 p q m n n Z 1 R X n c 9 y 9 w e l U r H 5 Q r R a p g / g a N B B X r U 4 v I T u j h B D B 8 Z B m C I I A i H c J H S 1 4 E D G w l x P e T E c U K B i j O M U C J t R l m M M l x i z 2 n u 0 6 6 j 2 Y j 2 0 j N V a p 9 O C e n n p D S x R p q Y 8 j h h e Z q p 4 p l y l u x v 3 r n y l H c b 0 u p p r w G x A m f E / q X 7 y P y v T t Y i c I p 9 V U N A N S W K k d X 5 2 i V T r y J v b n 6 q S p B D Q p z E J x T n h H 2 l / H h n U 2 l S V b t 8 W 1 f F X 1 S m Z O X e 1 7 k Z X u U t q c H O 9 3 b + B M 0 t y 7 E t 5 2 i r U t 3 V r S 5 i B a t Y p 3 7 u o Y p D 1 N A g 7 y v c 4 w G P R m J c G z f G 7 X u q U d C a Z X w Z x t 0 b G k q d B A = = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " 7 X t p / P M 1 m / C N 0 y b 5 g h r H k g N 4 E Z k = " > A A A C 7 n i c j V H L S s N A F D 2 N r 1 p f V Z d u g k V Q k J C I r 2 X B j c s K f U F b J I l j D a Z J m E z E E v o N 7 t y J W 3 / A r X 6 G + A f 6 F 9 4 Z R / C B 6 I T M n D n 3 n j N z 5 3 p J G K T C t p 8 L x t j 4 x O R U c b o 0 M z s 3 v 1 B e X G q m c c Z 9 1 v D j M O Z t z 0 1 Z G E S s I Q I R s n b C m T v w Q t b y z g 9 k v H X B e B r E U V 0 M E 9 Y b u P 0 o O A 1 8 V x B 1 X N 7 o C n Y p l E + H 9 7 1 e b l v 2 p q m n n Z 1 R X n c 9 y 9 w e l U r H 5 Q r R a p g / g a N B B X r U 4 v I T u j h B D B 8 Z B m C I I A i H c J H S 1 4 E D G w l x P e T E c U K B i j O M U C J t R l m M M l x i z 2 n u 0 6 6 j 2 Y j 2 0 j N V a p 9 O C e n n p D S x R p q Y 8 j h h e Z q p 4 p l y l u x v 3 r n y l H c b 0 u p p r w G x A m f E / q X 7 y P y v T t Y i c I p 9 V U N A N S W K k d X 5 2 i V T r y J v b n 6 q S p B D Q p z E J x T n h H 2 l / H h n U 2 l S V b t 8 W 1 f F X 1 S m Z O X e 1 7 k Z X u U t q c H O 9 3 b + B M 0 t y 7 E t 5 2 i r U t 3 V r S 5 i B a t Y p 3 7 u o Y p D 1 N A g 7 y v c 4 w G P R m J c G z f G 7 X u q U d C a Z X w Z x t 0 b G k q d B A = = < / l a t e x i t > F ig . 4 < l a t e x i t s h a 1 _ b a s e 6 4 = " o s J V f k I o J g k W a 9 s G q 5 6 O h s E u F L A = " > A A A C 7 n i c j V H L S s N A F D 3 G V 6 2 v q k s 3 w S I o S E m K r 2 V B E J c V b B X a U p I 4 1 q F p E i Y T U U q / w Z 0 7 c e s P u N X P E P 9 A / 8 I 7 4 x R 8 I D o h M 2 f O v e f M 3 L l + E v J U O s 7 L i D U 6 N j 4 x m Z v K T 8 / M z s 0 X F h b r a Z y J g N W C O I z F i e + l L O Q R q 0 k u Q 3 a S C O b 1 / J A d + 9 0 9 F T + + Y C L l c X Q k r x L W 6 n m d i J / x w J N E t Q v r T c k u p f Z p i I 7 f 6 j s l Z 8 M 2 0 9 b W o L / P O y V 7 c 5 D P t w t F o v W w f w L X g C L M q M a F Z z R x i h g B M v T A E E E S D u E h p a 8 B F w 4 S 4 l r o E y c I c R 1 n G C B P 2 o y y G G V 4 x H Z p 7 t C u Y d i I 9 s o z 1 e q A T g n p F 6 S 0 s U q a m P I E Y X W a r e O Z d l b s b 9 5 9 7 a n u d k W r b 7 x 6 x E q c E / u X b p j 5 X 5 2 q R e I M u 7 o G T j U l m l H V B c Y l 0 6 + i b m 5 / q k q S Q 0 K c w q c U F 4 Q D r R y + s 6 0 1 q a 5 d v a 2 n 4 6 8 6 U 7 F q H 5 j c D G / q l t R g 9 3 s 7 f 4 J 6 u e Q 6 J f e w X K x s m 1 b n s I w V r F E / d 1 D B A a q o k f c 1 H v C I J y u x b q x b 6 + 4 j 1 R o x m i V 8 G d b 9 O x f Q n Q M = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " o s J V f k I o J g k W a 9 s G q 5 6 O h s E u F L A = " > A A A C 7 n i c j V H L S s N A F D 3 G V 6 2 v q k s 3 w S I o S E m K r 2 V B E J c V b B X a U p I 4 1 q F p E i Y T U U q / w Z 0 7 c e s P u N X P E P 9 A / 8 I 7 4 x R 8 I D o h M 2 f O v e f M 3 L l + E v J U O s 7 L i D U 6 N j 4 x m Z v K T 8 / M z s 0 X F h b r a Z y J g N W C O I z F i e + l L O Q R q 0 k u Q 3 a S C O b 1 / J A d + 9 0 9 F T + + Y C L l c X Q k r x L W 6 n m d i J / x w J N E t Q v r T c k u p f Z p i I 7 f 6 j s l Z 8 M 2 0 9 b W o L / P O y V 7 c 5 D P t w t F o v W w f w L X g C L M q M a F Z z R x i h g B M v T A E E E S D u E h p a 8 B F w 4 S 4 l r o E y c I c R 1 n G C B P 2 o y y G G V 4 x H Z p 7 t C u Y d i I 9 s o z 1 e q A T g n p F 6 S 0 s U q a m P I E Y X W a r e O Z d l b s b 9 5 9 7 a n u d k W r b 7 x 6 x E q c E / u X b p j 5 X 5 2 q R e I M u 7 o G T j U l m l H V B c Y l 0 6 + i b m 5 / q k q S Q 0 K c w q c U F 4 Q D r R y + s 6 0 1 q a 5 d v a 2 n 4 6 8 6 U 7 F q H 5 j c D G / q l t R g 9 3 s 7 f 4 J 6 u e Q 6 J f e w X K x s m 1 b n s I w V r F E / d 1 D B A a q o k f c 1 H v C I J y u x b q x b 6 + 4 j 1 R o x m i V 8 G d b 9 O x f Q n Q M = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = " o s J V f k I o J g k W a 9 s G q 5 6 O h s E u F L A = " > A A A C 7 n i c j V H L S s N A F D 3 G V 6 2 v q k s 3 w S I o S E m K r 2 V B E J c V b B X a U p I 4 1 q F p E i Y T U U q / w Z 0 7 c e s P u N X P E P 9 A / 8 I 7 4 x R 8 I D o h M 2 f O v e f M 3 L l + E v J U O s 7 L i D U 6 N j 4 x m Z v K T 8 / M z s 0 X F h b r a Z y J g N W C O I z F i e + l L O Q R q 0 k u Q 3 a S C O b 1 / J A d + 9 0 9 F T + + Y C L l c X Q k r x L W 6 n m d i J / x w J N E t Q v r T c k u p f Z p i I 7 f 6 j s l Z 8 M 2 0 9 b W o L / P O y V 7 c 5 D P t w t F o v W w f w L X g C L M q M a F Z z R x i h g B M v T A E E E S D u E h p a 8 B F w 4 S 4 l r o E y c I c R 1 n G C B P 2 o y y G G V 4 x H Z p 7 t C u Y d i I 9 s o z 1 e q A T g n p F 6 S 0 s U q a m P I E Y X W a r e O Z d l b s b 9 5 9 7 a n u d k W r b 7 x 6 x E q c E / u X b p j 5 X 5 2 q R e I M u 7 o G T j U l m l H V B c Y l 0 6 + i b m 5 / q k q S Q 0 K c w q c U F 4 Q D r R y + s 6 0 1 q a 5 d v a 2 n 4 6 8 6 U 7 F q H 5 j c D G / q l t R g 9 3 s 7 f 4 J 6 u e Q 6 J f e w X K x s m 1 b n s I w V r F E / d 1 D B A a q o k f c 1 H v C I J y u x b q x b 6 + 4 j 1 R o x m i V 8 G d b 9 O x f Q n Q M = < / l a t e x i t >

Our contributions can be precisely summarized as:

1) We draw on the complementary strengths of the fine-grained evaluation and multi-dataset evaluation, proposing a generalized evaluation methodology to interpret model biases, dataset biases, and their correlation. 2) We choose the NER task as a test case, the observations based on the extensive experiments (twelve models, ten attributes and six datasets) suggest directions for improvement and can drive the progress of this area. 3) Although some attributes defined in this paper are task-dependent, we claim our methodology is general since: a) for sequence labeling tasks (i.e., Partof-Speech, text chunking, and extractive summarization), this evaluation method could be transferred without much modification. b) for other types of NLP tasks, we could re-define the attributes and our proposed bucketization strategies, as well as three analytic approaches, are task-agnostic. For example, in machine translation, the attribution could be sentence length (Luong et al., 2015) , word itself (n-gram) in the reference file (Kumar & Tsvetkov, 2018) ; In question answering, the attribution could be answer length/type/position (Seo et al., 2016) , document length (Joshi et al., 2017) , and query length/type (Chen et al., 2016b) . Once we have determined related attributes, we could make similar analyses based on our proposed measures.

2. PRELIMINARIES:

We first summarize and compare past evaluation methodologies and then describe the NER task and its current evaluation strategy.

2.1. PROPERTIES OF EVALUATION METHODOLOGIES:



Methodology:

Interp.

Conform.

Supple-exam:

Interpretable metric √ × √ Evaluation is gaining increasing interest in NLP, especially on text generation tasks as exemplified by machine translation (Fishel et al., 2012; Irvine et al., 2013; Daems et al., 2014) . Generally, different evaluation methods can be characterized by the following three main properties:

Interpretability: Evaluation method could give interpretable results to help us understand where the weaknesses and strengths are. For example, "error analysis" (Kummerfeld et al., 2012; Kummerfeld & Klein, 2013; Karpathy et al., 2015) is an interpretable evaluation method since we could figure out detailed limitations of the evaluated systems. 2018) present a stress test method to diagnose natural language inference systems.

2.2. NER TASK AND CURRENT EVALUATION STRATEGY:

Task Description Named entity recognition (NER) is usually formulated as a sequence labeling problem (Huang et al., 2015; Ma & Hovy, 2016) . Formally, let X = {x 1 , x 2 , . . . , x T } be an input sequence and Y = {y 1 , y 2 , . . . , y T } be the output tags. The goal of this task is to estimate the conditional probability:

P (Y |X) = P (y t |X, y 1 , • • • , y t-1 )

Evaluation Strategy for NER Existing NER systems are commonly evaluated by corpus-level metrics (F 1-score) (Sang & De Meulder, 2003) and a small amount of work will conduct some manual error analysis (Ichihara et al., 2015; Derczynski et al., 2015) . With the increasing improvement in network architectures and pre-trained knowledge, the NER systems are quickly reaching a performance plateau (Akbik et al., 2018; Akbik et al.) . Therefore, fine-grained evaluation is required to identify the specific issues of existing NER systems. On the other hand, with the emergence of more and more NER datasets (Sang & De Meulder, 2003; Collobert et al., 2011; Weischedel et al., 2013) , the time is ripe for us to bridge the gap between the insufficient understanding of the nature of datasets itself and model designs. In this paper, we choose the NER task as a test case, interpreting model biases, dataset biases, as well as their correlation under a general framework. This work also takes a step towards interpretable architecture searching.

3. ATTRIBUTE-AIDED EVALUATION METHODOLOGY:

Our proposed evaluation methodology involves three key elements: attribute definition (Sec. 3.1), bucketization (Sec. 3.2) and the analytical approach (Sec. 3.3). Specifically, we first introduce the notion of attribute and define it in NER task as some property of the test entity, bywhich the test set will be divided into different sub-sets and the overall performance could be broken down into interpretable categories. Below, we will detail the three key elements.

3.1. DEFINITION OF ENTITY ATTRIBUTES:

Entity Attributes refer to the properties that can be used to characterize a given entity. Generally, different types of entity attributes provide different observation angles of system's performances.

Next, we will introduce entity attributes we explored in this paper in terms of token level, span level and sentence level. We take them into consideration since they are general features and could be transferred to other tasks.

Token-level 1) Token itself: it denotes the words of an entity. 2) Morphology: morphological features plays an essential role in many NLP tasks. Here, we define five cases for each entity token: including token, is upper case, lower case, digit, beginning with a capital letter, and others (such as punctuation).

Span-level 1) Entity itself: each entity is regarded as a unique identifier. 2) Entity length: the number of tokens in an entity. 3) Entity tag: the NER tag of an entity.

Sentence-level 1) Sentence length; 2) Entity density: it is the number of entity tokens divided by sentence length. 3) OOV density: it is the number of oov word divided by sentence length.

3.2. BUCKETIZATION STRATEGIES:

Bucketization is an operation that breaks down the holistic performance into different interpretable categories based on the attribute values. This can be achieved by dividing the set of test entities into different subsets of test entities (for span-and sentence-level attributes) or test tokens (for token-level attributes). Without loss of generality, we describe the entity-based bucketization strategies while it can be easily applied to token-based. To legibly describe the studied problem, we follow the commonly used notations throughout the paper. We refer to E, P , K as the sets of entities, entity attributes and attributes values, respectively.

The bucketization process can be formulated in a general form:

E te 1 , • • • , E te m = Bucket(E te |E tr , p)

, where E tr , E te represent the sets of training and test entities, respectively, p denotes a type of the attribute. The basic idea is that the test entity set is divided into m buckets based on the attribute p and corresponding training set. where E tr , E te represent the sets of training and test entities, respectively, p denotes a type of the attribute. Table 2 : Entity attributes we used in this paper and their corresponding bucketization strategies.

Specifically, each subset of test entities can be obtained as follows: E te i = {e|Atr(e, p) ∈ Ki , ∀e ∈ E te }, where Atr(e, p) is to query out the value of attribute p for entity e. Ki is a set of attribute values, with which entities should be put into the i-th bucket: Ki = {k|f (k) = i, ∀k ∈ K}. Above equation shows the key part for bucketization: how do we build the relationship between the value of entity attributes and the bucket number?. That is, we need to determine a criterion f , which guides us to put test entities according to its attribute values into suitable buckets. Here we explore three types of strategies for bucketization.

Strategy-I: Range division of attribute values (R-Bucket) An intuitive strategy is to bucketize the test entities based on their attribute values directly. Specifically, we could divide the range of attribute values into m discrete parts. For example, the sentence length with range [1, • • • , 6] could be divided into [1, 2] , [3, 4], [5, 6] three buckets. Tab. 2 shows which attributes are matched to this bucketization strategy.

Strategy-II: Familiarity of attribute values (F-Bucket):

The aim of the evaluation is to quantify the generalization errors of the system on the unseen samples. Therefore, by taking into account the degree to which the testing entities (or their attributes) have been seen in the training set, we can better figure out the impact of this attribute on model performance.

To achieve this, here we introduce a notion of familiarity to quantify the degree to which the attribute of a test entity has been seen in the training set.

F k (p) = |{e|Atr(e, p) = k, ∀e ∈ E tr }| |{e ∈ E tr }| (1)

Here, F k (p) ∈ [0, 1] denotes the degree to which the test entity attribute p with value k have been seen in the training set. Then we can define the following criterion to achieve the bucketization:

F Ki (p) ∈ ( i m , i+1 m ].

The basic idea behind the criterion is that test entities could be put into the i-th bucket when the familiarity of their attribute values meets the above condition. Tab. 2 shows which attributes we used for F-Bucket.

Strategy-III: Multi-attribute Familiarity (MF-Bucket) The benefit of our general methodology for interpretable evaluation is that we can easily define new valuable measures based on old measures already defined. Here, we can adapt our F-Bucket strategies to multi-attribute version and modify the Eq.1 as follows:

F k (p 1 , p 2 ) = |{e|Atr(e, p 1 ) = k 1 ∧ Atr(e, p 2 ) = k 2 , ∀e ∈ E tr }| |{Atr(e, p 1 ) = k 1 , ∀e ∈ E tr }| (2)

Figure 2 : The attribute definition of the entity New York in the sentence: "No new fixtures reported from New York ."

For example, when we instantiate the two entity attributes p 1 , p 2 as entity itself and tag respectively, the familiarity F k (p 1 , p 2 ) is a measure with intriguing explanation: for each test entity with tag k, this measure quantifies its category ambiguity: the probability that this entity is labeled as k in the training set.

To give a more intuitive understanding of the two processes: attribute definition and bucketization, Fig. 2 shows a concrete example, in which a set of attributes are defined for the target entity New York, with corresponding values.

3.3. ANALYTIC APPROACHES:

To better characterize the relation among attributes, models and datasets, we propose three analytical approaches: attribute-wise, model-wise, and bucket-wise, which can be used to interpret the model biases, dataset biases, and their correlation. 

E = E j 1 , • • • , E j

|E| based on a attribute p j . We introduce the notion of performance table T ∈ R |M |×|P |×|E| , in which T ijk represents the performance of i-th model on the k-th sub-test set (bucket) generated by j-th attribute. Next, we will show how these approaches are defined based on T .

3.3.1. MODEL-WISE:

The model-wise analysis aims to investigate how different attributes influence the performance of models with different architectures and pre-trained knowledge. For example, "does the lengths of entities influence the performances of CNN-LSTM-CRF-based NER system?"

Here we adopt two types of statistical variables S ρ i,j and S σ i,j to characterize how the j-th attribute influences the i-th model.

S ρ i,j = Spearman(T [i, j :], R j ) (3) S σ i,j = Std(T [i, j :]) (4)

where Spearman is a function to calculate Spearman's rank correlation coefficient (Mukaka, 2012) and R j is the rank values of buckets based on j-th attribute. Std(•) is the function to compute standard deviation.

Intuitively, S ρ i,j reflects the degree to which the i-th model positively (or negatively) correlates with j-th attribute while S σ i,j indicates the degree to which this attribute influences the model.

3.3.2. ATTRIBUTE-WISE:

The attribute-wise analysis aims to quantify the degree to which each attribute influences the NER task. To achieve this, we introduce four measures: task-independent variable ζ j and task-dependent variables ρ 1 j ρ 2 j and σ j based on Eq.3 and Eq.4:

1) ζ j = 1 |N | |N | i

Atr(e i , j), where N is the number test entities and Atr(e i , j) represents the value of attribute j for entity e i .

For example, when j represents the attribute of sentence length, ζ j is the average sentence length of the whole dataset.

Under review as a conference paper at ICLR 2020

2) ρ 1 j = 1 |M | |M | i |S ρ i,j |, ρ 2 j = 1 |M | |M | i S ρ i,j , σ j = 1 |M | |M | i S σ i,j

, where |M | is the number of evaluated models. Compared with ρ 1 j , ρ 2 j can reflect whether the correlation is positive or negative. Intuitively, a higher absolute value of ρ 1 j or ρ 2 j suggests that attribute j is a crucial factor, greatly influencing the performance of NER systems.

3.3.3. BUCKET-WISE:

The bucket-wise analysis diagnoses the strengths and weaknesses of existing models. Moreover, based on attribute-wise analysis, we could understand how different choices of datasets influence the models' performance.

To this end, we introduce the following measures:

EQUATION

Usually where a, b represent two different models and usually model a has a higher performance (by dataset-level metric).

Intuitively, a negative value of β j suggests that a worse-ranked model (b) outperform the best-ranked model (a) in some aspect (attribute j); By contrast, a positive value shows the largest margin on the attribute j.

4. EXPERIMENTAL SETTINGS:



4.1. MODELS AND ATTRIBUTES:

Model Settings To evaluate the importance of different components of the NER systems, we varied our models mainly in terms of three aspects: different choices of character-(ELMo (Peters et al., 2018) , Flair (Akbik et al., 2018; Akbik et al.) ), subword-(BERT (Peters et al., 2018; Devlin et al., 2018) ), word-(GloVe (Pennington et al., 2014) ), and sentence-level encoders (LSTM (Hochreiter & Schmidhuber, 1997) , CNN (Kalchbrenner et al., 2014) ) and decoders (MLP or CRF (Lample et al., 2016; Collobert et al., 2011) ). Detailed setting are shown in Tab.3. Totally, we study 12 NER models based on deep neural networks and one traditional method utilizing CRF Lafferty et al. (2001) . The hyper-parameter settings of our evaluated models are shown in appendix section. Overall F1 shows the performances of corresponding systems on different datasets. For the model name, "C" refers to "Character" and "W" refers to "Word". Intuitively, the models are named based on their constituents. For example, CnonWrandlstmCrf is a model without character feature. Its word embedding is randomly initialized, and sentence encoder, as well as the decoder, are LSTM and CRF, respectively.

Attributes In our evaluation methodology, entity attributes can be defined flexibly and attribute values can be continuous or discrete. In this paper, although we investigate 10 types of attributes (or their combinations) as listed in Tab.2, others can be easily introduced.

4.2. NER DATASETS FOR EVALUATION:

We conduct experiments on three benchmark datasets: the CoNLL2003 NER dataset, the WNUT16 dataset, and Ontonotes 5.0 dataset. The CoNLL2003 NER dataset (Sang & De Meulder, 2003) is based on Reuters data (Collobert et al., 2011) . WNUT16 dataset is provided by the second shared task at WNUT-2016. The Ontonotes 5.0 dataset (Weischedel et al., 2013) is collected from newsgroups, broadcast news (BN), broadcast conversation (BC) and weblogs (WB) and magazine genre (MZ).

5. ANALYSIS:



5.1. HOLISTIC ANALYSIS:

Before giving a fine-grained analysis, we present the results of different models on different datasets in the way that traditional multi-dataset evaluation does. As shown in Fig. 3 , we observe that there is no one-size-fits-all model, and the models with the best results on different datasets are different. Naturally, the following questions are raised: 1) What factors of the datasets can distinguish themselves and influence the NER task? 2) How do these factors influence the choices of models? 3) Does a worse-ranked model outperform the best-ranked model in some aspect and how the datasets influence the choices of models? The following analyses will be conducted around these questions. Attribute-wise measures enable us to characterize the dataset biases quantitatively. Here we utilize a radar chart in Fig. 4 to strikingly display the commonality and speciality between different datasets based on three measures ζ, ρ 1 , σ defined in Sec. 3.3.2. And we also illustrate measure ρ 2 in Fig. 3 . Detailed observations are listed as follows:

5.2. ATTRIBUTE-WISE ANALYSIS:

Category ambiguity and entity length have more consistent influence on NER performance. The common parts of the radar chart Fig. 4 (b-c ) illustrate that no matter which datasets are, the performance of NER task is highly correlated with these attributes: MF-tt (token-tag with MF-buck), MF-et (entity-tag with MF-buck), R-eLen (entity length with R-bucket). Fig. 3 shows the same result. This suggests that the prediction difficulty of named entity is commonly influenced by category ambiguity (MF-tt, MF-et), entity length (R-eLen).

Occurence and sentence length matters but are minor factors. The outliers in radar chart show the peculiarities of different datasets. Intutively, on attributes: R-sLen, F-token, R-oov, the extent to which different datasets are affected varies greatly. Typically, as observed from Fig. 4-(a) , a sorted sequence could be obtained according to the attribute F-tok: BN > MZ > WNUT > CoNLL > BC > WB. The reason why the Spearman correlations ρ 1 of BC and WB are smaller is that performance on test entities with higher-frequency tokens are lower than entities with lower-frequency tokens. This suggests that F-tok is not a decisive attribute and higher-frequency token can not guarantee a better performance since other crucial factors such as category ambiguity also matter.

Entity density is a swing factor and CoNLL dataset is an outlier. As shown in Fig. 3 , the measure ρ 2 enables us to know the correlation is positive or negative. We observe that most datasets except CoNLL 2003 have negative Spearman values ρ 2 on the attribute of R-eDen, which suggests that a sentence with more entities is relatively harder to process. We can explain the unusual behavior on CoNLL 2003 from its intrinsic value ζ of eDen, the largest one as shown in Fig. 4 (a). The dataset of CoNLL contains a lot of short sentences, such as "Chicago 8,674 484,018" and " SOFIA 1996-12-06". That's why it distinguishes itself from other datasets. 

5.3. MODEL-WISE ANALYSIS:

Based on two model-wise measures: S ρ i,j and S σ i,j defined in Eq.3 and Eq.4, we investigate how different attributes influence the performance of the models with different architectures and pretrained embeddings. Fig. 4 illustrates the case on CoNLL (other datasets are included in appendix), and we have observed that: 1) Char-unaware models are more sensitive to the degree of category ambiguity and occurrence of entities. We observe that "CnonWrandlstmCrf " is negatively related to MF-et, MF-tt, F-ent and F-tok with high values of ρ and σ, suggesting the importance of the character-level encoder, which plays a major role in generalization to rare entities and entities with multiple categories. More importantly, this observation still holds on other datasets. (See appendix)

2) Sentence length is a swing factor, whose contribution depends on what types of pre-trained embeddings are used. There is a strong negative correlation between models with contextindependent embeddings and the attribute R-sLen (sentence length). The relationship is reversed when contextualized embeddings are used. The reason we believe is that long sentences could provide sufficient context information for contextualized models. It is noticeable, however that flair-related models "CflairWnonelstmCrf " behave differently compared with other contextualized models, which we will explain later in Sec 5.4 (Flair performs worse than ELMo when dealing with long sentences due to its structural bias).

3) Character encoders favor the sentences with high entity-density. Only using character-level CNN is easy to overfit the feature of capital letters. As a result, more non-entities are mis-predicted as entities. Based on the understanding of the previous analysis (Sec. 5.2) of the entity density's influence on CoNLL, we could better explain why "CcnnWnonelstmCrf " achieves the highest value of ρ and σ in "R-eDen (entity density) attribute in Tab.4.

5.4. BUCKET-WISE ANALYSIS:

In this section, we choose several typical models (others are shown in the appendix) as analyzed cases, aiming to seek answers to the following questions: 1) What are the strengths and weakness of different architectural designs? In other words, does a worse-ranked model outperform the best-ranked model in some aspect? 2) How do the different choices of datasets influence model performance? Tab. 5 illustrates the bucket-wise measure β, which is computed based on any pair of models M1 and M2. Next, we list some of our observations. Others are illustrated in the appendix. CNN v.s. LSTM The sentence encoder of CNN is better at dealing with short sentences, which holds in all datasets we evaluated in this paper. Strikingly, CNN outperforms LSTM by a large margin (dataset-level F1) on MZ dataset while is significantly worse than LSTM on WB (refer to the appendix.). We attempt to explain these discrepancies based on above attribute-wise metric ζ in Fig. 4(a) : sentence length and entity density are two major factors for the choices of CNN and LSTM. CNN is better than LSTM when the dataset with higher value of ζ sLen and ζ eDen . By contrast, when a dataset with lower ζ eDen , LSTM is a priority (The ζ eDen of WB is the lowest). CRF v.s. MLP The benefits of using CRF on short sentences are very stable, and improvement can be seen in all datasets. Similarly, based on attribute-wise metric ζ in Fig. 4 , we find category ambiguity (MF-et, MF-tt) is a major factor for the choices of CRF and MLP: if a dataset with higher ζ M F -et , in which longer entities can benefit more from CRF-based models. In comparison, introducing CRF will lead to more errors on long entities once the dataset (i.e. BN, MZ) has a lower ζ M F -et . CcnnWrand v.s. CcnnWnone The question has been little studied whether we need an extra wordlevel method (i.e., word-level look-up table) to get word representations when we have already used CNN to obtain word representations. Here, we show that CcnnWrand is not always better than CcnnWnone and entity length matters for the choice. Specifically, CcnnWnone could achieve better performance on on the WNUT and MZ datasets. With the help of Fig. 4-(a) , we find the two datasets share a property of much higher value of ζ R-ele (entity length). Additionally, another commonality between the two datasets can be observed from Tab. 5: the gain of CcnnWnone mainly comes from the entities with the longer length. ELMo v.s GloVe ELMo consistently outperforms GloVe on all datasets using the holistic F1 score, but it is worse than GloVe when modeling short sentences. Another interesting finding is that for those sentences containing more OOV tokens, GloVe could achieve better performance on all datasets. These phenomena indicate the complementarity between ELMo and GloVe, and our further combination of these two embeddings (CelmWglovelstmCrf in Tab. 3) indeed works better. Flair v.s. ELMo While the current state-of-the-art NER model Flair has achieved the best performance in terms of dataset-level F1 score, a worse-ranked model (ELMo) could outperform it in some aspects. Typically, Flair performs worse when dealing with long sentences. The reason can be attributed to the its structure design, which adopts a LSTM-based encoder for character language modeling, suffering from long-term dependency problem (especially for character-level language model). A promising improvement is to use the Transformer-based architecture for character language model.

6. CONCLUSION:

To bridge the gap between the insufficient understanding of the nature of datasets and model designs, this paper proposes a generalized evaluation methodology to interpret model biases, dataset biases, Table 5 : Illustration of the bucket-wise measure β. Each histogram is obtained based on subtracting the performance of Model1 (M1) from Model2 (M2) on a bucket. For ease of presentation, we roughly classify some attribute values into three categories: small(S), middle(M) and large(L). For example, the first column of the top left histogram represents M2 outperforms M1 when the attribute R-eDen takes the small (S) values.

and their correlation, drawing on the complementary strengths of the fine-grained evaluation and multi-dataset evaluation. We choose the NER task as a test case, the observations based on the extensive experiments suggest directions for improvement and can drive the progress of this area. Table 12 : A supplement bucket-wise analysis results to Tab. 5. Each histogram is obtained based on subtracting the performance of Model1 (M1) from Model2 (M2) on a bucket. For ease of presentation, we roughly classify some attribute values into three categories: small(S), middle(M) and large(L). For example, the first column of the top left histogram represents M2 outperforms M1 when the attribute R-eDen takes the small (S) values. Table 13 : Illustration of the bucket-wise measure β on OntoNote-BN and OntoNote-WB. Each histogram is obtained based on subtracting the performance of Model1 (M1) from Model2 (M2) on a bucket. For ease of presentation, we roughly classify some attribute values into three categories: small(S), middle(M) and large(L).

:

√ √ √ 93.03 45.96 87.92 77.23 85.56 63.38

Figures and Tables:

Figure 1: Relation chart among attributes, models, and datasets. The attribute-aimed method could bridge the gap between the model biases and dataset biases.

Formally, we refer to M = m 1 , • • • , m |M | as a set of models and P = p 1 , • • • , p |P | as a set of attributes. As describe above, the test set E could be split into different buckets

Figure 3: Illustration of task-dependent measure ρ 2 .

Evaluation methodologies characterized by different properties.

Table content: <table/>

Confirmation bias: It represents a tendency to make tests consistent with the beforehand hypothesis. For example, Mudrakarta et al. (2018) assume that deep learning model are sensitive to question words in question answering tasks and verify it by carefully-designed adversarial examples, and Chen et al. (2016a) pre-defined six error to classify error cases.Supplementary exam: It is an additional exam (require extra test sets ) for more comprehensive observations. i.e. multi-dataset evaluation(Devlin et al., 2018) on GLUE. Recently, there is a trend going from traditional evaluation to diagnostic test, in which a supplementary test set is required. For example,Jia & Liang (2017) propose an adversarial test for reading comprehension task andNaik  et al. (

Table content: <table/>

Neural NER systems with different architectures and pre-trained knowledge studied in this paper.

Table content: <table/>

Model-wise measures S ρ i,j and S σ i,j on CoNNL-2003. Pink attributes are used to characterize category ambiguity of entities while blue attributes can measure the degree to which test entities have been seen in training set.

Table content: <table/>

Peer review (iclr2020):
The manuscript proposes an evaluation methodology to obtain deeper insights regarding the strength and weaknesses of different methods on different datasets. The method considers a set of methods addressing the task of Named Entity Recognition (NER) as case study. In addition, it proposes a set of attribute-based criteria, i.e. bucketization strategies, under which the dataset can be divided and analyzed in order to highlight different properties of the evaluated methods. As said earlier, the manuscript proposes an evaluation methodology to obtain deeper insights regarding the strength and weaknesses of different methods on different datasets. The characteristic of being able to provided deeper insights on strength/weaknesses and relevant factors on the inner-workings of a given method is something very desirable for every evaluation. As such, in my opinion, the *interpretable* tag associate to the proposed method is somewhat out of place. Having said that, I would recommend removing the *interpretable* tag and stress the contribution of this manuscript as an evaluation protocol. In Section 4.2, for the R-Bucket strategy it is stated as having the requirement of discrete and finite attributes. Based on the equations of the other two strategies (R-bucket and F-bucket), it seems that they also have the requirement of having discrete attributes. Is this indeed the case? if so, it should be explicitly indicated. Having said that, this raises another question: Is this protocol exclusive to tasks/problems with explicit discrete attributes? The goal of this manuscript is to propose a general evaluation protocol for NLP tasks. However, it seems to be somewhat tailored to the NER task. My question is: How well the proposed method generalizes to other NLP tasks without attributes? Similarly, how well the proposed bucketization strategies generalize beyond the NER task? Perhaps the generalization characteristics and limitations of the proposed evaluation methodology should be explicitly discussed in the manuscript. Last paragraph of Section 4.2 summarizes ideas that were just presented. It feels somewhat redundant. I suggest removing in in favor of extending the existing discussions and analysis. I may consider upgrading my initial rating based on on the feedback given to my questions/doubts.