{"id":"W1515132277","doi":"10.1007/978-3-540-27868-9_26","title":"Dictionary-Based Syntactic Pattern Recognition Using Tries","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trie; Levenshtein distance; Computer science; String (physics); Prefix; Edit distance; Set (abstract data type); Computation; Representation (politics); Element (criminal law); Algorithm; Substitution (logic); Theoretical computer science; Data structure; Mathematics; Programming language","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.0005975774,0.001458664,0.00196292,0.002994453,0.0007751516,0.002259786,0.001926911,0.0009746355,0.01682357],"category_scores_gemma":[0.002087198,0.000687193,0.001387048,0.003855069,0.0008090374,0.002908839,0.002230052,0.001341626,0.01638191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000307417,"about_ca_system_score_gemma":0.001146032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001618797,"about_ca_topic_score_gemma":0.003029994,"domain_scores_codex":[0.9992428,0.0001355856,0.00008508978,0.0002162091,0.0002382418,0.00008217327],"domain_scores_gemma":[0.9987212,0.0004820554,0.00005738625,0.000295288,0.0003875277,0.00005652387],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004036806,0.00007244161,0.0007532861,0.0003734299,0.000105967,0.0003180053,0.0001447137,0.00502501,0.03313907,0.01142444,0.01278071,0.9354593],"study_design_scores_gemma":[0.0002023086,0.0004894313,0.001763034,0.000202785,0.0003992564,0.002601332,0.0008117009,0.7205493,0.169154,0.05578976,0.04786464,0.0001723722],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01855697,0.0006684977,0.9525971,0.0001641908,0.0003229347,0.0002050821,0.001138695,0.01903809,0.00730844],"genre_scores_gemma":[0.1321727,0.001013236,0.8432969,0.0002691025,0.0001266847,0.0003053438,0.005164162,0.001762931,0.01588884],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01682357,"threshold_uncertainty_score":0.05628043,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03047022484350267,"score_gpt":0.2534543415989348,"score_spread":0.2229841167554321,"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."}}