Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

R. Attar

dblp:10/5514 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1978
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information retrieval › query reformulation
query expansion
0.021978
KEDMA - Linguistic Tools for Retrieval Systems · J. ACM 1978
Local Feedback in Full-Text Retrieval Systems · J. ACM 1977
Information retrieval
retrieval models
0.021978
KEDMA - Linguistic Tools for Retrieval Systems · J. ACM 1978
Local Feedback in Full-Text Retrieval Systems · J. ACM 1977
Information retrieval › text analysis › text preprocessing
morphological analysis
0.011978
KEDMA - Linguistic Tools for Retrieval Systems · J. ACM 1978
Information retrieval › text analysis
term clustering
0.011977
Local Feedback in Full-Text Retrieval Systems · J. ACM 1977

Methods — techniques the papers use, named apart from their topics

term weighting · 0.0grammatical synthesis · 0.0grammatical analysis · 0.0clustering · 0.0
YearPublicationVenuePosition
1978 KEDMA - Linguistic Tools for Retrieval Systems
abstract
In a full-text natural-language retrieval system, frequent need for automatic hngulst~c analysis arises, e.g for keyword expansion in a search process, content analysis, or automatic construction of concordances The avadablhty of sophisticated hngulstic tools, which is highly desirable for languages such as Enghsh, is quite imperative for, say, Semmc languages, whose complex morphological structure renders simple-minded and approximate soluuons such as suffix stripping totally useless.Sophisticated tools were designed and constructed via the fusion of grammatical analysis and grammatical synthesis, resulting in a set of global files which provide in some sense a complete grammatical and lexlcal description of the language These files induce a set of local files which adapt to the database at hand and permit flexible on-hne morphological analysis.
R. Attar, Yaacov Choueka, Nachum Dershowitz, Aviezri S. Fraenkel
J. ACM1
1977 Local Feedback in Full-Text Retrieval Systems
abstract
AaSTRACT.In a full-text natural-language retrieval system, local feedbacl~ is the process of formulating a new ~mproved search based on clustering terms from the documents returned m a previous search of any given query Experiments were run on a database of US patents It ~s concluded that m contrast toglobalclustermg, where the size of matrices hmmts apphcatmns to small databases and improvements are doubtful, local clustering is practical also for large databases and appears to improve overall performance, especially tf metrical constraints and weighting by proximity are embedded m the local feedback The local methods adapt themselves to each mdwtdual search and produce useful searchonymsterms which are "synonymous" m the context of one query Searchonyms lead to new ~mproved search formulahons both via manual and vm automahc feedback
R. Attar, Aviezri S. Fraenkel
J. ACM1