{"id":"W3035862496","doi":"10.1007/978-3-030-59212-7_16","title":"Practical Random Access to SLP-Compressed Texts","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Grammar; Rule-based machine translation; Simple (philosophy); Encoding (memory); Random access; Process (computing); Compression (physics); Theoretical computer science; Data compression; Artificial intelligence; Programming language; Linguistics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001135642,0.0006569331,0.0008372446,0.0006764063,0.0003468205,0.004141168,0.01103259,0.000335095,0.00001807005],"category_scores_gemma":[0.0008781418,0.0005598582,0.0001641107,0.002685639,0.0003090606,0.001939139,0.02833649,0.001750858,0.00008800258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002097912,"about_ca_system_score_gemma":0.001252432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001405906,"about_ca_topic_score_gemma":0.0000289874,"domain_scores_codex":[0.9932448,0.0002498199,0.0007126765,0.003123626,0.001647956,0.001021153],"domain_scores_gemma":[0.9948325,0.00101651,0.0003211872,0.002830812,0.0003210893,0.0006779197],"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.00009074,0.0002486038,0.0003392332,0.0001361154,0.00002243582,0.000442629,0.001574587,0.3312176,0.001335083,0.000737833,0.002653949,0.6612012],"study_design_scores_gemma":[0.0006674783,0.0001072802,0.001667002,0.0003272147,0.000007293517,0.00004236227,1.862644e-7,0.9577922,0.007146137,0.03043102,0.001101423,0.0007104503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008352546,0.0001365593,0.9676641,0.02540894,0.004468595,0.001030977,0.00001712393,0.0003900729,0.00004838878],"genre_scores_gemma":[0.3272983,0.00001425617,0.6662455,0.005706451,0.0006475212,0.00005633743,0.00001027222,0.00002040947,8.747498e-7],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6604908,"threshold_uncertainty_score":0.9996853,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0476020322110299,"score_gpt":0.3466941386429499,"score_spread":0.29909210643192,"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."}}