Search (96 results, page 1 of 5)

0.071394496 = product of:
  0.14278899 = sum of:
    0.14278899 = sum of:
      0.10066533 = weight(_text_:indexing in 987) [ClassicSimilarity], result of:
        0.10066533 = score(doc=987,freq=8.0), product of:
          0.19835205 = queryWeight, product of:
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.051817898 = queryNorm
          0.5075084 = fieldWeight in 987, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.046875 = fieldNorm(doc=987)
      0.042123657 = weight(_text_:22 in 987) [ClassicSimilarity], result of:
        0.042123657 = score(doc=987,freq=2.0), product of:
          0.18145745 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051817898 = queryNorm
          0.23214069 = fieldWeight in 987, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=987)
  0.5 = coord(1/2)

Abstract

This book covers the basics of semantic web technologies and indexing languages, and describes their contribution to improve languages as a tool for subject queries and knowledge exploration. The book is relevant to information scientists, knowledge workers and indexers. It provides a suitable combination of theoretical foundations and practical applications.

Content

Introduction: envisioning semantic information spacesIndexing and knowledge organization -- Semantic technologies for knowledge representation -- Information retrieval and knowledge exploration -- Approaches to handle heterogeneity -- Problems with establishing semantic interoperability -- Formalization in indexing languages -- Typification of semantic relations -- Inferences in retrieval processes -- Semantic interoperability and inferences -- Remaining research questions.

Date

23. 7.2017 13:49:22

LCSH

Indexing

Subject

Indexing

0.06968607 = product of:
  0.13937214 = sum of:
    0.13937214 = sum of:
      0.11128971 = weight(_text_:indexing in 4399) [ClassicSimilarity], result of:
        0.11128971 = score(doc=4399,freq=22.0), product of:
          0.19835205 = queryWeight, product of:
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.051817898 = queryNorm
          0.56107163 = fieldWeight in 4399, product of:
            4.690416 = tf(freq=22.0), with freq of:
              22.0 = termFreq=22.0
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.03125 = fieldNorm(doc=4399)
      0.028082438 = weight(_text_:22 in 4399) [ClassicSimilarity], result of:
        0.028082438 = score(doc=4399,freq=2.0), product of:
          0.18145745 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051817898 = queryNorm
          0.15476047 = fieldWeight in 4399, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03125 = fieldNorm(doc=4399)
  0.5 = coord(1/2)

Abstract

Indexing plays a vital role in Information Retrieval. With the availability of huge volume of information, it has become necessary to index the information in such a way to make easier for the end users to find the information they want efficiently and accurately. Keyword-based indexing uses words as indexing terms. It is not capable of capturing the implicit relation among terms or the semantics of the words in the document. To eliminate this limitation, ontology-based indexing came into existence, which allows semantic based indexing to solve complex and indirect user queries. Ontologies are used for document indexing which allows semantic based information retrieval. Existing ontologies or the ones constructed from scratch are used presently for indexing. Constructing ontologies from scratch is a labor-intensive task and requires extensive domain knowledge whereas use of an existing ontology may leave some important concepts in documents un-annotated. Using multiple ontologies can overcome the problem of missing out concepts to a great extent, but it is difficult to manage (changes in ontologies over time by their developers) multiple ontologies and ontology heterogeneity also arises due to ontologies constructed by different ontology developers. One possible solution to managing multiple ontologies and build from scratch is to use modular ontologies for indexing.
Modular ontologies are built in modular manner by combining modules from multiple relevant ontologies. Ontology heterogeneity also arises during modular ontology construction because multiple ontologies are being dealt with, during this process. Ontologies need to be aligned before using them for modular ontology construction. The existing approaches for ontology alignment compare all the concepts of each ontology to be aligned, hence not optimized in terms of time and search space utilization. A new indexing technique is proposed based on modular ontology. An efficient ontology alignment technique is proposed to solve the heterogeneity problem during the construction of modular ontology. Results are satisfactory as Precision and Recall are improved by (8%) and (10%) respectively. The value of Pearsons Correlation Coefficient for degree of similarity, time, search space requirement, precision and recall are close to 1 which shows that the results are significant. Further research can be carried out for using modular ontology based indexing technique for Multimedia Information Retrieval and Bio-Medical information retrieval.

Date

20. 1.2015 18:30:22

0.04115028 = product of:
  0.08230056 = sum of:
    0.08230056 = product of:
      0.24690168 = sum of:
        0.24690168 = weight(_text_:3a in 400) [ClassicSimilarity], result of:
          0.24690168 = score(doc=400,freq=2.0), product of:
            0.43931273 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051817898 = queryNorm
            0.56201804 = fieldWeight in 400, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.046875 = fieldNorm(doc=400)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Content

Vgl.: https%3A%2F%2Faclanthology.org%2FD19-5317.pdf&usg=AOvVaw0ZZFyq5wWTtNTvNkrvjlGA.

0.0377132 = product of:
  0.0754264 = sum of:
    0.0754264 = sum of:
      0.050854262 = weight(_text_:indexing in 1633) [ClassicSimilarity], result of:
        0.050854262 = score(doc=1633,freq=6.0), product of:
          0.19835205 = queryWeight, product of:
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.051817898 = queryNorm
          0.25638384 = fieldWeight in 1633, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.8278677 = idf(docFreq=2614, maxDocs=44218)
            0.02734375 = fieldNorm(doc=1633)
      0.024572134 = weight(_text_:22 in 1633) [ClassicSimilarity], result of:
        0.024572134 = score(doc=1633,freq=2.0), product of:
          0.18145745 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051817898 = queryNorm
          0.1354154 = fieldWeight in 1633, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.02734375 = fieldNorm(doc=1633)
  0.5 = coord(1/2)

Abstract

Purpose - The purpose of this paper is to improve the conceptual-based search by incorporating structural ontological information such as concepts and relations. Generally, Semantic-based information retrieval aims to identify relevant information based on the meanings of the query terms or on the context of the terms and the performance of semantic information retrieval is carried out through standard measures-precision and recall. Higher precision leads to the (meaningful) relevant documents obtained and lower recall leads to the less coverage of the concepts. Design/methodology/approach - In this paper, the authors enhance the existing ontology-based indexing proposed by Kohler et al., by incorporating sibling information to the index. The index designed by Kohler et al., contains only super and sub-concepts from the ontology. In addition, in our approach, we focus on two tasks; query expansion and ranking of the expanded queries, to improve the efficiency of the ontology-based search. The aforementioned tasks make use of ontological concepts, and relations existing between those concepts so as to obtain semantically more relevant search results for a given query. Findings - The proposed ontology-based indexing technique is investigated by analysing the coverage of concepts that are being populated in the index. Here, we introduce a new measure called index enhancement measure, to estimate the coverage of ontological concepts being indexed. We have evaluated the ontology-based search for the tourism domain with the tourism documents and tourism-specific ontology. The comparison of search results based on the use of ontology "with and without query expansion" is examined to estimate the efficiency of the proposed query expansion task. The ranking is compared with the ORank system to evaluate the performance of our ontology-based search. From these analyses, the ontology-based search results shows better recall when compared to the other concept-based search systems. The mean average precision of the ontology-based search is found to be 0.79 and the recall is found to be 0.65, the ORank system has the mean average precision of 0.62 and the recall is found to be 0.51, while the concept-based search has the mean average precision of 0.56 and the recall is found to be 0.42. Practical implications - When the concept is not present in the domain-specific ontology, the concept cannot be indexed. When the given query term is not available in the ontology then the term-based results are retrieved. Originality/value - In addition to super and sub-concepts, we incorporate the concepts present in same level (siblings) to the ontological index. The structural information from the ontology is determined for the query expansion. The ranking of the documents depends on the type of the query (single concept query, multiple concept queries and concept with relation queries) and the ontological relations that exists in the query and the documents. With this ontological structural information, the search results showed us better coverage of concepts with respect to the query.

Date

20. 1.2015 18:30:22

0.03355511 = product of:
  0.06711022 = sum of:
    0.06711022 = product of:
      0.13422044 = sum of:
        0.13422044 = weight(_text_:indexing in 1510) [ClassicSimilarity], result of:
          0.13422044 = score(doc=1510,freq=8.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.6766778 = fieldWeight in 1510, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0625 = fieldNorm(doc=1510)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Starting from an unsolved problem of information retrieval this paper presents an ontology-based model for indexing and retrieval. The model combines the methods and experiences of cognitive-to-interpret indexing languages with the strengths and possibilities of formal knowledge representation. The core component of the model uses inferences along the paths of typed relations between the entities of a knowledge representation for enabling the determination of hit quantities in the context of retrieval processes. The entities are arranged in aspect-oriented facets to ensure a consistent hierarchical structure. The possible consequences for indexing and retrieval are discussed.

0.02936072 = product of:
  0.05872144 = sum of:
    0.05872144 = product of:
      0.11744288 = sum of:
        0.11744288 = weight(_text_:indexing in 2777) [ClassicSimilarity], result of:
          0.11744288 = score(doc=2777,freq=8.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.5920931 = fieldWeight in 2777, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2777)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The presented ontology-based model for indexing and retrieval combines the methods and experiences of traditional indexing languages with their cognitively interpreted entities and relationships with the strengths and possibilities of formal knowledge representation. The core component of the model uses inferences along the paths of typed relations between the entities of a knowledge representation for enabling the determination of result sets in the context of retrieval processes. A proposal for a general, but condensed, inventory of typed relations is given. The entities are arranged in aspect-oriented facets to ensure a consistent hierarchical structure. The possible consequences for indexing and retrieval are discussed.

0.02743352 = product of:
  0.05486704 = sum of:
    0.05486704 = product of:
      0.16460112 = sum of:
        0.16460112 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
          0.16460112 = score(doc=701,freq=2.0), product of:
            0.43931273 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051817898 = queryNorm
            0.3746787 = fieldWeight in 701, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=701)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Content

Vgl.: http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F1627&ei=tAtYUYrBNoHKtQb3l4GYBw&usg=AFQjCNHeaxKkKU3-u54LWxMNYGXaaDLCGw&sig2=8WykXWQoDKjDSdGtAakH2Q&bvm=bv.44442042,d.Yms.

0.02743352 = product of:
  0.05486704 = sum of:
    0.05486704 = product of:
      0.16460112 = sum of:
        0.16460112 = weight(_text_:3a in 5820) [ClassicSimilarity], result of:
          0.16460112 = score(doc=5820,freq=2.0), product of:
            0.43931273 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051817898 = queryNorm
            0.3746787 = fieldWeight in 5820, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=5820)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Content

Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Language and Information Technologies. Vgl.: https%3A%2F%2Fwww.cs.cmu.edu%2F~cx%2Fpapers%2Fknowledge_based_text_representation.pdf&usg=AOvVaw0SaTSvhWLTh__Uz_HtOtl3.

0.025166333 = product of:
  0.050332665 = sum of:
    0.050332665 = product of:
      0.10066533 = sum of:
        0.10066533 = weight(_text_:indexing in 2111) [ClassicSimilarity], result of:
          0.10066533 = score(doc=2111,freq=8.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.5075084 = fieldWeight in 2111, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.046875 = fieldNorm(doc=2111)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Full-text documents are a vital and rapidly growing part of online biomedical information. A single large document can contain as much information as a small database, but normally lacks the tight structure and consistent indexing of a database. Retrieval systems will often miss highly relevant parts of a document if the document as a whole appears irrelevant. Access to full-text information is further complicated by the need to search separately many disparate information resources. This research explores how these problems can be addressed by the combined use of 2 techniques: 1) natural language processing for automatic concept-based indexing of full text, and 2) methods for exploiting the structure and hierarchy of full-text documents. We describe methods for applying these techniques to a large collection of full-text documents drawn from the Health Services / Technology Assessment Text (HSTAT) database at the NLM and examine how this hierarchical concept indexing can assist both document- and source-level retrieval in the context of NLM's Information Source Map project

0.023727044 = product of:
  0.04745409 = sum of:
    0.04745409 = product of:
      0.09490818 = sum of:
        0.09490818 = weight(_text_:indexing in 5788) [ClassicSimilarity], result of:
          0.09490818 = score(doc=5788,freq=4.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.47848347 = fieldWeight in 5788, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0625 = fieldNorm(doc=5788)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

A database supports legal research by matching a user's request for information with documents of the database that contain it. Indexes are among the oldest tools to achieve that aim. Many legal publishers continue to provide manual subject indexing of legal documents, in addition to automatic full-text indexing, which improves the performance of a full-text search.

0.02179468 = product of:
  0.04358936 = sum of:
    0.04358936 = product of:
      0.08717872 = sum of:
        0.08717872 = weight(_text_:indexing in 4318) [ClassicSimilarity], result of:
          0.08717872 = score(doc=4318,freq=6.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.4395151 = fieldWeight in 4318, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.046875 = fieldNorm(doc=4318)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper presents a novel hybrid approach for visual information retrieval (VIR) that combines shape analysis of objects in image with their indexing by textual descriptions. The principal goal of presented technique is applying Two Segments Turning Function (2STF) proposed by authors for efficient invariant to spatial variations shape processing and implementation of semantic Web approaches for ontology-based user-oriented annotations of multimedia information. In the proposed approach the user's textual queries are converted to image features, which are used for images searching, indexing, interpretation, and retrieval. A decision about similarity between retrieved image and user's query is taken computing the shape convergence to 2STF combining it with matching the ontological annotations of objects in image and providing in this way automatic definition of the machine-understandable semantics. In order to evaluate the proposed approach the Image Retrieval by Ontological Description of Shapes system has been designed and tested using some standard image domains.

0.02179468 = product of:
  0.04358936 = sum of:
    0.04358936 = product of:
      0.08717872 = sum of:
        0.08717872 = weight(_text_:indexing in 1812) [ClassicSimilarity], result of:
          0.08717872 = score(doc=1812,freq=6.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.4395151 = fieldWeight in 1812, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.046875 = fieldNorm(doc=1812)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The paper presents the theoretical foundation of Italian indexing system. A consistent integration of vocabulary control through a thesaurus (semantics) and of role analysis to construct subject strings (syntax) allows to represent the full theme of a work, even if complex, in one string. The conceptual model produces a binary scheme: each aspect (entities, relationships, etc.) consists of a couple of elements, drawing the two lines of semantics and syntax. The meaning of 'concept' and 'theme' is analysed, also in comparison with the FRBR and FRSAD models, with the proposal of an en riched model. A double existence of concepts is suggested: document-independent adn document-dependent.

Source

Subject access: preparing for the future. Conference on August 20 - 21, 2009 in Florence, the IFLA Classification and Indexing Section sponsored an IFLA satellite conference entitled "Looking at the Past and Preparing for the Future". Eds.: P. Landry et al

0.02179468 = product of:
  0.04358936 = sum of:
    0.04358936 = product of:
      0.08717872 = sum of:
        0.08717872 = weight(_text_:indexing in 3829) [ClassicSimilarity], result of:
          0.08717872 = score(doc=3829,freq=6.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.4395151 = fieldWeight in 3829, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.046875 = fieldNorm(doc=3829)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

In this thesis, we present an ontology-based information extraction and retrieval system and its application to soccer domain. In general, we deal with three issues in semantic search, namely, usability, scalability and retrieval performance. We propose a keyword-based semantic retrieval approach. The performance of the system is improved considerably using domain-specific information extraction, inference and rules. Scalability is achieved by adapting a semantic indexing approach. The system is implemented using the state-of-the-art technologies in SemanticWeb and its performance is evaluated against traditional systems as well as the query expansion methods. Furthermore, a detailed evaluation is provided to observe the performance gain due to domain-specific information extraction and inference. Finally, we show how we use semantic indexing to solve simple structural ambiguities.

0.020971943 = product of:
  0.041943885 = sum of:
    0.041943885 = product of:
      0.08388777 = sum of:
        0.08388777 = weight(_text_:indexing in 3810) [ClassicSimilarity], result of:
          0.08388777 = score(doc=3810,freq=8.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.42292362 = fieldWeight in 3810, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3810)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Nowadays, online data shows an astonishing increase and the issue of semantic indexing remains an open question. Ontologies and knowledge bases have been widely used to optimize performance. However, researchers are placing increased emphasis on internal relations of ontologies but neglect latent semantic relations between ontologies and documents. They generally annotate instances mentioned in documents, which are related to concepts in ontologies. In this paper, we propose an Ontology-based Latent Semantic Indexing approach utilizing Long Short-Term Memory networks (LSTM-OLSI). We utilize an importance-aware topic model to extract document-level semantic features and leverage ontologies to extract word-level contextual features. Then we encode the above two levels of features and match their embedding vectors utilizing LSTM networks. Finally, the experimental results reveal that LSTM-OLSI outperforms existing techniques and demonstrates deep comprehension of instances and articles.

Object

Latent Semantic Indexing

0.020761164 = product of:
  0.041522328 = sum of:
    0.041522328 = product of:
      0.083044656 = sum of:
        0.083044656 = weight(_text_:indexing in 1153) [ClassicSimilarity], result of:
          0.083044656 = score(doc=1153,freq=4.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.41867304 = fieldWeight in 1153, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1153)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

In the proposed article a new, ontology-based approach to information retrieval (IR) is presented. The system is based on a domain knowledge representation schema in form of ontology. New resources registered within the system are linked to concepts from this ontology. In such a way resources may be retrieved based on the associations and not only based on partial or exact term matching as the use of vector model presumes In order to evaluate the quality of this retrieval mechanism, experiments to measure retrieval efficiency have been performed with well-known Cystic Fibrosis collection of medical scientific papers. The ontology-based retrieval mechanism has been compared with traditional full text search based on vector IR model as well as with the Latent Semantic Indexing method.

Object

Latent Semantic Indexing

0.020548223 = product of:
  0.041096445 = sum of:
    0.041096445 = product of:
      0.08219289 = sum of:
        0.08219289 = weight(_text_:indexing in 3948) [ClassicSimilarity], result of:
          0.08219289 = score(doc=3948,freq=12.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.41437882 = fieldWeight in 3948, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.03125 = fieldNorm(doc=3948)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Purpose - This paper sets out to discuss the use of information extraction (IE), a natural language-processing (NLP) technique to assist "rich" semantic indexing of diverse archaeological text resources. The focus of the research is to direct a semantic-aware "rich" indexing of diverse natural language resources with properties capable of satisfying information retrieval from online publications and datasets associated with the Semantic Technologies for Archaeological Resources (STAR) project. Design/methodology/approach - The paper proposes use of the English Heritage extension (CRM-EH) of the standard core ontology in cultural heritage, CIDOC CRM, and exploitation of domain thesauri resources for driving and enhancing an Ontology-Oriented Information Extraction process. The process of semantic indexing is based on a rule-based Information Extraction technique, which is facilitated by the General Architecture of Text Engineering (GATE) toolkit and expressed by Java Annotation Pattern Engine (JAPE) rules. Findings - Initial results suggest that the combination of information extraction with knowledge resources and standard conceptual models is capable of supporting semantic-aware term indexing. Additional efforts are required for further exploitation of the technique and adoption of formal evaluation methods for assessing the performance of the method in measurable terms. Originality/value - The value of the paper lies in the semantic indexing of 535 unpublished online documents often referred to as "Grey Literature", from the Archaeological Data Service OASIS corpus (Online AccesS to the Index of archaeological investigationS), with respect to the CRM ontological concepts E49.Time Appellation and P19.Physical Object.

0.018162236 = product of:
  0.03632447 = sum of:
    0.03632447 = product of:
      0.07264894 = sum of:
        0.07264894 = weight(_text_:indexing in 3280) [ClassicSimilarity], result of:
          0.07264894 = score(doc=3280,freq=6.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.3662626 = fieldWeight in 3280, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3280)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This publication shows how the gap between the HTML based internet and the RDF based vision of the semantic web might be bridged, by linking words in texts to concepts of ontologies. Most current search engines use indexes that are built at the syntactical level and return hits based on simple string comparisons. However, the indexes do not contain synonyms, cannot differentiate between homonyms ('mouse' as a pointing vs. 'mouse' as an animal) and users receive different search results when they use different conjugation forms of the same word. In this publication, we present a system that uses ontologies and Natural Language Processing techniques to index texts, and thus supports word sense disambiguation and the retrieval of texts that contain equivalent words, by indexing them to concepts of ontologies. For this purpose, we developed fully automated methods for mapping equivalent concepts of imported RDF ontologies (for this prototype WordNet, SUMO and OpenCyc). These methods will thus allow the seamless integration of domain specific ontologies for concept based information retrieval in different domains. To demonstrate the practical workability of this approach, a set of web pages that contain synonyms and homonyms were indexed and can be queried via a search engine like query frontend. However, the ontology based indexing approach can also be used for other data mining applications such text clustering, relation mining and for searching free text fields in biological databases. The ontology alignment methods and some of the text mining principles described in this publication are now incorporated into the ONDEX system http://ondex.sourceforge.net/.

0.018162236 = product of:
  0.03632447 = sum of:
    0.03632447 = product of:
      0.07264894 = sum of:
        0.07264894 = weight(_text_:indexing in 97) [ClassicSimilarity], result of:
          0.07264894 = score(doc=97,freq=6.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.3662626 = fieldWeight in 97, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.0390625 = fieldNorm(doc=97)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Robertson and Spärck Jones pioneered experimental probabilistic models (Binary Independence Model) with both a typology generalizing the Boolean model, a frequency counting to calculate elementary weightings, and their combination into a global probabilistic estimation. However, this model did not consider indexing terms dependencies. An extension to mixture models (e.g., using a 2-Poisson law) made it possible to take into account these dependencies from a macroscopic point of view (BM25), as well as a shallow linguistic processing of co-references. New approaches (language models, for example "bag of words" models, probabilistic dependencies between requests and documents, and consequently Bayesian inference using Dirichlet prior conjugate) furnished new solutions for documents structuring (categorization) and for index smoothing. Presently, in these probabilistic models the main issues have been addressed from a formal point of view only. Thus, linguistic properties are neglected in the indexing language. The authors examine how a linguistic and semantic modeling can be integrated in indexing languages and set up a hybrid model that makes it possible to deal with different information retrieval problems in a unified way.

0.017795283 = product of:
  0.035590567 = sum of:
    0.035590567 = product of:
      0.07118113 = sum of:
        0.07118113 = weight(_text_:indexing in 847) [ClassicSimilarity], result of:
          0.07118113 = score(doc=847,freq=4.0), product of:
            0.19835205 = queryWeight, product of:
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.051817898 = queryNorm
            0.3588626 = fieldWeight in 847, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.8278677 = idf(docFreq=2614, maxDocs=44218)
              0.046875 = fieldNorm(doc=847)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

In an ongoing investigation of the relationship between Jason Farradane's relational indexing principles and concept combination in Web-based information on Alzheimer's Disease, the hyperlinks of three consumer health information websites are examined to see how well the linking relationships map to Farradane's relational operators, as well as to the linking attributes in HTML 5. The links were found to be largely bibliographic in nature, and as such mapped well onto HTML 5. Farradane's operators were less effective at capturing the individual links; nonetheless, the two dimensions of his relational matrix-association and discrimination-reveal a crucial underlying strategy of the emotionally-charged mediation between complex information and users who are consulting it under severe stress.

0.017551525 = product of:
  0.03510305 = sum of:
    0.03510305 = product of:
      0.0702061 = sum of:
        0.0702061 = weight(_text_:22 in 6089) [ClassicSimilarity], result of:
          0.0702061 = score(doc=6089,freq=2.0), product of:
            0.18145745 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051817898 = queryNorm
            0.38690117 = fieldWeight in 6089, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=6089)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Pages

S.11-22