{'fraction_non_alphanumeric': 0.018060200668896322, 'fraction_numerical': 0.0, 'mean_word_length': 4.984, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
State of the art process in query processing ranking system

The World Wide Web (WWW) has become a part of today's human lives. But searching information has become one of the most important aspects. Various search engines like Google, Bing, Yahoo, etc are used to seek information about a topic. Search engines return ranked lists of Web pages in response to queries. However, the performance of these web search engine has increased dramatically. Moreover, for many scenarios a user who has queried a search engine has led to inaccurate results for a particular query. Web users mostly use the services of search engines to fetch information they want to surf. In spite users spend too much time and energy in seeking useful data, improving the retrieval efficiency to meet the users' personalized need becomes critical in text processing domain. The relevance of the search results provided by the search engines are based on different kinds of algorithms used by these search engines. It also becomes tedious and difficult task for search engines to rank search results which satisfy the user's search intention clearly. A variety of ranking algorithms have been proposed and used in many Web search engines. However, these search engines cannot always return good ranked search results which satisfy users' search intentions adequately. This work addresses few novel algorithms suitable for efficient web retrieval process thereby improving the accuracy & precision of searching mechanisms.