in Dan Jurafsky and James H. Martin “Speech and language processing: an introduction to natural language processing, computational linguistics, and speech recognition”, 2009, Pearson Prentice Hall, Upper Saddle River, N.J., Second edition, ISBN 0135041961
Jurafsky & Martin - Section 3.1 - English Morphology
In speech technology for English, little or no use is made of morphology. But for other languages, it is essential.
Jurafsky & Martin - Section 3.2 - Finite-State Morphological Parsing
Automatic morphological decomposition of written words is possible. However, this section does not consider the added complication of deriving a pronunciation.
Jurafsky & Martin - Section 3.3 - Construction of a Finite-State Lexicon
A lexicon can be representing using different data structures (finite state network, tree, lookup table,...), depending on the application.
Jurafsky & Martin - Section 3.4 - Finite-State Transducers
FST are a powerful and general-purpose mechanism for mapping ("transducing") an input string to an output string.
Forum for discussing this reading
- You must be logged in to reply to this topic.