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 条
  • [21] Smaller representations for finite-state transducers and finite-state automata
    Roche, E
    COMBINATORIAL PATTERN MATCHING, 1995, 937 : 352 - 365
  • [22] Finite-state registered automata and their uses in natural languages
    Cohen-Sygal, Yael
    Wintner, Shuly
    FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2006, 4002 : 43 - +
  • [23] Natural Language Processing for Dialects of a Language: A Survey
    Joshi, Aditya
    Dabre, Raj
    Kanojia, Diptesh
    Li, Zhuang
    Zhan, Haolan
    Haffari, Gholamreza
    Dippold, Doris
    ACM COMPUTING SURVEYS, 2025, 57 (06)
  • [24] DEEP LEARNING IN NATURAL LANGUAGE PROCESSING: A STATE-OF-THE-ART SURVEY
    Chai, Junyi
    Li, Anming
    PROCEEDINGS OF 2019 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), 2019, : 535 - 540
  • [25] Recurrent Neural Language Models as Probabilistic Finite-state Automata
    Svete, Anej
    Cotterell, Ryan
    2023 CONFERENCE ON EMPIRICAL METHODS IN NATURAL LANGUAGE PROCESSING, EMNLP 2023, 2023, : 8069 - 8086
  • [26] Probabilistic Finite-State morphological segmenter for Wixarika (huichol) language
    Mager, Manuel
    Carrillo, Dionico
    Meza, Ivan
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2018, 34 (05) : 3081 - 3087
  • [27] Profer: Predictive, robust finite-state parsing for spoken language
    Kaiser, EC
    Johnston, M
    Heeman, PA
    ICASSP '99: 1999 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS VOLS I-VI, 1999, : 629 - 632
  • [28] Stochastic Finite-State Models for Spoken Language Machine Translation
    Bangalore, Srinivas
    Riccardi, Giuseppe
    Machine Translation, 2002, 17 (03) : 165 - 184
  • [29] OWL Simplified English: A Finite-State Language for Ontology Editing
    Power, Richard
    CONTROLLED NATURAL LANGUAGE, CNL 2012, 2012, 7427 : 44 - 60
  • [30] Image processing algorithms based on finite-state Gibbs models
    Vasyukov, Vasily N.
    IFOST 2006: 1st International Forum on Strategic Technology, Proceedings: E-VEHICLE TECHNOLOGY, 2006, : 287 - 288