“The search systems became the Second Great Wonder of the new age, providing the Homo Sapiens with unlimited and instant access to information. The First Great Wonder is probably the Internet itself – with its global communication abilities.” 
-Ilya Segalovich, Yandex
 

Google hack: search explorer



The Information Paradox
The Internet is a huge pool of information – almost all information is available, but it is extremely difficult to find.  Probably every Internet user has faced the paradox of the Internet – the amount of useful information on the Internet increases by the second, and as the amount increases, it becomes harder and harder to find the specific information you need.

The main problem occurs at the stage of constructing the search query. This is not an easy task as it requires a perfect knowledge of the terminology used in the area of your interest, and more often than not, an understanding of Boolean expressions.  Another problem occurs when a word may be used in multiple ways, such as a verb and noun, and might have a synonymous meaning.  Another issue a searcher may face is mistyping of search phrases.

We at Newisearch see the solution to this problem in terms of search engines evolution:

The data search
By displaying the resulting data in an easier to understand way, a user is much more able to find relevant results. Of course, 100% accuracy is possible only if a user knows that the information he/she is searching for exists, and knows its format.  In all other cases there will be a difference between the user’s expectations and the search results.  Newisearch’s aim is to split the information found after the first search into categorized directions to give the user a choice in which direction to take the search. This can be done either by providing the user with the names of these directions, or with keywords which are related to the theme of the search so that it may be further narrowed.

The knowledge search
Incorporates the ability to use a question, not keyword (s) as a search query. The aim of the system is to produce a correct answer to a user’s question, such as “How to get to….”, “Where is…”, “Where to buy…” and so on.

These kind of search systems are based on Artificial Intelligence (AI), and by including the data search capabilities, it could produce the correct result every time. The backbone of such system is a self-learning, knowledge-base driven system which can generate queries to search the database.

The current live version of the Newisearch Project represents an engine of type 1, however we are currently in the process of creating a type 2 engine, using AI technology.

The Google hack: search explorer
The Google hack: search explorer is a modification of the standard Google user interface. It provides an effective search query management system, and is gives you more options than plain Google.

The main idea behind this project is to provide users with the options of fast and convenient search query management. During your search it adds a list of related keywords to the standard Google search result pages, and gives you an option to include or exclude any of these keywords to/from your original search query without performing another search.

The keywords list is split in a number of sets called clusters. You could include or exclude a whole cluster from your search query with one click.

Unlike some other projects, the clusters here are produced in real time using your search query data, not some preset word lists.

Please note that: Newisearch is not affiliated with Google.  The Newisearch Modification of Google’s interface does not change anything within the Google results (including the Google sponsored results), as we highly respect Google and would not like to cause any harm to it.

The Google hack: search explorer is a non-profit educational project with the aim of building an ideal Search Engine User Interface. 

This is the very beginning of The Google hack: search explorer, so we would be glad to receive your feedback on the usability of our work. Please feel free to contact us.