Extended Finite State Models of Language

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $37.24
Usually ships in 1-2 business days
(Save 69%)
Other sellers (Hardcover)
  • All (5) from $37.24   
  • New (3) from $37.24   
  • Used (2) from $50.00   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$37.24
Seller since 2014

Feedback rating:

(0)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
Hardcover New 052163198X Brand New US Edition Book in Perfect Condition. Fast Shipping with tracking number.

Ships from: Houston, TX

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$105.00
Seller since 2014

Feedback rating:

(177)

Condition: New
Brand new.

Ships from: acton, MA

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$400.00
Seller since 2014

Feedback rating:

(4)

Condition: New
052163198X NO PO BOX please. Shrink-wrapped. Shipped by courier. Need a code or CD? Double check ISBN. Publishers offer new books WITH & WITHOUT access codes. Buy NEW for valid ... textbook access code if applicable to your book. Any questions, please contact me. Thanks -Rod Read more Show Less

Ships from: Houston, TX

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

Overview

This volume and the accompanying CD-ROM cover the whole breadth of contemporary finite state language modeling, from the mathematical foundations to developing and debugging specific grammars. In addition to applications developed in the broad frameworks of the Xerox regular expression calculus or the AT&T/Bell Labs system of weighted transducers, finite state methods are shown to be useful in constraint-based or TAG-based systems, for machine translation, for information extraction, and for discourse analysis. The book is intended for students, software engineers, and researchers working in the area of natural language processing or computational linguistics. System requirements: CD-ROM drive. A web browser and PostScript viewer are required for some files. Executable programs run only under Linux and SunOS but the source code and ancillary files are accessible on any DOS or Windows computer with a CD-ROM drive, or Macintosh computer with a CD-ROM drive with ISO 9660 File Access system extension.

Read More Show Less

Product Details

  • ISBN-13: 9780521631983
  • Publisher: Cambridge University Press
  • Publication date: 9/28/1999
  • Series: Studies in Natural Language Processing Series
  • Edition description: BK&CD ROM
  • Pages: 291
  • Product dimensions: 5.98 (w) x 8.98 (h) x 0.87 (d)

Table of Contents

1. Extended finite state models of language; 2. A parser from antiquity: an early application of finite state transducers to natural language parsing; 3. Comments on Joshi and Hopely; 4. Implementing and using finite automata toolkits; 5. Finite state morphology and formal verification; 6. The Japanese lexical transducer based on stem-suffix style forms; 7. Acquiring rules for reducing morphological ambiguity from POS tagged corpus in Korean; 8. Finite state based reductionist parsing for French; 9. Light parsing as finite state filtering; 10. Vectorized finite state automata; 11. Finite state transducers: parsing free and frozen sentences; 12. Text and speech translation by means of subsequential transducers; 13. Finite state segmentation of discourse into clauses; 14. Between finite state and Prolog: contraint-based automata for efficient recognition of phrases; 15. Explanation-based learning and finite state transducers: applications to parsing lexicalized tree adjoining grammars; 16. Use of weighted finite state transducers; 17. Colonies: a multi-agent approach to language generation; 18. An innovative finite state concept for recognition and parsing of context-free languages; 19. Hidden Markov models with finite state supervision.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)