Abstract: A system, method, and computer program product are provided for segmenting a content stream. In use, a content stream associated with an event is identified. Additionally, user generated content associated with the content stream is identified. Further, a timing of one or more key events within the content stream is determined, based on the user generated content. Further still, the one or more key events are identified, based on the user generated content. Also, the content stream is segmented, utilizing the one or more key events and the timing of the one or more key events. In addition, a subset of the user generated content and a subset of the one or more key events is associated with a segment of the content stream. Furthermore, a search index associated with the segment of the content stream is generated, utilizing the subset of the user generated content and the subset of the one or more key events. Further still, a search query is received from a user.

Abstract: A system, method, and computer program product are provided for determining information associated with an extracted portion of content. In use, a user is identified. Additionally, content generated by the user is identified. Additionally, a portion of the content is extracted. Further, information associated with the extracted portion of the content is determined. Further still, the determined information is added to a profile of the user. Also, an action is initiated, based on the profile of the user.

Abstract: A meta search engine receives a query from a user, and submits adapted queries to n search engines. The results are adapted and combined to provide a result set R?. In parallel, the meta search engine accesses a selected hit matrix populated with values for correspondence of queries q1-qm with web pages pi-pn. These values are the number of “hits” for pervious searches. The pages retrieved from a row for qT are combined with the search engine results to provide a final result but which is ranked according to previous search experience. The hit matrix may be dynamically selected according to a user community. The query need not exactly match a hit matrix query as rows can be selected according to similarity to the current query qT with weightings applied.

Abstract: A meta search engine (1) receives a query (qT) from a user (U), and submits adapted queries (q1-qn) to n search engines (S1-Sn). The results (R1-Rn) are adapted (R1?-Rn?) and combined to provide a result set R?. In parallel, the meta search engine (1) accesses a selected hit matrix (H) populated with values for correspondence of queries q1-qm with web pages pi-pn. These values are the number of “hits” for pervious searches. The pages (R?) retrieved from a row for qT are combined with the search engine (S1-Sn) results to provide a final result but which is ranked according to previous search experience. The hit matrix may be dynamically selected according to a user community. The query (qT) need not exactly match a hit matrix query (q1-qn) as rows can be selected according to similarity to the current query qT with weightings applied.