{"id":"W1966445797","doi":"10.1145/1620432.1620453","title":"Efficient keyword proximity search using a frontier-reduce strategy based on<i>d</i>-distance graph index","year":2009,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Graph; Set (abstract data type); Efficient frontier; Space (punctuation); Theoretical computer science; Index (typography); Frontier; World Wide Web","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004261132,0.0005955793,0.001299406,0.002547527,0.0007903742,0.0011543,0.001110739,0.0006888118,0.00189896],"category_scores_gemma":[0.002299481,0.0002897716,0.0007462686,0.003241232,0.0004908621,0.001978419,0.001450218,0.0004309386,0.0007420113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007219338,"about_ca_system_score_gemma":0.001466959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004221621,"about_ca_topic_score_gemma":0.005322841,"domain_scores_codex":[0.9993502,0.0001371083,0.00004951205,0.0001441317,0.0002438324,0.00007506975],"domain_scores_gemma":[0.9992631,0.0003036716,0.00006859827,0.0001874782,0.0001314531,0.00004565527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005731157,0.0005484329,0.003038595,0.0007983663,0.0001573599,0.0007430579,0.0009311763,0.1114228,0.06995089,0.05700981,0.01829123,0.7365351],"study_design_scores_gemma":[0.0001556835,0.0005005634,0.002074207,0.00004095739,0.0001454053,0.001330049,0.0006828159,0.8486691,0.03835997,0.09077103,0.01718678,0.0000833824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05838722,0.0006342864,0.9319644,0.000333544,0.00003230232,0.0003087633,0.0005782759,0.002176532,0.005584626],"genre_scores_gemma":[0.2377327,0.0002751125,0.7584862,0.0001015706,0.00002554015,0.0002042034,0.001090265,0.0001217653,0.001962671],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004221621,"threshold_uncertainty_score":0.008394063,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03283030230392023,"score_gpt":0.2784831588872907,"score_spread":0.2456528565833705,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}