Muutke küpsiste eelistusi

Computational Approaches to Morphology and Syntax [Kõva köide]

4.50/5 (4 hinnangut Goodreads-ist)
(Oregon Health & Science University), (University of Illinois at Urbana-Champaign)
  • Formaat: Hardback, 336 pages, kõrgus x laius x paksus: 254x178x22 mm, kaal: 749 g
  • Sari: Oxford Surveys in Syntax & Morphology 4
  • Ilmumisaeg: 09-Aug-2007
  • Kirjastus: Oxford University Press
  • ISBN-10: 0199274770
  • ISBN-13: 9780199274772
Teised raamatud teemal:
Computational Approaches to Morphology and SyntaxSuurem pilt
  • Formaat: Hardback, 336 pages, kõrgus x laius x paksus: 254x178x22 mm, kaal: 749 g
  • Sari: Oxford Surveys in Syntax & Morphology 4
  • Ilmumisaeg: 09-Aug-2007
  • Kirjastus: Oxford University Press
  • ISBN-10: 0199274770
  • ISBN-13: 9780199274772
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9780199274772.html
Märksõnad:
The book will appeal to scholars and advanced students of morphology, syntax, computational linguistics and natural language processing (NLP). It provides a critical and practical guide to computational techniques for handling morphological and syntactic phenomena, showing how these techniques have been used and modified in practice.

The authors discuss the nature and uses of syntactic parsers and examine the problems and opportunities of parsing algorithms for finite-state, context-free and various context-sensitive grammars. They relate approaches for describing syntax and morphology to formal mechanisms and algorithms, and present well-motivated approaches for augmenting grammars with weights or probabilities.

Arvustused

the book does a great job explaining complicated formal and algorithmic issues in an accessible way * Xiaofei Lu, Linguist List * essential to everyone interested in morphology, syntax, computational linguistics and Natural Language Processing ... The book covers an impressive amount of material, explaining every concept concisely, exhaustively and clearly. * Anna Feldman, Word Structure *

General preface ix
Preface x
List of Figures
xii
List of Tables
xv
Abbreviations xvii
Introduction and Preliminaries
1(22)
Introduction
1(1)
Finite-State Automata and Transducers
2(6)
Weights and Probabilities
8(1)
Weighted Finite-State Automata and Transducers
9(4)
A Synopsis of Algorithmic Issues
13(3)
Computational Approaches to Morphology and Syntax
16(7)
PART I. COMPUTATIONAL APPROACHES TO MORPHOLOGY
The Formal Characterization of Morphological Operations
23(39)
Introduction
24(3)
Syntagmatic Variation
27(22)
Simple Concatenation
27(2)
Interlude: Prosodic Circumscription
29(2)
Prosodically Governed Concatenation
31(4)
Phonological Changes Induced by Affixation
35(1)
Subsegmental Morphology
36(1)
Subtractive Morphology
37(2)
Extrametrical Infixation
39(1)
Positively Circumscribed Infixation
40(1)
Root-and-Pattern Morphology
41(5)
Morphemic Components
46(3)
Paradigmatic Variation
49(4)
The Remaining Problem: Reduplication
53(8)
Summary
61(1)
The Relevance of Computational Issues for Morphological Theory
62(38)
Introduction: Realizational versus Incremental Morphology
62(4)
Stump's Theory
66(1)
Computational Implementation of Fragments
67(16)
Stem Alternations in Sanskrit
68(5)
Position Classes in Swahili
73(6)
Double Plurals in Breton
79(4)
Equivalence of Inferential-Realizational and Lexical-Incremental Approaches: A Formal Analysis
83(2)
Conclusions
85(15)
Appendix 3A: Lextools
86(9)
Appendix 3B: XFST Implementation of Sanskrit
95(5)
A Brief History of Computational Morphology
100(16)
Introduction
100(2)
The KIMMO Two-Level Morphological Analyzer
102(11)
KIMMO Basics
103(2)
FST Intersection
105(4)
Koskenniemi's Rule Types
109(1)
Koskenniemi's System as a Historical Accident
110(3)
Summary
113(3)
Machine Learning of Morphology
116(23)
Introduction
116(3)
Goldsmith, 2001
119(5)
Candidate Generation
121(1)
Candidate Evaluation
122(2)
Schone and Jurafsky, 2001
124(5)
Yarowsky and Wicentowski, 2001
129(3)
Discussion
132(7)
PART II. COMPUTATIONAL APPROACHES TO SYNTAX
Finite-state Approaches to Syntax
139(37)
N-gram Models
139(12)
Background
139(2)
Basic Approach
141(2)
Smoothing
143(5)
Encoding
148(2)
Factored Language Models
150(1)
Class-based Language Models
151(8)
Forward Algorithm
154(5)
Part-of-Speech Tagging
159(14)
Viterbi Algorithm
160(2)
Efficient N-best Viterbi Decoding
162(2)
Forward-backward Algorithm
164(4)
Forward-backward Decoding
168(2)
Log-linear Models
170(3)
NP Chunking and Shallow Parsing
173(1)
Summary
174(2)
Basic Context-free Approaches to Syntax
176(33)
Grammars, Derivations and Trees
176(4)
Deterministic Parsing Algorithms
180(9)
Shift-reduce Parsing
181(1)
Pushdown Automata
182(2)
Top-down and Left-corner Parsing
184(5)
Non-deterministic Parsing Algorithms
189(19)
Re-analysis and Beam-search
191(2)
CYK Parsing
193(8)
Earley Parsing
201(2)
Inside-outside Algorithm
203(3)
Labeled Recall Parsing
206(2)
Summary
208(1)
Enriched Context-free Approaches to Syntax
209(39)
Stochastic CFG-based Parsing
209(25)
Treebanks and PCFGs
210(11)
Lexicalized Context-free Grammars
221(5)
Collins Parser
226(4)
Charniak Parser
230(4)
Dependency Parsing
234(4)
PCFG-based Language Models
238(2)
Unsupervised Grammar Induction
240(4)
Finite-state Approximations
244(2)
Summary
246(2)
Context-sensitive Approaches to Syntax
248(37)
Unification Grammars and Parsing
248(9)
Lexicalized Grammar Formalisms and Parsing
257(16)
Tree-adjoining Grammars
258(7)
Combinatory Categorial Grammars
265(5)
Other Mildly Context-sensitive Approaches
270(1)
Finite-state and Context-free Approximations
271(2)
Parse Selection
273(6)
Stochastic Unification Grammars
273(2)
Data-oriented Parsing
275(2)
Context-free Parser Re-ranking
277(2)
Transduction Grammars
279(4)
Summary
283(2)
References 285(22)
Name Index 307(5)
Language Index 312(1)
Index 313
Brian E. Roark is Assistant Professor in the Department of Computer Science & Electrical Engineering and the Center for Spoken Language Understanding at Oregon Health & Science University. He has published papers in Computer Speech and Language, Speech Communication, Natural Language Engineering and Computational Linguistics.



Richard Sproat is Professor of Linguistics and Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign and also holds an appointment at the Beckman Institute for Advanced Science and Technology. His most recent book is A Computational Theory of Writing Systems (CUP, 2000).