MétaCan
Menu
Back to cohort
Record W2005564459 · doi:10.1109/hsi.2008.4581436

Natural search pointers — A query formulation method for structured information search

2008· article· en· W2005564459 on OpenAlexafffund
Marek Lipczak, James Blustein, Evangelos Milios

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWeb Data Mining and Analysis
Canadian institutionsDalhousie University
FundersDalhousie University
KeywordsComputer scienceInterface (matter)Search engineInformation retrievalExtension (predicate logic)Key (lock)Iterative deepening depth-first searchWeb search querySearch-oriented architectureSearch algorithmSearch analyticsBeam searchIncremental heuristic searchProgramming language

Abstract

fetched live from OpenAlex

Despite a wide variety of new solutions, structured information search still has only one practical approach - form-based interface. A key limitation of this interface is poor handling of iterative search. While browsing the results users have to memorize all new search constraints, go back to the form, and enter them into the appropriate fields. To overcome this obstacle we created Natural Search Pointers -a structured information search interface, which formulates search queries based on information highlighted by a user while browsing the search results. NSP can be used as an extension of any standard form-based interface for consumer-oriented database search engines. Comparison of traditional form-based interface and its NSP extension shows that in iterative search tasks NSP makes finding information faster and more convenient.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.014
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.026
Threshold uncertainty score0.087

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.014
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.003
Science and technology studies0.0010.002
Scholarly communication0.0030.007
Open science0.0020.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0260.007

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.040
GPT teacher head0.326
Teacher spread0.286 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2008
Admission routes2
Has abstractyes

Explore more

Same topicWeb Data Mining and AnalysisFrench-language works237,207