Adjudication of Coreference Annotations via Answer Set Optimization

Schuller P.

14th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Espoo, Finlandiya, 3 - 06 Temmuz 2017, cilt.10377, ss.343-357 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 10377
  • Doi Numarası: 10.1007/978-3-319-61660-5_31
  • Basıldığı Şehir: Espoo
  • Basıldığı Ülke: Finlandiya
  • Sayfa Sayıları: ss.343-357
  • Marmara Üniversitesi Adresli: Evet

Özet

We describe the first automatic approach for merging coreference annotations obtained from multiple annotators into a single gold standard. Merging is subject to hard constraints (consistency) and optimization criteria (minimal divergence from annotators) and involves an equivalence relation over a large number of elements. We describe two representations of the problem in Answer Set Programming and four objective functions suitable for the task. We provide two structurally different real-world benchmark datasets based on the METU-Sabanci Turkish Treebank, and we report our experiences in using the Gringo, Clasp, and Wasp tools for computing optimal adjudication results on these datasets.