Search (5 results, page 1 of 1)

0.02351077 = product of:
  0.09404308 = sum of:
    0.09404308 = product of:
      0.18808617 = sum of:
        0.18808617 = weight(_text_:terminology in 4067) [ClassicSimilarity], result of:
          0.18808617 = score(doc=4067,freq=10.0), product of:
            0.24053115 = queryWeight, product of:
              5.2752647 = idf(docFreq=614, maxDocs=44218)
              0.045596033 = queryNorm
            0.7819618 = fieldWeight in 4067, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              5.2752647 = idf(docFreq=614, maxDocs=44218)
              0.046875 = fieldNorm(doc=4067)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Controlled terminologies such as classification schemes, name authorities, and thesauri have long been the domain of the library and information science community. Although historically there have been initiatives towards library style classification of web resources, there remain significant problems with searching and quality judgement of online content. Terminology services can play a key role in opening up access to these valuable resources. By exposing controlled terminologies via a web service, organisations maintain data integrity and version control, whilst motivating external users to design innovative ways to present and utilise their data. We introduce terminology web services and review work in the area. We describe the approaches taken in establishing application programming interfaces (API) and discuss the comparative benefits of a dedicated terminology web service versus general purpose programming languages. We discuss experiences at Glamorgan in creating terminology web services and associated client interface components, in particular for the archaeology domain in the STAR (Semantic Technologies for Archaeological Resources) Project.

0.020947421 = product of:
  0.083789684 = sum of:
    0.083789684 = weight(_text_:headings in 3179) [ClassicSimilarity], result of:
      0.083789684 = score(doc=3179,freq=4.0), product of:
        0.22113821 = queryWeight, product of:
          4.849944 = idf(docFreq=940, maxDocs=44218)
          0.045596033 = queryNorm
        0.3789019 = fieldWeight in 3179, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.849944 = idf(docFreq=940, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3179)
  0.25 = coord(1/4)

Abstract

There are many advantages for Digital Libraries in indexing with classifications or thesauri, but some current disincentive in the lack of flexible retrieval tools that deal with compound descriptors. This paper discusses a matching function for compound descriptors, or multi-concept subject headings, that does not rely an exact matching but incorporates term expansion via thesaurus semantic relationships to produce ranked results that take account of missing and partially matching terms. The matching function is based an a measure of semantic closeness between terms, which has the potential to help with recall problems. The work reported is part of the ongoing FACET project in collaboration with the National Museum of Science and Industry and its collections database. The architecture of the prototype system and its Interface are outlined. The matching problem for compound descriptors is reviewed and the FACET implementation described. Results are discussed from scenarios using the faceted Getty Art and Architecture Thesaurus. We argue that automatic traversal of thesaurus relationships can augment the user's browsing possibilities. The techniques can be applied both to unstructured multi-concept subject headings and potentially to more syntactically structured strings. The notion of a focus term is used by the matching function to model AAT modified descriptors (noun phrases). The relevance of the approach to precoordinated indexing and matching faceted strings is discussed.

0.01184965 = product of:
  0.0473986 = sum of:
    0.0473986 = weight(_text_:headings in 175) [ClassicSimilarity], result of:
      0.0473986 = score(doc=175,freq=2.0), product of:
        0.22113821 = queryWeight, product of:
          4.849944 = idf(docFreq=940, maxDocs=44218)
          0.045596033 = queryNorm
        0.21433927 = fieldWeight in 175, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.849944 = idf(docFreq=940, maxDocs=44218)
          0.03125 = fieldNorm(doc=175)
  0.25 = coord(1/4)

Abstract

There are many advantages for Digital Libraries in indexing with classifications or thesauri, but some current disincentive in the lack of flexible retrieval tools that deal with compound descriptors. This demonstration of a research prototype illustrates a matching function for compound descriptors, or multi-concept subject headings, that does not rely on exact matching but incorporates term expansion via thesaurus semantic relationships to produce ranked results that take account of missing and partially matching terms. The matching function is based on a measure of semantic closeness between terms.The work is part of the EPSRC funded FACET project in collaboration with the UK National Museum of Science and Industry (NMSI) which includes the National Railway Museum. An export of NMSI's Collections Database is used as the dataset for the research. The J. Paul Getty Trust's Art and Architecture Thesaurus (AAT) is the main thesaurus in the project. The AAT is a widely used thesaurus (over 120,000 terms). Descriptors are organised in 7 facets representing separate conceptual classes of terms.The FACET application is a multi tiered architecture accessing a SQL Server database, with an OLE DB connection. The thesauri are stored as relational tables in the Server's database. However, a key component of the system is a parallel representation of the underlying semantic network as an in-memory structure of thesaurus concepts (corresponding to preferred terms). The structure models the hierarchical and associative interrelationships of thesaurus concepts via weighted poly-hierarchical links. Its primary purpose is real-time semantic expansion of query terms, achieved by a spreading activation semantic closeness algorithm. Queries with associated results are stored persistently using XML format data. A Visual Basic interface combines a thesaurus browser and an initial term search facility that takes into account equivalence relationships. Terms are dragged to a direct manipulation Query Builder which maintains the facet structure.

0.009913011 = product of:
  0.039652046 = sum of:
    0.039652046 = product of:
      0.07930409 = sum of:
        0.07930409 = weight(_text_:terminology in 1955) [ClassicSimilarity], result of:
          0.07930409 = score(doc=1955,freq=4.0), product of:
            0.24053115 = queryWeight, product of:
              5.2752647 = idf(docFreq=614, maxDocs=44218)
              0.045596033 = queryNorm
            0.32970405 = fieldWeight in 1955, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.2752647 = idf(docFreq=614, maxDocs=44218)
              0.03125 = fieldNorm(doc=1955)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Dublin Core recommends controlled terminology for the subject of a resource. Knowledge organization systems (KOS), such as classifications, gazetteers, taxonomies and thesauri, provide controlled vocabularies that organize and structure concepts for indexing, classifying, browsing and search. For example, a thesaurus employs a set of standard semantic relationships (ISO 2788, ISO 5964), and major thesauri have a large entry vocabulary of terms considered equivalent for retrieval purposes. Many KOS have been made available for Web-based access. However, they are often not fully integrated into indexing and search systems and the full potential for networked and programmatic access remains untapped. The lack of standardized access and interchange formats impedes wider use of KOS resources. We developed a Web demonstrator (www.comp.glam.ac.uk/~FACET/webdemo/) for the FACET project (www.comp.glam.ac.uk/~facet/facetproject.html) that explored thesaurus-based query expansion with the Getty Art and Architecture Thesaurus. A Web demonstrator was implemented via Active Server Pages (ASP) with server-side scripting and compiled server-side components for database access, and cascading style sheets for presentation. The browser-based interactive interface permits dynamic control of query term expansion. However, being based on a custom thesaurus representation and API, the techniques cannot be applied directly to thesauri in other formats on the Web. General programmatic access requires commonly agreed protocols, for example, building on Web and Grid services. The development of common KOS representation formats and service protocols are closely linked. Linda Hill and colleagues argued in 2002 for a general KOS service protocol from which protocols for specific types of KOS can be derived. Thus, in the future, a combination of thesaurus and query protocols might permit a thesaurus to be used with a choice of search tools on various kinds of databases. Service-oriented architectures bring an opportunity for moving toward a clearer separation of interface components from the underlying data sources. In our view, basing distributed protocol services on the atomic elements of thesaurus data structures and relationships is not necessarily the best approach because client operations that require multiple client-server calls would carry too much overhead. This would limit the interfaces that could be offered by applications following such a protocol. Advanced interactive interfaces require protocols that group primitive thesaurus data elements (via their relationships) into composites to achieve reasonable response.

0.008761947 = product of:
  0.03504779 = sum of:
    0.03504779 = product of:
      0.07009558 = sum of:
        0.07009558 = weight(_text_:terminology in 2215) [ClassicSimilarity], result of:
          0.07009558 = score(doc=2215,freq=2.0), product of:
            0.24053115 = queryWeight, product of:
              5.2752647 = idf(docFreq=614, maxDocs=44218)
              0.045596033 = queryNorm
            0.29141995 = fieldWeight in 2215, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.2752647 = idf(docFreq=614, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2215)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Purpose - The purpose of this paper is to explore query expansion via conceptual distance in thesaurus indexed collections Design/methodology/approach - An extract of the National Museum of Science and Industry's collections database, indexed with the Getty Art and Architecture Thesaurus (AAT), was the dataset for the research. The system architecture and algorithms for semantic closeness and the matching function are outlined. Standalone and web interfaces are described and formative qualitative user studies are discussed. One user session is discussed in detail, together with a scenario based on a related public inquiry. Findings are set in context of the literature on thesaurus-based query expansion. This paper discusses the potential of query expansion techniques using the semantic relationships in a faceted thesaurus. Findings - Thesaurus-assisted retrieval systems have potential for multi-concept descriptors, permitting very precise queries and indexing. However, indexer and searcher may differ in terminology judgments and there may not be any exactly matching results. The integration of semantic closeness in the matching function permits ranked results for multi-concept queries in thesaurus-indexed applications. An in-memory representation of the thesaurus semantic network allows a combination of automatic and interactive control of expansion and control of expansion on individual query terms. Originality/value - The application of semantic expansion to browsing may be useful in interface options where thesaurus structure is hidden.