{"id":"W1479984205","doi":"10.1109/dcc.1994.305931","title":"Highly efficient universal coding with classifying to subdictionaries for text compression","year":2002,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Parsing; Data compression; Compression ratio; Hash function; String (physics); Compression (physics); Algorithm; Speech recognition; Artificial intelligence; Pattern recognition (psychology); Natural language processing; Data mining; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006048965,0.0006777679,0.0005965661,0.002173036,0.0007000767,0.001106555,0.001202538,0.0006505669,0.003889925],"category_scores_gemma":[0.002769274,0.0003142701,0.000533935,0.002410826,0.0009995512,0.001946325,0.001610079,0.001145249,0.002622834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008495394,"about_ca_system_score_gemma":0.0007747458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00144348,"about_ca_topic_score_gemma":0.001882931,"domain_scores_codex":[0.9993185,0.0001175611,0.00009244863,0.0001096825,0.0002843019,0.00007750168],"domain_scores_gemma":[0.9988593,0.0003943386,0.00006896431,0.0004362825,0.0002162317,0.00002494092],"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.0001854657,0.00007249328,0.0005341934,0.0001743628,0.00002908104,0.0001273486,0.0002922166,0.01353165,0.04416494,0.09988116,0.01394953,0.8270574],"study_design_scores_gemma":[0.00008141909,0.0002185681,0.0009763318,0.00009488691,0.00005886131,0.0007681693,0.0001421116,0.5158775,0.266862,0.1011399,0.1136622,0.0001180212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00626966,0.0004000954,0.9865805,0.0001304409,0.000108159,0.0001117424,0.0002011014,0.00349183,0.002706457],"genre_scores_gemma":[0.07389656,0.0005091899,0.9165516,0.000259143,0.000170697,0.0002928805,0.001228759,0.0006552791,0.006435782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003889925,"threshold_uncertainty_score":0.01301306,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02783632000063993,"score_gpt":0.2304418808840361,"score_spread":0.2026055608833962,"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."}}