{"meta":{"query_hash":"9a98f1494196","filters":{"venue":"˜The œPrague Bulletin of Mathematical Linguistics"},"cohort_total":2,"direct_labels_cover":0,"predictions_cover":2,"exported":2,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/9a98f1494196","api":"https://metacan.xera.ac/api/v1/cohort?venue=%C2%98The+%C2%9CPrague+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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"End-to-end principle; Phrase; Computer science; Artificial intelligence","score_opus":0.01778073816134857,"score_gpt":0.2739424006951001,"score_spread":0.25616166253375156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122373020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","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.46591145,0.0005477155,0.00045976724,0.00002566851,0.0000038559942,0.00002505731,0.00012001112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99714345,0.00028300166,0.0006947521,0.00039338332,0.0008379907,0.00064741966],"domain_scores_gemma":[0.9963913,0.0012328416,0.00025777996,0.001293771,0.00038062243,0.00044366397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019600322,0.00031211524,0.00046861198,0.00012867557,0.00020088698,0.00016167907,0.0019510376,0.00018546128,0.000118765405],"category_scores_gemma":[0.0034929274,0.0002183578,0.00013113327,0.0002977245,0.00023492219,0.000030551637,0.0004549635,0.0004873235,0.00029457686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028297492,0.0004795705,0.000025528703,0.0006322479,0.000021277525,0.000039492068,0.00066890323,0.000016503956,0.00029152678,0.9862871,0.007230632,0.004278887],"study_design_scores_gemma":[0.0019099602,0.0015487814,0.000108410735,0.0030600813,0.0004380175,0.00045607993,0.0005334897,0.24592406,0.030016536,0.20265368,0.5101498,0.003201143],"about_ca_topic_score_codex":0.000028892213,"about_ca_topic_score_gemma":0.0000014168096,"teacher_disagreement_score":0.7836335,"about_ca_system_score_codex":0.00007968336,"about_ca_system_score_gemma":0.000099037585,"threshold_uncertainty_score":0.8904373},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03020264464375103,"score_gpt":0.29662733924707696,"score_spread":0.2664246946033259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129388736","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011409497,0.00043739122,0.9921871,0.0027604883,0.00031232505,0.00048368567,0.000012656162,0.00043850127,0.0032537545],"genre_scores_gemma":[0.23562042,0.0000013822013,0.76266706,0.0009864407,0.00014980967,0.000052864765,0.0000045852944,0.000035456233,0.00048198013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997832,0.00013887302,0.00068485376,0.00038542043,0.0005473685,0.0004115031],"domain_scores_gemma":[0.994773,0.0031043524,0.00036898727,0.0008166157,0.00073878857,0.000198288],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0016783171,0.000274646,0.000486354,0.00007918735,0.000114525385,0.00017452518,0.0014734366,0.0001579627,0.000019802152],"category_scores_gemma":[0.01805526,0.00019606113,0.00017291537,0.0002023571,0.00022002698,0.000017099974,0.00033753813,0.00031505275,0.00004398886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027695711,0.0005325143,0.000020135067,0.0008725116,0.00006733335,0.00006181955,0.0011181956,0.00031777125,0.00024613258,0.878538,0.10840611,0.009542519],"study_design_scores_gemma":[0.0012225803,0.0003862509,7.482746e-7,0.0003982074,0.00006247981,0.00001688294,0.00004820174,0.12162796,0.007293033,0.6702683,0.1982658,0.00040954663],"about_ca_topic_score_codex":0.00002376194,"about_ca_topic_score_gemma":0.000002978574,"teacher_disagreement_score":0.23550633,"about_ca_system_score_codex":0.0000642603,"about_ca_system_score_gemma":0.00017806843,"threshold_uncertainty_score":0.9902161},"labels":[],"label_agreement":null}]}