Swedish: History of the Swedish Language
https://www.ht.lu.se/en/course/SVEG26/ - 2026-06-07
Filetype
https://www.ht.lu.se/en/course/SVEG26/ - 2026-06-07
https://www.ht.lu.se/en/course/SVEU20/ - 2026-06-07
https://www.sol.lu.se/en/course/SVEG12/HT2026/ - 2026-06-07
https://www.sol.lu.se/en/course/SVEG16/HT2026/ - 2026-06-07
https://www.sol.lu.se/en/course/SVEU20/ - 2026-06-07
https://www.sol.lu.se/en/course/SVEU21/VT2026/ - 2026-06-07
https://www.sol.lu.se/en/course/SVEB15/ - 2026-06-07
https://www.sol.lu.se/en/course/SVEB28/ - 2026-06-07
https://www.sol.lu.se/en/course/SVEG14/ - 2026-06-07
https://www.sol.lu.se/en/course/SVEUF1/ - 2026-06-07
https://www.historiska.lu.se/en/course/HISB02/ - 2026-06-07
https://www.sol.lu.se/en/course/SVEU02/ - 2026-06-07
Coreference is a relationship between two or moreexpressions in a text when these expressions referto the same person or thing. Coreference solving,the identification of sets of coreferring mentionsin a text, is a well-studied problem in the fieldof natural language processing (NLP), the com-putational analysis of text. As an example, con-sider this short text:John drove to Judy’s house.He made heIt is said that coreference is difficult to explain, but easy to comprehend; everyoneknows coreference, they just don’t know that they do. We trained a computer toknow it too! Coreference resolution is the identification of phrases that refer to the same entity in a text. Current techniques to solve coreferences use machine-learning algorithms, which require large annotated data sets. Such annota