Partially Improved Subsequence Discovery Algorithm for Sequence Matching
A. D. Pathak1, S. J. Karale2
1Abhishek.D.Pathak, Computer science & engineering, Nagpur/YCCE/ MGI, Nagpur, India.
2S.J. Karale, Asst professor, Computer Technology, Nagpur/YCCE/ MGI, Nagpur, India.
Manuscript received on May 11, 2013. | Revised Manuscript received on May 15, 2013. | Manuscript published on May 25, 2013. | PP: 59-61 | Volume-1 Issue-7, May 2013. | Retrieval Number: G0321051713/2013©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This article describes an Improved technique for the sub sequence discovery algorithm used for natural language processing in question answering system for matching user text input in natural language processing against an existing knowledge base, consisting of semantically described words or phrases. Most common methods & techniques of natural language processing are overviewed and their main problems are outlined. A sequence matching with subsequence analysis algorithm is analyzed and improvements are done which deals with the problems of exact matching,change in custom spelling errors as well as the improvement in the performance metric of the similarity matching.Popular approaches that solve this problem include stemming, lemmatization and various distance functions,sequence matching techniques are analysed to get the better possible technique for solving the problems with higher accuracy. Then the major components of the similarity measure are defined and the computation of concurrence and dispersion measure is presented. Results of the algorithms performance on a test set are then analysed.
Keywords: About four key words or phrases in alphabetical order, separated by commas.