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