Scientific Programming Techniques and Algorithms for Data-Intensive Engineering EnvironmentsView this Special Issue
Research Article | Open Access
Fernando Pech, Alicia Martinez, Hugo Estrada, Yasmin Hernandez, "Semantic Annotation of Unstructured Documents Using Concepts Similarity", Scientific Programming, vol. 2017, Article ID 7831897, 10 pages, 2017. https://doi.org/10.1155/2017/7831897
Semantic Annotation of Unstructured Documents Using Concepts Similarity
There is a large amount of information in the form of unstructured documents which pose challenges in the information storage, search, and retrieval. This situation has given rise to several information search approaches. Some proposals take into account the contextual meaning of the terms specified in the query. Semantic annotation technique can help to retrieve and extract information in unstructured documents. We propose a semantic annotation strategy for unstructured documents as part of a semantic search engine. In this proposal, ontologies are used to determine the context of the entities specified in the query. Our strategy for extracting the context is focused on concepts similarity. Each relevant term of the document is associated with an instance in the ontology. The similarity between each of the explicit relationships is measured through the combination of two types of associations: the association between each pair of concepts and the calculation of the weight of the relationships.
The rapid growth of the web has generated an enormous amount of information in the form of unstructured documents. Search engines have become common and basic tools for users. However, engines still have difficulties in performing searches because search methods are based on keywords, and they do not capture and do not explore the meaning and context of the need of the user. This challenge has drawn attention of several research groups which are interested in solving the issues associated with information storage and search and retrieval of information in this enormous cumulus of data.
On the other hand, the continuous growth of the Semantic Web has motivated the development of knowledge structures on different domains and applications, like Wikipedia , Linked Open Data (LOD) , DBpedia , Freebase , and YAGO , among other applications. Additionally, some ontologies for several domains have been developed, such as Snomed CT  and UMLS  for the medical field and AGROVOC  for the agricultural field. An ontology is a formal representation of knowledge, which plays a very important role in the semantic web because of its capability to express meanings and relationships. Ontologies have been valuable in knowledge extraction technologies, especially in the aggregation of knowledge from unstructured documents. Ontologies are a key component of semantic association, which is the process to formalizing knowledge through the linking of words or phrases of plain text (mentions or named entities) with elements of the ontology (concepts or entities).
The semantic annotation of a document consists in finding mappings between text chunks of a document and the instances or individuals in ontology. The annotation plays an important role in a variety of semantic applications, such as generation of linked data, extraction of open information, alignment of ontologies, and semantic search. Specifically, semantic search allows users to express their information needs in terms of the knowledge base concepts. Unlike traditional keyword-based search, semantic search can make use of semantic relationships in the ontology to accomplish new tasks, such as refining user queries with broader or more specific concepts.
The semantic annotation has been applied in different areas of knowledge. For example, it has been applied in biological systems for the identification of biomedical entities such as genes, proteins, and their relationships; also, it has been applied in news analysis for identification of people, organizations, and places.
At the present, semantic annotation strategies are carried out without regard to context [9–11]; these works do not analyze the meaning or semantics of the terms. Generally, authors assume that lexicons are enough to express the meaning of the terms in a document. However, to a large degree, the semantic of a concept depends of the context in which it occurs. Therefore, the identification of meaning could lead to problems of ambiguity. Several research works have demonstrated the complexity of word-sense disambiguation (WSD), where traditionally a term is searched in a data dictionary (e.g., WordNet) . Other approaches have chosen to analyze the context of the terms to improve the annotation process . The problems related to semantic annotation are still an open research topic.
The annotation process could be a source of different types of problems, for example, (i) ambiguous annotations, when entities have been assigned to more than one concept in the ontology, (ii) erroneous annotations, when the meaning of a text is not found in the ontology, and, (iii) false annotations, when the annotation does not provide any value for the realization of a semantic search. In this sense, this paper presents a strategy of semantic annotation in unstructured documents. Our approach is based on ontologies and on the extraction of contextual semantic information from entities of the ontology. The semantic context of an entity is determined by their relationships in the ontology. Therefore, we propose to extract the semantic context of the entities by calculating the similarity of association between each pair of concepts and the calculation of the weights of the relationships of the entities. With this strategy, we deal with the problems of ambiguous, erroneous, and false annotations. Our method of semantic annotation is part of a semantic search system in natural language and it has been evaluated with the corpus compiled by Lee and Welsh  and DBpedia.
This paper is organized as follows: Section 2 describes the background of our proposal, Section 3 presents the related work, Section 4 presents the architecture of the system, Section 5 presents the evaluation of the proposed approach, and finally, Section 6 provides some conclusions and an outlook for future work.
This section presents the concepts and foundations of the proposed semantic annotation approach.
An ontology is composed of a schema and instances (see Figure 1). A schema is defined as where is the set of classes/concepts , is the set of data types, and is the set of properties which are the relationships between classes. Instances represent knowledge and denote an instanced class and their relationships. Instances can be defined as a graph , where is the set of instances, and is the set of relationships or predicates binding the instances.
In an ontology, classes, properties, data types, and instances are explicitly identified by Uniform Resource Identifiers (URI). In addition, they represent entities within the ontology, which are characterized by their textual description declared in the property rdfs:label. This may have lexical variations defined as rdfs:label = ,.
Figure 1 shows a fragment of an ontology for the research domain. The schema level defines classes such as Laboratory and Professor, and properties such as interestedIn.
The instance level indicates the instantiated schemas. For example, ontologies is an instance of the class ResearchGroup; Methodology, and Alice Perez are related to the property writtenBy and belong to the classes Publication and Author, respectively. The Acapulco instance contains its textual description with two lexical variations rdfs:label = ,capulco de Juárez.
2.2. Semantic Annotation
The semantic annotation is fundamental to obtaining better results in the semantic search because the documents are represented in a conceptual space.
The semantic annotation of a document consists in linking the terms in with the entities in the ontology which describe the content of the term in its textual description best (see Figure 2). Namely, let an entity-term pair be , where is an entity in the ontology and is a term/phrase of , so that there is a mapping between the textual descriptions defined in the label rdfs:label of and .
In semantic annotation techniques, a document is analyzed in order to identify its relevant terms and to define the importance of each term. There are tools to identify mentions, such as TagMe  and Spotlight .
When the semantic annotations are made without regard to the context, its terms or mentions are linked with the entities in the ontology without taking into account their meaning. This causes ambiguous or erroneous annotations.
Our research work proposes to analyze the context of the annotations in order to identify their meaning through the entities in the ontology, and in this way to avoid ambiguities. In the extraction of the context, the explicit relationships of each entity in the ontology are analyzed. For example, Figure 2 shows the relationship between the Ontologies entity and ResearchGroup and Alice Perez.
3. Related Work
The semantic search involves different components: (i) preprocessing, (ii) semantic query translator, (iii) semantic annotation and indexing, (iv) retrieval of semantic content, and (v) semantic ranking.
Currently, there are several research works with different contributions in the area of the semantic web. Several general-purpose tools have been developed to support the annotation process, and, also, specific domain ontologies and knowledge bases have been proposed by research groups.
General-Purpose Tools. There are several available services for annotation of named entities in documents that could be accessed using RESTful APIs such as the case of OpenCalais .
Let us remark that, AlchemyAPI  and OpenCalais  use context-based statistical techniques to disambiguate the candidate instances to annotate a term. These tools use proprietary vocabularies and ontologies whose instances are linked to DBpedia through the owl:sameAs relationship. However, OpenCalais provides some limited linkage to DBpedia. Also, OpenCalais is mainly focused on organizations. This approach has two disadvantages. Firstly, it only explores the surface of the graph for each DBpedia instance considering the labels, abstract, links to Wiki pages, and synonyms. Secondly, this approach annotates a term with only one instance of DBpedia. Therefore, this approach does not exploit the semantic information available in DBpedia to disambiguate the instance annotating a given term.
DBpedia Spotlight  is a semantic annotation tool for data entities in a document and it is based on DBpedia for the annotation. Also, this tool provides interfaces for disambiguation, including a Web API which supports XML, JSON, and RFD formats.
Gate  is a tool for text engineering to help users in the process of text annotation manually. This tool provides basic processing functionalities, such as recognition of entity named, sentence dividers, markers, and so on.
Ontea  is a tool for semantic metadata extraction from documents. This tool uses regular expressions patterns as text analysis tool, and it detects semantically equivalent elements according to the domain ontology defined in the tool. This tool creates a new individual ontology from a defined class and it assigns the detected elements as properties in the ontology class. The patterns of regular expressions are used to annotate the text without format with elements in the ontology.
These approaches have two main drawbacks. On the one hand, they just explore the surface of the graph for each DBpedia instance; they mainly consider label, abstract, links to Wiki pages, and synonyms. Therefore, these approaches do not exploit the semantic information available in DBpedia to disambiguate the instance annotating a given term. Another disadvantage of this work lies in the fact that it discards the relationship, which contains relevant information about a term. That is, they do not enrich the description of relevant terms with the semantic graphs that contain the DBpedia instances related to the context of the document. Some works do face these drawbacks by annotating their documents with graphs extracted from DBpedia.
Specific Domain Tools. There are specific tools for biomedical annotations such as MetaMap , Whatizi , and Semantator . Most of this approaches and tools are based on a strategy to search terms in thesaurus. These methods consist in finding occurrences of a concept chain in a text fragment using strict coincidence of terms.
Semantic Annotation Approaches Based on Information Retrieval Techniques. Popov and colleagues  present KIM, a platform for information and knowledge management, annotation, and indexed and semantic retrieval. This tool provides a scalar infrastructure for personalized information extraction and also for documents management and its corresponding annotations. The main contribution of KIM is the recognition of the named entities according to ontology.
Castells et al.  propose an information retrieval model using ontologies for the annotation classification. This model uses an ontology-based schema for the semiautomatic semantic annotation of documents. This research was extended by Fernández et al.  to provide natural language queries.
Berlanga et al.  propose a semantic annotation/query strategy for a corpus using several knowledge bases. This method is based on a statistical framework where the concepts of the knowledge bases and the corpus documents are homogeneously represented through statistical models of language. This enables the effective semantic annotation of the corpus.
Nebot and Berlanga  explore the use of semantic annotation in the biomedical domain. They present a scalable method to extract domain-independent relationships. They propose a probabilistic approach to measure the synonymy relationship and also a method to discover abstract semantic relationships automatically.
Fuentes-Lorenzo et al.  propose a tool to improve the quality of results of the Web search engines, performing a better classification of the query results.
In the literature we can find several approaches to optimize query results. Swoogle  is a raster based system to discover, index, and query RDF documents. SemSearch  is another search engine relying on semantic indexes and is based on Sesame  and Lucene. The ranking algorithm was specifically designed for the extraction of ontologies through annotation. In  a search engine is proposed to infer the context of Web pages and also to create links to relevant Web pages. Lopez et al.  developed an information retrieval system based on ontologies. This system takes as input a natural language query and converts it to semantic entities using a question-answering system. PowerAqua  is a system to recover and to classify documents through TF-IDF measures .
4. Semantic Annotation Architecture
This paper presents a novel semantic annotation approach based on ontologies for the improvement of information search in unstructured documents. We present an approach to annotation that enriches and semantically describes the content of a document using the similarity of entities of an ontology. Specifically calculating the association between each concept pair and the relationships weight.
The goals of our approach are (a) to link the entities with their meaning in order to be annotated and (b) to provide a framework for semantic searches using natural language processing. The semantic annotation approach extracts the semantic context through the similarity analysis calculating the association of the explicit relationships and the weight of the relationships of the entities involved. Figure 3 shows an overview of our proposed solution for the semantic annotation.
4.1. Documents Indexing
Commonly, Natural Language Processing (NLP) is used for the analysis of unstructured documents, and also for the recognition and extraction of mentions or named entities .
In this approach, the indexing of unstructured web documents generates inverted indexes, which contain the set of terms to be compared with the entities in the ontology. We propose an algorithm for the indexing of documents using Lucene. The output of this algorithm is an inverted index containing the list of terms or keywords and a set of documents where the terms appear.
Therefore, the algorithm provides a mapping from terms to documents and a mechanism for annotating search results. Also, it obtains the position of the information: the list of terms IDs, the association with the ID of the document, and its position.
4.2. Entity Identifications
Given a document and a knowledge base, the objective of this phase is to extract the textual descriptions and the semantic context of all the information about from the knowledge base.
Identification of Mentions. Documents are analyzed to detect terms. Generally, this process is known as acknowledgment of mentions or named entities . A mention is a term/phrase in the text which may correspond to an entity in the knowledge base.
From the ontological point of view, an entity can denote classes, relationships, or instances. Entities can represent people, organizations, locations, and so on. There are different tools to define entities, like Spotlight  and TagMe , among others. TagMe uses Wikipedia as a dictionary of terms for mentions detection. We have used this tool with the same purpose.
TagMe analyzes the input text and detects mentions using a dictionary of entities/words (surface form). For each word, it registers the set of entities recognized by that name. This dictionary is constructed by extracting the words from four sources: Wikipedia papers, redirected pages, Wikipedia page titles, and other variants.
Words with few occurrences and single-character words are discarded. Finally, an additional filtering to discard words with low link probability is done (e.g., less than 0.001). The link probability is defined as stated inwhere is the number of times the mention appears as a link and denotes the number of times the mention occurs in Wikipedia.
The detection of mentions is carried out by comparing the -grams (until ) of the document.
4.2.1. Extraction of Instances
Each mention detected in document is searched in the ontology, and if an instance matches its textual description, it is extracted from the label rdfs:label. All the values contained in rdfs:label (lexical variations) are considered as labels that are later compared in the document index.
Figure 4 shows a fragment of the México entity code containing URI, class, and textual description with two lexical variations México and Estados Unidos Mexicanos.
4.2.2. Extraction of the Instances Semantic Context
In this process, the semantic context of the instances is extracted to be analyzed in detail. The explicit relationships in the URI are also analyzed. Several strategies have been proposed to evaluate the proximity of entities according to their semantic characteristics . The use of the semantic measure based on graphs allows us to compare concepts, terms, and instances. This measure is represented as an edge in a semantic graph in order to determine the relationship strength among the ontology concepts.
Therefore, this research work uses the semantic measure as a strategy to measure the strength of the explicit relationship between entities. Two types of measures are considered: the association between each concept pair and the relationships weight. Each measure reflects the similarity degree or relationship between the ontology entities according to its meaning.
Concept Pairwise Association. An entity is explicitly related to other concepts in the ontology. To measure the association strength between each pair of concepts and , we compare each pairwise by calculating similarity. Figure 2 shows the Acapulco entity with four explicitly related concepts (Carlos, Guerrero, México, and Richard).
The association strength between each pairwise can be measured taking into account different characteristics, such as the shortest path between concepts pairwise, the depth of their common ancestor, and information content .
We have adopted the Resnik approach  to measure the similarity between two concepts and according to the information content, using the formula where denotes the common ancestor of and with the higher information content. is the information content calculated for each node in the ontology, whereas the more specific the node in the ontology is, the greater its information content is. There are different metrics to calculate .
Generally, these metrics are intrinsic. Namely, they are based on the topological information of the ontology and consider the instances occurrence. This approach considers the occurrence of an instance quantified as , which has been reformulated as stated inwhere denotes the number instances of the concept and represents the number of instances on the ontology.
From the ontology in Figure 2 which contains 1000 resources including the entities Person, Publication, and ResearchGroup, we can see a group of 600 people interested in some research group (ResearchGroup) and 100 people (Author) who wrote some publications (Publication). The information content in interestedIn and writtenBy is obtained as stated inThe information content in a property represents the strength of the discrimination among the relationships. However, this is not enough to determine the meaning of the entity. We propose to measure the weight of each property linked to a concept .
Relationships Weight. Based on information theory, the amount of information contained in a random variable over another variable is measured by mutual information. This strategy has been proposed by Cover  and we have adapted it to measure the relationship strength of pairwise and .where is the probability of relationship belonging to a set of properties of and . is the probability of relationship belonging to set of properties of , whereas is the probability of relationship belonging to set of properties of .
As an example, let us calculate the relationship weight between Richard and Methodology, which is writtenBy, and it is computed as stated inIt should be noted that a relationship can have many instances. Consequently, calculating the relationships weight would have a high computational cost. Thus, we calculate the mutual information as stated in where represents all relationships in the relationships set, represents all relationships in (subject), and represents all relationships in (object).
Combining Association and Relationship Weights. The combination of weights requires considering several methods of aggregation, such as average, addition, and multiplication. A weighted sum as combination method to adjust the influence of each factor on the total weight was selected. Finally, to combine the association between each pair of concepts (see (2)) and the weights of the relationships (see (7)), we calculate the final weight to obtain the entities context, as stated inwhere , . and were normalized to be in the range by unit-based normalization , stated in
4.3. Terms Extraction and Documents Annotation
The textual descriptions of instances and entities semantic context obtained in the previous stage are searched in the inverted index to extract and generate a documents’ annotation table containing the ontology entity, the belonging document, and its weight (see Table 1).
The annotations weight is done by means of TF-IDF algorithm. Term frequency (TF) is the local weighting factor reflecting the importance of a term within a document. Document frequency (DF) is the global weighting factor considering the importance of a term within the document collection. Inverse document frequency (IDF) calculates the frequency of a document within the collection. TF and IDF are calculated using the formulas stated in (10) and (11).where is the number of occurrences of term within document and is the number of occurrences of all terms within document .where is the total number of documents in the collection and represents the documents where term appears. The weight for in is the combination of TF IDF.
Finally, the annotations are represented in the form of serialized triplets in JSON-LD.
Pearson and Spearman correlation were used in order to measure the agreement with the human judgments. Pearson correlation measures the linear correlation between two variables, uses the ranges, orders numbers of each group of subjects, and compares those ranges. Spearman is a correlation measure between two continuous random variables.
Ontology and KIM Platform Knowledge Base . This ontology has 271 classes, and 120 relationships and attributes. Some declared classes are of general importance such as People, Organizations, Government, and Location. The knowledge base consists of 200,000 instances, 50,000 locations, 130,000 organizations, 6,000 people, and more.
DBpedia . DBpedia is general-purpose and multilingual in nature and has comprehensiveness. For this reason, it was selected for our experimentation. The English version contains 685 classes and 2795 properties; and the knowledge base is more than 4 million instances. DBpedia contains multiple classification systems, such as YAGO, Wikipedia Categories, and the hierarchical subgraph of the DBpedia Ontology. The Wikipedia Category system has the highest coverage of entities among all three options. To overcome these issues, we use the Wikipedia Category Hierarchy by Kapanipathi et al. .
Data Sets. LP50 are data sets of documents compiled by Lee and Welsh , which was used for our experimentation. LP50 is composed of 50 general-purpose news documents with lengths between 50 and 126 words.
Lucene. The Lucene’s documents were indexed to generate a documents index that includes the list of mentions and documents where they appear. Also, the TagMe tool was used for mentions detection in the documents. We used the Jena library for the analysis and extraction of the entities in the ontology. We use Jena TDB triple store to operate DBpedia locally.
For space issues, Table 2 shows only the results of the first 25 annotated documents. Column 2 shows the number of words in each document. Column 3 shows the mentions detected in each document. The columns 4 and 5 show the mentions linked in the KIM and DBpedia ontologies, respectively.
Table 2 shows only few mentions linked with KIM knowledge base. This is mainly due to the fact that (i) ontologies and instances are limited and (ii) the entities must have a value in rdfs: label.
In the first case, if an ontology and knowledge base have a limited scope, a mention in the ontology could not exist. Therefore, ontology with a larger population (as DBpedia) will cover most of the mentions obtained in the documents.
In the second case, the entities must have value in rdfs: label, since this depends on links between the mentions and entities. DBpedia has more mention-entity link since it contains more than 4 million instances.
Table 3 shows the results of the semantic annotation evaluation DBpedia. The standard measures precision, recall, measure, and accuracy were used for evaluating the annotations obtained. Precision is the rate between the relevant instances of the ontology and the total number of instances retrieved, and recall is the rate between the number of relevant instances retrieved and the total number of relevant instances existing in the ontology:where TP (True Positives) are the set of retrieved instances that are relevant, FP (False Positives) are the set of retrieved instances that are not relevant, and FN (False Negatives) are the set of instances that are wrongly retrieved as nonrelevant.
The results show that our proposed method of context-based semantic annotation improves the results of the context-free annotation method.
Comparison to State of the Art. The results of our similarity calculation approach were compared with different strategies shown of the state of the art. Some approaches only take into account the weight of the edges, the association between each pairwise concept, and the ontology structure. We compared our approach with different methods in the literature that measure document similarity and use the LP50 data set. Among the methods analyzed are Latent Semantic Analysis (LSA) , Explicit Semantic Analysis (ESA) , Salient Semantic Analysis (SSA) , Graph Edit Distance (GED) , and ConceptsLearned .
The results obtained of comparison of our approach with other methods using LP50 dataset are shown in Table 4. The values of Pearson and Spearmen correlation of our approach were 0.745 and 0.65, respectively. This result was best compared to the results of other approaches. Thus, our approach significantly outperforms, to our knowledge, the most competitive related approaches, although ConceptsLearned has a better correlation of Pearson and Spearman (0.81 and 0.75). This is because ConceptsLearned uses 17 more features compared to ours, but the computational cost is high.
Comparison with Other Metrics for Information Content (IC) Calculation. We performed tests with different metrics to calculate the information content and use the extrinsic approach. The information content with the intrinsic approach can be performed using two parameters: the depth of the class and the descendants of a class.
Table 5 shows the slight advantage of considering the ontology instances with the extrinsic information content.
In this paper, we have presented a semantic annotation of unstructured documents approach. Which considers concepts similarity in ontology through its semantic relations.
The unstructured documents are represented as graphs, the nodes represent the mentions, and the edges represent the semantics and relationships. Each semantic relationship has a weighting measure assigned. Thus, the significant relationships have a higher weight.
The context extraction was done through the computation of association between pairwise concepts and the weight of entity relations. The sum of the two values is the one that measures the meaning or context of an entity. We also took advantage of instances in the knowledge base to measure the information content classes and relationships.
According to the state of the art the results obtained with our approach give the best results.
As future work, we are trying to reduce the knowledge base by selecting the entities whose definition is more likely to be used in the corpus. Additionally, Word2vec tool for semantic extraction of terms and documents can be used.
Finally, this approach also has been compared with other proposals available in the literature.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
This research work has been partially funded by European Commission and CONACYT, through the SmartSDK project. It also has been partially funded by TecNM with the project 6021.17-P.
- T. Zhang, K. Liu, and J. A. Zhao, “Graph-based similarity measure between wikipedia concepts and its application in entity linking system,” Journal of Chinese Information Processing, vol. 29, no. 2, pp. 58–67, 2015.
- C. Bizer, T. Heath, and T. Berners-Lee, “Linked data—the story so far,” International Journal on Semantic Web and Information Systems, vol. 5, no. 3, article 122, 2009.
- C. Bizer, J. Lehmann, G. Kobilarov et al., “DBpedia—a crystallization point for the Web of Data,” Journal of Web Semantics: Science, Services and Agents on the World Wide Web, vol. 7, no. 3, pp. 154–165, 2009.
- K. Bollacker, R. Cook, and P. Tufts, “Freebase: a shared database of structured general human knowledge,” in In Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI '07), vol. 2, pp. 1962-1963, AAAI Press, British Columbia, Canada, July 2007.
- F. M. Suchanek, G. Kasneci, and G. Weikum, “Yago: a core of semantic knowledge,” in Proceedings of the 16th International World Wide Web Conference (WWW '07), pp. 697–706, Alberta, Canada, May 2007.
- L. Bos and K. Donnelly, “The advanced terminology and coding system for ehealth,” Studies in Health Technology and Informatics, vol. 121, pp. 279–290, 2009.
- J. M. Ruiz-Martínez, R. Valencia-García, J. T. Fernández-Breis, F. García-Sánchez, and R. Martínez-Béjar, “Ontology learning from biomedical natural language documents using UMLS,” Expert Systems with Applications, vol. 38, no. 10, pp. 12365–12378, 2011.
- C. Caracciolo, A. Stellato, A. Morshed et al., “The AGROVOC linked dataset,” Journal of Web Semantics, vol. 4, no. 3, pp. 341–348, 2013.
- A. R. Aronson and F.-M. Lang, “An overview of MetaMap: historical perspective and recent advances,” Journal of the American Medical Informatics Association, vol. 17, no. 3, pp. 229–236, 2010.
- R. Berlanga, V. Nebot, and E. Jiménez, “Semantic annotation of biomedical texts through concept retrieval,” Procesamiento del Lenguaje Natural, vol. 45, pp. 247–250, 2010.
- M. Dai, N. Shah, W. Xuan et al., “An efficient solution for mapping free text to ontology terms,” in Proceedings of the American Medical Informatics Association Symposium on Translational BioInformatics (AMIA-TBI '08), Washington, DC, USA, November 2008.
- R. Navigli and M. Lapata, “An experimental study of graph connectivity for unsupervised word sense disambiguation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 32, no. 4, pp. 678–692, 2010.
- E. Agirre, O. L. de Lacalle, and A. Soroa, “Random walks for knowledge-based word sense disambiguation,” Computational Linguistics, vol. 40, no. 1, pp. 57–84, 2014.
- M. Lee and M. Welsh, “An empirical evaluation of models of text document similarity,” in Proceedings of the 27 Annual Conference of the Cognitive Science Society (CogSci '05), pp. 1254–1259, Erlbaum, Stresa, Italy, July 2005.
- P. Ferragina and U. Scaiella, “Fast and accurate annotation of short texts with wikipedia pages,” IEEE Software, vol. 29, no. 1, pp. 70–75, 2012.
- P. N. Mendes, M. Jakob, A. García-Silva, and C. Bizer, “DBpedia spotlight: shedding light on the web of documents,” in Proceedings of the 7th International Conference on Semantic Systems (I-SEMANTICS '11), pp. 1–8, Graz, Austria, September 2011.
- OpenCalais, 2014, http://www.opencalais.com/.
- IBM, AlchemiLanguage, 2015, https://alchemy-language-demo.mybluemix.net/.
- D. O. C. S. The University of Sheffield, Developing Language Processing Components with GATE, 8 edition, 2017 https://gate.ac.uk/userguide.
- M. Laclavík, M. Šeleng, M. Ciglan, and L. Hluchý, “Ontea: platform for pattern based automated semantic annotation,” Computing and Informatics, vol. 28, no. 4, pp. 555–579, 2009.
- D. Rebholz-Schuhmann, M. Arregui, S. Gaudan, H. Kirsch, and A. Jimeno, “Text processing through web services: calling Whatizit,” Bioinformatics, vol. 24, no. 2, pp. 296–298, 2008.
- C. Tao, D. Song, D. Sharma, and C. G. Chute, “Semantator: semantic annotator for converting biomedical text to linked data,” Journal of Biomedical Informatics, vol. 46, no. 5, pp. 882–893, 2013.
- B. Popov, A. Kiryakov, A. Kirilov, D. Manov, D. Ognyanoff, and M. Goranov, “KIM—semantic annotation platform,” in Proceedings of the 2nd International Conference on Semantic Web Conference (ISWC '03), vol. 2870 of Lecture Notes in Computer Science, pp. 834–849, Springer, Sanibel Island, Fla, USA, October 2003.
- P. Castells, M. Fernández, and D. Vallet, “An adaptation of the vector-space model for ontology-based information retrieval,” IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 2, pp. 261–272, 2007.
- M. Fernández, I. Cantador, V. López, D. Vallet, P. Castells, and E. Motta, “Semantically enhanced information retrieval: an ontology-based approach,” Journal of Web Semantics, vol. 9, no. 4, pp. 434–452, 2011.
- R. Berlanga, V. Nebot, and M. Pérez, “Tailored semantic annotation for semantic search,” Journal of Web Semantics, vol. 30, pp. 69–81, 2015.
- V. Nebot and R. Berlanga, “Exploiting semantic annotations for open information extraction: an experience in the biomedical domain,” Knowledge and Information Systems, vol. 38, no. 2, pp. 365–389, 2014.
- D. Fuentes-Lorenzo, N. Fernández, J. A. Fisteus, and L. Sánchez, “Improving large-scale search engines with semantic annotations,” Expert Systems with Applications, vol. 40, no. 6, pp. 2287–2296, 2013.
- L. Ding, T. Finin, A. Joshi et al., “Swoogle: a search and metadata engine for the semantic web,” in Proceedings of the 13th ACM International Conference on Information and Knowledge Management (CIKM '04), pp. 652–659, Washington, DC, USA, November 2004.
- Y. Lei, V. Uren, and E. Motta, “SemSearch: a search engine for the semantic web,” in Managing Knowledge in a World of Networks, S. Staab and V. Svtek, Eds., vol. 4248 of Lecture Notes in Computer Science, pp. 238–245, Springer, Berlin, Germany, 2006.
- C. Tao, Z. Yongjuan, Z. Shen, C. Chengcai, and C. Heng, “Building semantic information search platform with extended sesame framework,” in Proceedings of the 8th International Conference on Semantic Systems (ISEMANTICS '12), pp. 193–196, New York, NY, USA, September 2012.
- S. Saha, A. Sajjanhar, S. Gao, R. Dew, and Y. Zhao, “Delivering categorized news items using RSS feeds and web services,” in Proceedings of the 10th IEEE International Conference on Computer and Information Technology (ScalCom '10), pp. 698–702, Bradford, UK, July 2010.
- V. Lopez, M. Fernández, E. Motta, and N. Stieler, “PowerAqua: supporting users in querying and exploring the Semantic Web,” Journal of Web Semantics, vol. 3, no. 3, pp. 249–265, 2012.
- A. Singhal, G. Salton, M. Mitra, and C. Buckley, “Document length normalization,” Information Processing & Management, vol. 32, no. 5, pp. 619–633, 1996.
- I. Augenstein, L. Derczynski, and K. Bontcheva, “Generalisation in named entity recognition: a quantitative analysis,” Computer Speech and Language, vol. 44, pp. 61–83, 2017.
- Z. Wu and M. Palmer, “Verbs semantics and lexical selection,” in Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics (ACL '94), pp. 133–138, ACM, Las Cruces, NM, USA, June 1994.
- P. Resnik, “Using information content to evaluate semantic similarity in a taxonomy,” in Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI '95), vol. 2, pp. 448–453, Morgan Kaufmann Publishers Inc., Quebec, Canada, August 1995.
- T. M. Cover and J. A. Thomas, Elements of Information Theory Wiley Series in Telecommunications and Signal Processing, John Wiley & Sons, New York, NY, USA, 2007.
- P. Kapanipathi, P. Jain, C. Venkataramani, and A. Sheth, “Hierarchical interest graph,” 2016, http://wiki.knoesis.org/index.php/Hierarchical_Interest_Graph.
- S. Hassan and R. Mihalcea, “Semantic relatedness using salient semantic analysis,” in Proceedings of the 25th AAAI Conference on Artificial Intelligence, pp. 884–889, San Francisco, Claif, USA, August 2011.
- E. Gabrilovich and S. Markovitch, “Computing semantic relatedness using wikipedia-based explicit semantic analysis,” in Proceedings of the 20th International Joint Conference on Artifical Intelligence (IJCAI '07), pp. 1606–1611, Hyderabad, India, January 2007.
- M. Schuhmacher and S. P. Ponzetto, “Knowledge-based graph document modeling,” in Proceedings of the 7th ACM International Conference on Web Search and Data Mining (WSDM '14), pp. 543–552, ACM, New York, NY, USA, February 2014.
- L. Huang, D. Milne, E. Frank, and I. H. Witten, “Learning a concept-based document similarity measure,” Journal of the Association for Information Science and Technology, vol. 63, no. 8, pp. 1593–1608, 2012.
Copyright © 2017 Fernando Pech et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.