序列匹配算法的比较分析综述

2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN) Pub Date : 2013-07-26 DOI:10.1109/WOCN.2013.6616240

A. Pathak, S. Karale

{"title":"序列匹配算法的比较分析综述","authors":"A. Pathak, S. Karale","doi":"10.1109/WOCN.2013.6616240","DOIUrl":null,"url":null,"abstract":"In this article we describe the comparative analysis of sequence matching with subsequence analysis for matching the user input in text form against the existing knowledge base. The most common methods for matching text input string are overviewed and analyzed. The subsequence discovery algorithm is implemented and its performance is analyzed on to collection of phrases. The results of the algorithm is analyzed., their problems are outlined for improving the performance metric & some enhancement is suggested for increasing the applicability of the subsequence discovery algorithm.","PeriodicalId":388309,"journal":{"name":"2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A survey of comparative analysis of sequence matching algorithms\",\"authors\":\"A. Pathak, S. Karale\",\"doi\":\"10.1109/WOCN.2013.6616240\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article we describe the comparative analysis of sequence matching with subsequence analysis for matching the user input in text form against the existing knowledge base. The most common methods for matching text input string are overviewed and analyzed. The subsequence discovery algorithm is implemented and its performance is analyzed on to collection of phrases. The results of the algorithm is analyzed., their problems are outlined for improving the performance metric & some enhancement is suggested for increasing the applicability of the subsequence discovery algorithm.\",\"PeriodicalId\":388309,\"journal\":{\"name\":\"2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN)\",\"volume\":\"109 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCN.2013.6616240\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2013.6616240","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在本文中，我们描述了序列匹配与子序列分析的比较分析，用于将文本形式的用户输入与现有知识库进行匹配。本文概述和分析了最常用的文本输入字符串匹配方法。实现了子序列发现算法，并对其在短语集合上的性能进行了分析。对算法的结果进行了分析。指出了它们存在的问题，并提出了一些改进措施，以提高子序列发现算法的适用性。

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

查看原文本刊更多论文

A survey of comparative analysis of sequence matching algorithms

In this article we describe the comparative analysis of sequence matching with subsequence analysis for matching the user input in text form against the existing knowledge base. The most common methods for matching text input string are overviewed and analyzed. The subsequence discovery algorithm is implemented and its performance is analyzed on to collection of phrases. The results of the algorithm is analyzed., their problems are outlined for improving the performance metric & some enhancement is suggested for increasing the applicability of the subsequence discovery algorithm.

求助全文

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

来源期刊

2013 Tenth International Conference on Wireless and Optical Communications Networks (WOCN)

自引率

0.00%

发文量