Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Emili Sapena"'
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
This work is focused on research in machine learning for coreference resolution. Coreference resolution is a natural language processing task that consists of determining the expressions in a discourse that refer to the same entity. The main contribu
Publikováno v:
Language Resources and Evaluation. 47:661-694
This paper presents an empirical evaluation of coreference resolution that covers several interrelated dimensions. The main goal is to complete the comparative analysis from the SemEval-2010 task on Coreference Resolution in Multiple Languages. To do
Publikováno v:
SEW@NAACL-HLT
This paper presents the task 'Coreference Resolution in Multiple Languages' to be run in SemEval-2010 (5th International Workshop on Semantic Evaluations). This task aims to evaluate and compare automatic coreference resolution systems for three diff
Publikováno v:
Advances in Natural Language Processing ISBN: 9783540852865
GoTAL
GoTAL
This paper presents a method for Entity Disambiguation in Information Extraction from different sources in the web. Once entities and relations between them are extracted, it is needed to determine which ones are referring to the same real-world enti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::afb2a25d41e1418c4abad6024937fe7f
https://doi.org/10.1007/978-3-540-85287-2_41
https://doi.org/10.1007/978-3-540-85287-2_41
Autor:
Francesc Comellas, Emili Sapena
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540332374
EvoWorkshops
EvoWorkshops
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algorithms have been proposed for this problem based on heuristic, geometrica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51e1d8cce793888187775f653b45923a
https://doi.org/10.1007/11732242_25
https://doi.org/10.1007/11732242_25