{"id":"W2048819748","doi":"10.1142/s0129054102000947","title":"VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING","year":2002,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Algorithm; Bit array; String (physics); String searching algorithm; Matching (statistics); Automaton; Computation; Bounded function; Computer science; Focus (optics); Mathematics; Pattern matching; Theoretical computer science; Type (biology); 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.001833566,0.0008502128,0.001181756,0.00219884,0.000895671,0.00293931,0.002000088,0.001404988,0.007501835],"category_scores_gemma":[0.0115491,0.0005682281,0.0009782601,0.004243928,0.001345278,0.006132762,0.002413225,0.001627317,0.002449444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001361693,"about_ca_system_score_gemma":0.001149675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009385233,"about_ca_topic_score_gemma":0.001012976,"domain_scores_codex":[0.9978005,0.0005957573,0.0002788439,0.0004571904,0.000668026,0.0001996923],"domain_scores_gemma":[0.9966797,0.001702604,0.0002510699,0.0008475048,0.0004592068,0.00005996921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002194911,0.00007756381,0.0005113123,0.000317372,0.00005123982,0.0000514998,0.0001566175,0.07639205,0.00297286,0.5523701,0.006046123,0.3608337],"study_design_scores_gemma":[0.00004115331,0.00007404932,0.0001124907,0.0000549822,0.00002375437,0.0001485618,0.00006073173,0.3770756,0.003911736,0.6039398,0.01453213,0.00002508921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004104448,0.0006587086,0.990841,0.0001371928,0.00007428574,0.00008377619,0.0001175722,0.0009551004,0.003027838],"genre_scores_gemma":[0.1355501,0.001707981,0.8536008,0.000201405,0.0001531517,0.0004932308,0.001089324,0.000403388,0.006800577],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007501835,"threshold_uncertainty_score":0.02509618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04030689551270782,"score_gpt":0.3145119637821279,"score_spread":0.2742050682694201,"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."}}