• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on String Processing and Information Retrieval(SPIRE 2004); 20041005-08; Padova(IT) >On Classification of Strings
【24h】

On Classification of Strings

机译：论弦的分类

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In document filtering and content-based routing the aim is to transmit to the user only those documents that match the user's interests or profile. As filtering systems are deployed on the Internet, the number of users can become large. In this paper we focus on the question of how a large set of user profiles can be quickly searched in order to find those that are relevant to the document. In the abstract setting we assume that each profile is given as a regular expression, and, given a set of regular languages (the set of profiles), we want to determine for a given input string (the document) all those languages the input string belongs to. We analyze this problem, called the classification problem for a set of regular languages, and we show that in various important cases the problem can be solved by a small single deterministic finite automaton extended by conditional transitions.
机译：在文档过滤和基于内容的路由中，目标是仅将与用户兴趣或个人资料匹配的那些文档传输给用户。随着过滤系统部署在Internet上，用户数量可能会增加。在本文中，我们关注的问题是如何快速搜索大量用户配置文件以查找与文档相关的用户配置文件。在抽象设置中，我们假设每个配置文件均以正则表达式给出，并且在给定一组常规语言（配置文件集）的情况下，我们想为给定的输入字符串（文档）确定所有这些语言的输入字符串属于。我们分析了这个问题，称其为一组常规语言的分类问题，并且我们证明了在各种重要情况下，可以通过一个由条件转换扩展的小的单个确定性有限自动机来解决该问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号