Approximate String Matching: Computing, String (computer science), Pattern, Spell checker, Levenshtein distance, agrep, Dynamic programming, Edit distance, Suffix tree -
-25% koodiga BOOKS
Saadetis 15-21 tööpäeva jooksul
30-päevane tagastamisõigus
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 ... Täielik kirjeldus
Võib-olla meeldib sulle ka
Kirjeldus
Lisateave
| Kirjastaja | OmniScriptum |
|---|---|
| Väljalaskeaasta | 2026 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9786133736115 |