-
Ahlswede, T.; Evens, M.: Generating a relational lexicon from a machine-readable dictionary (1988)
0.00
0.003357759 = product of:
0.006715518 = sum of:
0.006715518 = product of:
0.013431036 = sum of:
0.013431036 = weight(_text_:a in 870) [ClassicSimilarity], result of:
0.013431036 = score(doc=870,freq=6.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.3089162 = fieldWeight in 870, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.109375 = fieldNorm(doc=870)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Evens, M.; Wang, Y.; Vandendorpe, J.: Relational thesauri in information retrieval (1985)
0.00
0.0022155463 = product of:
0.0044310926 = sum of:
0.0044310926 = product of:
0.008862185 = sum of:
0.008862185 = weight(_text_:a in 3911) [ClassicSimilarity], result of:
0.008862185 = score(doc=3911,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.20383182 = fieldWeight in 3911, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.125 = fieldNorm(doc=3911)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Evens, M.: Computer-readable dictionaries (1989)
0.00
0.0022155463 = product of:
0.0044310926 = sum of:
0.0044310926 = product of:
0.008862185 = sum of:
0.008862185 = weight(_text_:a in 2184) [ClassicSimilarity], result of:
0.008862185 = score(doc=2184,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.20383182 = fieldWeight in 2184, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.125 = fieldNorm(doc=2184)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Wan, T.-L.; Evens, M.; Wan, Y.-W.; Pao, Y.-Y.: Experiments with automatic indexing and a relational thesaurus in a Chinese information retrieval system (1997)
0.00
0.0021674242 = product of:
0.0043348484 = sum of:
0.0043348484 = product of:
0.008669697 = sum of:
0.008669697 = weight(_text_:a in 956) [ClassicSimilarity], result of:
0.008669697 = score(doc=956,freq=10.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.19940455 = fieldWeight in 956, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=956)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- This article describes a series of experiments with an interactive Chinese information retrieval system named CIRS and an interactive relational thesaurus. 2 important issues have been explored: whether thesauri enhance the retrieval effectiveness of Chinese documents, and whether automatic indexing can complete with manual indexing in a Chinese information retrieval system. Recall and precision are used to measure and evaluate the effectiveness of the system. Statistical analysis of the recall and precision measures suggest that the use of the relational thesaurus does improve the retrieval effectiveness both in the automatic indexing environment and in the manual indexing environment and that automatic indexing is at least as good as manual indexing
- Type
- a
-
Conlon, S.P.N.; Evens, M.; Ahlswede, T.: Developing a large lexical database for information retrieval, parsing, and text generation systems (1993)
0.00
0.002035109 = product of:
0.004070218 = sum of:
0.004070218 = product of:
0.008140436 = sum of:
0.008140436 = weight(_text_:a in 5813) [ClassicSimilarity], result of:
0.008140436 = score(doc=5813,freq=12.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.18723148 = fieldWeight in 5813, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=5813)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Shows that it is possible to construct a lexical database by combining material from a number of machine-readable sources. Discusses the kind of lexical information required for applications in information retrieval and in other natural language processing areas, such as database interfaces and automatic filing systems. Describes the organization of the lexical database which is stored in an Oracle relational database management system and the design of the tables that comprise the database. In addition to the traditional alphabetic listing, access is privided from roots to derived forms and from derived forms to roots, and also through lexical and semantic relations between words, so that the database functions as a thesaurus as well as a dictionary. The database is designed to be open-ended and self-defined. Every attribute of every table is defined in the database itself. The lexical database can easily be extended through an SQL forms interface that facilitates additions to the tables
- Type
- a
-
Hmeidi, I.; Kanaan, G.; Evens, M.: Design and implementation of automatic indexing for information retrieval with Arabic documents (1997)
0.00
0.0016616598 = product of:
0.0033233196 = sum of:
0.0033233196 = product of:
0.006646639 = sum of:
0.006646639 = weight(_text_:a in 1660) [ClassicSimilarity], result of:
0.006646639 = score(doc=1660,freq=8.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.15287387 = fieldWeight in 1660, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=1660)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- A corpus of 242 abstracts of Arabic documents on computer science and information systems using the Proceedings of the Saudi Arabian National Conferences as a source was put together. Reports on the design and building of an automatic information retrieval system from scratch to handle Arabic data. Both automatic and manual indexing techniques were implemented. Experiments using measures of recall and precision has demonstrated that automatic indexing is at least as effective as manual indexing and more effective in some cases. Automatic indexing is both cheaper and faster. Results suggests that a wider coverage of the literature can be achieved with less money and produce as good results as with manual indexing. Compares the retrieval results using words as index terms versus stems and roots, and confirms the results obtained by Al-Kharashi and Abu-Salem with smaller corpora that root indexing is more effective than word indexing
- Type
- a
-
Evens, M.: Thesaural relations in information retrieval (2002)
0.00
0.0014390396 = product of:
0.0028780792 = sum of:
0.0028780792 = product of:
0.0057561584 = sum of:
0.0057561584 = weight(_text_:a in 1201) [ClassicSimilarity], result of:
0.0057561584 = score(doc=1201,freq=6.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.13239266 = fieldWeight in 1201, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=1201)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Thesaural relations have long been used in information retrieval to enrich queries; they have sometimes been used to cluster documents as well. Sometimes the first query to an information retrieval system yields no results at all, or, what can be even more disconcerting, many thousands of hits. One solution is to rephrase the query, improving the choice of query terms by using related terms of different types. A collection of related terms is often called a thesaurus. This chapter describes the lexical-semantic relations that have been used in building thesauri and summarizes some of the effects of using these relational thesauri in information retrieval experiments
- Type
- a
