Unsupervised and knowledge-free learning of compound splits and periphrases

被引:0
|
作者
Holz, Florian [1 ]
Biemann, Chris [1 ]
机构
[1] Univ Leipzig, Dept Comp Sci, NLP Grp, Leipzig, Germany
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present art approach for knowledge-free and unsupervised recognition of compound nouns for languages that use one-word-compounds such as Germanic and Scandinavian languages. Our approach works by creating a candidate list of compound splits based on the word list of a, large corpus. Then, we filter this list using the following criteria: (a) frequencies of compounds and parts, (b) length of parts. In a second step, we search the corpus for periphrases, that is a reformulation of the (single-word) compound using the parts and very high frequency words (which are usually prepositions or determiners). This step excludes spurious candidate splits at cost of recall. To increase recall again, we train a trie-based classifier that also allows splitting multipart-compounds iteratively. We evaluate our method for both steps and with various parameter settings for German against a manually created gold standard, showing promising results above 80% precision for the splits and about half of the compounds periphrased correctly. Our method is language independent to a large extent, since we use neither knowledge about the language nor other language-dependent preprocessing tools. For compounding languages, this method can drastically alleviate the lexicon acquisition bottleneck, since even rare or yet unseen compounds can now be periphrased: the analysis then only needs to have the parts described in the lexicon, not the compound itself.
引用
收藏
页码:117 / 127
页数:11
相关论文
共 50 条
  • [1] Unsupervised and Knowledge-Free Morpheme Segmentation and Analysis
    Bordag, Stefan
    [J]. ADVANCES IN MULTILINGUAL AND MULTIMODAL INFORMATION RETRIEVAL, 2008, 5152 : 881 - 891
  • [2] A Simple Unsupervised Knowledge-Free Domain Adaptation for Speaker Recognition
    Lin, Wan
    Li, Lantian
    Wang, Dong
    [J]. APPLIED SCIENCES-BASEL, 2024, 14 (03):
  • [3] A knowledge-free path planning approach for smart ships based on reinforcement learning
    Chen, Chen
    Chen, Xian-Qiao
    Ma, Feng
    Zeng, Xiao-Jun
    Wang, Jin
    [J]. OCEAN ENGINEERING, 2019, 189
  • [4] Coevolutionary CMA-ES for Knowledge-Free Learning of Game Position Evaluation
    Jaskowski, Wojciech
    Szubert, Marcin
    [J]. IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2016, 8 (04) : 389 - 401
  • [5] Knowledge-free induction of inflectional moyphologies
    Schone, P
    Jurafsky, D
    [J]. 2ND MEETING OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE, 2001, : 183 - 191
  • [6] Fast and Knowledge-Free Deep Learning for General Game Playing (Student Abstract)
    Maras, Michal
    Kepa, Michal
    Kowalski, Jakub
    Szykula, Marek
    [J]. THIRTY-EIGTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 21, 2024, : 23576 - 23578
  • [7] Elicitability and Knowledge-Free Elicitation with Peer Prediction
    Zhang, Peter
    Chen, Yiling
    [J]. AAMAS'14: PROCEEDINGS OF THE 2014 INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS & MULTIAGENT SYSTEMS, 2014, : 245 - 252
  • [8] A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration
    Valenzano, Richard
    Sturtevant, Nathan R.
    Schaeffer, Jonathan
    Xie, Fan
    [J]. TWENTY-FOURTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING, 2014, : 375 - 379
  • [9] Knowledge-Free Discovery of Domain-Specific Multiword Units
    Ngomo, Axel-Cyrille Ngonga
    [J]. APPLIED COMPUTING 2008, VOLS 1-3, 2008, : 1561 - 1565
  • [10] A priori knowledge-free fast positioning approach for BeiDou receivers
    Zhao, Sihao
    Cui, Xiaowei
    Lu, Mingquan
    [J]. GPS SOLUTIONS, 2017, 21 (02) : 715 - 725