Critique on Cache Transition Techniques for Semantic Graph Parsing for optimizing Search Process using Text Mining
Sajini G1, Jagadish S Kallimani2
1Sajini G, Research Scholar, Department of Computer Science and Engineering, M S Ramaiah Institute of Technology, Bangalore (Karnataka), India.
2Jagadish S Kallimani, Associate Professor, Department of Computer Science and Engineering, M S Ramaiah Institute of Technology, Bangalore (Karnataka), India.
Manuscript received on 22 July 2019 | Revised Manuscript received on 03 August 2019 | Manuscript Published on 10 August 2019 | PP: 1014-1018 | Volume-8 Issue-2S3 July 2019 | Retrieval Number: B11900782S319/2019©BEIESP | DOI: 10.35940/ijrte.B1190.0782S319
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. 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 paper elaborates the transition system that gives the standard transition-based dependency parsing techniques for generating the graph. It is essential to know the standard transition techniques for all graphical problems. Cache transition technique plays a vital role in optimizing the search process in various text mining applications. This paper provides an overview on cache transition technique for parsing semantic graphs for several Natural Language Processing (NLP) applications. According to this paper, the cache is having the fixed size m, by tree decomposition theory according to which there is a relationship between the parameter m and class of graphs produced by the theory.
Keywords: Cache Transition Technique, Semantic Graphs, Text Mining, Tree Width, Optimized Search Procedures.
Scope of the Article: Text Mining