ADT接近和文本接近问题

6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268) Pub Date : 1999-09-21 DOI:10.1109/SPIRE.1999.796574

Ricardo Baeza-Yates, W. Cunto

{"title":"ADT接近和文本接近问题","authors":"Ricardo Baeza-Yates, W. Cunto","doi":"10.1109/SPIRE.1999.796574","DOIUrl":null,"url":null,"abstract":"Practical text proximity problems lead to the abstract data type proximity that handles close points in the plane. Different variants and implementations of proximity are proposed and tight-complexity bounds based on information theory are derived. This problem is related to evaluating Boolean queries in large text retrieval (as in Web search engines) and to the \"Sorting X+Y\" problem.","PeriodicalId":131279,"journal":{"name":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"The ADT proximity and text proximity problems\",\"authors\":\"Ricardo Baeza-Yates, W. Cunto\",\"doi\":\"10.1109/SPIRE.1999.796574\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Practical text proximity problems lead to the abstract data type proximity that handles close points in the plane. Different variants and implementations of proximity are proposed and tight-complexity bounds based on information theory are derived. This problem is related to evaluating Boolean queries in large text retrieval (as in Web search engines) and to the \\\"Sorting X+Y\\\" problem.\",\"PeriodicalId\":131279,\"journal\":{\"name\":\"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)\",\"volume\":\"62 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPIRE.1999.796574\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPIRE.1999.796574","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

实际的文本接近问题导致处理平面中接近点的抽象数据类型接近。提出了接近度的不同变体和实现方法，并基于信息论导出了紧密复杂度边界。这个问题与在大型文本检索(如Web搜索引擎)中评估布尔查询以及“排序X+Y”问题有关。

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

查看原文本刊更多论文

The ADT proximity and text proximity problems

Practical text proximity problems lead to the abstract data type proximity that handles close points in the plane. Different variants and implementations of proximity are proposed and tight-complexity bounds based on information theory are derived. This problem is related to evaluating Boolean queries in large text retrieval (as in Web search engines) and to the "Sorting X+Y" problem.

求助全文

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

来源期刊

6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268)

自引率

0.00%

发文量