چه کسانی این کتاب را می‌خوانند

دانشجوعلاقه‌مند یادگیری
کتابخوان حرفه‌ایلذت مطالعه
نویسندهالهام‌گیری

Finite state morphology

Kenneth R. Beesley, Lauri Karttunen

قیمت نهایی

۴۰٬۰۰۰ تومان۴۹٬۰۰۰ تومان۱۸٪ تخفیف
  • تخفیف زمان‌دار−۹٬۰۰۰ تومان

۹٬۰۰۰ تومان صرفه‌جویی نسبت به قیمت اصلی

بلافاصله پس از خرید، فایل کتاب روی دستگاه شما آمادهٔ دانلود است.

تحویل فوری
پرداخت امن
ضمانت فایل
پشتیبانی

نسخه اصلی و اورجینال

فایل دیجیتال کامل و بدون دستکاری — همان نسخه‌ای که پس از خرید دریافت می‌کنید.

مشخصات کتاب

سال انتشار
۲۰۰۳
فرمت
DJVU
زبان
انگلیسی
حجم فایل
۴٫۳ مگابایت

دربارهٔ کتاب

the Finite-state Paradigm Of Computer Science Has Provided A Basis For Natural-language Applications That Are Efficient, Elegant, And Robust. This Volume Is A Practical Guide To Finite-state Theory And The Affiliated Programming Languages Lexc And Xfst. Readers Will Learn How To Write Tokenizers, Spelling Checkers, And Especially Morphological Analyzer/generators For Words In English, French, Finnish, Hungarian, And Other Languages. included Are Graded Introductions, Examples, And Exercises Suitable For Individual Study As Well As Formal Courses. These Take Advantage Of Widely-tested Lexc And Xfst Applications That Are Just Becoming Available For Noncommercial Use Via The Internet. The finite-state paradigm of computer science has provided a basis for natural-language applications that are efficient, elegant, and robust. This volume is a practical guide to finite-state theory and the affiliated programming languages lexc and xfst. Readers will learn how to write tokenizers, spelling checkers, and especially morphological analyzer/generators for words in English, French, Finnish, Hungarian, and other languages. Included are graded introductions, examples, and exercises suitable for individual study as well as formal courses. These take advantage of widely-tested lexc and xfst applications that are just becoming available for noncommercial use via the Internet. The finite-state paradigm of computer sciences has provided a basis for natural-language applications that are efficient, elegant and robust. This volume is a practical guide to finite-state theory and the affiliated programming languages lexc and xfst. Readers will learn how to write tokenizers, spelling checkers, and especially morphological analyzer/generators for words in English, French, Finnish, Hungarian and other languages Included are graded introductions, examples, and exercises suitable for individual study as well as formal courses. These take advantage of widely tested lexc and xfst applications that are just becoming available for noncommercial use via the Internet Kenneth R. Beesley, Lauri Karttunen. Includes Bibliographical References (p. [483]-487) And Index. System Requirements For Accompanying Cd-rom: Pc Or Macintosh; Windows Nt/2000/me/xp, Linux, Mac Osx Or Solaris Operating System; Cd-rom Drive.

قیمت نهایی

۴۰٬۰۰۰ تومان