{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":2,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":2,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"9a98f1494196","filters":{"venue":"˜The œPrague Bulletin of Mathematical Linguistics"}},"results":[{"id":"W2122373020","doi":"10.2478/v10108-012-0004-y","title":"Kriya - An end-to-end Hierarchical Phrase-based MT System","year":2012,"lang":"en","type":"article","venue":"˜The œPrague Bulletin of Mathematical Linguistics","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"End-to-end principle; Phrase; Computer science; Artificial intelligence","authors":[{"name":"Baskaran Sankaran","is_ca":true},{"name":"Majid Razmara","is_ca":false},{"name":"Anoop Sarkar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01778073816134857,"gpt":0.2739424006951001,"spread":0.2561616625337516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001960032,0.0003121152,0.000468612,0.0001286756,0.000200887,0.0001616791,0.001951038,0.0001854613,0.0001187654],"category_scores_gemma":[0.003492927,0.0002183578,0.0001311333,0.0002977245,0.0002349222,0.00003055164,0.0004549635,0.0004873235,0.0002945769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007968336,"about_ca_system_score_gemma":0.00009903758,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002889221,"about_ca_topic_score_gemma":0.00000141681,"domain_scores_codex":[0.9971434,0.0002830017,0.0006947521,0.0003933833,0.0008379907,0.0006474197],"domain_scores_gemma":[0.9963913,0.001232842,0.00025778,0.001293771,0.0003806224,0.000443664],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002829749,0.0004795705,0.0000255287,0.0006322479,0.00002127752,0.00003949207,0.0006689032,0.00001650396,0.0002915268,0.9862871,0.007230632,0.004278887],"study_design_scores_gemma":[0.00190996,0.001548781,0.0001084107,0.003060081,0.0004380175,0.0004560799,0.0005334897,0.2459241,0.03001654,0.2026537,0.5101498,0.003201143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009168591,0.0005164897,0.9860971,0.001872992,0.0005736202,0.0005047041,0.00002430945,0.0008811465,0.008612753],"genre_scores_gemma":[0.5329061,3.79971e-7,0.4659114,0.0005477155,0.0004597672,0.00002566851,0.000003855994,0.00002505731,0.0001200111],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7836335,"threshold_uncertainty_score":0.8904373,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129388736","doi":"10.1515/pralin-2015-0008","title":"A Python-based Interface for Wide Coverage Lexicalized Tree-adjoining Grammars","year":2015,"lang":"en","type":"article","venue":"˜The œPrague Bulletin of Mathematical Linguistics","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Python (programming language); Parsing; Programming language; Artificial intelligence; L-attributed grammar; Rule-based machine translation; Adjunction; Tree-adjoining grammar; Natural language processing; Tree (set theory); Abstract syntax tree; Tree structure; Grammar; Data structure; Context-free grammar; Mathematics; Linguistics","authors":[{"name":"Ziqi Wang","is_ca":false},{"name":"Haotian Zhang","is_ca":false},{"name":"Anoop Sarkar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03020264464375103,"gpt":0.296627339247077,"spread":0.2664246946033259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.001678317,0.000274646,0.000486354,0.00007918735,0.0001145254,0.0001745252,0.001473437,0.0001579627,0.00001980215],"category_scores_gemma":[0.01805526,0.0001960611,0.0001729154,0.0002023571,0.000220027,0.00001709997,0.0003375381,0.0003150527,0.00004398886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000642603,"about_ca_system_score_gemma":0.0001780684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002376194,"about_ca_topic_score_gemma":0.000002978574,"domain_scores_codex":[0.997832,0.000138873,0.0006848538,0.0003854204,0.0005473685,0.0004115031],"domain_scores_gemma":[0.994773,0.003104352,0.0003689873,0.0008166157,0.0007387886,0.000198288],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002769571,0.0005325143,0.00002013507,0.0008725116,0.00006733335,0.00006181955,0.001118196,0.0003177712,0.0002461326,0.878538,0.1084061,0.009542519],"study_design_scores_gemma":[0.00122258,0.0003862509,7.482746e-7,0.0003982074,0.00006247981,0.00001688294,0.00004820174,0.121628,0.007293033,0.6702683,0.1982658,0.0004095466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000114095,0.0004373912,0.9921871,0.002760488,0.000312325,0.0004836857,0.00001265616,0.0004385013,0.003253754],"genre_scores_gemma":[0.2356204,0.000001382201,0.7626671,0.0009864407,0.0001498097,0.00005286477,0.000004585294,0.00003545623,0.0004819801],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2355063,"threshold_uncertainty_score":0.9902161,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}