Search (4 results, page 1 of 1)

0.008252066 = product of:
  0.049512394 = sum of:
    0.049512394 = weight(_text_:network in 2215) [ClassicSimilarity], result of:
      0.049512394 = score(doc=2215,freq=2.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.2460165 = fieldWeight in 2215, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2215)
  0.16666667 = coord(1/6)

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.

0.006601652 = product of:
  0.039609913 = sum of:
    0.039609913 = weight(_text_:network in 175) [ClassicSimilarity], result of:
      0.039609913 = score(doc=175,freq=2.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.1968132 = fieldWeight in 175, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.03125 = fieldNorm(doc=175)
  0.16666667 = coord(1/6)

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.0038810428 = product of:
  0.023286257 = sum of:
    0.023286257 = product of:
      0.046572514 = sum of:
        0.046572514 = weight(_text_:resources in 1014) [ClassicSimilarity], result of:
          0.046572514 = score(doc=1014,freq=2.0), product of:
            0.16496566 = queryWeight, product of:
              3.650338 = idf(docFreq=3122, maxDocs=44218)
              0.045191888 = queryNorm
            0.28231642 = fieldWeight in 1014, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.650338 = idf(docFreq=3122, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1014)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Abstract

Creating an information architecture for a bilingual Web site presents particular challenges beyond those that exist for single and multilanguage sites. This article reports work in progress an the development of a contentbased bilingual Web site to facilitate the sharing of resources and information between Speech and Language Therapists. The development of the information architecture is based an a combination of two aspects: an abstract structural analysis of existing bilingual Web designs focusing an the presentation of bilingual material, and a bilingual card-sorting activity conducted with potential users. Issues for bilingual developments are discussed, and some observations are made regarding the use of card-sorting activities.

0.0019405214 = product of:
  0.0116431285 = sum of:
    0.0116431285 = product of:
      0.023286257 = sum of:
        0.023286257 = weight(_text_:resources in 2677) [ClassicSimilarity], result of:
          0.023286257 = score(doc=2677,freq=2.0), product of:
            0.16496566 = queryWeight, product of:
              3.650338 = idf(docFreq=3122, maxDocs=44218)
              0.045191888 = queryNorm
            0.14115821 = fieldWeight in 2677, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.650338 = idf(docFreq=3122, maxDocs=44218)
              0.02734375 = fieldNorm(doc=2677)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)

Abstract

This paper discusses research that employs methods from Natural Language Processing (NLP) in exploiting the intellectual resources of Knowledge Organization Systems (KOS), particularly in the retrieval of information. A technique for the disambiguation of homographs and nominal compounds in free text, where these are known ambiguous terms in the KOS itself, is described. The use of Roget's Thesaurus as an intermediary in the process is also reported. A short review of the relevant literature in the field is given. Design considerations, results and conclusions are presented from the implementation of a prototype system. The linguistic techniques are applied at two complementary levels, namely an a free text string used as an entry point to the KOS, and an the underlying controlled vocabulary itself.