-
Assem, M. van: Converting and integrating vocabularies for the Semantic Web (2010)
0.02
0.016011713 = product of:
0.040029284 = sum of:
0.032278713 = weight(_text_:context in 4639) [ClassicSimilarity], result of:
0.032278713 = score(doc=4639,freq=2.0), product of:
0.17622331 = queryWeight, product of:
4.14465 = idf(docFreq=1904, maxDocs=44218)
0.04251826 = queryNorm
0.18316938 = fieldWeight in 4639, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.14465 = idf(docFreq=1904, maxDocs=44218)
0.03125 = fieldNorm(doc=4639)
0.0077505717 = product of:
0.023251714 = sum of:
0.023251714 = weight(_text_:29 in 4639) [ClassicSimilarity], result of:
0.023251714 = score(doc=4639,freq=2.0), product of:
0.14956595 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.04251826 = queryNorm
0.15546128 = fieldWeight in 4639, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03125 = fieldNorm(doc=4639)
0.33333334 = coord(1/3)
0.4 = coord(2/5)
- Abstract
- This thesis focuses on conversion of vocabularies for representation and integration of collections on the Semantic Web. A secondary focus is how to represent metadata schemas (RDF Schemas representing metadata element sets) such that they interoperate with vocabularies. The primary domain in which we operate is that of cultural heritage collections. The background worldview in which a solution is sought is that of the Semantic Web research paradigmwith its associated theories, methods, tools and use cases. In other words, we assume the SemanticWeb is in principle able to provide the context to realize interoperable collections. Interoperability is dependent on the interplay between representations and the applications that use them. We mean applications in the widest sense, such as "search" and "annotation". These applications or tasks are often present in software applications, such as the E-Culture application. It is therefore necessary that applications requirements on the vocabulary representation are met. This leads us to formulate the following problem statement: HOW CAN EXISTING VOCABULARIES BE MADE AVAILABLE TO SEMANTIC WEB APPLICATIONS?
- Date
- 29. 7.2011 14:44:56
-
Tudhope, D.; Alani, H.; Jones, C.: Augmenting thesaurus relationships : possibilities for retrieval (2001)
0.01
0.011412249 = product of:
0.057061244 = sum of:
0.057061244 = weight(_text_:context in 1520) [ClassicSimilarity], result of:
0.057061244 = score(doc=1520,freq=4.0), product of:
0.17622331 = queryWeight, product of:
4.14465 = idf(docFreq=1904, maxDocs=44218)
0.04251826 = queryNorm
0.32380077 = fieldWeight in 1520, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
4.14465 = idf(docFreq=1904, maxDocs=44218)
0.0390625 = fieldNorm(doc=1520)
0.2 = coord(1/5)
- Abstract
- This paper discusses issues concerning the augmentation of thesaurus relationships, in light of new application possibilities for retrieval. We first discuss a case study that explored the retrieval potential of an augmented set of thesaurus relationships by specialising standard relationships into richer subtypes, in particular hierarchical geographical containment and the associative relationship. We then locate this work in a broader context by reviewing various attempts to build taxonomies of thesaurus relationships, and conclude by discussing the feasibility of hierarchically augmenting the core set of thesaurus relationships, particularly the associative relationship. We discuss the possibility of enriching the specification and semantics of Related Term (RT relationships), while maintaining compatibility with traditional thesauri via a limited hierarchical extension of the associative (and hierarchical) relationships. This would be facilitated by distinguishing the type of term from the (sub)type of relationship and explicitly specifying semantic categories for terms following a faceted approach. We first illustrate how hierarchical spatial relationships can be used to provide more flexible retrieval for queries incorporating place names in applications employing online gazetteers and geographical thesauri. We then employ a set of experimental scenarios to investigate key issues affecting use of the associative (RT) thesaurus relationships in semantic distance measures. Previous work has noted the potential of RTs in thesaurus search aids but also the problem of uncontrolled expansion of query term sets. Results presented in this paper suggest the potential for taking account of the hierarchical context of an RT link and specialisations of the RT relationship
-
Tavakolizadeh-Ravari, M.: Analysis of the long term dynamics in thesaurus developments and its consequences (2017)
0.01
0.0071760663 = product of:
0.03588033 = sum of:
0.03588033 = weight(_text_:index in 3081) [ClassicSimilarity], result of:
0.03588033 = score(doc=3081,freq=2.0), product of:
0.18579477 = queryWeight, product of:
4.369764 = idf(docFreq=1520, maxDocs=44218)
0.04251826 = queryNorm
0.1931181 = fieldWeight in 3081, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.369764 = idf(docFreq=1520, maxDocs=44218)
0.03125 = fieldNorm(doc=3081)
0.2 = coord(1/5)
- Abstract
- Die Arbeit analysiert die dynamische Entwicklung und den Gebrauch von Thesaurusbegriffen. Zusätzlich konzentriert sie sich auf die Faktoren, die die Zahl von Indexbegriffen pro Dokument oder Zeitschrift beeinflussen. Als Untersuchungsobjekt dienten der MeSH und die entsprechende Datenbank "MEDLINE". Die wichtigsten Konsequenzen sind: 1. Der MeSH-Thesaurus hat sich durch drei unterschiedliche Phasen jeweils logarithmisch entwickelt. Solch einen Thesaurus sollte folgenden Gleichung folgen: "T = 3.076,6 Ln (d) - 22.695 + 0,0039d" (T = Begriffe, Ln = natürlicher Logarithmus und d = Dokumente). Um solch einen Thesaurus zu konstruieren, muss man demnach etwa 1.600 Dokumente von unterschiedlichen Themen des Bereiches des Thesaurus haben. Die dynamische Entwicklung von Thesauri wie MeSH erfordert die Einführung eines neuen Begriffs pro Indexierung von 256 neuen Dokumenten. 2. Die Verteilung der Thesaurusbegriffe erbrachte drei Kategorien: starke, normale und selten verwendete Headings. Die letzte Gruppe ist in einer Testphase, während in der ersten und zweiten Kategorie die neu hinzukommenden Deskriptoren zu einem Thesauruswachstum führen. 3. Es gibt ein logarithmisches Verhältnis zwischen der Zahl von Index-Begriffen pro Aufsatz und dessen Seitenzahl für die Artikeln zwischen einer und einundzwanzig Seiten. 4. Zeitschriftenaufsätze, die in MEDLINE mit Abstracts erscheinen erhalten fast zwei Deskriptoren mehr. 5. Die Findablity der nicht-englisch sprachigen Dokumente in MEDLINE ist geringer als die englische Dokumente. 6. Aufsätze der Zeitschriften mit einem Impact Factor 0 bis fünfzehn erhalten nicht mehr Indexbegriffe als die der anderen von MEDINE erfassten Zeitschriften. 7. In einem Indexierungssystem haben unterschiedliche Zeitschriften mehr oder weniger Gewicht in ihrem Findability. Die Verteilung der Indexbegriffe pro Seite hat gezeigt, dass es bei MEDLINE drei Kategorien der Publikationen gibt. Außerdem gibt es wenige stark bevorzugten Zeitschriften."
-
Doerr, M.: Semantic problems of thesaurus mapping (2001)
0.01
0.0065901205 = product of:
0.032950602 = sum of:
0.032950602 = weight(_text_:system in 5902) [ClassicSimilarity], result of:
0.032950602 = score(doc=5902,freq=4.0), product of:
0.13391352 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.04251826 = queryNorm
0.24605882 = fieldWeight in 5902, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0390625 = fieldNorm(doc=5902)
0.2 = coord(1/5)
- Abstract
- With networked information access to heterogeneous data sources, the problem of terminology provision and interoperability of controlled vocabulary schemes such as thesauri becomes increasingly urgent. Solutions are needed to improve the performance of full-text retrieval systems and to guide the design of controlled terminology schemes for use in structured data, including metadata. Thesauri are created in different languages, with different scope and points of view and at different levels of abstraction and detail, to accomodate access to a specific group of collections. In any wider search accessing distributed collections, the user would like to start with familiar terminology and let the system find out the correspondences to other terminologies in order to retrieve equivalent results from all addressed collections. This paper investigates possible semantic differences that may hinder the unambiguous mapping and transition from one thesaurus to another. It focusses on the differences of meaning of terms and their relations as intended by their creators for indexing and querying a specific collection, in contrast to methods investigating the statistical relevance of terms for objects in a collection. It develops a notion of optimal mapping, paying particular attention to the intellectual quality of mappings between terms from different vocabularies and to problems of polysemy. Proposals are made to limit the vagueness introduced by the transition from one vocabulary to another. The paper shows ways in which thesaurus creators can improve their methodology to meet the challenges of networked access of distributed collections created under varying conditions. For system implementers, the discussion will lead to a better understanding of the complexity of the problem
-
Jing, Y.; Croft, W.B.: ¬An association thesaurus for information retrieval (199?)
0.01
0.006523886 = product of:
0.03261943 = sum of:
0.03261943 = weight(_text_:system in 4494) [ClassicSimilarity], result of:
0.03261943 = score(doc=4494,freq=2.0), product of:
0.13391352 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.04251826 = queryNorm
0.2435858 = fieldWeight in 4494, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=4494)
0.2 = coord(1/5)
- Abstract
- Although commonly used in both commercial and experimental information retrieval systems, thesauri have not demonstrated consistent benefits for retrieval performance, and it is difficult to construct a thesaurus automatically for large text databases. In this paper, an approach, called PhraseFinder, is proposed to construct collection-dependent association thesauri automatically using large full-text document collections. The association thesaurus can be accessed through natural language queries in INQUERY, an information retrieval system based on the probabilistic inference network. Experiments are conducted in INQUERY to evaluate different types of association thesauri, and thesauri constructed for a variety of collections
-
Thesaurus software (2001)
0.01
0.006523886 = product of:
0.03261943 = sum of:
0.03261943 = weight(_text_:system in 6773) [ClassicSimilarity], result of:
0.03261943 = score(doc=6773,freq=2.0), product of:
0.13391352 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.04251826 = queryNorm
0.2435858 = fieldWeight in 6773, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=6773)
0.2 = coord(1/5)
- Abstract
- Members offer comments and suggest resources on programs for creating, maintaining, and publishing thesauri. Formerly a tool for writers and indexers, the thesaurus has taken on a new role as an essential component of the corporate information infrastructure. Many people are using word processor or database programs to create and maintain thesauri, while others are using specialized tools that perform consistency checks and offer special reporting capabilities. Some also use thesaurus modules integrated into another application, such as web publishing, content management, or e-commerce. This article includes material comes from our own experience, email responses from members, and comments from participants in our seminars and roundtables. There's also an introduction to thesauri in a corporate information management system
-
Martínez-González, M.M.; Alvite-Díez, M.L.: Thesauri and Semantic Web : discussion of the evolution of thesauri toward their integration with the Semantic Web (2019)
0.00
0.0046599186 = product of:
0.023299592 = sum of:
0.023299592 = weight(_text_:system in 5997) [ClassicSimilarity], result of:
0.023299592 = score(doc=5997,freq=2.0), product of:
0.13391352 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.04251826 = queryNorm
0.17398985 = fieldWeight in 5997, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0390625 = fieldNorm(doc=5997)
0.2 = coord(1/5)
- Abstract
- Thesauri are Knowledge Organization Systems (KOS), that arise from the consensus of wide communities. They have been in use for many years and are regularly updated. Whereas in the past thesauri were designed for information professionals for indexing and searching, today there is a demand for conceptual vocabularies that enable inferencing by machines. The development of the Semantic Web has brought a new opportunity for thesauri, but thesauri also face the challenge of proving that they add value to it. The evolution of thesauri toward their integration with the Semantic Web is examined. Elements and structures in the thesaurus standard, ISO 25964, and SKOS (Simple Knowledge Organization System), the Semantic Web standard for representing KOS, are reviewed and compared. Moreover, the integrity rules of thesauri are contrasted with the axioms of SKOS. How SKOS has been applied to represent some real thesauri is taken into account. Three thesauri are chosen for this aim: AGROVOC, EuroVoc and the UNESCO Thesaurus. Based on the results of this comparison and analysis, the benefits that Semantic Web technologies offer to thesauri, how thesauri can contribute to the Semantic Web, and the challenges that would help to improve their integration with the Semantic Web are discussed.
-
Qin, J.; Paling, S.: Converting a controlled vocabulary into an ontology : the case of GEM (2001)
0.00
0.0046085096 = product of:
0.023042548 = sum of:
0.023042548 = product of:
0.06912764 = sum of:
0.06912764 = weight(_text_:22 in 3895) [ClassicSimilarity], result of:
0.06912764 = score(doc=3895,freq=2.0), product of:
0.1488917 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04251826 = queryNorm
0.46428138 = fieldWeight in 3895, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.09375 = fieldNorm(doc=3895)
0.33333334 = coord(1/3)
0.2 = coord(1/5)
- Date
- 24. 8.2005 19:20:22
-
Tudhope, D.; Hodge, G.: Terminology registries (2007)
0.00
0.0038404248 = product of:
0.019202124 = sum of:
0.019202124 = product of:
0.057606373 = sum of:
0.057606373 = weight(_text_:22 in 539) [ClassicSimilarity], result of:
0.057606373 = score(doc=539,freq=2.0), product of:
0.1488917 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.04251826 = queryNorm
0.38690117 = fieldWeight in 539, 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=539)
0.33333334 = coord(1/3)
0.2 = coord(1/5)
- Date
- 26.12.2011 13:22:07
-
Assem, M. van; Menken, M.R.; Schreiber, G.; Wielemaker, J.; Wielinga, B.: ¬A method for converting thesauri to RDF/OWL (2004)
0.00
0.0027127003 = product of:
0.013563501 = sum of:
0.013563501 = product of:
0.0406905 = sum of:
0.0406905 = weight(_text_:29 in 4644) [ClassicSimilarity], result of:
0.0406905 = score(doc=4644,freq=2.0), product of:
0.14956595 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.04251826 = queryNorm
0.27205724 = fieldWeight in 4644, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0546875 = fieldNorm(doc=4644)
0.33333334 = coord(1/3)
0.2 = coord(1/5)
- Date
- 29. 7.2011 14:44:56
-
Assem, M. van; Gangemi, A.; Schreiber, G.: Conversion of WordNet to a standard RDF/OWL representation (2006)
0.00
0.0023251716 = product of:
0.011625858 = sum of:
0.011625858 = product of:
0.034877572 = sum of:
0.034877572 = weight(_text_:29 in 4641) [ClassicSimilarity], result of:
0.034877572 = score(doc=4641,freq=2.0), product of:
0.14956595 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.04251826 = queryNorm
0.23319192 = fieldWeight in 4641, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.046875 = fieldNorm(doc=4641)
0.33333334 = coord(1/3)
0.2 = coord(1/5)
- Date
- 29. 7.2011 14:44:56
-
Assem, M. van; Malaisé, V.; Miles, A.; Schreiber, G.: ¬A method to convert thesauri to SKOS (2006)
0.00
0.0023251716 = product of:
0.011625858 = sum of:
0.011625858 = product of:
0.034877572 = sum of:
0.034877572 = weight(_text_:29 in 4642) [ClassicSimilarity], result of:
0.034877572 = score(doc=4642,freq=2.0), product of:
0.14956595 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.04251826 = queryNorm
0.23319192 = fieldWeight in 4642, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.046875 = fieldNorm(doc=4642)
0.33333334 = coord(1/3)
0.2 = coord(1/5)
- Date
- 29. 7.2011 14:44:56
