-
Greiner-Petter, A.; Schubotz, M.; Cohl, H.S.; Gipp, B.: Semantic preserving bijective mappings for expressions involving special functions between computer algebra systems and document preparation systems (2019)
0.01
0.01408102 = product of:
0.05632408 = sum of:
0.05632408 = sum of:
0.0316575 = weight(_text_:software in 5499) [ClassicSimilarity], result of:
0.0316575 = score(doc=5499,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.17532499 = fieldWeight in 5499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.03125 = fieldNorm(doc=5499)
0.024666581 = weight(_text_:22 in 5499) [ClassicSimilarity], result of:
0.024666581 = score(doc=5499,freq=2.0), product of:
0.15938555 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045514934 = queryNorm
0.15476047 = fieldWeight in 5499, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=5499)
0.25 = coord(1/4)
- Abstract
- Purpose Modern mathematicians and scientists of math-related disciplines often use Document Preparation Systems (DPS) to write and Computer Algebra Systems (CAS) to calculate mathematical expressions. Usually, they translate the expressions manually between DPS and CAS. This process is time-consuming and error-prone. The purpose of this paper is to automate this translation. This paper uses Maple and Mathematica as the CAS, and LaTeX as the DPS. Design/methodology/approach Bruce Miller at the National Institute of Standards and Technology (NIST) developed a collection of special LaTeX macros that create links from mathematical symbols to their definitions in the NIST Digital Library of Mathematical Functions (DLMF). The authors are using these macros to perform rule-based translations between the formulae in the DLMF and CAS. Moreover, the authors develop software to ease the creation of new rules and to discover inconsistencies. Findings The authors created 396 mappings and translated 58.8 percent of DLMF formulae (2,405 expressions) successfully between Maple and DLMF. For a significant percentage, the special function definitions in Maple and the DLMF were different. An atomic symbol in one system maps to a composite expression in the other system. The translator was also successfully used for automatic verification of mathematical online compendia and CAS. The evaluation techniques discovered two errors in the DLMF and one defect in Maple. Originality/value This paper introduces the first translation tool for special functions between LaTeX and CAS. The approach improves error-prone manual translations and can be used to verify mathematical online compendia and CAS.
- Date
- 20. 1.2015 18:30:22
-
Hauer, M.: Tiefenindexierung im Bibliothekskatalog : 17 Jahre intelligentCAPTURE (2019)
0.01
0.0092499675 = product of:
0.03699987 = sum of:
0.03699987 = product of:
0.07399974 = sum of:
0.07399974 = weight(_text_:22 in 5629) [ClassicSimilarity], result of:
0.07399974 = score(doc=5629,freq=2.0), product of:
0.15938555 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045514934 = queryNorm
0.46428138 = fieldWeight in 5629, 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=5629)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- B.I.T.online. 22(2019) H.2, S.163-166
-
Gödert, W.: Detecting multiword phrases in mathematical text corpora (2012)
0.01
0.007914375 = product of:
0.0316575 = sum of:
0.0316575 = product of:
0.063315 = sum of:
0.063315 = weight(_text_:software in 466) [ClassicSimilarity], result of:
0.063315 = score(doc=466,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.35064998 = fieldWeight in 466, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0625 = fieldNorm(doc=466)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- We present an approach for detecting multiword phrases in mathematical text corpora. The method used is based on characteristic features of mathematical terminology. It makes use of a software tool named Lingo which allows to identify words by means of previously defined dictionaries for specific word classes as adjectives, personal names or nouns. The detection of multiword groups is done algorithmically. Possible advantages of the method for indexing and information retrieval and conclusions for applying dictionary-based methods of automatic indexing instead of stemming procedures are discussed.
-
Stankovic, R. et al.: Indexing of textual databases based on lexical resources : a case study for Serbian (2016)
0.01
0.007708307 = product of:
0.030833228 = sum of:
0.030833228 = product of:
0.061666455 = sum of:
0.061666455 = weight(_text_:22 in 2759) [ClassicSimilarity], result of:
0.061666455 = score(doc=2759,freq=2.0), product of:
0.15938555 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045514934 = queryNorm
0.38690117 = fieldWeight in 2759, 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=2759)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 1. 2.2016 18:25:22
-
Wiesenmüller, H.: Maschinelle Indexierung am Beispiel der DNB : Analyse und Entwicklungmöglichkeiten (2018)
0.01
0.006925077 = product of:
0.027700309 = sum of:
0.027700309 = product of:
0.055400617 = sum of:
0.055400617 = weight(_text_:software in 5209) [ClassicSimilarity], result of:
0.055400617 = score(doc=5209,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.30681872 = fieldWeight in 5209, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0546875 = fieldNorm(doc=5209)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Der Beitrag untersucht die Ergebnisse des bei der Deutschen Nationalbibliothek (DNB) eingesetzten Verfahrens zur automatischen Vergabe von Schlagwörtern. Seit 2017 kommt dieses auch bei Printausgaben der Reihen B und H der Deutschen Nationalbibliografie zum Einsatz. Die zentralen Problembereiche werden dargestellt und an Beispielen illustriert - beispielsweise dass nicht alle im Inhaltsverzeichnis vorkommenden Wörter tatsächlich thematische Aspekte ausdrücken und dass die Software sehr häufig Körperschaften und andere "Named entities" nicht erkennt. Die maschinell generierten Ergebnisse sind derzeit sehr unbefriedigend. Es werden Überlegungen für mögliche Verbesserungen und sinnvolle Strategien angestellt.
-
Kasprzik, A.: Automatisierte und semiautomatisierte Klassifizierung : eine Analyse aktueller Projekte (2014)
0.01
0.0059357807 = product of:
0.023743123 = sum of:
0.023743123 = product of:
0.047486246 = sum of:
0.047486246 = weight(_text_:software in 2470) [ClassicSimilarity], result of:
0.047486246 = score(doc=2470,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.2629875 = fieldWeight in 2470, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.046875 = fieldNorm(doc=2470)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Das sprunghafte Anwachsen der Menge digital verfügbarer Dokumente gepaart mit dem Zeit- und Personalmangel an wissenschaftlichen Bibliotheken legt den Einsatz von halb- oder vollautomatischen Verfahren für die verbale und klassifikatorische Inhaltserschließung nahe. Nach einer kurzen allgemeinen Einführung in die gängige Methodik beleuchtet dieser Artikel eine Reihe von Projekten zur automatisierten Klassifizierung aus dem Zeitraum 2007-2012 und aus dem deutschsprachigen Raum. Ein Großteil der vorgestellten Projekte verwendet Methoden des Maschinellen Lernens aus der Künstlichen Intelligenz, arbeitet meist mit angepassten Versionen einer kommerziellen Software und bezieht sich in der Regel auf die Dewey Decimal Classification (DDC). Als Datengrundlage dienen Metadatensätze, Abstracs, Inhaltsverzeichnisse und Volltexte in diversen Datenformaten. Die abschließende Analyse enthält eine Anordnung der Projekte nach einer Reihe von verschiedenen Kriterien und eine Zusammenfassung der aktuellen Lage und der größten Herausfordungen für automatisierte Klassifizierungsverfahren.
-
Kasprzik, A.: Voraussetzungen und Anwendungspotentiale einer präzisen Sacherschließung aus Sicht der Wissenschaft (2018)
0.01
0.005395815 = product of:
0.02158326 = sum of:
0.02158326 = product of:
0.04316652 = sum of:
0.04316652 = weight(_text_:22 in 5195) [ClassicSimilarity], result of:
0.04316652 = score(doc=5195,freq=2.0), product of:
0.15938555 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045514934 = queryNorm
0.2708308 = fieldWeight in 5195, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=5195)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Große Aufmerksamkeit richtet sich im Moment auf das Potential von automatisierten Methoden in der Sacherschließung und deren Interaktionsmöglichkeiten mit intellektuellen Methoden. In diesem Kontext befasst sich der vorliegende Beitrag mit den folgenden Fragen: Was sind die Anforderungen an bibliothekarische Metadaten aus Sicht der Wissenschaft? Was wird gebraucht, um den Informationsbedarf der Fachcommunities zu bedienen? Und was bedeutet das entsprechend für die Automatisierung der Metadatenerstellung und -pflege? Dieser Beitrag fasst die von der Autorin eingenommene Position in einem Impulsvortrag und der Podiumsdiskussion beim Workshop der FAG "Erschließung und Informationsvermittlung" des GBV zusammen. Der Workshop fand im Rahmen der 22. Verbundkonferenz des GBV statt.
-
Franke-Maier, M.: Anforderungen an die Qualität der Inhaltserschließung im Spannungsfeld von intellektuell und automatisch erzeugten Metadaten (2018)
0.01
0.005395815 = product of:
0.02158326 = sum of:
0.02158326 = product of:
0.04316652 = sum of:
0.04316652 = weight(_text_:22 in 5344) [ClassicSimilarity], result of:
0.04316652 = score(doc=5344,freq=2.0), product of:
0.15938555 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045514934 = queryNorm
0.2708308 = fieldWeight in 5344, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=5344)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Spätestens seit dem Deutschen Bibliothekartag 2018 hat sich die Diskussion zu den automatischen Verfahren der Inhaltserschließung der Deutschen Nationalbibliothek von einer politisch geführten Diskussion in eine Qualitätsdiskussion verwandelt. Der folgende Beitrag beschäftigt sich mit Fragen der Qualität von Inhaltserschließung in digitalen Zeiten, wo heterogene Erzeugnisse unterschiedlicher Verfahren aufeinandertreffen und versucht, wichtige Anforderungen an Qualität zu definieren. Dieser Tagungsbeitrag fasst die vom Autor als Impulse vorgetragenen Ideen beim Workshop der FAG "Erschließung und Informationsvermittlung" des GBV am 29. August 2018 in Kiel zusammen. Der Workshop fand im Rahmen der 22. Verbundkonferenz des GBV statt.
-
Kempf, A.O.: Automatische Inhaltserschließung in der Fachinformation (2013)
0.00
0.0049464838 = product of:
0.019785935 = sum of:
0.019785935 = product of:
0.03957187 = sum of:
0.03957187 = weight(_text_:software in 905) [ClassicSimilarity], result of:
0.03957187 = score(doc=905,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.21915624 = fieldWeight in 905, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0390625 = fieldNorm(doc=905)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Der Artikel basiert auf einer Masterarbeit mit dem Titel "Automatische Indexierung in der sozialwissenschaftlichen Fachinformation. Eine Evaluationsstudie zur maschinellen Erschließung für die Datenbank SOLIS" (Kempf 2012), die im Rahmen des Aufbaustudiengangs Bibliotheks- und Informationswissenschaft an der Humboldt- Universität zu Berlin am Lehrstuhl Information Retrieval verfasst wurde. Auf der Grundlage des Schalenmodells zur Inhaltserschließung in der Fachinformation stellt der Artikel Evaluationsergebnisse eines automatischen Erschließungsverfahrens für den Einsatz in der sozialwissenschaftlichen Fachinformation vor. Ausgehend von dem von Krause beschriebenen Anwendungsszenario, wonach SOLIS-Datenbestände (Sozialwissenschaftliches Literaturinformationssystem) von geringerer Relevanz automatisch erschlossen werden sollten, wurden auf dieser Dokumentgrundlage zwei Testreihen mit der Indexierungssoftware MindServer der Firma Recommind durchgeführt. Neben den Auswirkungen allgemeiner Systemeinstellungen in der ersten Testreihe wurde in der zweiten Testreihe die Indexierungsleistung der Software für die Rand- und die Kernbereiche der Literaturdatenbank miteinander verglichen. Für letztere Testreihe wurden für beide Bereiche der Datenbank spezifische Versionen der Indexierungssoftware aufgebaut, die anhand von Dokumentkorpora aus den entsprechenden Bereichen trainiert wurden. Die Ergebnisse der Evaluation, die auf der Grundlage intellektuell generierter Vergleichsdaten erfolgt, weisen auf Unterschiede in der Indexierungsleistung zwischen Rand- und Kernbereichen hin, die einerseits gegen den Einsatz automatischer Indexierungsverfahren in den Randbereichen sprechen. Andererseits deutet sich an, dass sich die Indexierungsresultate durch den Aufbau fachteilgebietsspezifischer Trainingsmengen verbessern lassen.
-
Kanan, T.; Fox, E.A.: Automated arabic text classification with P-Stemmer, machine learning, and a tailored news article taxonomy (2016)
0.00
0.0049464838 = product of:
0.019785935 = sum of:
0.019785935 = product of:
0.03957187 = sum of:
0.03957187 = weight(_text_:software in 3151) [ClassicSimilarity], result of:
0.03957187 = score(doc=3151,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.21915624 = fieldWeight in 3151, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0390625 = fieldNorm(doc=3151)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Arabic news articles in electronic collections are difficult to study. Browsing by category is rarely supported. Although helpful machine-learning methods have been applied successfully to similar situations for English news articles, limited research has been completed to yield suitable solutions for Arabic news. In connection with a Qatar National Research Fund (QNRF)-funded project to build digital library community and infrastructure in Qatar, we developed software for browsing a collection of about 237,000 Arabic news articles, which should be applicable to other Arabic news collections. We designed a simple taxonomy for Arabic news stories that is suitable for the needs of Qatar and other nations, is compatible with the subject codes of the International Press Telecommunications Council, and was enhanced with the aid of a librarian expert as well as five Arabic-speaking volunteers. We developed tailored stemming (i.e., a new Arabic light stemmer called P-Stemmer) and automatic classification methods (the best being binary Support Vector Machines classifiers) to work with the taxonomy. Using evaluation techniques commonly used in the information retrieval community, including 10-fold cross-validation and the Wilcoxon signed-rank test, we showed that our approach to stemming and classification is superior to state-of-the-art techniques.
-
Golub, K.; Soergel, D.; Buchanan, G.; Tudhope, D.; Lykke, M.; Hiom, D.: ¬A framework for evaluating automatic indexing or classification in the context of retrieval (2016)
0.00
0.0049464838 = product of:
0.019785935 = sum of:
0.019785935 = product of:
0.03957187 = sum of:
0.03957187 = weight(_text_:software in 3311) [ClassicSimilarity], result of:
0.03957187 = score(doc=3311,freq=2.0), product of:
0.18056466 = queryWeight, product of:
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.045514934 = queryNorm
0.21915624 = fieldWeight in 3311, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.9671519 = idf(docFreq=2274, maxDocs=44218)
0.0390625 = fieldNorm(doc=3311)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Abstract
- Tools for automatic subject assignment help deal with scale and sustainability in creating and enriching metadata, establishing more connections across and between resources and enhancing consistency. Although some software vendors and experimental researchers claim the tools can replace manual subject indexing, hard scientific evidence of their performance in operating information environments is scarce. A major reason for this is that research is usually conducted in laboratory conditions, excluding the complexities of real-life systems and situations. The article reviews and discusses issues with existing evaluation approaches such as problems of aboutness and relevance assessments, implying the need to use more than a single "gold standard" method when evaluating indexing and retrieval, and proposes a comprehensive evaluation framework. The framework is informed by a systematic review of the literature on evaluation approaches: evaluating indexing quality directly through assessment by an evaluator or through comparison with a gold standard, evaluating the quality of computer-assisted indexing directly in the context of an indexing workflow, and evaluating indexing quality indirectly through analyzing retrieval performance.
-
Busch, D.: Domänenspezifische hybride automatische Indexierung von bibliographischen Metadaten (2019)
0.00
0.0046249838 = product of:
0.018499935 = sum of:
0.018499935 = product of:
0.03699987 = sum of:
0.03699987 = weight(_text_:22 in 5628) [ClassicSimilarity], result of:
0.03699987 = score(doc=5628,freq=2.0), product of:
0.15938555 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045514934 = queryNorm
0.23214069 = fieldWeight in 5628, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.046875 = fieldNorm(doc=5628)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- B.I.T.online. 22(2019) H.6, S.465-469
-
Junger, U.; Schwens, U.: ¬Die inhaltliche Erschließung des schriftlichen kulturellen Erbes auf dem Weg in die Zukunft : Automatische Vergabe von Schlagwörtern in der Deutschen Nationalbibliothek (2017)
0.00
0.0038541534 = product of:
0.015416614 = sum of:
0.015416614 = product of:
0.030833228 = sum of:
0.030833228 = weight(_text_:22 in 3780) [ClassicSimilarity], result of:
0.030833228 = score(doc=3780,freq=2.0), product of:
0.15938555 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045514934 = queryNorm
0.19345059 = fieldWeight in 3780, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0390625 = fieldNorm(doc=3780)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Date
- 19. 8.2017 9:24:22
-
Martins, A.L.; Souza, R.R.; Ribeiro de Mello, H.: ¬The use of noun phrases in information retrieval : proposing a mechanism for automatic classification (2014)
0.00
0.0030833227 = product of:
0.012333291 = sum of:
0.012333291 = product of:
0.024666581 = sum of:
0.024666581 = weight(_text_:22 in 1441) [ClassicSimilarity], result of:
0.024666581 = score(doc=1441,freq=2.0), product of:
0.15938555 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045514934 = queryNorm
0.15476047 = fieldWeight in 1441, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=1441)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik
-
Mesquita, L.A.P.; Souza, R.R.; Baracho Porto, R.M.A.: Noun phrases in automatic indexing: : a structural analysis of the distribution of relevant terms in doctoral theses (2014)
0.00
0.0030833227 = product of:
0.012333291 = sum of:
0.012333291 = product of:
0.024666581 = sum of:
0.024666581 = weight(_text_:22 in 1442) [ClassicSimilarity], result of:
0.024666581 = score(doc=1442,freq=2.0), product of:
0.15938555 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.045514934 = queryNorm
0.15476047 = fieldWeight in 1442, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03125 = fieldNorm(doc=1442)
0.5 = coord(1/2)
0.25 = coord(1/4)
- Source
- Knowledge organization in the 21st century: between historical patterns and future prospects. Proceedings of the Thirteenth International ISKO Conference 19-22 May 2014, Kraków, Poland. Ed.: Wieslaw Babik
