Survey: Finite-state technology in natural language processing

被引:5
|
作者
Maletti, Andreas [1 ]
机构
[1] Univ Stuttgart, Inst Nat Language Proc, Pfaffenwaldring 5b, D-70569 Stuttgart, Germany
关键词
Finite-state automaton; Tree automaton; Context-free grammar; Natural language processing; Tokenization; Part-of-speech tagging; Parsing; Machine translation; MAXIMUM-LIKELIHOOD; PROBABILISTIC FUNCTIONS;
D O I
10.1016/j.tcs.2016.05.030
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this survey, we will discuss current uses of finite-state information in several statistical natural language processing tasks. To this end, we will review standard approaches in tokenization, part-of-speech tagging, and parsing, and illustrate the utility of finite-state information and technology in these areas. The particular problems were chosen to allow a natural progression from simple prediction to structured prediction. We aim for a sufficiently formal presentation suitable for readers with a background in automata theory that allows to appreciate the contribution of finite-state approaches, but we will not discuss practical issues outside the core ideas. We provide instructive examples and pointers into the relevant literature for all constructions. We close with an outlook on finite-state technology in statistical machine translation. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:2 / 17
页数:16
相关论文
共 50 条
  • [31] Finite-State Independence
    Becher, Veronica
    Carton, Olivier
    Ariel Heiber, Pablo
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (07) : 1555 - 1572
  • [32] A survey of graphs in natural language processing
    Nastase, Vivi
    Mihalcea, Rada
    Radev, Dragomir R.
    NATURAL LANGUAGE ENGINEERING, 2015, 21 (05) : 665 - 698
  • [33] Natural language processing in finance: A survey
    Du, Kelvin
    Zhao, Yazhi
    Mao, Rui
    Xing, Frank
    Cambria, Erik
    INFORMATION FUSION, 2025, 115
  • [34] FINITE-STATE CODES
    POLLARA, F
    MCELIECE, RJ
    ABDELGHAFFAR, K
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) : 1083 - 1089
  • [35] The Finite-State Playground
    Hammond, Michael
    INTERNATIONAL JOURNAL OF ENGLISH STUDIES, 2008, 8 (01): : 123 - 139
  • [36] Finite-state dimension
    Dai, JJ
    Lathrop, JI
    Lutz, JH
    Mayordomo, E
    THEORETICAL COMPUTER SCIENCE, 2004, 310 (1-3) : 1 - 33
  • [37] Finite-state syllabification
    Hulden, Mans
    FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2006, 4002 : 86 - 96
  • [38] Finite-state dimension
    Dai, JJ
    Lathrop, JI
    Lutz, JH
    Mayordomo, E
    AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 1028 - 1039
  • [39] Finite-State Independence
    Verónica Becher
    Olivier Carton
    Pablo Ariel Heiber
    Theory of Computing Systems, 2018, 62 : 1555 - 1572
  • [40] Deciding sequentiability of finite-state transducers by finite-state pattern-matching
    Gaál, T
    THEORETICAL COMPUTER SCIENCE, 2004, 313 (01) : 105 - 117