DeepRead
Cover of Finite state morphology

Finite state morphology

Kenneth R. Beesley · 2003

Minds, machines and the future › Linguistics and language

#11,849 most recommended

About the book

The book covers finite-state morphology, the study of how words are built from stems, affixes and other morphemes, and the computational methods for describing and processing that structure. Its scope includes lexicons of morphemes, the morphotactic rules that combine them, and the spelling alternations that relate underlying forms to surface forms. It was written with Lauri Karttunen and centres on the Xerox finite-state toolkit as the working environment. The central claim is that morphological analysis and generation can be modelled exactly as regular relations, so that lexicons and alternation rules become finite-state transducers that can be compiled and composed into a single system usable in both directions. The authors argue that this approach is practical for real languages and not only a theoretical device. They show how two-level rules and replace rules compile into transducers, and they support the case with worked examples from several languages.

Written by Claude from what it knows of this book.

What Hacker News says 0% recommend · 0% critical

01220202022202420262020 peak · 1
This bookAverage book in Linguistics and language

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2003
ISBN
9781575864341
Editions known
4 at Open Library
Open Library
OL5969101W

Comparative and general GrammarComputational linguisticsData processingGrammar, comparative and general, morphologyMorphology

Explore in the mosaic

Read next: its neighbours on the mosaic