HOW TO CREATE ORDER IN LARGE CLOSED SUBSETS OF WORDNET-TYPE DICTIONARIES

Q2 Arts and Humanities
Ahti Lohk, Ottokar Tilk, L. Võhandu
{"title":"HOW TO CREATE ORDER IN LARGE CLOSED SUBSETS OF WORDNET-TYPE DICTIONARIES","authors":"Ahti Lohk, Ottokar Tilk, L. Võhandu","doi":"10.5128/ERYA9.10","DOIUrl":null,"url":null,"abstract":"This article presents a new two-step method to handle and study large closed subsets of WordNet-type dictionaries with the goal of finding possible structural inconsistencies. The notion of closed subset is explained using a WordNet tree. A novel and very fast method to order large relational systems is described and compared with some other fast methods. All the presented methods have been tested using Estonian1 and Princeton WordNet2 largest closed sets. DOI: http://dx.doi.org/10.5128/ERYa9.10","PeriodicalId":35118,"journal":{"name":"Eesti Rakenduslingvistika Uhingu Aastaraamat","volume":"94 1","pages":"149-160"},"PeriodicalIF":0.0000,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eesti Rakenduslingvistika Uhingu Aastaraamat","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5128/ERYA9.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Arts and Humanities","Score":null,"Total":0}
引用次数: 5

Abstract

This article presents a new two-step method to handle and study large closed subsets of WordNet-type dictionaries with the goal of finding possible structural inconsistencies. The notion of closed subset is explained using a WordNet tree. A novel and very fast method to order large relational systems is described and compared with some other fast methods. All the presented methods have been tested using Estonian1 and Princeton WordNet2 largest closed sets. DOI: http://dx.doi.org/10.5128/ERYa9.10
如何在wordnet类型字典的大型封闭子集中创建顺序
本文提出了一种新的两步方法来处理和研究wordnet类型字典的大型封闭子集,目的是发现可能的结构不一致。使用WordNet树来解释闭子集的概念。描述了一种新的快速排序大型关系系统的方法,并与其他快速排序方法进行了比较。所有提出的方法都使用Estonian1和Princeton WordNet2最大闭集进行了测试。DOI: http://dx.doi.org/10.5128/ERYa9.10
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Eesti Rakenduslingvistika Uhingu Aastaraamat
Eesti Rakenduslingvistika Uhingu Aastaraamat Arts and Humanities-Language and Linguistics
CiteScore
0.90
自引率
0.00%
发文量
19
审稿时长
28 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信