{"id":"W2054767096","doi":"10.1007/s10044-006-0032-z","title":"Breadth-first search strategies for trie-based syntactic pattern recognition","year":2006,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trie; Computer science; Computation; Prefix; String (physics); Heuristic; Representation (politics); Algorithm; Element (criminal law); Dynamic programming; Data structure; Theoretical computer science; Pattern recognition (psychology); Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016698,0.0009102386,0.001533837,0.004224204,0.001009094,0.001805735,0.001871005,0.001387715,0.01016935],"category_scores_gemma":[0.005695142,0.0006805453,0.0009790303,0.00408897,0.001102665,0.0033759,0.001934325,0.001346083,0.004175503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006457397,"about_ca_system_score_gemma":0.001331836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002012861,"about_ca_topic_score_gemma":0.003820153,"domain_scores_codex":[0.9989807,0.0002135767,0.0001424158,0.0001906738,0.0003648899,0.0001076749],"domain_scores_gemma":[0.9970197,0.001684636,0.00013417,0.0005570982,0.0005166729,0.00008769881],"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.0003817352,0.0002361124,0.0006631756,0.0004710609,0.00007490569,0.0002821788,0.0004293832,0.02324378,0.01892707,0.04789172,0.01252126,0.8948776],"study_design_scores_gemma":[0.0001809954,0.0002399103,0.000503132,0.0001322391,0.0001138675,0.0009592781,0.0004906452,0.7400731,0.02509506,0.2137834,0.01834186,0.00008652337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01881198,0.001213551,0.9702867,0.0003395104,0.00007125023,0.0001949098,0.0005052612,0.00389199,0.004684872],"genre_scores_gemma":[0.122121,0.0007917956,0.8687533,0.0002385332,0.00005584752,0.0003069501,0.00186043,0.0006734153,0.005198738],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01016935,"threshold_uncertainty_score":0.03401989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02461615076739881,"score_gpt":0.2738431311713298,"score_spread":0.249226980403931,"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."}}