the invention is described more fully hereinafter with reference to the accompanying drawings , in which exemplary embodiments of the invention are shown . this invention may , however , be embodied in many different forms and should not be construed as limited to embodiments set forth herein . fig1 describes a method of acquiring tags during web search according to an exemplary embodiment of the present invention . referring to fig1 , in block 100 , a user enters a search query in a window of a search engine . for example , a user can enter the phrase “ white house washington ” in a search engine . in block 200 , the search engine processes the query and returns a list of candidate resources . the candidate resources can be listed under resource names such as , for example , their uniform resource locators ( urls ). in block 300 , a user selects one of the candidate resources . if the user does not select any resource , no tagging occurs . in block 400 , tags are extracted from the query . for example , search terms contained in the user query , e . g ., “ white house ” and “ washington ” can be the tags . the search terms contained in the user query undergo filtering before the search terms become candidate tags because , for example , the keywords deemed appropriate for one person might not make sense for another person . different types of filters can be used for the filtering . examples of the filters include a filter eliminating short articles and reducing words to syntactic base forms ( e . g ., plural to singular ), a filter accepting only terms contained in a language dictionary or ontology , a filter considering only most frequently occurring terms ( e . g ., cutting off tails ), a filter clustering diverging concrete terms into smaller number of more abstract and uniform terms , and a filter accepting only terms showing up in same queries by multiple different users . in block 500 , tagging the selected resource with tags occurs . for example , a piece of content such as a picture or an article of the white house in washington found in the whitehouse website is tagged with tags “ white house ” and “ washington ”. there exist several technologies to maintain the link between the piece of content in the whitehouse website and the tags “ white house ” and “ washington ”. for example , a metadata server or xml / rdf representation can be used . search terms provided by a user ( e . g ., “ white house washington ”) can be candidate descriptive tags , and the confirmation of an offered search result by the user ( e . g ., picture of the white house in washington ) can be interpreted as an acknowledgement that the description applies to this selected resource . fig2 describes a method of acquiring tags during web search and improving web search according to an exemplary embodiment of the present invention . referring to fig2 , in block 1000 , a user enters a search query in a search engine . for example , a user can enter “ white house washington ” in the search engine . in block 2000 , the search engine processes the query and returns a list of candidate resources . the candidate resources can be listed under resource names such as , for example , their uniform resource locators ( urls ). in block 3000 with reference to fig2 and 3 , a tag cloud is generated for each candidate resource . the tag cloud can be a graphical view where eligible tags are depicted inside , for example , a rectangular frame in which the font size of each tag is proportional to the frequency of occurrence ( e . g ., hit count ). eligible tags with respect to a candidate resource are those that previously led to the selection of this candidate resource following a web search whose query was referring to this tag . for example , “ washington ” can be an eligible tag for the white house website . the tag cloud can appear near a corresponding candidate resource . in an exemplary embodiment , the tag cloud shown in fig3 can appear near the url of the whitehouse website shown after a search is completed by the search engine . if the available space for the tag cloud is too confined , least used tags do not show up in the tag cloud . for example , in fig3 , the least used tag “ elected ”, because “ elected ” has the smallest font , can be omitted . in block 4000 , candidate resources are sorted , for example , in descending order , using an index that is obtained for each candidate resource . in an exemplary embodiment , the index can be formed by adding the frequencies of occurrence ( e . g ., hit counts ) for all eligible tags with respect to the corresponding resource . in block 5000 , a user selects a candidate resource . if the user does not select any resource , no tagging occurs . in block 6000 , tags are extracted from the query . for example , search terms contained in the user query , i . e ., “ white house ” and “ washington ” can be the tags . the search terms contained in the user query undergo filtering before the search terms become candidate tags . filtering that turns the search terms into candidate tags is applied to account for , for example , typing mistakes , syntactic variations , and phrases ( e . g ., “ white house ” recognized as a single unit ). individual erroneous tags can be tolerated when a sufficient ( e . g ., greater than about 50 %) number of other users provide the corrected tags in turn . different types of filters can be used for the filtering . examples of the filters include a filter eliminating short articles and reducing words to syntactic base forms ( e . g ., plural to singular ), a filter accepting only terms contained in a language dictionary or ontology , a filter considering only most frequently occurring terms ( i . e ., cutting off tails ), a filter clustering diverging concrete terms into smaller number of more abstract and uniform terms , and a filter accepting only terms showing up in same queries by multiple different users . in block 7000 , hit counts for the selected resource and corresponding eligible tags are increased . the frequency of occurrence for each eligible tag with respect to a candidate resource is maintained by increasing a corresponding counter by one . there can be separate counters for each observed tuple ( e . g ., resource name and tag ). for example , the urls can serve as resource names . in block 8000 , tagging the selected resource with tags occurs . for example , a piece of content in the whitehouse website is tagged with tags “ white house ” and “ washington ”. there exist several technologies to maintain the link between the piece of content in the whitehouse website and the tags “ white house ” and “ washington ”. for example , a metadata server or xml / rdf representation can be used . fig3 shows a tag cloud according to an exemplary embodiment of the present invention . referring to fig2 and 3 , in an exemplary embodiment of the present invention , blocks 3000 , 4000 and 7000 can be used as a method of using obtained tags for an improved web search service . for example , in block 3000 , the search results are displayed as an annotated list of matching candidates . instead of rendering each item only as an excerpt of the verbatim resource as in a conventional web search , the improved search service according to an exemplary embodiment of the present invention can display a tag cloud as an abstract summary of the document content . for example , in fig3 , the tag cloud itself can be an abstract summary of the document content . in block 4000 , the relative frequency of a tag can be interpreted as an indication as to how often a particular document returned by a search query was opened by the query author . the relative frequency can be used as a quality measure of the returned links . sorting the links according to the relative frequency of the tags associated to them may give priority to those links that most users found appropriate for the original query . fig4 shows a system having an internet server and a computer connected to the internet server . referring to fig4 , a computer 20 is connected to an internet server 10 . the computer includes a processor such as a cpu , a memory such as a ram or rom , an input 30 and an output 40 . the processor executes instructions to perform a method of acquiring tags using web search in cooperation with the internet server . as such a non - transitory computer readable medium embodying instructions executable by the processor may perform a method of acquiring tags using web search . for example , a search query is entered into the computer 20 through the input 30 by a user . then , a search engine run by the internet server 10 receives the search query from the computer 20 . the search query is processed by the search engine and a list of candidate resources corresponding to the search query are returned and displayed on the output 40 . the output 40 includes , for example , a display screen . exemplary embodiments of the present invention use web searches to create and sort tags . that is , a link between searching and tagging can be exploited . unlike conventional technologies that support tagging for special purposes , exemplary embodiments of the present invention make the otherwise costly process of tagging a free side effect from typical web searches . users perceive no noticeable difference as far as core search functionality and quality are concerned . thus , no extra cost for tagging is incurred on the users . accordingly , an exemplary embodiment of the present invention can make use of the human judgment that goes into both formulating a search query as well as into later narrowing the search by picking one matching document among several offered candidates . according to an exemplary embodiment of the present invention , an existing search engine can be used to build an automatic tagging system . this can be achieved after a search engine receives a query from a human user and after the user selects one of the candidate documents that the search engine identifies as matching the user query . as such , the automatic tagging service can be implemented as a new service that wraps a search engine ( e . g ., google ™ web search ) without changing outside appearance or degrading search performance . according to an exemplary embodiment of the present invention , obtained tags can be used for an improved web search service . the search result can be displayed as an annotated list of matching candidates . in addition , the relative frequency of the tags can be interpreted as an indication as to how often a particular document returned by a search query was opened by the query author . the relative frequency can be used as a quality measure of the returned links . sorting the links according to the relative frequency of the tags associated to them may give priority to those links that most users found appropriate for the original query . although exemplary embodiments of the present invention have been described herein with reference to the accompanying drawings , it is to be understood that the present invention should not be limited thereto and that various other changes and modifications may be affected therein by one of ordinary skill in the related art without departing from the scope or spirit of the invention . all such changes and modifications are intended to be included within the scope of the invention .