如何在wordnet类型字典的大型封闭子集中创建顺序

Q2 Arts and Humanities

Eesti Rakenduslingvistika Uhingu Aastaraamat Pub Date : 2013-01-01 DOI:10.5128/ERYA9.10

Ahti Lohk, Ottokar Tilk, L. Võhandu

{"title":"如何在wordnet类型字典的大型封闭子集中创建顺序","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":"{\"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}","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

摘要

本文提出了一种新的两步方法来处理和研究wordnet类型字典的大型封闭子集，目的是发现可能的结构不一致。使用WordNet树来解释闭子集的概念。描述了一种新的快速排序大型关系系统的方法，并与其他快速排序方法进行了比较。所有提出的方法都使用Estonian1和Princeton WordNet2最大闭集进行了测试。DOI: http://dx.doi.org/10.5128/ERYa9.10

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Eesti Rakenduslingvistika Uhingu Aastaraamat Arts and Humanities-Language and Linguistics

CiteScore

0.90

自引率

0.00%

发文量

审稿时长

28 weeks