-
Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004)
0.07
0.06830314 = product of:
0.1024547 = sum of:
0.08157783 = product of:
0.24473348 = sum of:
0.24473348 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
0.24473348 = score(doc=562,freq=2.0), product of:
0.43545485 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.051362853 = queryNorm
0.56201804 = fieldWeight in 562, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046875 = fieldNorm(doc=562)
0.33333334 = coord(1/3)
0.020876871 = product of:
0.041753743 = sum of:
0.041753743 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
0.041753743 = score(doc=562,freq=2.0), product of:
0.17986396 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051362853 = queryNorm
0.23214069 = fieldWeight in 562, 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=562)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Content
- Vgl.: http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CEAQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.91.4940%26rep%3Drep1%26type%3Dpdf&ei=dOXrUMeIDYHDtQahsIGACg&usg=AFQjCNHFWVh6gNPvnOrOS9R3rkrXCNVD-A&sig2=5I2F5evRfMnsttSgFF9g7Q&bvm=bv.1357316858,d.Yms.
- Date
- 8. 1.2013 10:22:32
-
Malone, L.C.; Driscoll, J.R.; Pepe, J.W.: Modeling the performance of an automated keywording system (1991)
0.06
0.064407885 = product of:
0.09661182 = sum of:
0.051577676 = weight(_text_:management in 6682) [ClassicSimilarity], result of:
0.051577676 = score(doc=6682,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.29792285 = fieldWeight in 6682, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0625 = fieldNorm(doc=6682)
0.045034144 = product of:
0.09006829 = sum of:
0.09006829 = weight(_text_:system in 6682) [ClassicSimilarity], result of:
0.09006829 = score(doc=6682,freq=8.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.5567675 = fieldWeight in 6682, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0625 = fieldNorm(doc=6682)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Presents a model for predicting the performance of a computerised keyword assigning and indexing system. Statistical procedures were investigated in order to protect against incorrect keywording by the system behaving as an expert system designed to mimic the behaviour of human keyword indexers and representing lessons learned from military exercises and operations
- Source
- Information processing and management. 27(1991) nos.2/3, S.145-151
-
Owei, V.; Higa, K.: ¬A paradigm for natural language explanation of database queries : a semantic data model approach (1994)
0.06
0.06363928 = product of:
0.09545892 = sum of:
0.07294185 = weight(_text_:management in 8189) [ClassicSimilarity], result of:
0.07294185 = score(doc=8189,freq=4.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.42132655 = fieldWeight in 8189, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0625 = fieldNorm(doc=8189)
0.022517072 = product of:
0.045034144 = sum of:
0.045034144 = weight(_text_:system in 8189) [ClassicSimilarity], result of:
0.045034144 = score(doc=8189,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.27838376 = fieldWeight in 8189, 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=8189)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- An interface that provides the user with automatic feedback in the form of an explanation of how the database management system interprets user specified queries. Proposes an approach that exploits the rich semantics of graphical semantic data models to construct a restricted natural language explanation of database queries that are specified in a very high level declarative form. These interpretations of the specified query represent the system's 'understanding' of the query, and are returned to the user for validation
- Source
- Journal of database management. 5(1994) no.1, S.18-30
-
Sembok, T.M.T.; Rijsbergen, C.J. van: SILOL: a simple logical-linguistic document retrieval system (1990)
0.06
0.060385596 = product of:
0.09057839 = sum of:
0.051577676 = weight(_text_:management in 6684) [ClassicSimilarity], result of:
0.051577676 = score(doc=6684,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.29792285 = fieldWeight in 6684, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0625 = fieldNorm(doc=6684)
0.039000716 = product of:
0.07800143 = sum of:
0.07800143 = weight(_text_:system in 6684) [ClassicSimilarity], result of:
0.07800143 = score(doc=6684,freq=6.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.48217484 = fieldWeight in 6684, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0625 = fieldNorm(doc=6684)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Describes a system called SILOL which is based on a logical-linguistic model of document retrieval systems. SILOL uses a shallow semantic translation of natural language texts into a first order predicate representation in performing a document indexing and retrieval process. Some preliminary experiments have been carried out to test the retrieval effectiveness of this system. The results obtained show improvements in the level of retrieval effectiveness, which demonstrate that the approach of using a semantic theory of natural language and logic in document retrieval systems is a valid one
- Source
- Information processing and management. 26(1990) no.1, S.111-134
-
Rau, L.F.; Jacobs, P.S.; Zernik, U.: Information extraction and text summarization using linguistic knowledge acquisition (1989)
0.06
0.05561442 = product of:
0.083421625 = sum of:
0.051577676 = weight(_text_:management in 6683) [ClassicSimilarity], result of:
0.051577676 = score(doc=6683,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.29792285 = fieldWeight in 6683, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0625 = fieldNorm(doc=6683)
0.03184395 = product of:
0.0636879 = sum of:
0.0636879 = weight(_text_:system in 6683) [ClassicSimilarity], result of:
0.0636879 = score(doc=6683,freq=4.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.3936941 = fieldWeight in 6683, 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=6683)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Storing and accessing texts in a conceptual format has a number of advantages over traditional document retrieval methods. A conceptual format facilitates natural language access to text information. It can support imprecise and inexact queries, conceptual information summarisation, and, ultimately, document translation. Describes 2 methods which have been implemented in a prototype intelligent information retrieval system calles SCISOR (System for Conceptual Information Summarisation, Organization and Retrieval). Describes the text processing, language acquisition, and summarisation components of SCISOR
- Source
- Information processing and management. 25(1989) no.4, S.419-428
-
Magennis, M.: Expert rule-based query expansion (1995)
0.05
0.052837394 = product of:
0.07925609 = sum of:
0.045130465 = weight(_text_:management in 5181) [ClassicSimilarity], result of:
0.045130465 = score(doc=5181,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.2606825 = fieldWeight in 5181, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0546875 = fieldNorm(doc=5181)
0.034125626 = product of:
0.06825125 = sum of:
0.06825125 = weight(_text_:system in 5181) [ClassicSimilarity], result of:
0.06825125 = score(doc=5181,freq=6.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.42190298 = fieldWeight in 5181, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=5181)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Examines how, for term based free text retrieval, Interactive Query Expansion (IQE) provides better retrieval performance tahn Automatic Query Expansion (AQE) but the performance of IQE depends on the strategy employed by the user to select expansion terms. The aim is to build an expert query expansion system using term selection rules based on expert users' strategies. It is expected that such a system will achieve better performance for novice or inexperienced users that either AQE or IQE. The procedure is to discover expert IQE users' term selection strategies through observation and interrogation, to construct a rule based query expansion (RQE) system based on these and to compare the resulting retrieval performance with that of comparable AQE and IQE systems
- Source
- New review of document and text management. 1995, no.1, S.63-83
-
Ruge, G.: Experiments on linguistically-based term associations (1992)
0.05
0.0493965 = product of:
0.07409475 = sum of:
0.051577676 = weight(_text_:management in 1810) [ClassicSimilarity], result of:
0.051577676 = score(doc=1810,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.29792285 = fieldWeight in 1810, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0625 = fieldNorm(doc=1810)
0.022517072 = product of:
0.045034144 = sum of:
0.045034144 = weight(_text_:system in 1810) [ClassicSimilarity], result of:
0.045034144 = score(doc=1810,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.27838376 = fieldWeight in 1810, 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=1810)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Describes the hyperterm system REALIST (REtrieval Aids by LInguistic and STatistics) and describes its semantic component. The semantic component of REALIST generates semantic term relations such synonyms. It takes as input a free text data base and generates as output term pairs that are semantically related with respect to their meanings in the data base. In the 1st step an automatic syntactic analysis provides linguistical knowledge about the terms of the data base. In the 2nd step this knowledge is compared by statistical similarity computation. Various experiments with different similarity measures are described
- Source
- Information processing and management. 28(1992) no.3, S.317-332
-
Prasad, A.R.D.; Kar, B.B.: Parsing Boolean search expression using definite clause grammars (1994)
0.05
0.0493965 = product of:
0.07409475 = sum of:
0.051577676 = weight(_text_:management in 8188) [ClassicSimilarity], result of:
0.051577676 = score(doc=8188,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.29792285 = fieldWeight in 8188, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0625 = fieldNorm(doc=8188)
0.022517072 = product of:
0.045034144 = sum of:
0.045034144 = weight(_text_:system in 8188) [ClassicSimilarity], result of:
0.045034144 = score(doc=8188,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.27838376 = fieldWeight in 8188, 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=8188)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Briefly discusses the role of search languages in information retrieval and broadly groups the search languages into 4 categories. Explains the idea of definite clause grammars and demonstrates how parsers for Boolean logic-based search languages can easily be developed. Presents a partial Prolog code of the parser that was used in an object-oriented bibliographic database management system
-
Richardson, R.; Smeaton, A.F.: Automatic word sense disambiguation in a KBIR application (1995)
0.05
0.0493965 = product of:
0.07409475 = sum of:
0.051577676 = weight(_text_:management in 5796) [ClassicSimilarity], result of:
0.051577676 = score(doc=5796,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.29792285 = fieldWeight in 5796, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0625 = fieldNorm(doc=5796)
0.022517072 = product of:
0.045034144 = sum of:
0.045034144 = weight(_text_:system in 5796) [ClassicSimilarity], result of:
0.045034144 = score(doc=5796,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.27838376 = fieldWeight in 5796, 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=5796)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Discusses the implementation and design of an automatic word sense disambiguator. The semantic tagger is used in an overall Knowledge Based Information Retrieval (KBIR) system which uses a WordNet derived knowledge base (KB) and 2 independent semantic similarity estimators. The KB is used as a controlled vocabulary to represent documents and queries and the semantic similarity estimators are employed to determine the degree of relatedness between the KB representations
- Source
- New review of document and text management. 1995, no.1, S.299-319
-
Driscoll, J.R.; Rajala, D.A.; Shaffer, W.H.: ¬The operation and performance of an artificially intelligent keywording system (1991)
0.05
0.048662614 = product of:
0.07299392 = sum of:
0.045130465 = weight(_text_:management in 6681) [ClassicSimilarity], result of:
0.045130465 = score(doc=6681,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.2606825 = fieldWeight in 6681, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0546875 = fieldNorm(doc=6681)
0.027863456 = product of:
0.055726912 = sum of:
0.055726912 = weight(_text_:system in 6681) [ClassicSimilarity], result of:
0.055726912 = score(doc=6681,freq=4.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.34448233 = fieldWeight in 6681, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=6681)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Presents a new approach to text analysis for automating the key phrase indexing process, using artificial intelligence techniques. This mimics the behaviour of human experts by using a rule base consisting of insertion and deletion rules generated by subject-matter experts. The insertion rules are based on the idea that some phrases found in a text imply or trigger other phrases. The deletion rules apply to semantically ambiguous phrases where text presence alone does not determine appropriateness as a key phrase. The insertion and deletion rules are used to transform a list of found phrases to a list of key phrases for indexing a document. Statistical data are provided to demonstrate the performance of this expert rule based system
- Source
- Information processing and management. 27(1991) no.1, S.43-54
-
Ekmekcioglu, F.C.; Lynch, M.F.; Willet, P.: Development and evaluation of conflation techniques for the implementation of a document retrieval system for Turkish text databases (1995)
0.05
0.048662614 = product of:
0.07299392 = sum of:
0.045130465 = weight(_text_:management in 5797) [ClassicSimilarity], result of:
0.045130465 = score(doc=5797,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.2606825 = fieldWeight in 5797, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0546875 = fieldNorm(doc=5797)
0.027863456 = product of:
0.055726912 = sum of:
0.055726912 = weight(_text_:system in 5797) [ClassicSimilarity], result of:
0.055726912 = score(doc=5797,freq=4.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.34448233 = fieldWeight in 5797, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=5797)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Considers language processing techniques necessary for the implementation of a document retrieval system for Turkish text databases. Introduces the main characteristics of the Turkish language. Discusses the development of a stopword list and the evaluation of a stemming algorithm that takes account of the language's morphological structure. A 2 level description of Turkish morphology developed in Bilkent University, Ankara, is incorporated into a morphological parser, PC-KIMMO, to carry out stemming in Turkish databases. Describes the evaluation of string similarity measures - n-gram matching techniques - for Turkish. Reports experiments on 6 different Turkish text corpora
- Source
- New review of document and text management. 1995, no.1, S.131-146
-
Oard, D.W.; He, D.; Wang, J.: User-assisted query translation for interactive cross-language information retrieval (2008)
0.05
0.04830591 = product of:
0.07245886 = sum of:
0.038683258 = weight(_text_:management in 2030) [ClassicSimilarity], result of:
0.038683258 = score(doc=2030,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.22344214 = fieldWeight in 2030, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.046875 = fieldNorm(doc=2030)
0.03377561 = product of:
0.06755122 = sum of:
0.06755122 = weight(_text_:system in 2030) [ClassicSimilarity], result of:
0.06755122 = score(doc=2030,freq=8.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.41757566 = fieldWeight in 2030, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=2030)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Interactive Cross-Language Information Retrieval (CLIR), a process in which searcher and system collaborate to find documents that satisfy an information need regardless of the language in which those documents are written, calls for designs in which synergies between searcher and system can be leveraged so that the strengths of one can cover weaknesses of the other. This paper describes an approach that employs user-assisted query translation to help searchers better understand the system's operation. Supporting interaction and interface designs are introduced, and results from three user studies are presented. The results indicate that experienced searchers presented with this new system evolve new search strategies that make effective use of the new capabilities, that they achieve retrieval effectiveness comparable to results obtained using fully automatic techniques, and that reported satisfaction with support for cross-language searching increased. The paper concludes with a description of a freely available interactive CLIR system that incorporates lessons learned from this research.
- Source
- Information processing and management. 44(2008) no.1, S.181-211
-
Jacquemin, C.: What is the tree that we see through the window : a linguistic approach to windowing and term variation (1996)
0.04
0.043221936 = product of:
0.0648329 = sum of:
0.045130465 = weight(_text_:management in 5578) [ClassicSimilarity], result of:
0.045130465 = score(doc=5578,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.2606825 = fieldWeight in 5578, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0546875 = fieldNorm(doc=5578)
0.019702438 = product of:
0.039404877 = sum of:
0.039404877 = weight(_text_:system in 5578) [ClassicSimilarity], result of:
0.039404877 = score(doc=5578,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.2435858 = fieldWeight in 5578, 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=5578)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Provides a linguistic approach to text windowing through an extraction of term variants with the help of a partial parser. The syntactic grounding of the method ensures ehat words observed within restricted spans are lexically related and that spurious word cooccurrences are rules out with a good level of confidence. The system is computationally tractable on large corpora and large lists of terms. Gives illustrative examples of term variation from a large medical corpus. An experimental evaluation of the method shows that only a small proportion of co-occuring words are lexically related and motivates the call for natural language parsing techniques in text windowing
- Source
- Information processing and management. 32(1996) no.4, S.445-458
-
Mock, K.J.; Vemuri, V.R.: Information filtering via hill climbing, WordNet, and index patterns (1997)
0.04
0.043221936 = product of:
0.0648329 = sum of:
0.045130465 = weight(_text_:management in 1517) [ClassicSimilarity], result of:
0.045130465 = score(doc=1517,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.2606825 = fieldWeight in 1517, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0546875 = fieldNorm(doc=1517)
0.019702438 = product of:
0.039404877 = sum of:
0.039404877 = weight(_text_:system in 1517) [ClassicSimilarity], result of:
0.039404877 = score(doc=1517,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.2435858 = fieldWeight in 1517, 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=1517)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- The INFOS (Intelligent News Filtering Organizational System) project is designed to reduce the user's search burden by automatically categorising data as relevant or irrelevant based upon user interests. These predictions are learned automatically based upon features taken from input articles and collaborative features derived from other users. The filtering is performed by a hybrid technique that combines elements of a keyword-based hill climbing method, knowledge-based conceptual representation via WordNet, and partial parsing via index patterns. The hybrid systems integrating all these approaches combines the benefits of each while maintaing robustness and acalability
- Source
- Information processing and management. 33(1997) no.5, S.633-644
-
Lezius, W.; Rapp, R.; Wettler, M.: ¬A morphology-system and part-of-speech tagger for German (1996)
0.04
0.041960754 = product of:
0.12588225 = sum of:
0.12588225 = sum of:
0.05629268 = weight(_text_:system in 1693) [ClassicSimilarity], result of:
0.05629268 = score(doc=1693,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.3479797 = fieldWeight in 1693, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.078125 = fieldNorm(doc=1693)
0.06958958 = weight(_text_:22 in 1693) [ClassicSimilarity], result of:
0.06958958 = score(doc=1693,freq=2.0), product of:
0.17986396 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051362853 = queryNorm
0.38690117 = fieldWeight in 1693, 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=1693)
0.33333334 = coord(1/3)
- Date
- 22. 3.2015 9:37:18
-
Montgomery, C.A.: Linguistics and information science (1972)
0.04
0.03704738 = product of:
0.055571064 = sum of:
0.038683258 = weight(_text_:management in 6669) [ClassicSimilarity], result of:
0.038683258 = score(doc=6669,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.22344214 = fieldWeight in 6669, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.046875 = fieldNorm(doc=6669)
0.016887804 = product of:
0.03377561 = sum of:
0.03377561 = weight(_text_:system in 6669) [ClassicSimilarity], result of:
0.03377561 = score(doc=6669,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.20878783 = fieldWeight in 6669, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=6669)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- This paper defines the relationship between linguistics and information science in terms of a common interest in natural language. The notion of automated processing of natural language - i.e., machine simulation of the language processing activities of a human - provides novel possibilities for interaction between linguistics, who have a theoretical interest in such activities, and information scientists, who have more practical goals, e.g. simulating the language processing activities of an indexer with a machine. The concept of a natural language information system is introduces as a framenwork for reviewing automated language processing efforts by computational linguists and information scientists. In terms of this framework, the former have concentrated on automating the operations of the component for content analysis and representation, while the latter have emphasized the data management component. The complementary nature of these developments allows the postulation of an integrated approach to automated language processing. This approach, which is outlined in the final sections of the paper, incorporates current notions in linguistic theory and information science, as well as design features of recent computational linguistic models
-
Losee, R.M.: Learning syntactic rules and tags with genetic algorithms for information retrieval and filtering : an empirical basis for grammatical rules (1996)
0.04
0.03704738 = product of:
0.055571064 = sum of:
0.038683258 = weight(_text_:management in 4068) [ClassicSimilarity], result of:
0.038683258 = score(doc=4068,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.22344214 = fieldWeight in 4068, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.046875 = fieldNorm(doc=4068)
0.016887804 = product of:
0.03377561 = sum of:
0.03377561 = weight(_text_:system in 4068) [ClassicSimilarity], result of:
0.03377561 = score(doc=4068,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.20878783 = fieldWeight in 4068, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=4068)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- The grammars of natural languages may be learned by using genetic algorithms that reproduce and mutate grammatical rules and parts of speech tags, improving the quality of later generations of grammatical components. Syntactic rules are randomly generated and then evolve; those rules resulting in improved parsing and occasionally improved filtering performance are allowed to further propagate. The LUST system learns the characteristics of the language or subkanguage used in document abstracts by learning from the document rankings obtained from the parsed abstracts. Unlike the application of traditional linguistic rules to retrieval and filtering applications, LUST develops grammatical structures and tags without the prior imposition of some common grammatical assumptions (e.g. part of speech assumptions), producing grammars that are empirically based and are optimized for this particular application
- Source
- Information processing and management. 32(1996) no.2, S.185-197
-
Scherer Auberson, K.: Counteracting concept drift in natural language classifiers : proposal for an automated method (2018)
0.04
0.03704738 = product of:
0.055571064 = sum of:
0.038683258 = weight(_text_:management in 2849) [ClassicSimilarity], result of:
0.038683258 = score(doc=2849,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.22344214 = fieldWeight in 2849, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.046875 = fieldNorm(doc=2849)
0.016887804 = product of:
0.03377561 = sum of:
0.03377561 = weight(_text_:system in 2849) [ClassicSimilarity], result of:
0.03377561 = score(doc=2849,freq=2.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.20878783 = fieldWeight in 2849, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.046875 = fieldNorm(doc=2849)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Natural Language Classifier helfen Unternehmen zunehmend dabei die Flut von Textdaten zu überwinden. Aber diese Classifier, einmal trainiert, verlieren mit der Zeit ihre Nützlichkeit. Sie bleiben statisch, aber die zugrundeliegende Domäne der Textdaten verändert sich: Ihre Genauigkeit nimmt aufgrund eines Phänomens ab, das als Konzeptdrift bekannt ist. Die Frage ist ob Konzeptdrift durch die Ausgabe eines Classifiers zuverlässig erkannt werden kann, und falls ja: ist es möglich dem durch nachtrainieren des Classifiers entgegenzuwirken. Es wird eine System-Implementierung mittels Proof-of-Concept vorgestellt, bei der das Konfidenzmass des Classifiers zur Erkennung von Konzeptdrift verwendet wird. Der Classifier wird dann iterativ neu trainiert, indem er Stichproben mit niedrigem Konfidenzmass auswählt, sie korrigiert und im Trainingsset der nächsten Iteration verwendet. Die Leistung des Classifiers wird über die Zeit gemessen, und die Leistung des Systems beobachtet. Basierend darauf werden schließlich Empfehlungen gegeben, die sich bei der Implementierung solcher Systeme als nützlich erweisen können.
- Content
- Diese Publikation entstand im Rahmen einer Thesis zum Master of Science FHO in Business Administration, Major Information and Data Management.
-
Hammwöhner, R.: TransRouter revisited : Decision support in the routing of translation projects (2000)
0.03
0.034813207 = product of:
0.104439616 = sum of:
0.104439616 = sum of:
0.055726912 = weight(_text_:system in 5483) [ClassicSimilarity], result of:
0.055726912 = score(doc=5483,freq=4.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.34448233 = fieldWeight in 5483, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.0546875 = fieldNorm(doc=5483)
0.0487127 = weight(_text_:22 in 5483) [ClassicSimilarity], result of:
0.0487127 = score(doc=5483,freq=2.0), product of:
0.17986396 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.051362853 = queryNorm
0.2708308 = fieldWeight in 5483, 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=5483)
0.33333334 = coord(1/3)
- Abstract
- This paper gives an outline of the final results of the TransRouter project. In the scope of this project a decision support system for translation managers has been developed, which will support the selection of appropriate routes for translation projects. In this paper emphasis is put on the decision model, which is based on a stepwise refined assessment of translation routes. The workflow of using this system is considered as well
- Date
- 10.12.2000 18:22:35
-
Rapke, K.: Automatische Indexierung von Volltexten für die Gruner+Jahr Pressedatenbank (2001)
0.03
0.03475901 = product of:
0.052138515 = sum of:
0.032236047 = weight(_text_:management in 5863) [ClassicSimilarity], result of:
0.032236047 = score(doc=5863,freq=2.0), product of:
0.17312427 = queryWeight, product of:
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.051362853 = queryNorm
0.18620178 = fieldWeight in 5863, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.3706124 = idf(docFreq=4130, maxDocs=44218)
0.0390625 = fieldNorm(doc=5863)
0.01990247 = product of:
0.03980494 = sum of:
0.03980494 = weight(_text_:system in 5863) [ClassicSimilarity], result of:
0.03980494 = score(doc=5863,freq=4.0), product of:
0.16177002 = queryWeight, product of:
3.1495528 = idf(docFreq=5152, maxDocs=44218)
0.051362853 = queryNorm
0.24605882 = fieldWeight in 5863, 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=5863)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Retrievaltests sind die anerkannteste Methode, um neue Verfahren der Inhaltserschließung gegenüber traditionellen Verfahren zu rechtfertigen. Im Rahmen einer Diplomarbeit wurden zwei grundsätzlich unterschiedliche Systeme der automatischen inhaltlichen Erschließung anhand der Pressedatenbank des Verlagshauses Gruner + Jahr (G+J) getestet und evaluiert. Untersucht wurde dabei natürlichsprachliches Retrieval im Vergleich zu Booleschem Retrieval. Bei den beiden Systemen handelt es sich zum einen um Autonomy von Autonomy Inc. und DocCat, das von IBM an die Datenbankstruktur der G+J Pressedatenbank angepasst wurde. Ersteres ist ein auf natürlichsprachlichem Retrieval basierendes, probabilistisches System. DocCat demgegenüber basiert auf Booleschem Retrieval und ist ein lernendes System, das aufgrund einer intellektuell erstellten Trainingsvorlage indexiert. Methodisch geht die Evaluation vom realen Anwendungskontext der Textdokumentation von G+J aus. Die Tests werden sowohl unter statistischen wie auch qualitativen Gesichtspunkten bewertet. Ein Ergebnis der Tests ist, dass DocCat einige Mängel gegenüber der intellektuellen Inhaltserschließung aufweist, die noch behoben werden müssen, während das natürlichsprachliche Retrieval von Autonomy in diesem Rahmen und für die speziellen Anforderungen der G+J Textdokumentation so nicht einsetzbar ist
- Source
- Information Research & Content Management: Orientierung, Ordnung und Organisation im Wissensmarkt; 23. DGI-Online-Tagung der DGI und 53. Jahrestagung der Deutschen Gesellschaft für Informationswissenschaft und Informationspraxis e.V. DGI, Frankfurt am Main, 8.-10.5.2001. Proceedings. Hrsg.: R. Schmidt
