title: Generalising semantic category disambiguation with large lexical resources for fun and profit.
abstract: BACKGROUND
  Semantic Category Disambiguation (SCD) is the task of assigning the appropriate semantic category to given spans of text from a fixed set of candidate categories, for example Protein to "Fibrin". SCD is relevant to Natural Language Processing tasks such as Named Entity Recognition, coreference resolution and coordination resolution. In this work, we study machine learning-based SCD methods using large lexical resources and approximate string matching, aiming to generalise these methods with regard to domains, lexical resources and the composition of data sets. We specifically consider the applicability of SCD for the purposes of supporting human annotators and acting as a pipeline component for other Natural Language Processing systems.
  
  
  RESULTS
  While previous research has mostly cast SCD purely as a classification task, we consider a task setting that allows for multiple semantic categories to be suggested, aiming to minimise the number of suggestions while maintaining high recall. We argue that this setting reflects aspects which are essential for both a pipeline component and when supporting human annotators. We introduce an SCD method based on a recently introduced machine learning-based system and evaluate it on 15 corpora covering biomedical, clinical and newswire texts and ranging in the number of semantic categories from 2 to 91. With appropriate settings, our system maintains an average recall of 99% while reducing the number of candidate semantic categories on average by 65% over all data sets.
  
  
  CONCLUSIONS
  Machine learning-based SCD using large lexical resources and approximate string matching is sensitive to the selection and granularity of lexical resources, but generalises well to a wide range of text domains and data sets given appropriate resources and parameter settings. By substantially reducing the number of candidate categories while only very rarely excluding the correct one, our method is shown to be applicable to manual annotation support tasks and use as a high-recall component in text processing pipelines. The introduced system and all related resources are freely available for research purposes at: https://github.com/ninjin/simsem.
authors.affiliation: Department of Computer Science, University of Tokyo, Tokyo, Japan.
authors.forename: Pontus
authors.initials: P
authors.lastname: Stenetorp
authors.affiliation: School of Computer Science, University of Manchester, Manchester, UK ; National Centre for Text Mining, University of Manchester, Manchester, UK.
authors.forename: Sampo
authors.initials: S
authors.lastname: Pyysalo
authors.affiliation: School of Computer Science, University of Manchester, Manchester, UK ; National Centre for Text Mining, University of Manchester, Manchester, UK.
authors.forename: Sophia
authors.initials: S
authors.lastname: Ananiadou
authors.affiliation: School of Computer Science, University of Manchester, Manchester, UK ; National Centre for Text Mining, University of Manchester, Manchester, UK ; Microsoft Research Asia, Beijing, People's Republic of China.
authors.forename: Jun'ichi
authors.initials: J
authors.lastname: Tsujii
keywords: Approximate string matching; Domain adaptation; Freebase; Lexical resources; Named entity recognition; Semantic category disambiguation
references.citation: BMC Bioinformatics. 2009 Oct 23;10:349
references.pmid: 19852798
references.citation: BMC Bioinformatics. 2011 Oct 03;12 Suppl 8:S2
references.pmid: 22151901
references.citation: Nucleic Acids Res. 2004 Jan 1;32(Database issue):D267-70
references.pmid: 14681409
references.citation: Nat Genet. 2000 May;25(1):25-9
references.pmid: 10802651
references.citation: J Bioinform Comput Biol. 2010 Feb;8(1):163-79
references.pmid: 20183881
references.citation: BMC Bioinformatics. 2008 Feb 05;9:84
references.pmid: 18251998
references.citation: BMC Bioinformatics. 2010 Feb 11;11:85
references.pmid: 20149233
references.citation: J Am Med Inform Assoc. 2010 Sep-Oct;17(5):514-8
references.pmid: 20819854
references.citation: Bioinformatics. 2009 Nov 15;25(22):2983-91
references.pmid: 19759196
references.citation: BMC Bioinformatics. 2005 Apr 07;6:88
references.pmid: 15817129
references.citation: BMC Bioinformatics. 2009 Jun 15;10:183
references.pmid: 19527520
references.citation: BMC Bioinformatics. 2009 Dec 09;10:403
references.pmid: 19995463
references.citation: Psychol Rev. 1956 Mar;63(2):81-97
references.pmid: 13310704
references.citation: Bioinformatics. 2012 Sep 15;28(18):i575-i581
references.pmid: 22962484
references.citation: BMC Bioinformatics. 2007 Feb 09;8:50
references.pmid: 17291334
references.citation: Nucleic Acids Res. 2003 Jan 1;31(1):345-7
references.pmid: 12520019
references.citation: Nucleic Acids Res. 2005 Jan 1;33(Database issue):D54-8
references.pmid: 15608257
references.citation: J Am Med Inform Assoc. 2009 Mar-Apr;16(2):247-55
references.pmid: 19074302