Central Library

Normal view MARC view ISBD view

Finite-State Text Processing [electronic resource] / by Kyle Gorman, Richard Sproat.

By: Gorman, Kyle [author.].
Contributor(s): Sproat, Richard [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Synthesis Lectures on Human Language Technologies: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2021Edition: 1st ed. 2021.Description: XVII, 140 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783031021794.Subject(s): Artificial intelligence | Natural language processing (Computer science) | Computational linguistics | Artificial Intelligence | Natural Language Processing (NLP) | Computational LinguisticsAdditional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification: 006.3 Online resources: Click here to access online
Contents:
Preface -- Acknowledgments -- Finite-State Machines -- The Pynini Library -- Basic Algorithms -- Advanced Algorithms -- Rewrite Rules -- Morphological Analysis and Generation -- The Future -- Bibliography -- Authors' Biographies -- Index.
In: Springer Nature eBookSummary: Weighted finite-state transducers (WFSTs) are commonly used by engineers and computational linguists for processing and generating speech and text. This book first provides a detailed introduction to this formalism. It then introduces Pynini, a Python library for compiling finite-state grammars and for combining, optimizing, applying, and searching finite-state transducers. This book illustrates this library's conventions and use with a series of case studies. These include the compilation and application of context-dependent rewrite rules, the construction of morphological analyzers and generators, and text generation and processing applications.
    average rating: 0.0 (0 votes)
No physical items for this record

Preface -- Acknowledgments -- Finite-State Machines -- The Pynini Library -- Basic Algorithms -- Advanced Algorithms -- Rewrite Rules -- Morphological Analysis and Generation -- The Future -- Bibliography -- Authors' Biographies -- Index.

Weighted finite-state transducers (WFSTs) are commonly used by engineers and computational linguists for processing and generating speech and text. This book first provides a detailed introduction to this formalism. It then introduces Pynini, a Python library for compiling finite-state grammars and for combining, optimizing, applying, and searching finite-state transducers. This book illustrates this library's conventions and use with a series of case studies. These include the compilation and application of context-dependent rewrite rules, the construction of morphological analyzers and generators, and text generation and processing applications.

There are no comments for this item.

Log in to your account to post a comment.