20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Approximate String Matching: Computing, String (computer science), Pattern, Spell checker, Levenshtein distance, agrep, Dynamic programming, Edit distance, Suffix tree -

English
2026-04-10
€133.57 €166.96

-20% with code BOOKS

In stock at our supplier

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

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 edit distance between the string and the pattern. The usual primitive operations are: insertion: cot ¿ coat, deletion: coat ¿ cot, substitution: coat ¿ cost

More Information

Publisher OmniScriptum
Release year 2026
Cover type Softcover
EAN 9786133736115
Write Your Own Review
You're reviewing: Approximate String Matching: Computing, String (computer science), Pattern, Spell checker, Levenshtein distance, agrep, Dynamic programming, Edit distance, Suffix tree
Your Rating:

Goodreads Reviews

€133.57 €166.96