{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032745056,0.00096808275,0.50465775,0.0004644863,0.00025376302,0.0004412973,0.012997942,0.42768764,0.019783946],"genre_scores_gemma":[0.24629498,0.00049144594,0.6688317,0.00063280266,0.00019121863,0.00038356244,0.039117906,0.013205474,0.03085084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932337,0.00012929192,0.0001035742,0.00023441235,0.00015055867,0.000058845137],"domain_scores_gemma":[0.99871373,0.0002966587,0.00009438727,0.00047568863,0.0003369781,0.00008253452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010116898,0.00074519514,0.0011964228,0.0012623444,0.0007680697,0.0016567949,0.0020616257,0.0012084628,0.020668693],"category_scores_gemma":[0.0027742116,0.00073755434,0.0005834022,0.0008008975,0.00047048862,0.004353434,0.0023893781,0.0011575597,0.025062254],"study_design_candidate":"simulation_or_modeling","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.0026906824,0.00030894738,0.0019806556,0.0013193534,0.00028851352,0.0010942246,0.00069053884,0.0052145314,0.16972002,0.010577099,0.14782436,0.658291],"study_design_scores_gemma":[0.0013082525,0.0010551455,0.008270503,0.00025399667,0.0006186498,0.0040380782,0.0005833475,0.40725216,0.29081747,0.03658488,0.24869242,0.0005250075],"about_ca_topic_score_codex":0.001878032,"about_ca_topic_score_gemma":0.003189022,"teacher_disagreement_score":0.020668693,"about_ca_system_score_codex":0.00037519156,"about_ca_system_score_gemma":0.000715543,"threshold_uncertainty_score":0.06914365},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003481917,0.00006588502,0.5522884,0.000213896,0.00008801217,0.00049138383,0.0046361913,0.4314214,0.0073129344],"genre_scores_gemma":[0.14681624,0.00034599815,0.59276414,0.0014983506,0.00013351571,0.0030560538,0.025504896,0.20487498,0.025005853],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977508,0.00043670068,0.00034485763,0.00044680017,0.00073090236,0.00028995977],"domain_scores_gemma":[0.9964886,0.0017515264,0.00019692216,0.0006417846,0.0005901108,0.00033107548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003633167,0.0017894767,0.0013112649,0.0016537973,0.0008197383,0.0027671813,0.0045890342,0.0013352507,0.065681346],"category_scores_gemma":[0.008036399,0.0018242941,0.00214816,0.0010450503,0.0018013024,0.0050716135,0.0076807067,0.0029185656,0.029895619],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0032535314,0.00081811356,0.0077237953,0.0023536056,0.00031193145,0.003815711,0.004303603,0.025921794,0.038010854,0.096556984,0.42780778,0.3891223],"study_design_scores_gemma":[0.0009778203,0.00019471395,0.0037612158,0.0004956051,0.00010223849,0.0020099152,0.00037442896,0.29282886,0.047437675,0.10071102,0.55060786,0.0004986959],"about_ca_topic_score_codex":0.0032520972,"about_ca_topic_score_gemma":0.0025837154,"teacher_disagreement_score":0.065681346,"about_ca_system_score_codex":0.0015771675,"about_ca_system_score_gemma":0.0024122244,"threshold_uncertainty_score":0.21972597},"labels":[],"label_agreement":null}]}