Approximate String Matching: Computing, String (computer science), Pattern, Spell checker, Levenshtein distance, agrep, Dynamic programming, Edit distance, Suffix tree -
-20% with code BOOKS
Shipping in 15-21 days
30-day return policy
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 ... Full description
You May Also Like
Description
More Information
| Publisher | OmniScriptum |
|---|---|
| Release year | 2026 |
| Cover type | Softcover |
| EAN | 9786133736115 |