using Query Representation M.Sandhya M.Tech.(SWE),Dept.of CSE

The searching of data Process end users search their data needs using query representation, by using this way of retrieving data may not meet their expectations. To achieve end users goal, developers implement several techniques. Previously end users follow greedy algorithm with IQp [1]. But in this paper we will work forward with n-gram Language model. In this approach, end user selects the searchable keyword with the length of minimum n+1 data units. With n data units users failed to retrieve their expectations. This approach includes Probabilistic algorithms used for large vocabulary word correction system with language model. This paper explains data search using n gram data model [5], web server and allows users to interact via browser front end. We outline the challenges and discuss the implementation of our system including results of extensive experimental evaluation. Keywords: N-Gram, Spell Checker, Search Engine, Query construction