Approximate String Matching: Computing, String (computer science), Pattern, Spell checker, Levenshtein distance, agrep, Dynamic programming, Edit distance, Suffix tree -
-25% su kodu BOOKS
Pristatymas per 15-21 d.d.
30 dienų grąžinimo politika
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computing, approximate string matching is the technique of finding approximate matches to a pattern in a string. The closeness of a match is measured in terms of the number of primitive operations necessary to convert the string into an exact match. This number is called the edi ... Visas aprašymas
Jums taip pat gali patikti
Aprašymas
Daugiau informacijos
| Leidėjas | OmniScriptum |
|---|---|
| Išleidimo metai | 2026 |
| Viršelio tipas | Minkšti viršeliai |
| EAN | 9786133736115 |