{"id":"W2950472498","doi":"10.48550/arxiv.1208.0092","title":"Efficient Indexing and Querying over Syntactically Annotated Trees","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Search engine indexing; Parsing; Coding (social sciences); Set (abstract data type); Index (typography); Tree (set theory); Natural language; Information retrieval; Artificial intelligence; Natural language processing; Mathematics; Combinatorics","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.001669738,0.0007211188,0.001490865,0.003762971,0.001036859,0.002457909,0.002377705,0.001158996,0.002214245],"category_scores_gemma":[0.01499745,0.0005279253,0.0008467545,0.008297125,0.001041081,0.006835573,0.002273599,0.001291328,0.001450317],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001047441,"about_ca_system_score_gemma":0.002443014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002831649,"about_ca_topic_score_gemma":0.004322678,"domain_scores_codex":[0.9971916,0.0005106182,0.0003942754,0.0004065467,0.00127562,0.0002212864],"domain_scores_gemma":[0.9898393,0.00514189,0.0007654313,0.002522604,0.001519905,0.0002107934],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000919903,0.0004408057,0.007039862,0.001074114,0.0001282229,0.0007482731,0.001664294,0.06442194,0.09946297,0.08244397,0.04541808,0.6962376],"study_design_scores_gemma":[0.000125908,0.0001967884,0.002697485,0.0000977159,0.00008509085,0.0008182894,0.0007822246,0.7539971,0.06911944,0.1540067,0.01796954,0.0001038405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1132385,0.001170191,0.8615475,0.0008694162,0.000115562,0.0003256156,0.006017467,0.01172775,0.004987987],"genre_scores_gemma":[0.3193534,0.0008985198,0.6600578,0.0002691621,0.0001524113,0.0003784191,0.01496528,0.0008667222,0.003058289],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003762971,"threshold_uncertainty_score":0.008830488,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05404926755246188,"score_gpt":0.1964002652671958,"score_spread":0.1423509977147339,"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."}}