An unsupervised method for weighting finite-state morphological analyzers

被引:0
|
作者
Keleg, Amr [1 ]
Tyers, Francis M.
Howell, Nicholas
Pirinen, Tommi A.
机构
[1] Hamburger Zentrum Sprachkorpora, Fac Engn, Dept Linguist, Sch Linguist, Hamburg, Germany
关键词
FSTs; FST weighting; constraint grammar; word2vec;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Morphological analysis is one of the tasks that have been studied for years. Different techniques have been used to develop models for performing morphological analysis. Models based on finite state transducers have proved to be more suitable for languages with low available resources. In this paper, we have developed a method for weighting a morphological analyzer built using finite state transducers in order to disambiguate its results. The method is based on a word2vec model that is trained in a completely unsupervised way using raw untagged corpora and is able to capture the semantic meaning of the words. Most of the methods used for disambiguating the results of a morphological analyzer relied on having tagged corpora that need to manually built. Additionally, the method developed uses information about the token irrespective of its context unlike most of the other techniques that heavily rely on the word's context to disambiguate its set of candidate analyses.
引用
收藏
页码:3842 / 3850
页数:9
相关论文
共 50 条
  • [31] Morphological Analysis and Synthesis of Manipuri Verbs Using Xerox Finite-State Tools
    Singha, Ksh Krishna B.
    INFORMATION, COMMUNICATION AND COMPUTING TECHNOLOGY, 2017, 750 : 44 - 56
  • [32] An automatic acquisition method of statistic finite-state automaton for sentences
    Suzuki, M
    Makino, S
    Aso, H
    ICASSP '99: 1999 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS VOLS I-VI, 1999, : 737 - 740
  • [33] Efficient implementation of morphological finite-state transition networks employing their statistical properties
    Glushnev, N
    O'Donovan, B
    Troussov, A
    2003 INTERNATIONAL CONFERENCE ON NATURAL LANGUAGE PROCESSING AND KNOWLEDGE ENGINEERING, PROCEEDINGS, 2003, : 50 - 55
  • [34] SPYH-method: an Improvement in Testing of Finite-State Machines
    Soucha, Michal
    Bogdanov, Kirill
    2018 IEEE 11TH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION WORKSHOPS (ICSTW), 2018, : 194 - 203
  • [35] Finite-state temporal projection
    Fernando, Tim
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 4094 : 230 - 241
  • [36] Finite-state models in surgery
    Webster, RW
    COMPUTER GRAPHICS WORLD, 2000, 23 (01) : 6 - 6
  • [37] Finite-state code generation
    Fraser, CW
    Proebsting, TA
    ACM SIGPLAN NOTICES, 1999, 34 (05) : 270 - 280
  • [38] FINITE-STATE PROBABILISTIC LANGUAGES
    KNAST, R
    INFORMATION AND CONTROL, 1972, 21 (02): : 148 - &
  • [39] Benchmarking finite-state verifiers
    Avrunin G.S.
    Corbett J.C.
    Dwyer M.B.
    International Journal on Software Tools for Technology Transfer, 2000, 2 (4) : 317 - 320
  • [40] On the Capacity of Finite-State Channels
    Chen, Jun
    Permuter, Haim
    Weissman, Tsachy
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 1223 - +