patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
9,800,941 | 8 | 16 | 8. A computer program embodied on a tangible, non-transitory computer readable medium for creating an errata report for a transcript, wherein the computer program comprises executable program code executable by a processor, said program comprising: executable program code for providing a first electronic transcript having a total number of alphanumeric characters, wherein said first electronic transcript is organized by pages with a predetermined number of lines per page and a predetermined number of alphanumeric characters per line in the range 1 to x, and wherein each alphanumeric character can be identified by a coordinate page-line-character N, and wherein a portion of said total number of alphanumeric characters forms a sentence that grammatically spans from page 0 -line 0 to page 0 -line 1 ; executable program code for displaying said first electronic transcript with computer logic configured to allow an operator to change said alphanumeric characters in the range 1 to x, wherein alphanumeric characters added in the range 1 to x remain associated with, and are displayable as associated with, page 0 -line 0 , and wherein said changes do not cause said alphanumeric characters to span a line break into subsequent page 0 -line 1 although display of said change appears to cause alphanumeric characters in page 0 -line 0 to wrap; executable program code for compiling a comparison transcript comprising said first electronic transcript and any changed alphanumeric characters; and executable program code for providing an errata report by logic configured to aggregate changes to one or more alphanumeric characters of said first electronic transcript, wherein said errata report comprises a plurality of alphanumeric characters that is substantially smaller in quantity than the total number of alphanumeric characters of said first electronic transcript, and said errata report is distinct from said first electronic transcript. | 8. A computer program embodied on a tangible, non-transitory computer readable medium for creating an errata report for a transcript, wherein the computer program comprises executable program code executable by a processor, said program comprising: executable program code for providing a first electronic transcript having a total number of alphanumeric characters, wherein said first electronic transcript is organized by pages with a predetermined number of lines per page and a predetermined number of alphanumeric characters per line in the range 1 to x, and wherein each alphanumeric character can be identified by a coordinate page-line-character N, and wherein a portion of said total number of alphanumeric characters forms a sentence that grammatically spans from page 0 -line 0 to page 0 -line 1 ; executable program code for displaying said first electronic transcript with computer logic configured to allow an operator to change said alphanumeric characters in the range 1 to x, wherein alphanumeric characters added in the range 1 to x remain associated with, and are displayable as associated with, page 0 -line 0 , and wherein said changes do not cause said alphanumeric characters to span a line break into subsequent page 0 -line 1 although display of said change appears to cause alphanumeric characters in page 0 -line 0 to wrap; executable program code for compiling a comparison transcript comprising said first electronic transcript and any changed alphanumeric characters; and executable program code for providing an errata report by logic configured to aggregate changes to one or more alphanumeric characters of said first electronic transcript, wherein said errata report comprises a plurality of alphanumeric characters that is substantially smaller in quantity than the total number of alphanumeric characters of said first electronic transcript, and said errata report is distinct from said first electronic transcript. 16. The computer program of claim 8 , wherein said comparison transcript is adapted for use as a synchronization index to corresponding multimedia, and wherein said comparison transcript and said corresponding multimedia function on a mobile computing device. | 0.624638 |
7,882,057 | 1 | 13 | 1. A method for using a computer system, wherein the computer system includes computer assisted configuration technology to respond to one or more configuration queries using configuration sub-models, the method comprising: receiving one or more configuration queries representing one or more questions involving parts and part relationships in a configuration of a configurable product; and performing with the computer system: dividing one or more configuration queries into multiple configuration sub-queries, wherein the multiple configuration sub-queries represent the one or more configuration queries; processing each sub-query using at least one configuration sub-model per sub-query, wherein each configuration sub-model collectively models the configurable product and each configuration sub-model includes data to define compatibility relationships between parts included in the configuration sub-model and each configuration sub-model (i) represents a portion of a configuration model of the configurable product and (ii) allows answers from each configuration sub-model to be combined to provide a consolidated answer to the one or more configuration queries; generating a response to the one or more configuration queries based upon the processing of each sub-query using at least one configuration sub-model per sub-query; and providing the response to the one or more configuration queries as data for display by a display device. | 1. A method for using a computer system, wherein the computer system includes computer assisted configuration technology to respond to one or more configuration queries using configuration sub-models, the method comprising: receiving one or more configuration queries representing one or more questions involving parts and part relationships in a configuration of a configurable product; and performing with the computer system: dividing one or more configuration queries into multiple configuration sub-queries, wherein the multiple configuration sub-queries represent the one or more configuration queries; processing each sub-query using at least one configuration sub-model per sub-query, wherein each configuration sub-model collectively models the configurable product and each configuration sub-model includes data to define compatibility relationships between parts included in the configuration sub-model and each configuration sub-model (i) represents a portion of a configuration model of the configurable product and (ii) allows answers from each configuration sub-model to be combined to provide a consolidated answer to the one or more configuration queries; generating a response to the one or more configuration queries based upon the processing of each sub-query using at least one configuration sub-model per sub-query; and providing the response to the one or more configuration queries as data for display by a display device. 13. The method of claim 1 wherein the configurable product is a vehicle. | 0.901907 |
9,563,399 | 58 | 59 | 58. The system of claim 57 , wherein the processor is further configured to associate a first portion of the at least two portions and a second portion of the at least two portions with a same bitmap based on the first portion of the at least two portions and the second portion of the at least two portions having a same corresponding element. | 58. The system of claim 57 , wherein the processor is further configured to associate a first portion of the at least two portions and a second portion of the at least two portions with a same bitmap based on the first portion of the at least two portions and the second portion of the at least two portions having a same corresponding element. 59. The system of claim 58 , wherein the processor is further configured to examine a plurality of patterns, wherein the first and second portion can be in separate patterns. | 0.5 |
7,624,007 | 1 | 5 | 1. A distributed method of recognizing and responding in real time to a user question posed within an application program executing on a client device, comprising: receiving query data generated by the client device over a network; considering a context experienced by a user within the application and loading one or both of appropriate grammars or dictionaries for the context; processing the query data at a server device to form a query text associated with the user question using the appropriate grammars and dictionaries; submitting the query text to a database query engine and a natural language engine; processing the query text using the natural language engine to identify any word phrases in the query text; retrieving a first set of question/answer pairs from a question/answer pair database using the database query engine; forming a combined query to a question/answer pair database using the database query engine, the combined query being based on the query text concatenated with the word phrases and retrieving a second set of question/answer pairs using the combined query; evaluating the first and second sets of question/answer pairs by comparing word phrases in the sets of question/answer pairs with the word phrases from the query text to identify at least one question/answer pair that best matches the user question; and providing an answer to the user question in real-time over a distributed query system, the answer being determined from the question/answer pair that best matches the user question. | 1. A distributed method of recognizing and responding in real time to a user question posed within an application program executing on a client device, comprising: receiving query data generated by the client device over a network; considering a context experienced by a user within the application and loading one or both of appropriate grammars or dictionaries for the context; processing the query data at a server device to form a query text associated with the user question using the appropriate grammars and dictionaries; submitting the query text to a database query engine and a natural language engine; processing the query text using the natural language engine to identify any word phrases in the query text; retrieving a first set of question/answer pairs from a question/answer pair database using the database query engine; forming a combined query to a question/answer pair database using the database query engine, the combined query being based on the query text concatenated with the word phrases and retrieving a second set of question/answer pairs using the combined query; evaluating the first and second sets of question/answer pairs by comparing word phrases in the sets of question/answer pairs with the word phrases from the query text to identify at least one question/answer pair that best matches the user question; and providing an answer to the user question in real-time over a distributed query system, the answer being determined from the question/answer pair that best matches the user question. 5. The method of claim 1 , wherein the question/answer pair database is configured with a full-text unique key column so that when processing the query, the database query engine returns key values of rows from the question/answer pair database that match search criteria specified by the query. | 0.5 |
7,542,973 | 1 | 4 | 1. A computer program product for adaptive matching of records in a data repository comprising: a computer usable memory medium having computer readable program code embodied therein wherein said computer readable program code comprises a matching executable unit configured to: present at least one field common to a first record and a second record wherein said at least one field is used to perform a match between said first record and said second record and wherein said at least one field is presented to a user; obtain a first selected field from said first record and a second selected field from said second record wherein said first selected field and said second selected field is obtained from said user; obtain a first data entry in said first selected field for said first record, said first data entry comprising a first string; tokenize said first string to retrieve a first tokenized data entry string; obtain a second data entry in said second selected field for said second record, said second data entry comprising a second string; tokenize said second string to retrieve a second tokenized data entry string; exclude at least one character from said first tokenized data entry string for utilization in said match that involves said first selected field and said second selected field; exclude at least one different character with respect to said at least one character from said second tokenized data entry string for utilization in said match that involves said first selected field and said second selected field; remove frequently used strings from said first tokenized data entry string and from said second tokenized data entry string; normalize data from said first selected field and from said second selected field to cleanse strings; accept a first list of tokens desired for said match to occur utilizing said first selected field; accept a second list of tokens desired for said match to occur utilizing said second selected field; assign weights to each token in said first list of tokens and each token in said second list of tokens; calculate a score for said match through summation of said weights for each token occurring in said first tokenized data entry string and said first record and for each token that occurs in said second tokenized data entry string and said second record; generate a group of similar records when said score is above a threshold; display said group of similar records to said user; learn at least one token that is relevant; learn at least one weight that results in a match; and learn at least one match criteria appropriate for said match for use in future matching based on user input regarding said score. | 1. A computer program product for adaptive matching of records in a data repository comprising: a computer usable memory medium having computer readable program code embodied therein wherein said computer readable program code comprises a matching executable unit configured to: present at least one field common to a first record and a second record wherein said at least one field is used to perform a match between said first record and said second record and wherein said at least one field is presented to a user; obtain a first selected field from said first record and a second selected field from said second record wherein said first selected field and said second selected field is obtained from said user; obtain a first data entry in said first selected field for said first record, said first data entry comprising a first string; tokenize said first string to retrieve a first tokenized data entry string; obtain a second data entry in said second selected field for said second record, said second data entry comprising a second string; tokenize said second string to retrieve a second tokenized data entry string; exclude at least one character from said first tokenized data entry string for utilization in said match that involves said first selected field and said second selected field; exclude at least one different character with respect to said at least one character from said second tokenized data entry string for utilization in said match that involves said first selected field and said second selected field; remove frequently used strings from said first tokenized data entry string and from said second tokenized data entry string; normalize data from said first selected field and from said second selected field to cleanse strings; accept a first list of tokens desired for said match to occur utilizing said first selected field; accept a second list of tokens desired for said match to occur utilizing said second selected field; assign weights to each token in said first list of tokens and each token in said second list of tokens; calculate a score for said match through summation of said weights for each token occurring in said first tokenized data entry string and said first record and for each token that occurs in said second tokenized data entry string and said second record; generate a group of similar records when said score is above a threshold; display said group of similar records to said user; learn at least one token that is relevant; learn at least one weight that results in a match; and learn at least one match criteria appropriate for said match for use in future matching based on user input regarding said score. 4. The computer program product of claim 1 wherein said computer readable program code is further configured to: said normalize said data from said first field further configured to present a list of tokens most often normalized in matches involving said first field. | 0.577532 |
9,374,284 | 1 | 6 | 1. A computer-implemented method for reporting a performance score for a Web page, comprising computer-implemented operations of: sending, by a Web browser tool on a first computing system a request to a second computing system to load data from the Web page, such that the first computing system causes the second computing system to respond by sending the data to load the Web page in the Web browser tool of the first computing system; heuristically calculating a performance sub-score for each of a plurality of Web page performance metrics; combining said performance sub-scores to produce at least one interpretable Web page performance score; and compiling and outputting a report of the at least one interpretable Web page performance score. | 1. A computer-implemented method for reporting a performance score for a Web page, comprising computer-implemented operations of: sending, by a Web browser tool on a first computing system a request to a second computing system to load data from the Web page, such that the first computing system causes the second computing system to respond by sending the data to load the Web page in the Web browser tool of the first computing system; heuristically calculating a performance sub-score for each of a plurality of Web page performance metrics; combining said performance sub-scores to produce at least one interpretable Web page performance score; and compiling and outputting a report of the at least one interpretable Web page performance score. 6. The method according to claim 1 , further comprising: loading the Web page in a browser; and observing operation of the Web page as the Web page loads in real time. | 0.555851 |
9,075,498 | 9 | 16 | 9. A system comprising: a memory; and a processing device coupled with the memory to: determine counts of documents similar to a reference document for a plurality of similarity ratings, each similarity rating being based on a number of co-occurring terms between the reference document and corresponding similar documents; present in a graphical user interface (GUI) the reference document and a GUI element pertaining to the documents similar to the reference document; and upon a selection of the GUI element, present in the GUI second GUI element comprising similarity ratings associated with the reference document; and in response to selecting one of the similarity ratings, present in the second GUI element a visual representation of the counts of similar documents that indicate a number of documents that are retrievable based on the selected similarity rating, wherein the visual representation is provided prior to retrieving one of the similar documents. | 9. A system comprising: a memory; and a processing device coupled with the memory to: determine counts of documents similar to a reference document for a plurality of similarity ratings, each similarity rating being based on a number of co-occurring terms between the reference document and corresponding similar documents; present in a graphical user interface (GUI) the reference document and a GUI element pertaining to the documents similar to the reference document; and upon a selection of the GUI element, present in the GUI second GUI element comprising similarity ratings associated with the reference document; and in response to selecting one of the similarity ratings, present in the second GUI element a visual representation of the counts of similar documents that indicate a number of documents that are retrievable based on the selected similarity rating, wherein the visual representation is provided prior to retrieving one of the similar documents. 16. The system of claim 9 , wherein the processing device is to determine the counts of the similar documents by: determining a similarity rating for documents in collected data by comparing a document feature vector of the reference document to a document feature vector of the documents in the collected data; and for each similarity rating, determining a number of documents having the corresponding similarity rating. | 0.532222 |
7,782,203 | 1 | 5 | 1. A system that facilitates verifying data within a radio frequency identification (RFID) business process, comprising: a radio frequency identification (RFID) business process includes at least one component configured to receive an event from a logical source; and a strong typing module configured to employ strong typing of the at least one component that defines at least one of an event type for the at least one component, an input event type for the at least one component, or an output event type for the at least one component. | 1. A system that facilitates verifying data within a radio frequency identification (RFID) business process, comprising: a radio frequency identification (RFID) business process includes at least one component configured to receive an event from a logical source; and a strong typing module configured to employ strong typing of the at least one component that defines at least one of an event type for the at least one component, an input event type for the at least one component, or an output event type for the at least one component. 5. The system of claim 1 , the RFID business process is a high-level object configured to form together at least one entity to create a unit of execution that relates to at least one of the following: an outbound process; a manufacturing process; a shipping process; a receiving process; a tracking process; a data representation process; a data manipulation process; a security process; or a process utilizing one of an RFID device service, a device collection, a tag read, an event, an event queue, a tag write, a device configuration, or a number count. | 0.517361 |
8,341,144 | 9 | 14 | 9. A machine-readable volatile or non-volatile medium storing one or more sequences of instructions, which when executed by one or more processors causes the one or more processors to perform: a search engine or proxy receiving one or more distinct taxonomies; storing said one or more distinct taxonomies in association with a plurality of users; wherein each taxonomy of said one or more distinct taxonomies specifies categories and relationships between the categories; receiving a search query that includes one or more keywords to search and information about a user of the plurality of users requesting the search query; wherein the information indicates that the user belongs to a group selected from a set consisting of (a) a resident of a home, (b) an employee of a corporation, and (c) a customer of a business; based at least in part on the information about the user requesting the search query, selecting a taxonomy of the one or more distinct taxonomies stored in association with the plurality of users; wherein selecting the taxonomy comprises selecting a first taxonomy for all first users for whom the information indicates that those first users are residents of a home, selecting a second taxonomy for all second users for whom the information indicates that those second users are employees of a corporation, and selecting a third taxonomy for all third users for whom the information indicates that those third users are customers of a business; wherein each of the first taxonomy, the second taxonomy, and the third taxonomy differs from each other of the first taxonomy, the second taxonomy, and the third taxonomy; generating a search engine results page, at least in part, by applying to a search engine result item a set of rules that are associated with the selected taxonomy; wherein generating the search engine results page includes: (a) identifying search results independent of the taxonomy; and (b) providing to a client the search engine results based on the taxonomy. | 9. A machine-readable volatile or non-volatile medium storing one or more sequences of instructions, which when executed by one or more processors causes the one or more processors to perform: a search engine or proxy receiving one or more distinct taxonomies; storing said one or more distinct taxonomies in association with a plurality of users; wherein each taxonomy of said one or more distinct taxonomies specifies categories and relationships between the categories; receiving a search query that includes one or more keywords to search and information about a user of the plurality of users requesting the search query; wherein the information indicates that the user belongs to a group selected from a set consisting of (a) a resident of a home, (b) an employee of a corporation, and (c) a customer of a business; based at least in part on the information about the user requesting the search query, selecting a taxonomy of the one or more distinct taxonomies stored in association with the plurality of users; wherein selecting the taxonomy comprises selecting a first taxonomy for all first users for whom the information indicates that those first users are residents of a home, selecting a second taxonomy for all second users for whom the information indicates that those second users are employees of a corporation, and selecting a third taxonomy for all third users for whom the information indicates that those third users are customers of a business; wherein each of the first taxonomy, the second taxonomy, and the third taxonomy differs from each other of the first taxonomy, the second taxonomy, and the third taxonomy; generating a search engine results page, at least in part, by applying to a search engine result item a set of rules that are associated with the selected taxonomy; wherein generating the search engine results page includes: (a) identifying search results independent of the taxonomy; and (b) providing to a client the search engine results based on the taxonomy. 14. The machine-readable volatile or non-volatile medium of claim 9 , wherein selecting a particular taxonomy of the one or more distinct taxonomies is based, at least in part, on a particular user role, wherein said information about the user requesting the search query includes information about the particular user role. | 0.646288 |
8,863,212 | 7 | 10 | 7. The internet protocol television system of claim 1 , wherein the controller restores the characteristics of the avatar correlated to a user profile associated with the user in response to termination of the communication session with the tour guide system and the language translation system. | 7. The internet protocol television system of claim 1 , wherein the controller restores the characteristics of the avatar correlated to a user profile associated with the user in response to termination of the communication session with the tour guide system and the language translation system. 10. The internet protocol television system of claim 7 , wherein the instructions supplied by the language translation system or the tour guide system correspond to artificial intelligence instructions. | 0.620301 |
7,509,345 | 1 | 2 | 1. In a computing environment, a method for persisting data clippings categorized according to metadata associated with the clippings at the time of the creation of the clippings, the method comprising: detecting that a user has selected one or more items from a source file that is stored on a memory storage device, the items is captured for inclusion in a clipping; determining the format of each item included in the clipping, wherein at least one of the items includes a plurality of different formats where at least one of the plurality of different formats includes a greater amount of item formatting information than another format; identifying a file path for the source file from which the clipping was selected, the file path to access additional items from the source file; generating associated metadata about the selected clipping including the determined formats of each item in the selected clipping and an activatable hyperlink that, upon activation, is configured to access the source file using a stored file path linking the clipping to the source file; for each item of the clipping: determining that the items include a plurality of different formats, each different format including a greater or lesser amount of item formatting information in comparison to the other formats, such that a format with a greater or lesser amount of item formatting information than the format in which the item was initially captured for inclusion in the clipping is selectable by the user for inserting the item; persisting the item in the determined plurality of different formats based on item type along with the associated metadata, the item is configured for insertion into software application fields in any of the plurality of formats; and inserting the items into one or more data fields of a software application in a format different than the format in which the item was initially captured for inclusion in the clipping, the format is selected by the application and based on at least some of the associated metadata, the selected format for each item selected from among the plurality of formats the item was persisted in; receiving a user request to access one or more additional items from the source file; based on the received user request, activating the hyperlink to access the one or more additional items in the source file using the hyperlink provided in the associated metadata; and providing a user interface having a plurality of user-selectable views, wherein at least one of the user-selectable views displays a thumbnail in a user-preferred format corresponding to at least one of the clippings, and wherein at least one of the user-selectable views displays a list view including text corresponding to the clippings. | 1. In a computing environment, a method for persisting data clippings categorized according to metadata associated with the clippings at the time of the creation of the clippings, the method comprising: detecting that a user has selected one or more items from a source file that is stored on a memory storage device, the items is captured for inclusion in a clipping; determining the format of each item included in the clipping, wherein at least one of the items includes a plurality of different formats where at least one of the plurality of different formats includes a greater amount of item formatting information than another format; identifying a file path for the source file from which the clipping was selected, the file path to access additional items from the source file; generating associated metadata about the selected clipping including the determined formats of each item in the selected clipping and an activatable hyperlink that, upon activation, is configured to access the source file using a stored file path linking the clipping to the source file; for each item of the clipping: determining that the items include a plurality of different formats, each different format including a greater or lesser amount of item formatting information in comparison to the other formats, such that a format with a greater or lesser amount of item formatting information than the format in which the item was initially captured for inclusion in the clipping is selectable by the user for inserting the item; persisting the item in the determined plurality of different formats based on item type along with the associated metadata, the item is configured for insertion into software application fields in any of the plurality of formats; and inserting the items into one or more data fields of a software application in a format different than the format in which the item was initially captured for inclusion in the clipping, the format is selected by the application and based on at least some of the associated metadata, the selected format for each item selected from among the plurality of formats the item was persisted in; receiving a user request to access one or more additional items from the source file; based on the received user request, activating the hyperlink to access the one or more additional items in the source file using the hyperlink provided in the associated metadata; and providing a user interface having a plurality of user-selectable views, wherein at least one of the user-selectable views displays a thumbnail in a user-preferred format corresponding to at least one of the clippings, and wherein at least one of the user-selectable views displays a list view including text corresponding to the clippings. 2. The method of claim 1 wherein persisting the item in a plurality of formats based on item type along with the associated metadata includes persisting date information in association with at least some of the clippings. | 0.539583 |
4,695,977 | 25 | 26 | 25. The system of claim 24 wherein said program further comprises a third one of said scripts and said computer responsive to execution of said third one of said scripts for deactivating further execution of said first one of said scripts; and said computer system further responsive to said first signal to execute said second one of said scripts for controlling a third operation in said process upon the deactivation of further execution of said first one of said scripts. | 25. The system of claim 24 wherein said program further comprises a third one of said scripts and said computer responsive to execution of said third one of said scripts for deactivating further execution of said first one of said scripts; and said computer system further responsive to said first signal to execute said second one of said scripts for controlling a third operation in said process upon the deactivation of further execution of said first one of said scripts. 26. The system of claim 25 wherein said program further comprises a fourth one of said scripts and said computer responsive to a third signal for activating the execution of said first one of said scripts in said computer by the execution of said fourth one of said scripts; and said computer further responsive to said first signal for preventing the execution of said second one of said scripts in response to said first signal upon the activation of the execution of said first one of said scripts. | 0.5 |
9,965,453 | 15 | 18 | 15. A computer storage medium having computer-executable instructions, which when executed perform actions, comprising: obtaining first configuration data for an application that is operable to execute in a first environment; obtaining transformation data that indicates modifications to make to the first configuration data to create second configuration data suitable for when the application is executing in a second environment, the transformation data encoded in a declarative language; transforming the first configuration data according to the modifications indicated in the transformation data to create the second configuration data; and wherein the first configuration data and the transformation data have an identical schema that expresses constraints on structure and content of the first configuration data and the transformation data, the constraints additional to constraints imposed by one or more languages in which the first configuration data and the transformation data are represented. | 15. A computer storage medium having computer-executable instructions, which when executed perform actions, comprising: obtaining first configuration data for an application that is operable to execute in a first environment; obtaining transformation data that indicates modifications to make to the first configuration data to create second configuration data suitable for when the application is executing in a second environment, the transformation data encoded in a declarative language; transforming the first configuration data according to the modifications indicated in the transformation data to create the second configuration data; and wherein the first configuration data and the transformation data have an identical schema that expresses constraints on structure and content of the first configuration data and the transformation data, the constraints additional to constraints imposed by one or more languages in which the first configuration data and the transformation data are represented. 18. The computer storage medium of claim 15 , wherein obtaining transformation data that indicates modifications comprises obtaining transformation data that includes location information, the location information indicating locations within the first configuration data at which the modifications are to be made. | 0.661255 |
7,711,565 | 22 | 23 | 22. A method of providing contextually relevant information to a user of a transport apparatus, comprising: authenticating the user via a wireless interface of the transport apparatus when they are at least in proximity to the transport apparatus; receiving a user input made via a software application of a personal electronic device; determining at least one context associated with said input; retrieving stored information based at least in part on said at least one context; downloading at least a portion of said stored information to said electronic device; wherein said downloading at least a portion of said stored information comprises downloading at least a portion of said stored information which has been automatically customized for said user based at least in part on said authenticating. | 22. A method of providing contextually relevant information to a user of a transport apparatus, comprising: authenticating the user via a wireless interface of the transport apparatus when they are at least in proximity to the transport apparatus; receiving a user input made via a software application of a personal electronic device; determining at least one context associated with said input; retrieving stored information based at least in part on said at least one context; downloading at least a portion of said stored information to said electronic device; wherein said downloading at least a portion of said stored information comprises downloading at least a portion of said stored information which has been automatically customized for said user based at least in part on said authenticating. 23. The method of claim 22 , wherein said input comprises a request for obtaining information relating to a particular topic, and said stored information comprises advertising information relating to said at least one context associated with said topic. | 0.569728 |
9,378,273 | 14 | 20 | 14. A method comprising; receiving a word problem; using sentence boundary detection, automatically dividing said word problem into sentences; identifying a first question from said word problem; identifying contextual phrases from said word problem, said contextual phrases comprising a portion of said sentences and providing context for said question; identifying first types for each phrase of said contextual phrases; identifying a referring phrase in said first question; identifying a second type for said referring phrase; creating a replacement phrase comprising phrases of said contextual phrases having first type matching said second type; producing a reformulated question by replacing said referring phrase in said first question with said replacement phrase; inputting said reformulated question to a question-answering (QA) system; receiving answers to said reformulated question from said QA system; and creating a second question by incorporating one or more answers to said reformulated question into said first question, said second question comprising one of: an interrogative word question, a yes-no question, and a multiple-choice question. | 14. A method comprising; receiving a word problem; using sentence boundary detection, automatically dividing said word problem into sentences; identifying a first question from said word problem; identifying contextual phrases from said word problem, said contextual phrases comprising a portion of said sentences and providing context for said question; identifying first types for each phrase of said contextual phrases; identifying a referring phrase in said first question; identifying a second type for said referring phrase; creating a replacement phrase comprising phrases of said contextual phrases having first type matching said second type; producing a reformulated question by replacing said referring phrase in said first question with said replacement phrase; inputting said reformulated question to a question-answering (QA) system; receiving answers to said reformulated question from said QA system; and creating a second question by incorporating one or more answers to said reformulated question into said first question, said second question comprising one of: an interrogative word question, a yes-no question, and a multiple-choice question. 20. The method of claim 14 , said word problem comprising a natural language query. | 0.941467 |
7,840,518 | 4 | 5 | 4. The object recognition system of claim 1 , wherein the step of applying the set of rules to the set of responses to determine an output comprises the steps of: determining if a set of responses matches at least one rule, wherein a set of responses matches a rule if each response token identifier and associated response probability of recognition of the set of responses are all found among the predicates of the rule and the rule probabilities of recognition overlap the response probabilities of recognition for each of the response token identifiers; if a set of responses matches at least one rule, then determining the most-specific matched rule; and applying the most-specific matched rule to determine an output. | 4. The object recognition system of claim 1 , wherein the step of applying the set of rules to the set of responses to determine an output comprises the steps of: determining if a set of responses matches at least one rule, wherein a set of responses matches a rule if each response token identifier and associated response probability of recognition of the set of responses are all found among the predicates of the rule and the rule probabilities of recognition overlap the response probabilities of recognition for each of the response token identifiers; if a set of responses matches at least one rule, then determining the most-specific matched rule; and applying the most-specific matched rule to determine an output. 5. The object recognition system of claim 4 , wherein if a set of responses does not match at least one rule, the method further comprises the step of determining if all of the response token identifiers of the set of responses are all found among the predicates of the rule. | 0.5 |
9,412,096 | 1 | 5 | 1. An apparatus, comprising: a logic circuit; and spam filtering logic operative on the logic circuit to: detect a country of origin for an e-mail message to a recipient; detect a language of the e-mail message; assign a first score to the message according to a country frequency, wherein the country frequency indicates a frequency with which the recipient communicates with a country of origin by e-mail; assign a second score to the message according to a language frequency, wherein the language frequency indicates a frequency with which the recipient communicates in a language by e-mail; and filter the e-mail message according to the first score and the second score. | 1. An apparatus, comprising: a logic circuit; and spam filtering logic operative on the logic circuit to: detect a country of origin for an e-mail message to a recipient; detect a language of the e-mail message; assign a first score to the message according to a country frequency, wherein the country frequency indicates a frequency with which the recipient communicates with a country of origin by e-mail; assign a second score to the message according to a language frequency, wherein the language frequency indicates a frequency with which the recipient communicates in a language by e-mail; and filter the e-mail message according to the first score and the second score. 5. The apparatus of claim 1 , the spam filtering logic operative to: detect a plurality of languages from the content of the e-mail message; determine a separate language frequency for each language; and assign a separate score for each of the separate language frequencies. | 0.58104 |
7,849,077 | 13 | 22 | 13. A non-transitory computer-readable storage medium storing processor executable instructions operable to perform a method, the method comprising: receiving a query, the query being configured to cause a search logic to retrieve one or more documents, the documents comprising text elements and metadata elements; creating from the query a series of sub-queries {SQ 1 , . . . SQ N }, N being an integer greater than 1, the series of sub-queries including one or more of, a sub-query based on one or more of, a numeric metadata link score, and a numeric metadata URL depth, where the numeric metadata link score is directly proportional to document relevance and where the numeric metadata URL depth is inversely proportional to document relevance; the series of sub-queries being configured so that a sub-query SQ X will cause the search logic to retrieve fewer documents than a sub-query SQ Y when X<Y; the series of sub-queries being configured so that a sub-query SQA will cause the search logic to retrieve documents having a higher relevancy than a sub-query SQB when A<B; and providing, in order providing, in order one or more sub-queries from the series of sub-queries, one or more sub-queries from the series of sub-queries to the search logic until a pre-determined number of documents are retrieved by the search logic. | 13. A non-transitory computer-readable storage medium storing processor executable instructions operable to perform a method, the method comprising: receiving a query, the query being configured to cause a search logic to retrieve one or more documents, the documents comprising text elements and metadata elements; creating from the query a series of sub-queries {SQ 1 , . . . SQ N }, N being an integer greater than 1, the series of sub-queries including one or more of, a sub-query based on one or more of, a numeric metadata link score, and a numeric metadata URL depth, where the numeric metadata link score is directly proportional to document relevance and where the numeric metadata URL depth is inversely proportional to document relevance; the series of sub-queries being configured so that a sub-query SQ X will cause the search logic to retrieve fewer documents than a sub-query SQ Y when X<Y; the series of sub-queries being configured so that a sub-query SQA will cause the search logic to retrieve documents having a higher relevancy than a sub-query SQB when A<B; and providing, in order providing, in order one or more sub-queries from the series of sub-queries, one or more sub-queries from the series of sub-queries to the search logic until a pre-determined number of documents are retrieved by the search logic. 22. The non-transitory computer-readable medium of claim 13 , comprising providing retrieved documents to a user, the documents being ordered based on relevance without performing post-retrieval relevance ranking and where duplicate documents are removed. | 0.757605 |
9,367,235 | 1 | 2 | 1. A method for receiving a confirming gesture formed on or about a sensor panel, comprising: detecting one or more images at a first time at the sensor panel; determining that the one or more images at the first time are arranged in a pattern corresponding to a predetermined OK gesture; determining a centering parameter from the one or more images; associating the OK gesture with a user interface (UI) element coincident with the centering parameter, the UI element accepting a confirming input; and providing the confirming input to the UI element. | 1. A method for receiving a confirming gesture formed on or about a sensor panel, comprising: detecting one or more images at a first time at the sensor panel; determining that the one or more images at the first time are arranged in a pattern corresponding to a predetermined OK gesture; determining a centering parameter from the one or more images; associating the OK gesture with a user interface (UI) element coincident with the centering parameter, the UI element accepting a confirming input; and providing the confirming input to the UI element. 2. The method of claim 1 , further comprising determining that the one or more images at the first time are arranged in a pattern corresponding to a predetermined OK gesture by: identifying one or more palm edge and pinky features; and identifying a thumb and finger feature. | 0.5 |
9,304,744 | 1 | 3 | 1. A method comprising: allowing software code associated with one or more of a plurality of programming building blocks to be concurrently edited and executed within a programming environment, including, responsive to advancement of time or input by an end user of the programming environment, revising a current situation relating to the plurality of programming building blocks or revising the software code: receiving, by a conversational programming agent of the programming environment, (i) information regarding the plurality of programming building blocks and (ii) information indicative of the current situation; and evaluating, by the conversational programming agent, the plurality of programming building blocks based on the current situation; responsive to said evaluating, facilitating detection of one or more logical errors in one or more of the plurality of programming building blocks by proactively providing, by the conversational programming agent, real-time, human perceptible semantic feedback regarding those of the plurality of programming building blocks to which the current situation is relevant to the end user based on the evaluating; wherein the real-time, human perceptible semantic feedback comprises annotating one or more of the plurality of programming building blocks; and wherein the conversational programming agent is implemented in one or more processors and one or more computer-readable media of one or more computer systems, the one or more computer-readable media having instructions tangibly embodied therein that are executable by the one or more processors. | 1. A method comprising: allowing software code associated with one or more of a plurality of programming building blocks to be concurrently edited and executed within a programming environment, including, responsive to advancement of time or input by an end user of the programming environment, revising a current situation relating to the plurality of programming building blocks or revising the software code: receiving, by a conversational programming agent of the programming environment, (i) information regarding the plurality of programming building blocks and (ii) information indicative of the current situation; and evaluating, by the conversational programming agent, the plurality of programming building blocks based on the current situation; responsive to said evaluating, facilitating detection of one or more logical errors in one or more of the plurality of programming building blocks by proactively providing, by the conversational programming agent, real-time, human perceptible semantic feedback regarding those of the plurality of programming building blocks to which the current situation is relevant to the end user based on the evaluating; wherein the real-time, human perceptible semantic feedback comprises annotating one or more of the plurality of programming building blocks; and wherein the conversational programming agent is implemented in one or more processors and one or more computer-readable media of one or more computer systems, the one or more computer-readable media having instructions tangibly embodied therein that are executable by the one or more processors. 3. The method of claim 1 , wherein the plurality of programming building blocks include operational programming building blocks. | 0.902883 |
8,417,654 | 8 | 9 | 8. The method of claim 6 , wherein computing classification scores comprises computing, for one or more of the training pairs, a result of a function of the rule weights for initial trimmed rules that are satisfied by the training pair. | 8. The method of claim 6 , wherein computing classification scores comprises computing, for one or more of the training pairs, a result of a function of the rule weights for initial trimmed rules that are satisfied by the training pair. 9. The method of claim 8 , wherein classifying the negative training pairs comprises: classifying negative training pairs having a classification score that meets a threshold classification score as duplicate pairs; and classifying negative training pairs having a classification score that fails to meet the threshold classification score as non-duplicate pairs. | 0.5 |
8,752,183 | 1 | 9 | 1. A method for testing a vulnerability of a web site, comprising: receiving a first set of addresses; identifying a second set of addresses by analyzing a first set of web pages located at the first set of addresses; identifying a third set of addresses by analyzing a first set of document object models (DOMs) associated with the first set of web pages and associated with a second set of web pages located at the second set of addresses; probing a third set of web pages for presence of a set of vulnerabilities using a document object model (DOM) analysis script to analyze a second set of document object models (DOMs) associated with the third set of web pages as a set of attack vectors is applied to the third set of web pages, wherein the third set of web pages is located at the first, second, and third sets of addresses, and the DOM analysis script is inserted into the third set of web pages; and determining presence of the set of vulnerabilities for the third set of web pages based on a set of results from the probing, wherein the attack vectors are designed to exploit a vulnerability of a web page. | 1. A method for testing a vulnerability of a web site, comprising: receiving a first set of addresses; identifying a second set of addresses by analyzing a first set of web pages located at the first set of addresses; identifying a third set of addresses by analyzing a first set of document object models (DOMs) associated with the first set of web pages and associated with a second set of web pages located at the second set of addresses; probing a third set of web pages for presence of a set of vulnerabilities using a document object model (DOM) analysis script to analyze a second set of document object models (DOMs) associated with the third set of web pages as a set of attack vectors is applied to the third set of web pages, wherein the third set of web pages is located at the first, second, and third sets of addresses, and the DOM analysis script is inserted into the third set of web pages; and determining presence of the set of vulnerabilities for the third set of web pages based on a set of results from the probing, wherein the attack vectors are designed to exploit a vulnerability of a web page. 9. The method of claim 1 , wherein the tested vulnerability comprises a Cross-Site Scripting (XSS) vulnerability. | 0.809764 |
8,645,394 | 1 | 8 | 1. A computer-implemented method comprising: accessing a cluster of a plurality of resources associated with a name context; generating a quality score for a resource, the quality score being independent of inclusion of the resource in the cluster and independent of inclusion of other resources in the cluster and indicative of a quality measure of the resource; generating a cluster relation score for the resource, the cluster relation score being dependent on the other resources in the cluster and indicative of an authority of the resource relative to authorities of the other resources in the cluster; generating a resource ranking score for the resource, with the resource ranking score at least partly based on the quality score and the cluster relation score; and ranking the resources in the cluster at least partly based on the resource ranking score. | 1. A computer-implemented method comprising: accessing a cluster of a plurality of resources associated with a name context; generating a quality score for a resource, the quality score being independent of inclusion of the resource in the cluster and independent of inclusion of other resources in the cluster and indicative of a quality measure of the resource; generating a cluster relation score for the resource, the cluster relation score being dependent on the other resources in the cluster and indicative of an authority of the resource relative to authorities of the other resources in the cluster; generating a resource ranking score for the resource, with the resource ranking score at least partly based on the quality score and the cluster relation score; and ranking the resources in the cluster at least partly based on the resource ranking score. 8. The computer-implemented method of claim 1 , wherein the name context comprises one or more of a name of a book, a name of a product, or a name of a person. | 0.856498 |
9,043,320 | 7 | 8 | 7. The method of claim 1 wherein the third set of metadata is collected using the search engine by sending a search query to the search engine, wherein the search query comprises a Uniform Resource Locator (URL) for each of the plurality of data objects, whereby the search engine retrieves a fingerprint for each of the plurality of data objects and returns aggregated metadata for each respective object. | 7. The method of claim 1 wherein the third set of metadata is collected using the search engine by sending a search query to the search engine, wherein the search query comprises a Uniform Resource Locator (URL) for each of the plurality of data objects, whereby the search engine retrieves a fingerprint for each of the plurality of data objects and returns aggregated metadata for each respective object. 8. The method of claim 7 wherein the search query is a Build your own Search Service (BOSS) query. | 0.5 |
8,935,247 | 13 | 14 | 13. A computer-readable storage medium having instructions to provide information via a computer network, the instructions comprising instructions to: receive a data set including a plurality of offerings, each of the offerings characterized by one or more offering attributes; identify one or more advertising performance metric goals for the data set; determine, based on the identified advertising performance metric goals for the data set, a first offering attribute and a first plurality of attribute values of the first offering attribute according to which to partition the offerings across a first plurality of partition groups; determine, based on the identified advertising performance metric goals for the data set, a second offering attribute and a second plurality of attribute values of the second offering attribute according to which to further partition offerings included in a first subset of the first plurality of partition groups; determine, based on the identified advertising performance metric goals for the data set, a third plurality of attribute values of a third offering attribute according to which to further partition offerings included in a second subset of the first plurality of partition groups; partition the plurality of offerings across the first plurality of partition groups; partition the plurality of offerings included in the first subset of the first plurality of partition groups across the second plurality of partition groups; and partition the plurality of offerings included in the second subset of the first plurality of partition groups across the third plurality of partition groups. | 13. A computer-readable storage medium having instructions to provide information via a computer network, the instructions comprising instructions to: receive a data set including a plurality of offerings, each of the offerings characterized by one or more offering attributes; identify one or more advertising performance metric goals for the data set; determine, based on the identified advertising performance metric goals for the data set, a first offering attribute and a first plurality of attribute values of the first offering attribute according to which to partition the offerings across a first plurality of partition groups; determine, based on the identified advertising performance metric goals for the data set, a second offering attribute and a second plurality of attribute values of the second offering attribute according to which to further partition offerings included in a first subset of the first plurality of partition groups; determine, based on the identified advertising performance metric goals for the data set, a third plurality of attribute values of a third offering attribute according to which to further partition offerings included in a second subset of the first plurality of partition groups; partition the plurality of offerings across the first plurality of partition groups; partition the plurality of offerings included in the first subset of the first plurality of partition groups across the second plurality of partition groups; and partition the plurality of offerings included in the second subset of the first plurality of partition groups across the third plurality of partition groups. 14. The computer-readable storage medium of claim 13 , wherein receiving a data set including a plurality of offerings includes receiving one or more of the first offering attribute, the second offering attribute and the third offering attribute. | 0.847205 |
7,533,152 | 1 | 20 | 1. A apparatus for routing an electronic message from a sender to at least one endpoint for a user comprising a processor for executing logic for: receiving the electronic message for the user by the processor, the electronic message comprising a message, a routing indicator, and at least one of a stylesheet or a reference to the stylesheet, the stylesheet including a definition of at least one of a plurality of routing indicators, the routing indicator in the electronic message being at least one of the plurality of routing indicators; accessing the stylesheet; interpreting the routing indicator in the electronic message based on the definition in the stylesheet; selecting at least one endpoint from the plurality of endpoints based on the routing indicator and a user-defined endpoint table, the endpoint table specifying at least one endpoint based on the routing indicator with the endpoint table specifying different endpoints based on different routing indicators; and routing at least a portion of the electronic message to the at least one endpoint. | 1. A apparatus for routing an electronic message from a sender to at least one endpoint for a user comprising a processor for executing logic for: receiving the electronic message for the user by the processor, the electronic message comprising a message, a routing indicator, and at least one of a stylesheet or a reference to the stylesheet, the stylesheet including a definition of at least one of a plurality of routing indicators, the routing indicator in the electronic message being at least one of the plurality of routing indicators; accessing the stylesheet; interpreting the routing indicator in the electronic message based on the definition in the stylesheet; selecting at least one endpoint from the plurality of endpoints based on the routing indicator and a user-defined endpoint table, the endpoint table specifying at least one endpoint based on the routing indicator with the endpoint table specifying different endpoints based on different routing indicators; and routing at least a portion of the electronic message to the at least one endpoint. 20. The apparatus of claim 1 , further comprising logic for formatting at least a portion of the electronic message, and wherein the logic for routing at least a portion of the electronic message comprises logic for routing at least a portion of the formatted electronic message. | 0.703191 |
8,656,362 | 7 | 10 | 7. A computer system for correcting semantic errors in code in an integrated development environment, said computer system comprising: a central processing unit; first program instructions to input, using a code editor, code being developed in an integrated development environment; second program instructions to identify, in a syntax tree constructed for said code inputted, one or more nodes containing semantic errors pertaining to use of a third-party library; third program instructions to display one or more suggestions for correcting said semantic errors identified for a node in said syntax tree containing said semantic errors, wherein said one or more suggestions include one or more executable code snippets associated with one or more collaboration records located for a chosen node from the syntax tree; fourth program instructions to select at least one executable code snippet from said one or more executable code snippets displayed for correcting said semantic errors identified for said chosen node, wherein said at least one executable code snippet comprises a primary executable code snippet and a secondary executable code snippet; fifth program instructions to execute the primary executable code snippet; sixth program instructions to, in response to the primary executable code snippet failing to correct said semantic errors identified for said chosen node, automatically execute the secondary executable code snippet; and seventh program instructions to display a code snippet configuration interface for configuring said one or more code snippets, wherein the code snippet configuration interface comprises: an input parameter active field for identifying input parameters that are required, by said chosen node, to be used with said one or more code snippets; an output parameter active field for identifying output parameters that are required, by said chosen node, to be used with said one or more code snippets; an input/output parameter active field for identifying input/output parameters that are required, by said chosen node, to be used with said one or more code snippets; and a return value active field for identifying a return value that is required, by said chosen node, to be returned by said one or more code snippets; and wherein said first, second, third, fourth, fifth, sixth, and seventh program instructions are stored in said computer system for execution by said central processing unit. | 7. A computer system for correcting semantic errors in code in an integrated development environment, said computer system comprising: a central processing unit; first program instructions to input, using a code editor, code being developed in an integrated development environment; second program instructions to identify, in a syntax tree constructed for said code inputted, one or more nodes containing semantic errors pertaining to use of a third-party library; third program instructions to display one or more suggestions for correcting said semantic errors identified for a node in said syntax tree containing said semantic errors, wherein said one or more suggestions include one or more executable code snippets associated with one or more collaboration records located for a chosen node from the syntax tree; fourth program instructions to select at least one executable code snippet from said one or more executable code snippets displayed for correcting said semantic errors identified for said chosen node, wherein said at least one executable code snippet comprises a primary executable code snippet and a secondary executable code snippet; fifth program instructions to execute the primary executable code snippet; sixth program instructions to, in response to the primary executable code snippet failing to correct said semantic errors identified for said chosen node, automatically execute the secondary executable code snippet; and seventh program instructions to display a code snippet configuration interface for configuring said one or more code snippets, wherein the code snippet configuration interface comprises: an input parameter active field for identifying input parameters that are required, by said chosen node, to be used with said one or more code snippets; an output parameter active field for identifying output parameters that are required, by said chosen node, to be used with said one or more code snippets; an input/output parameter active field for identifying input/output parameters that are required, by said chosen node, to be used with said one or more code snippets; and a return value active field for identifying a return value that is required, by said chosen node, to be returned by said one or more code snippets; and wherein said first, second, third, fourth, fifth, sixth, and seventh program instructions are stored in said computer system for execution by said central processing unit. 10. The computer system according to claim 7 , further comprising: eighth program instructions to create, using said one or more collaboration records located, visual indicators within said code editor for said one or more nodes containing said semantic errors identified; and wherein said eighth program instructions are stored in said computer system for execution by said central processing unit. | 0.727831 |
7,895,068 | 30 | 32 | 30. A non-transitory computer-readable medium having computer executable instructions stored thereon that, when executed, cause a processor to perform a method comprising: a) generating a capability domain, by the processor, having a plurality of entity roles within a predetermined degree of separation, the predetermined degree of separation being dependent on an activity trust level of a relationship a first entity is seeking to establish with the second entity; b) generating an activity trust domain, by the processor, having a plurality of levels of trust; and c) generating a respective business process of a plurality of business processes being associated with one or more combinations of a respective role of the plurality of roles and a respective trust level of the plurality of trust levels, wherein the data structure is indexed by the capability domain and the activity trust domain to obtain a corresponding business process. | 30. A non-transitory computer-readable medium having computer executable instructions stored thereon that, when executed, cause a processor to perform a method comprising: a) generating a capability domain, by the processor, having a plurality of entity roles within a predetermined degree of separation, the predetermined degree of separation being dependent on an activity trust level of a relationship a first entity is seeking to establish with the second entity; b) generating an activity trust domain, by the processor, having a plurality of levels of trust; and c) generating a respective business process of a plurality of business processes being associated with one or more combinations of a respective role of the plurality of roles and a respective trust level of the plurality of trust levels, wherein the data structure is indexed by the capability domain and the activity trust domain to obtain a corresponding business process. 32. The computer-readable medium having stored thereon a data structure according to claim 30 , wherein each respective level of trust in the plurality of levels of trust defines a respective degree of trust between one entity and another entity. | 0.5 |
7,689,037 | 13 | 15 | 13. The method as claimed in claim 10 , wherein the pre-defined set of terminal symbols further includes a terminal symbol representing email address information and a terminal symbol representing uniform resource locator information. | 13. The method as claimed in claim 10 , wherein the pre-defined set of terminal symbols further includes a terminal symbol representing email address information and a terminal symbol representing uniform resource locator information. 15. The method as claimed in claim 13 , wherein the pre-defined set of terminal symbols includes a terminal symbol representing an emphasized line of text and a terminal symbol representing a huge font line of text. | 0.5 |
7,620,494 | 1 | 6 | 1. A method for displaying driving directions, the method comprising: accessing data that describes at least one maneuver to be executed to traverse a route from an origin to a destination; selecting a portion of the accessed data that describes a particular maneuver, the particular maneuver including an action and a road; determining a road symbol to associate with the particular maneuver, the road symbol having substantially the same appearance as a road sign used to mark the road involved in the particular maneuver; determining an action symbol to associate with the particular maneuver, the action symbol having substantially the same appearance as a road sign used to identify the action to be performed to execute the particular maneuver; and presenting both the road symbol and the action symbol to describe the particular maneuver, such that the road symbol and the action symbol describe the particular maneuver. | 1. A method for displaying driving directions, the method comprising: accessing data that describes at least one maneuver to be executed to traverse a route from an origin to a destination; selecting a portion of the accessed data that describes a particular maneuver, the particular maneuver including an action and a road; determining a road symbol to associate with the particular maneuver, the road symbol having substantially the same appearance as a road sign used to mark the road involved in the particular maneuver; determining an action symbol to associate with the particular maneuver, the action symbol having substantially the same appearance as a road sign used to identify the action to be performed to execute the particular maneuver; and presenting both the road symbol and the action symbol to describe the particular maneuver, such that the road symbol and the action symbol describe the particular maneuver. 6. The method of claim 1 wherein a communication device capable of transmitting and receiving voice communications is used to present the road symbol and the action symbol to describe the particular maneuver. | 0.525114 |
7,966,323 | 1 | 10 | 1. A method in a computing device for facilitating searching and retrieval of a personal information manager data item associated with a personal information manager application, said method comprising: consequent upon associating a given personal information manager data item with said personal information manager application, deriving a keyword pattern from a given keyword of said given data item in accordance with a first mapping function; associating said keyword pattern with said given data item, said keyword pattern being an ordered plurality of elements; receiving a selection for a category for said given data item and associating a category pattern with said given data item, said category pattern being a second ordered plurality of elements, said category pattern derived in accordance with a second mapping function different from said first mapping function such that no keyword search string maps to said category pattern; consequent upon receiving a user search request comprising an entered keyword search string or an indication of a category to be searched: generating a target pattern from said keyword search string or from said indication of said category to be searched; searching personal information manager data items associated with said personal information manager application to identify personal information manager data items matching said target pattern, said searching comprising: for each particular personal information manager data item encountered, comparing said target pattern with each category pattern and each keyword pattern associated with said particular personal information manager data item so that a single search on any given target pattern covers category patterns and keyword patterns associated with personal information manager data items; returning each personal information manager data item having an associated category pattern or associated keyword pattern which matches said target pattern. | 1. A method in a computing device for facilitating searching and retrieval of a personal information manager data item associated with a personal information manager application, said method comprising: consequent upon associating a given personal information manager data item with said personal information manager application, deriving a keyword pattern from a given keyword of said given data item in accordance with a first mapping function; associating said keyword pattern with said given data item, said keyword pattern being an ordered plurality of elements; receiving a selection for a category for said given data item and associating a category pattern with said given data item, said category pattern being a second ordered plurality of elements, said category pattern derived in accordance with a second mapping function different from said first mapping function such that no keyword search string maps to said category pattern; consequent upon receiving a user search request comprising an entered keyword search string or an indication of a category to be searched: generating a target pattern from said keyword search string or from said indication of said category to be searched; searching personal information manager data items associated with said personal information manager application to identify personal information manager data items matching said target pattern, said searching comprising: for each particular personal information manager data item encountered, comparing said target pattern with each category pattern and each keyword pattern associated with said particular personal information manager data item so that a single search on any given target pattern covers category patterns and keyword patterns associated with personal information manager data items; returning each personal information manager data item having an associated category pattern or associated keyword pattern which matches said target pattern. 10. The method of claim 1 further comprising deriving a category pattern for each category in a pre-defined master list of categories in accordance with said second mapping function. | 0.887376 |
8,095,546 | 17 | 18 | 17. A system, comprising: a memory, the memory storing a plurality of distinct book content items and corresponding characteristics of the distinct book content items; and one or more computers configured to interact with the memory, the one or more computers being further configured to perform operations including: segmenting textual content for each of the plurality of distinct book content items into word strings, each word string including a predefined number of contiguous words in the textual content of a book content item; classifying word strings having a frequency of occurrence that is less than a threshold frequency of occurrence as uncommon word strings, the frequency of occurrence for each word string being a number of occurrences of the word string relative to the total number of word strings in the plurality of distinct book content items; representing a weighted graph in the memory, the weighted graph including a plurality of distinct nodes, each distinct node representing a corresponding distinct book content item in the plurality of distinct book content items, and where an edge exists in the weighted graph between each pair of distinct nodes that represent distinct book content items that both include a matching uncommon word string, each edge in the weighted graph being weighted based on a relative importance of the distinct node from which the edge originates; for each distinct node: identifying matching word strings in the textual content of other distinct book content items that are represented by other distinct nodes, each matching word string being a word string that matches an uncommon word string in the textual content of the distinct book content item corresponding to the distinct node; and generating edges in the weighted graph connecting the distinct node to other distinct nodes corresponding to the other distinct book content items, each edge representing one or more matches of an uncommon word string to one or more matching word strings in the textual content of another distinct book content item; and determining a rank score for each distinct book content item based on the edges between the distinct nodes representing the distinct book content items, the rank score being a score indicative of the importance of each distinct book content item relative to other distinct book content items. | 17. A system, comprising: a memory, the memory storing a plurality of distinct book content items and corresponding characteristics of the distinct book content items; and one or more computers configured to interact with the memory, the one or more computers being further configured to perform operations including: segmenting textual content for each of the plurality of distinct book content items into word strings, each word string including a predefined number of contiguous words in the textual content of a book content item; classifying word strings having a frequency of occurrence that is less than a threshold frequency of occurrence as uncommon word strings, the frequency of occurrence for each word string being a number of occurrences of the word string relative to the total number of word strings in the plurality of distinct book content items; representing a weighted graph in the memory, the weighted graph including a plurality of distinct nodes, each distinct node representing a corresponding distinct book content item in the plurality of distinct book content items, and where an edge exists in the weighted graph between each pair of distinct nodes that represent distinct book content items that both include a matching uncommon word string, each edge in the weighted graph being weighted based on a relative importance of the distinct node from which the edge originates; for each distinct node: identifying matching word strings in the textual content of other distinct book content items that are represented by other distinct nodes, each matching word string being a word string that matches an uncommon word string in the textual content of the distinct book content item corresponding to the distinct node; and generating edges in the weighted graph connecting the distinct node to other distinct nodes corresponding to the other distinct book content items, each edge representing one or more matches of an uncommon word string to one or more matching word strings in the textual content of another distinct book content item; and determining a rank score for each distinct book content item based on the edges between the distinct nodes representing the distinct book content items, the rank score being a score indicative of the importance of each distinct book content item relative to other distinct book content items. 18. The system of claim 17 , wherein the one or more computers are further configured to perform operations including: receiving a relevance score for each of the plurality of distinct book content items, the relevance score being a measure of relevance of the distinct book content item to a search query; ranking the plurality of distinct book content items based on the rank score and the relevance score; and ordering search results for the book content items, the search results being ordered according to the ranking of the plurality of distinct book content items. | 0.5 |
9,355,130 | 1 | 10 | 1. A processor-implemented method for managing parameters of a semiconductor component, a cell, a library of components, or a library of cells in electronic design automation (EDA) software to modify a functionality of an integrated circuit, the method comprising: using a processor executing instructions to operate the EDA software: receiving a query to the EDA software; augmenting the query with at least a first search instruction stored in a first file; augmenting a Component Description Format (CDF) file by the first file so that the augmented CDF file contains at least one additional field, wherein the CDF file is stored on a non-transitory computer readable medium, describes the component, cell, or library parameters, and contains parameter fields that have programming code that interacts with the EDA software via one of: (i) execution of the query with a scripting language binding that uses a design database of the integrated circuit or (ii) execution of the query with an application programming interface; performing the augmented query in at least one field in the augmented CDF file; determining whether there is at least one matching parameter within the component, cell, or library parameters based on the query; and displaying and emphasizing the at least one matching parameter on a display, wherein the first file is stored in a location external to the non-transitory computer readable medium and eligible for association with CDF files in addition to the CDF file stored on the non-transitory computer readable medium. | 1. A processor-implemented method for managing parameters of a semiconductor component, a cell, a library of components, or a library of cells in electronic design automation (EDA) software to modify a functionality of an integrated circuit, the method comprising: using a processor executing instructions to operate the EDA software: receiving a query to the EDA software; augmenting the query with at least a first search instruction stored in a first file; augmenting a Component Description Format (CDF) file by the first file so that the augmented CDF file contains at least one additional field, wherein the CDF file is stored on a non-transitory computer readable medium, describes the component, cell, or library parameters, and contains parameter fields that have programming code that interacts with the EDA software via one of: (i) execution of the query with a scripting language binding that uses a design database of the integrated circuit or (ii) execution of the query with an application programming interface; performing the augmented query in at least one field in the augmented CDF file; determining whether there is at least one matching parameter within the component, cell, or library parameters based on the query; and displaying and emphasizing the at least one matching parameter on a display, wherein the first file is stored in a location external to the non-transitory computer readable medium and eligible for association with CDF files in addition to the CDF file stored on the non-transitory computer readable medium. 10. The method of claim 1 , further comprising: modifying the first search instruction with a second search instruction. | 0.911765 |
8,832,060 | 1 | 4 | 1. A method, including: receiving, by a hardware computer processor, context data indicative of a category of offerings in a provider, the context data associated with a user having a user identifier; automatically discovering context attributes associated with the context, by processing attribute data received from a plurality of other users, the attribute data being related to a category of the offerings; associating the context data and the context attributes with the user identifier; and generating result data that is associated with the context and relevant to the user. | 1. A method, including: receiving, by a hardware computer processor, context data indicative of a category of offerings in a provider, the context data associated with a user having a user identifier; automatically discovering context attributes associated with the context, by processing attribute data received from a plurality of other users, the attribute data being related to a category of the offerings; associating the context data and the context attributes with the user identifier; and generating result data that is associated with the context and relevant to the user. 4. The method of claim 1 , further including: receiving a rating from the user pertaining to the result data; and filtering the result data according to the rating. | 0.689394 |
9,489,290 | 1 | 3 | 1. A method comprising: analyzing a plurality of attributes of a first test program for testing an executable program, the analyzing performed using one or more processing devices; generating a plurality of values for the plurality of attributes of the first test program, the generating based on the analyzing, and the generating performed using the one or more processing devices; representing a plurality of quantitative measures for the first test program using the plurality of values; computing a plurality of scores for the plurality of quantitative measures of the first test program; computing a first weighted score for the first test program based on the plurality of scores, the first weighted score representing the ability of the first test program to test the executable program, the executable program being at least a portion of a graphical model that is executable in a graphical modeling environment, and the computing performed using the one or more processing devices; interacting with a second test program for testing the executable program, the second test program being a separate and distinct program from the first test program, the second test program having including the plurality of attributes; analyzing the plurality of attributes of the second test program; generating a plurality of values for the plurality of attributes of the second test program, the generating based on the analyzing the plurality of attributes of the second program; representing the plurality of quantitative measures for the second test program using the plurality of values of the second test program; computing a plurality of scores for the plurality of quantitative measures of the second test program, wherein the plurality of quantitative measures represents at least three of the following: a capacity of the first test program or the second test program to test one or more operations of the executable program; a capacity of the first test program or the second test program to test a plurality of linearly independent paths through the executable program; a capacity of the first test program or the second test program to determine a quantitative measure of complexity of the executable program from a plurality of operations and a plurality of operands in the executable program; a capacity of the first test program or the second test program to determine a measure of maintainability and a prediction of maintainability of the executable program; a capacity of the first test program or the second test program to determine a statistical time measure between failure measure of the executable program; a time required for the first test program or the second test program to execute the executable program; a capacity of the first test program or the second test program to test dependencies of the executable program; or a capacity of the first test program or the second test program to determine an association between testing of the executable program and requirements defining a behavior of the executable program; computing a second weighted score for the second test program, the computing the second weighted score based on the plurality of scores for the plurality of quantitative measures of the second test program, the second weighted score representing the ability of the second test program to test the executable program, and the computing the second weighted score performed using the one or more processing devices; comparing the first weighted score to the second weighted score; and selecting the first test program to test the executable program based on the comparing, the selecting the first test program indicating that the ability of the first test program to test the executable program exceeds the ability of the second test program to test the executable program, the selecting excluding the second test program from being executed, and the selecting performed using the one or more processing devices. | 1. A method comprising: analyzing a plurality of attributes of a first test program for testing an executable program, the analyzing performed using one or more processing devices; generating a plurality of values for the plurality of attributes of the first test program, the generating based on the analyzing, and the generating performed using the one or more processing devices; representing a plurality of quantitative measures for the first test program using the plurality of values; computing a plurality of scores for the plurality of quantitative measures of the first test program; computing a first weighted score for the first test program based on the plurality of scores, the first weighted score representing the ability of the first test program to test the executable program, the executable program being at least a portion of a graphical model that is executable in a graphical modeling environment, and the computing performed using the one or more processing devices; interacting with a second test program for testing the executable program, the second test program being a separate and distinct program from the first test program, the second test program having including the plurality of attributes; analyzing the plurality of attributes of the second test program; generating a plurality of values for the plurality of attributes of the second test program, the generating based on the analyzing the plurality of attributes of the second program; representing the plurality of quantitative measures for the second test program using the plurality of values of the second test program; computing a plurality of scores for the plurality of quantitative measures of the second test program, wherein the plurality of quantitative measures represents at least three of the following: a capacity of the first test program or the second test program to test one or more operations of the executable program; a capacity of the first test program or the second test program to test a plurality of linearly independent paths through the executable program; a capacity of the first test program or the second test program to determine a quantitative measure of complexity of the executable program from a plurality of operations and a plurality of operands in the executable program; a capacity of the first test program or the second test program to determine a measure of maintainability and a prediction of maintainability of the executable program; a capacity of the first test program or the second test program to determine a statistical time measure between failure measure of the executable program; a time required for the first test program or the second test program to execute the executable program; a capacity of the first test program or the second test program to test dependencies of the executable program; or a capacity of the first test program or the second test program to determine an association between testing of the executable program and requirements defining a behavior of the executable program; computing a second weighted score for the second test program, the computing the second weighted score based on the plurality of scores for the plurality of quantitative measures of the second test program, the second weighted score representing the ability of the second test program to test the executable program, and the computing the second weighted score performed using the one or more processing devices; comparing the first weighted score to the second weighted score; and selecting the first test program to test the executable program based on the comparing, the selecting the first test program indicating that the ability of the first test program to test the executable program exceeds the ability of the second test program to test the executable program, the selecting excluding the second test program from being executed, and the selecting performed using the one or more processing devices. 3. The method of claim 1 , further comprising: executing the first test program; generating a test result based on the executing the first test program; and logging the test result. | 0.836347 |
9,659,083 | 1 | 5 | 1. A computer-implemented method, comprising: scanning first unstructured data defining the message formats messages for messages that conform to a particular standard; scanning second unstructured data defining semantic validation rules to be applied to validate the messages and including spoken language rule descriptions; parsing the spoken language rule descriptions to identify keywords in the spoken language rule descriptions; converting the spoken language rule descriptions into at least one rule library function; and storing, into a database and as database entries: first structured data corresponding to the first unstructured data defining the message formats and second structured data corresponding to the second unstructured data defining the semantic validation rules, wherein the first and second structured data are configured to be processed to automatically generate a map comprising message formats and sematic validation rules for use in generating messages that conform to the particular standard and validating the messages. | 1. A computer-implemented method, comprising: scanning first unstructured data defining the message formats messages for messages that conform to a particular standard; scanning second unstructured data defining semantic validation rules to be applied to validate the messages and including spoken language rule descriptions; parsing the spoken language rule descriptions to identify keywords in the spoken language rule descriptions; converting the spoken language rule descriptions into at least one rule library function; and storing, into a database and as database entries: first structured data corresponding to the first unstructured data defining the message formats and second structured data corresponding to the second unstructured data defining the semantic validation rules, wherein the first and second structured data are configured to be processed to automatically generate a map comprising message formats and sematic validation rules for use in generating messages that conform to the particular standard and validating the messages. 5. The method of claim 1 , wherein wherein the spoken language rule descriptions are contained in at least one document selected from a group consisting of: an HTML document, a PDF document, and an XML document. | 0.5 |
8,537,678 | 16 | 23 | 16. The method according to claim 15 , wherein the step A specifically comprises: A1: parsing an original MMS data packet and acquiring all the files in the original MMS data packet; every time a file is acquired, determining a format of the file by checking a content-type field of the file and saving the file into a file body of a corresponding format; A2: acquiring all the non-SMIL files in the parsing result and counting the number of all the non-SMIL files as a first non-SMIL file number. | 16. The method according to claim 15 , wherein the step A specifically comprises: A1: parsing an original MMS data packet and acquiring all the files in the original MMS data packet; every time a file is acquired, determining a format of the file by checking a content-type field of the file and saving the file into a file body of a corresponding format; A2: acquiring all the non-SMIL files in the parsing result and counting the number of all the non-SMIL files as a first non-SMIL file number. 23. The method according to claim 16 , wherein the data structure describing a playing layout of MMS is a slide sequence structure. | 0.734818 |
8,543,606 | 2 | 3 | 2. The system of claim 1 , wherein the computer readable instructions further cause the processor to: create said one or more metadata rules; store said one or more metadata rules in a permissions setting configuration file; and communicate the permissions setting configuration file to the document management system. | 2. The system of claim 1 , wherein the computer readable instructions further cause the processor to: create said one or more metadata rules; store said one or more metadata rules in a permissions setting configuration file; and communicate the permissions setting configuration file to the document management system. 3. The system of claim 2 , wherein the computer readable instructions further cause the processor to configure a permission configuration web page for said one or more metadata rules. | 0.533163 |
9,280,326 | 13 | 15 | 13. A computer implemented method for generating compiler code selector rules from an architecture description, the compiler code selector rules for use in a compiler that translates source code into machine instructions of a target processor, the method comprising: generating a plurality of semantic statements from semantic information included in a target processor architecture model of a target processor, the target processor architecture model described in a processor architecture description language, said semantic information describing an instruction set, wherein said target processor architecture model comprises semantic information and syntax information for the machine instructions, and description of non-terminals of the target processor; associating assembly syntax with semantic information; applying, to said semantic information, at least one semantic transformation from a library of pre-defined semantic transformations to generate a single semantic statement from a sequence of at least two of said plurality of semantic statements; accessing basic rules having tree patterns that map from source code operations to semantic patterns; permuting said basic rules based on said non-terminals to form set of permuted mapping rules; and matching semantic patterns of said permuted mapping rules to said semantic statements to form a description of said complier code selector rules comprising mappings from source code operations to associated assembly syntax; and mapping a sequence of two or more source code operations to a single machine instruction based on the accessed rules that matches from semantic statements to semantic patterns. | 13. A computer implemented method for generating compiler code selector rules from an architecture description, the compiler code selector rules for use in a compiler that translates source code into machine instructions of a target processor, the method comprising: generating a plurality of semantic statements from semantic information included in a target processor architecture model of a target processor, the target processor architecture model described in a processor architecture description language, said semantic information describing an instruction set, wherein said target processor architecture model comprises semantic information and syntax information for the machine instructions, and description of non-terminals of the target processor; associating assembly syntax with semantic information; applying, to said semantic information, at least one semantic transformation from a library of pre-defined semantic transformations to generate a single semantic statement from a sequence of at least two of said plurality of semantic statements; accessing basic rules having tree patterns that map from source code operations to semantic patterns; permuting said basic rules based on said non-terminals to form set of permuted mapping rules; and matching semantic patterns of said permuted mapping rules to said semantic statements to form a description of said complier code selector rules comprising mappings from source code operations to associated assembly syntax; and mapping a sequence of two or more source code operations to a single machine instruction based on the accessed rules that matches from semantic statements to semantic patterns. 15. The method of claim 13 , wherein said matching semantic patterns of said permuted mapping rules to said extracted semantic information comprises mapping a single source code operation to more than one machine instruction. | 0.575472 |
8,978,989 | 35 | 36 | 35. The readable matrix code image according to claim 34 , wherein the specified message or the specified part of a message that is encoded in the selected cells area includes a URL of a network resource. | 35. The readable matrix code image according to claim 34 , wherein the specified message or the specified part of a message that is encoded in the selected cells area includes a URL of a network resource. 36. The readable matrix code image according to claim 35 , wherein the specified message or the specified part of a message that is encoded in the selected cells area includes a URL of a network resource and a key that is associated with the input image or with the readable matrix code. | 0.5 |
8,679,015 | 10 | 11 | 10. The interactive television system according to claim 1 , wherein the script program is related to the entertainment content, advertisement content or a combination of entertainment and advertisement content. | 10. The interactive television system according to claim 1 , wherein the script program is related to the entertainment content, advertisement content or a combination of entertainment and advertisement content. 11. The interactive television system according to claim 10 , wherein the script program is generated in relation to the entertainment or advertisement content. | 0.5 |
9,547,420 | 5 | 13 | 5. A computer-implemented method, comprising: detecting character input in an interface of a computing device; analyzing the character input to determine a plurality of suggestions, the plurality of suggestions are based at least in part upon the character input, the suggestions having respective confidence scores, wherein a first suggestion of the plurality of suggestions is designated as one of a correction type, a common base portion type, or a completion type, the common base portion type including at least a root word, the completion type including at least a corresponding completing word; determining a two-dimensional spatial layout of at least a portion of the plurality of suggestions, a location of a suggestion of the portion being determined based, at least in part, upon the respective confidence score of the suggestion, wherein first suggestions that share a same completion type are grouped together in a first group, second suggestions that share a same correction type are grouped together in a second group, and third suggestions that share a same common base portion type are grouped together in a third group; providing for display the at least the portion of the plurality of suggestions arranged according to the spatial layout, wherein the first suggestions that form the first group, the second suggestions that form the second group and the third suggestions that form the third group are displayed proximate to one another in the spatial layout; detecting a user selection of a specified selection of the plurality of suggestions displayed according to the spatial layout; and determining a modified character input based at least in part on the specified selection. | 5. A computer-implemented method, comprising: detecting character input in an interface of a computing device; analyzing the character input to determine a plurality of suggestions, the plurality of suggestions are based at least in part upon the character input, the suggestions having respective confidence scores, wherein a first suggestion of the plurality of suggestions is designated as one of a correction type, a common base portion type, or a completion type, the common base portion type including at least a root word, the completion type including at least a corresponding completing word; determining a two-dimensional spatial layout of at least a portion of the plurality of suggestions, a location of a suggestion of the portion being determined based, at least in part, upon the respective confidence score of the suggestion, wherein first suggestions that share a same completion type are grouped together in a first group, second suggestions that share a same correction type are grouped together in a second group, and third suggestions that share a same common base portion type are grouped together in a third group; providing for display the at least the portion of the plurality of suggestions arranged according to the spatial layout, wherein the first suggestions that form the first group, the second suggestions that form the second group and the third suggestions that form the third group are displayed proximate to one another in the spatial layout; detecting a user selection of a specified selection of the plurality of suggestions displayed according to the spatial layout; and determining a modified character input based at least in part on the specified selection. 13. The computer-implemented method of claim 5 , further comprising: providing for display new suggestions arranged according to the spatial layout in response to at least one of addition, deletion, or alteration of at least one character of the character input in the interface. | 0.507067 |
9,087,053 | 6 | 16 | 6. A computer-implemented method of providing document data from a document management system for display on an interface of a computer system through an enabler application that manages associations between fields of a host application and fields of documents in the document management system, comprising: displaying the host application on the interface of the computer system that includes one or more data processors and one or more non-transitory computer-readable mediums including instructions for commanding the one or more data processors, wherein the host application includes an interface field that is linked to a document field of documents in the document management system; capturing a field value for the interface field and an operation identification from the host application using the enabler application on the computer system, wherein the field value entered in the host application is captured at the enabler application without receiving any communication from the host application; accessing a context rule in a context rule database using the computer system based upon the operation identification, wherein the context rule identifies a type of document that is relevant to the identified operation; querying the document management system using the computer system based on the field value that is captured from the interface field of the host application and the relevant document type identified by the context rule that is accessed based on the operation identification from the host application; receiving document data from the document management system based on said querying using the computer system; and updating the interface of the computer system based on the document data. | 6. A computer-implemented method of providing document data from a document management system for display on an interface of a computer system through an enabler application that manages associations between fields of a host application and fields of documents in the document management system, comprising: displaying the host application on the interface of the computer system that includes one or more data processors and one or more non-transitory computer-readable mediums including instructions for commanding the one or more data processors, wherein the host application includes an interface field that is linked to a document field of documents in the document management system; capturing a field value for the interface field and an operation identification from the host application using the enabler application on the computer system, wherein the field value entered in the host application is captured at the enabler application without receiving any communication from the host application; accessing a context rule in a context rule database using the computer system based upon the operation identification, wherein the context rule identifies a type of document that is relevant to the identified operation; querying the document management system using the computer system based on the field value that is captured from the interface field of the host application and the relevant document type identified by the context rule that is accessed based on the operation identification from the host application; receiving document data from the document management system based on said querying using the computer system; and updating the interface of the computer system based on the document data. 16. The method of claim 6 , wherein the document data is automatically retrieved based on the field value when a user begins performing an operation associated with the operation identification. | 0.696875 |
8,977,952 | 1 | 5 | 1. A method of maintaining annotations across versions of an electronic book comprising: receiving at an access device a version of an electronic book and a signal instructing the access device to correlate a set of annotations associated with a different version of the electronic book with the received version of the electronic book, the received and different versions of the electronic books each including at least one document file, wherein each annotation in the set of annotations includes a document file indicator corresponding to the at least one document file with which the annotation is associated; using the document file indicator to compare each annotation of the set of annotations with the received version of the electronic book in order to determine where the annotation should be inserted into the received version of the electronic book, wherein if the received version of the electronic book does not include a document file indicator that matches a document file indicator of the different version of the electronic book, the annotation associated with the document file indicator of the different version is inserted at the beginning of the received version of the electronic book; and, inserting each annotation of the set of annotations into a location of the received version based on the comparing. | 1. A method of maintaining annotations across versions of an electronic book comprising: receiving at an access device a version of an electronic book and a signal instructing the access device to correlate a set of annotations associated with a different version of the electronic book with the received version of the electronic book, the received and different versions of the electronic books each including at least one document file, wherein each annotation in the set of annotations includes a document file indicator corresponding to the at least one document file with which the annotation is associated; using the document file indicator to compare each annotation of the set of annotations with the received version of the electronic book in order to determine where the annotation should be inserted into the received version of the electronic book, wherein if the received version of the electronic book does not include a document file indicator that matches a document file indicator of the different version of the electronic book, the annotation associated with the document file indicator of the different version is inserted at the beginning of the received version of the electronic book; and, inserting each annotation of the set of annotations into a location of the received version based on the comparing. 5. The method of claim 1 , wherein each annotation document file indicator further includes a surrounding text indicator, and wherein the inserting is based at least in part on the surrounding text indicator. | 0.572016 |
8,595,268 | 11 | 13 | 11. A system for compressing objects, comprising: at least one hardware processor that: receives a request to write a first object including a first key and a first value, wherein the first object is of a given type; receives a request to write a second object including a second key and a second value, wherein the second object is of the given type; classifies the first object to a compression dictionary according to at least one rule based on a value of the first object and/or the key of the first object; classifies the second object to the compression dictionary according to at least one rule based on a value of the second object and/or the key of the second object; and compresses the first object and the second object based on the compression dictionary; identifies first matching patterns in a pair of objects; determines if the number of first matching patterns exceeds a first threshold; when the number of first matching patterns is determined to exceed the first threshold, selects an object from the pair of objects and identifying second matching patterns in the selected object and the compression dictionary; determines if the number of second matching patterns exceeds a second threshold; and when the number of second matching patterns is determined to exceed the second threshold, assigns the pair of objects to the compression dictionary. | 11. A system for compressing objects, comprising: at least one hardware processor that: receives a request to write a first object including a first key and a first value, wherein the first object is of a given type; receives a request to write a second object including a second key and a second value, wherein the second object is of the given type; classifies the first object to a compression dictionary according to at least one rule based on a value of the first object and/or the key of the first object; classifies the second object to the compression dictionary according to at least one rule based on a value of the second object and/or the key of the second object; and compresses the first object and the second object based on the compression dictionary; identifies first matching patterns in a pair of objects; determines if the number of first matching patterns exceeds a first threshold; when the number of first matching patterns is determined to exceed the first threshold, selects an object from the pair of objects and identifying second matching patterns in the selected object and the compression dictionary; determines if the number of second matching patterns exceeds a second threshold; and when the number of second matching patterns is determined to exceed the second threshold, assigns the pair of objects to the compression dictionary. 13. The system of claim 11 , wherein the at least one hardware processor also writes the first object to an in-memory, non-relational data store as an uncompressed object before the first object is compressed, and overwrites the uncompressed object with a compressed form of the first object when the first object is compressed. | 0.5 |
8,161,049 | 5 | 6 | 5. The method as described in claim 1 , wherein the step (a) comprises introducing one, two or three patent indices. | 5. The method as described in claim 1 , wherein the step (a) comprises introducing one, two or three patent indices. 6. The method as described in claim 5 , wherein the step of introducing one, two or three patent indices further comprises introducing patent indices, characterizing technical merit, commercial value and legal strength of the patent document. | 0.749482 |
8,781,829 | 41 | 43 | 41. The computer readable medium of claim 28 , wherein the method further comprises generating a prompt for additional input, based on the conclusion, the prompt included in a rendering of the structured document. | 41. The computer readable medium of claim 28 , wherein the method further comprises generating a prompt for additional input, based on the conclusion, the prompt included in a rendering of the structured document. 43. The computer readable medium of claim 41 , wherein the method further comprises: receiving input representing the content; and maintaining the prompt in the rendering of the structured document. | 0.5 |
8,271,436 | 25 | 27 | 25. The system of claim 24 , wherein the shadowing system is configured to identify a selected log file of the plurality of log files and replicate the selected log file to form a replicated log file. | 25. The system of claim 24 , wherein the shadowing system is configured to identify a selected log file of the plurality of log files and replicate the selected log file to form a replicated log file. 27. The system of claim 25 , wherein the shadowing system is configured to generate a modified log file by modifying information of the selected log file. | 0.5 |
9,786,326 | 1 | 2 | 1. A device, comprising: a storage medium storing a set of instructions for playing multimedia data; and a processor in communication with the storage medium, wherein when executing the set of instructions, the processor is directed to: receive multimedia data for play back and store the multimedia data in a multimedia data buffer, wherein the multimedia data comprises audio data; play back the multimedia data from the multimedia data buffer; pause play back of the multimedia data at a pause position; extract a target section of the audio data from the multimedia data buffer that precedes the pause position, the target section being a specified duration in length and comprising a plurality of audio signals; identify a time interval between adjacent audio signals; determine whether the identified time interval is larger than a first predefined time interval; when the identified time interval is larger than the first predefined time interval, select a position within the time interval and set the selected position as a resume play back position; and resume play back of the multimedia data from the resume play back position when a resume condition has been met. | 1. A device, comprising: a storage medium storing a set of instructions for playing multimedia data; and a processor in communication with the storage medium, wherein when executing the set of instructions, the processor is directed to: receive multimedia data for play back and store the multimedia data in a multimedia data buffer, wherein the multimedia data comprises audio data; play back the multimedia data from the multimedia data buffer; pause play back of the multimedia data at a pause position; extract a target section of the audio data from the multimedia data buffer that precedes the pause position, the target section being a specified duration in length and comprising a plurality of audio signals; identify a time interval between adjacent audio signals; determine whether the identified time interval is larger than a first predefined time interval; when the identified time interval is larger than the first predefined time interval, select a position within the time interval and set the selected position as a resume play back position; and resume play back of the multimedia data from the resume play back position when a resume condition has been met. 2. The device of claim 1 , wherein the target section that is selected immediately precedes the pause position. | 0.856589 |
9,924,033 | 19 | 21 | 19. A data processing system, comprising: a processor; a memory coupled to the processor for storing instructions, which when executed by the processor, to perform operations, the operations including establishing a communication session between a user device of a user and an agent device of an agent to discuss content provided by a client, wherein the user and the agent are matched based on a user profile of the user and an agent profile of the agent; detecting at a server a first interactive event occurred during the communication session between the user device and the agent device; in response to the first interactive event, identifying a first data collection package that is associated with the first interactive event, wherein the first data collection package includes a plurality of queries, each query being associated with one of a plurality of workflow stages of a data collection workflow; for each of the queries in one of the workflow stages, examining a data collection rule corresponding to a current workflow stage to determine whether the query should be sent to the user, in response to the data collection rule indicating that the query should be sent to the user, transmitting the query to the user device of the user, and receiving a user response from the user device in response to the query; and updating at least one of the user profile associated with the user and the agent profile associated with the agent based on user responses received from the user device, wherein the updated user profile and the agent profile are used for subsequent matching for the user and the agent. | 19. A data processing system, comprising: a processor; a memory coupled to the processor for storing instructions, which when executed by the processor, to perform operations, the operations including establishing a communication session between a user device of a user and an agent device of an agent to discuss content provided by a client, wherein the user and the agent are matched based on a user profile of the user and an agent profile of the agent; detecting at a server a first interactive event occurred during the communication session between the user device and the agent device; in response to the first interactive event, identifying a first data collection package that is associated with the first interactive event, wherein the first data collection package includes a plurality of queries, each query being associated with one of a plurality of workflow stages of a data collection workflow; for each of the queries in one of the workflow stages, examining a data collection rule corresponding to a current workflow stage to determine whether the query should be sent to the user, in response to the data collection rule indicating that the query should be sent to the user, transmitting the query to the user device of the user, and receiving a user response from the user device in response to the query; and updating at least one of the user profile associated with the user and the agent profile associated with the agent based on user responses received from the user device, wherein the updated user profile and the agent profile are used for subsequent matching for the user and the agent. 21. The system of claim 19 , wherein the first interactive event is one of a plurality of predetermined interactive events, and wherein the first data collection package is one of a plurality of data collection packages corresponding to the predetermined interactive events. | 0.720408 |
8,429,179 | 36 | 38 | 36. A non-transitory computer readable medium, comprising instructions for: receiving an input from one or more of the plurality of data sources; creating a graph representation of the input; obtaining a graph representation of a domain ontology, wherein the domain ontology comprises a set of concepts and a set of relationships and the domain ontology comprises a Simple Knowledge Organization System (SKOS) representation of the unified medical language system (UMLS); mapping the graph representation of the input to the graph representation of the domain ontology to create a unified graph comprising the graph representation of the input and the graph of the domain ontology; constructing a survey based on a survey ontology, including adding concepts to the survey ontology, wherein the added concepts are mapped to the domain ontology; constructing a query based on at least one of the set of concepts or at least one of the set of relationships of the domain ontology; and searching the unified graph based on the query to obtain data of the input associated with at least one concept or the at least one relationship. | 36. A non-transitory computer readable medium, comprising instructions for: receiving an input from one or more of the plurality of data sources; creating a graph representation of the input; obtaining a graph representation of a domain ontology, wherein the domain ontology comprises a set of concepts and a set of relationships and the domain ontology comprises a Simple Knowledge Organization System (SKOS) representation of the unified medical language system (UMLS); mapping the graph representation of the input to the graph representation of the domain ontology to create a unified graph comprising the graph representation of the input and the graph of the domain ontology; constructing a survey based on a survey ontology, including adding concepts to the survey ontology, wherein the added concepts are mapped to the domain ontology; constructing a query based on at least one of the set of concepts or at least one of the set of relationships of the domain ontology; and searching the unified graph based on the query to obtain data of the input associated with at least one concept or the at least one relationship. 38. The computer readable medium of claim 36 , wherein the survey is a graph representation of a set of questions mapped to the survey ontology. | 0.83524 |
9,158,860 | 10 | 11 | 10. A system including memory and one or more processors operable to execute instructions, stored in the memory, comprising instructions to perform the operations of: identifying a partial query entered into a search field; providing for display a query completion template, the query completion template provided for display in response to identifying the partial query and being for a category of information associated with one or more terms within the partial query, the query completion template including an interactive field that is user editable and including one or more additional fields, the query completion template defining the number of terms, type of terms, and ordering of terms within a search query formed using the query template; identifying user interaction with the interactive field; updating the display of the query completion template to include the results of the user interaction within the interactive field of the query completion template; identifying user selection of the updated query completion template; and transmitting the updated display of the query completion template as a search query in response to the user selection, the search query including one or more query terms that are based on the results of the user interaction with the interactive field and one or more additional query terms based on the one or more additional fields, the one or more query terms and the one or more additional query terms being ordered based on the ordering of terms defined by the query completion template. | 10. A system including memory and one or more processors operable to execute instructions, stored in the memory, comprising instructions to perform the operations of: identifying a partial query entered into a search field; providing for display a query completion template, the query completion template provided for display in response to identifying the partial query and being for a category of information associated with one or more terms within the partial query, the query completion template including an interactive field that is user editable and including one or more additional fields, the query completion template defining the number of terms, type of terms, and ordering of terms within a search query formed using the query template; identifying user interaction with the interactive field; updating the display of the query completion template to include the results of the user interaction within the interactive field of the query completion template; identifying user selection of the updated query completion template; and transmitting the updated display of the query completion template as a search query in response to the user selection, the search query including one or more query terms that are based on the results of the user interaction with the interactive field and one or more additional query terms based on the one or more additional fields, the one or more query terms and the one or more additional query terms being ordered based on the ordering of terms defined by the query completion template. 11. The system of claim 10 , wherein the category of information is one or more of language translation, stock price information, map information, navigational information, news information, weather information, travel information, or dictionary definitions. | 0.775261 |
9,881,055 | 9 | 15 | 9. A system comprising: a processor; and a non-transitory computer readable storage medium comprising one or more modules executable by said processor, wherein said one or more modules comprises: an S-expression tabular structure conversion module for converting a SQL expression into an S-expression tabular structure, wherein said S-expression comprises a nested list; a function table module for generating a function table based on said S-expression tabular structure, wherein said function table comprises a plurality of functions associated with said S-expression tabular structure tabulated against at least one of a function name, a derived column and a derived table; an argument table module for generating an argument table based on said S-expression tabular structure, wherein said argument table comprises a plurality of arguments associated with said S expression tabular structure tabulated against at least one of an argument type, a function identifier linking the arguments to the function table, a computed from function, a reference to entity or a literal value; and a language conversion module for converting at least one function associated with said S-expression tabular structure to a pre-determined language based on a language map of said pre-determined language and said function table and said argument table. | 9. A system comprising: a processor; and a non-transitory computer readable storage medium comprising one or more modules executable by said processor, wherein said one or more modules comprises: an S-expression tabular structure conversion module for converting a SQL expression into an S-expression tabular structure, wherein said S-expression comprises a nested list; a function table module for generating a function table based on said S-expression tabular structure, wherein said function table comprises a plurality of functions associated with said S-expression tabular structure tabulated against at least one of a function name, a derived column and a derived table; an argument table module for generating an argument table based on said S-expression tabular structure, wherein said argument table comprises a plurality of arguments associated with said S expression tabular structure tabulated against at least one of an argument type, a function identifier linking the arguments to the function table, a computed from function, a reference to entity or a literal value; and a language conversion module for converting at least one function associated with said S-expression tabular structure to a pre-determined language based on a language map of said pre-determined language and said function table and said argument table. 15. The system of claim 9 , wherein said pre-determined language is an SQL based language. | 0.966343 |
7,899,812 | 12 | 21 | 12. A method for interactive browsing, comprising the steps of: acquiring one or more terms in which a user has interest; extracting information relating to the one or more terms in which the user has interest from a knowledge base, in order to display the information in a first display part of a user interface, the knowledge base stores a plurality of terms and information relating to each term; and extracting documents containing the one or more terms in which the user has interest from a document database, in order to display a list of the extracted documents in a second display part of the user interface, the document database storing a plurality of documents; wherein the information extracted in the first extracting step and the list of the documents extracted in the second extracting step are concurrently displayed in the same user interface such that: (i) selection by the user of a portion of the information displayed in the first display part effectuates a change in the list of documents displayed in the second display part; and (ii) selection by the user of a term in the list of documents displayed in the second display part effectuates a change in the information displayed in the first display part; wherein one or more of the steps are performed by a computer coupled to the knowledge base and the document database. | 12. A method for interactive browsing, comprising the steps of: acquiring one or more terms in which a user has interest; extracting information relating to the one or more terms in which the user has interest from a knowledge base, in order to display the information in a first display part of a user interface, the knowledge base stores a plurality of terms and information relating to each term; and extracting documents containing the one or more terms in which the user has interest from a document database, in order to display a list of the extracted documents in a second display part of the user interface, the document database storing a plurality of documents; wherein the information extracted in the first extracting step and the list of the documents extracted in the second extracting step are concurrently displayed in the same user interface such that: (i) selection by the user of a portion of the information displayed in the first display part effectuates a change in the list of documents displayed in the second display part; and (ii) selection by the user of a term in the list of documents displayed in the second display part effectuates a change in the information displayed in the first display part; wherein one or more of the steps are performed by a computer coupled to the knowledge base and the document database. 21. The method according to claim 12 , wherein the step for acquiring terms further acquires the terms in which the user has interest from a fifth display part which is used for the user to directly input specific terms in which the user has interest. | 0.576014 |
10,156,983 | 1 | 6 | 1. A method of character recognition, the character having a main stroke defining a main form of the character and optional secondary strokes external to the main form of the character, the method comprising: removing one or more duplicate successive points of a plurality of points in a handwritten character to form an enhanced handwritten character; spacing the plurality of points of the enhanced handwritten character a uniform distance apart; detecting, via circuitry, one or more primary strokes corresponding to the main form of the character and one or more ancillary strokes of the enhanced handwritten character; generating a primary merged stroke from the one or more primary strokes; extracting, via the circuitry, one or more raw point-based features from local features of the primary merged stroke, wherein the raw point-based features are geometric characteristics selected from the group consisting of an axis coordinate, a relative position, an aspect ratio, a slope and an angle; extracting, via the circuitry, one or more statistical features from statistics in the form of such a histogram, mean, mode, maximum, minimum, variance, and standard deviation from the raw point-based features computed over the one or more raw point-based features to form one or more primary merged stroke features; extracting, via the circuitry, one or more features from the ancillary strokes to form one or more ancillary stroke features; training one or more stroke models on features of the main stroke and features of the secondary strokes and classifying data from the one or more primary merged stroke features and the one or more ancillary stroke features using the trained one or more stroke models; determining, via the circuitry, a set of main stroke candidates and a set of secondary stroke candidates from the data classified by the one or more stroke models; computing, via the circuitry, likelihood values indicative of whether respective main strokes of the set of main stroke candidates combined with respective secondary strokes from the set of secondary stroke candidates form the character; and determining, via the circuitry, the character from the likelihood values. | 1. A method of character recognition, the character having a main stroke defining a main form of the character and optional secondary strokes external to the main form of the character, the method comprising: removing one or more duplicate successive points of a plurality of points in a handwritten character to form an enhanced handwritten character; spacing the plurality of points of the enhanced handwritten character a uniform distance apart; detecting, via circuitry, one or more primary strokes corresponding to the main form of the character and one or more ancillary strokes of the enhanced handwritten character; generating a primary merged stroke from the one or more primary strokes; extracting, via the circuitry, one or more raw point-based features from local features of the primary merged stroke, wherein the raw point-based features are geometric characteristics selected from the group consisting of an axis coordinate, a relative position, an aspect ratio, a slope and an angle; extracting, via the circuitry, one or more statistical features from statistics in the form of such a histogram, mean, mode, maximum, minimum, variance, and standard deviation from the raw point-based features computed over the one or more raw point-based features to form one or more primary merged stroke features; extracting, via the circuitry, one or more features from the ancillary strokes to form one or more ancillary stroke features; training one or more stroke models on features of the main stroke and features of the secondary strokes and classifying data from the one or more primary merged stroke features and the one or more ancillary stroke features using the trained one or more stroke models; determining, via the circuitry, a set of main stroke candidates and a set of secondary stroke candidates from the data classified by the one or more stroke models; computing, via the circuitry, likelihood values indicative of whether respective main strokes of the set of main stroke candidates combined with respective secondary strokes from the set of secondary stroke candidates form the character; and determining, via the circuitry, the character from the likelihood values. 6. The method of claim 1 , wherein the statistical features include one or more of a histogram of a Freeman Code, a mean of a tangent, a mode of one or more angles, a variance of distances, a mean of the Freeman Code, a histogram of a cosine, a variance of angles, a mean of distances, a mode of the Freeman Code, a mean of a sine, a variance of an x-axis, a mean of curliness, a maximum of the Freeman Code, a variance of the cosine, a variance of curvature, and a variance of the Freeman Code. | 0.5 |
9,317,550 | 1 | 10 | 1. A method comprising: obtaining a target query; and determining a normalized query according to the obtained target query, the determining including: obtaining session information in a search log; determining a vote similarity degree between a single query and the target query based on the session information, including: obtaining all queries appearing in a single session, calculating a number of votes for each query, the calculating including counting the single query appearing before the target query in the single session as a vote from the single query to the target query, and determining the vote similarity degree between the single query and the target query according to the calculated number of votes; determining a correlation degree between the single query and the target query based in part on the vote similarity degree; and determining the normalized query based in part on the correlation degree between the single query and the target query. | 1. A method comprising: obtaining a target query; and determining a normalized query according to the obtained target query, the determining including: obtaining session information in a search log; determining a vote similarity degree between a single query and the target query based on the session information, including: obtaining all queries appearing in a single session, calculating a number of votes for each query, the calculating including counting the single query appearing before the target query in the single session as a vote from the single query to the target query, and determining the vote similarity degree between the single query and the target query according to the calculated number of votes; determining a correlation degree between the single query and the target query based in part on the vote similarity degree; and determining the normalized query based in part on the correlation degree between the single query and the target query. 10. The method as recited in claim 1 , further comprising: obtaining click information of search results in the search log; extracting one or more search results including the target query according to the click information; and determining a click similarity degree between the single query and the target query according to a number of total clicks of search results including the target query, and a number of clicks of search results corresponding to the single query and including the target query, wherein the determining the correlation degree between the single query and the target query is based on the vote similarity degree and the click similarity degree. | 0.538674 |
7,873,666 | 1 | 20 | 1. A computer implemented method for data conversion, the method comprising: receiving from an application a conversion request for data stored in a database; invoking the database to export the data into a conversion source file by bypassing an application programming interface between the application and the database, wherein data associated with processing the conversion request passes between the database and the application without passing the application programming interface; obtaining, from the application, a set of rules for generating converted data, at least one rule of the set of rules comprising a first part having at least one query specifying at least one subset of the data to convert, a second part having at least one mathematical expression that defines how the at least one subset of the data matching the at least one query is converted, and a third part having at least one value table including mapping rules for mapping between old values and new values, the set of rules being defined in a relation table that reflects the relationship between the at least one query stored in a query table, the at least one mathematical expression stored in an expression table, the at least one value table, and the order in which the set of rules are applied to the data, wherein the relation table includes a first foreign key referencing the query table, a second foreign key referencing the expression table, and a third foreign key referencing the at least one value table; converting the data of the conversion source file according to the set of rules; storing the converted data in a conversion target file, wherein the converting step comprises: checking to see whether the at least one subset of the data matches the at least one query; and applying the at least one mathematical expression and the at least one value table, related to the at least one query, to the at least one subset of the data; storing an indication of an error in an error log file when an error is detected during conversion of the data to the conversion target file; and providing the error log file to the application for error handling. | 1. A computer implemented method for data conversion, the method comprising: receiving from an application a conversion request for data stored in a database; invoking the database to export the data into a conversion source file by bypassing an application programming interface between the application and the database, wherein data associated with processing the conversion request passes between the database and the application without passing the application programming interface; obtaining, from the application, a set of rules for generating converted data, at least one rule of the set of rules comprising a first part having at least one query specifying at least one subset of the data to convert, a second part having at least one mathematical expression that defines how the at least one subset of the data matching the at least one query is converted, and a third part having at least one value table including mapping rules for mapping between old values and new values, the set of rules being defined in a relation table that reflects the relationship between the at least one query stored in a query table, the at least one mathematical expression stored in an expression table, the at least one value table, and the order in which the set of rules are applied to the data, wherein the relation table includes a first foreign key referencing the query table, a second foreign key referencing the expression table, and a third foreign key referencing the at least one value table; converting the data of the conversion source file according to the set of rules; storing the converted data in a conversion target file, wherein the converting step comprises: checking to see whether the at least one subset of the data matches the at least one query; and applying the at least one mathematical expression and the at least one value table, related to the at least one query, to the at least one subset of the data; storing an indication of an error in an error log file when an error is detected during conversion of the data to the conversion target file; and providing the error log file to the application for error handling. 20. The method according to claim 1 , further comprising disallowing the application to access the data stored in the database via the application programming interface. | 0.655102 |
8,150,676 | 1 | 3 | 1. A method for automatically generating text, the method comprising acts of: accessing human-language text automatically generated using at least one template that includes at least some fixed text and at least one tag that serves as a placeholder to be filled in with automatically generated text; automatically identifying instances of at least one portion of the human-language text appearing multiple times in the human language text, wherein the automatically identifying is performed via at least one processor; and automatically generating output text in a human-readable language at least in part by substituting one or more synonyms of the at least one portion for one or more of the identified instances of the at least one portion in the human-language text; wherein the one or more synonyms comprises a first synonym; wherein identifying instances of the at least one portion comprises identifying two instances of the at least one portion that appear in close proximity to each other in the human-language text; wherein substituting the one or more synonyms comprises substituting the first synonym for one of the two identified instances of the at least one portion in the human-language text; and wherein identifying the two instances of the at least one portion comprises identifying two instances that appear within a threshold number of characters or words of one another in the human-language text. | 1. A method for automatically generating text, the method comprising acts of: accessing human-language text automatically generated using at least one template that includes at least some fixed text and at least one tag that serves as a placeholder to be filled in with automatically generated text; automatically identifying instances of at least one portion of the human-language text appearing multiple times in the human language text, wherein the automatically identifying is performed via at least one processor; and automatically generating output text in a human-readable language at least in part by substituting one or more synonyms of the at least one portion for one or more of the identified instances of the at least one portion in the human-language text; wherein the one or more synonyms comprises a first synonym; wherein identifying instances of the at least one portion comprises identifying two instances of the at least one portion that appear in close proximity to each other in the human-language text; wherein substituting the one or more synonyms comprises substituting the first synonym for one of the two identified instances of the at least one portion in the human-language text; and wherein identifying the two instances of the at least one portion comprises identifying two instances that appear within a threshold number of characters or words of one another in the human-language text. 3. The method of claim 1 , wherein the at least one portion is a phrase and each of the one or more synonyms is a synonym phrase that is synonymous with the phrase. | 0.56383 |
9,021,553 | 12 | 14 | 12. The method of claim 11 , further comprising the step of employing a fraud remediation method when said confidence score is within a predefined tolerance of said threshold. | 12. The method of claim 11 , further comprising the step of employing a fraud remediation method when said confidence score is within a predefined tolerance of said threshold. 14. The method of claim 12 , wherein said fraud remediation method comprises classifying said response as plausible or correct. | 0.630814 |
8,954,440 | 13 | 14 | 13. A computer program product for selectively delivering an article, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for: receiving a user preference; receiving a document; identifying a plurality of textual representations included in the document; determining a plurality of entity pairs each comprising a concept included in a concept taxonomy and a textual representation of the plurality of textual representations, each concept having a corresponding category vector including nodes adjacent to the concept in a taxonomy; computing a document vector (dv) for the document as a sum of the category vectors for the plurality of entity pairs selecting a subset of concepts from the plurality of concepts of the entity pairs according to a comparison of a document vector to the category vectors of the plurality of concepts by: calculating a similarity score ds for each concept according to ds=dv·cv, where dv is the document vector and cv is a concept vector; selecting the subset of concepts as concepts having similarity scores ds with respect to the document vector higher than a threshold, categorizing the document based at least in part on the subset of concepts; determine that the selected subset of concepts corresponds to the user preference; and in response once to determining that selected subset of concepts corresponds to the user preference, notifying a user associated with the user preference of the document. | 13. A computer program product for selectively delivering an article, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for: receiving a user preference; receiving a document; identifying a plurality of textual representations included in the document; determining a plurality of entity pairs each comprising a concept included in a concept taxonomy and a textual representation of the plurality of textual representations, each concept having a corresponding category vector including nodes adjacent to the concept in a taxonomy; computing a document vector (dv) for the document as a sum of the category vectors for the plurality of entity pairs selecting a subset of concepts from the plurality of concepts of the entity pairs according to a comparison of a document vector to the category vectors of the plurality of concepts by: calculating a similarity score ds for each concept according to ds=dv·cv, where dv is the document vector and cv is a concept vector; selecting the subset of concepts as concepts having similarity scores ds with respect to the document vector higher than a threshold, categorizing the document based at least in part on the subset of concepts; determine that the selected subset of concepts corresponds to the user preference; and in response once to determining that selected subset of concepts corresponds to the user preference, notifying a user associated with the user preference of the document. 14. The computer program product of claim 13 , further comprising pruning concepts according to ambiguity resolution by comparing similarity scores corresponding to ambiguous entity pairs. | 0.5 |
9,117,174 | 31 | 32 | 31. The system of claim 30 , wherein, amongst the nodes, each of the nodes is separated from a root node by a number of edges that is commensurate with a number of terms included in the association rule. | 31. The system of claim 30 , wherein, amongst the nodes, each of the nodes is separated from a root node by a number of edges that is commensurate with a number of terms included in the association rule. 32. The system of claim 31 , wherein the best-first metaheuristic prioritizes association rules based on terms of the association rules and an ordering of the terms on the list. | 0.855863 |
9,396,491 | 7 | 12 | 7. A system comprising: a processor; and a computer-readable storage device storing instructions which, when executed by the processor, cause the processor to perform operations comprising: (1) establishing, from a merchant site, communication between the merchant site and a generalized search entity via a communication interface, wherein the generalized search entity: A. presents an input field on user interface of the generalized search entity, wherein the generalized search entity processes data using a generalized search engine that indexes and searches both merchant sites and non-merchant sites; B. receives, from a user, user input in the input field, wherein the user input is textual; C. correlates the user input against a product database of products for sale from a merchant to yield a correlation; D. determines that the use input is associated with one of a search intent and a purchase intent to yield a determination, wherein the determination of whether the user input indicates the purchase intent or search intent is based on the correlation; E. when the determination indicates the search intent: presents a search result comprising a non-merchant site; receives a search interaction associated with the non-merchant site; and transitions the user to the non-merchant site; F. when the determination indicates the purchase intent: presents a purchase-related search result comprising a buy option associated with the user input, the search result comprising an item offered from the merchant site; and receives a purchase interaction associated with the buy option; (2) when the determination indicates the purchase intent: receiving, via the communication interface and at the merchant site, payment information from the generalized search entity, the payment information associated with the purchase interaction for the item; and processing delivery of the item. | 7. A system comprising: a processor; and a computer-readable storage device storing instructions which, when executed by the processor, cause the processor to perform operations comprising: (1) establishing, from a merchant site, communication between the merchant site and a generalized search entity via a communication interface, wherein the generalized search entity: A. presents an input field on user interface of the generalized search entity, wherein the generalized search entity processes data using a generalized search engine that indexes and searches both merchant sites and non-merchant sites; B. receives, from a user, user input in the input field, wherein the user input is textual; C. correlates the user input against a product database of products for sale from a merchant to yield a correlation; D. determines that the use input is associated with one of a search intent and a purchase intent to yield a determination, wherein the determination of whether the user input indicates the purchase intent or search intent is based on the correlation; E. when the determination indicates the search intent: presents a search result comprising a non-merchant site; receives a search interaction associated with the non-merchant site; and transitions the user to the non-merchant site; F. when the determination indicates the purchase intent: presents a purchase-related search result comprising a buy option associated with the user input, the search result comprising an item offered from the merchant site; and receives a purchase interaction associated with the buy option; (2) when the determination indicates the purchase intent: receiving, via the communication interface and at the merchant site, payment information from the generalized search entity, the payment information associated with the purchase interaction for the item; and processing delivery of the item. 12. The system of claim 7 , wherein the communication interface is an application programming interface for managing a purchase and delivery of the item. | 0.601563 |
9,378,293 | 8 | 17 | 8. A system for creating an output page, the system comprising: a processor; a machine-readable medium with instructions stored thereon, wherein the processor is operable to execute the instructions to configure: a markup language editor to receive page markup language data and to validate the page markup language data according to a schema for the page markup language; the markup language editor operable to receive a selection of one or more available components defined using component markup language, the available components including pre-defined layouts of an output page and at least one component of the one or more available components referenced by a plurality of output pages; a markup language translator to receive the page markup language data, replace calls to components with page markup language data, and to translate the page markup language data to first output markup language data and when the at least one component is changed, updating the plurality of output pages with the change made to the at least one component; and the translator operable to validate at least one component call in the page markup language data. | 8. A system for creating an output page, the system comprising: a processor; a machine-readable medium with instructions stored thereon, wherein the processor is operable to execute the instructions to configure: a markup language editor to receive page markup language data and to validate the page markup language data according to a schema for the page markup language; the markup language editor operable to receive a selection of one or more available components defined using component markup language, the available components including pre-defined layouts of an output page and at least one component of the one or more available components referenced by a plurality of output pages; a markup language translator to receive the page markup language data, replace calls to components with page markup language data, and to translate the page markup language data to first output markup language data and when the at least one component is changed, updating the plurality of output pages with the change made to the at least one component; and the translator operable to validate at least one component call in the page markup language data. 17. The system of claim 8 , wherein the component markup language conforms to an XML schema. | 0.857585 |
8,046,228 | 1 | 3 | 1. A speech user agent, comprising: an output for outputting a uniform resource location (URL) directive; an input for receiving grammar HTML; and an output for outputting a URL with arguments. | 1. A speech user agent, comprising: an output for outputting a uniform resource location (URL) directive; an input for receiving grammar HTML; and an output for outputting a URL with arguments. 3. The speech user agent of claim 1 , wherein said input for receiving grammar HTML is coupled to an output of a web browser. | 0.601911 |
6,088,731 | 16 | 18 | 16. The method of claim 1 wherein said output device of said computer system includes a display and further comprising the step of said intelligent assistant process being represented as an animated character on said display. | 16. The method of claim 1 wherein said output device of said computer system includes a display and further comprising the step of said intelligent assistant process being represented as an animated character on said display. 18. The method of claim 16 wherein said site information modifies the shape of said animated character. | 0.5 |
9,311,292 | 1 | 7 | 1. A device comprising: a processor; storage accessible to the processor and bearing instructions executable by the processor to: access past messages associated with the device; determine that at least a first multi-term phrase appears in plural messages among the past messages at least a threshold number of times; and based at least in part on the determination that the first multi-term phrase, appears in plural messages among the past messages at least the threshold number of times and based at least in part on data pertaining to at least, one Internet search performed at least in part using the device, present on the device at least plural terms from the first multi-term phrase in an order in which the at least plural terms appear in the first multi-term phrase. | 1. A device comprising: a processor; storage accessible to the processor and bearing instructions executable by the processor to: access past messages associated with the device; determine that at least a first multi-term phrase appears in plural messages among the past messages at least a threshold number of times; and based at least in part on the determination that the first multi-term phrase, appears in plural messages among the past messages at least the threshold number of times and based at least in part on data pertaining to at least, one Internet search performed at least in part using the device, present on the device at least plural terms from the first multi-term phrase in an order in which the at least plural terms appear in the first multi-term phrase. 7. The device of claim 1 , wherein the threshold number of times is more than one time. | 0.886719 |
9,710,518 | 10 | 12 | 10. A machine readable medium not having any transitory signals and comprising instructions that, when executed by at least one processor of a machine, cause the machine to perform operations to: receive a raw search field value; determine a standardized search field from a plurality of standardized search fields for the raw search field value; map the raw search field value to a standard field value, the standard field value corresponding to the standardized search field; determine a plurality of similarity scores between the standard field value and a plurality of other standard field values based upon a cosine similarity using field values associated with member profiles; using the plurality of similarity scores, select a second standard field value; perform a search using the raw search field value, the standard field value, and the second standard field value to identify a plurality of search results; display the plurality of search results. | 10. A machine readable medium not having any transitory signals and comprising instructions that, when executed by at least one processor of a machine, cause the machine to perform operations to: receive a raw search field value; determine a standardized search field from a plurality of standardized search fields for the raw search field value; map the raw search field value to a standard field value, the standard field value corresponding to the standardized search field; determine a plurality of similarity scores between the standard field value and a plurality of other standard field values based upon a cosine similarity using field values associated with member profiles; using the plurality of similarity scores, select a second standard field value; perform a search using the raw search field value, the standard field value, and the second standard field value to identify a plurality of search results; display the plurality of search results. 12. The machine readable medium of claim 10 , wherein operations to select the second standard field value include operations to determine that a similarity score between the standard field value the second standard field value exceeds all other similarity scores in the plurality of similarity scores. | 0.5 |
8,332,220 | 39 | 41 | 39. The at least one computer readable recordable medium of claim 37 , wherein the method further comprises creating a presentation document, including: creating, in dependence upon an original document, a structured document comprising one or more structural elements; classifying a structural element of the structured document according to a presentation attribute; and creating a presentation grammar for the structured document, wherein the presentation grammar for the structured document includes grammar elements each of which includes an identifier for at least one structural element of the structured document. | 39. The at least one computer readable recordable medium of claim 37 , wherein the method further comprises creating a presentation document, including: creating, in dependence upon an original document, a structured document comprising one or more structural elements; classifying a structural element of the structured document according to a presentation attribute; and creating a presentation grammar for the structured document, wherein the presentation grammar for the structured document includes grammar elements each of which includes an identifier for at least one structural element of the structured document. 41. The at least one computer readable recordable medium of claim 39 , wherein creating a presentation grammar for the structured document comprises: identifying the content type of the original document; selecting, in dependence upon the content type, a full presentation grammar from among a multiplicity of full presentation grammars; and filtering the full presentation grammar into a presentation grammar for the structured document in dependence upon the structural elements of the structured document. | 0.5 |
9,881,616 | 10 | 11 | 10. The method according to claim 6 , wherein said determining that sound within the received at least one microphone output signal matches the voice model comprises: by the voice biometrics system and from one among the received at least one microphone output signal, obtaining a voice sample; and by the voice biometrics system, determining that the voice sample matches the voice model. | 10. The method according to claim 6 , wherein said determining that sound within the received at least one microphone output signal matches the voice model comprises: by the voice biometrics system and from one among the received at least one microphone output signal, obtaining a voice sample; and by the voice biometrics system, determining that the voice sample matches the voice model. 11. The method according to claim 10 , wherein said receiving at least one of the plurality of microphone output signals comprises receiving, by the voice biometrics system, at least two of the plurality of microphone output signals, and wherein said receiving at least two of the plurality of microphone output signals comprises receiving, by the voice biometrics system, each one of the at least two microphone output signals separately from each other one of the at least two microphone output signals. | 0.5 |
7,603,330 | 1 | 14 | 1. A computer-implemented method for automatically classifying a first question, the method comprising: receiving unlabeled audio or digital text data from an input module, said unlabeled audio or digital text data comprising data that is not previously associated with an expected answer; automatically labeling said unlabeled audio or digital text data using a processor to produce first labeled audio or digital text data associating a first answer with the unlabeled audio or digital text data using a first artificial neural network, said first artificial neural network comprising a first set of weights, said first artificial neural network producing the first labeled audio or digital text data by performing one or more auxiliary tasks analyzing characteristics of said unlabeled audio or digital text data; transferring said first set of weights to a second artificial neural network; receiving second labeled audio or digital text data comprising a second question and a corresponding answer; training said second artificial neural network with the processor using said second labeled audio or digital text data by modifying a second set of weights associated with the second artificial neural network responsive to the second labeled audio or digital text data and freezing the first set of weights; receiving the first question from the input module; and associating a question category with the first question using said second artificial neural network, said question category identifying a source for retrieving text data or audio data describing an answer corresponding to the first question. | 1. A computer-implemented method for automatically classifying a first question, the method comprising: receiving unlabeled audio or digital text data from an input module, said unlabeled audio or digital text data comprising data that is not previously associated with an expected answer; automatically labeling said unlabeled audio or digital text data using a processor to produce first labeled audio or digital text data associating a first answer with the unlabeled audio or digital text data using a first artificial neural network, said first artificial neural network comprising a first set of weights, said first artificial neural network producing the first labeled audio or digital text data by performing one or more auxiliary tasks analyzing characteristics of said unlabeled audio or digital text data; transferring said first set of weights to a second artificial neural network; receiving second labeled audio or digital text data comprising a second question and a corresponding answer; training said second artificial neural network with the processor using said second labeled audio or digital text data by modifying a second set of weights associated with the second artificial neural network responsive to the second labeled audio or digital text data and freezing the first set of weights; receiving the first question from the input module; and associating a question category with the first question using said second artificial neural network, said question category identifying a source for retrieving text data or audio data describing an answer corresponding to the first question. 14. The method of claim 1 , wherein said second artificial neural network comprises a set of output nodes, and said question category is associated with the first question according to the strongest output node of said set of output nodes. | 0.742457 |
7,512,583 | 13 | 15 | 13. A decision support system, comprising: a plurality of disparate data sources, each of the data sources configured to provide data comprising time and event information; and an electronic device configured to receive data from each of the data sources and to authenticate the received data, the electronic device further configured to analyze the time and event information so as to provide at least one recommended action and outcome information for the recommended action. | 13. A decision support system, comprising: a plurality of disparate data sources, each of the data sources configured to provide data comprising time and event information; and an electronic device configured to receive data from each of the data sources and to authenticate the received data, the electronic device further configured to analyze the time and event information so as to provide at least one recommended action and outcome information for the recommended action. 15. The system of claim 13 , wherein the disparate data sources comprise at least one of an internet source, a real-time sensor, a computer database, a relational database, and a flat-file database. | 0.594262 |
9,378,276 | 14 | 25 | 14. A system for generating navigation filters, the system comprising: a processing system configured to: receive a set of data entries comprising raw textual data, the data entries representing at least one of archetypal headings or archetypal items for a navigation filter; normalize the data entries to convert the raw textual data into a standard form, the normalized data entries comprising at least one of potential navigation filter headings or potential navigation filter items; identify occurrences of the normalized data entries in an electronic resource; determine a path to each of the identified occurrences of a normalized data entry in the electronic resource, to determine the path, the processing system further configured to: select a root element of the electronic resource; and for each identified occurrence of a normalized data entry in the electronic resource, identify one or more intermediate tags of the electronic resource between the root element and the normalized data entry; and determine a path from the root element to the normalized data entry through the one or more intermediate tags; use the path to an identified occurrence to construct a query for at least one of potential navigation filter headings or potential navigation filter items that have the same path as the identified occurrence in the electronic resource; and generate a navigation filter by associating one or more of the potential navigation filter items with one of the potential navigation filter headings. | 14. A system for generating navigation filters, the system comprising: a processing system configured to: receive a set of data entries comprising raw textual data, the data entries representing at least one of archetypal headings or archetypal items for a navigation filter; normalize the data entries to convert the raw textual data into a standard form, the normalized data entries comprising at least one of potential navigation filter headings or potential navigation filter items; identify occurrences of the normalized data entries in an electronic resource; determine a path to each of the identified occurrences of a normalized data entry in the electronic resource, to determine the path, the processing system further configured to: select a root element of the electronic resource; and for each identified occurrence of a normalized data entry in the electronic resource, identify one or more intermediate tags of the electronic resource between the root element and the normalized data entry; and determine a path from the root element to the normalized data entry through the one or more intermediate tags; use the path to an identified occurrence to construct a query for at least one of potential navigation filter headings or potential navigation filter items that have the same path as the identified occurrence in the electronic resource; and generate a navigation filter by associating one or more of the potential navigation filter items with one of the potential navigation filter headings. 25. The system of claim 14 , wherein the processing system is configured to: identify a defined heading type for the set of data entries; determine a dominant interpretation for each of the archetypal items; and filter the set of data entries to remove an archetypal item in response to a determination that the dominant interpretation of the archetypal item does not match the defined heading type. | 0.716619 |
6,061,654 | 22 | 25 | 22. An apparatus for recognizing an identifier entered by a user, the entered identifier including a first plurality of predetermined characters, wherein the characters are selected from a first set of characters, the first set of characters including a first total number of characters, the system comprising: means for receiving a recognized identifier based on the entered identifier, the recognized identifier comprising a second plurality of predetermined characters; a first memory that stores a plurality of reference identifiers, each one of the reference identifiers comprising a different plurality of predetermined characters, each one of the different plurality of predetermined characters belonging to the first set of characters; a second memory that stores a first arrangement of character recognition probabilities, the first arrangement of character recognition probabilities encompassing a second set of characters having a second total number of characters and is a superset of the characters of the first set of characters, each of the character recognition probabilities representing a probability that a certain recognized character corresponds to a certain entered character; and a third memory that stores constraint data; and a processor, in communication with the means for receiving, the first memory, the second memory, and the third memory, that produces in accordance with the constraint data of the third memory a constrained arrangement of character recognition probabilities, the constrained arrangement of character recognition probabilities being produced by constraining the first arrangement of character recognition probabilities to encompass a third set of characters constituting a subset of the second set of characters, the processor determining for every one of the plurality of reference identifiers a corresponding identifier recognition probability, each of the corresponding identifier recognition probabilities being determined on the basis of the constrained arrangement of character recognition probabilities, the processor selecting the reference identifier most likely matching the entered identifier based on the identifier recognition probabilities. | 22. An apparatus for recognizing an identifier entered by a user, the entered identifier including a first plurality of predetermined characters, wherein the characters are selected from a first set of characters, the first set of characters including a first total number of characters, the system comprising: means for receiving a recognized identifier based on the entered identifier, the recognized identifier comprising a second plurality of predetermined characters; a first memory that stores a plurality of reference identifiers, each one of the reference identifiers comprising a different plurality of predetermined characters, each one of the different plurality of predetermined characters belonging to the first set of characters; a second memory that stores a first arrangement of character recognition probabilities, the first arrangement of character recognition probabilities encompassing a second set of characters having a second total number of characters and is a superset of the characters of the first set of characters, each of the character recognition probabilities representing a probability that a certain recognized character corresponds to a certain entered character; and a third memory that stores constraint data; and a processor, in communication with the means for receiving, the first memory, the second memory, and the third memory, that produces in accordance with the constraint data of the third memory a constrained arrangement of character recognition probabilities, the constrained arrangement of character recognition probabilities being produced by constraining the first arrangement of character recognition probabilities to encompass a third set of characters constituting a subset of the second set of characters, the processor determining for every one of the plurality of reference identifiers a corresponding identifier recognition probability, each of the corresponding identifier recognition probabilities being determined on the basis of the constrained arrangement of character recognition probabilities, the processor selecting the reference identifier most likely matching the entered identifier based on the identifier recognition probabilities. 25. The apparatus according to claim 22, wherein each one of the entered identifier, the recognized identifier, and the plurality of reference identifiers comprises a plurality of numbers. | 0.594828 |
7,739,221 | 2 | 4 | 2. The multi-dimension search system of claim 1 , further comprising at least one of a text analyzer or a sound analyzer. | 2. The multi-dimension search system of claim 1 , further comprising at least one of a text analyzer or a sound analyzer. 4. The system of claim 2 , the sound analyzer includes a speech recognition component that extracts the features from the input. | 0.532847 |
8,023,298 | 20 | 24 | 20. A content addressable memory (CAM) device, comprising: a CAM array including a plurality of rows, each row including a plurality of CAM cells coupled to a match line; a data encoder circuit having an input to receive a first data word and configured to encode the first data word using an encoding scheme to generate an encoded data word that comprises a balanced data word having an equal number of logic high bits and logic low bits; and a read/write circuit coupled to the data encoder circuit and the CAM array and configured to store the encoded balanced data word into a selected row of CAM cells, wherein each row includes a number T of quaternary CAM cells, T being an integer greater than 2, wherein the encoded data word includes 2T data bits, and wherein the first data word includes more than T bits. | 20. A content addressable memory (CAM) device, comprising: a CAM array including a plurality of rows, each row including a plurality of CAM cells coupled to a match line; a data encoder circuit having an input to receive a first data word and configured to encode the first data word using an encoding scheme to generate an encoded data word that comprises a balanced data word having an equal number of logic high bits and logic low bits; and a read/write circuit coupled to the data encoder circuit and the CAM array and configured to store the encoded balanced data word into a selected row of CAM cells, wherein each row includes a number T of quaternary CAM cells, T being an integer greater than 2, wherein the encoded data word includes 2T data bits, and wherein the first data word includes more than T bits. 24. The CAM device of claim 20 , wherein the encoding scheme is selected from a plurality of different encoding schemes in response to an encoding select signal provided to the data encoder circuit. | 0.700906 |
10,042,935 | 11 | 15 | 11. An apparatus comprising: at least one processor; a memory storing instructions executable by the processor to perform operations comprising: identifying at least one style attribute associated with a first image in a design; receiving a first search query for a second image during editing of the design, the first search query including at least a first search term, wherein the first search query is received subsequent to identifying the at least one style attribute associated with the first image; generating, by the processor, a second search query for the second image by adding to the first search query at least one term that is based on the at least one style attribute associated with the first image; searching at least one database based on the second search query instead of the first search query to generate search results, wherein a first search result of the search results is ranked higher than a second search result of the search results based on a determination that the first search result more closely matches the at least one style attribute associated with the first image than the second search result, and wherein determining that the first search result more closely matches the at least one style attribute associated with the first image than the second search result comprises: generating a first hash value of one or more style attributes associated with the first search result; generating a second hash value of one or more style attributes associated with the second search result; generating a third hash value of the at least one style attribute associated with the first image; and determining that a first distance between the first hash value and the third hash value is less than a second distance between the second hash value and the third hash value; and outputting the search results, each search result indicating a respective image. | 11. An apparatus comprising: at least one processor; a memory storing instructions executable by the processor to perform operations comprising: identifying at least one style attribute associated with a first image in a design; receiving a first search query for a second image during editing of the design, the first search query including at least a first search term, wherein the first search query is received subsequent to identifying the at least one style attribute associated with the first image; generating, by the processor, a second search query for the second image by adding to the first search query at least one term that is based on the at least one style attribute associated with the first image; searching at least one database based on the second search query instead of the first search query to generate search results, wherein a first search result of the search results is ranked higher than a second search result of the search results based on a determination that the first search result more closely matches the at least one style attribute associated with the first image than the second search result, and wherein determining that the first search result more closely matches the at least one style attribute associated with the first image than the second search result comprises: generating a first hash value of one or more style attributes associated with the first search result; generating a second hash value of one or more style attributes associated with the second search result; generating a third hash value of the at least one style attribute associated with the first image; and determining that a first distance between the first hash value and the third hash value is less than a second distance between the second hash value and the third hash value; and outputting the search results, each search result indicating a respective image. 15. The apparatus of claim 11 , wherein a plurality of style attributes is associated with the design, wherein a first number of style attributes associated with the first search result match the plurality of style attributes, wherein a second number of style attributes associated with the second search result match the plurality of style attributes, and wherein the first number is greater than the second number. | 0.5 |
9,390,434 | 1 | 7 | 1. A method for providing advertising in one or more search results, the method comprising: receiving at least one database on a computer system from at least one service provider via a network, the at least one database being one of a plurality of databases, each database in the plurality of databases comprising a plurality of items for recognition, each database in the plurality of databases being for a corresponding vertical application; processing the at least one database on the computer system based on the plurality of items for recognition; receiving on the computer system over the network a sound data input comprising a query for the processed at least one database; generating by the computer system phonetic data from the received query, the phonetic data comprising a sequence of phonemes, each phoneme representing a perceptually distinct unit of sound; determining one or more search results in the processed at least one database using the computer system based on the phonetic data; identifying one or more advertisement results in an advertisement database based on the phonetic data and the determined one or more search results using the computer system, the advertisement database being communicatively coupled to the computer system; and transmitting the one or more search results and the one or more advertisement results from the computer system to a remote computer system. | 1. A method for providing advertising in one or more search results, the method comprising: receiving at least one database on a computer system from at least one service provider via a network, the at least one database being one of a plurality of databases, each database in the plurality of databases comprising a plurality of items for recognition, each database in the plurality of databases being for a corresponding vertical application; processing the at least one database on the computer system based on the plurality of items for recognition; receiving on the computer system over the network a sound data input comprising a query for the processed at least one database; generating by the computer system phonetic data from the received query, the phonetic data comprising a sequence of phonemes, each phoneme representing a perceptually distinct unit of sound; determining one or more search results in the processed at least one database using the computer system based on the phonetic data; identifying one or more advertisement results in an advertisement database based on the phonetic data and the determined one or more search results using the computer system, the advertisement database being communicatively coupled to the computer system; and transmitting the one or more search results and the one or more advertisement results from the computer system to a remote computer system. 7. The method of claim 1 , wherein the query further comprises at least one of text, a spoken word sound, and an image. | 0.791958 |
9,818,398 | 17 | 18 | 17. The apparatus of claim 15 , wherein: the evaluating the two or more results using the at least one criterion comprises determining whether the two or more results comprise an indication of a potential error in the first recognition result that may cause a meaning of the first recognition result to differ from a meaning of the speech input. | 17. The apparatus of claim 15 , wherein: the evaluating the two or more results using the at least one criterion comprises determining whether the two or more results comprise an indication of a potential error in the first recognition result that may cause a meaning of the first recognition result to differ from a meaning of the speech input. 18. The apparatus of claim 17 , wherein: the at least one alternative recognition result comprises a second recognition result; the method further comprises semantically interpreting each of the first recognition result and the second recognition result to determine at least one first fact expressed in the first recognition result and at least one second fact expressed in the second recognition result; and the determining whether the two or more results comprise an indication of a potential error that may cause the meaning of the first recognition result to differ from the meaning of the speech input comprises determining whether there is a difference between the at least one first fact and the at least one second fact. | 0.5 |
9,529,924 | 16 | 30 | 16. A system comprising: a user device having a display and a battery; one or more processors configured to perform operations comprising: providing an interface that: receives text for a search query; communicates with at least one search engine server via a network; in response to the receipt of a first portion of the text for the search query: displays a first set of localized results retrieved based on the first portion of text without displaying remote search results from the search engine server; while displaying the first set of localized results, receives a second portion of text for the search query; and in response to receiving the second portion of the text: in accordance with a determination that the first portion of text and the second portion of text together include more than a predetermined number of characters, wherein the predetermined number of characters is greater than 1 and is based on a low battery state of the battery, concurrently displays a plurality of results that include: a set of results received from the search engine server; and a second set of localized results associated with one or more applications on the device retrieved based on the first portion of the text and the second portion of the text. | 16. A system comprising: a user device having a display and a battery; one or more processors configured to perform operations comprising: providing an interface that: receives text for a search query; communicates with at least one search engine server via a network; in response to the receipt of a first portion of the text for the search query: displays a first set of localized results retrieved based on the first portion of text without displaying remote search results from the search engine server; while displaying the first set of localized results, receives a second portion of text for the search query; and in response to receiving the second portion of the text: in accordance with a determination that the first portion of text and the second portion of text together include more than a predetermined number of characters, wherein the predetermined number of characters is greater than 1 and is based on a low battery state of the battery, concurrently displays a plurality of results that include: a set of results received from the search engine server; and a second set of localized results associated with one or more applications on the device retrieved based on the first portion of the text and the second portion of the text. 30. The system of claim 16 , wherein: the plurality of results further include located resources associated with a domain, the domain being separate from the search engine server; and the operations further comprise: detecting a user input related to the located resources; and responsive to the user input, removing the domain from a set of domains of interest. | 0.613248 |
8,656,275 | 2 | 3 | 2. The method of claim 1 , wherein the comparing the template expression to the XPATH expression and determining if the expressions match comprises: identifying a node level constraint element in the XPATH expression; determining if a template exists for the identified node level constraint element in the XPATH expression, the template residing in a database of a document management system; retrieving the node when the template for the identified node level constraint element exists; and, comparing the node to the existing template and determining if the node matches the existing template. | 2. The method of claim 1 , wherein the comparing the template expression to the XPATH expression and determining if the expressions match comprises: identifying a node level constraint element in the XPATH expression; determining if a template exists for the identified node level constraint element in the XPATH expression, the template residing in a database of a document management system; retrieving the node when the template for the identified node level constraint element exists; and, comparing the node to the existing template and determining if the node matches the existing template. 3. The method of claim 2 further comprising: when the node does not match the existing template, comparing each level of the node to the node level constraint element in the template; determining if one of the node level constraint elements matches to the next to last level of the node level constraint element; retrieving the XML document from the database of the document management system when the XPATH expression is one element more shallow than the node level constraint element; retrieving an attribute defined in the node level constraint element; and, returning the node level constraint element with the attribute defined in the node level constraint element. | 0.5 |
9,665,543 | 17 | 18 | 17. A non-transitory computer-readable medium containing a computer-readable code that when read by a computer causes the computer to perform a method for supporting links within a document containing text, the method comprising: identifying representations embedded within a word processor document of links to sources external to the word processor document, the word processor document produced using a word processor program running on a computing system and configured to create, edit and display both text and hyperlinks within the word processor document; appending the word processor document to include initial content representations comprising all content of each external source; identifying a current validity status automatically for each identified link representation during creation of the word processor document, at an initial time of publication of the word processing document and at a later time after initial publication, the validity status comprising accuracy of the link representation, functionality of the link representation, accessibility of the external sources and content of the external sources; expressing the identified current validity status of one or more of the identified link representations using aspects of the document other than the identified link representations; and providing notification to an author and readers of the word processor document of the current validity status. | 17. A non-transitory computer-readable medium containing a computer-readable code that when read by a computer causes the computer to perform a method for supporting links within a document containing text, the method comprising: identifying representations embedded within a word processor document of links to sources external to the word processor document, the word processor document produced using a word processor program running on a computing system and configured to create, edit and display both text and hyperlinks within the word processor document; appending the word processor document to include initial content representations comprising all content of each external source; identifying a current validity status automatically for each identified link representation during creation of the word processor document, at an initial time of publication of the word processing document and at a later time after initial publication, the validity status comprising accuracy of the link representation, functionality of the link representation, accessibility of the external sources and content of the external sources; expressing the identified current validity status of one or more of the identified link representations using aspects of the document other than the identified link representations; and providing notification to an author and readers of the word processor document of the current validity status. 18. The non-transitory computer-readable medium of claim 17 , wherein the method further comprises: obtaining a present content representation of each external source; comparing the current content representations to the initial content representations; and identifying any inconsistencies between the two representations. | 0.579634 |
8,209,598 | 17 | 19 | 17. A system comprising: a client device including a processor operable to perform operations of a rich internet application running on a rich internet application platform, the rich internet application platform having an export resource adapted to be invoked by the first rich internet application and a plurality of other rich internet applications, the operations of the rich internet application including: generating a display object by interpreting an application data object formatted for the rich internet application, the display object defining displayable features of a first graphical representation of the application data object and non-displayable features associated with the displayable features; and exporting the display object to a document format using the export resource, wherein exporting the display object includes: identifying components of the display object and an arrangement of the components; and generating an electronic document based at least in part on the identified components of the display object and the identified arrangement, the electronic document including data that, when interpreted by a document reader application, generate a second graphical representation that includes the displayable features of the first graphical representation and additional data defining the non-displayable features. | 17. A system comprising: a client device including a processor operable to perform operations of a rich internet application running on a rich internet application platform, the rich internet application platform having an export resource adapted to be invoked by the first rich internet application and a plurality of other rich internet applications, the operations of the rich internet application including: generating a display object by interpreting an application data object formatted for the rich internet application, the display object defining displayable features of a first graphical representation of the application data object and non-displayable features associated with the displayable features; and exporting the display object to a document format using the export resource, wherein exporting the display object includes: identifying components of the display object and an arrangement of the components; and generating an electronic document based at least in part on the identified components of the display object and the identified arrangement, the electronic document including data that, when interpreted by a document reader application, generate a second graphical representation that includes the displayable features of the first graphical representation and additional data defining the non-displayable features. 19. The system of claim 17 , further comprising a server device including a processor that performs operations of a server application in response to requests received from the rich internet application. | 0.863758 |
7,587,308 | 1 | 9 | 1. A computer-implemented method executed by a processor that performs operations for reducing ambiguities present in electronically stored words, the operations comprising: receiving a plurality of characters in electronic form, the received plurality of characters corresponding to a sequence of words and including an ambiguous word that has one or more characters whose value is substantially uncertain; comparing at least some of the words in the sequence to a first ontology, the first ontology defining a plurality of nodes, each node being associated with a word, and each node being connected to at least one other node by a link, each link being associated with a concept that relates the words associated with the nodes connected by the link in a predetermined context, wherein at least some of the nodes are associated with non-textual image information that identifies an enhancement to character-based text. | 1. A computer-implemented method executed by a processor that performs operations for reducing ambiguities present in electronically stored words, the operations comprising: receiving a plurality of characters in electronic form, the received plurality of characters corresponding to a sequence of words and including an ambiguous word that has one or more characters whose value is substantially uncertain; comparing at least some of the words in the sequence to a first ontology, the first ontology defining a plurality of nodes, each node being associated with a word, and each node being connected to at least one other node by a link, each link being associated with a concept that relates the words associated with the nodes connected by the link in a predetermined context, wherein at least some of the nodes are associated with non-textual image information that identifies an enhancement to character-based text. 9. The method of claim 1 , wherein the operations further comprise: identifying nodes in the first ontology that correspond to the ambiguous word based on the comparison to the first ontology; comparing at least some of the words in the sequence to a second ontology, the second ontology defining a plurality of nodes, each node being associated with a word, and each node being connected to at least one other node by a link, each link being associated with a concept that relates the words associated with the nodes connected by the link in a predetermined context, wherein at least some of the nodes are associated with non-textual image information that identifies an enhancement to character-based text; identifying nodes in the second ontology that correspond to the ambiguous word based on the comparison to the second ontology; scoring each of the identified nodes from the first ontology and the second ontology, wherein the scoring is at least partially based upon non-textual image information that identifies an enhancement to character-based text and is associated with at least some of the identified nodes; and selecting a node having the highest score from among the identified nodes in the first ontology and the second ontology. | 0.5 |
7,996,223 | 3 | 4 | 3. The method according to claim 2 , further comprising performing at least a second rule interpretation performed to transform text that matches a second set of predetermined patterns. | 3. The method according to claim 2 , further comprising performing at least a second rule interpretation performed to transform text that matches a second set of predetermined patterns. 4. The method according to claim 3 , further comprising converting punctuation tokens into symbols that cling to an adjacent word. | 0.5 |
8,386,441 | 8 | 13 | 8. A computer program product having a non-transitory computer-readable storage medium having computer-executable code for determining a set of legal documents to present to a user for acceptance as part of a transaction, the computer-executable code when executed performing steps comprising: receiving information describing a type of transaction and a geographic location associated with the transaction; identifying a set of hierarchical documents pertinent to the transaction based at least in part on the received information, the set including a root document identified based at least in part on the type of transaction and the geographic location associated with the transaction, the root document specifying a transaction identifier of the transaction and metadata, the set further including one or more dependency documents of the root document identified responsive to an analysis of the metadata specified by the root document; pruning the set of hierarchical documents responsive to data describing documents that a user involved in the transaction has previously accepted; and outputting information pertaining to the pruned set of hierarchical documents for presenting the pruned set of hierarchical documents to the user involved in the transaction for acceptance as part of the transaction. | 8. A computer program product having a non-transitory computer-readable storage medium having computer-executable code for determining a set of legal documents to present to a user for acceptance as part of a transaction, the computer-executable code when executed performing steps comprising: receiving information describing a type of transaction and a geographic location associated with the transaction; identifying a set of hierarchical documents pertinent to the transaction based at least in part on the received information, the set including a root document identified based at least in part on the type of transaction and the geographic location associated with the transaction, the root document specifying a transaction identifier of the transaction and metadata, the set further including one or more dependency documents of the root document identified responsive to an analysis of the metadata specified by the root document; pruning the set of hierarchical documents responsive to data describing documents that a user involved in the transaction has previously accepted; and outputting information pertaining to the pruned set of hierarchical documents for presenting the pruned set of hierarchical documents to the user involved in the transaction for acceptance as part of the transaction. 13. The computer program product of claim 8 , wherein pruning the set comprises: responsive to a document in the hierarchical set being outside of a validity period where the document is valid, removing the document from the hierarchical set. | 0.741453 |
7,548,910 | 1 | 17 | 1. A computer system for identifying flee-text documents, the system comprising: a knowledge source storing in a knowledge database a plurality of concepts formed based on one or more words from a predefined vocabulary set, the knowledge source maintaining a plurality of relationship links wherein each relationship link defines a relationship between a first semantic grouping of the concepts and a second semantic grouping of the concepts; an input receiving an input query including an original query concept and at least one scenario identifier, the at least one scenario identifier being associated with at least one of the relationship links; a database of flee-text documents, wherein each document is indexed via one or more indexing concepts formed based on one or more words from the predefined vocabulary set; one or more processors coupled to the input, each of the one or more processors being operable to execute one or more computer instructions which: generate the indexing concepts for the free-text documents based on the one or more words from the predefined vocabulary set, wherein the program instructions which generate the indexing concepts include computer instructions for: maintaining a plurality of data structures mapping each of the plurality of concepts in the knowledge source to all words appearing in the concept; receiving a particular one of the free-text documents; identifying based on the plurality of data structures the one or more of the plurality of concepts in the knowledge source mapped to a set of words appearing in the particular one of the free-text documents; and returning the one or more identified concepts as candidate index concepts for the particular one of the free-text documents; automatically generate an expanded input query including both the original query concept and one or more additional query concepts, the one or more additional query concepts being selected from one or more first particular semantic groupings of the concepts in the knowledge source that have a specific relationship link with a second particular semantic grouping of the concepts containing the original query concept, the specific relationship link being identified by the at least one scenario identifier, wherein the computer instructions which automatically generate the expanded input query further include computer instructions which: filter candidate expansion concepts not included in the one or more first particular semantic groupings of the concepts in the knowledge source; and return the one or more additional query concepts based on the filtering; compare the expanded input query with the indexing concepts for the free-text documents; and return one or more of the free-text documents that satisfy the expanded input query based on the comparison. | 1. A computer system for identifying flee-text documents, the system comprising: a knowledge source storing in a knowledge database a plurality of concepts formed based on one or more words from a predefined vocabulary set, the knowledge source maintaining a plurality of relationship links wherein each relationship link defines a relationship between a first semantic grouping of the concepts and a second semantic grouping of the concepts; an input receiving an input query including an original query concept and at least one scenario identifier, the at least one scenario identifier being associated with at least one of the relationship links; a database of flee-text documents, wherein each document is indexed via one or more indexing concepts formed based on one or more words from the predefined vocabulary set; one or more processors coupled to the input, each of the one or more processors being operable to execute one or more computer instructions which: generate the indexing concepts for the free-text documents based on the one or more words from the predefined vocabulary set, wherein the program instructions which generate the indexing concepts include computer instructions for: maintaining a plurality of data structures mapping each of the plurality of concepts in the knowledge source to all words appearing in the concept; receiving a particular one of the free-text documents; identifying based on the plurality of data structures the one or more of the plurality of concepts in the knowledge source mapped to a set of words appearing in the particular one of the free-text documents; and returning the one or more identified concepts as candidate index concepts for the particular one of the free-text documents; automatically generate an expanded input query including both the original query concept and one or more additional query concepts, the one or more additional query concepts being selected from one or more first particular semantic groupings of the concepts in the knowledge source that have a specific relationship link with a second particular semantic grouping of the concepts containing the original query concept, the specific relationship link being identified by the at least one scenario identifier, wherein the computer instructions which automatically generate the expanded input query further include computer instructions which: filter candidate expansion concepts not included in the one or more first particular semantic groupings of the concepts in the knowledge source; and return the one or more additional query concepts based on the filtering; compare the expanded input query with the indexing concepts for the free-text documents; and return one or more of the free-text documents that satisfy the expanded input query based on the comparison. 17. The system of claim 1 , wherein the knowledge source is a domain-specific knowledge source, and a concrete domain-specific meaning is assumed for the original query concept. | 0.708882 |
9,646,263 | 9 | 10 | 9. A system comprising: a processor configured to execute instructions; a non-transitory computer-readable medium containing instructions for execution on the processor, the instructions causing the processor to perform steps of: receiving a message in a social networking system, the message including a character string with a hashtag; identifying, a set of candidate phrases including one or more words or phrases that match one or more characters in the character string; scoring each of the candidate phrases based on a natural language model that applies a frequency-based table of words or phrases; selecting a hashtag phrase from the set of candidate phrases based on the scoring of the candidate phrases; generating a feature vector for the message including the hashtag phrase; training a computer model to predict an association of the hashtag with a test message, the training using the feature vector for the message that includes the hashtag phrase; and predicting a topic of the message based at least in part on the identified hashtag phrase. | 9. A system comprising: a processor configured to execute instructions; a non-transitory computer-readable medium containing instructions for execution on the processor, the instructions causing the processor to perform steps of: receiving a message in a social networking system, the message including a character string with a hashtag; identifying, a set of candidate phrases including one or more words or phrases that match one or more characters in the character string; scoring each of the candidate phrases based on a natural language model that applies a frequency-based table of words or phrases; selecting a hashtag phrase from the set of candidate phrases based on the scoring of the candidate phrases; generating a feature vector for the message including the hashtag phrase; training a computer model to predict an association of the hashtag with a test message, the training using the feature vector for the message that includes the hashtag phrase; and predicting a topic of the message based at least in part on the identified hashtag phrase. 10. The system of claim 9 , wherein the natural language model is n-gram language model. | 0.708609 |
9,558,280 | 17 | 19 | 17. An apparatus, comprising: one or more processors, a computer-readable medium coupled to said one or more processors having instructions stored thereon that, when executed by said one or more processors, cause said one or more processors to perform operations comprising: receiving, from a client device operated by a user, a request for a content item; in response to said request, identifying content items available to be sent to said client device; determining one or more designated geographic locations for each of the identified content items; determining one or more contacts of said user, said determined one or more contacts being members of a social network of said user; for each of the identified content items: determining a score for the content item based on a number of tagging actions that were performed by the user's contacts at the determined designated geographic location for the identified content item, wherein said tagging actions mark an association of a person with a particular geographic location; selecting, from the identified content items, a particular content item to be sent to the client device based on the scores; determining that a timestamp associated with at least one of the tagging actions performed at the designated geographic location for the particular content item is within a time period specified by a provider of the particular content item, the timestamp indicating a time of the tagging action; constructing, based on the determination that the timestamp is within the time period, an annotation that identifies at least one of the user's contacts with the tagging action corresponding to the designated geographic location and indicates the time of the tagging action based on the timestamp associated with the at least one location record; and sending said annotation to said client device. | 17. An apparatus, comprising: one or more processors, a computer-readable medium coupled to said one or more processors having instructions stored thereon that, when executed by said one or more processors, cause said one or more processors to perform operations comprising: receiving, from a client device operated by a user, a request for a content item; in response to said request, identifying content items available to be sent to said client device; determining one or more designated geographic locations for each of the identified content items; determining one or more contacts of said user, said determined one or more contacts being members of a social network of said user; for each of the identified content items: determining a score for the content item based on a number of tagging actions that were performed by the user's contacts at the determined designated geographic location for the identified content item, wherein said tagging actions mark an association of a person with a particular geographic location; selecting, from the identified content items, a particular content item to be sent to the client device based on the scores; determining that a timestamp associated with at least one of the tagging actions performed at the designated geographic location for the particular content item is within a time period specified by a provider of the particular content item, the timestamp indicating a time of the tagging action; constructing, based on the determination that the timestamp is within the time period, an annotation that identifies at least one of the user's contacts with the tagging action corresponding to the designated geographic location and indicates the time of the tagging action based on the timestamp associated with the at least one location record; and sending said annotation to said client device. 19. The apparatus of claim 17 , wherein said computer-readable medium coupled to said one or more processors has further instructions stored thereon that, when executed by said one or more processors, cause said one or more processors to perform operations further comprising: accessing a database to determine said one or more designated geographic locations before accessing said database to determine said one or more contacts of said user. | 0.865431 |
9,026,427 | 12 | 13 | 12. The medium of claim 11 further comprising updating expansion frequencies of each directed edge in accordance with the pruned representation. | 12. The medium of claim 11 further comprising updating expansion frequencies of each directed edge in accordance with the pruned representation. 13. The medium of claim 12 wherein the steps of pruning the directed edge and deriving a pruned grammar are repeated iteratively until a stopping condition is met. | 0.5 |
7,835,998 | 1 | 17 | 1. A user-interface method of selecting and presenting a collection of content items of a first content system in which the presentation is ordered at least in part based on content preferences of the user learned from the user selecting content of a second content system, the method comprising: receiving incremental input entered by the user for incrementally identifying desired content items of the second content system, each content item having at least one associated descriptive term to describe the content item; in response to the incremental input entered by the user, presenting a subset of content items of the second content system; receiving selection actions of content items of the subset from the user; determining a user preference signature by analyzing the descriptive terms of the selected content items to learn the content preferences of the user for the content of the second content system; determining a relationship between the content items of the first content system and the content items of the second content system, the relationship defining which learned user content preferences of the user preference signature are relevant to the content items of the first content system; and in response to receiving subsequent incremental input entered by the user for incrementally identifying desired content items of the first content system, selecting and ordering a collection of content items of the first content system based on the learned content preferences of the user determined to be relevant to the content items of the first content system. | 1. A user-interface method of selecting and presenting a collection of content items of a first content system in which the presentation is ordered at least in part based on content preferences of the user learned from the user selecting content of a second content system, the method comprising: receiving incremental input entered by the user for incrementally identifying desired content items of the second content system, each content item having at least one associated descriptive term to describe the content item; in response to the incremental input entered by the user, presenting a subset of content items of the second content system; receiving selection actions of content items of the subset from the user; determining a user preference signature by analyzing the descriptive terms of the selected content items to learn the content preferences of the user for the content of the second content system; determining a relationship between the content items of the first content system and the content items of the second content system, the relationship defining which learned user content preferences of the user preference signature are relevant to the content items of the first content system; and in response to receiving subsequent incremental input entered by the user for incrementally identifying desired content items of the first content system, selecting and ordering a collection of content items of the first content system based on the learned content preferences of the user determined to be relevant to the content items of the first content system. 17. The method of claim 1 , further comprising presenting the ordered collection of content items on at least one of a telephone, a PDA, and a remote control. | 0.896053 |
9,619,583 | 1 | 6 | 1. A computer-implemented method for predictive analytic queries, the computer-implemented method comprising: creating a set of predictive analytics by-example vocabularies; creating a set of subject-specific by-example vocabularies, each comprising one or more nouns associated with a respective subject area, wherein the one or more subject-specific by-example vocabularies are based on a capability of one or more data sources; generating a palette of vocabularies for constructing predictive queries, wherein the palette of vocabularies is based on the set of predictive analytics by-example vocabularies and the set of subject-specific by-example vocabularies; constructing a user-defined predictive analytics query comprising the palette of vocabularies using a set of syntactic grammar that defines a correct syntax of the user-defined predictive analytic query; wherein the set of syntactic grammar defines semantics of each syntactically correct predictive analytics query using the palette of vocabularies, such that the user-defined predictive analytics query is expressed with semantic precision using a constrained Natural Language Processing (cNLP) approach; generating, by a computer processor, a predictive analytic model and runtime query, using the user-defined predictive analytics query; executing the runtime query using the predictive analytic model to create a result; and returning the result to a user. | 1. A computer-implemented method for predictive analytic queries, the computer-implemented method comprising: creating a set of predictive analytics by-example vocabularies; creating a set of subject-specific by-example vocabularies, each comprising one or more nouns associated with a respective subject area, wherein the one or more subject-specific by-example vocabularies are based on a capability of one or more data sources; generating a palette of vocabularies for constructing predictive queries, wherein the palette of vocabularies is based on the set of predictive analytics by-example vocabularies and the set of subject-specific by-example vocabularies; constructing a user-defined predictive analytics query comprising the palette of vocabularies using a set of syntactic grammar that defines a correct syntax of the user-defined predictive analytic query; wherein the set of syntactic grammar defines semantics of each syntactically correct predictive analytics query using the palette of vocabularies, such that the user-defined predictive analytics query is expressed with semantic precision using a constrained Natural Language Processing (cNLP) approach; generating, by a computer processor, a predictive analytic model and runtime query, using the user-defined predictive analytics query; executing the runtime query using the predictive analytic model to create a result; and returning the result to a user. 6. The method of claim 1 , wherein generating the predictive analytic model and runtime query, using the user-defined predictive analytics query, further comprises: receiving the user-defined predictive analytics query as input; identifying the predictive analytics by-example vocabularies; extracting the subject-specific by-example vocabularies from the user-defined predictive analytics query received as input; validating correct sequencing of one or more by-example keywords using rules of the set of syntactic grammar; and analyzing the predictive analytics by-example vocabularies in the user-defined predictive analytics query received, together with a data type of the subject-specific by-example vocabularies, to determine semantics of the user-defined predictive analytics query received, including an associated predictive analytics model and predictive analytics command to generate, wherein a generator uses decisions of a parser to perform at least one of constructing an instance of the predictive analytics model along with corresponding commands and selecting an existing model to reuse. | 0.5 |
9,201,876 | 3 | 4 | 3. The method of claim 1 , further comprising creating a co-occurrence count matrix with the weighted count for the word pair and with counts for other of the word pairs. | 3. The method of claim 1 , further comprising creating a co-occurrence count matrix with the weighted count for the word pair and with counts for other of the word pairs. 4. The method of claim 3 , wherein the counts for the other of the word pairs are weighted counts. | 0.760976 |
8,775,459 | 1 | 10 | 1. A method for interpreting a user request, the method comprising: receiving, by a processor, an initial user request from a user; interpreting, by the processor, the initial user request, where the processor fails to fully interpret the initial user request due to a presence of at least one un-interpretable expression in the initial user request wherein the interpreting comprises: identifying an abstracted version of a previous user request that matches the initial user request, wherein at least one attribute value in the abstracted version of the previous request has been replaced with a variable; and replacing the variable with an attribute defined in the initial user request to produce a modified version of the initial user request; and generating, by the processor, at least one alternative request in a context of the initial user request, the at least one alternative request being phrased in a manner that the processor can successfully interpret and that satisfies a combination of semantic constraints, syntactic constraints, and contextual constraints relating to the initial user request, wherein the generating comprises: retrieving a modified version of the previous user request that is stored with the abstracted version of the previous user request; and adapting the modified version of the initial user request in accordance with the modified version of the previous user request to produce the at least one alternative request, where the modified version of the previous user request has been fully interpreted by the processor. | 1. A method for interpreting a user request, the method comprising: receiving, by a processor, an initial user request from a user; interpreting, by the processor, the initial user request, where the processor fails to fully interpret the initial user request due to a presence of at least one un-interpretable expression in the initial user request wherein the interpreting comprises: identifying an abstracted version of a previous user request that matches the initial user request, wherein at least one attribute value in the abstracted version of the previous request has been replaced with a variable; and replacing the variable with an attribute defined in the initial user request to produce a modified version of the initial user request; and generating, by the processor, at least one alternative request in a context of the initial user request, the at least one alternative request being phrased in a manner that the processor can successfully interpret and that satisfies a combination of semantic constraints, syntactic constraints, and contextual constraints relating to the initial user request, wherein the generating comprises: retrieving a modified version of the previous user request that is stored with the abstracted version of the previous user request; and adapting the modified version of the initial user request in accordance with the modified version of the previous user request to produce the at least one alternative request, where the modified version of the previous user request has been fully interpreted by the processor. 10. The method of claim 1 , wherein the interpreting results in a semantic structure representing an overall interpretation status of the initial user request, the semantic structure comprising: at least one task specified by the initial user request; and a plurality of nodes labeled by domain concepts, attributes, or constraints specified by the initial user request, wherein the plurality of nodes are connected by a set of relational links, wherein at least one of the plurality of nodes represents the at least one un-interpretable term and is labeled as unknown, thereby rendering the semantic graph only partially connected. | 0.5 |
7,616,137 | 25 | 26 | 25. The decompression unit as claimed in claim 20 , in which at least certain parts of fixed length reference a sub-table of a decompression table collecting at least part of the words of the executable code, the part of variable length giving the position in the sub-table of the word of executable code, the decompression unit further comprising: means for saving a decompression table, means for determining the position of the word of executable code to be read in the decompression table of the part of fixed length and of the part of variable length, if the part of fixed length references a sub-table of the decompression table, and means for reading the word of executable code to the position determined in the sub-table. | 25. The decompression unit as claimed in claim 20 , in which at least certain parts of fixed length reference a sub-table of a decompression table collecting at least part of the words of the executable code, the part of variable length giving the position in the sub-table of the word of executable code, the decompression unit further comprising: means for saving a decompression table, means for determining the position of the word of executable code to be read in the decompression table of the part of fixed length and of the part of variable length, if the part of fixed length references a sub-table of the decompression table, and means for reading the word of executable code to the position determined in the sub-table. 26. The decompression unit as claimed in claim 25 , further comprising means for transmitting to the microprocessor a word of executable code previously decompressed if the part of fixed length indicates that the word of corresponding executable code is a second word of two identical words appearing consecutively in the executable code. | 0.579602 |
8,793,260 | 1 | 7 | 1. A computer-implemented method for responding to a search query, the method comprising each of the following as implemented on a computer comprising at least a processor and a memory: identifying a plurality of entities specified in a search query received from a user; obtaining a set of search results responsive to the search query; selecting a pivot entity from the plurality of entities; identifying a pivoted set of search queries relating to the pivot entity; generating a search results page responsive to the search query, the search results page including at least some of the obtained search results and the pivoted set of search queries; and returning the search results page to the user responsive to the search query. | 1. A computer-implemented method for responding to a search query, the method comprising each of the following as implemented on a computer comprising at least a processor and a memory: identifying a plurality of entities specified in a search query received from a user; obtaining a set of search results responsive to the search query; selecting a pivot entity from the plurality of entities; identifying a pivoted set of search queries relating to the pivot entity; generating a search results page responsive to the search query, the search results page including at least some of the obtained search results and the pivoted set of search queries; and returning the search results page to the user responsive to the search query. 7. The method of claim 1 further comprising identifying an expanded set of entities related to the plurality of entities specified in the search query, and wherein selecting the pivot entity from the plurality of entities further comprises selecting the pivot entity from the plurality of entities and the expanded set of entities. | 0.5 |
7,936,341 | 16 | 20 | 16. At a computer system including a multi-touch input display surface, a method for dynamically recognizing a region for selecting items displayed on the multi-touch input display surface, the method comprising: an act of receiving first contact input data indicating contact on one or more areas of the multi-touch input display surface; an act of calculating a first selection region based on the multi-touch input display surface based on first contact input data; an act of receiving second subsequent contact input data indicating contact on one or more different areas of the multi-touch input display surface subsequent to receiving the first contact input data; an act of calculating a second selection region on the multi-touch input display surface based on second contact input data; an act of interpolating an area on the multi-touch input display surface between the first selection region and the second selection region, the interpolated area connecting the first selection region and the second selection region; an act of determining that the region for selecting items displayed on the multi-touch input display surface includes the first selection region, the interpolated area, and the second selection region; an act of identifying selected items displayed on the multi-touch input display surface that intersect the region for selecting items displayed on the multi-touch input display surface; an act of providing visual feedback data to the multi-touch input display surface to display the region for selecting items displayed on the multi-touch input display surface; and an act of providing item visual feedback data to the multi-touch input display surface to indicate the selected items on the multi-touch input display surface. | 16. At a computer system including a multi-touch input display surface, a method for dynamically recognizing a region for selecting items displayed on the multi-touch input display surface, the method comprising: an act of receiving first contact input data indicating contact on one or more areas of the multi-touch input display surface; an act of calculating a first selection region based on the multi-touch input display surface based on first contact input data; an act of receiving second subsequent contact input data indicating contact on one or more different areas of the multi-touch input display surface subsequent to receiving the first contact input data; an act of calculating a second selection region on the multi-touch input display surface based on second contact input data; an act of interpolating an area on the multi-touch input display surface between the first selection region and the second selection region, the interpolated area connecting the first selection region and the second selection region; an act of determining that the region for selecting items displayed on the multi-touch input display surface includes the first selection region, the interpolated area, and the second selection region; an act of identifying selected items displayed on the multi-touch input display surface that intersect the region for selecting items displayed on the multi-touch input display surface; an act of providing visual feedback data to the multi-touch input display surface to display the region for selecting items displayed on the multi-touch input display surface; and an act of providing item visual feedback data to the multi-touch input display surface to indicate the selected items on the multi-touch input display surface. 20. The method as recited in claim 16 , further comprising: an act of receiving third subsequent contact input data indicating contact on one or more different areas of the multi-touch input display surface subsequent to receiving the second contact input data; an act of calculating a third selection region on the multi-touch input display surface based on third contact input data; an act of interpolating a second area on the multi-touch input display surface between the second selection region and the third selection region, the interpolated area connecting the second selection region and the third selection region; and an act of determining that the region for selecting items displayed on the multi-touch input display surface includes the first selection region, the interpolated area, the second selection region, the second interpolated area and the third selection region. | 0.5 |
8,666,994 | 18 | 19 | 18. The method as claimed in claim 15 wherein in step d), re-forming the input local term index comprises: d.2) forming an augmented input local term index on the basis of text terms in the local term index of documents receiving a positive indication of relevance; and wherein step e) comprises: e.2) on the basis of the input local text term weights in the augmented input local text term index, querying the database to identify one or more relevant reference documents of enhanced relevance to the input text portion. | 18. The method as claimed in claim 15 wherein in step d), re-forming the input local term index comprises: d.2) forming an augmented input local term index on the basis of text terms in the local term index of documents receiving a positive indication of relevance; and wherein step e) comprises: e.2) on the basis of the input local text term weights in the augmented input local text term index, querying the database to identify one or more relevant reference documents of enhanced relevance to the input text portion. 19. The method as claimed in claim 18 wherein for each reference document for which a positive indication of relevance is received, new terms in the positively identified reference document which do not appear in the local term index are added thereto to form the augmented local text term index and associated local index text term weights for the new terms are determined. | 0.5 |
9,535,601 | 2 | 3 | 2. The method of claim 1 , further comprising: mapping a unique predefined combination of a total number of items that initiate a given touch event and a given location of the given touch event relative to preselected text to each text style change. | 2. The method of claim 1 , further comprising: mapping a unique predefined combination of a total number of items that initiate a given touch event and a given location of the given touch event relative to preselected text to each text style change. 3. The method of claim 2 , wherein determining the gesture further comprises determining the gesture of the plurality of predefined gestures made with regard to the text displayed on the touch screen display by comparing the co-ordinates of a touch event of the one or more touch events to the location of the text on the touch screen display and the given location of the given touch event relative to the preselected text. | 0.5 |
7,647,312 | 9 | 12 | 9. A client device that performs a method for automatically generating a set of suggested search terms, the method comprising: aggregating a user's search behavior; establishing a user profile based upon the aggregation, wherein the user profile is automatically refined upon detecting the user's search behavior; receiving a search input; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input; generating a set of suggested search terms by interrogating the user profile with the parsed search input; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time; rendering the set of suggested search terms at a UI display, wherein the set of suggested search terms is updated in real time on a character-by-character basis; and rendering a set of selectable edit options at the UI display that, when selected, modify one or more of the rendered set of suggested search terms, wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms. | 9. A client device that performs a method for automatically generating a set of suggested search terms, the method comprising: aggregating a user's search behavior; establishing a user profile based upon the aggregation, wherein the user profile is automatically refined upon detecting the user's search behavior; receiving a search input; parsing the search input on a real time character-by-character basis incident to each keystroke during entry of the search input; generating a set of suggested search terms by interrogating the user profile with the parsed search input; ordering the set of suggested search terms by evaluating the relevance of each search term in the set of suggested search terms against the search input in real time; rendering the set of suggested search terms at a UI display, wherein the set of suggested search terms is updated in real time on a character-by-character basis; and rendering a set of selectable edit options at the UI display that, when selected, modify one or more of the rendered set of suggested search terms, wherein modifications to one or more of the rendered set of suggested search terms are automatically transmitted to the user profile that incorporates those modifications in prospective sets of suggested search terms. 12. A method according to claim 9 , wherein the set of suggested search terms are presented according to the ordering of each search term in the set of suggested search terms. | 0.729938 |
6,041,293 | 7 | 9 | 7. A document processing method comprising: a first word extracting step for extracting a first word from document data; a preceding/subsequent word extracting step for extracting, from the document data, a second word that is one of a preceding word and a subsequent word of the first word; a keyword extracting step for extracting a keyword of the document data, based on a frequency of occurrence of the first word, wherein said keyword extracting step includes a word counting step of counting a number of occurrences of each word, other than unnecessary words which are pre-excluded from being keywords, in the document data, said keyword extracting step extracting a word having a high number of occurrences, counted by said word counting step, as the keyword; and a translation step for translating the keyword into a predetermined language by referring to a dictionary in a process that considers a meaning of the first and second words existing together in the document data. | 7. A document processing method comprising: a first word extracting step for extracting a first word from document data; a preceding/subsequent word extracting step for extracting, from the document data, a second word that is one of a preceding word and a subsequent word of the first word; a keyword extracting step for extracting a keyword of the document data, based on a frequency of occurrence of the first word, wherein said keyword extracting step includes a word counting step of counting a number of occurrences of each word, other than unnecessary words which are pre-excluded from being keywords, in the document data, said keyword extracting step extracting a word having a high number of occurrences, counted by said word counting step, as the keyword; and a translation step for translating the keyword into a predetermined language by referring to a dictionary in a process that considers a meaning of the first and second words existing together in the document data. 9. A document processing method according to claim 7, wherein said dictionary includes at least a dictionary for correlating the Japanese language and a foreign language. | 0.837476 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.