Finite-state language processing
著者
書誌事項
Finite-state language processing
(Language, speech, and communication)(Bradford book)
MIT Press, c1997
- : hc
大学図書館所蔵 全40件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references and index
内容説明・目次
内容説明
Finite-state devices, which include finite-state automata, graphs, and finite-state transducers, are in wide use in many areas of computer science. Recently, there has been a resurgence of the use of finite-state devices in all aspects of computational linguistics, including dictionary encoding, text processing, and speech processing. This book describes the fundamental properties of finite-state devices and illustrates their uses. Many of the contributors pioneered the use of finite-automata for different aspects of natural language processing. The topics, which range from the theoretical to the applied, include finite-state morphology, approximation of phrase-structure grammars, deterministic part-of-speech tagging, application of a finite-state intersection grammar, a finite-state transducer for extracting information from text, and speech recognition using weighted finite automata. The introduction presents the basic theoretical results in finite-state automata and transducers. These results and algorithms are described and illustrated with simple formal language examples as well as natural language examples.Contributors : Douglas Appelt, John Bear, David Clemenceau, Maurice Gross, Jerry R.
Hobbs, David Israel, Megumi Kameyama, Lauri Karttunen, Kimmo Koskenniemi, Mehryar Mohri, Eric Laporte, Fernando C. N. Pereira, Michael D. Riley, Emmanuel Roche, Yves Schabes, Max D. Silberztein, Mark Stickel, Pasi Tapanainen, Mabry Tyson, Atro Voutilainen, Rebecca N. Wright.Language, Speech, and Communication series
目次
- Part 1 Introduction, Emmanual Roche and Yves Schabes: preliminaries
- finite-state automata
- finite-state transducers
- bibliographical notes. Part 2 Finite-stage morphology - inflections and derivations in a single framework using dictionaries and rules, David Clemenceau: towards a structured dictionary
- MORPHO - a morphological analyzer based on a dictionary and a two-level system
- a single framework for inflections and derivations recognition and generation
- conclusion. Part 3 Representations and finite-state components in natural language, Kimmo Koskenniemi: a framework, two-level morphology
- finite-state syntactic grammar
- experiences. Part 4 The replace operator, Lauri Karttunen: unconditional replacement
- conditional replacement
- comparisons
- conclusion. Part 5 Finite-state approximation of phrase-structure grammars, Fernando C.N. Pereira and Rebecca N. Wright: motivation
- the approximation method
- formal properties
- implementation and example
- informal analysis
- related work and conclusions. Part 6 The lexical analysis of natural languages, Max D. Silberztein: the lexical analysis of programming langauges and of natural languages
- the units of analysis
- the representation of simple words
- representation of compound words
- representation of the results of the analysis, elimination of ambiguities by local grammars
- tagging programmes and lexical analysis
- conclusion. Part 7 Deterministic part-of-speech tagging with finite-state transducers, Emmanuel Roche and Yves Schabes: overview of Brill's tagger
- complexity of Brill's tagger
- construction of the finite-state tagger
- lexical tagger
- tagging unknown words
- empirical evaluation
- finite-state transudcers
- determinization
- subsequentiality of transformation-based systems
- implementation of finite-state transducers
- conclusion. Part 8 Parsing with finite-state transducers, Emmanuel Roche: background
- a top-down parser for context-free grammars
- morphology
- a parser for transformation grammars
- finite-state acceleration
- a transducer parser for tree-adjoining grammars
- conclusion. Part 9 Designing a (finite-state) parsing grammar, Atro Voutilainen: framework
- grammatical representation
- sample rule
- heuristic techniques
- final remarks. Part 10 Applying a finite-state intersection grammar, Pasi Tapanainen: straight intersection
- sequential methods
- parallel intersection
- hybrid intersection-search method
- a small comparison
- theoretical worst-case study
- conclusion. Part 11 The construction of local grammars, Maurice Gross: linguistic modules
- transformations
- conclusion. Part 12 On the use of sequential transducers in natural language processing, Mehryar Mohri: definitions
- characterization and extensions
- phonology and morphology
- representation of large dictionaries
- syntax
- speech processing
- conclusion. (Part contents).
「Nielsen BookData」 より