{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007718863,0.0001039467,0.0001722037,0.0005185831,0.0001900312,0.0005208173,0.003327385,0.00002401945,0.00001728419],"category_scores_gemma":[0.00008498149,0.00008962546,0.0001160545,0.0004229313,0.0001559423,0.003031478,0.0004825883,0.0001101934,0.000004669474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000901706,"about_ca_system_score_gemma":0.0001301324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006960326,"about_ca_topic_score_gemma":4.2629e-7,"domain_scores_codex":[0.9979995,0.00002055499,0.0005733421,0.0002333799,0.0009799224,0.0001932937],"domain_scores_gemma":[0.9972534,0.000188292,0.0006026107,0.0003099405,0.001545086,0.0001006826],"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.000015956,0.0003997002,0.0001192417,0.0000179412,0.0000962799,0.00001944099,0.001568228,0.01055424,0.007332327,0.18042,0.001159573,0.798297],"study_design_scores_gemma":[0.0006309115,0.000176644,0.0008297113,0.000116553,0.000006291368,0.0001929858,0.00001440497,0.9780756,0.003823123,0.01294094,0.003055441,0.0001374087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00759615,0.0000659057,0.987943,0.001033177,0.003128082,0.00008804799,0.000009871756,0.00002152801,0.0001142241],"genre_scores_gemma":[0.3822014,0.00001988291,0.6173548,0.00007668826,0.0003258293,0.000001996219,0.000001311259,0.000003747056,0.00001442194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9675214,"threshold_uncertainty_score":0.6183164,"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."}}