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 条
  • [21] Finite-state dimension
    Dai, JJ
    Lathrop, JI
    Lutz, JH
    Mayordomo, E
    THEORETICAL COMPUTER SCIENCE, 2004, 310 (1-3) : 1 - 33
  • [22] A method of the unique description of finite-state Gibbs models
    Vasyukov, V. N.
    2005 Microwave Electronics: Measurements, Identification, Applications, 2005, : 214 - 215
  • [23] Finite-state dimension
    Dai, JJ
    Lathrop, JI
    Lutz, JH
    Mayordomo, E
    AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 1028 - 1039
  • [24] Finite-state syllabification
    Hulden, Mans
    FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2006, 4002 : 86 - 96
  • [25] Finite-State Independence
    Verónica Becher
    Olivier Carton
    Pablo Ariel Heiber
    Theory of Computing Systems, 2018, 62 : 1555 - 1572
  • [26] Deciding sequentiability of finite-state transducers by finite-state pattern-matching
    Gaál, T
    THEORETICAL COMPUTER SCIENCE, 2004, 313 (01) : 105 - 117
  • [27] Finite-state Reber automaton and the recurrent neural networks trained in supervised and unsupervised manner
    Cernansky, M
    Benusková, L
    ARTIFICIAL NEURAL NETWORKS-ICANN 2001, PROCEEDINGS, 2001, 2130 : 737 - 742
  • [28] Unsupervised training of a finite-state sliding-window part-of-speech tagger
    Sánchez-Villamil, E
    Forcada, ML
    Carrasco, RC
    ADVANCES IN NATURAL LANGUAGE PROCESSING, 2004, 3230 : 454 - 463
  • [29] Linguist vs. Machine: Rapid Development of Finite-State Morphological Grammars
    Beemer, Sarah
    Boston, Zak
    Bukoski, April
    Chen, Daniel
    Dickens, Princess
    Gerlach, Andrew
    Hopkins, Torin
    Jawale, Parth Anand
    Koski, Chris
    Malhotra, Akanksha
    Mishra, Piyush
    Muradoglu, Saliha
    Sang, Lan
    Short, Tyler
    Shreevastava, Sagarika
    Spaulding, Elizabeth
    Umada, Tetsumichi
    Xiang, Beilei
    Yang, Changbing
    Hulden, Mans
    17TH SIGMORPHON WORKSHOP ON COMPUTATIONAL RESEARCH IN PHONETICS PHONOLOGY, AND MORPHOLOGY (SIGMORPHON 2020), 2020, : 162 - 170
  • [30] State assignment of finite-state machines
    Ahmad, I
    Dhodhi, MK
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2000, 147 (01): : 15 - 22