no code implementations • LREC 2012 • Ian Lewin, {\c{S}}enay Kafkas, Dietrich Rebholz-Schuhmann
We define an algorithm for finding centroids, given a set of alternative input annotations and we test the outputs quantitatively and qualitatively.
no code implementations • LREC 2012 • {\c{S}}enay Kafkas, Ian Lewin, David Milward, Erik van Mulligen, Jan Kors, Udo Hahn, Dietrich Rebholz-Schuhmann
These usually lead to implementation of trained solutions (1) for a limited number of semantic entity types and (2) lacking in generalization capability.