2018
DOI: 10.1080/0952813x.2018.1456793
|View full text |Cite
|
Sign up to set email alerts
|

Adjudication of coreference annotations via answer set optimisation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…Our adjudication tool (see Section 3.5) permits a manual specification of partial coreference chains; however, performing such a manual override was not necessary, as we did not encounter mistakes of the automatic adjudication method. Additional details about the adjudication method and tool have been described by our group Schüller (2018).…”
Section: Semi-automatic Adjudicationmentioning
confidence: 99%
See 1 more Smart Citation
“…Our adjudication tool (see Section 3.5) permits a manual specification of partial coreference chains; however, performing such a manual override was not necessary, as we did not encounter mistakes of the automatic adjudication method. Additional details about the adjudication method and tool have been described by our group Schüller (2018).…”
Section: Semi-automatic Adjudicationmentioning
confidence: 99%
“…Technically, this optimization is performed with the knowledge representation formalism Answer Set Programming (Brewka, Eiter, and Truszczynski, 2011) which yields provably optimal solutions to combinatorial problems in reasonable time. Manual intervention for editing mentions and coreference chains is possible in our tool, details about the file formats and about how to represent the adjudication problem in a way that is efficient enough for practical purposes are described in a separate paper Schüller (2018). In Phase II we performed only automatic adjudication and did not need manual intervention.…”
Section: Toolsmentioning
confidence: 99%