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 条
  • [41] Rough finite-state automata
    Basu, S
    CYBERNETICS AND SYSTEMS, 2005, 36 (02) : 107 - 124
  • [42] Periodic finite-state machines
    Kopetz, H.
    El-Salloum, C.
    Huber, B.
    Obermaisser, R.
    10TH IEEE INTERNATIONAL SYMPOSIUM ON OBJECT AND COMPONENT-ORIENTED REAL-TIME DISTRIBUTED COMPUTING, PROCEEDINGS, 2007, : 10 - +
  • [43] A method for the inference of non-recursive finite-state grammars
    Chirathamjaree, C
    ICAI '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 AND 2, 2005, : 266 - 272
  • [44] Finite-State Text Processing
    Maurel, Denis
    TRAITEMENT AUTOMATIQUE DES LANGUES, 2021, 62 (02): : 39 - 41
  • [45] Translation with finite-state devices
    Knight, K
    Al-Onaizan, Y
    MACHINE TRANSLATION AND THE INFORMATION SOUP, 1998, 1529 : 421 - 437
  • [46] ON COMMUNICATING FINITE-STATE MACHINES
    BRAND, D
    ZAFIROPULO, P
    JOURNAL OF THE ACM, 1983, 30 (02) : 323 - 342
  • [47] Finite-state language processing
    Cáccamo, MJ
    Kowaltowski, T
    COMPUTATIONAL LINGUISTICS, 1998, 24 (04) : 641 - 648
  • [48] Recursive prosody is not finite-state
    Dolatian, Hossep
    De Santo, Aniello
    Graf, Thomas
    SIGMORPHON 2021: 18TH SIGMORPHON WORKSHOP ON COMPUTATIONAL RESEARCH IN PHONETICS, PHONOLOGY, AND MORPHOLOGY, 2021, : 11 - 22
  • [49] Finite-State Input Shaping
    Sorensen, Khalid L.
    Hekman, Keith
    Singhose, William E.
    IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, 2010, 18 (03) : 664 - 672
  • [50] Robots and finite-state machines
    Carter, EF
    DR DOBBS JOURNAL, 1997, 22 (02): : 50 - +