Approximate String Matching: Computing, String (computer science), Pattern, Spell checker, Levenshtein distance, agrep, Dynamic programming, Edit distance, Suffix tree -
-25% ar kodu BOOKS
Piegāde 15-21 darba dienu laikā
30 dienu atgriešanas 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 ... Pilns apraksts
Jums varētu patikt arī
Aprašymas
Vairāk informācijas
| Izdevējs | OmniScriptum |
|---|---|
| Izlaides gads | 2026 |
| Vāka tips | Mīkstais vāks |
| EAN | 9786133736115 |