{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101169,0.0007451951,0.001196423,0.001262344,0.0007680697,0.001656795,0.002061626,0.001208463,0.02066869],"category_scores_gemma":[0.002774212,0.0007375543,0.0005834022,0.0008008975,0.0004704886,0.004353434,0.002389378,0.00115756,0.02506225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003751916,"about_ca_system_score_gemma":0.000715543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001878032,"about_ca_topic_score_gemma":0.003189022,"domain_scores_codex":[0.9993234,0.0001292919,0.0001035742,0.0002344123,0.0001505587,0.00005884514],"domain_scores_gemma":[0.9987137,0.0002966587,0.00009438727,0.0004756886,0.0003369781,0.00008253452],"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.002690682,0.0003089474,0.001980656,0.001319353,0.0002885135,0.001094225,0.0006905388,0.005214531,0.16972,0.0105771,0.1478244,0.658291],"study_design_scores_gemma":[0.001308252,0.001055146,0.008270503,0.0002539967,0.0006186498,0.004038078,0.0005833475,0.4072522,0.2908175,0.03658488,0.2486924,0.0005250075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03274506,0.0009680827,0.5046577,0.0004644863,0.000253763,0.0004412973,0.01299794,0.4276876,0.01978395],"genre_scores_gemma":[0.246295,0.0004914459,0.6688317,0.0006328027,0.0001912186,0.0003835624,0.03911791,0.01320547,0.03085084],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02066869,"threshold_uncertainty_score":0.06914365,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003633167,0.001789477,0.001311265,0.001653797,0.0008197383,0.002767181,0.004589034,0.001335251,0.06568135],"category_scores_gemma":[0.008036399,0.001824294,0.00214816,0.00104505,0.001801302,0.005071613,0.007680707,0.002918566,0.02989562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001577168,"about_ca_system_score_gemma":0.002412224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003252097,"about_ca_topic_score_gemma":0.002583715,"domain_scores_codex":[0.9977508,0.0004367007,0.0003448576,0.0004468002,0.0007309024,0.0002899598],"domain_scores_gemma":[0.9964886,0.001751526,0.0001969222,0.0006417846,0.0005901108,0.0003310755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.003253531,0.0008181136,0.007723795,0.002353606,0.0003119314,0.003815711,0.004303603,0.02592179,0.03801085,0.09655698,0.4278078,0.3891223],"study_design_scores_gemma":[0.0009778203,0.000194714,0.003761216,0.0004956051,0.0001022385,0.002009915,0.000374429,0.2928289,0.04743768,0.100711,0.5506079,0.0004986959],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"software","genre_scores_codex":[0.003481917,0.00006588502,0.5522884,0.000213896,0.00008801217,0.0004913838,0.004636191,0.4314214,0.007312934],"genre_scores_gemma":[0.1468162,0.0003459982,0.5927641,0.001498351,0.0001335157,0.003056054,0.0255049,0.204875,0.02500585],"genre_candidate":"software","genre_consensus":null,"teacher_disagreement_score":0.06568135,"threshold_uncertainty_score":0.219726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}