973 results about "Keyword search" patented technology

A method for presenting to an end-user the intermediate matching search results of a keyword search in an index list of information. The method comprising the steps of: coupling to a search engine a graphical user interface for accepting keyword search terms for searching the indexed list of information with the search engine; receiving one or more keyword search terms with one or more separation characters separating there between; performing a keyword search with the one or more keyword search terms received when a separation character is received; and presenting the number of documents matching the keyword search terms to the end-user presenting a graphical menu item on a display. A system and method of metadata search ranking is disclosed. The present invention utilizes a combination of popularity and/or relevancy to determine a search ranking for a given search result association.

The present disclosure provides a computer-implemented method/system for facilitating communications between service providers and potential customers for services. The computer-implemented method/system provides a marketplace for interactions, both online and off-line, between service providers and potential customers, including purchasing groups, particularly buyer-driven service-related interactions. The marketplace advantageously allows categorization, key word searching, group purchasing, service packaging, data mining, auctions and other commercial features and functionality. The computer-implemented method/system also supports holographic imagery, e.g., in the form of virtual assistants, that facilitates marketplace-related activities. Based on the computer-implemented method/system, service providers are able to efficiently and cost effectively extend the reach of their marketing and promotional activities to a wide range of additional customers, and customers are able to initiate access service providers ideally suited to meet their needs, i.e., buyer-driven commerce, at desirable prices and according to required timeframes.

A computer, terminal and a method for blocking the use and creating of vulgar and pornographic material in a responsive and interactive matter that comprehensively monitors computer operations for creation or transmission of vulgar and pornographic material. Data created by the keyboard, data passing through the clipboard, data selected by the mouse pointer, and data passing through the Internet interface are monitored for content and further operation of the computer terminal is blocked. The computer terminal may only be unblocked by a supervisory intervention, such as by entering of a password, or by restarting or resetting the terminal. Key word searches, such as those in Internet search engines, are also monitored, but the terminal adapts to monitor not only for words of a profane and vulgar nature, but also for words that are behaviorally tested to produce lists containing vulgar and profane items, e.g., Internet sites. The computer terminal and method can be modified to block other forms of communication or computer operation, such as blocking transmission of secret business data, blocking execution or opening of certain programs or files, and the like.

A method for presenting to an end-user the intermediate matching search results of a keyword search in an index list of information. The method comprising the steps of: coupling to a search engine a graphical user interface for accepting keyword search terms for searching the indexed list of information with the search engine; receiving one or more keyword search terms with one or more separation characters separating there between; performing a keyword search with the one or more keyword search terms received when a separation character is received; and presenting the number of documents matching the keyword search terms to the end-user, and presenting a graphical menu item on a display. In accordance with another embodiment of the present invention, an information processing system and computer readable storage medium carries out the above method.

A method and system for electronic classified advertising, including in a sophisticated edition, a seven-step installation wizard, portability to web servers, scalability, an intuitive and easy to use layout, customization features, fee-based options and features, ad display options and features, selected expiration of ads with optional notification, user set-up personal search agent which will automatically notify the user with new ads matching the database search criteria specified by the user, private messaging, a search engine for seven types of searches including browsing, keyword searches, retrieval of a specific ad by its database ID number, retrieval of all of a specific user's ads, retrieval of one specific ad for modification, and full database power searches, user registration, additional user posting and searching options, E-mail, Antispamming, detailed administrative controls, and security. Also available are banner ad modules, affiliate web sites, and internationalization features.

A method and system for facilitating a keyword search request initiated at a client station within a multilevel data network, wherein the multilevel data network includes multiple local sites each containing multiple data pages. Multiple keywords from each of the data pages within the local sites of the multilevel data network are stored locally and indexed such that each of the keywords points to one or more of the data pages in which the keywords are contained. The keywords and their index associations are locally updated. A central database is utilized to compile and index the locally indexed keywords from each of the local sites, such that each of the keywords in the central database points to one or more local sites from which those keywords came in response to a keyword search initiated at the client station.

The invention is a method for textual searching of text-based databases including databases of compiled internet content, scientific literature, abstracts for books and articles, newspapers, journals, and the like. Specifically, the algorithm supports searches using full-text or webpage as query and keyword searches allowing multiple entries and an information-content based ranking system (Shannon Information score) that uses p-values to represent the likelihood that a hit is due to random matches. Additionally, users can specify the parameters that determine hits and their ranking with scoring based on phrase matches and sentence similarities.

A method of automatically labeling of unlabeled text data can be practiced independent of human intervention, but that does not preclude manual intervention. The method can be used to extract relevant features of unlabeled text data for a keyword search. The method of automated labeling of unlabeled text data uses a document collection as a reference answer set. Members of the answer set are converted to vectors representing centroids of unknown groups of unlabeled text data. Unlabeled text data are clustered relative to the centroids by a nearest neighbor algorithm and the ID of the relevant answer is assigned to all documents in the cluster. At this point in the process, a supervised machine learning algorithm is trained on labeled data, and a classifier for assigning labels to new text data is output. Alternatively, a feature extraction algorithm may be run on classes generated by the step of clustering, and search features output which index the unlabeled text data.

Aspects discussed herein present a solution for utilizing large-scale knowledge graphs for inference at scale and generating explanations for the conclusions. In some embodiments, aspects discussed herein learn inference paths from a knowledge graph and determine a confidence score for each inference path. Aspects discussed herein may apply the inference paths to the knowledge graph to improve database lookup, keyword searches, inferences, etc. Aspects discussed herein may generate a natural language explanation for each conclusion or result from one or more inference paths that led to that conclusion or result. Aspects discussed herein may present the best conclusions or results to the user based on selection strategies. The presented results or conclusions may include generated natural language explanations rather than links to documents with word occurrences highlighted.

Methods to adapt a user interface view, provided by an integrated media/search web site via a global informational network, based on a user's lifestyle are disclosed. The methods include populating a user interface view of the integrated web site with a first set of links to the global informational network, wherein the integrated web site integrates a streaming digital media provider station with a global search engine. A user selects a link from the first set of links or performs a key word search using the global search engine. The user interface view is then re-populated with an updated set of links to the global informational network based on demographic and psychographic associations made by the global search engine in response to at least the most recently selected link, the most recent key word search, or the most recent streaming media content. If a new link or a new key word search is performed, the user interface view is again re-populated with an updated set of links. Also, if the streaming media program content from the provider changes, the user interface view is again re-populated with an updated set of links.

The desirability of programming events may be determined using metadata for programming events that includes goodness of fit scores associated with categories of a classification hierarchy one or more of descriptive data and keyword data. The programming events are ranked in accordance with the viewing preferences of viewers as expressed in one or more viewer profiles. The viewer profiles may each include preference scores associated with categories of the classification hierarchy and may also include one or more keywords. Ranking is performed through category matching and keyword matching using the contents of the metadata and the viewer profiles. The viewer profile keywords may be qualified keywords that are associated with specific categories of the classification hierarchy. The ranking may be performed such that qualified keyword matches generally rank higher than keyword matches, and keyword matches generally rank higher than category matches. In alternative embodiments, scores may be calculated such that the ranges of scores for qualified keyword matches, keyword matches and category matches are overlapping but are generally ordered as previously described. Related embodiments may pertain to systems that implement such methods. Program rankings may be used to generate an alert schedule for providing alerts to viewers regarding programming events.

A method and system are provided for ranking search results based on user preferences. The method includes monitoring user selections in response to user receipt of search results and tracking metadata related to user selections for user selections that exhibit a threshold satisfaction level. The method additionally includes storing the tracked metadata as user preferences and adjusting a ranking mechanism to increase the weight of user preferences in order to increase a ranking for search results that exhibit user preferences. The method additionally includes storing the user selections and the keyword search upon determining that the user selections exceed a threshold satisfaction level. The method may utilize the stored user selections and keyword search upon receiving a repeat search to alter presentation of new search results to the user.

An incremental keyword search may be performed by receiving an input keyword string comprising one or more words having one or more symbols, creating a bit vector based at least in part on the input keyword string, comparing the bit vector with one or more other bit vectors representing at least one candidate keyword string to create a set of matching bit vectors and applying a conventional keyword matching algorithm to the at least one candidate keyword string represented by the matching bit vectors. Any matching candidate keyword strings are presented.

A text indexing system for collecting business intelligence about a client, as well as for identifying prospective customers of the client, for use in a lead generation system accessible by the client via the Internet. The text indexing system has various components, including a data acquisition process that extracts textual data from various Internet sources, a database for storing the extracted data, a text indexing server that executes keyword searches of the database, and an output repository. A web server provides client access to the repository, and to the indexing server.

A electronic asset lending library method and apparatus enables the electronic management and reassignment of licenses for unused electronic assets installed on computers connected through a communications network. Licensing data for the unused electronic assets is released by the currently assigned owner and made available to one or more communities of users for display by product category, name, or keyword search. Once released, the lending library notifies the currently assigned owner to remove the unused electronic asset from their computer and transfers the licensing data to a library account. Eligible borrowers are permitted to request a re-assignment of an available released license for an unused electronic asset from a lending library account to their own account. Upon re-assignment the electronic asset lending library automatically notifies the borrower with instructions for the download and installation of the unused electronic asset to their computer. A borrower is determined to be eligible if she belongs to the same community as the currently assigned owner of the unused electronic asset and if she is on an access control list previously created for the unused electronic asset. Ineligible borrowers can request exception overrides to enable them to borrow a selected electronic asset. Licenses can be re-assigned at no cost or for a fee negotiated by the currently assigned owner.

Methods and systems are provided for identifying on-topic sources of media content. According to one embodiment, candidate seed sites are identified from which current seeds are selected for deep crawling. The current seeds are identified by correlating relevancy scores or key-word search results from multiple search engines; and selecting the current seeds based on on-topic scores of the candidate seeds. Periodically, a topic net associated with the topic area of interest is executed to locate relevant sources of media content by (i) building a graph in which nodes represent pages and edges represent links among pages by performing an iterative 360 crawl starting from the seeds; (ii) assigning initial node graph scores; (iii) computing final node graph scores by performing link analysis; (iv) computing a site graph scores by aggregating and averaging corresponding node graph scores; and (v) configuring sites with the highest site graph scores to be scraped.

The present invention provides methods and systems to improve network searching for watermarked content. In some implementations we employ keyword searching to narrow the universe of possible URL candidates. A resulting URL list is searched for digital watermarking. A system is provided to allow customer input. For example, a customer enters keywords or network locations. The keywords or network locations are provided to a watermark-enabled web browser which accesses locations associated with the keywords or network locations. Some implementations of the present invention employ a plurality of distributed watermark-enabled web browsers. Other aspects of the invention provide methods and system to facilitate desktop searching and automated metadata gathering and generating. In one implementation a digital watermark is used to determine whether metadata associated with an image or audio file is current or fresh. The metadata is updated when it is out of date. Watermarks can also be used to link to or facilitate so-called on-line “blogs” (or online conversations).

A method and apparatus automatically build a database by automatically assigning links to an expert, pushing content to an expert, providing expert annotation, and linking the content to an annotation database. A term is selected by applying rules, such as, the term not previously existing in the database, an unusually high frequency of the term, the term is an article or the term is an unusual part of speech. An advertiser can sponsor the term, for example, by having a banner ad automatically pop-up on a keyword search. Content windows can be attached to the term, the content window containing information such as definitions, related products or services, sponsorship information, information from content syndicators, translations and reference works.

A web-based system scans content for specific terms, and transforms occurrences of the terms into hypertext links. Each hypertext link provides access to a dynamically generated web page which contains aggregated content related to the respective term. The aggregated content may be gathered through a distributed keyword search of various content sources, including web sites and other sources on a wide area network. The results of the keyword search are aggregated into a single page or document, preferably with filtering to remove page elements not well suited for display on a mobile device. Occurrences of specific terms on this dynamically generated page may similarly be transformed into links, such that the user can browse content from various sources within a confined environment.

An underlying schema is discovered for an HTML document or a set of HTML documents, authored in various styles. Prior domain knowledge regarding punctuation, keywords, synonyms and HTML tags is used to 1) break a document up into separate objects, 2) identify the objects corresponding to keywords, 3) regroup objects: into hierarchical layers of abstraction, 4) logically order objects at the same level of abstraction, and 5) finally remove any non-keyword related information from the document's discovered schematic structure. The discovered schema supports structural queries from search engines that locate data that are more semantically related to the requested information than data located by simple keyword searching.

This invention uses linguistic principles, which together can be called Collocational Cohesion (CC), to evaluate and sort documents automatically into one or more user-defined categories, with a specified level of precision and recall. Human readers are not required to review all of the documents in a collection, so this invention can save time and money for any manner of large-scale document processing, including legal discovery, Sarbanes-Oxley compliance, creation and review of archives, and maintenance and monitoring of electronic and other communications. Categories for evaluation are user-defined, not pre-set, so that users can adopt either traditional categories (such as different business activities) or custom, highly specific categories (such as perceived risks or sensitive matters or topics). While the CC process is not itself a general tool for text searches, the application of the CC process to large collections of documents will result in classifications that allow for more efficient indexing and retrieval of information. This invention works by means of linguistic principles. Everyday communication (letters, reports, emails-all kinds of communication in language) does follow the grammatical patterns of a language, but forms of communication also follow other patterns that analysts can specify but that are not obvious to their authors. The CC process uses that additional information for the purposes of its users. Any communication exchange that can be recognized as a particular kind of discourse may be used as a category for classification and assessment. Specific linguistic characteristics that belong to the kind of discourse under study can be asserted and compared with a body of general language, both by inspection and by mathematical tests of significance. These characteristics can then be used to form the roster of words and collocations that specifies the discourse type and defines the category. When such a roster is applied to collections of documents, any document with a sufficient number of connections to the roster will be deemed to be a member of the category Larger documents can be evaluated for clusters of connections, either to identify portions of the larger document for further review, or to subcategorize portions with different linguistic characteristics. The CC process may be extended to create a roster of rosters belonging to many categories, thereby increasing the specificity of evaluation by multilevel application of this invention. The CC process works better than other processes used for document management that rely on non-linguistic means to characterize documents. Simple keyword searches either retrieve too many documents (for general keywords), or not the right documents (because a few keywords cannot adequately define a category), no matter how complex the logic of the search. Application of statistical analysis without attention to linguistic principles cannot be as effective as this invention, because the words of a language are not randomly distributed. The assumptions of statistics, whether simple inferential tests or advanced neural network analysis, are thus not a good fit for language. This invention puts basic principles of language first, and only then applies the speed of computer searches and the power of inferential statistics to the problem of evaluation and categorization of textual documents.

A computer-implemented method and system for keyword bidding are disclosed. A particular embodiment includes identifying a keyword searched by a buyer on a host site just prior to their purchase transaction; recording a host site category associated with the purchase transaction; correlating the keyword with the host site category; determining a revenue per click value associated with the keyword; obtaining bidding information associated with the keyword; and automatically generating a bid value for the keyword based on the revenue per click value, the bidding information, and the host site category.

The present invention provides for a method of updating an internet search engine database with the results of a user's selection of specific web page listings from the general web page listing provided to the user as a result of his initial keyword search entry. By updating the database with the selections of many different users, the database can be updated to prioritize those web listings that have been selected the most with respect to a given keyword, and thereby presenting first the most popular web page listings in a subsequent search using the same keyword search entry.

A voice chat system includes a plurality of information processing apparatuses that performs a voice chat while performing speech recognition and a search server connected to the plural information processing apparatuses via a communication network. The search server discloses a search keyword list containing the search keywords searched by the search server to at least one of the plural information processing apparatuses. The at least one information processing apparatus includes a recognition word dictionary generating unit that acquires the search keyword list from the search server to generate a recognition word dictionary containing words for use in the speech recognition, and a speech recognition unit that performs speech recognition on voice data obtained from a dialog of the conversation during the voice chat by referencing a recognition database containing the recognition word dictionary.

A method and system of ranking information according to the likelihood of its being seen as result of a keyword search on any given issue.