A survey of comparative analysis of sequence matching algorithms

Author

Pathak, A.D. ; Karale, S.J.

Author_Institution

Dept. of Comput. Technol., YCCE, Nagpur, India

fYear

2013

fDate

26-28 July 2013

Firstpage

1

Lastpage

4

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.

Keywords

natural language processing; text analysis; word processing; comparative analysis; knowledge base; matching text input string; sequence matching algorithms; subsequence analysis; subsequence discovery algorithm; text form; user input; Algorithm design and analysis; Approximation algorithms; Computers; Data mining; Knowledge based systems; Knowledge discovery; Measurement; sequence matching; similarity measure; subsequence analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Bhopal

ISSN

2151-7681

Print_ISBN

978-1-4673-5997-9

Type

conf

DOI

10.1109/WOCN.2013.6616240

Filename

6616240