Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

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

Anglų
2026-04-10
125,22 € 166,96 €

-25% su kodu BOOKS

Turime sandėlyje pas mūsų tiekėją

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

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

Daugiau informacijos

Leidėjas OmniScriptum
Išleidimo metai 2026
Viršelio tipas Minkšti viršeliai
EAN 9786133736115
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Approximate String Matching: Computing, String (computer science), Pattern, Spell checker, Levenshtein distance, agrep, Dynamic programming, Edit distance, Suffix tree
Jūsų įvertinimas:

Goodreads Atsiliepimai

125,22 € 166,96 €