Seminar: Anaphora and coreference resolution: still a hard nut to crack?

Today at 16:15 at the Faculty of Computer and Information Science in the P21 lecture hall, Ruslan Mitkov will lecture about anaphora and coreference resolution. Anaphora and coreference resolution are arguably among the most challenging Natural Language Processing (NLP) tasks. Research in anaphora resolution and coreference resolution has focused almost exclusively on the development and intrinsic evaluation of various algorithms. While publications report positive results, the speaker will show that the replication of some of the best-known algorithms reveals reasons for concern in that the performance is far from ideal and the evaluation is far from transparent.

Anaphora and coreference resolution as tasks are crucial for the operation of NLP systems and should not be regarded in isolation but only in the wider picture of NLP applications. The extrinsic evaluation or the impact of an anaphora or coreference resolution module on a larger NLP system of which they are part, is an under-researched topic and several studies conducted by the speaker, seek to fill in this gap. More specifically, the speaker will discuss whether anaphora and coreference resolution can improve (and if they can, to what extent?) or not the performance of four NLP applications: text summarisation, term extraction, text categorisation and textual entailment.

The presentation will finish with suggested ways forward as to how anaphora and coreference resolution can do better and will outline the latest related research of the author.

SLAIS © 2015    Prijava