| { |
| "paper_id": "P18-1020", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T08:41:19.355374Z" |
| }, |
| "title": "Efficient Online Scalar Annotation with Bounded Support", |
| "authors": [ |
| { |
| "first": "Keisuke", |
| "middle": [], |
| "last": "Sakaguchi", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Johns Hopkins University", |
| "location": {} |
| }, |
| "email": "keisuke@cs.jhu.edu" |
| }, |
| { |
| "first": "Benjamin", |
| "middle": [], |
| "last": "Van Durme", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Johns Hopkins University", |
| "location": {} |
| }, |
| "email": "vandurme@cs.jhu.edu" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "We describe a novel method for efficiently eliciting scalar annotations for dataset construction and system quality estimation by human judgments. We contrast direct assessment (annotators assign scores to items directly), online pairwise ranking aggregation (scores derive from annotator comparison of items), and a hybrid approach (EASL: Efficient Annotation of Scalar Labels) proposed here. Our proposal leads to increased correlation with ground truth, at far greater annotator efficiency, suggesting this strategy as an improved mechanism for dataset creation and manual system evaluation.", |
| "pdf_parse": { |
| "paper_id": "P18-1020", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "We describe a novel method for efficiently eliciting scalar annotations for dataset construction and system quality estimation by human judgments. We contrast direct assessment (annotators assign scores to items directly), online pairwise ranking aggregation (scores derive from annotator comparison of items), and a hybrid approach (EASL: Efficient Annotation of Scalar Labels) proposed here. Our proposal leads to increased correlation with ground truth, at far greater annotator efficiency, suggesting this strategy as an improved mechanism for dataset creation and manual system evaluation.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "We are concerned here with the construction of datasets and evaluation of systems within natural language processing (NLP). Specifically, humans providing responses that are used to derive graded values on natural language contexts, or in the ordering of systems corresponding to their perceived performance on some task.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Many NLP datasets involve eliciting from annotators some graded response. The most popular annotation scheme is the n-ary ordinal approach as illustrated in Figure 1(a) . For example, text may be labeled for sentiment as positive, neutral or negative (Wiebe et al., 1999; Pang et al., 2002; Turney, 2002, inter alia) ; or under political spectrum analysis as liberal, neutral, or conservative (O'Connor et al., 2010; Bamman and Smith, 2015) . A response may correspond to a likelihood judgment, e.g., how likely a predicate is factive (Lee et al., 2015) , or that some natural language inference may hold (Zhang et al., 2017) . Responses may correspond to a notion of semantic Online Pairwise Comparison very rare very frequent \"dog\" < l a t e x i t s h a 1 _ b a s e 6 4 = \" N x 3 b k n X j 7 z n j 2 B 7 V 4 n f p F X h D l A s = \" > A A A C c X i c d V H b S g M x E M 2 u t 1 p v q + K L g g a L K F j K r n j r W 9 E X H y t Y F d q l Z t O 0 D c 1 e S G b F s u w H + H u + + R W + + A G m l x V t d S B w 5 s y Z k 8 n E i w R X Y N v v h j k z O z e / k F v M L y 2 v r K 5 Z 6 x v 3 K o w l Z T U a i l A + e k Q x w Q N W A w 6 C P U a S E d 8 T 7 M H r X Q / q D 8 9 M K h 4 G d 9 C P m O u T T s D b n B L Q V N N 6 b Q B 7 g S R p D K 3 q s u O 5 i V 2 y h 1 G c A u n T U / q f 9 M x 2 y u d O 0 c m k r b D z r 3 b S 9 v A w T Z t W I c t x 5 o Y z t 2 9 Q Q O O o N q 2 3 R i u k s c 8 C o I I o V X f s C N y E S O B U s D T f i B W L C O 2 R D q t r G B C f K T c Z D p T i A 8 2 0 c D u U + g S A h + z P j o T 4 S v V 9 T y t 9 A l 0 1 W R u Q f 9 X q M b Q v 3 Y Q H U Q w s o K O L 2 r H A E O L B / n G L S 0 Z B 9 D U g V H I 9 K 6 Z d I g k F / U t 5 v Y S p J 0 + D 2 k m p X L J v T w u V q / E 2 c m g H 7 a M j 5 K A L V E E 3 q I p q i K I P Y 8 v Y N f a M T 3 P b x O b + S G o a 4 5 5 N 9 C v M 4 y 8 0 t 7 H + < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" N x 3 b k n X j 7 z n j 2 B 7 V 4 n f p F X h D l A s = \" > A A A C c X i c d V H b S g M x E M 2 u t 1 p v q + K L g g a L K F j K r n j r W 9 E X H y t Y F d q l Z t O 0 D c 1 e S G b F s u w H + H u + + R W + + A G m l x V t d S B w 5 s y Z k 8 n E i w R X Y N v v h j k z O z e / k F v M L y 2 v r K 5 Z 6 x v 3 K o w l Z T U a i l A + e k Q x w Q N W A w 6 C P U a S E d 8 T 7 M H r X Q / q D 8 9 M K h 4 G d 9 C P m O u T T s D b n B L Q V N N 6 b Q B 7 g S R p D K 3 q s u O 5 i V 2 y h 1 G c A u n T U / q f 9 M x 2 y u d O 0 c m k r b D z r 3 b S 9 v A w T Z t W I c t x 5 o Y z t 2 9 Q Q O O o N q 2 3 R i u k s c 8 C o I I o V X f s C N y E S O B U s D T f i B W L C O 2 R D q t r G B C f K T c Z D p T i A 8 2 0 c D u U + g S A h + z P j o T 4 S v V 9 T y t 9 A l 0 1 W R u Q f 9 X q M b Q v 3 Y Q H U Q w s o K O L 2 r H A E O L B / n G L S 0 Z B 9 D U g V H I 9 K 6 Z d I g k F / U t 5 v Y S p J 0 + D 2 k m p X L J v T w u V q / E 2 c m g H 7 a M j 5 K A L V E E 3 q I p q i K I P Y 8 v Y N f a M T 3 P b x O b + S G o a 4 5 5 N 9 C v M 4 y 8 0 t 7 H + < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" N x 3 b k n X j 7 z n j 2 B 7 V 4 n f p F X h D l A s = \" > A A A C c X i c d V H b S g M x E M 2 u t 1 p v q + K L g g a L K F j K r n j r W 9 E X H y t Y F d q l Z t O 0 D c 1 e S G b F s u w H + H u + + R W + + A G m l x V t d S B w 5 s y Z k 8 n E i w R X Y N v v h j k z O z e / k F v M L y 2 v r K 5 Z 6 x v 3 K o w l Z T U a i l A + e k Q x w Q N W A w 6 C P U a S E d 8 T 7 M H r X Q / q D 8 9 M K h 4 G d 9 C P m O u T T s D b n B L Q V N N 6 b Q B 7 g S R p D K 3 q s u O 5 i V 2 y h 1 G c A u n T U / q f 9 M x 2 y u d O 0 c m k r b D z r 3 b S 9 v A w T Z t W I c t x 5 o Y z t 2 9 Q Q O O o N q 2 3 R i u k s c 8 C o I I o V X f s C N y E S O B U s D T f i B W L C O 2 R D q t r G B C f K T c Z D p T i A 8 2 0 c D u U + g S A h + z P j o T 4 S v V 9 T y t 9 A l 0 1 W R u Q f 9 X q M b Q v 3 Y Q H U Q w s o K O L 2 r H A E O L B / n G L S 0 Z B 9 D U g V H I 9 K 6 Z d I g k F / U t 5 v Y S p J 0 + D 2 k m p X L J v T w u V q / E 2 c m g H 7 a M j 5 K A L V E E 3 q I p q i K I P Y 8 v Y N f a M T 3 P b x O b + S G o a 4 5 5 N 9 C v M 4 y 8 0 t 7 H + < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" C 3 9 O h B + I c z R c j L N I N X H 2 9 e 9 l t 8 M = \" > A A A B 2 H i c b Z D N S g M x F I X v 1 L 8 6 V q 1 r N 8 E i u C p T N + p O c O O y g m M L 7 V A y m T t t a C Y z J H e E M v Q F X L h R f D B 3 v o 3 p z 0 K t B w I f 5 y T k 3 h M X S l o K g i + v t r W 9 s 7 t X 3 / c P G v 7 h 0 X G z 8 W T z 0 g g M R a 5 y 0 4 + 5 R S U 1 h i R J Y b 8 w y L N Y Y S + e 3 i 3 y 3 j M a K 3 P 9 S L M C o 4 y P t U y l 4 O S s 7 q j Z C t r B U m w T O m t o w V q j 5 u c w y U W Z o S a h u L W D T l B Q V H F D U i i c + 8 P S Y s H F l I 9 x 4 F D z D G 1 U L c e c s 3 P n J C z N j T u a 2 N L 9 + a L i m b W z L H Y 3 M 0 4 T + z d b m P 9 l g 5 L S 6 6 i S u i g J t V h 9 l J a K U c 4 W O 7 N E G h S k Z g 6 4 M N L N y s S E G y 7 I N e O 7 D j p / N 9 6 E 8 L J 9 0 w 4 e A q j D K Z z B B X T g C m 7 h H r o Q g o A E X u D N m 3 i v 3 v u q q p q 3 7 u w E f s n 7 + A a p 5 I o 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 = \" 6 9 v O B m 8 D W j W W G 8 / c 5 3 x O X J R C W f g = \" > A A A C Z n i c d V H L S g M x F M 2 M r 1 q r V s G N g o Y W q Q s p M 4 K P 7 g Q 3 L i s 4 t j A d 2 k y a t q G Z B 8 k d s Q z z A f 6 e O 7 / C j R 9 g + g J t 7 Y X A y b k n J z c n f i y 4 A s v 6 N M y 1 9 Y 3 N r d x 2 f q e w u 7 d f P C i 8 q C i R l D k 0 E p F s + k Q x w U P m A A f B m r F k J P A F a / j D h 3 G / 8 c q k 4 l H 4 D K O Y e Q H p h 7 z H K Q F N t Y v v L W B v k K a t i Z U r + 7 6 X W l V r U p d L I O t 0 s l X S a 8 u u 3 d i X 9 l z a j f o r t Y u 2 l U q W t Y v l + R 4 v g 7 l t G c 2 q 3 i 5 + t L o R T Q I W A h V E K d e 2 Y v B S I o F T w b J 8 K 1 E s J n R I + s z V M C Q B U 1 4 6 G S j D 5 5 r p 4 l 4 k 9 Q o B T 9 j f J 1 I S K D U K f K 0 M C A z U Y m 9 M / t d z E + j d e S k P 4 w R Y S K c X 9 R K B I c L j / H G X S 0 Z B j D Q g V H I 9 K 6 Y D I g k F / U t 5 H Y K 9 + O R l 4 F x V a 1 X r y U I 5 d I J K 6 A L Z 6 B b d o 0 d U R w 6 i 6 M s 4 M k 6 N M + P b P D b x N C 3 T m M V 2 i P 6 U W f o B X 6 S x C g = = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" R X 5 e S g W I z g n S v 7 H 1 r 5 G j f s u x n L c = \" > A A A C Z n i c d V H L S g M x F M 2 M r 1 q r j o I b B Q 0 t U h e l z A g + u h P c u K x g b a E d 2 k y a t q G Z B 8 k d s Q z z A f 6 e O 7 / C j R 9 g + h J t 7 Y X A y b k n J z c n X i S 4 A t v + M M y 1 9 Y 3 N r c x 2 d i e 3 u 7 d v H e S e V R h L y m o 0 F K F s e E Q x w Q N W A w 6 C N S L J i O 8 J V v e G 9 + N + / Y V J x c P g C U Y R c 3 3 S D 3 i P U w K a a l t v L W C v k C S t i V V T 9 j 0 3 s c v 2 p E p L I O 1 0 0 l X S K 9 u p X D s l Z y 7 t h", |
| "cite_spans": [ |
| { |
| "start": 251, |
| "end": 271, |
| "text": "(Wiebe et al., 1999;", |
| "ref_id": "BIBREF35" |
| }, |
| { |
| "start": 272, |
| "end": 290, |
| "text": "Pang et al., 2002;", |
| "ref_id": "BIBREF23" |
| }, |
| { |
| "start": 291, |
| "end": 316, |
| "text": "Turney, 2002, inter alia)", |
| "ref_id": null |
| }, |
| { |
| "start": 393, |
| "end": 416, |
| "text": "(O'Connor et al., 2010;", |
| "ref_id": "BIBREF22" |
| }, |
| { |
| "start": 417, |
| "end": 440, |
| "text": "Bamman and Smith, 2015)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 535, |
| "end": 553, |
| "text": "(Lee et al., 2015)", |
| "ref_id": "BIBREF17" |
| }, |
| { |
| "start": 605, |
| "end": 625, |
| "text": "(Zhang et al., 2017)", |
| "ref_id": "BIBREF36" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 157, |
| "end": 168, |
| "text": "Figure 1(a)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "v 2 V 2 k X b Y j F N 2 1 Z h v s d z N z x 3 + w E F N K t q 2 3 p v d U M a + y w A K o h S T c e O w E 2 I B E 4 F S 7 O t W L G I 0 C H p s 6 a G A f G Z c p P J Q C k + 1 0 w X 9 0 K p V w B 4 w v 4 + k R B f q Z H v a a V P Y K A W e 2 P y v 1 4 z h t 6 t m / A g i o E F d H p R L x Y Y Q j z O H 3 e 5 Z B T E S A N C J d e z Y j o g k l D Q v 5 T V I S w 9 e R n U L s u V s v 1 o o w w 6 Q X l 0 g R x 0 g + 7 Q A 6 q i G q L o 0 z g y T o 0 z 4 8 s 8 N v E 0 L d O Y", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "x X a I / p S Z / w Z / 0 r E h < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" S / Z 6 M Z q 2 G g n 5 h i 3 P z L B O B A J e + Q 8 = \" > A A A C c", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "X i c d V H b S g M x E M 2 u t 1 p v V f F F Q U O L K F j K r u C l b 0 V f f K x g b a F d 2 m y a t q H Z C 8 m s W J b 9 A H / P N 7 / C F z / A 9 C b a 2 o H A m T N n T i Y T N x R c g W V 9 G O b S 8 s r q W m o 9 v b G 5 t b 2 T 2 d 1 7 V k E k K a v Q Q A S y 5 h L F B P d Z B T g I V g s l I 5 4 r W N X t 3 w / r 1 R c m F Q / 8 J x i E z P F I 1 + c d T g l o q p l 5 a w B 7 h T h u j K z q s u s 6 s V W w R p G f A 0 m r l S y S X l l 2 8 d r O 2 1 N p O + g u 1 M 7 a n p 0 l S T O T m + Z 4 6 o a n b j 8 g h y Z R b m b e G + 2 A R h 7 z g Q q i V N 2 2 Q n B i I o F T w Z J 0 I 1 I s J L R P u q y u o U 8 8 p p x 4 N F C C T z X T x p 1 A 6 u M D H r G / O 2 L i K T X w X K 3 0 C P T U b G 1 I / l e r R 9 C 5 d W L u h x E w n 4 4 v 6 k Q C Q 4 C H + 8 d t L h k F M d C A U M n 1 r J j 2 i C Q U 9 C + l 9 R L m n j w P K p e F Y s F 6 t H K l u 8 k 2 U u g I Z d E 5 s t E N K q E H V E Y V R N G n c W A c G y f G l 3 l o Y j M 7 l p r G p G c f / Q n", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "z 4 h s z d 7 H 6 < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" N x 3 b k n X j 7 z n j 2 B 7", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "V 4 n f p F X h D l A s = \" > A A A C c X i c d V H b S g M x E M 2 u t 1 p v q + K L g g a L K F j K r n j r W 9 E X H y t Y F d q l Z t O 0 D c 1 e S G b F s u w H + H u + + R W + + A G m l x V t d S B w 5 s y Z k 8 n E i w R X Y N v v h j k z O z e / k F v M L y 2 v r K 5 Z 6 x v 3 K o w l Z T U a i l A + e k Q x w Q N W A w 6 C P U a S E d 8 T 7 M H r X Q / q D 8 9 M K h 4 G d 9 C P m O u T T s D b n B L Q V N N 6 b Q B 7 g S R p D K 3 q s u O 5 i V 2 y h 1 G c A u n T U / q f 9 M x 2 y u d O 0 c m k r b D z r 3 b S 9 v A w T Z t W I c t x 5 o Y z t 2 9 Q Q O O o N q 2 3 R i u k s c 8 C o I I o V X f s C N y E S O B U s D T f i B W L C O 2 R D q t r G B C f K T c Z D p T i A 8 2 0 c D u U + g S A h + z P j o T 4 S v V 9 T y t 9 A l 0 1 W R u Q f 9 X q M b Q v 3 Y Q H U Q w s o K O L 2 r H A E O L B / n G L S 0 Z B 9 D U g V H I 9 K 6 Z d I g k F / U t 5 v Y S p J 0 + D 2 k m p X L J v T w u V q / E 2 c m g H 7 a M j 5 K A L V E E 3 q I p q i K I P Y 8 v Y N f a M T 3 P b x O b + S G o a 4 5 5 N 9 C v", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "M 4 y 8 0 t 7 H + < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" N x 3 b k n X j 7 z n j 2 B 7", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "V 4 n f p F X h D l A s = \" > A A A C c X i c d V H b S g M x E M 2 u t 1 p v q + K L g g a L K F j K r n j r W 9 E X H y t Y F d q l Z t O 0 D c 1 e S G b F s u w H + H u + + R W + + A G m l x V t d S B w 5 s y Z k 8 n E i w R X Y N v v h j k z O z e / k F v M L y 2 v r K 5 Z 6 x v 3 K o w l Z T U a i l A + e k Q x w Q N W A w 6 C P U a S E d 8 T 7 M H r X Q / q D 8 9 M K h 4 G d 9 C P m O u T T s D b n B L Q V N N 6 b Q B 7 g S R p D K 3 q s u O 5 i V 2 y h 1 G c A u n T U / q f 9 M x 2 y u d O 0 c m k r b D z r 3 b S 9 v A w T Z t W I c t x 5 o Y z t 2 9 Q Q O O o N q 2 3 R i u k s c 8 C o I I o V X f s C N y E S O B U s D T f i B W L C O 2 R D q t r G B C f K T c Z D p T i A 8 2 0 c D u U + g S A h + z P j o T 4 S v V 9 T y t 9 A l 0 1 W R u Q f 9 X q M b Q v 3 Y Q H U Q w s o K O L 2 r H A E O L B / n G L S 0 Z B 9 D U g V H I 9 K 6 Z d I g k F / U t 5 v Y S p J 0 + D 2 k m p X L J v T w u V q / E 2 c m g H 7 a M j 5 K A L V E E 3 q I p q i K I P Y 8 v Y N f a M T 3 P b x O b + S G o a 4 5 5 N 9 C v", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "M 4 y 8 0 t 7 H + < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" N x 3 b k n X j 7 z n j 2 B 7", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "V 4 n f p F X h D l A s = \" > A A A C c X i c d V H b S g M x E M 2 u t 1 p v q + K L g g a L K F j K r n j r W 9 E X H y t Y F d q l Z t O 0 D c 1 e S G b F s u w H + H u + + R W + + A G m l x V t d S B w 5 s y Z k 8 n E i w R X Y N v v h j k z O z e / k F v M L y 2 v r K 5 Z 6 x v 3 K o w l Z T U a i l A + e k Q x w Q N W A w 6 C P U a S E d 8 T 7 M H r X Q / q D 8 9 M K h 4 G d 9 C P m O u T T s D b n B L Q V N N 6 b Q B 7 g S R p D K 3 q s u O 5 i V 2 y h 1 G c A u n T U / q f 9 M x 2 y u d O 0 c m k r b D z r 3 b S 9 v A w T Z t W I c t x 5 o Y z t 2 9 Q Q O O o N q 2 3 R i u k s c 8 C o I I o V X f s C N y E S O B U s D T f i B W L C O 2 R D q t r G B C f K T c Z D p T i A 8 2 0 c D u U + g S A h + z P j o T 4 S v V 9 T y t 9 A l 0 1 W R u Q f 9 X q M b Q v 3 Y Q H U Q w s o K O L 2 r H A E O L B / n G L S 0 Z B 9 D U g V H I 9 K 6 Z d I g k F / U t 5 v Y S p J 0 + D 2 k m p X L J v T w u V q / E 2 c m g H 7 a M j 5 K A L V E E 3 q I p q i K I P Y 8 v Y N f a M T 3 P b x O b + S G o a 4 5 5 N 9 C v", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "M 4 y 8 0 t 7 H + < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" N x 3 b k n X j 7 z n j 2 B 7", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "V 4 n f p F X h D l A s = \" > A A A C c X i c d V H b S g M x E M 2 u t 1 p v q + K L g g a L K F j K r n j r W 9 E X H y t Y F d q l Z t O 0 D c 1 e S G b F s u w H + H u + + R W + + A G m l x V t d S B w 5 s y Z k 8 n E i w R X Y N v v h j k z O z e / k F v M L y 2 v r K 5 Z 6 x v 3 K o w l Z T U a i l A + e k Q x w Q N W A w 6 C P U a S E d 8 T 7 M H r X Q / q D 8 9 M K h 4 G d 9 C P m O u T T s D b n B L Q V N N 6 b Q B 7 g S R p D K 3 q s u O 5 i V 2 y h 1 G c A u n T U / q f 9 M x 2 y u d O 0 c m k r b D z r 3 b S 9 v A w T Z t W I c t x 5 o Y z t 2 9 Q Q O O o N q 2 3 R i u k s c 8 C o I I o V X f s C N y E S O B U s D T f i B W L C O 2 R D q t r G B C f K T c Z D p T i A 8 2 0 c D u U + g S A h + z P j o T 4 S v V 9 T y t 9 A l 0 1 W R u Q f 9 X q M b Q v 3 Y Q H U Q w s o K O L 2 r H A E O L B / n G L S 0 Z B 9 D U g V H I 9 K 6 Z d I g k F / U t 5 v Y S p J 0 + D 2 k m p X L J v T w u V q / E 2 c m g H 7 a M j 5 K A L V E E 3 q I p q i K I P Y 8 v Y N f a M T 3 P b x O b + S G o a 4 5 5 N 9 C v", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "M 4 y 8 0 t 7 H + < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" N x 3 b k n X j 7 z n j 2 B 7", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "V 4 n f p F X h D l A s = \" > A A A C c X i c d V H b S g M x E M 2 u t 1 p v q + K L g g a L K F j K r n j r W 9 E X H y t Y F d q l Z t O 0 D c 1 e S G b F s u w H + H u + + R W + + A G m l x V t d S B w 5 s y Z k 8 n E i w R X Y N v v h j k z O z e / k F v M L y 2 v r K 5 Z 6 x v 3 K o w l Z T U a i l A + e k Q x w Q N W A w 6 C P U a S E d 8 T 7 M H r X Q / q D 8 9 M K h 4 G d 9 C P m O u T T s D b n B L Q V N N 6 b Q B 7 g S R p D K 3 q s u O 5 i V 2 y h 1 G c A u n T U / q f 9 M x 2 y u d O 0 c m k r b D z r 3 b S 9 v A w T Z t W I c t x 5 o Y z t 2 9 Q Q O O o N q 2 3 R i u k s c 8 C o I I o V X f s C N y E S O B U s D T f i B W L C O 2 R D q t r G B C f K T c Z D p T i A 8 2 0 c D u U + g S A h + z P j o T 4 S v V 9 T y t 9 A l 0 1 W R u Q f 9 X q M b Q v 3 Y Q H U Q w s o K O L 2 r H A E O L B / n G L S 0 Z B 9 D U g V H I 9 K 6 Z d I g k F / U t 5 v Y S p J 0 + D 2 k m p X L J v T w u V q / E 2 c m g H 7 a M j 5 K A L V E E 3 q I p q i K I P Y 8 v Y N f a M T 3 P b x O b + S G o a 4 5 5 N 9 C v M 4 y 8 0 t 7 H + < / l a t e x i t > 1 < l a t e x i t s h a 1 _ b a s e 6 4 = \" W 3 F O c t K G h z o m 8 K q P h z e f c K q e i n g = \" > A A A B 7 X i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B i y U R Q b 0 V v X i s Y G y h D W W z 3 b R L N 5 u w O x F K 6 I / w 4 k H F q / / H m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 M J X C o O t + O 6 W V 1 b X 1 j f J m Z W t 7 Z 3 e v u n / w a J J M M + 6 z R C a 6 H V L D p V D c R 4 G S t 1 P N a R x K 3 g p H t 1 O / 9 c S 1 E Y l 6 w H H K g 5 g O l I g E o 2 i l 1 l l X q A j H v W r N r b s z k G X i F a Q G B Z q 9 6 l e 3 n 7 A s 5 g q Z p M Z 0 P D f F I K c a B Z N 8 U u l m h q e U j e i A d y x V N O Y m y G f n T s i J V f o k S r Q t h W S m / p 7 I a W z M O A 5 t Z 0 x x a B a 9 q f i f 1 8 k w u g p y o d I M u W L z R V E m C S Z k + j v p C 8 0 Z y r E l l G l h b y V s S D V l a B O q 2 B C 8 x Z e X i X 9 e v 6 6 7 9 x e 1 x k 2 R R h m O 4 B h O w Y N L a M A d N M E H B i N 4 h l d 4 c 1 L n x X l 3 P u a t J a e Y O Y Q / c D 5 / A J g y j 0 Y = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" W 3 F O c t K G h z o m 8 K q P h z e f c K q e i n g = \" > A A A B 7 X i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B i y U R Q b 0 V v X i s Y G y h D W W z 3 b R L N 5 u w O x F K 6 I / w 4 k H F q / / H m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 M J X C o O t + O 6 W V 1 b X 1 j f J m Z W t 7 Z 3 e v u n / w a J J M M + 6 z R C a 6 H V L D p V D c R 4 G S t 1 P N a R x K 3 g p H t 1 O / 9 c S 1 E Y l 6 w H H K g 5 g O l I g E o 2 i l 1 l l X q A j H v W r N r b s z k G X i F a Q G B Z q 9 6 l e 3 n 7 A s 5 g q Z p M Z 0 P D f F I K c a B Z N 8 U u l m h q e U j e i A d y x V N O Y m y G f n T s i J V f o k S r Q t h W S m / p 7 I a W z M O A 5 t Z 0 x x a B a 9 q f i f 1 8 k w u g p y o d I M u W L z R V E m C S Z k + j v p C 8 0 Z y r E l l G l h b y V s S D V l a B O q 2 B C 8 x Z e X i X 9 e v 6 6 7 9 x e 1 x k 2 R R h m O 4 B h O w Y N L a M A d N M E H B i N 4 h l d 4 c 1 L n x X l 3 P u a t J a e Y O Y Q / c D 5 / A J g y j 0 Y = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" W 3 F O c t K G h z o m 8 K q P h z e f c K q e i n g = \" > A A A B 7 X i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B i y U R Q b 0 V v X i s Y G y h D W W z 3 b R L N 5 u w O x F K 6 I / w 4 k H F q / / H m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 M J X C o O t + O 6 W V 1 b X 1 j f J m Z W t 7 Z 3 e v u n / w a J J M M + 6 z R C a 6 H V L D p V D c R 4 G S t 1 P N a R x K 3 g p H t 1 O / 9 c S 1 E Y l 6 w H H K g 5 g O l I g E o 2 i l 1 l l X q A j H v W r N r b s z k G X i F a Q G B Z q 9 6 l e 3 n 7 A s 5 g q Z p M Z 0 P D f F I K c a B Z N 8 U u l m h q e U j e i A d y x V N O Y m y G f n T s i J V f o k S r Q t h W S m / p 7 I a W z M O A 5 t Z 0 x x a B a 9 q f i f 1 8 k w u g p y o d I M u W L z R V E m C S Z k + j v p C 8 0 Z y r E l l G l h b y V s S D V l a B O q 2 B C 8 x Z e X i X 9 e v 6 6 7 9 x e 1 x k 2 R R h m O 4 B h O w Y N L a M A d N M E H B i N 4 h l d 4 c 1 L n x X l 3 P u a t J a e Y O Y Q / c D 5 / A J g y j 0 Y = < / l a t e x i t > 1 < l a t e x i t s h a 1 _ b a s e 6 4 = \" L z z E Z 9 j o w v L S L 2 V W r V w N n o L Z 6 4 8 = \" > A A A B 7 H i c b V B N S 8 N A E J 3 4 W e t X 1 a O X Y B E 8 l U Q E 9 V b 0 4 r G C a Q t t K J v t p l 2 7 2 Q 2 7 E 6 G E / g c v H l S 8 + o O 8 + W / c t j l o 6 4 O B x 3 s z z M y L U s E N e t 6 3 s 7 K 6 t r 6 x W d o q b + / s 7 u 1 X D g 6 b R m W a s o A q o X Q 7 I o Y J L l m A H A V r p 5 q R J B K s F Y 1 u p 3 7 r i W n D l X z A c c r C h A w k j z k l a K V m l 8 s Y x 7 1 K 1 a t 5 M 7 j L x C 9 I F Q o 0 e p W v b l / R L G E S q S D G d H w v x T A n G j k V b F L u Z o a l h I 7 I g H U s l S R h J s x n 1 0 7 c U 6 v 0 3 V h p W x L d m f p 7 I i e J M e M k s p 0 J w a F Z 9 K b i f 1 4 n w / g q z L l M M 2 S S z h f F m X B R u d P X 3 T 7 X j K I Y W 0 K o 5 v Z W l w 6 J J h R t Q G U b g r / 4 8 j I J z m v X N e / + o l q / K d I o w T G c w B n 4 c A l 1 u I M G B E D h E Z 7 h F d 4 c 5 b w 4 7 8 7 H v H X F K W a O 4 A + c z x 8 u M I 8 P < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" L z z E Z 9 j o w v L S L 2 V W r V w N n o L Z 6 4 8 = \" > A A A B 7 H i c b V B N S 8 N A E J 3 4 W e t X 1 a O X Y B E 8 l U Q E 9 V b 0 4 r G C a Q t t K J v t p l 2 7 2 Q 2 7 E 6 G E / g c v H l S 8 + o O 8 + W / c t j l o 6 4 O B x 3 s z z M y L U s E N e t 6 3 s 7 K 6 t r 6 x W d o q b + / s 7 u 1 X D g 6 b R m W a s o A q o X Q 7 I o Y J L l m A H A V r p 5 q R J B K s F Y 1 u p 3 7 r i W n D l X z A c c r C h A w k j z k l a K V m l 8 s Y x 7 1 K 1 a t 5 M 7 j L x C 9 I F Q o 0 e p W v b l / R L G E S q S D G d H w v x T A n G j k V b F L u Z o a l h I 7 I g H U s l S R h J s x n 1 0 7 c U 6 v 0 3 V h p W x L d m f p 7 I i e J M e M k s p 0 J w a F Z 9 K b i f 1 4 n w / g q z L l M M 2 S S z h f F m X B R u d P X 3 T 7 X j K I Y W 0 K o 5 v Z W l w 6 J J h R t Q G U b g r / 4 8 j I J z m v X N e / + o l q / K d I o w T G c w B n 4 c A l 1 u I M G B E D h E Z 7 h F d 4 c 5 b w 4 7 8 7 H v H X F K W a O 4 A + c z x 8 u M I 8 P < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" L z z E Z 9 j o w v L S L 2 V W r V w N n o L Z 6 4 8 = \" > A A A B 7 H i c b V B N S 8 N A E J 3 4 W e t X 1 a O X Y B E 8 l U Q E 9 V b 0 4 r G C a Q t t K J v t p l 2 7 2 Q 2 7 E 6 G E / g c v H l S 8 + o O 8 + W / c t j l o 6 4 O B x 3 s z z M y L U s E N e t 6 3 s 7 K 6 t r 6 x W d o q b + / s 7 u 1 X D g 6 b R m W a s o A q o X Q 7 I o Y J L l m A H A V r p 5 q R J B K s F Y 1 u p 3 7 r i W n D l X z A c c r C h A w k j z k l a K V m l 8 s Y x 7 1 K 1 a t 5 M 7 j L x C 9 I F Q o 0 e p W v b l / R L G E S q S D G d H w v x T A n G j k V b F L u Z o a l h I 7 I g H U s l S R h J s x n 1 0 7 c U 6 v 0 3 V h p W x L d m f p 7 I i e J M e M k s p 0 J w a F Z 9 K b i f 1 4 n w / g q z L l M M 2 S S z h f F m X B R u d P X 3 T 7 X j K I Y W 0 K o 5 v Z W l w 6 J J h R t Q G U b g r / 4 8 j I J z m v X N e / + o l q / K d I o w T G c w B n 4 c A l 1 u I M G B E D h E Z 7 h F d 4 c 5 b w 4 7 8 7 H v H X F K W a O 4 A + c z x 8 u M I 8 P < / l a t e x i t > \"burrito\" \"dog\"", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "< l a t e x i t s h a 1 _ b a s e 6 4 = \" i w 3 k 6 B T F N k i P g E A 5 t k Y x e 6 F 9 k i 8", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "= \" > A A A D B 3 i c p V L L S g M x F M 2 M 7 / q q u h Q k W E Q X U m b E V 3 d F N y 4 V r A q d o W b S t I Z m J k N y R y z D L N 3 4 K 2 5 c q L j 1 F 9 z 5 N 6 a 1 B b U K i h c C J + e e e 3 N y k y A W X I P j v F r 2 0 P D I 6 N j 4 R G 5 y a n p m N j 8 3 f 6 J l o i i r U C m k O g u I Z o J H r A I c B D u L F S N h I N h p 0 N r v 5 E 8 v m d J c R s f Q j p k f k m b E G 5 w S M F R t z l r y g F 1 B m n r d X l X V D P z U K T r d W B 8 A 2 f l 5 9 k n q / i z F Q a I U B 5 n 9 t v f q a p Z h z 9 i n + H + m P i i 2 H L e 0 7 a 7 3 b W Z 1 2 f y T n 1 q + 0 N / j Q d B v W 0 C 9 O K z l X 7 y 6 p E n I I q C C a F 1 1 n R j 8 l C j g V L A s 5 y W a x Y S 2 S J N V D Y x I y L S f d g 1 l e M U w d d y Q y q w I c J f 9 W J G S U O t 2 G B h l S O B C f 8 1 1 y O 9 y 1 Q Q a u 3 7 K o z g B F t H 3 g x q J w C B x 5 1 f g O j d T B 9 E 2 g F D z a J x i e k E U o W D + T s 4 M w f 1 6 5 U F Q 2 S i W i s 7 R Z q G 8 1 5 v G O F p E y 2 g N u W g H l d E B O k Q V R K 1 r 6 9 a 6 t x 7 s G / v O f r S f 3 q W 2 1 a t Z Q J / C f n 4 D C i X f 6 w = = < /", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" i w 3 k 6 B T F N k i P g E A 5 t k Y x e 6 F 9 k i 8 Figure 1 : Elicitation strategies for graded response include direct assessment via ordinal or scalar judgments, and pairwise comparisons aggregated via an assumption of latent distributions such as Gaussians, or novel here: Beta distributions, providing bounded support. The example concerns subjective assessments of the lexical frequency of dog. In pairwise comparison, we assess it by comparison such as \"burrito\" is less frequent (\u227a) than \"dog\". similarity, e.g., whether one word can be substituted for another in context (Pavlick et al., 2015) , or whether an entire sentence is more or less similar than another (Marelli et al., 2014) , and so on.", |
| "cite_spans": [ |
| { |
| "start": 640, |
| "end": 662, |
| "text": "(Pavlick et al., 2015)", |
| "ref_id": "BIBREF24" |
| }, |
| { |
| "start": 732, |
| "end": 754, |
| "text": "(Marelli et al., 2014)", |
| "ref_id": "BIBREF20" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 112, |
| "end": 120, |
| "text": "Figure 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "= \" > A A A D B 3 i c p V L L S g M x F M 2 M 7 / q q u h Q k W E Q X U m b E V 3 d F N y 4 V r A q d o W b S t I Z m J k N y R y z D L N 3 4 K 2 5 c q L j 1 F 9 z 5 N 6 a 1 B b U K i h c C J + e e e 3 N y k y A W X I P j v F r 2 0 P D I 6 N j 4 R G 5 y a n p m N j 8 3 f 6 J l o i i r U C m k O g u I Z o J H r A I c B D u L F S N h I N h p 0 N r v 5 E 8 v m d J c R s f Q j p k f k m b E G 5 w S M F R t z l r y g F 1 B m n r d X l X V D P z U K T r d W B 8 A 2 f l 5 9 k n q / i z F Q a I U B 5 n 9 t v f q a p Z h z 9 i n + H + m P i i 2 H L e 0 7 a 7 3 b W Z 1 2 f y T n 1 q + 0 N / j Q d B v W 0 C 9 O K z l X 7 y 6 p E n I I q C C a F 1 1 n R j 8 l C j g V L A s 5 y W a x Y S 2 S J N V D Y x I y L S f d g 1 l e M U w d d y Q y q w I c J f 9 W J G S U O t 2 G B h l S O B C f 8 1 1 y O 9 y 1 Q Q a u 3 7 K o z g B F t H 3 g x q J w C B x 5 1 f g O j d T B 9 E 2 g F D z a J x i e k E U o W D + T s 4 M w f 1 6 5 U F Q 2 S i W i s 7 R Z q G 8 1 5 v G O F p E y 2 g N u W g H l d E B O k Q V R K 1 r 6 9 a 6 t x 7 s G / v O f r S f 3 q W 2 1 a t Z Q J / C f n 4 D C i X f 6 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 = \" i w 3 k 6 B T F N k i P g E A 5 t k Y x e 6 F 9 k i 8 = \" > A A A D B 3 i c p V L L S g M x F M 2 M 7 / q q u h Q k W E Q X U m b E V 3 d F N y 4 V r A q d o W b S t I Z m J k N y R y z D L N 3 4 K 2 5 c q L j 1 F 9 z 5 N 6 a 1 B b U K i h c C J + e e e 3 N y k y A W X I P j v F r 2 0 P D I 6 N j 4 R G 5 y a n p m N j 8 3 f 6 J l o i i r U C m k O g u I Z o J H r A I c B D u L F S N h I N h p 0 N r v 5 E 8 v m d J c R s f Q j p k f k m b E G 5 w S M F R t z l r y g F 1 B m n r d X l X V D P z U K T r d W B 8 A 2 f l 5 9 k n q / i z F Q a I U B 5 n 9 t v f q a p Z h z 9 i n + H + m P i i 2 H L e 0 7 a 7 3 b W Z 1 2 f y T n 1 q + 0 N / j Q d B v W 0 C 9 O K z l X 7 y 6 p E n I I q C C a F 1 1 n R j 8 l C j g V L A s 5 y W a x Y S 2 S J N V D Y x I y L S f d g 1 l e M U w d d y Q y q w I c J f 9 W J G S U O t 2 G B h l S O B C f 8 1 1 y O 9 y 1 Q Q a u 3 7 K o z g B F t H 3 g x q J w C B x 5 1 f g O j d T B 9 E 2 g F D z a J x i e k E U o W D + T s 4 M w f 1 6 5 U F Q 2 S i W i s 7 R Z q G 8 1 5 v G O F p E y 2 g N u W g H l d E B O k Q V R K 1 r 6 9 a 6 t x 7 s G / v O f r S f 3 q W 2 1 a t Z Q J / C f n 4 D C i X f 6 w = = < / l a t e x i t >", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Less common in NLP are system comparisons based on direct human ratings, but an exception includes the annual shared task evaluations of the Conference on Machine Translation (WMT). There, MT practitioners submit system outputs based on a shared set of source sentences, which are then judged relative to other system outputs. Various aggregation strategies have been employed over the years to take these relative comparisons and derive competitive rankings between shared task entrants (Callison-Burch et al., 2012; Bojar et al., 2013 Bojar et al., , 2014 Bojar et al., , 2015 Bojar et al., , 2016 Bojar et al., , 2017 .", |
| "cite_spans": [ |
| { |
| "start": 488, |
| "end": 517, |
| "text": "(Callison-Burch et al., 2012;", |
| "ref_id": "BIBREF10" |
| }, |
| { |
| "start": 518, |
| "end": 536, |
| "text": "Bojar et al., 2013", |
| "ref_id": "BIBREF4" |
| }, |
| { |
| "start": 537, |
| "end": 557, |
| "text": "Bojar et al., , 2014", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 558, |
| "end": 578, |
| "text": "Bojar et al., , 2015", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 579, |
| "end": 599, |
| "text": "Bojar et al., , 2016", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 600, |
| "end": 620, |
| "text": "Bojar et al., , 2017", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Inspired by prior work in MT system evaluation, we propose a procedure for eliciting graded responses that we demonstrate to be more efficient than prior work. While remaining applicable to system evaluation, our experimental results suggest our approach as a more general framework for a variety of future data creation tasks, allowing for higher quality data in less time and cost.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "We consider three different approaches for scalar annotation: direct assessment (DA), online pairwise ranking aggregation (RA), and a hybrid method which we call EASL (Efficient Annotation of Scalar Labels). 1 DA scalar annotation, shown in Figure 1 (b), directly annotates absolute judgments on some scale (e.g., 0 to 100), independently per item ( \u00a72). As an RA approach ( \u00a73), we start with conventional unbounded models, where each instance is parameterized as a Gaussian distribution, as shown in Figure 1 (c). Since boundedness is essential for the scalar annotation we aim to model, we propose a bounded variant which parameterizes each instance by a beta distribution as illustrated in Figure 1(d) . Finally, we propose EASL ( \u00a74) that combines benefits of DA and RA.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 241, |
| "end": 249, |
| "text": "Figure 1", |
| "ref_id": null |
| }, |
| { |
| "start": 502, |
| "end": 510, |
| "text": "Figure 1", |
| "ref_id": null |
| }, |
| { |
| "start": 694, |
| "end": 705, |
| "text": "Figure 1(d)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "We illustrate the improvements enabled by our proposal on three example tasks ( \u00a75): lexical frequency inference, political spectrum inference and machine translation system ranking. 2 For example, we find that in the commonly employed condition of 3-way redundant annotation, our approach on multiple tasks gives similar quality with just 2way redundancy: this translates to a potential 50% increase in dataset size for the same cost.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Introduction", |
| "sec_num": "1" |
| }, |
| { |
| "text": "Direct assessment or direct annotation (DA) is a straightforward method for collecting graded response from annotators. The most popular scheme is n-ary ordinal labeling, as illustrated in Figure 1(a) , where annotators are shown one instance (i.e., sample point) and asked to label one of the n-ary ordered classes.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 189, |
| "end": 200, |
| "text": "Figure 1(a)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Direct Assessment", |
| "sec_num": "2" |
| }, |
| { |
| "text": "According to the level of measurement in psychometrics (Stevens, 1946, inter alia) , which classifies the numerals based on certain properties (e.g., identity, order, quantity), ordinal data do not allow for degree of difference. Namely, there is no guarantee that the distance between each label is equal, and instances in the same class are not discriminated. For example, in a typical five-level Likert scale (Likert, 1932) of likelihood -very unlikely, unlikely, unsure, likely, very likely -we cannot conclude that very likely instances are exactly twice as likely those marked likely, nor can we assume two instances with the same label have exactly the same likelihood.", |
| "cite_spans": [ |
| { |
| "start": 55, |
| "end": 82, |
| "text": "(Stevens, 1946, inter alia)", |
| "ref_id": null |
| }, |
| { |
| "start": 412, |
| "end": 426, |
| "text": "(Likert, 1932)", |
| "ref_id": "BIBREF18" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Direct Assessment", |
| "sec_num": "2" |
| }, |
| { |
| "text": "The issue of distance between ordinals is perhaps obviated by using scalar annotations (i.e., ratio scale in Stevens's terminology), which directly correspond to continuous quantities (Figure 1(b) ). In scalar DA, 3 each instance in the collection (S i \u2208 S N 1 ) is annotated with values (e.g., on the range 0 to 100) often by several annotators. The notion of quantitative difference is enabled by the property of absolute zero: the scale is bounded. For example, distance, length, mass, size etc. are represented by this scale. In the annual shared task evaluation of the WMT, DA has been used for scoring adequacy and fluency of machine learning system outputs with human evaluation (Graham et al., 2013 (Graham et al., , 2014 Bojar et al., 2016 Bojar et al., , 2017 , and has separately been used in creating datasets such as for factuality (Lee et al., 2015) .", |
| "cite_spans": [ |
| { |
| "start": 686, |
| "end": 706, |
| "text": "(Graham et al., 2013", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 707, |
| "end": 729, |
| "text": "(Graham et al., , 2014", |
| "ref_id": "BIBREF14" |
| }, |
| { |
| "start": 730, |
| "end": 748, |
| "text": "Bojar et al., 2016", |
| "ref_id": "BIBREF6" |
| }, |
| { |
| "start": 749, |
| "end": 769, |
| "text": "Bojar et al., , 2017", |
| "ref_id": "BIBREF5" |
| }, |
| { |
| "start": 845, |
| "end": 863, |
| "text": "(Lee et al., 2015)", |
| "ref_id": "BIBREF17" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 184, |
| "end": 196, |
| "text": "(Figure 1(b)", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Direct Assessment", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Why perhaps obviated? Because of two concerns: (1) annotators may not have a pre-existing, well-calibrated scale for performing DA on a particular collection according to a particular task; 4 and (2) it is known that people may be biased in their scalar estimates (Tversky and Kahneman, 1974) . Regarding (1), this motivates us to consider RA on the intuition that annotators may give more calibrated responses when performed in the context of other elements. Regarding (2), our goal is not to correct for human bias, but simply to more efficiently converge to the same consensus judgments already being pursued by the community in their annotation protocols, biased or otherwise. 5", |
| "cite_spans": [ |
| { |
| "start": 264, |
| "end": 292, |
| "text": "(Tversky and Kahneman, 1974)", |
| "ref_id": "BIBREF32" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Direct Assessment", |
| "sec_num": "2" |
| }, |
| { |
| "text": "3 Online Pairwise Ranking Aggregation", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Direct Assessment", |
| "sec_num": "2" |
| }, |
| { |
| "text": "Pairwise ranking aggregation (Thurstone, 1927) is a method to obtain a total ranking on instances, assuming that scalar value for each sample point follows a Gaussian distribution, N (\u00b5 i , \u03c3 2 ). The parameters {\u00b5 i } are interpreted as mean scalar annotation. 6 Given the parameters, the probability that S i is preferred ( ) over S j is defined as", |
| "cite_spans": [ |
| { |
| "start": 262, |
| "end": 263, |
| "text": "6", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "p(S i S j ) = \u03a6 \u00b5 i \u2212 \u00b5 j \u221a 2\u03c3 ,", |
| "eq_num": "(1)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "where \u03a6(\u2022) is the cumulative distribution function of the standard normal distribution. The objective of pairwise ranking aggregation (including all the following models) is formulated as a maximum log-likelihood estimation:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "max {S N 1 } S i ,S j \u2208{S N 1 } log p(S i S j ).", |
| "eq_num": "(2)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "TrueSkill TM (Herbrich et al., 2006 ) extends the Thurstone model by applying a Bayesian online and active learning framework, allowing for ties. TrueSkill has been used in the Xbox Live online gaming community, 7 and has been applied for various NLP tasks, such as question difficulty estimation (Liu et al., 2013) , ranking speech quality (Baumann, 2017) , and ranking machine translation and grammatical error correction systems with human evaluation (Bojar et al., 2014 (Bojar et al., , 2015 Sakaguchi et al., 2014 Sakaguchi et al., , 2016 In the same way as the Thurstone model, TrueSkill assumes that scalar values for each instance S i (i.e., skill level for each player in the context of TrueSkill) follow a Gaussian distribution N (\u00b5 i , \u03c3 2 i ), where \u03c3 i is also parameterized as the uncertainty of the scalar value for each instance. Importantly, TrueSkill uses a Bayesian online learning scheme, and the parameters are iteratively updated after each observation of pairwise comparison (i.e., game result: win ( ), tie (\u2261), or loss (\u227a)) in proportion to how surprising the outcome is. Let t i j = \u00b5 i \u2212 \u00b5 j , the difference in scalar responses (skill levels) when we observe i wins j, and 0 be a parameter to specify the tie rate. The update functions are formulated as follows:", |
| "cite_spans": [ |
| { |
| "start": 13, |
| "end": 35, |
| "text": "(Herbrich et al., 2006", |
| "ref_id": "BIBREF15" |
| }, |
| { |
| "start": 297, |
| "end": 315, |
| "text": "(Liu et al., 2013)", |
| "ref_id": "BIBREF19" |
| }, |
| { |
| "start": 341, |
| "end": 356, |
| "text": "(Baumann, 2017)", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 454, |
| "end": 473, |
| "text": "(Bojar et al., 2014", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 474, |
| "end": 495, |
| "text": "(Bojar et al., , 2015", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 496, |
| "end": 518, |
| "text": "Sakaguchi et al., 2014", |
| "ref_id": "BIBREF27" |
| }, |
| { |
| "start": 519, |
| "end": 543, |
| "text": "Sakaguchi et al., , 2016", |
| "ref_id": "BIBREF26" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "\u00b5 i = \u00b5 i + \u03c3 2 i c \u2022 v t c , c", |
| "eq_num": "(3)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "\u00b5 j = \u00b5 j \u2212 \u03c3 2 j c \u2022 v t c , c ,", |
| "eq_num": "(4)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "6 Thurstone and another popular ranking method by Elo (1978) use a fixed \u03c3 for all instances.", |
| "cite_spans": [ |
| { |
| "start": 50, |
| "end": 60, |
| "text": "Elo (1978)", |
| "ref_id": "BIBREF11" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "7 www.xbox.com/live/ where c 2 = 2\u03b3 2 +\u03c3 2 i +\u03c3 2 j , and v are multiplicative factors that affect the amount of change (surprisal of the outcome) in \u00b5. In the accumulation of the variances (c 2 ), another free parameter called \"skill chain\", \u03b3, indicates the width (or difference) of skill levels that two given players have 0.8 (80%) probability of win/lose. The multiplicative factor depends on the observation (wins or ties):", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "\u22124 \u22122 0 2 4 t i j = \u00b5 i \u2212 \u00b5 j 0 1 2 3 4 v i j (t, ) (a) vi j \u22124 \u22122 0 2 4 t i\u2261j = \u00b5 i \u2212 \u00b5 j \u22122 \u22121 0 1 2 v i\u2261j (t, ) (b) vi\u2261j \u22124 \u22122 0 2 4 t i j = \u00b5 i \u2212 \u00b5 j 0.00 0.25 0.50 0.75 1.00 w i j (t, ) (c) wi j \u22124 \u22122 0 2 4 t i\u2261j = \u00b5 i \u2212 \u00b5 j 0.00 0.25 0.50 0.75 1.00 w i\u2261j (t, ) (d) wi\u2261j", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "v i j (t, ) = \u03d5(\u2212 + t) \u03a6(\u2212 + t) ,", |
| "eq_num": "(5)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "v i\u2261j (t, ) = \u03d5(\u2212 \u2212 t) \u2212 \u03d5( \u2212 t) \u03a6( \u2212 t) \u2212 \u03a6(\u2212 \u2212 t) ,", |
| "eq_num": "(6)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "where \u03d5(\u2022) is the probability density function of the standard normal distribution. As shown in Figure 2 (a) and (b), v i j increases exponentially as t becomes smaller (i.e., the observation is unexpected), whereas v i\u2261j becomes close to zero when |t| is close to zero. In short, v becomes larger as the outcome is more surprising. In order to update variance (\u03c3 2 ), another set of update functions is used:", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 96, |
| "end": 108, |
| "text": "Figure 2 (a)", |
| "ref_id": "FIGREF1" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "\u03c3 2 i = \u03c3 2 i \u2022 1 \u2212 \u03c3 2 i c 2 \u2022 w t c , c", |
| "eq_num": "(7)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "\u03c3 2 j = \u03c3 2 j \u2022 1 \u2212 \u03c3 2 j c 2 \u2022 w t c , c ,", |
| "eq_num": "(8)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "where w serve as multiplicative factors that affect the amount of change in \u03c3 2 .", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "wi j (t, ) = vi j \u2022 (vi j + t \u2212 ) (9) wi\u2261j(t, ) = v 2 i\u2261j + ( \u2212 t) \u2022 \u03d5( \u2212 t) + ( + t) \u2022 \u03d5( + t) \u03a6( \u2212 t) \u2212 \u03a6(\u2212 \u2212 t) .", |
| "eq_num": "(10)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "As shown in Figure 2 (c) and (d), the value of w is between 0 and 1. The underlying idea for the variance updates is that these updates always decrease the size of the variances \u03c3 2 , which means uncertainty of the instances (S i , S j ) always decreases as we observe more pairwise comparisons. In other words, TrueSkill becomes more confident in the current estimate of \u00b5 i and \u00b5 j . Further details are provided by Herbrich et al. (2006) . 8 Another important property of TrueSkill is \"match quality (chance to draw)\". The match quality helps selecting competitive players to make games more interesting. More broadly, the match quality enables us to choose similar instances to be compared to maximize the information gain from pairwise comparisons, as in the active learning literature (Settles et al., 2008) . The match quality between two instances (players) is computed as follows:", |
| "cite_spans": [ |
| { |
| "start": 418, |
| "end": 440, |
| "text": "Herbrich et al. (2006)", |
| "ref_id": "BIBREF15" |
| }, |
| { |
| "start": 443, |
| "end": 444, |
| "text": "8", |
| "ref_id": null |
| }, |
| { |
| "start": 791, |
| "end": 813, |
| "text": "(Settles et al., 2008)", |
| "ref_id": "BIBREF28" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 12, |
| "end": 20, |
| "text": "Figure 2", |
| "ref_id": "FIGREF1" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "q(\u03b3, S i , S j ) := 2\u03b3 2 c 2 exp \u2212 (\u00b5 i \u2212 \u00b5 j ) 2 2c 2", |
| "eq_num": "(11)" |
| } |
| ], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "Intuitively, the match quality is based on the difference \u00b5 i \u2212 \u00b5 j . As the difference becomes smaller, the match quality goes higher, and vice versa. As mentioned, TrueSkill has been used for NLP tasks to infer continuous values for instances. However, it is important to note that the support of a Gaussian distribution is unbounded, namely R = (\u2212\u221e, \u221e). This does not satisfy the property of absolute zero of scalar annotation in the level of measurement ( \u00a72). It becomes problematic when it comes to annotating a scalar (continuous) value for extremes such as extremely positive or negative sentiments. We address this issue by proposing a novel variant of TrueSkill in the next section.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Unbounded Model", |
| "sec_num": "3.1" |
| }, |
| { |
| "text": "TrueSkill can induce a continuous spectrum of instances (such as skill level of game players) by assuming that each instance is represented as a Gaussian distribution. However, the Gaussian distribution has unbounded support, namely R = (\u2212\u221e, \u221e), which does not satisfy the property of absolute bounds for appropriate scalar annotation (i.e., ratio scale in the level of measurement).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "Thus, we propose a variant of TrueSkill by changing the latent distribution from a Gaussian to a beta, using a heuristic algorithm based on TrueSkill for inference. The Beta distribution has natural [0, 1] upper and lower bounds and a simple parameterization:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "S i \u223c B i (\u03b1 i , \u03b2 i ).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "We choose the scalar response as the mode M[S i ] of the distribution and the variance as uncertainty: 9", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "M i = \u03b1 i \u2212 1 \u03b1 i + \u03b2 i \u2212 2", |
| "eq_num": "(12)" |
| } |
| ], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "Var i = \u03c3 2 i = \u03b1 i \u03b2 i (\u03b1 i + \u03b2 i ) 2 (\u03b1 i + \u03b2 i + 1)", |
| "eq_num": "(13)" |
| } |
| ], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "As in TrueSkill, we iteratively update parameters of instances B(\u03b1, \u03b2) according to each observation and how it is surprising. Similarly to Eqns. (3) and (4), we choose the update functions as follows; 10 first, in case that an annotator judged that S i is preferred to S j (S i S j ),", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "\u03b1 i = \u03b1 i + \u03c3 2 i c \u2022 (1 \u2212 p i j )", |
| "eq_num": "(14)" |
| } |
| ], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "\u03b2 j = \u03b2 j + \u03c3 2 j c \u2022 (1 \u2212 p j\u227ai )", |
| "eq_num": "(15)" |
| } |
| ], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "in case of ties with |D| > and", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "M i > M j , \u03b1 j = \u03b1 j + \u03c3 2 j c \u2022 (1 \u2212 p i\u2261j )", |
| "eq_num": "(16)" |
| } |
| ], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "\u03b2 i = \u03b2 i + \u03c3 2 i c \u2022 (1 \u2212 p i\u2261j )", |
| "eq_num": "(17)" |
| } |
| ], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "and in case of ties with |D| , for both Regarding the probability of pairwise comparison between instances, we follow Bradley and Terry (1952) and Rao and Kupper (1967) to describe the chance of win, tie, or loss, as follows:", |
| "cite_spans": [ |
| { |
| "start": 118, |
| "end": 142, |
| "text": "Bradley and Terry (1952)", |
| "ref_id": "BIBREF9" |
| }, |
| { |
| "start": 147, |
| "end": 168, |
| "text": "Rao and Kupper (1967)", |
| "ref_id": "BIBREF25" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "S i , S j , \u03b1 i,j = \u03b1 i,j + \u03c3 2 i,j c \u2022 (1 \u2212 p i\u2261j )", |
| "eq_num": "(18)" |
| } |
| ], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "\u03b2 i,j = \u03b2 i,j + \u03c3 2 i,j c \u2022 (1 \u2212 p i\u2261j ). (19) \u22121 0 1 t i j = M i \u2212 M j 0.00 0.25 0.50 0.75 1.00 1 \u2212 p(S i S j ) (a) 1 \u2212 pi j \u22121 0 1 t i\u2261j = M i \u2212 M j 0.7 0.8 0.9 1.0 1 \u2212 p(S i \u2261 S j ) (b) 1 \u2212 pi\u2261j", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "p(Si Sj) = p(D > ) = \u03c0i \u03c0i + \u03b8\u03c0j (20) p(Si \u227a Sj) = p(D < \u2212 ) = \u03c0j \u03b8\u03c0i + \u03c0j (21) p(Si \u2261 Sj) = p(|D| ) = (\u03b8 2 \u2212 1)\u03c0i\u03c0j (\u03c0i + \u03b8\u03c0j)(\u03b8\u03c0i + \u03c0j) (22) where D = M i \u2212 M j ,", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "0 is a parameter to specify the tie rate, \u03b8 = exp ( ), and \u03c0 is an exponential score function of S; \u03c0 i = exp(M i ).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "It is important to note that \u03b1 and \u03b2 never decrease (because 1 \u2212 p \u2265 0 as shown Figure 3) , which satisfies the property that variance (uncertainty) always decreases as we observe more judgments, as seen in TrueSkill ( \u00a73.1). In addition, we do not need individual update functions for \u00b5 and \u03c3 2 , since the mode and variance in beta distribution depend on two shared parameters \u03b1, \u03b2 (Eqns. 12 and 13).", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 80, |
| "end": 89, |
| "text": "Figure 3)", |
| "ref_id": "FIGREF2" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "Regarding match quality, we use the same formulation as the TrueSkill (Eqn. 11), except that the bounded model uses M instead of \u00b5:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "q(\u03b3, S i , S j ) = 2\u03b3 2 c 2 exp \u2212 (M i \u2212 M j ) 2 2c 2", |
| "eq_num": "(23)" |
| } |
| ], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "4 Efficient Annotation of Scalar Labels", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "In the previous section, we propose a bounded online ranking aggregation model for scalar annotation. However, the amount of update by a pairwise judgment depends only on the distance between instances, not on the distance from the bounds (i.e., 0 and 1). To integrate this property into the online ranking aggregation model, ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J a P Z p q g H 9 G R 5 C F n 1 F i p 2 R z w Q b n i V t 0 F y D r x c l K B H I 1 B + a s / j F k a o T R M U K 1 7 n p s Y P 6 P K c C Z w V u q n G h P K J n S E P U s l j V D 7 2 e L U G b m w y p C E s b I l D V m o v y c y G m k 9 j Q L b G V E z 1 q v e X P z P 6 6 U m v P E z L p P U o G T L R W E q i I n J / G 8 y 5 A q Z E V N L K F P c 3 k r Y m C r K j E 2 n Z E P w V l 9 e J + 2 r q u d W v Y f r S v 0 2 j 6 M I Z 3 A O l + B B D e p w D w 1 o A Y M R P M M r v D n C e", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "X H e n Y 9 l a 8 H J Z 0 7 h D 5 z P H y g y j b 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 = \" t + I z 4 L a x b y D", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "v B o P 2 / Z e J b T G g K m E = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 + V 2 g 9 o Q 9 l s J + 3 S z S b s b o Q S + h O 8 e F D E q 7 / I m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9 f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J a P Z p q g H 9 G R 5 C F n 1 F i p 2 R z w Q b n i V t 0 F y D r x c l K B H I 1 B + a s / j F k a o T R M U K 1 7 n p s Y P 6 P K c C Z w V u q n G h P K J n S E P U s l j V D 7 2 e L U G b m w y p C E s b I l D V m o v y c y G m k 9 j Q L b G V E z 1 q v e X P z P 6 6 U m v P E z L p P U o G T L R W E q i I n J / G 8 y 5 A q Z E V N L K F P c 3 k r Y m C r K j E 2 n Z E P w V l 9 e J + 2 r q u d W v Y f r S v 0 2 j 6 M I Z 3 A O l + B B D e p w D w 1 o A Y M R P M M r v D n C e", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "X H e n Y 9 l a 8 H J Z 0 7 h D 5 z P H y g y j b 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 = \" t + I z 4 L a x b y D", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "v B o P 2 / Z e J b T G g K m E = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 + V 2 g 9 o Q 9 l s J + 3 S z S b s b o Q S + h O 8 e F D E q 7 / I m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9 f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J a P Z p q g H 9 G R 5 C F n 1 F i p 2 R z w Q b n i V t 0 F y D r x c l K B H I 1 B + a s / j F k a o T R M U K 1 7 n p s Y P 6 P K c C Z w V u q n G h P K J n S E P U s l j V D 7 2 e L U G b m w y p C E s b I l D V m o v y c y G m k 9 j Q L b G V E z 1 q v e X P z P 6 6 U m v P E z L p P U o G T L R W E q i I n J / G 8 y 5 A q Z E V N L K F P c 3 k r Y m C r K j E 2 n Z E P w V l 9 e J + 2 r q u d W v Y f r S v 0 2 j 6 M I Z 3 A O l + B B D e p w D w 1 o A Y M R P M M r v D n C e", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "X H e n Y 9 l a 8 H J Z 0 7 h D 5 z P H y g y j b 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 = \" t + I z 4 L a x b y D", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "v B o P 2 / Z e J b T G g K m E = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 + V 2 g 9 o Q 9 l s J + 3 S z S b s b o Q S + h O 8 e F D E q 7 / I m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9 f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J a P Z p q g H 9 G R 5 C F n 1 F i p 2 R z w Q b n i V t 0 F y D r x c l K B H I 1 B + a s / j F k a o T R M U K 1 7 n p s Y P 6 P K c C Z w V u q n G h P K J n S E P U s l j V D 7 2 e L U G b m w y p C E s b I l D V m o v y c y G m k 9 j Q L b G V E z 1 q v e X P z P 6 6 U m v P E z L p P U o G T L R W E q i I n J / G 8 y 5 A q Z E V N L K F P c 3 k r Y m C r K j E 2 n Z E P w V l 9 e J + 2 r q u d W v Y f r S v 0 2 j 6 M I Z 3 A O l + B B D e p w D w 1 o A Y M R P M M r v D n C e", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "X H e n Y 9 l a 8 H J Z 0 7 h D 5 z P H y g y j b M = < / l a t e x i t > S j < l a t e x i t s h a 1 _ b a s e 6 4 = \" u y 8 / o o 2 X H / 5 N K + s Y e d P 2 6 N U T q T 4 = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E 0 G P R i 8 d K 7 Q e 0 o W y 2 k 3 b t Z h N 2 N 0 I J / Q l e P C j i 1 V / k z X / j t s 1 B W x 8 M P N 6 b Y W Z e k A i u j e t + O 4 W 1 9 Y 3 N r e J 2 a W", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "d 3 b / + g f H j U 0 n G q G D Z Z L G L V C a h G w S U 2 D T c C O 4 l C G g U C 2 8 H 4 d u a 3 n 1 B p H s s H M 0 n Q j + h Q 8 p A z a q z U a P Q f + + W K W 3 X n I K v E y 0 k F c t T 7 5 a / e I G Z p h N I w Q b X u e m 5 i / I w q w 5 n A a a m X a k w o G 9 M h d i 2 V N E L t Z / N T p + T M K g M S x s q W N G S u / p 7 I a K T 1 J A p s Z 0 T N S C 9 7 M / E / r 5 u a 8 N r P u E x S g 5 I t F o W p I C Y m s 7 / J g C t k R k w s o U", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "x x e y t h I 6 o o M z a d k g 3 B W 3 5 5 l b Q u q p 5 b 9 e 4 v K 7 W b P I 4 i n M A p n I M H V 1 C D O 6 h D E x g M 4 R l e 4 c 0 R z o v z 7 n w s W g t O P n M M f + B 8 / g A p t o 2 0 < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" u y 8 / o o 2 X H / 5 N K + s Y e d P 2 6 N U T q T 4 = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E 0 G P R i 8 d K 7 Q e 0 o W y 2 k 3 b t Z h N 2 N 0 I J / Q l e P C j i 1 V / k z X / j t s 1 B W x 8 M P N 6 b Y W Z e k A i u j e t + O 4 W 1 9 Y 3 N r e J 2 a W d 3 b / + g f H j U 0 n G q G D Z Z L G L V C a h G w S U 2 D T c C O 4 l C G g U C 2 8 H 4 d u a 3 n 1 B p H s s H M 0 n Q j + h Q 8 p A z a q z U a P Q f + + W K W 3 X n I K v E y 0 k F c t T 7 5 a / e I G Z p h N I w Q b X u e m 5 i / I w q w 5 n A a a m X a k w o G 9 M h d i 2 V N E L t Z / N T p + T M K g M S x s q W N G S u / p 7 I a K T 1 J A p s Z 0 T N S C 9 7 M / E / r 5 u a 8 N r P u E x S g 5 I t F o W p I C Y m s 7 / J g C t k R k w s o U x x e y t h I 6 o o M z a d k g 3 B W 3 5 5 l b Q u q p 5 b 9 e 4 v K 7 W b P I 4 i n M A p n I M H V 1 C D O 6 h D E x g M 4 R l e 4 c 0 R z o v z 7 n w s W g t O P n M M f + B 8 / g A p t o 2 0 < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" u y 8 / o o 2 X H / 5 N K + s Y e d P 2 6 N U T q T 4 = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E 0 G P R i 8 d K 7 Q e 0 o W y 2 k 3 b t Z h N 2 N 0 I J / Q l e P C j i 1 V / k z X / j t s 1 B W x 8 M P N 6 b Y W Z e k A i u j e t + O 4 W 1 9 Y 3 N r e J 2 a W d 3 b / + g f H j U 0 n G q G D Z Z L G L V C a h G w S U 2 D T c C O 4 l C G g U C 2 8 H 4 d u a 3 n 1 B p H s s H M 0 n Q j + h Q 8 p A z a q z U a P Q f + + W K W 3 X n I K v E y 0 k F c t T 7 5 a / e I G Z p h N I w Q b X u e m 5 i / I w q w 5 n A a a m X a k w o G 9 M h d i 2 V N E L t Z / N T p + T M K g M S x s q W N G S u / p 7 I a K T 1 J A p s Z 0 T N S C 9 7 M / E / r 5 u a 8 N r P u E x S g 5 I t F o W p I C Y m s 7 / J g C t k R k w s o U x x e y t h I 6 o o M z a d k g 3 B W 3 5 5 l b Q u q p 5 b 9 e 4 v K 7 W b P I 4 i n M A p n I M H V 1 C D O 6 h D E x g M 4 R l e 4 c 0 R z o v z 7 n w s W g t O P n M M f + B 8 / g A p t o 2 0 < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" u y 8 / o o 2 X H / 5 N K + s Y e d P 2 6 N U T q T 4 = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E 0 G P R i 8 d K 7 Q e 0 o W y 2 k 3 b t Z h N 2 N 0 I J / Q l e P C j i 1 V / k z X / j t s 1 B W x 8 M P N 6 b Y W Z e k A i u j e t + O 4 W 1 9 Y 3 N r e J 2 a W d 3 b / + g f H j U 0 n G q G D Z Z L G L V C a h G w S U 2 D T c C O 4 l C G g U C 2 8 H 4 d u a 3 n 1 B p H s s H M 0 n Q j + h Q 8 p A z a q z U a P Q f + + W K W 3 X n I K v E y 0 k F c t T 7 5 a / e I G Z p h N I w Q b X u e m 5 i / I w q w 5 n A a a m X a k w o ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "G 9 M h d i 2 V N E L t Z / N T p + T M K g M S x s q W N G S u / p 7 I a K T 1 J A p s Z 0 T N S C", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V s J G V F O G N p 2 K D c F f f n m V t C 5 q v", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "l f z 7 y + r 9 Z s i j j K c w C m c g w 9 X U I c 7 a E A T G A z h G V 7 h z Z H O i / P u f C x a S 0 4 x c w x / 4 H z + A F j y j d M = < / l a t e x i t > s j < l a t e x i t s h a 1 _ b a s e 6 4 = \" J p t a g c 3 6 A A 9 Z Y k 3 F Y w V a a i 8 x T h 4 = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 V 7 Q e 0 o W y 2 k 3 b t Z h N 2 N 0 I J / Q l e P C j i 1 V / k z X / j t s 1 B W x 8 M P N 6 b Y W Z e k A i u j e t + O 4 W 1 9 Y 3 N r e J 2 a W d 3", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "b / + g f H j U 0 n G q G D Z Z L G L V C a h G w S U 2 D T c C O 4 l C G g U C 2 8 H 4 Z u a 3 n 1 B p H s s H M 0 n Q j + h Q 8 p A z a q x 0 r / u P / X L F r b p z k F X i 5 a Q C O R r 9 8 l d v E L M 0 Q m m Y o F p 3 P T c x f k a V 4 U z g t N R L N S a U j e k Q u 5 Z K G q H 2 s / m p U 3 J m l Q E J Y 2 V L G j J X f 0 9 k N N J 6 E g W 2 M 6 J m p J e 9 m f i f 1 0 1 N e O V n X C a p Q c k W i 8 J U E B O T 2 d 9 k w B U y I y a W U K a 4 v Z W w E V W U G Z t O y Y b g L b + 8 S l o X V", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "c + t e n e X l f p 1 H k c R T u A U z s G D G t T h F h r Q B A Z D e I Z X e H O E 8 + K 8 O x + L 1 o K T z x z D H z i f P 1 p 2 j d 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 = \" J p t a g c 3 6 A A 9 Z Y k 3 F Y w V a a i 8 x T h 4 = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 V 7 Q e 0 o W y 2 k 3 b t Z h N 2 N 0 I J / Q l e P C j i 1 V / k z X / j t s 1 B W x 8 M P N 6 b Y W Z e k A i u j e t + O 4 W 1 9 Y 3 N r e J 2 a W d 3", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "b / + g f H j U 0 n G q G D Z Z L G L V C a h G w S U 2 D T c C O 4 l C G g U C 2 8 H 4 Z u a 3 n 1 B p H s s H M 0 n Q j + h Q 8 p A z a q x 0 r / u P / X L F r b p z k F X i 5 a Q C O R r 9 8 l d v E L M 0 Q m m Y o F p 3 P T c x f k a V 4 U z g t N R L N S a U j e k Q u 5 Z K G q H 2 s / m p U 3 J m l Q E J Y 2 V L G j J X f 0 9 k N N J 6 E g W 2 M 6 J m p J e 9 m f i f 1 0 1 N e O V n X C a p Q c k W i 8 J U E B O T 2 d 9 k w B U y I y a W U K a 4 v Z W w E V W U G Z t O y Y b g L b + 8 S l o X V", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "c + t e n e X l f p 1 H k c R T u A U z s G D G t T h F h r Q B A Z D e I Z X e H O E 8 + K 8 O x + L 1 o K T z x z D H z i f P 1 p 2 j d 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 = \" J p t a g c 3 6 A A 9 Z Y k 3 F Y w V a a i 8 x T h 4 = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 V 7 Q e 0 o W y 2 k 3 b t Z h N 2 N 0 I J / Q l e P C j i 1 V / k z X / j t s 1 B W x 8 M P N 6 b Y W Z e k A i u j e t + O 4 W 1 9 Y 3 N r e J 2 a W d 3", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "b / + g f H j U 0 n G q G D Z Z L G L V C a h G w S U 2 D T c C O 4 l C G g U C 2 8 H 4 Z u a 3 n 1 B p H s s H M 0 n Q j + h Q 8 p A z a q x 0 r / u P / X L F r b p z k F X i 5 a Q C O R r 9 8 l d v E L M 0 Q m m Y o F p 3 P T c x f k a V 4 U z g t N R L N S a U j e k Q u 5 Z K G q H 2 s / m p U 3 J m l Q E J Y 2 V L G j J X f 0 9 k N N J 6 E g W 2 M 6 J m p J e 9 m f i f 1 0 1 N e O V n X C a p Q c k W i 8 J U E B O T 2 d 9 k w B U y I y a W U K a 4 v Z W w E V W U G Z t O y Y b g L b + 8 S l o X V", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "c + t e n e X l f p 1 H k c R T u A U z s G D G t T h F h r Q B A Z D e I Z X e H O E 8 + K 8 O x + L 1 o K T z x z D H z i f P 1 p 2 j d 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 = \" J p t a g c 3 6 A A 9 Z Y k 3 F Y w V a a i 8 x T h 4 = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 V 7 Q e 0 o W y 2 k 3 b t Z h N 2 N 0 I J / Q l e P C j i 1 V / k z X / j t s 1 B W x 8 M P N 6 b Y W Z e k A i u j e t + O 4 W 1 9 Y 3 N r e J 2 a W d 3 ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "b / + g f H j U 0 n G q G D Z Z L G L V C a h G w S U 2 D T c C O 4 l C G g U C 2 8 H 4 Z u a 3 n 1 B p H s s H M 0 n Q j + h Q 8 p A z a q x 0 r / u P / X L F r b p z k F X i 5 a Q C O R r 9 8 l d v E L M 0 Q m m Y o F p 3 P T c x f k a V 4 U z g t N R L N S a U j e k Q u 5 Z K G q H 2 s / m p U 3 J m l Q E J Y 2 V L G j J X f 0 9 k N N J 6 E g W 2 M 6 J m p J e 9 m f i f 1 0 1 N e O V n X C a p Q c k W i 8 J U E B O T 2 d 9 k w B U y I y a W U K a 4 v Z W w E V W U G Z t O y Y b g L b + 8 S l o X V", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V n Q i U p c s U W i 8 J U E o z J 7 G 0 y E J o z l B N L K N P C 3 k r Y i G r K 0 I Z T s i F 4 y y + v k t Z F 1 X O r 3 v 1 l p X 6 T x 1 G E E z i F c / C g B n W 4 g w Y 0", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "g U E I z / A K b 8 7 Y e X H e n Y 9 F a 8 H J Z 4 7 h D 5 z P H / Y f j P g = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" D 0 F G Q E 6 F B Q J N u S u f y G 9 q k O R f j p 0 = \" > A A A B 6 X i c b ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q H g q e v F Y x X 5 A G 8 p m u 2 m X b j Z h d y K U 0 H / g x Y M i X v 1 H 3 v", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V n Q i U p c s U W i 8 J U E o z J 7 G 0 y E J o z l B N L K N P C 3 k r Y i G r K 0 I Z T s i F 4 y y + v k t Z F 1 X O r 3 v 1 l p X 6 T x 1 G E E z i F c / C g B n W 4 g w Y 0", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "g U E I z / A K b 8 7 Y e X H e n Y 9 F a 8 H J Z 4 7 h D 5 z P H / Y f j P g = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" D 0 F G Q E 6 F B Q J N u S u f y G 9 q k O R f j p 0 = \" > A A A B 6 X i c b ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q H g q e v F Y x X 5 A G 8 p m u 2 m X b j Z h d y K U 0 H / g x Y M i X v 1 H 3 v", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V n Q i U p c s U W i 8 J U E o z J 7 G 0 y E J o z l B N L K N P C 3 k r Y i G r K 0 I Z T s i F 4 y y + v k t Z F 1 X O r 3 v 1 l p X 6 T x 1 G E E z i F c / C g B n W 4 g w Y 0", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "g U E I z / A K b 8 7 Y e X H e n Y 9 F a 8 H J Z 4 7 h D 5 z P H / Y f j P g = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" D 0 F G Q E 6 F B Q J N u S u f y G 9 q k O R f j p 0 = \" > A A A B 6 X i c b ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q H g q e v F Y x X 5 A G 8 p m u 2 m X b j Z h d y K U 0 H / g x Y M i X v 1 H 3 v", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V n Q i U p c s U W i 8 J U E o z J 7 G 0 y E J o z l B N L K N P C 3 k r Y i G r K 0 I Z T s i F 4 y y + v k t Z F 1 X O r 3 v 1 l p X 6 T x 1 G E E z i F c / C g B n W 4 g w Y 0", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "g U E I z / A K b 8 7 Y e X H e n Y 9 F a 8 H J Z 4 7 h D 5 z P H / Y f j P g = < / l a t e x i t > : 0", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "< l a t e x i t s h a 1 _ b a s e 6 4 = \" D 0 F G Q E 6 F B Q J N u S u f y G 9 q k O R f j p 0 = \" > A A A B 6 X i c b", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q H g q e v F Y x X 5 A G 8 p m u 2 m X b j Z h d y K U 0 H / g x Y M i X v 1 H 3 v w 3 b t s c t P X B w O O 9 G W b m B Y k U B l 3 3 2 y m s r W 9 s b h W 3 S z u 7 e / s H 5 c O j l o l T z X i T x T L W n Y A a L o X i T R Q o e S f R n E a B 5 O 1 g f D v z 2 0 9 c G x G r R 5 w k 3 I / o U I l Q M I p W e r h 2 + + W K W 3 X n I K v E y 0 k F c j T 6 5 a / e I G Z p x B U y S Y 3 p e m 6 C f k Y 1 C i b 5 t N R L D U 8 o G 9 M h 7 1 q q a M S N n 8 0 v n Z I z q w x I G G t b C s l c / T 2 R 0 c i Y S R T Y z o j i y C x 7 M / E / r 5 t i e O V n Q i U p c s U W i 8 J U E o z J 7 G 0 y E J o z l B N L K N P C 3 k r Y i G r K 0 I Z T s i F 4 y y + v k t Z F 1 X O r 3 v 1 l p X 6 T x 1 G E E z i F c / C g B n W 4 g w Y 0", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "g U E I z / A K b 8 7 Y e X H e n Y 9 F a 8 H J Z 4 7 h D 5 z P H / Y f j P g = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" D 0 F G Q E 6 F B Q J N u S u f y G 9 q k O R f j p 0 = \" > A A A B 6 X i c b", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q H g q e v F Y x X 5 A G 8 p m u 2 m X b j Z h d y K U 0 H / g x Y M i X v 1 H 3 v w 3 b t s c t P X B w O O 9 G W b m B Y k U B l 3 3 2 y m s r W 9 s b h W 3 S z u 7 e / s H 5 c O j l o l T z X i T x T L W n Y A a L o X i T R Q o e S f R n E a B 5 O 1 g f D v z 2 0 9 c G x G r R 5 w k 3 I / o U I l Q M I p W e r h 2 + + W K W 3 X n I K v E y 0 k F c j T 6 5 a / e I G Z p x B U y S Y 3 p e m 6 C f k Y 1 C i b 5 t N R L D U 8 o G 9 M h 7 1 q q a M S N n 8 0 v n Z I z q w x I G G t b C s l c / T 2 R 0 c i Y S R T Y z o j i y C x 7 M / E / r 5 t i e O V n Q i U p c s U W i 8 J U E o z J 7 G 0 y E J o z l B N L K N P C 3 k r Y i G r K 0 I Z T s i F 4 y y + v k t Z F 1 X O r 3 v 1 l p X 6 T x 1 G E E z i F c / C g B n W 4 g w Y 0", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "g U E I z / A K b 8 7 Y e X H e n Y 9 F a 8 H J Z 4 7 h D 5 z P H / Y f j P g = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" D 0 F G Q E 6 F B Q J N u S u f y G 9 q k O R f j p 0 = \" > A A A B 6 X i c b", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q H g q e v F Y x X 5 A G 8 p m u 2 m X b j Z h d y K U 0 H / g x Y M i X v 1 H 3 v w 3 b t s c t P X B w O O 9 G W b m B Y k U B l 3 3 2 y m s r W 9 s b h W 3 S z u 7 e / s H 5 c O j l o l T z X i T x T L W n Y A a L o X i T R Q o e S f R n E a B 5 O 1 g f D v z 2 0 9 c G x G r R 5 w k 3 I / o U I l Q M I p W e r h 2 + + W K W 3 X n I K v E y 0 k F c j T 6 5 a / e I G Z p x B U y S Y 3 p e m 6 C f k Y 1 C i b 5 t N R L D U 8 o G 9 M h 7 1 q q a M S N n 8 0 v n Z I z q w x I G G t b C s l c / T 2 R 0 c i Y S R T Y z o j i y C x 7 M / E / r 5 t i e O V n Q i U p c s U W i 8 J U E o z J 7 G 0 y E J o z l B N L K N P C 3 k r Y i G r K 0 I Z T s i F 4 y y + v k t Z F 1 X O r 3 v 1 l p X 6 T x 1 G E E z i F c / C g B n W 4 g w Y 0", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "g U E I z / A K b 8 7 Y e X H e n Y 9 F a 8 H J Z 4 7 h D 5 z P H / Y f j P g = < / l a t e x i t > < l a t e x i t s h a 1 _ b a s e 6 4 = \" D 0 F G Q E 6 F B Q J N u S u f y G 9 q k O R f j p 0 = \" > A A A B 6 X i c b", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q H g q e v F Y x X 5 A G 8 p m u 2 m X b j Z h d y K U 0 H / g x Y M i X v 1 H 3 v w 3 b t s c t P X B w O O 9 G W b m B Y k U B l 3 3 2 y m s r W 9 s b h W 3 S z u 7 e / s H 5 c O j l o l T z X i T x T L W n Y A a L o X i T R Q o e S f R n E a B 5 O 1 g f D v z 2 0 9 c G x G r R 5 w k 3 I / o U I l Q M I p W e r h 2 + + W K W 3 X n I K v E y 0 k F c j T 6 5 a / e I G Z p x B U y S Y 3 p e m 6 C f k Y 1 C i b 5 t N R L D U 8 o G 9 M h 7 1 q q a M S N n 8 0 v n Z I z q w x I G G t b C s l c / T 2 R 0 c i Y S R T Y z o j i y C x 7 M / E / r 5 t i e O V n Q i U p c s U W i 8 J U E o z J 7 G 0 y E J o z l B N L K N P C 3 k r Y i G r K 0 I Z T s i F 4 y y + v k t Z F 1 X O r 3 v 1 l p X 6 T x 1 G E E z i F c / C g B n W 4 g w Y 0", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "g U E I z / A K b 8 7 Y e X H e n Y 9 F a 8 H J Z 4 7 h D 5 z P H / Y f j P g = < / l a t e x i t > 1 < l a t e x i t s h a 1 _ b a s e 6 4 = \" l 9 e I m v Y c F O K p z E D j i / n 9 j P D e W b 8 = \" > A A A B 6 H i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 t 2 A 9 o Q 9 l s J + 3 a z S b s b o Q S + g u 8 e F D E q z / J m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J Y P Z p q g H 9 G R 5 C F n 1 F i p 6 Q 3 K F b f q L k D W i Z e T C u R o D M p f / W H M 0 g i l Y Y J q 3 f P c x P g Z V Y Y z g b N S P 9 W Y U D a h I + x Z K m m E 2 s 8 W h 8 7 I h V W G J I y V L W n I Q v 0 9 k d F I 6 2 k U 2 M 6 I m r F e 9 e b i f 1 4 v N e G N n 3 G Z p A Y l W y 4 K U 0 F M T O Z f k y F X y I y Y W k K Z 4 v Z W w s Z U U W Z s N i U b g r f 6 8 j p p X 1 U 9 t + o 1 r y v 1 2 z y O I p z B O V y C B z W o w z 0 0 o A U M E J 7 h F d 6 c R +", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "f F e X c + l q 0 F J 5 8 5 h T 9 w P n 8 A e p 2 M t 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 = \" l 9 e I m v Y c F O K p z E D j i / n 9 j P D e W b 8 = \" > A A A B 6 H i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 t 2 A 9 o Q 9 l s J + 3 a z S b s b o Q S + g u 8 e F D E q z / J m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J Y P Z p q g H 9 G R 5 C F n 1 F i p 6 Q 3 K F b f q L k D W i Z e T C u R o D M p f / W H M 0 g i l Y Y J q 3 f P c x P g Z V Y Y z g b N S P 9 W Y U D a h I + x Z K m m E 2 s 8 W h 8 7 I h V W G J I y V L W n I Q v 0 9 k d F I 6 2 k U 2 M 6 I m r F e 9 e b i f 1 4 v N e G N n 3 G Z p A Y l W y 4 K U 0 F M T O Z f k y F X y I y Y W k K Z 4 v Z W w s Z U U W Z s N i U b g r f 6 8 j p p X 1 U 9 t + o 1 r y v 1 2 z y O I p z B O V y C B z W o w z 0 0 o A U M E J 7 h F d 6 c R +", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "f F e X c + l q 0 F J 5 8 5 h T 9 w P n 8 A e p 2 M t 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 = \" l 9 e I m v Y c F O K p z E D j i / n 9 j P D e W b 8 = \" > A A A B 6 H i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 t 2 A 9 o Q 9 l s J + 3 a z S b s b o Q S + g u 8 e F D E q z / J m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J Y P Z p q g H 9 G R 5 C F n 1 F i p 6 Q 3 K F b f q L k D W i Z e T C u R o D M p f / W H M 0 g i l Y Y J q 3 f P c x P g Z V Y Y z g b N S P 9 W Y U D a h I + x Z K m m E 2 s 8 W h 8 7 I h V W G J I y V L W n I Q v 0 9 k d F I 6 2 k U 2 M 6 I m r F e 9 e b i f 1 4 v N e G N n 3 G Z p A Y l W y 4 K U 0 F M T O Z f k y F X y I y Y W k K Z 4 v Z W w s Z U U W Z s N i U b g r f 6 8 j p p X 1 U 9 t + o 1 r y v 1 2 z y O I p z B O V y C B z W o w z 0 0 o A U M E J 7 h F d 6 c R +", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "f F e X c + l q 0 F J 5 8 5 h T 9 w P n 8 A e p 2 M t 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 = \" l 9 e I m v Y c F O K p z E D j i / n 9 j P D e W b 8 = \" > A A A B 6 H i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 t 2 A 9 o Q 9 l s J + ", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J Y P Z p q g H 9 G R 5 C F n 1 F i p 6 Q 3 K F b f q L k D W i Z e T C u R o D M p f / W H M 0 g i l Y Y J q 3 f P c x P g Z V Y Y z g b N S P 9 W Y U D a h I + x Z K m m E 2 s 8 W h 8 7 I h V W G J I y V", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "L W n I Q v 0 9 k d F I 6 2 k U 2 M 6 I m r F e 9 e b i f 1 4 v N e G N n 3 G Z p A Y l W y 4 K U 0 F M T O Z f k y F X y I y Y W k K Z 4 v Z W w s Z U U W Z s N i U b g r f 6 8 j p p X 1 U 9 t + o 1 r y v 1 2 z y O I p z B O V y C B z W o w z 0 0 o A U M E J 7 h F d 6 c R + f F e X c + l q 0 F J 5 8 5 h T 9 w P n 8 A e p 2 M t Q = = < / l a t e x i t > Figure 4 : Illustrative example of the EASL protocol. Each instance is represented as a beta distribution. Instances are chosen to annotate according to the variance and match quality, and the parameters are updated iteratively.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 356, |
| "end": 364, |
| "text": "Figure 4", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "we propose EASL (Efficient Annotation of Scalar Labels) that combines benefits from both direct assessment (DA) and bounded online ranking aggregation model (RA). 11 Similarly to RA, EASL parameterizes each instance by a beta distribution (Eqns. 12 and 13), and the parameters are inferred using a computationally efficient and easy-to-implement heuristic. The difference from RA is the type of annotation. While we ask for discrete pairwise judgment ( , \u227a, \u2261) between S i and S j in RA, here we directly ask for scalar values for them (denoted as s i and s j ) as in DA. Thus, given an annotated score s i which is normalized between [0,1], we change the update functions as follows:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "\u03b1 i = \u03b1 i + s i (24) \u03b2 i = \u03b2 i + (1 \u2212 s i )", |
| "eq_num": "(25)" |
| } |
| ], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "This procedure may look similar to DA, where s i is simply accumulated and averaged at the end. However, there are two differences. First, as illustrated in Figure 4 , EASL parameterizes each instance as a probability distribution while DA does not. Second, DA elicits annotations independently per element, whereas EASL elicits annotations on elements in the context of other elements selected jointly according to match quality.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 157, |
| "end": 165, |
| "text": "Figure 4", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "Further, DA generally uses a batch style annotation scheme, where the number of annotations per instance is independent from the latent scalar values. On the other hand, EASL uses online learning, which impacts the calculation of match quality. This allows us to choose instances to annotate by order of uncertainty for each instance, and as in RA, the match quality (Eqn. 23) enables us to consider similar instances in the same context.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Bounded Variant", |
| "sec_num": "3.2" |
| }, |
| { |
| "text": "To compare different annotation methods, we conduct three experiments: (1) lexical frequency inference, (2) political spectrum inference, and 3human evaluation for machine translation systems.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experiments", |
| "sec_num": "5" |
| }, |
| { |
| "text": "In all experiments, data collection is conducted through Amazon Mechanical Turk (AMT). We ask annotators who meet the following minimum requirements: 12 living in the US, overall approval rate > 98%, and number of tasks approved > 500.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experiments", |
| "sec_num": "5" |
| }, |
| { |
| "text": "The experimental setting for DA is straightforward. We ask annotators to annotate a scalar value for each instance, one item at a time. We collect ten annotations for each instance to see the relation between the number of annotations and accuracy (i.e., correlation).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experiments", |
| "sec_num": "5" |
| }, |
| { |
| "text": "To set up the online update in RA and EASL, we use a partial ranking framework with scalars, where annotators are asked to rank and score n instances at one time as illustrated in Figure 5 . In all three experiments, we fix n = 5. The partial ranking yields n 2 pairwise comparisons for RA and n scalar values for EASL. 13 It is important to note that we can simultaneously retrieve pairwise 12 In all experiments, we set the reward of single instance to be $0.01 (i.e., $0.05 in RA and EASL). This is $8/hour, assuming that annotating one instance takes five seconds. Prior to annotation, we run a pilot to make sure that the participants understand the task correctly and the instructions are clear. 13 The partial ranking can be regarded as mini-batching.", |
| "cite_spans": [ |
| { |
| "start": 320, |
| "end": 322, |
| "text": "13", |
| "ref_id": null |
| }, |
| { |
| "start": 392, |
| "end": 394, |
| "text": "12", |
| "ref_id": null |
| }, |
| { |
| "start": 702, |
| "end": 704, |
| "text": "13", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 180, |
| "end": 188, |
| "text": "Figure 5", |
| "ref_id": "FIGREF10" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Experiments", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Algorithm 1: Online pairwise ranking aggregation with bounded support. In each iteration, n instances are selected by variance and match quality. We first select top k (= N/n) instances according to the variance, and for each selected instance we choose the other n \u2212 1 instances to be compared based on match quality. This approach has been used in the NLP community in tasks such as for assessing machine translation quality (Bojar et al., 2014; Sakaguchi et al., 2014; Bojar et al., 2015 Bojar et al., , 2016 to collect pairwise judgments efficiently. The detailed procedure of iterative parameter updates in the RA and EASL is described in Algorithm 1. As mentioned in Section 4, the main difference between RA and EASL is the update functions (line 7).", |
| "cite_spans": [ |
| { |
| "start": 427, |
| "end": 447, |
| "text": "(Bojar et al., 2014;", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 448, |
| "end": 471, |
| "text": "Sakaguchi et al., 2014;", |
| "ref_id": "BIBREF27" |
| }, |
| { |
| "start": 472, |
| "end": 490, |
| "text": "Bojar et al., 2015", |
| "ref_id": "BIBREF7" |
| }, |
| { |
| "start": 491, |
| "end": 511, |
| "text": "Bojar et al., , 2016", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experiments", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Input: Instances {S N 1 } Output: Updated instances {S N 1 } / * Initialize params * / 1 (\u03b1i, \u03b2i)\u2208S = (\u03b1 init i , \u03b2 init i ) / *", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experiments", |
| "sec_num": "5" |
| }, |
| { |
| "text": "Model hyper-parameters in RA and EASL are set as follows; each instance is initialized as \u03b1 init i = 1.0, \u03b2 init i = 1.0. The skill chain parameter \u03b3 and tie-rate parameter are set to be 0.1. 14", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Experiments", |
| "sec_num": "5" |
| }, |
| { |
| "text": "In the first experiment, we compare the three scalar annotation approaches on lexical frequency inference, in which we ask annotators to judge frequency (from very rare to very frequent) of verbs that are randomly selected from the corpus of Contemporary American English (COCA) 15 . We include this task for evaluation owing to its nonsubjective ground truth (relative corpus frequency) which can be used as an oracle response we would like to maximally correlate with. 16 We randomly select 150 verbs from COCA; the log frequency (log 10 ) is regarded as the oracle. In DA, each instance is annotated by 10 different annotators. 17 In the RA and EASL, annotators are asked to rank/score five verbs for each HIT (n = 5). Each iteration contains 20 HITS and we run 10 iterations, which means that total number of annotations is the same in DA, RA, and EASL. 18 Figure 6 presents Spearman's and Pearson's correlations, indicating how accurately each annotation method obtains scalar values for each instance. Overall, in all three methods, the correlations are increased as more annotations are made. The result also shows that RA and EASL ap-15 https://www.wordfrequency.info/ 16 Lexical frequency inference is an established experiment in (computational) psycholinguistics. E.g., human behavioral measures have been compared with predictability and bias in various corpora (Balota et al., 1999; Fine et al., 2014) .", |
| "cite_spans": [ |
| { |
| "start": 471, |
| "end": 473, |
| "text": "16", |
| "ref_id": null |
| }, |
| { |
| "start": 631, |
| "end": 633, |
| "text": "17", |
| "ref_id": null |
| }, |
| { |
| "start": 858, |
| "end": 860, |
| "text": "18", |
| "ref_id": null |
| }, |
| { |
| "start": 1374, |
| "end": 1395, |
| "text": "(Balota et al., 1999;", |
| "ref_id": "BIBREF0" |
| }, |
| { |
| "start": 1396, |
| "end": 1414, |
| "text": "Fine et al., 2014)", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Lexical Frequency Inference", |
| "sec_num": "5.1" |
| }, |
| { |
| "text": "17 The agreement rate in DA (10 annotators) is 0.37 in Spearman's \u03c1. Considering the difficulty of ranking 150 verbs, this rate is fair.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Lexical Frequency Inference", |
| "sec_num": "5.1" |
| }, |
| { |
| "text": "18 Technically, the number of annotations per instance vary in RA and EASL, because they choose instances by match quality at each iteration. proaches achieve high correlation more efficiently than DA. The gain of efficiency from DA to EASL is about 50%; two iterations in EASL achieves a close Spearman's \u03c1 to three annotators in DA. Figure 7 presents the results of the final scalar values that each method annotated. The distribution of the histograms shows that overall three methods successfully capture the latent distribution of scalar values in the data. Figure 8 shows a dynamic change of match quality. In the beginning (iteration 0), all the instances are equally competitive because we have no information about them and initialize them with the same parameters. As iterations go on, the instances along the diagonal have higher match quality, indicating that competitive matches are more likely to be selected for a next iteration. In other words, match-quality helps to choose informative pairs to compare at each iteration, which reduces the number of less informative annotations (e.g., a pairwise comparison between the highest and lowest instances). ", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 335, |
| "end": 343, |
| "text": "Figure 7", |
| "ref_id": "FIGREF13" |
| }, |
| { |
| "start": 563, |
| "end": 571, |
| "text": "Figure 8", |
| "ref_id": "FIGREF14" |
| } |
| ], |
| "eq_spans": [], |
| "section": "Lexical Frequency Inference", |
| "sec_num": "5.1" |
| }, |
| { |
| "text": "In the second experiment, we compare the three scalar annotation methods for political spectrum inference. We use the Fine-Grained Political Statements dataset (Bamman and Smith, 2015) , which consists of 766 propositions collected from political blog comments, paired with judgments about the political belief of the statement (or the person who would say it) based on the five ordinals: very conservative (-2), slightly conservative (-1), neutral (0), slightly liberal (1), and very liberal (2). We normalize the ordinal scores between 0 and 1. The dataset contains the mean scores by aggregating 7 annotations for each proposition. 19 We randomly choose 150 political propositions from the dataset (see the histogram in Figure 10 oracle). 20 The experimental setting (i.e., the number of annotations per instance, the number of iterations, and the number of HITS in each iteration) is the same as the lexical frequency inference experiment ( \u00a75.1). Figure 9 shows Spearman's and Pearson's correlations to the oracle by each method. Overall, all the three methods achieve strong correlation above 19 We stress that the oracle here derives from subjective annotations: it does not necessarily reflect the true latent scalar values for each instance. However, in this experiment, we use them as a tentative oracle to compare three scalar annotation methods objectively. 20 The agreement rate in DA (among 10 annotators) is 0.67 in Spearman's \u03c1. This is significantly high, considering the difficulty of ranking 150 instances in order. 23.0 bush kept us safe 10.7 9.6 31.5 9.6 democrats are corrupt 0.0 7.1 29.9 7.4 Table 1 : Example propositions and the scalar political spectrum ranged between 0 (very conservative) and 100 (very liberal) by each approach: direct assessment, online ranking aggregation, and EASL. The dashed lines indicate a split by 5ary ordinal scale. 0.9. We also find that RA and EASL reach high correlation more efficiently than DA as in the lexical frequency inference experiment ( \u00a75.1). The gain of efficiency from DA to EASL is about 50%; 4-way redundant annotation in EASL achieves a close Spearman's \u03c1 to 6-way redundancy in DA. Figure 10 presents the results of the annotated scalar values by each method. The distribution of the histograms shows that DA and EASL successfully fit to the distribution in the oracle, whereas RA converges to a rather narrow range. This is because of the \"lack of distance from bounds\" in RA that is explained in \u00a74. We note that renormalizing the distribution in RA will not address the issue. For instance, when the dataset has only liberal propositions, RA still fails to capture the latent distribution because it looks only at relative distances between instances but not the distance from bounds. Table 1 shows the examples of scalar annotations by each method. Again, we see that RA approach has a narrower range than the oracle, DA, and EASL.", |
| "cite_spans": [ |
| { |
| "start": 160, |
| "end": 184, |
| "text": "(Bamman and Smith, 2015)", |
| "ref_id": "BIBREF1" |
| }, |
| { |
| "start": 635, |
| "end": 637, |
| "text": "19", |
| "ref_id": null |
| }, |
| { |
| "start": 742, |
| "end": 744, |
| "text": "20", |
| "ref_id": null |
| }, |
| { |
| "start": 1099, |
| "end": 1101, |
| "text": "19", |
| "ref_id": null |
| }, |
| { |
| "start": 1370, |
| "end": 1372, |
| "text": "20", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 723, |
| "end": 732, |
| "text": "Figure 10", |
| "ref_id": "FIGREF16" |
| }, |
| { |
| "start": 952, |
| "end": 960, |
| "text": "Figure 9", |
| "ref_id": "FIGREF15" |
| }, |
| { |
| "start": 1615, |
| "end": 1622, |
| "text": "Table 1", |
| "ref_id": null |
| }, |
| { |
| "start": 2158, |
| "end": 2167, |
| "text": "Figure 10", |
| "ref_id": "FIGREF16" |
| }, |
| { |
| "start": 2764, |
| "end": 2771, |
| "text": "Table 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Political Spectrum Inference", |
| "sec_num": "5.2" |
| }, |
| { |
| "text": "In the third experiment, we apply the scalar annotation methods for evaluating machine translation systems. This is different from two previous experiments, because the main purpose is to rank the MT systems (S N 1 ) rather than the adequacy (q) of each MT output for a given source sentence (m). Namely, we want to rank S i by observing q i,m .", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Ranking Machine Translation Systems", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "We use WMT16 German-English translation dataset (Bojar et al., 2016) , which consists of 2,999 test set sentences and the translations from 10 different systems with DA annotation. Each sentence has its adequacy score annotation between 0 and 100, and the average adequacy scores are computed for each system for ranking. In this setting, annotators are asked to judge adequacy of system output(s) with the reference being given. The official scores (made by DA) and ranking in WMT16 are used as the oracle in this experiment.", |
| "cite_spans": [ |
| { |
| "start": 48, |
| "end": 68, |
| "text": "(Bojar et al., 2016)", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Ranking Machine Translation Systems", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "In this experiment, we replicate DA and run EASL to compare the efficiency. We omit RA in this experiment, because it does not necessarily capture the distance from bounds as shown in the previous experiment ( \u00a75.2). In DA, 33,760 translation outputs (3,376 sentences per system in average) are randomly sampled without replacement to make sure that it reaches up to the same result as oracle when the entire data are used.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Ranking Machine Translation Systems", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "In EASL, we assume that adequacy (q) of an MT output by system (S i ) for a given source sentence (m) is drawn from beta distribution: q i,m \u223c B(\u03b1 i , \u03b2 i ). 21 Annotators are asked to judge adequacy of system outputs by scoring 0 and 100. Similarly to the previous experiments ( \u00a7 5.1 and \u00a7 5.2), we use the partial ranking strategy, where we show n = 5 system outputs (for the same source sentence l) to annotate at a time. The procedure of parameter updates is the same as previous experiments (Algorithm 1). We compare the correlations (Spearman's \u03c1) of system ranking with respect to the number of annotations per system, and the result is shown in Figure 11 . As seen in the previous two experiments, EASL achieves higher Spearmans correlation on ranking MT systems with smaller number of annotations than the baseline method (DA), 21 This is the same setting as WMT14, WMT15, and WMT16 (Bojar et al., 2014 (Bojar et al., , 2015 , although they used TrueSkill (Gaussian) instead of EASL to rank systems. Figure 11 : Spearman's correlation on ranking machine translation systems on WMT16 German-English data: direct assessment (DA), and EASL. The shade for each line indicates 95% confidence intervals by bootstrap resampling (running 100 times).", |
| "cite_spans": [ |
| { |
| "start": 158, |
| "end": 160, |
| "text": "21", |
| "ref_id": null |
| }, |
| { |
| "start": 838, |
| "end": 840, |
| "text": "21", |
| "ref_id": null |
| }, |
| { |
| "start": 893, |
| "end": 912, |
| "text": "(Bojar et al., 2014", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 913, |
| "end": 934, |
| "text": "(Bojar et al., , 2015", |
| "ref_id": "BIBREF7" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 654, |
| "end": 663, |
| "text": "Figure 11", |
| "ref_id": null |
| }, |
| { |
| "start": 1010, |
| "end": 1019, |
| "text": "Figure 11", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "Ranking Machine Translation Systems", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "which means EASL is able to collect annotation more efficiently. The result shows that EASL can be applied for efficient system evaluation in addition to data curation.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Ranking Machine Translation Systems", |
| "sec_num": "5.3" |
| }, |
| { |
| "text": "We have presented an efficient, online model to elicit scalar annotations for computational linguistic datasets and system evaluations. The model combines two approaches for scalar annotation: direct assessment and online pairwise ranking aggregation. We conducted three illustrative experiments on lexical frequency inference, political spectrum inference, and ranking machine translation systems. We have shown that our approach, EASL (Efficient Annotation of Scalar Labels), outperforms direct assessment in terms of annotation efficiency and outperforms online ranking aggregation in terms of accurately capturing the latent distributions of scalar values. The significant gains demonstrated suggests EASL as a promising approach for future dataset curation and system evaluation in the community.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusions", |
| "sec_num": "6" |
| }, |
| { |
| "text": "Pronounced as \"easel\".2 We release the code at http://decomp.net/.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "In the rest of the paper, we take DA to mean scalar annotation rather than ordinals.4 E.g., try to imagine your level of calibration to a hypothetical task described as \"On a scale of 1 to 100, label this tweet according to a conservative / liberal political spectrum.\"5 There has been a line of work on relative weighting of annotators, based on their agreement with others(Whitehill et al., 2009;Welinder et al., 2010;Hovy et al., 2013). In this paper, however, we do not perform such annotator weighting.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "The following material is also useful to understand the math behind TrueSkill (http://www.moserware. com/assets/computing-your-skill/The% 20Math%20Behind%20TrueSkill.pdf).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "We may have instead used the mean (E[Si] = \u03b1 i \u03b1 i +\u03b2 i ) of the distribution, where in a beta (\u03b1, \u03b2 > 1) the mean is always closer to 0.5 than the mode, whereas mean and mode are always the same in a Gaussian distribution. The mode was selected owing to better performance in development.10 There may be other potential update (and surprisal) functions such as \u2212 log p, instead of 1 \u2212 p. As in our use of the mode rather than mean as scalar response, we empirically developed our update functions with respect to annotation efficiency observed through experimentation ( \u00a7 5).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "Novikova et al. (2018) recently proposed a similar approach named RankME, which is a variant of DA with comparing multiple instances at a time. It can also be regarded as a batch-learning variant of EASL without probabilistic parameterization.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| }, |
| { |
| "text": "We explored the hyper-parameters \u03b3, in a pilot task.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "", |
| "sec_num": null |
| } |
| ], |
| "back_matter": [ |
| { |
| "text": "We are grateful to Rachel Rudinger, Adam Teichert, Chandler May, Tongfei Chen, Pushpendre Rastogi, and anonymous reviewers for their useful feedback. This work was supported in part by IARPA MATERIAL and DARPA LORELEI. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes. The views and conclusions contained in this publication are those of the authors and should not be interpreted as representing official policies of the U.S. Government.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Acknowledgments", |
| "sec_num": null |
| } |
| ], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "Item-level analyses of lexical decision performance: Results from a mega-study", |
| "authors": [ |
| { |
| "first": "David", |
| "middle": [ |
| "A" |
| ], |
| "last": "Balota", |
| "suffix": "" |
| }, |
| { |
| "first": "Cortese", |
| "middle": [], |
| "last": "Michael", |
| "suffix": "" |
| }, |
| { |
| "first": "J", |
| "middle": [], |
| "last": "", |
| "suffix": "" |
| }, |
| { |
| "first": "Maura", |
| "middle": [], |
| "last": "Pilotti", |
| "suffix": "" |
| } |
| ], |
| "year": 1999, |
| "venue": "Abstracts of the 40th Annual Meeting of the Psychonomics Society", |
| "volume": "44", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "David A. Balota, Cortese Michael J., and Maura Pilotti. 1999. Item-level analyses of lexical decision perfor- mance: Results from a mega-study. In Abstracts of the 40th Annual Meeting of the Psychonomics Soci- ety, page 44, Los Angeles, California. Psychonomic Society.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "Open extraction of fine-grained political statements", |
| "authors": [ |
| { |
| "first": "David", |
| "middle": [], |
| "last": "Bamman", |
| "suffix": "" |
| }, |
| { |
| "first": "Noah", |
| "middle": [ |
| "A" |
| ], |
| "last": "Smith", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "76--85", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "David Bamman and Noah A. Smith. 2015. Open ex- traction of fine-grained political statements. In Pro- ceedings of the 2015 Conference on Empirical Meth- ods in Natural Language Processing, pages 76- 85, Lisbon, Portugal. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "Large-scale speaker ranking from crowdsourced pairwise listener ratings", |
| "authors": [ |
| { |
| "first": "Timo", |
| "middle": [], |
| "last": "Baumann", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Timo Baumann. 2017. Large-scale speaker ranking from crowdsourced pairwise listener ratings.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Findings of the 2014 workshop on statistical machine translation", |
| "authors": [ |
| { |
| "first": "Ondrej", |
| "middle": [], |
| "last": "Bojar", |
| "suffix": "" |
| }, |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Buck", |
| "suffix": "" |
| }, |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Federmann", |
| "suffix": "" |
| }, |
| { |
| "first": "Barry", |
| "middle": [], |
| "last": "Haddow", |
| "suffix": "" |
| }, |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Johannes", |
| "middle": [], |
| "last": "Leveling", |
| "suffix": "" |
| }, |
| { |
| "first": "Christof", |
| "middle": [], |
| "last": "Monz", |
| "suffix": "" |
| }, |
| { |
| "first": "Pavel", |
| "middle": [], |
| "last": "Pecina", |
| "suffix": "" |
| }, |
| { |
| "first": "Matt", |
| "middle": [], |
| "last": "Post", |
| "suffix": "" |
| }, |
| { |
| "first": "Herve", |
| "middle": [], |
| "last": "Saint-Amand", |
| "suffix": "" |
| }, |
| { |
| "first": "Radu", |
| "middle": [], |
| "last": "Soricut", |
| "suffix": "" |
| }, |
| { |
| "first": "Lucia", |
| "middle": [], |
| "last": "Specia", |
| "suffix": "" |
| }, |
| { |
| "first": "Ale\u0161", |
| "middle": [], |
| "last": "Tamchyna", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ondrej Bojar, Christian Buck, Christian Federmann, Barry Haddow, Philipp Koehn, Johannes Leveling, Christof Monz, Pavel Pecina, Matt Post, Herve Saint-Amand, Radu Soricut, Lucia Specia, and Ale\u0161 Tamchyna. 2014. Findings of the 2014 workshop on statistical machine translation.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "Association for Computational Linguistics", |
| "authors": [ |
| { |
| "first": "Ond\u0159ej", |
| "middle": [], |
| "last": "Bojar", |
| "suffix": "" |
| }, |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Buck", |
| "suffix": "" |
| }, |
| { |
| "first": "Chris", |
| "middle": [], |
| "last": "Callison-Burch", |
| "suffix": "" |
| }, |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Federmann", |
| "suffix": "" |
| }, |
| { |
| "first": "Barry", |
| "middle": [], |
| "last": "Haddow", |
| "suffix": "" |
| }, |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Christof", |
| "middle": [], |
| "last": "Monz", |
| "suffix": "" |
| }, |
| { |
| "first": "Matt", |
| "middle": [], |
| "last": "Post", |
| "suffix": "" |
| }, |
| { |
| "first": "Radu", |
| "middle": [], |
| "last": "Soricut", |
| "suffix": "" |
| }, |
| { |
| "first": "Lucia", |
| "middle": [], |
| "last": "Specia", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Proceedings of the Eighth Workshop on Statistical Machine Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "1--44", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ond\u0159ej Bojar, Christian Buck, Chris Callison-Burch, Christian Federmann, Barry Haddow, Philipp Koehn, Christof Monz, Matt Post, Radu Soricut, and Lucia Specia. 2013. Findings of the 2013 Work- shop on Statistical Machine Translation. In Pro- ceedings of the Eighth Workshop on Statistical Ma- chine Translation, pages 1-44, Sofia, Bulgaria. As- sociation for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "Findings of the 2017 conference on machine translation (wmt17)", |
| "authors": [ |
| { |
| "first": "Ond\u0159ej", |
| "middle": [], |
| "last": "Bojar", |
| "suffix": "" |
| }, |
| { |
| "first": "Rajen", |
| "middle": [], |
| "last": "Chatterjee", |
| "suffix": "" |
| }, |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Federmann", |
| "suffix": "" |
| }, |
| { |
| "first": "Yvette", |
| "middle": [], |
| "last": "Graham", |
| "suffix": "" |
| }, |
| { |
| "first": "Barry", |
| "middle": [], |
| "last": "Haddow", |
| "suffix": "" |
| }, |
| { |
| "first": "Shujian", |
| "middle": [], |
| "last": "Huang", |
| "suffix": "" |
| }, |
| { |
| "first": "Matthias", |
| "middle": [], |
| "last": "Huck", |
| "suffix": "" |
| }, |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Qun", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Varvara", |
| "middle": [], |
| "last": "Logacheva", |
| "suffix": "" |
| }, |
| { |
| "first": "Christof", |
| "middle": [], |
| "last": "Monz", |
| "suffix": "" |
| }, |
| { |
| "first": "Matteo", |
| "middle": [], |
| "last": "Negri", |
| "suffix": "" |
| }, |
| { |
| "first": "Matt", |
| "middle": [], |
| "last": "Post", |
| "suffix": "" |
| }, |
| { |
| "first": "Raphael", |
| "middle": [], |
| "last": "Rubino", |
| "suffix": "" |
| }, |
| { |
| "first": "Lucia", |
| "middle": [], |
| "last": "Specia", |
| "suffix": "" |
| }, |
| { |
| "first": "Marco", |
| "middle": [], |
| "last": "Turchi", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Proceedings of the Second Conference on Machine Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "169--214", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ond\u0159ej Bojar, Rajen Chatterjee, Christian Federmann, Yvette Graham, Barry Haddow, Shujian Huang, Matthias Huck, Philipp Koehn, Qun Liu, Varvara Logacheva, Christof Monz, Matteo Negri, Matt Post, Raphael Rubino, Lucia Specia, and Marco Turchi. 2017. Findings of the 2017 conference on machine translation (wmt17). In Proceedings of the Second Conference on Machine Translation, pages 169-214, Copenhagen, Denmark. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Findings of the 2016 conference on machine translation", |
| "authors": [ |
| { |
| "first": "Ond\u0159ej", |
| "middle": [], |
| "last": "Bojar", |
| "suffix": "" |
| }, |
| { |
| "first": "Rajen", |
| "middle": [], |
| "last": "Chatterjee", |
| "suffix": "" |
| }, |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Federmann", |
| "suffix": "" |
| }, |
| { |
| "first": "Yvette", |
| "middle": [], |
| "last": "Graham", |
| "suffix": "" |
| }, |
| { |
| "first": "Barry", |
| "middle": [], |
| "last": "Haddow", |
| "suffix": "" |
| }, |
| { |
| "first": "Matthias", |
| "middle": [], |
| "last": "Huck", |
| "suffix": "" |
| }, |
| { |
| "first": "Antonio", |
| "middle": [ |
| "Jimeno" |
| ], |
| "last": "Yepes", |
| "suffix": "" |
| }, |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Varvara", |
| "middle": [], |
| "last": "Logacheva", |
| "suffix": "" |
| }, |
| { |
| "first": "Christof", |
| "middle": [], |
| "last": "Monz", |
| "suffix": "" |
| }, |
| { |
| "first": "Matteo", |
| "middle": [], |
| "last": "Negri", |
| "suffix": "" |
| }, |
| { |
| "first": "Aurelie", |
| "middle": [], |
| "last": "Neveol", |
| "suffix": "" |
| }, |
| { |
| "first": "Mariana", |
| "middle": [], |
| "last": "Neves", |
| "suffix": "" |
| }, |
| { |
| "first": "Martin", |
| "middle": [], |
| "last": "Popel", |
| "suffix": "" |
| }, |
| { |
| "first": "Matt", |
| "middle": [], |
| "last": "Post", |
| "suffix": "" |
| }, |
| { |
| "first": "Raphael", |
| "middle": [], |
| "last": "Rubino", |
| "suffix": "" |
| }, |
| { |
| "first": "Carolina", |
| "middle": [], |
| "last": "Scarton", |
| "suffix": "" |
| }, |
| { |
| "first": "Lucia", |
| "middle": [], |
| "last": "Specia", |
| "suffix": "" |
| }, |
| { |
| "first": "Marco", |
| "middle": [], |
| "last": "Turchi", |
| "suffix": "" |
| }, |
| { |
| "first": "Karin", |
| "middle": [], |
| "last": "Verspoor", |
| "suffix": "" |
| }, |
| { |
| "first": "Marcos", |
| "middle": [], |
| "last": "Zampieri", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Proceedings of the First Conference on Machine Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "131--198", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ond\u0159ej Bojar, Rajen Chatterjee, Christian Federmann, Yvette Graham, Barry Haddow, Matthias Huck, Antonio Jimeno Yepes, Philipp Koehn, Varvara Logacheva, Christof Monz, Matteo Negri, Aure- lie Neveol, Mariana Neves, Martin Popel, Matt Post, Raphael Rubino, Carolina Scarton, Lucia Spe- cia, Marco Turchi, Karin Verspoor, and Marcos Zampieri. 2016. Findings of the 2016 conference on machine translation. In Proceedings of the First Conference on Machine Translation, pages 131- 198, Berlin, Germany. Association for Computa- tional Linguistics.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Findings of the 2015 workshop on statistical machine translation", |
| "authors": [ |
| { |
| "first": "Ond\u0159ej", |
| "middle": [], |
| "last": "Bojar", |
| "suffix": "" |
| }, |
| { |
| "first": "Rajen", |
| "middle": [], |
| "last": "Chatterjee", |
| "suffix": "" |
| }, |
| { |
| "first": "Christian", |
| "middle": [], |
| "last": "Federmann", |
| "suffix": "" |
| }, |
| { |
| "first": "Barry", |
| "middle": [], |
| "last": "Haddow", |
| "suffix": "" |
| }, |
| { |
| "first": "Matthias", |
| "middle": [], |
| "last": "Huck", |
| "suffix": "" |
| }, |
| { |
| "first": "Chris", |
| "middle": [], |
| "last": "Hokamp", |
| "suffix": "" |
| }, |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Varvara", |
| "middle": [], |
| "last": "Logacheva", |
| "suffix": "" |
| }, |
| { |
| "first": "Christof", |
| "middle": [], |
| "last": "Monz", |
| "suffix": "" |
| }, |
| { |
| "first": "Matteo", |
| "middle": [], |
| "last": "Negri", |
| "suffix": "" |
| }, |
| { |
| "first": "Matt", |
| "middle": [], |
| "last": "Post", |
| "suffix": "" |
| }, |
| { |
| "first": "Carolina", |
| "middle": [], |
| "last": "Scarton", |
| "suffix": "" |
| }, |
| { |
| "first": "Lucia", |
| "middle": [], |
| "last": "Specia", |
| "suffix": "" |
| }, |
| { |
| "first": "Marco", |
| "middle": [], |
| "last": "Turchi", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ond\u0159ej Bojar, Rajen Chatterjee, Christian Federmann, Barry Haddow, Matthias Huck, Chris Hokamp, Philipp Koehn, Varvara Logacheva, Christof Monz, Matteo Negri, Matt Post, Carolina Scarton, Lucia Specia, and Marco Turchi. 2015. Findings of the 2015 workshop on statistical machine translation.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "Proceedings of the Tenth Workshop on Statistical Machine Translation", |
| "authors": [], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "1--46", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "In Proceedings of the Tenth Workshop on Statistical Machine Translation, pages 1-46, Lisbon, Portugal. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "Rank analysis of incomplete block designs: I. the method of paired comparisons", |
| "authors": [ |
| { |
| "first": "Allan", |
| "middle": [], |
| "last": "Ralph", |
| "suffix": "" |
| }, |
| { |
| "first": "Milton", |
| "middle": [ |
| "E" |
| ], |
| "last": "Bradley", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Terry", |
| "suffix": "" |
| } |
| ], |
| "year": 1952, |
| "venue": "Biometrika", |
| "volume": "39", |
| "issue": "3/4", |
| "pages": "324--345", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ralph Allan Bradley and Milton E. Terry. 1952. Rank analysis of incomplete block designs: I. the method of paired comparisons. Biometrika, 39(3/4):324- 345.", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Findings of the 2012 workshop on statistical machine translation", |
| "authors": [ |
| { |
| "first": "Chris", |
| "middle": [], |
| "last": "Callison-Burch", |
| "suffix": "" |
| }, |
| { |
| "first": "Philipp", |
| "middle": [], |
| "last": "Koehn", |
| "suffix": "" |
| }, |
| { |
| "first": "Christof", |
| "middle": [], |
| "last": "Monz", |
| "suffix": "" |
| }, |
| { |
| "first": "Matt", |
| "middle": [], |
| "last": "Post", |
| "suffix": "" |
| }, |
| { |
| "first": "Radu", |
| "middle": [], |
| "last": "Soricut", |
| "suffix": "" |
| }, |
| { |
| "first": "Lucia", |
| "middle": [], |
| "last": "Specia", |
| "suffix": "" |
| } |
| ], |
| "year": 2012, |
| "venue": "Proceedings of the Seventh Workshop on Statistical Machine Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "10--51", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Chris Callison-Burch, Philipp Koehn, Christof Monz, Matt Post, Radu Soricut, and Lucia Specia. 2012. Findings of the 2012 workshop on statistical ma- chine translation. In Proceedings of the Seventh Workshop on Statistical Machine Translation, pages 10-51, Montr\u00e9al, Canada. Association for Compu- tational Linguistics.", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "The rating of chessplayers, past and present", |
| "authors": [ |
| { |
| "first": "Arpad", |
| "middle": [ |
| "E" |
| ], |
| "last": "Elo", |
| "suffix": "" |
| } |
| ], |
| "year": 1978, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Arpad E. Elo. 1978. The rating of chessplayers, past and present. Arco Pub.", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Biases in predicting the human language model", |
| "authors": [ |
| { |
| "first": "Alex", |
| "middle": [ |
| "B" |
| ], |
| "last": "Fine", |
| "suffix": "" |
| }, |
| { |
| "first": "Austin", |
| "middle": [ |
| "F" |
| ], |
| "last": "Frank", |
| "suffix": "" |
| }, |
| { |
| "first": "T", |
| "middle": [ |
| "Florian" |
| ], |
| "last": "Jaeger", |
| "suffix": "" |
| }, |
| { |
| "first": "Benjamin", |
| "middle": [], |
| "last": "Van Durme", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics", |
| "volume": "2", |
| "issue": "", |
| "pages": "7--12", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Alex B. Fine, Austin F. Frank, T. Florian Jaeger, and Benjamin Van Durme. 2014. Biases in predicting the human language model. In Proceedings of the 52nd Annual Meeting of the Association for Compu- tational Linguistics (Volume 2: Short Papers), pages 7-12, Baltimore, Maryland. Association for Compu- tational Linguistics.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Continuous measurement scales in human evaluation of machine translation", |
| "authors": [ |
| { |
| "first": "Yvette", |
| "middle": [], |
| "last": "Graham", |
| "suffix": "" |
| }, |
| { |
| "first": "Timothy", |
| "middle": [], |
| "last": "Baldwin", |
| "suffix": "" |
| }, |
| { |
| "first": "Alistair", |
| "middle": [], |
| "last": "Moffat", |
| "suffix": "" |
| }, |
| { |
| "first": "Justin", |
| "middle": [], |
| "last": "Zobel", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Proceedings of the 7th Linguistic Annotation Workshop and Interoperability with Discourse", |
| "volume": "", |
| "issue": "", |
| "pages": "33--41", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yvette Graham, Timothy Baldwin, Alistair Moffat, and Justin Zobel. 2013. Continuous measurement scales in human evaluation of machine translation. In Pro- ceedings of the 7th Linguistic Annotation Workshop and Interoperability with Discourse, pages 33-41, Sofia, Bulgaria. Association for Computational Lin- guistics.", |
| "links": null |
| }, |
| "BIBREF14": { |
| "ref_id": "b14", |
| "title": "Is machine translation getting better over time?", |
| "authors": [ |
| { |
| "first": "Yvette", |
| "middle": [], |
| "last": "Graham", |
| "suffix": "" |
| }, |
| { |
| "first": "Timothy", |
| "middle": [], |
| "last": "Baldwin", |
| "suffix": "" |
| }, |
| { |
| "first": "Alistair", |
| "middle": [], |
| "last": "Moffat", |
| "suffix": "" |
| }, |
| { |
| "first": "Justin", |
| "middle": [], |
| "last": "Zobel", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "443--451", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Yvette Graham, Timothy Baldwin, Alistair Moffat, and Justin Zobel. 2014. Is machine translation getting better over time? In Proceedings of the 14th Confer- ence of the European Chapter of the Association for Computational Linguistics, pages 443-451, Gothen- burg, Sweden. Association for Computational Lin- guistics.", |
| "links": null |
| }, |
| "BIBREF15": { |
| "ref_id": "b15", |
| "title": "TrueSkill TM : A Bayesian Skill Rating System", |
| "authors": [ |
| { |
| "first": "Ralf", |
| "middle": [], |
| "last": "Herbrich", |
| "suffix": "" |
| }, |
| { |
| "first": "Tom", |
| "middle": [], |
| "last": "Minka", |
| "suffix": "" |
| }, |
| { |
| "first": "Thore", |
| "middle": [], |
| "last": "Graepel", |
| "suffix": "" |
| } |
| ], |
| "year": 2006, |
| "venue": "Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems", |
| "volume": "", |
| "issue": "", |
| "pages": "569--576", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ralf Herbrich, Tom Minka, and Thore Graepel. 2006. TrueSkill TM : A Bayesian Skill Rating System. In Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems, pages 569- 576, Vancouver, British Columbia, Canada.", |
| "links": null |
| }, |
| "BIBREF16": { |
| "ref_id": "b16", |
| "title": "Learning whom to trust with mace", |
| "authors": [ |
| { |
| "first": "Dirk", |
| "middle": [], |
| "last": "Hovy", |
| "suffix": "" |
| }, |
| { |
| "first": "Taylor", |
| "middle": [], |
| "last": "Berg-Kirkpatrick", |
| "suffix": "" |
| }, |
| { |
| "first": "Ashish", |
| "middle": [], |
| "last": "Vaswani", |
| "suffix": "" |
| }, |
| { |
| "first": "Eduard", |
| "middle": [], |
| "last": "Hovy", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies", |
| "volume": "", |
| "issue": "", |
| "pages": "1120--1130", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Dirk Hovy, Taylor Berg-Kirkpatrick, Ashish Vaswani, and Eduard Hovy. 2013. Learning whom to trust with mace. In Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 1120-1130, Atlanta, Georgia. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF17": { |
| "ref_id": "b17", |
| "title": "Event detection and factuality assessment with non-expert supervision", |
| "authors": [ |
| { |
| "first": "Kenton", |
| "middle": [], |
| "last": "Lee", |
| "suffix": "" |
| }, |
| { |
| "first": "Yoav", |
| "middle": [], |
| "last": "Artzi", |
| "suffix": "" |
| }, |
| { |
| "first": "Yejin", |
| "middle": [], |
| "last": "Choi", |
| "suffix": "" |
| }, |
| { |
| "first": "Luke", |
| "middle": [], |
| "last": "Zettlemoyer", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "1643--1648", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Kenton Lee, Yoav Artzi, Yejin Choi, and Luke Zettle- moyer. 2015. Event detection and factuality as- sessment with non-expert supervision. In Proceed- ings of the 2015 Conference on Empirical Meth- ods in Natural Language Processing, pages 1643- 1648, Lisbon, Portugal. Association for Computa- tional Linguistics.", |
| "links": null |
| }, |
| "BIBREF18": { |
| "ref_id": "b18", |
| "title": "A technique for the measurement of attitudes. Archives of psychology", |
| "authors": [ |
| { |
| "first": "Rensis", |
| "middle": [], |
| "last": "Likert", |
| "suffix": "" |
| } |
| ], |
| "year": 1932, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Rensis Likert. 1932. A technique for the measurement of attitudes. Archives of psychology.", |
| "links": null |
| }, |
| "BIBREF19": { |
| "ref_id": "b19", |
| "title": "Question difficulty estimation in community question answering services", |
| "authors": [ |
| { |
| "first": "Jing", |
| "middle": [], |
| "last": "Liu", |
| "suffix": "" |
| }, |
| { |
| "first": "Quan", |
| "middle": [], |
| "last": "Wang", |
| "suffix": "" |
| }, |
| { |
| "first": "Chin-Yew", |
| "middle": [], |
| "last": "Lin", |
| "suffix": "" |
| }, |
| { |
| "first": "Hsiao-Wuen", |
| "middle": [], |
| "last": "Hon", |
| "suffix": "" |
| } |
| ], |
| "year": 2013, |
| "venue": "Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing", |
| "volume": "", |
| "issue": "", |
| "pages": "85--90", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jing Liu, Quan Wang, Chin-Yew Lin, and Hsiao-Wuen Hon. 2013. Question difficulty estimation in com- munity question answering services. In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, pages 85-90, Seattle, Washington, USA. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF20": { |
| "ref_id": "b20", |
| "title": "A sick cure for the evaluation of compositional distributional semantic models", |
| "authors": [ |
| { |
| "first": "Marco", |
| "middle": [], |
| "last": "Marelli", |
| "suffix": "" |
| }, |
| { |
| "first": "Stefano", |
| "middle": [], |
| "last": "Menini", |
| "suffix": "" |
| }, |
| { |
| "first": "Marco", |
| "middle": [], |
| "last": "Baroni", |
| "suffix": "" |
| }, |
| { |
| "first": "Luisa", |
| "middle": [], |
| "last": "Bentivogli", |
| "suffix": "" |
| }, |
| { |
| "first": "Raffaella", |
| "middle": [], |
| "last": "Bernardi", |
| "suffix": "" |
| }, |
| { |
| "first": "Roberto", |
| "middle": [], |
| "last": "Zamparelli", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Proceedings of the Ninth International Conference on Language Resources and Evaluation (LREC-2014). European Language Resources Association (ELRA)", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Marco Marelli, Stefano Menini, Marco Baroni, Luisa Bentivogli, Raffaella bernardi, and Roberto Zampar- elli. 2014. A sick cure for the evaluation of compo- sitional distributional semantic models. In Proceed- ings of the Ninth International Conference on Lan- guage Resources and Evaluation (LREC-2014). Eu- ropean Language Resources Association (ELRA).", |
| "links": null |
| }, |
| "BIBREF21": { |
| "ref_id": "b21", |
| "title": "RankME: Reliable Human Ratings for Natural Language Generation", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Novikova", |
| "suffix": "" |
| }, |
| { |
| "first": "O", |
| "middle": [], |
| "last": "Du\u0161ek", |
| "suffix": "" |
| }, |
| { |
| "first": "V", |
| "middle": [], |
| "last": "Rieser", |
| "suffix": "" |
| } |
| ], |
| "year": 2018, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "J. Novikova, O. Du\u0161ek, and V. Rieser. 2018. RankME: Reliable Human Ratings for Natural Language Gen- eration. ArXiv e-prints.", |
| "links": null |
| }, |
| "BIBREF22": { |
| "ref_id": "b22", |
| "title": "From tweets to polls: Linking text sentiment to public opinion time series", |
| "authors": [ |
| { |
| "first": "O'", |
| "middle": [], |
| "last": "Brendan", |
| "suffix": "" |
| }, |
| { |
| "first": "Ramnath", |
| "middle": [], |
| "last": "Connor", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Balasubramanyan", |
| "suffix": "" |
| }, |
| { |
| "first": "Noah A", |
| "middle": [], |
| "last": "Bryan R Routledge", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Smith", |
| "suffix": "" |
| } |
| ], |
| "year": 2010, |
| "venue": "", |
| "volume": "ICWSM", |
| "issue": "", |
| "pages": "1--2", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Brendan O'Connor, Ramnath Balasubramanyan, Bryan R Routledge, and Noah A Smith. 2010. From tweets to polls: Linking text sentiment to public opinion time series. ICWSM, 11(122-129):1-2.", |
| "links": null |
| }, |
| "BIBREF23": { |
| "ref_id": "b23", |
| "title": "Thumbs up?: sentiment classification using machine learning techniques", |
| "authors": [ |
| { |
| "first": "Bo", |
| "middle": [], |
| "last": "Pang", |
| "suffix": "" |
| }, |
| { |
| "first": "Lillian", |
| "middle": [], |
| "last": "Lee", |
| "suffix": "" |
| }, |
| { |
| "first": "Shivakumar", |
| "middle": [], |
| "last": "Vaithyanathan", |
| "suffix": "" |
| } |
| ], |
| "year": 2002, |
| "venue": "Proceedings of the ACL-02 conference on Empirical methods in natural language processing", |
| "volume": "10", |
| "issue": "", |
| "pages": "79--86", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Bo Pang, Lillian Lee, and Shivakumar Vaithyanathan. 2002. Thumbs up?: sentiment classification using machine learning techniques. In Proceedings of the ACL-02 conference on Empirical methods in natural language processing-Volume 10, pages 79-86. As- sociation for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF24": { |
| "ref_id": "b24", |
| "title": "Framenet+: Fast paraphrastic tripling of framenet", |
| "authors": [ |
| { |
| "first": "Ellie", |
| "middle": [], |
| "last": "Pavlick", |
| "suffix": "" |
| }, |
| { |
| "first": "Travis", |
| "middle": [], |
| "last": "Wolfe", |
| "suffix": "" |
| }, |
| { |
| "first": "Pushpendre", |
| "middle": [], |
| "last": "Rastogi", |
| "suffix": "" |
| }, |
| { |
| "first": "Chris", |
| "middle": [], |
| "last": "Callison-Burch", |
| "suffix": "" |
| }, |
| { |
| "first": "Mark", |
| "middle": [], |
| "last": "Dredze", |
| "suffix": "" |
| }, |
| { |
| "first": "Benjamin", |
| "middle": [], |
| "last": "Van Durme", |
| "suffix": "" |
| } |
| ], |
| "year": 2015, |
| "venue": "Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing", |
| "volume": "2", |
| "issue": "", |
| "pages": "408--413", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Ellie Pavlick, Travis Wolfe, Pushpendre Rastogi, Chris Callison-Burch, Mark Dredze, and Benjamin Van Durme. 2015. Framenet+: Fast paraphrastic tripling of framenet. In Proceedings of the 53rd An- nual Meeting of the Association for Computational Linguistics and the 7th International Joint Confer- ence on Natural Language Processing (Volume 2: Short Papers), pages 408-413, Beijing, China. As- sociation for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF25": { |
| "ref_id": "b25", |
| "title": "Ties in pairedcomparison experiments: A generalization of the bradley-terry model", |
| "authors": [ |
| { |
| "first": "P", |
| "middle": [ |
| "V" |
| ], |
| "last": "Rao", |
| "suffix": "" |
| }, |
| { |
| "first": "L", |
| "middle": [ |
| "L" |
| ], |
| "last": "Kupper", |
| "suffix": "" |
| } |
| ], |
| "year": 1967, |
| "venue": "Journal of the American Statistical Association", |
| "volume": "62", |
| "issue": "317", |
| "pages": "194--204", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "P. V. Rao and L. L. Kupper. 1967. Ties in paired- comparison experiments: A generalization of the bradley-terry model. Journal of the American Sta- tistical Association, 62(317):194-204.", |
| "links": null |
| }, |
| "BIBREF26": { |
| "ref_id": "b26", |
| "title": "Reassessing the goals of grammatical error correction: Fluency instead of grammaticality", |
| "authors": [ |
| { |
| "first": "Keisuke", |
| "middle": [], |
| "last": "Sakaguchi", |
| "suffix": "" |
| }, |
| { |
| "first": "Courtney", |
| "middle": [], |
| "last": "Napoles", |
| "suffix": "" |
| }, |
| { |
| "first": "Matt", |
| "middle": [], |
| "last": "Post", |
| "suffix": "" |
| }, |
| { |
| "first": "Joel", |
| "middle": [], |
| "last": "Tetreault", |
| "suffix": "" |
| } |
| ], |
| "year": 2016, |
| "venue": "Transactions of the Association for Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Keisuke Sakaguchi, Courtney Napoles, Matt Post, and Joel Tetreault. 2016. Reassessing the goals of gram- matical error correction: Fluency instead of gram- maticality. Transactions of the Association for Com- putational Linguistics, 4.", |
| "links": null |
| }, |
| "BIBREF27": { |
| "ref_id": "b27", |
| "title": "Efficient elicitation of annotations for human evaluation of machine translation", |
| "authors": [ |
| { |
| "first": "Keisuke", |
| "middle": [], |
| "last": "Sakaguchi", |
| "suffix": "" |
| }, |
| { |
| "first": "Matt", |
| "middle": [], |
| "last": "Post", |
| "suffix": "" |
| }, |
| { |
| "first": "Benjamin", |
| "middle": [], |
| "last": "Van Durme", |
| "suffix": "" |
| } |
| ], |
| "year": 2014, |
| "venue": "Proceedings of the Ninth Workshop on Statistical Machine Translation", |
| "volume": "", |
| "issue": "", |
| "pages": "1--11", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Keisuke Sakaguchi, Matt Post, and Benjamin Van Durme. 2014. Efficient elicitation of annota- tions for human evaluation of machine translation. In Proceedings of the Ninth Workshop on Statistical Machine Translation, pages 1-11, Baltimore, Maryland, USA. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF28": { |
| "ref_id": "b28", |
| "title": "Active learning with real annotation costs", |
| "authors": [ |
| { |
| "first": "Burr", |
| "middle": [], |
| "last": "Settles", |
| "suffix": "" |
| }, |
| { |
| "first": "Mark", |
| "middle": [], |
| "last": "Craven", |
| "suffix": "" |
| }, |
| { |
| "first": "Lewis", |
| "middle": [], |
| "last": "Friedland", |
| "suffix": "" |
| } |
| ], |
| "year": 2008, |
| "venue": "Proceedings of the NIPS workshop on cost-sensitive learning", |
| "volume": "", |
| "issue": "", |
| "pages": "1--10", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Burr Settles, Mark Craven, and Lewis Friedland. 2008. Active learning with real annotation costs. In Pro- ceedings of the NIPS workshop on cost-sensitive learning, pages 1-10.", |
| "links": null |
| }, |
| "BIBREF29": { |
| "ref_id": "b29", |
| "title": "On the theory of scales of measurement", |
| "authors": [ |
| { |
| "first": "S", |
| "middle": [ |
| "S" |
| ], |
| "last": "Stevens", |
| "suffix": "" |
| } |
| ], |
| "year": 1946, |
| "venue": "Science", |
| "volume": "103", |
| "issue": "", |
| "pages": "677--680", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "S. S. Stevens. 1946. On the theory of scales of mea- surement. Science, 103(2684):677-680.", |
| "links": null |
| }, |
| "BIBREF30": { |
| "ref_id": "b30", |
| "title": "The method of paired comparisons for social values", |
| "authors": [ |
| { |
| "first": "", |
| "middle": [], |
| "last": "Louis L Thurstone", |
| "suffix": "" |
| } |
| ], |
| "year": 1927, |
| "venue": "The Journal of Abnormal and Social Psychology", |
| "volume": "21", |
| "issue": "4", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Louis L Thurstone. 1927. The method of paired com- parisons for social values. The Journal of Abnormal and Social Psychology, 21(4):384.", |
| "links": null |
| }, |
| "BIBREF31": { |
| "ref_id": "b31", |
| "title": "Thumbs up or thumbs down?: semantic orientation applied to unsupervised classification of reviews", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [], |
| "last": "Peter", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Turney", |
| "suffix": "" |
| } |
| ], |
| "year": 2002, |
| "venue": "Proceedings of the 40th annual meeting on association for computational linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "417--424", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Peter D Turney. 2002. Thumbs up or thumbs down?: semantic orientation applied to unsupervised classi- fication of reviews. In Proceedings of the 40th an- nual meeting on association for computational lin- guistics, pages 417-424. Association for Computa- tional Linguistics.", |
| "links": null |
| }, |
| "BIBREF32": { |
| "ref_id": "b32", |
| "title": "Judgment under uncertainty: Heuristics and biases", |
| "authors": [ |
| { |
| "first": "Amos", |
| "middle": [], |
| "last": "Tversky", |
| "suffix": "" |
| }, |
| { |
| "first": "Daniel", |
| "middle": [], |
| "last": "Kahneman", |
| "suffix": "" |
| } |
| ], |
| "year": 1974, |
| "venue": "Science", |
| "volume": "185", |
| "issue": "4157", |
| "pages": "1124--1131", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Amos Tversky and Daniel Kahneman. 1974. Judgment under uncertainty: Heuristics and biases. Science, 185(4157):1124-1131.", |
| "links": null |
| }, |
| "BIBREF33": { |
| "ref_id": "b33", |
| "title": "The multidimensional wisdom of crowds", |
| "authors": [ |
| { |
| "first": "Peter", |
| "middle": [], |
| "last": "Welinder", |
| "suffix": "" |
| }, |
| { |
| "first": "Steve", |
| "middle": [], |
| "last": "Branson", |
| "suffix": "" |
| }, |
| { |
| "first": "Pietro", |
| "middle": [], |
| "last": "Perona", |
| "suffix": "" |
| }, |
| { |
| "first": "Serge", |
| "middle": [ |
| "J" |
| ], |
| "last": "Belongie", |
| "suffix": "" |
| } |
| ], |
| "year": 2010, |
| "venue": "Advances in neural information processing systems", |
| "volume": "", |
| "issue": "", |
| "pages": "2424--2432", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Peter Welinder, Steve Branson, Pietro Perona, and Serge J Belongie. 2010. The multidimensional wis- dom of crowds. In Advances in neural information processing systems, pages 2424-2432.", |
| "links": null |
| }, |
| "BIBREF34": { |
| "ref_id": "b34", |
| "title": "Whose vote should count more: Optimal integration of labels from labelers of unknown expertise", |
| "authors": [ |
| { |
| "first": "Jacob", |
| "middle": [], |
| "last": "Whitehill", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Ting-Fan", |
| "suffix": "" |
| }, |
| { |
| "first": "Jacob", |
| "middle": [], |
| "last": "Wu", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Bergsma", |
| "suffix": "" |
| }, |
| { |
| "first": "Paul", |
| "middle": [ |
| "L" |
| ], |
| "last": "Javier R Movellan", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Ruvolo", |
| "suffix": "" |
| } |
| ], |
| "year": 2009, |
| "venue": "Advances in neural information processing systems", |
| "volume": "", |
| "issue": "", |
| "pages": "2035--2043", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Jacob Whitehill, Ting-fan Wu, Jacob Bergsma, Javier R Movellan, and Paul L Ruvolo. 2009. Whose vote should count more: Optimal integration of labels from labelers of unknown expertise. In Advances in neural information processing systems, pages 2035- 2043.", |
| "links": null |
| }, |
| "BIBREF35": { |
| "ref_id": "b35", |
| "title": "Development and use of a goldstandard data set for subjectivity classifications", |
| "authors": [ |
| { |
| "first": "Rebecca", |
| "middle": [ |
| "F" |
| ], |
| "last": "Janyce M Wiebe", |
| "suffix": "" |
| }, |
| { |
| "first": "Thomas P O'", |
| "middle": [], |
| "last": "Bruce", |
| "suffix": "" |
| }, |
| { |
| "first": "", |
| "middle": [], |
| "last": "Hara", |
| "suffix": "" |
| } |
| ], |
| "year": 1999, |
| "venue": "Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics", |
| "volume": "", |
| "issue": "", |
| "pages": "246--253", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Janyce M Wiebe, Rebecca F Bruce, and Thomas P O'Hara. 1999. Development and use of a gold- standard data set for subjectivity classifications. In Proceedings of the 37th annual meeting of the As- sociation for Computational Linguistics on Compu- tational Linguistics, pages 246-253. Association for Computational Linguistics.", |
| "links": null |
| }, |
| "BIBREF36": { |
| "ref_id": "b36", |
| "title": "Ordinal common-sense inference", |
| "authors": [ |
| { |
| "first": "Sheng", |
| "middle": [], |
| "last": "Zhang", |
| "suffix": "" |
| }, |
| { |
| "first": "Rachel", |
| "middle": [], |
| "last": "Rudinger", |
| "suffix": "" |
| }, |
| { |
| "first": "Kevin", |
| "middle": [], |
| "last": "Duh", |
| "suffix": "" |
| }, |
| { |
| "first": "Benjamin", |
| "middle": [], |
| "last": "Van Durme", |
| "suffix": "" |
| } |
| ], |
| "year": 2017, |
| "venue": "Transactions of the Association for Computational Linguistics", |
| "volume": "5", |
| "issue": "", |
| "pages": "379--395", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "Sheng Zhang, Rachel Rudinger, Kevin Duh, and Ben- jamin Van Durme. 2017. Ordinal common-sense in- ference. Transactions of the Association for Com- putational Linguistics, 5:379-395.", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF1": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Surprisal of the outcome for \u00b5 and \u03c3 2 ( = 0.5)." |
| }, |
| "FIGREF2": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Surprisal of the outcome for the bounded variant ( = 0.5)." |
| }, |
| "FIGREF3": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "t e x i t s h a 1 _ b a s e 6 4 = \" t + I z 4 L a x b y D v B o P 2 / Z e J b T G g K m E = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 + V 2 g 9 o Q 9 l s J + 3 S z S b s b o Q S + h O 8 e F D E q 7 / I m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9 f 9 d g o b m 1" |
| }, |
| "FIGREF4": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "9 7 M / E / r 5 u a 8 N r P u E x S g 5 I t F o W p I C Y m s 7 / J g C t k R k w s o U x x e y t h I 6 o o M z a d k g 3 B W 3 5 5 l b Q u q p 5 b 9 e 4 v K 7 W b P I 4 i n M A p n I M H V 1 C D O 6 h D E x g M 4 R l e 4 c 0 R z o v z 7 n w s W g t O P n M M f + B 8 / g A p t o 2 0 < / l a t e x i t > s i < l a t e x i t s h a 1 _ b a s e 6 4 = \"S v l f V C V J h D j h E 9 F Q n o Y m 5 8 b F Y w w = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / o h 6 9 L B b B U 0 l E 0 G P R i 8 e K 9 g P a U D b b T b t 0 s w m 7 E 6 G E / g Q v H h T x 6 i / y 5 r 9 x 2 + a g r Q 8 G H u / N M D M v T K U w 6 H n f T m l t f W N z q 7 x d 2 d n d 2 z 9 w D 4 9 a J s k 0 4 0 2 W y E R 3 Q m q 4 F I o 3 U a D k n V R z G o e S t 8 P x 7 c x v P 3 F t R K I e c Z L y I K Z D J S L B K F r p w f R F 3 6 1 6 N W 8 O s k r 8 g l S h Q K P v f v U G C c t i r p B J a k z X 9 1 I M c q p R M M m n l V 5 m e E r Z m A 5 5 1 1 J F Y 2 6 C f H 7 q l J x Z Z U C i R N t S S O b q 7 4 m c x s Z M 4 t B 2 x h R H Z t m b i f 9 5 3 Q y j 6 y A X K s 2 Q K 7 Z Y F G W S Y E J m f 5 O B 0 J y h n F h C m R b 2 V s J G V F O G N p 2 K D c F f f n m V t C 5 q v l f z 7 y + r 9 Z s i j j K c w C m c g w 9 X U I c 7 a E A T G A z h G V 7 h z Z H O i / P u f C x a S 0 4 x c w x / 4 H z + A F j y j d 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 = \" S v l f V C V J h D j h E 9 F Q n o Y m 5 8 b F Y w w = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / o h 6 9 L B b B U 0 l E 0 G P R i 8 e K 9 g P a U D b b T b t 0 s w m 7 E 6 G E / g Q v H h T x 6 i / y 5 r 9 x 2 + a g r Q 8 G H u / N M D M v T K U w 6 H n f T m l t f W N z q 7 x d 2 d n d 2 z 9 w D 4 9 a J s k 0 4 0 2 W y E R 3 Q m q 4 F I o 3 U a D k n V R z G o e S t 8 P x 7 c x v P 3 F t R K I e c Z L y I K Z D J S L B K F r p w f R F 3 6 1 6 N W 8 O s k r 8 g l S h Q K P v f v U G C c t i r p B J a k z X 9 1 I M c q p R M M m n l V 5 m e E r Z m A 5 5 1 1 J F Y 2 6 C f H 7 q l J x Z Z U C i R N t S S O b q 7 4 m c x s Z M 4 t B 2 x h R H Z t m b i f 9 5 3 Q y j 6 y A X K s 2 Q K 7 Z Y F G W S Y E J m f 5 O B 0 J y h n F h C m R b 2 V s J G V F O G N p 2 K D c F f f n m V t C 5 q vl f z 7 y + r 9 Z s i j j K c w C m c g w 9 X U I c 7 a E A T G A z h G V 7 h z Z H O i / P u f C x a S 0 4 x c w x / 4 H z + A F j y j d 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 = \" S v l f V C V J h D j h E 9 F Q n o Y m 5 8 b F Y w w = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / o h 6 9 L B b B U 0 l E 0 G P R i 8 e K 9 g P a U D b b T b t 0 s w m 7 E 6 G E / g Q v H h T x 6 i / y 5 r 9 x 2 + a g r Q 8 G H u / N M D M v T K U w 6 H n f T m l t f W N z q 7 x d 2 d n d 2 z 9 w D 4 9 a J s k 0 4 0 2 W y E R 3 Q m q 4 F I o 3 U a D k n V R z G o e S t 8 P x 7 c x v P 3 F t R K I e c Z L yI K Z D J S L B K F r p w f R F 3 6 1 6 N W 8 O s k r 8 g l S h Q K P v f v U G C c t i r p B J a k z X 9 1 I M c q p R M M m n l V 5 m e E r Z m A 5 5 1 1 J F Y 2 6 C f H 7 q l J x Z Z U C i R N t S S O b q 7 4 m c x s Z M 4 t B 2 x h R H Z t m b i f 9 5 3 Q y j 6 y A X K s 2 Q K 7 Z Y F G W S Y E J m f 5 O B 0 J y h n F h C m R b 2 V s J G V F O G N p 2 K D c F f f n m V t C 5 q vl f z 7 y + r 9 Z s i j j K c w C m c g w 9 X U I c 7 a E A T G A z h G V 7 h z Z H O i / P u f C x a S 0 4 x c w x / 4 H z + A F j y j d 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 = \" S v l f V C V J h D j h E 9 F Q n o Y m 5 8 b F Y w w = \" > A A A B 6 n i c b V B N S 8 N A E J 3 U r 1 q / o h 6 9 L B b B U 0 l E 0 G P R i 8 e K 9 g P a U D b b T b t 0 s w m 7 E 6 G E / g Q v H h T x 6 i / y 5 r 9 x 2 + a g r Q 8 G H u / N M D M v T K U w 6 H n f T m l t f W N z q 7 x d 2 d n d 2 z 9 w D 4 9 a J s k 0 4 0 2 W y E R 3 Q m q 4 F I o 3 U a D k n V R z G o e S t 8 P x 7 c x v P 3 F t R K I e c Z L y I K Z D J S L B K F r p w f R F 3 6 1 6 N W 8 O s k r 8 g l S h Q K P v f v U G C c t i r p B J a k z X 9 1 I M c q p R M M m n l V 5 m e E r Z m A 5 5 1 1 J F Y 2 6 C f H 7 q l J x Z Z U C i R N t S S O b q 7 4 m c x s Z M 4 t B 2 x h R H Z t m b i f 9 5 3 Q y j 6 y A X K s 2 Q K 7 Z Y F G W S Y E J m f 5 O B 0 J y h n F h C m R b 2" |
| }, |
| "FIGREF5": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "c + t e n e X l f p 1 H k c R T u A U z s G D G t T h F h r Q B A Z D e I Z X e H O E 8 + K 8 O x + L 1 o K T z x z D H z i f P 1 p 2 j d Q = < / l a t e x i t > : 0 < l a t e x i t s h a 1 _ b a s e 6 4 = \" D 0F G Q E 6 F B Q J N u S u f y G 9 q k O R f j p 0 = \" > A A A B 6 X i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q H g q e v F Y x X 5 A G 8 p m u 2 m X b j Z h d y K U 0 H / g x Y M i X v 1 H 3 v w 3 b t s c t P X B w O O 9 G W b m B Y k U B l 3 3 2 y m s r W 9 s b h W 3 S z u 7 e / s H 5 c O j l o l T z X i T x T L W n Y A a L o X i T R Q o e S f R n E a B 5 O 1 g f D vz 2 0 9 c G x G r R 5 w k 3 I / o U I l Q M I p W e r h 2 + + W K W 3 X n I K v E y 0 k F c j T 6 5 a / e I G Z p x B U y S Y 3 p e m 6 C f k Y 1 C i b 5 t N R L D U 8 o G 9 M h 7 1 q q a M S N n 8 0 v n Z I z q w x I G G t b C s l c / T 2 R 0 c i Y S R T Y z o j i y C x 7 M / E / r 5 t i e O" |
| }, |
| "FIGREF6": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "w 3 b t s c t P X B w O O 9 G W b m B Y k U B l 3 3 2 y m s r W 9 s b h W 3 S z u 7 e / s H 5c O j l o l T z X i T x T L W n Y A a L o X i T R Q o e S f R n E a B 5 O 1 g f D v z 2 0 9 c G x G r R 5 w k 3 I / o U I l Q M I p We r h 2 + + W K W 3 X n I K v E y 0 k F c j T 6 5 a / e I G Z p x B U y S Y 3 p e m 6 C f k Y 1 C i b 5 t N R L D U 8 o G 9 M h 7 1 q q a M S N n 8 0 v n Z I z q w x I G G t b C s l c / T 2 R 0 c i Y S R T Y z o j i y C x 7 M / E / r 5 t i e O" |
| }, |
| "FIGREF7": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "w 3 b t s c t P X B w O O 9 G W b m B Y k U B l 3 3 2 y m s r W 9 s b h W 3 S z u 7 e / s H 5c O j l o l T z X i T x T L W n Y A a L o X i T R Q o e S f R n E a B 5 O 1 g f D v z 2 0 9 c G x G r R 5 w k 3 I / o U I l Q M I p We r h 2 + + W K W 3 X n I K v E y 0 k F c j T 6 5 a / e I G Z p x B U y S Y 3 p e m 6 C f k Y 1 C i b 5 t N R L D U 8 o G 9 M h 7 1 q q a M S N n 8 0 v n Z I z q w x I G G t b C s l c / T 2 R 0 c i Y S R T Y z o j i y C x 7 M / E / r 5 t i e O" |
| }, |
| "FIGREF8": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "w 3 b t s c t P X B w O O 9 G W b m B Y k U B l 3 3 2 y m s r W 9 s b h W 3 S z u 7 e / s H 5c O j l o l T z X i T x T L W n Y A a L o X i T R Q o e S f R n E a B 5 O 1 g f D v z 2 0 9 c G x G r R 5 w k 3 I / o U I l Q M I p We r h 2 + + W K W 3 X n I K v E y 0 k F c j T 6 5 a / e I G Z p x B U y S Y 3 p e m 6 C f k Y 1 C i b 5 t N R L D U 8 o G 9 M h 7 1 q q a M S N n 8 0 v n Z I z q w x I G G t b C s l c / T 2 R 0 c i Y S R T Y z o j i y C x 7 M / E / r 5 t i e O" |
| }, |
| "FIGREF9": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "3 a z S b s b o Q S + g u 8 e F D E q z / J m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9 f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J Y P Z p q g H 9 G R 5 C F n 1 F i p 6 Q 3 K F b f q L k D W i Z e T C u R o D M p f / W H M 0 g i l Y Y J q 3 f P c x P g ZV Y Y z g b N S P 9 W Y U D a h I + x Z K m m E 2 s 8 W h 8 7 I h V W G J I y V L W n I Q v 0 9 k d F I 6 2 k U 2 M 6 I m r F e 9 e b i f 1 4 v N e G N n 3 G Z p A Y l W y 4 K U 0 F M T O Z f k y F X y I y Y W k K Z 4 v Z W w s Z U U W Z s N i U b g r f 6 8 j p p X 1 U 9 t + o 1 r y v 1 2 z y O I p z B O V y C B z W o w z 0 0 o A U M E J 7 h F d 6 c R + f Fe X c + l q 0 F J 5 8 5 h T 9 w P n 8 A e p 2 M t Q = = < / l a t e x i t > 1 < l a t e x i t s h a 1 _ b a s e 6 4 = \" l 9 e I m v Y c F O K p z E D j i / n 9 j P D e W b 8 = \" > A A A B 6 H i c bV B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 t 2 A 9 o Q 9 l s J + 3 a z S b s b o Q S + g u 8 e F D E q z / J m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9 f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J Y P Z p q g H 9 G R 5 C F n 1 F i p 6 Q 3 K F b f q L k D W i Z e T C u R o D M p f / W H M 0 g i l Y Y J q 3 f P c x P g Z V Y Y z g b N S P 9 W Y U D a h I + x Z K m m E 2 s 8 W h 8 7 I h V W G J I y V L W n I Q v 0 9 k d F I 6 2 k U 2 M 6 I m r F e 9 e b i f 1 4 v N e G N n 3 G Z p A Y l W y 4 K U 0 F M T O Z f k y F X y I y Y W k K Z 4 v Z W w s Z U U W Z s N i U b g r f 6 8 j p p X 1 U 9 t + o 1 r y v 1 2 z y O I p z B O V y C B z W o w z 0 0 o A U M E J 7 h F d 6 c R + f Fe X c + l q 0 F J 5 8 5 h T 9 w P n 8 A e p 2 M t 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 = \" l 9 e I m v Y c F O K p z E D j i / n 9 j P D e W b 8 = \" > A A A B 6 H i c bV B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 t 2 A 9 o Q 9 l s J + 3 a z S b s b o Q S + g u 8 e F D E q z / J m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9 f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y x W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J Y P Z p q g H 9 G R 5 C F n 1 F i p 6 Q 3 K F b f q L k D W i Z e T C u R o D M p f / W H M 0 g i l Y Y J q 3 f P c x P g Z V Y Y z g b N S P 9 W Y U D a h I + x Z K m m E 2 s 8 W h 8 7 I h V W G J I y V L W n I Q v 0 9 k d F I 6 2 k U 2 M 6 I m r F e 9 e b i f 1 4 v N e G N n 3 G Z p A Y l W y 4 K U 0 F M T O Z f k y F X y I y Y W k K Z 4 v Z W w s Z U U W Z s N i U b g r f 6 8 j p p X 1 U 9 t + o 1 r y v 1 2 z y O I p z B O V y C B z W o w z 0 0 o A U M E J 7 h F d 6 c R + f Fe X c + l q 0 F J 5 8 5 h T 9 w P n 8 A e p 2 M t 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 = \" l 9 e I m v Y c F O K p z E D j i / n 9 j P D e W b 8 = \" > A A A B 6 H i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 t 2 A 9 o Q 9 l s J + 3 a z S b s b o Q S + g u 8 e F D E q z / J m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9 f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W yx W M S q G 1 C N g k t s G W 4 E d h O F N A o E d o L J 3 d z v P K H S P J Y P Z p q g H 9 G R 5 C F n 1 F i p 6 Q 3 K F b f q L k D W i Z e T C u R o D M p f / W H M 0 g i l Y Y J q 3 f P c x P g Z V Y Y z g b N S P 9 W Y U D a h I + x Z K m m E 2 s 8 W h 8 7 I h V W G J I y V L W n I Q v 0 9 k d F I 6 2 k U 2 M 6 I m r F e 9 e b i f 1 4 v N e G N n 3 G Z p A Y l W y 4 K U 0 F M T O Z f k y F X y I y Y W k K Z 4 v Z W w s Z U U W Z s N i U b g r f 6 8 j p p X 1 U 9 t + o 1 r y v 1 2 z y O I p z B O V y C B z W o w z 0 0 o A U M E J 7 h F d 6 c R + f Fe X c + l q 0 F J 5 8 5 h T 9 w P n 8 A e p 2 M t 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 = \" l 9 e I m v Y c F O K p z E D j i / n 9 j P D e W b 8 = \" > A A A B 6 H i c b V B N S 8 N A E J 3 U r 1 q / q h 6 9 L B b B U 0 l E q M e i F 4 8 t 2 A 9 o Q 9 l s J + 3 a z S b s b o Q S + g u 8 e F D E q z / J m / / G b Z u D t j 4 Y e L w 3 w 8 y 8 I B F c G 9 f 9 d g o b m 1 v b O 8 X d 0 t 7 + w e F R + f i k r e N U M W y" |
| }, |
| "FIGREF10": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Example of partial ranking with scalars (HITS)" |
| }, |
| "FIGREF11": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "\u2208 S /S do 17 m.append([matchQuality(Si, Sj), j]) 18 p = normalize(m) 19S = sampling n-1 items by p 20 HITS.append([Si,S]) 21 return HITS judgments ( , \u227a, \u2261) as well as scalar values from this format." |
| }, |
| "FIGREF12": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Spearman's (top) and Pearson's (bottom) correlations with three difference methods on lexical frequency inference annotation: direct assessment (DA), online ranking aggregation (RA), and EASL. The shade for each line indicates 95% confidence intervals by bootstrap resampling (running 100 times)." |
| }, |
| "FIGREF13": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Histograms of scalar values on lexical frequency obtained by each annotation scheme (direct assessment (DA), online ranking aggregation (RA), and EASL), and the oracle. The scalar annotations are put into five bins to see the overall distribution. The scalar in the oracle is normalized as log10(frequency(Si)) / max log10(frequency(S))." |
| }, |
| "FIGREF14": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Heatmaps of match quality distribution across the cross-product of instances ordered by the oracle (i.e., log10(frequency))." |
| }, |
| "FIGREF15": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Spearman's (top) and Pearson's (bottom) correlations with three difference methods on political spectrum annotation: direct assessment (DA), online ranking aggregation (RA), and EASL" |
| }, |
| "FIGREF16": { |
| "uris": null, |
| "type_str": "figure", |
| "num": null, |
| "text": "Histograms of scalar values on political spectrum obtained by each annotation scheme (DA, RA, EASL) and the oracle. Scalars are put into five bins to see the overall distribution." |
| } |
| } |
| } |
| } |
