Search (3 results, page 1 of 1)

0.049861845 = sum of:
  0.045718916 = product of:
    0.18287566 = sum of:
      0.18287566 = weight(_text_:3a in 855) [ClassicSimilarity], result of:
        0.18287566 = score(doc=855,freq=2.0), product of:
          0.39046928 = queryWeight, product of:
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.046056706 = queryNorm
          0.46834838 = fieldWeight in 855, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.0390625 = fieldNorm(doc=855)
    0.25 = coord(1/4)
  0.0041429293 = product of:
    0.008285859 = sum of:
      0.008285859 = weight(_text_:a in 855) [ClassicSimilarity], result of:
        0.008285859 = score(doc=855,freq=12.0), product of:
          0.053105544 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.046056706 = queryNorm
          0.15602624 = fieldWeight in 855, product of:
            3.4641016 = tf(freq=12.0), with freq of:
              12.0 = termFreq=12.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0390625 = fieldNorm(doc=855)
    0.5 = coord(1/2)

Abstract

Converting UDC numbers manually to a complex format such as the one mentioned above is an unrealistic expectation; supporting building these representations, as far as possible automatically, is a well-founded requirement. An additional advantage of this approach is that the existing records could also be processed and converted. In my dissertation I would like to prove also that it is possible to design and implement an algorithm that is able to convert pre-coordinated UDC numbers into the introduced format by identifying all their elements and revealing their whole syntactic structure as well. In my dissertation I will discuss a feasible way of building a UDC-specific XML schema for describing the most detailed and complicated UDC numbers (containing not only the common auxiliary signs and numbers, but also the different types of special auxiliaries). The schema definition is available online at: http://piros.udc-interpreter.hu#xsd. The primary goal of my research is to prove that it is possible to support building, retrieving, and analyzing UDC numbers without compromises, by taking the whole syntactic richness of the scheme by storing the UDC numbers reserving the meaning of pre-coordination. The research has also included the implementation of a software that parses UDC classmarks attended to prove that such solution can be applied automatically without any additional effort or even retrospectively on existing collections.

Content

Vgl. auch: New automatic interpreter for complex UDC numbers. Unter: <https%3A%2F%2Fudcc.org%2Ffiles%2FAttilaPiros_EC_36-37_2014-2015.pdf&usg=AOvVaw3kc9CwDDCWP7aArpfjrs5b>

0.0020714647 = product of:
  0.0041429293 = sum of:
    0.0041429293 = product of:
      0.008285859 = sum of:
        0.008285859 = weight(_text_:a in 3853) [ClassicSimilarity], result of:
          0.008285859 = score(doc=3853,freq=12.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.15602624 = fieldWeight in 3853, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3853)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Analytico-synthetic and faceted classifications, such as Universal Decimal Classification (UDC) provide facilities to express pre-coordinated subject statements using syntactic relations. In this case, the relevance, in the process of UDC-based information retrieval, can be determined by extracting the meaning of the classmarks as precisely as is possible. The central question here is how the identification mentioned above can be supported by automatic means and an analysis of the structure of complex classmarks appears to be an obvious requirement. Many bibliographic sources contain complex UDC classmarks which are stored as simple text strings and on which it is very difficult to perform any meaningful information discovery. The paper presents results from a phase of ongoing research focused on developing a new platform-independent, machine-processable data format capable of representing the whole syntactic structure of the composite UDC numbers to support their further automatic processing. An algorithm that can produce the representation of the numbers in such a format directly from their designations has also been developed and implemented. The research also includes implementing conversion methods to provide outputs that can be employed by other software directly and, as a service, make them available for other software. The paper provides an overview of the solutions developed and implemented since 2015 and outlines future research plans.

Type

a

0.001913537 = product of:
  0.003827074 = sum of:
    0.003827074 = product of:
      0.007654148 = sum of:
        0.007654148 = weight(_text_:a in 2301) [ClassicSimilarity], result of:
          0.007654148 = score(doc=2301,freq=16.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.14413087 = fieldWeight in 2301, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.03125 = fieldNorm(doc=2301)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Analytico-synthetic and faceted classifications, such as Universal Decimal Classification (UDC) express content of documents with complex, pre-combined classification codes. Without classification authority control that would help manage and access structured notations, the use of UDC codes in searching and browsing is limited. Existing UDC parsing solutions are usually created for a particular database system or a specific task and are not widely applicable. The approach described in this paper provides a solution by which the analysis and interpretation of UDC notations would be stored into an intermediate format (in this case, in XML) by automatic means without any data or information loss. Due to its richness, the output file can be converted into different formats, such as standard mark-up and data exchange formats or simple lists of the recommended entry points of a UDC number. The program can also be used to create authority records containing complex UDC numbers which can be comprehensively analysed in order to be retrieved effectively. The Java program, as well as the corresponding schema definition it employs, is under continuous development. The current version of the interpreter software is now available online for testing purposes at the following web site: http://interpreter-eto.rhcloud.com. The future plan is to implement conversion methods for standard formats and to create standard online interfaces in order to make it possible to use the features of software as a service. This would result in the algorithm being able to be employed both in existing and future library systems to analyse UDC numbers without any significant programming effort.

Source

Classification and authority control: expanding resource discovery: proceedings of the International UDC Seminar 2015, 29-30 October 2015, Lisbon, Portugal. Eds.: Slavic, A. u. M.I. Cordeiro

Type

a