-
Hartmann, K.: Pressedatenbank: Online-Retrieval und gedruckte Register (1984)
0.06
0.058622193 = product of:
0.20517766 = sum of:
0.0058590267 = product of:
0.029295133 = sum of:
0.029295133 = weight(_text_:retrieval in 5184) [ClassicSimilarity], result of:
0.029295133 = score(doc=5184,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.26736724 = fieldWeight in 5184, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0625 = fieldNorm(doc=5184)
0.2 = coord(1/5)
0.19931863 = weight(_text_:abfrage in 5184) [ClassicSimilarity], result of:
0.19931863 = score(doc=5184,freq=2.0), product of:
0.28580084 = queryWeight, product of:
7.890225 = idf(docFreq=44, maxDocs=44218)
0.03622214 = queryNorm
0.6974039 = fieldWeight in 5184, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
7.890225 = idf(docFreq=44, maxDocs=44218)
0.0625 = fieldNorm(doc=5184)
0.2857143 = coord(2/7)
- Abstract
- Das PDS-Registerprogramm wird zur Produktion von Registern der Gruner+Jahr-Zeitschriften verwandt. Zusammen mit der Pressedatenbank können die Vorteile einer Suche in gedruckten Registern mit denen der Online-Recherche verbunden werden. Das Registerprogramm arbeitet mit einem modifizierten KWOC-Verfahren, das dem Indexierer eine genaue Steuerung der Registereinträge ermöglicht. Die Ausgabe kann über übliche DV-Drucker, z.B. Laserdrucker oder Lichtsatz erfolgen. Ein Bildschrimtextanschluß für die Online-Abfrage ist eingerichtet
-
Riesthuis, G.J.A.: Alphabetische Sachregister und Klassifikation (1986)
0.01
0.00813299 = product of:
0.05693093 = sum of:
0.05693093 = product of:
0.11386186 = sum of:
0.11386186 = weight(_text_:zugriff in 1557) [ClassicSimilarity], result of:
0.11386186 = score(doc=1557,freq=2.0), product of:
0.2160124 = queryWeight, product of:
5.963546 = idf(docFreq=308, maxDocs=44218)
0.03622214 = queryNorm
0.52710795 = fieldWeight in 1557, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.963546 = idf(docFreq=308, maxDocs=44218)
0.0625 = fieldNorm(doc=1557)
0.5 = coord(1/2)
0.14285715 = coord(1/7)
- Abstract
- Anhand von 2 alphabetischen Sachregistern der Zeitschrift für Buch- und Druckgeschichte "Het Boek" wird dargestellt, welche Rolle die Klassifikation in Sachregistern spielt bei der Wahl der Erschließungseinheiten und bei der Bestimmung der Indexierungstiefe. Als Hauptfunktion der Klassifikation bei Registern erweist sich jedoch die Erleichterung und Verbesserung des Suchvorganges. Erklärt wird, wie die Methode des ersten Registers, Klassifizierung spezifischer Begriffe unter hierarchisch höhere Begriffe, nicht zum Ziel führt und wie die Kontextmethode einen besseren Zugriff gewährleistet
-
Bennion, B.C.: Performance testing of a book and its index as an information retrieval system (1980)
0.01
0.0061054146 = product of:
0.0427379 = sum of:
0.0427379 = product of:
0.10684475 = sum of:
0.051266484 = weight(_text_:retrieval in 7763) [ClassicSimilarity], result of:
0.051266484 = score(doc=7763,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.46789268 = fieldWeight in 7763, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.109375 = fieldNorm(doc=7763)
0.055578265 = weight(_text_:system in 7763) [ClassicSimilarity], result of:
0.055578265 = score(doc=7763,freq=2.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.4871716 = fieldWeight in 7763, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.109375 = fieldNorm(doc=7763)
0.4 = coord(2/5)
0.14285715 = coord(1/7)
-
Craven, T.C.: Adapting of string indexing systems for retrieval using proximity operators (1988)
0.00
0.0041822046 = product of:
0.029275432 = sum of:
0.029275432 = product of:
0.07318858 = sum of:
0.04142957 = weight(_text_:retrieval in 705) [ClassicSimilarity], result of:
0.04142957 = score(doc=705,freq=4.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.37811437 = fieldWeight in 705, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0625 = fieldNorm(doc=705)
0.03175901 = weight(_text_:system in 705) [ClassicSimilarity], result of:
0.03175901 = score(doc=705,freq=2.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.27838376 = fieldWeight in 705, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0625 = fieldNorm(doc=705)
0.4 = coord(2/5)
0.14285715 = coord(1/7)
- Abstract
- This article explores the idea of using a conventional string indexing source description, together with a special phrase generator, to generate multiple descriptor phrases for inclusion in a database record for online retrieval. For use with proximity operators, these multiple descriptor phrases should attempt to meet such objectives as bringing together groups of syntactically related words. Software for generating multiple descriptor phrases from source descriptions in a specific existing string indexing system is briefly described
-
Luhn, H.P.: Keyword-in-context index for technical literature (1985)
0.00
0.002258732 = product of:
0.015811123 = sum of:
0.015811123 = product of:
0.039527807 = sum of:
0.025633242 = weight(_text_:retrieval in 3638) [ClassicSimilarity], result of:
0.025633242 = score(doc=3638,freq=8.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.23394634 = fieldWeight in 3638, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.02734375 = fieldNorm(doc=3638)
0.013894566 = weight(_text_:system in 3638) [ClassicSimilarity], result of:
0.013894566 = score(doc=3638,freq=2.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.1217929 = fieldWeight in 3638, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.02734375 = fieldNorm(doc=3638)
0.4 = coord(2/5)
0.14285715 = coord(1/7)
- Abstract
- In the optimistic 1960s the potential of the computer seemed limitless. The realization of this potential in the area of information retrieval and dissemination owes much to the creative mind of Hans Peter Luhn. A pioneer of information science, he had a mind and an imagination that could transcend the state of the art. Luhn was born in Germany, where he studied technology, physics, and accounting. He came to the United States in 1924 and in 1941, at the age of 45, he joined IBM. In the course of his twenty-year tenure at IBM, he was issued over eighty patents; at one time he held more than any other IBM employee. Luhn is credited with originating KWIC indexes, computer selective dissemination systems (SDI), computer coding schemes, and statistical techniques for automatic indexing and abstracting. Also attributed to him is the first modern use of the word "thesaurus." The selection that follows modestly presents the idea of a Keyword in Context (KWIC) index. This is the idea of automatically identifying significant or "key" words and highlighting them in context. The context in question was normally a title. Though title term or catchword indexing had been practiced for over one hundred years, the implementation of the idea in mechanized systems in the 1960s was not trivial. It required programming the computer to recognize word boundaries and then developing a means for automatically differentiating significant from nonsignificant words. Spaces were used to demarcate word boundaries and a stop list, consisting of articles, conjunctions, prepositions, auxiliary verbs, some adjectives, and some very common words, was used to differentiate significant from nonsignificant words. A difficulty with any automatic indexing limited to extracting single words from texts is the semantic indeterminancy of the extracted character strings. To disambiguate these, Luhn adopted the concordance idea, proposing to display them in the context of their titles. Specifying the meaning of an index term by couching it in "context," anticipated the later development of string index languages such as PRECIS (PREserved Context Index System). Although the selection that follows is quite short, it presents, in addition to the idea of KWIC, what at the time were two innovative ideas. One is the distinction between the dissemination and the retrieval of information, in regard to which Luhn makes a point sometimes overlooked by modern critics of KWIC. This is that different purposes require different kinds of indexes; an index that is used to disseminate information for current awareness need not be as "perfect" as one used for retrospective information retrieval. The need to alert researchers to current information quickly, and the somewhat transitory character of this information, make KWIC, albeit quick and dirty, a costeffective alternative for dissemination indexes. The second harbinger idea is a method of uniquely identifying documents for retrieval using an identification code comprising the initial characters from a document's author, title, and - interestingly - year of publication. Luhn's mind was fertile indeed and he is aptly called a pioneer of information science.
-
Craven, T. C.: String indexing (1986)
0.00
0.0016040723 = product of:
0.0112285055 = sum of:
0.0112285055 = product of:
0.056142528 = sum of:
0.056142528 = weight(_text_:system in 5604) [ClassicSimilarity], result of:
0.056142528 = score(doc=5604,freq=4.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.49211764 = fieldWeight in 5604, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.078125 = fieldNorm(doc=5604)
0.2 = coord(1/5)
0.14285715 = coord(1/7)
- LCSH
- NEPHIS (Indexing system)
- Subject
- NEPHIS (Indexing system)
-
Anderson, J.D.; Radford, G.: Back-of-the-book indexing with the nested phrase indexing system (NEPHIS) (1988)
0.00
0.0012832579 = product of:
0.008982805 = sum of:
0.008982805 = product of:
0.044914022 = sum of:
0.044914022 = weight(_text_:system in 653) [ClassicSimilarity], result of:
0.044914022 = score(doc=653,freq=4.0), product of:
0.11408355 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.03622214 = queryNorm
0.3936941 = fieldWeight in 653, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0625 = fieldNorm(doc=653)
0.2 = coord(1/5)
0.14285715 = coord(1/7)
- Abstract
- NEPHIS, Craven's Nested Phrase Indexing System, transfers one more indexing procedure, the creation of individual index entries, to computer algorithm, permitting the human indexer to concentrate on the intellectual task of analyzing text and naming its important features. Experience at Rutgers University has shown that novice indexers can learn NEPHIS quite quickly and can use it to produce acceptable indexes
-
Hartmann, K.: PDS: Retrievalsoftware für die Pressedatenbank (1984)
0.00
8.3700387E-4 = product of:
0.0058590267 = sum of:
0.0058590267 = product of:
0.029295133 = sum of:
0.029295133 = weight(_text_:retrieval in 5185) [ClassicSimilarity], result of:
0.029295133 = score(doc=5185,freq=2.0), product of:
0.109568894 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.03622214 = queryNorm
0.26736724 = fieldWeight in 5185, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0625 = fieldNorm(doc=5185)
0.2 = coord(1/5)
0.14285715 = coord(1/7)
- Abstract
- Die PDS - Pressedatenbank Retrieval Software - ist eine neue Informationsdatenbank-Software. Sie ist einsatzfähig für Literaturhinweise und Volltextspeicherung. Sie läuft auf IBM-kompatiblem Rechnern. Sie wurde auf dem Hintergrund zehnjähriger Erfahrung im Umgang mit Datenbanken entworfen. PDS verfügt über eine einzigartige phonetische Abfragemöglichkeit, über ein Programm zur Herstellung gedruckter Register und eine Schnittstelle zu dem elektronischen Massenspeicher MEGADOC von Philips. In der G+J Pressedatenbank sind derzeit mehr als 1,4 Mio Datensätze gespeichert. Die G+J Dokumentation versorgt mehr als 800 Redakteure mit Textinformation und Bildern
