Finite-State Morphology / Edition 1
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.
1101418387
Finite-State Morphology / Edition 1
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.
40.0 In Stock
Finite-State Morphology / Edition 1

Finite-State Morphology / Edition 1

Finite-State Morphology / Edition 1

Finite-State Morphology / Edition 1

Paperback(1)

$40.00 
  • SHIP THIS ITEM
    In stock. Ships in 3-7 days. Typically arrives in 3 weeks.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

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.

Product Details

ISBN-13: 9781575864341
Publisher: Center for the Study of Language and Inf
Publication date: 04/01/2003
Series: Studies in Computational Linguistics , #3
Edition description: 1
Pages: 503
Product dimensions: 6.00(w) x 9.00(h) x 1.10(d)

Table of Contents

1   A Gentle Introduction
2   A Systematic Introduction
3   The xfst Interface
4   The lexc Language
5   Planning and Managing Finite-State Projects
6   Testing and Debugging
7   Flag Diacritics
8   Non-Concatenative Morphotactics
9   Finite-State Linguistic Applications
 
A  Graphing Quiz
B   Solutions to Exercises
From the B&N Reads Blog

Customer Reviews