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
|
|---|---|---|---|---|---|
8,661,065 | 25 | 36 | 25. A computer-program product, tangibly embodied in a machine-readable non-transitory storage medium, including instructions executable to cause a data processing apparatus to perform operations including: storing data in a computerized data storage system that facilitates collaborative data management, wherein collaborative data management includes performance of multiple data management tasks, each data management task associated with a different one of multiple classes of data management tasks, wherein each one of the classes of data management tasks is associated with a unique group of users having permission to perform the data management tasks of the one class; activating a definition interface for defining terms used to manage the data, wherein a term is applicable to the data, and wherein a term includes a definition or a requirement; activating an instruction interface for effectuating terms, wherein the instruction interface facilitates an input of instructions into a data management system such that the inputted instructions effectuate a defined term within the data storage system, and wherein the inputted instructions cause the data storage system to associate the data with the defined term effectuated by the inputted instructions; processing the data according to the defined term effectuated by the inputted instructions; and displaying the inputted instructions, the defined term effectuated by the inputted instructions, and the processed data, wherein displaying includes using a monitoring interface that facilitates monitoring the data stored in the data storage system. | 25. A computer-program product, tangibly embodied in a machine-readable non-transitory storage medium, including instructions executable to cause a data processing apparatus to perform operations including: storing data in a computerized data storage system that facilitates collaborative data management, wherein collaborative data management includes performance of multiple data management tasks, each data management task associated with a different one of multiple classes of data management tasks, wherein each one of the classes of data management tasks is associated with a unique group of users having permission to perform the data management tasks of the one class; activating a definition interface for defining terms used to manage the data, wherein a term is applicable to the data, and wherein a term includes a definition or a requirement; activating an instruction interface for effectuating terms, wherein the instruction interface facilitates an input of instructions into a data management system such that the inputted instructions effectuate a defined term within the data storage system, and wherein the inputted instructions cause the data storage system to associate the data with the defined term effectuated by the inputted instructions; processing the data according to the defined term effectuated by the inputted instructions; and displaying the inputted instructions, the defined term effectuated by the inputted instructions, and the processed data, wherein displaying includes using a monitoring interface that facilitates monitoring the data stored in the data storage system. 36. The computer-program product of claim 25 , wherein the definition interface is used to define business terms, wherein a business term includes a site specific template attribute, and wherein a site specific template attribute includes a multi-line text attribute entry type. | 0.5 |
7,848,917 | 13 | 14 | 13. The computing device of claim 12 wherein the recognizer is configured to modify the word graph by pruning and rescoring the word graph. | 13. The computing device of claim 12 wherein the recognizer is configured to modify the word graph by pruning and rescoring the word graph. 14. The computing device of claim 13 wherein the recognizer is configured to repetitively receive corrective information using the second modality, modify the common word graph, and render a new hypothesis to the user based on the word graph until the new hypothesis is a desired hypothesis. | 0.5 |
9,146,997 | 1 | 2 | 1. A computer-implemented method comprising: obtaining a plurality of image search results responsive to a received query; identifying a first set of search results that referenced a first corresponding set of images and were previously provided to a first set of users that previously submitted first queries that correspond to the received query; identifying a second set of search results that referenced a second corresponding set of images and were previously provided to a second different set of users that submitted second queries that correspond to the received query and have a characteristic matching a characteristic of a user that submitted the received query; determining, by one or more data processing apparatus, a result similarity based on a number of same images that are included in both of the first corresponding set of images and the second corresponding set of images; and ranking, based on the result similarity and by one or more data processing apparatus, the plurality of image search results based on one of first performance data for the first set of search results or second performance data for the second set of search results. | 1. A computer-implemented method comprising: obtaining a plurality of image search results responsive to a received query; identifying a first set of search results that referenced a first corresponding set of images and were previously provided to a first set of users that previously submitted first queries that correspond to the received query; identifying a second set of search results that referenced a second corresponding set of images and were previously provided to a second different set of users that submitted second queries that correspond to the received query and have a characteristic matching a characteristic of a user that submitted the received query; determining, by one or more data processing apparatus, a result similarity based on a number of same images that are included in both of the first corresponding set of images and the second corresponding set of images; and ranking, based on the result similarity and by one or more data processing apparatus, the plurality of image search results based on one of first performance data for the first set of search results or second performance data for the second set of search results. 2. The method of claim 1 , further comprising selecting the first performance data to rank the plurality of image search results when the result similarity meets a specified level of similarity. | 0.505102 |
8,019,783 | 7 | 8 | 7. The computer implemented method of claim 6 , wherein said first set of entity types are searched more often than the remaining ones of said plurality of entity types. | 7. The computer implemented method of claim 6 , wherein said first set of entity types are searched more often than the remaining ones of said plurality of entity types. 8. The computer implemented method of claim 7 , wherein said first set of entity types are primary entities. | 0.5 |
8,625,451 | 18 | 19 | 18. The system of claim 12 wherein the measured mean opinion score for the degraded data stream is determined by comparing the reference data stream to the degraded data stream. | 18. The system of claim 12 wherein the measured mean opinion score for the degraded data stream is determined by comparing the reference data stream to the degraded data stream. 19. The system of claim 18 wherein a perceptual evaluation of speech quality (PESQ) algorithm is used to compare the reference and degraded data streams. | 0.5 |
9,398,030 | 8 | 9 | 8. The one or more computer-readable storage media as recited in claim 7 , wherein the operations further comprise, prior to the receiving the call, receiving HTML content that contains a script that activates or instantiates the third party object. | 8. The one or more computer-readable storage media as recited in claim 7 , wherein the operations further comprise, prior to the receiving the call, receiving HTML content that contains a script that activates or instantiates the third party object. 9. The one or more computer-readable storage media as recited in claim 8 , wherein the ascertaining the domain context of the third party object comprises ascertaining a source identifier of the HTML content. | 0.5 |
8,156,131 | 13 | 14 | 13. The system of claim 10 , wherein instructions when executed by the processor further comprise functionality for: identifying, in the search result, a plurality of phrases each associated with a corresponding usage measure based on a record of frequently used phrases; selecting a phrase from the plurality of phrases based on the corresponding usage measure; and requesting a second plurality of searches using at least the search profile, wherein the second plurality of searches are limited by the phrase. | 13. The system of claim 10 , wherein instructions when executed by the processor further comprise functionality for: identifying, in the search result, a plurality of phrases each associated with a corresponding usage measure based on a record of frequently used phrases; selecting a phrase from the plurality of phrases based on the corresponding usage measure; and requesting a second plurality of searches using at least the search profile, wherein the second plurality of searches are limited by the phrase. 14. The system of claim 13 , wherein the record of frequently used phrases is generated from searches performed from the host application prior to sending the oilfield data item as the search result. | 0.5 |
9,202,467 | 48 | 49 | 48. The method of claim 47 , wherein the method further comprises: for each of the first and second display windows, opening a respective one of a first and a second connection with a web browser, wherein the data displayed in the first and second display windows is provided to the web browser for generating the display over the first and second connections, respectively. | 48. The method of claim 47 , wherein the method further comprises: for each of the first and second display windows, opening a respective one of a first and a second connection with a web browser, wherein the data displayed in the first and second display windows is provided to the web browser for generating the display over the first and second connections, respectively. 49. The method of claim 48 , wherein the first and second connections are persistent connections, and at least one of (a) are closed in response to a closing of a respective one of the first and second display windows, and (b) are closed in response to a loading into the respective one of the first and second display windows of a different web page not associated with a grammar. | 0.5 |
7,941,438 | 15 | 16 | 15. The process of claim 3 further comprising the steps: C) controlling a computer to display diagrams and textual interactive dialogs and process and store requirements data entered using said diagrams and textual interactive dialogs so as to perform the functions recited herein, said diagrams and textual interactive dialogs being tools which a designer of said computer program uses to enter requirements data that define the meta-model building blocks or elements which comprise an Object Model, a Dynamic Model, a Functional Model and a Presentation Model which together comprise the Conceptual Model which fully specifies the desired structure, behavior and user interface of said computer program, said Conceptual Model being the entity from which said validated Formal Specification is generated; D) storing in said memory of said computer said requirements data entered using said diagrams and textual interactive dialogs and using said computer to automatically convert said requirements data, as it is entered, into elements of a formal specification language and storing all said elements automatically created from items of requirements data as said Formal Specification, said Formal Specification being written in a formal specification language having rules of syntax and semantics that define a grammar; E) controlling a computer to use said rules of syntax and semantics to validate said Formal Specification to ensure it is correct and complete so as to generate said validated Formal Specification. | 15. The process of claim 3 further comprising the steps: C) controlling a computer to display diagrams and textual interactive dialogs and process and store requirements data entered using said diagrams and textual interactive dialogs so as to perform the functions recited herein, said diagrams and textual interactive dialogs being tools which a designer of said computer program uses to enter requirements data that define the meta-model building blocks or elements which comprise an Object Model, a Dynamic Model, a Functional Model and a Presentation Model which together comprise the Conceptual Model which fully specifies the desired structure, behavior and user interface of said computer program, said Conceptual Model being the entity from which said validated Formal Specification is generated; D) storing in said memory of said computer said requirements data entered using said diagrams and textual interactive dialogs and using said computer to automatically convert said requirements data, as it is entered, into elements of a formal specification language and storing all said elements automatically created from items of requirements data as said Formal Specification, said Formal Specification being written in a formal specification language having rules of syntax and semantics that define a grammar; E) controlling a computer to use said rules of syntax and semantics to validate said Formal Specification to ensure it is correct and complete so as to generate said validated Formal Specification. 16. The process of claim 15 wherein said diagrams and textual interactive dialogs receive and process requirements data entered by said designer defining an Object Model, a Dynamic Model, a Functional Model and a Presentation Model which can include definitions of classes, relationships between classes, global interactions, global functions and views, and wherein said diagrams and textual interactive dialogs receive and process requirements data as part of said Object Model, Dynamic Model, Functional Model and Presentation Model, said diagrams and textual interactive dialogs enabling entry of requirements data defining: attributes; services; derivations; constraints; transaction formulas; triggers; display sets; filters; population selection patterns; a state transition diagram; formal interfaces; a name. | 0.945447 |
8,548,983 | 25 | 29 | 25. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more computing devices, cause: transforming a first query, comprising a first lateral view that includes a first predicate that references a database object that is joined with the first lateral view, to a second query that includes: a second view without the first predicate that references the database object, wherein the database object is joined with the second view, and a second predicate outside the second view, wherein the second predicate corresponds to the first predicate, wherein the second predicate references the second view, and wherein the second query is semantically equivalent to the first query; generating an execution plan for executing the second query instead of the first query; wherein the method is performed by one or more computing devices. | 25. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more computing devices, cause: transforming a first query, comprising a first lateral view that includes a first predicate that references a database object that is joined with the first lateral view, to a second query that includes: a second view without the first predicate that references the database object, wherein the database object is joined with the second view, and a second predicate outside the second view, wherein the second predicate corresponds to the first predicate, wherein the second predicate references the second view, and wherein the second query is semantically equivalent to the first query; generating an execution plan for executing the second query instead of the first query; wherein the method is performed by one or more computing devices. 29. The one or more non-transitory computer-readable storage media of claim 25 , wherein the first lateral view is an outer joined or a non-outer joined lateral view that references an aggregation function, wherein the second view is an outer joined non-lateral view, and wherein the second view includes a GROUP BY clause that preserves, after the first predicate has been pulled out of the first lateral view, an interaction that was present between the aggregation function and the first predicate when the first predicate was in the first lateral view. | 0.5 |
8,364,666 | 11 | 13 | 11. A computer-implemented method for performing a data analysis task having an associated analysis context, the method comprising: defining the analysis context associated with the data analysis task, wherein data items have a variable relevance in accordance with the context, and wherein data items are grouped together to form logical transactions conducted by a user over a predetermined time period; receiving the logical transactions exchanged over a communication network; defining a plurality of logical transactions based on one or more transaction criteria, wherein each logical transaction of the plurality of logical transactions comprise at least two data items of the plurality of data items; processing the logical transactions with a set of prioritization rules to generate relevance scores that quantify a relevance of the logical transactions to the analysis context, wherein the relevance scores are assigned according to a common scale; and generating a prioritization of the logical transactions based on the relevance scores. | 11. A computer-implemented method for performing a data analysis task having an associated analysis context, the method comprising: defining the analysis context associated with the data analysis task, wherein data items have a variable relevance in accordance with the context, and wherein data items are grouped together to form logical transactions conducted by a user over a predetermined time period; receiving the logical transactions exchanged over a communication network; defining a plurality of logical transactions based on one or more transaction criteria, wherein each logical transaction of the plurality of logical transactions comprise at least two data items of the plurality of data items; processing the logical transactions with a set of prioritization rules to generate relevance scores that quantify a relevance of the logical transactions to the analysis context, wherein the relevance scores are assigned according to a common scale; and generating a prioritization of the logical transactions based on the relevance scores. 13. The computer-implemented method of claim 11 wherein the one or more transaction criteria comprises a username, a time period, a packet address, an e-mail address, and a plurality of web pages linked together through a plurality of hyperlinks. | 0.847015 |
9,595,090 | 11 | 12 | 11. A computer system, comprising: a processor; and a memory having stored thereon instructions that are executable to cause the computer system to perform operations comprising: identifying one or more distortion categories for one or more image frames, wherein the identifying is based on distorted image statistics for the one or more image frames; and determining a quality of the one or more image frames based on the identified one or more distortion categories by assessing one or more feature scores corresponding to one or more feature vectors of the one or more image frames, and mapping from a multidimensional space to a quality score, wherein the multidimensional space is defined by ranges for the one or more feature scores; wherein the identifying and the determining do not use reference image frames for the one or more image frames. | 11. A computer system, comprising: a processor; and a memory having stored thereon instructions that are executable to cause the computer system to perform operations comprising: identifying one or more distortion categories for one or more image frames, wherein the identifying is based on distorted image statistics for the one or more image frames; and determining a quality of the one or more image frames based on the identified one or more distortion categories by assessing one or more feature scores corresponding to one or more feature vectors of the one or more image frames, and mapping from a multidimensional space to a quality score, wherein the multidimensional space is defined by ranges for the one or more feature scores; wherein the identifying and the determining do not use reference image frames for the one or more image frames. 12. The computer system of claim 11 , wherein the operations further comprise: operating as a web server; and receiving the one or more image frames from a user device via a submission page transmitted by the web server to the user device. | 0.701995 |
9,484,020 | 12 | 13 | 12. The system of claim 8 , the computer-readable storage medium having additional instructions stored which result in operations comprising inserting conjunction tags within the unedited text which identify, without relying on punctuation cues, coordinating conjunctions selected from a list. | 12. The system of claim 8 , the computer-readable storage medium having additional instructions stored which result in operations comprising inserting conjunction tags within the unedited text which identify, without relying on punctuation cues, coordinating conjunctions selected from a list. 13. The system of claim 12 , wherein the list comprises {and, but, for, nor, or, so, yet}. | 0.5 |
8,571,932 | 1 | 8 | 1. A computer-implemented method for determining at least one supplemental advertisement to be presented on an advertiser landing Web page, the advertiser landing page being referenced from a user selected advertisement, comprising: a) accepting, by a computer system including one or more computers on a network, advertiser policies provided by an advertiser associated with the advertiser landing Web page, the advertiser policies including 1) a condition that supplemental advertisements on the advertiser landing page must not include any links to another document, and 2) a condition that supplemental advertisements on the advertiser landing page advertise a different product or service than the product or service advertised in the user selected advertisement; b) accepting, by the computer system, search query information sourced from a user device; c) generating, by the computer system and for presentation on the user device, a document with search results determined using the search query information and at least one advertisement determined, by the computer system and using the search query information, wherein each of the at least one advertisement includes a reference to an advertiser landing Web page and wherein each of the at least one advertisement advertises a product or service; d) transmitting, by the computer system and to induce presentation on the user device, the generated document including the search results and the at least one advertisement; e) accepting, by the computer system, a selection, sourced from the user device, of one of the at least one advertisement; f) determining at least one supplemental advertisement, by the computer system, using 1) the search query information, and 2) the accepted advertiser policies including the condition that the at least one supplemental advertisement must not include any links to another document, and the condition that the at least one supplemental advertisement advertises a different product or service than the product or service advertised in the selected at least one advertisement; and g) generating, by the computer system and for presentation on the user device, the advertiser landing Web page referenced from the selected at least one advertisement, the advertiser landing Web page including the at least one supplemental advertisement determined by the computer system. | 1. A computer-implemented method for determining at least one supplemental advertisement to be presented on an advertiser landing Web page, the advertiser landing page being referenced from a user selected advertisement, comprising: a) accepting, by a computer system including one or more computers on a network, advertiser policies provided by an advertiser associated with the advertiser landing Web page, the advertiser policies including 1) a condition that supplemental advertisements on the advertiser landing page must not include any links to another document, and 2) a condition that supplemental advertisements on the advertiser landing page advertise a different product or service than the product or service advertised in the user selected advertisement; b) accepting, by the computer system, search query information sourced from a user device; c) generating, by the computer system and for presentation on the user device, a document with search results determined using the search query information and at least one advertisement determined, by the computer system and using the search query information, wherein each of the at least one advertisement includes a reference to an advertiser landing Web page and wherein each of the at least one advertisement advertises a product or service; d) transmitting, by the computer system and to induce presentation on the user device, the generated document including the search results and the at least one advertisement; e) accepting, by the computer system, a selection, sourced from the user device, of one of the at least one advertisement; f) determining at least one supplemental advertisement, by the computer system, using 1) the search query information, and 2) the accepted advertiser policies including the condition that the at least one supplemental advertisement must not include any links to another document, and the condition that the at least one supplemental advertisement advertises a different product or service than the product or service advertised in the selected at least one advertisement; and g) generating, by the computer system and for presentation on the user device, the advertiser landing Web page referenced from the selected at least one advertisement, the advertiser landing Web page including the at least one supplemental advertisement determined by the computer system. 8. The computer-implemented method of claim 1 wherein the advertiser policies accepted further include a condition precedent to serving the at least one supplemental advertisement. | 0.881579 |
7,526,898 | 7 | 10 | 7. The multiple unit building of claim 3 , wherein each unit includes a semi-private area proximate to the unit and wherein the semi-private area is positioned between the unit and the semi-public area. | 7. The multiple unit building of claim 3 , wherein each unit includes a semi-private area proximate to the unit and wherein the semi-private area is positioned between the unit and the semi-public area. 10. The multiple unit building of claim 7 , wherein each semi-private area is adjacent to a particular unit. | 0.687861 |
7,836,394 | 69 | 70 | 69. The computer-implemented method of claim 55 , further comprising displaying interactive display controls for altering display settings of presented information. | 69. The computer-implemented method of claim 55 , further comprising displaying interactive display controls for altering display settings of presented information. 70. The computer implemented method of claim 69 , wherein the display settings include a group of display settings including: unit scaling, currency, period selection, period order and blank row display. | 0.5 |
7,539,343 | 21 | 25 | 21. A system for classifying regions defined within a digital image, comprising: a tessellation engine operable to define a tessellated set of regions from a plurality of regions identified by a plurality of segmented versions of the digital image; and a classification engine operable to classify each tessellated region according to a likelihood that the tessellated region contains text. | 21. A system for classifying regions defined within a digital image, comprising: a tessellation engine operable to define a tessellated set of regions from a plurality of regions identified by a plurality of segmented versions of the digital image; and a classification engine operable to classify each tessellated region according to a likelihood that the tessellated region contains text. 25. The system of claim 21 , further comprising a link engine operable to link tessellated regions based on a shared word or phrase. | 0.912117 |
9,087,297 | 5 | 6 | 5. The computer-readable storage medium of claim 4 , further comprising instructions for: after training the second classifier, receiving a new video to which the second classifier has not previously been applied; obtaining a first score for the concept by applying the first classifier to the new video; obtaining a second score for the concept by applying the second classifier to the new video; forming a combined score as a function of the first score and the second score; and determining whether the new video represents the first concept based on the combined score. | 5. The computer-readable storage medium of claim 4 , further comprising instructions for: after training the second classifier, receiving a new video to which the second classifier has not previously been applied; obtaining a first score for the concept by applying the first classifier to the new video; obtaining a second score for the concept by applying the second classifier to the new video; forming a combined score as a function of the first score and the second score; and determining whether the new video represents the first concept based on the combined score. 6. The computer-readable storage medium of claim 5 , wherein forming the combined score comprises forming the product of the first score and the second score. | 0.5 |
7,668,802 | 1 | 4 | 1. A method of enforcing application-layer policies to application layer formatted documents, each policy defining a rule and an action, comprising: distinctly storing simple policies and complex policies applicable to the application layer formatted documents in a simple policies data structure, wherein said simple policies data structure stores XPath queries that do not use wildcard β*β and descendent β//β expressions, and, respectively, a complex policies data structure, wherein said complex policies data structure stores XPath queries that use wildcard β*β and descendent β//β expressions; parsing a document received as streaming application layer data in a hierarchical structure, for enabling evaluation of an object in the document, wherein the document is an Extensible Markup Language (XML) document and the object is a result of evaluation of an XPath expression; simultaneously querying the simple and complex policies data structures to identify all policies corresponding to the object; discontinuing the query for the object in the simple and complex policies data structures once all of the simple and complex policies that match the object are identified; and executing the actions defined by the simple and complex policies corresponding to the object. | 1. A method of enforcing application-layer policies to application layer formatted documents, each policy defining a rule and an action, comprising: distinctly storing simple policies and complex policies applicable to the application layer formatted documents in a simple policies data structure, wherein said simple policies data structure stores XPath queries that do not use wildcard β*β and descendent β//β expressions, and, respectively, a complex policies data structure, wherein said complex policies data structure stores XPath queries that use wildcard β*β and descendent β//β expressions; parsing a document received as streaming application layer data in a hierarchical structure, for enabling evaluation of an object in the document, wherein the document is an Extensible Markup Language (XML) document and the object is a result of evaluation of an XPath expression; simultaneously querying the simple and complex policies data structures to identify all policies corresponding to the object; discontinuing the query for the object in the simple and complex policies data structures once all of the simple and complex policies that match the object are identified; and executing the actions defined by the simple and complex policies corresponding to the object. 4. The method of claim 1 , wherein the complex policies data structure is filtered by a compressed Deterministic Finite Automaton (DFA) structure for representing the query, and a stack structure for representing currently active tags of the XML document, the stack structure being used for traversing the DFA structure on receipt of a tag in the document that matches a final location step of the query. | 0.5 |
9,009,256 | 1 | 2 | 1. A non-transitory computer-readable medium embodying a program that, when executed by at least one computing device, causes the at least one computing device to at least: retrieve a first text block from a network site, wherein the first text block corresponds to a user, and the network site includes user generated content; track a retrieval status for the first text block, wherein the retrieval status comprises a time of retrieval; employ a text classifier for generating a score for the first text block, wherein the text classifier is configured to be trained by feedback for determining that a content of the first text block expresses an actionable user concern capable of being addressed by a customer service agent; determine that the content of the first text block expresses the actionable user concern based at least in part on the score satisfying a threshold value; in response to determining that the content of the first text block expresses the actionable user concern, associate the first text block with a queue; and determine that a second text block has been retrieved from the network site. | 1. A non-transitory computer-readable medium embodying a program that, when executed by at least one computing device, causes the at least one computing device to at least: retrieve a first text block from a network site, wherein the first text block corresponds to a user, and the network site includes user generated content; track a retrieval status for the first text block, wherein the retrieval status comprises a time of retrieval; employ a text classifier for generating a score for the first text block, wherein the text classifier is configured to be trained by feedback for determining that a content of the first text block expresses an actionable user concern capable of being addressed by a customer service agent; determine that the content of the first text block expresses the actionable user concern based at least in part on the score satisfying a threshold value; in response to determining that the content of the first text block expresses the actionable user concern, associate the first text block with a queue; and determine that a second text block has been retrieved from the network site. 2. The non-transitory computer-readable medium of claim 1 , wherein the program further causes the at least one computing device to at least employ a set of application programming interface functions. | 0.574153 |
7,562,019 | 1 | 18 | 1. A method for testing a voice enabled application on a target device, the method comprising conducting one or more interactions with the target device, at least some of the interactions comprising: selecting one of a plurality of input modes for sending input to the target device; presenting an acoustic utterance in an acoustic environment to the target device, including presenting a noise signal to the target device, using the selected input mode; determining one of a plurality of response modes for responding to an output of the target device; receiving an output of the target device in response to the acoustic utterance and the noise signal according to the determined response mode; and comparing the output to an output expected from the acoustic utterance; wherein the selected input mode and the determined response mode depend on input/output capabilities of the target device wherein presenting the acoustic utterance further comprises generating the acoustic utterance using an acoustic speaker; wherein the speaker comprises an artificial human mouth; wherein the acoustic environment is produced using an acoustic noise source that generates the noise signal, the noise signal representing one or more environmental noises of a natural environment. | 1. A method for testing a voice enabled application on a target device, the method comprising conducting one or more interactions with the target device, at least some of the interactions comprising: selecting one of a plurality of input modes for sending input to the target device; presenting an acoustic utterance in an acoustic environment to the target device, including presenting a noise signal to the target device, using the selected input mode; determining one of a plurality of response modes for responding to an output of the target device; receiving an output of the target device in response to the acoustic utterance and the noise signal according to the determined response mode; and comparing the output to an output expected from the acoustic utterance; wherein the selected input mode and the determined response mode depend on input/output capabilities of the target device wherein presenting the acoustic utterance further comprises generating the acoustic utterance using an acoustic speaker; wherein the speaker comprises an artificial human mouth; wherein the acoustic environment is produced using an acoustic noise source that generates the noise signal, the noise signal representing one or more environmental noises of a natural environment. 18. The method of claim 1 wherein the target device is a cell phone or a personal digital assistant. | 0.874055 |
9,697,898 | 5 | 7 | 5. The memory system of claim 1 , further comprising a content addressable memory management unit for mapping a virtual memory address in the content addressable memory system to a physical memory address in the content addressable memory system, wherein the content addressable memory management unit raises a miss exception if a content word is not found in a current level of the content addressable stores when searched and searches a next level of content addressable stores for the content word. | 5. The memory system of claim 1 , further comprising a content addressable memory management unit for mapping a virtual memory address in the content addressable memory system to a physical memory address in the content addressable memory system, wherein the content addressable memory management unit raises a miss exception if a content word is not found in a current level of the content addressable stores when searched and searches a next level of content addressable stores for the content word. 7. The memory system of claim 5 , wherein the content addressable memory management brings in a next content page from unordered content addressable store along with its customer sort logic and sort and store content words in the next content page in the current level of content addressable stores. | 0.5 |
9,275,115 | 1 | 13 | 1. A method, in a data processing system comprising a processor and a memory, for dynamically selecting a subset of candidate answer sources for use by a question and answer (QA) system implemented by the data processing system, the method comprising: receiving, by the QA system implemented by the data processing system, an input question for which an answer is sought; generating, by the QA system, one or more queries based on the input question; selecting, by the QA system, a subset of candidate answer sources, from a group of candidate answer sources, based on a ranked listing of candidate answer sources, wherein the ranked listing of candidate answer sources is generated based on characteristics of previous candidate answers generated by the QA system for previously input questions; applying, by the QA system, the one or more queries to the subset of candidate answer sources; generating, by the QA system, at least one candidate answer for the input question based on results of applying the one or more queries to the subset of candidate answer sources; logging, for the previously input questions, in entries of at least one log data structure, the characteristics of previous candidate answers generated by the QA system, wherein the characteristics of each previous candidate answer comprises an identification of a candidate answer source from which the candidate answer was generated and a confidence score associated with the candidate answer; and generating the ranked listing of candidate answer sources based on the entries in the at least one log data structure. | 1. A method, in a data processing system comprising a processor and a memory, for dynamically selecting a subset of candidate answer sources for use by a question and answer (QA) system implemented by the data processing system, the method comprising: receiving, by the QA system implemented by the data processing system, an input question for which an answer is sought; generating, by the QA system, one or more queries based on the input question; selecting, by the QA system, a subset of candidate answer sources, from a group of candidate answer sources, based on a ranked listing of candidate answer sources, wherein the ranked listing of candidate answer sources is generated based on characteristics of previous candidate answers generated by the QA system for previously input questions; applying, by the QA system, the one or more queries to the subset of candidate answer sources; generating, by the QA system, at least one candidate answer for the input question based on results of applying the one or more queries to the subset of candidate answer sources; logging, for the previously input questions, in entries of at least one log data structure, the characteristics of previous candidate answers generated by the QA system, wherein the characteristics of each previous candidate answer comprises an identification of a candidate answer source from which the candidate answer was generated and a confidence score associated with the candidate answer; and generating the ranked listing of candidate answer sources based on the entries in the at least one log data structure. 13. The method of claim 1 , selecting a subset of candidate answer sources, from a group of candidate answer sources, based on a ranked listing of candidate answer sources, further comprises: generating priority values associated with candidate answer sources in the group of candidate answer sources based on one or more prioritization criteria and ratings associated with the candidate answer sources in the group of candidate answer sources, wherein the one or more queries are applied to the subset of candidate answer sources according to priority values associated with candidate answer sources such that the one or more queries are applied to higher priority value candidate answer sources first before applying the one or more queries to lower priority value candidate answer sources. | 0.5 |
9,507,834 | 11 | 17 | 11. A system comprising: a first server configured to: compare a search query against a first collection of data storing an instance of co-occurrence of an entity in a second collection of data, wherein the search query is received from a client, identify a type of entity corresponding to the entity based on the comparing, extract in real-time, the entity from the search query based on the identifying; a second server configured to: select in real-time, a fuzzy matching technique corresponding to the type of the entity, search the first collection of data via the fuzzy matching technique, identify data associated with the search query based on the searching, generate a plurality of suggested search queries from the data based on the identifying, output the suggested search queries to the client such that the suggested search queries are sorted based on match proximity to the search query, wherein at least one of the first server or the second server comprises a main memory hosting a database storing the first collection of data, wherein the database stores at least one of an entity-to-entity index, an entity-to-topic index, or an entity-to-fact index. | 11. A system comprising: a first server configured to: compare a search query against a first collection of data storing an instance of co-occurrence of an entity in a second collection of data, wherein the search query is received from a client, identify a type of entity corresponding to the entity based on the comparing, extract in real-time, the entity from the search query based on the identifying; a second server configured to: select in real-time, a fuzzy matching technique corresponding to the type of the entity, search the first collection of data via the fuzzy matching technique, identify data associated with the search query based on the searching, generate a plurality of suggested search queries from the data based on the identifying, output the suggested search queries to the client such that the suggested search queries are sorted based on match proximity to the search query, wherein at least one of the first server or the second server comprises a main memory hosting a database storing the first collection of data, wherein the database stores at least one of an entity-to-entity index, an entity-to-topic index, or an entity-to-fact index. 17. The system of claim 11 , wherein the suggested search queries are sorted in a descending order. | 0.756158 |
9,357,071 | 1 | 13 | 1. A non-transitory, computer readable medium that controls an executable computer readable program code embodied therein, the executable computer readable program code for implementing a method of analyzing electronic communication data and generating behavioral assessment data therefrom, which method comprises: receiving, by a control processor, an electronic communication in text form from a communicant; analyzing the text of the electronic communication by mining the text of the electronic communication and applying a predetermined linguistic-based psychological behavioral model to the text of the electronic communication; and generating behavioral assessment data including a personality type corresponding to the analyzed text of the electronic communication. | 1. A non-transitory, computer readable medium that controls an executable computer readable program code embodied therein, the executable computer readable program code for implementing a method of analyzing electronic communication data and generating behavioral assessment data therefrom, which method comprises: receiving, by a control processor, an electronic communication in text form from a communicant; analyzing the text of the electronic communication by mining the text of the electronic communication and applying a predetermined linguistic-based psychological behavioral model to the text of the electronic communication; and generating behavioral assessment data including a personality type corresponding to the analyzed text of the electronic communication. 13. The non-transitory, computer readable medium of claim 1 , wherein the behavioral assessment. data includes a plurality of personality types corresponding to the analyzed text of the electronic communication from the communicant. | 0.864959 |
9,788,215 | 14 | 17 | 14. A system, comprising: a communication interface device; and a processor of a first entity configured to: store in a data store for each of a plurality of entities an entity image data comprising metadata about an entity of the plurality of entities, wherein the data store is configured to create and support an organically changing schema, and provides a mechanism to propagate changes to the schema or data; discover a second entity to help achieve an objective, wherein the second entity is a cloud-based entity; connect to a processor of the second entity via the communication interface device; use a meta-language to exchange with the second processor of the second entity via the communication interface a description of the objective to aggregate data from the second entity and descriptive information associated with the second entity, wherein the descriptive information includes an identification of a proprietary data access interface associated with the second entity, wherein the proprietary data access interface associated with the second entity is different than a proprietary data access interface associated with the first entity, wherein a bridge separate from the processor of the first entity and the processor of the second entity is configured to receive the meta-language exchanged with the processor of the second entity and to use an internal standard meta-language to enable the processor of the second entity with the proprietary data access interface to understand the description of the objective; negotiate with the second entity using the meta-language, including by exchanging one or more proposals with the processor of the entity via the communication interface to form a contract, the contract indicates how data will be aggregated from the second entity; receive an indication of a need to recruit a third entity to help achieve the objective; recruit the third entity to help achieve the objective, through a process that includes one or more of the following: discovery, connection, description, negotiation, configuration, initiation of operation, maintenance of operation, and discontinuation of operation; and in the event the contract is formed, perform a self-configuration in accordance with the contract; and a memory coupled with the processor, wherein the memory is configured to provide the processor with instructions. | 14. A system, comprising: a communication interface device; and a processor of a first entity configured to: store in a data store for each of a plurality of entities an entity image data comprising metadata about an entity of the plurality of entities, wherein the data store is configured to create and support an organically changing schema, and provides a mechanism to propagate changes to the schema or data; discover a second entity to help achieve an objective, wherein the second entity is a cloud-based entity; connect to a processor of the second entity via the communication interface device; use a meta-language to exchange with the second processor of the second entity via the communication interface a description of the objective to aggregate data from the second entity and descriptive information associated with the second entity, wherein the descriptive information includes an identification of a proprietary data access interface associated with the second entity, wherein the proprietary data access interface associated with the second entity is different than a proprietary data access interface associated with the first entity, wherein a bridge separate from the processor of the first entity and the processor of the second entity is configured to receive the meta-language exchanged with the processor of the second entity and to use an internal standard meta-language to enable the processor of the second entity with the proprietary data access interface to understand the description of the objective; negotiate with the second entity using the meta-language, including by exchanging one or more proposals with the processor of the entity via the communication interface to form a contract, the contract indicates how data will be aggregated from the second entity; receive an indication of a need to recruit a third entity to help achieve the objective; recruit the third entity to help achieve the objective, through a process that includes one or more of the following: discovery, connection, description, negotiation, configuration, initiation of operation, maintenance of operation, and discontinuation of operation; and in the event the contract is formed, perform a self-configuration in accordance with the contract; and a memory coupled with the processor, wherein the memory is configured to provide the processor with instructions. 17. The system of claim 14 , wherein the second entity maintains, after termination of an operation associated with helping to achieve the objective, a ghost or other vestige of a configuration used to help achieve the objective. | 0.514831 |
8,489,601 | 6 | 7 | 6. The method of claim 5 , wherein the step of reconstructing each service repair verbatim includes identifying part words, symptom words, and repair action words in each service repair verbatim. | 6. The method of claim 5 , wherein the step of reconstructing each service repair verbatim includes identifying part words, symptom words, and repair action words in each service repair verbatim. 7. The method of claim 6 , wherein the step of reconstructing each service repair verbatim includes tokenization, wherein non-essential wording, characters, and white spaces are removed from each service repair verbatim. | 0.624573 |
8,239,751 | 1 | 3 | 1. A computer-implemented method for adding information to a spreadsheet, comprising: on a client system having one or more processors and memory storing one or more programs to be executed by the one or more processors: displaying a spreadsheet; receiving a request to add a cell value to the spreadsheet, the request containing a reference to an object and an attribute; generating a query corresponding to the request; sending the query to a fact repository; receiving the requested cell value from the fact repository, wherein the cell value correspond to a value of a fact, the fact being associated with an object in the fact repository, wherein a respective fact includes an attribute field indicating an attribute and a value field describing the indicated attributes, wherein objects in the fact repository are created by: extracting facts from web documents; determining entities with which the extracted facts are associated; storing the extracted facts in the fact repository; and associating the stored extracted facts with objects corresponding to the determined entities; inserting the received cell value into the spreadsheet. | 1. A computer-implemented method for adding information to a spreadsheet, comprising: on a client system having one or more processors and memory storing one or more programs to be executed by the one or more processors: displaying a spreadsheet; receiving a request to add a cell value to the spreadsheet, the request containing a reference to an object and an attribute; generating a query corresponding to the request; sending the query to a fact repository; receiving the requested cell value from the fact repository, wherein the cell value correspond to a value of a fact, the fact being associated with an object in the fact repository, wherein a respective fact includes an attribute field indicating an attribute and a value field describing the indicated attributes, wherein objects in the fact repository are created by: extracting facts from web documents; determining entities with which the extracted facts are associated; storing the extracted facts in the fact repository; and associating the stored extracted facts with objects corresponding to the determined entities; inserting the received cell value into the spreadsheet. 3. The method of claim 1 , wherein the reference to the object and the attribute are each specified using one of a literal value and a spreadsheet cell reference. | 0.761062 |
9,552,417 | 4 | 5 | 4. The system according to claim 2 , wherein the data normalization processor is configured to utilize a matching algorithm to atomize the data record for the monitored telephone conversation with respect to the multimedia data warehouse. | 4. The system according to claim 2 , wherein the data normalization processor is configured to utilize a matching algorithm to atomize the data record for the monitored telephone conversation with respect to the multimedia data warehouse. 5. The system according to claim 4 , wherein the matching algorithm is a soundex algorithm. | 0.5 |
10,019,479 | 7 | 8 | 7. An article comprising a non-transitory computer-readable medium having instructions for polymorphic selection of data from a database storing data on at least one memory device and managed by one or more hardware processors that, when executed by one or more processors, cause the one or more processors to: receive, with the one or more processors, a request that has at least a database query compatible with salesforce object query language (SOQL), wherein the database query comprises at least an expression using a polymorphic relationship and a SELECT clause; add, with the one or more processors, a TYPEOF expression to the SELECT clause to function as a case expression to allow specification of fields of a related parent object that are to be selected based on the polymorphic relationship; process the request utilizing the polymorphic relationship, with the one or more processors, by running the query against a portion of a set of data in the database; transmit, with the one or more processors, a result for the database query, where the result is defined by at least the polymorphic relationship, to a remote electronic device. | 7. An article comprising a non-transitory computer-readable medium having instructions for polymorphic selection of data from a database storing data on at least one memory device and managed by one or more hardware processors that, when executed by one or more processors, cause the one or more processors to: receive, with the one or more processors, a request that has at least a database query compatible with salesforce object query language (SOQL), wherein the database query comprises at least an expression using a polymorphic relationship and a SELECT clause; add, with the one or more processors, a TYPEOF expression to the SELECT clause to function as a case expression to allow specification of fields of a related parent object that are to be selected based on the polymorphic relationship; process the request utilizing the polymorphic relationship, with the one or more processors, by running the query against a portion of a set of data in the database; transmit, with the one or more processors, a result for the database query, where the result is defined by at least the polymorphic relationship, to a remote electronic device. 8. The article of claim 7 wherein the database query is for a multitenant database. | 0.662602 |
7,672,841 | 15 | 17 | 15. The method of claim 1 , wherein said words in said speech data are recognized in real time. | 15. The method of claim 1 , wherein said words in said speech data are recognized in real time. 17. The method of claim 15 further including a step: specifying that a natural language engine should return multiple results for the speech data from different servers. | 0.5 |
8,495,572 | 1 | 13 | 1. An apparatus for identifying a contextual change to a source code file, in a development environment, the apparatus comprising: a computer device, including: a detector component for detecting a modification to the source code file, wherein the detector component retrieves, in response to detecting the modification to the source code file, a syntactic rule set for a programming language of the modified source code file, the syntactic rule set including a plurality of syntactic constructs for the programming language; a requester component for retrieving a previous version of the modified source code file; a parser component for parsing a first source code set associated with the source code file and a second source code set associated with the previous version of the source code file and for building an in-memory representation of the first and second source code sets, wherein the parser component, in response to the detector component retrieving the syntactic rule set and determining a plurality of relationships between the plurality of syntactic constructs, builds the in-memory representation using the syntactic rule set; a comparator component for comparing the in-memory representation of the first source code set with the in-memory representation of the second source code set in order to generate contextual information identifying a change made to a source code element associated with the modified source code set; a subscription component for receiving, from a subscriber, a subscription for notification of the generated contextual information, the subscription identifying a portion of the source code file; and a publisher component for publishing, using a data feed, the generated contextual information based on the received subscription, wherein the generated contextual information is published to the subscriber only if the comparator component identifies that a change has been made to the portion of the source code file identified by the subscriber in the subscription. | 1. An apparatus for identifying a contextual change to a source code file, in a development environment, the apparatus comprising: a computer device, including: a detector component for detecting a modification to the source code file, wherein the detector component retrieves, in response to detecting the modification to the source code file, a syntactic rule set for a programming language of the modified source code file, the syntactic rule set including a plurality of syntactic constructs for the programming language; a requester component for retrieving a previous version of the modified source code file; a parser component for parsing a first source code set associated with the source code file and a second source code set associated with the previous version of the source code file and for building an in-memory representation of the first and second source code sets, wherein the parser component, in response to the detector component retrieving the syntactic rule set and determining a plurality of relationships between the plurality of syntactic constructs, builds the in-memory representation using the syntactic rule set; a comparator component for comparing the in-memory representation of the first source code set with the in-memory representation of the second source code set in order to generate contextual information identifying a change made to a source code element associated with the modified source code set; a subscription component for receiving, from a subscriber, a subscription for notification of the generated contextual information, the subscription identifying a portion of the source code file; and a publisher component for publishing, using a data feed, the generated contextual information based on the received subscription, wherein the generated contextual information is published to the subscriber only if the comparator component identifies that a change has been made to the portion of the source code file identified by the subscriber in the subscription. 13. The apparatus as claimed in claim 1 , wherein the detecting is in response to a saving file activation in an editor component. | 0.801829 |
5,392,363 | 17 | 18 | 17. A method as set forth in claim 15 wherein the step of operating the decoder processor to process the frames further includes a step of managing a stack having a plurality of entries, each of the entries including information for specifying a node of the vocabulary model, information for identifying a row and a column location within the two dimensional array, and a normalized probability that a letter string associated with the node represents at least a part of the word written by the writer. | 17. A method as set forth in claim 15 wherein the step of operating the decoder processor to process the frames further includes a step of managing a stack having a plurality of entries, each of the entries including information for specifying a node of the vocabulary model, information for identifying a row and a column location within the two dimensional array, and a normalized probability that a letter string associated with the node represents at least a part of the word written by the writer. 18. A method as set forth in claim 17 wherein the step of operating the decoder processor to process the frames further includes the steps of: storing a hash table having a plurality of entries, each of the hash table entries including information for specifying the normalized probability stored within an entry of the stack; and generating an index into the hash table in accordance with information that specifies a node of the vocabulary model and in accordance with information that identifies a row and a column location within the two dimensional array. | 0.5 |
8,554,761 | 23 | 33 | 23. A method comprising: transforming a first query to a transformed query; wherein the first query includes: a first outer join of a first database object and a second database object, and a first join predicate that specifies a first condition of the first database object for the first outer join, wherein the first join predicate does not reference the second database object; wherein the transformed query does not include the first join predicate but does include: a second predicate that specifies a second condition of the first database object, wherein the second predicate references the second database object; wherein the transformed query is semantically equivalent to the first query; generating an execution plan for executing the transformed query instead of the first query; wherein the method is performed by one or more computing devices. | 23. A method comprising: transforming a first query to a transformed query; wherein the first query includes: a first outer join of a first database object and a second database object, and a first join predicate that specifies a first condition of the first database object for the first outer join, wherein the first join predicate does not reference the second database object; wherein the transformed query does not include the first join predicate but does include: a second predicate that specifies a second condition of the first database object, wherein the second predicate references the second database object; wherein the transformed query is semantically equivalent to the first query; generating an execution plan for executing the transformed query instead of the first query; wherein the method is performed by one or more computing devices. 33. The method of claim 23 , wherein the second predicate is for a left outer join of the first database object and the second database object, wherein the transformed query, if executed, would cause a temporary organization of data from the first database object and the second database object and utilization of the temporary organization of data for evaluation of multiple rows of the left outer join. | 0.667763 |
8,812,496 | 3 | 4 | 3. The system of claim 2 , wherein the set of queries include a first set of queries in which the target social role is email sender and a second set of queries in which the target social role is email recipient. | 3. The system of claim 2 , wherein the set of queries include a first set of queries in which the target social role is email sender and a second set of queries in which the target social role is email recipient. 4. The system of claim 3 , wherein the electronic processing device is further configured to perform operations including: generating the first set of queries from a set of email documents annotated with a known email address as the email sender; and generating the second set of queries from a set of email documents annotated with the known email address as the email recipient; wherein the repeating comprises repeating the computing for each of a plurality of different email addresses corresponding to the set of persons of interest to compute a relevance score for each email address; and wherein the selecting (ii) comprises selecting at least one candidate alias email address from the plurality of different email addresses based on the relevance scores. | 0.5 |
5,590,319 | 1 | 7 | 1. A query processor for parallel processing of first signals indicative of an input query referencing information stored in one or more databases each of which is accessible through an independent database engine, said input query specifying conditions for an answer set of said information, comprising, translator means for analyzing said first signals and transforming them into second signals representing queries each of which is directed to one or more base tables, splitter means for receiving said second signals and producing therefrom third signals corresponding to a plurality of separate queries capable of being executed independently and in parallel, each of said separate queries being compatible with one of said database engines, and runner means for applying said third signals simultaneously to respective ones of said database engines, receiving, in response thereto, fourth signals generated by each of said database engines which correspond to answer sets for the separate queries, and, producing fifth signals representing an answer set for said input query. | 1. A query processor for parallel processing of first signals indicative of an input query referencing information stored in one or more databases each of which is accessible through an independent database engine, said input query specifying conditions for an answer set of said information, comprising, translator means for analyzing said first signals and transforming them into second signals representing queries each of which is directed to one or more base tables, splitter means for receiving said second signals and producing therefrom third signals corresponding to a plurality of separate queries capable of being executed independently and in parallel, each of said separate queries being compatible with one of said database engines, and runner means for applying said third signals simultaneously to respective ones of said database engines, receiving, in response thereto, fourth signals generated by each of said database engines which correspond to answer sets for the separate queries, and, producing fifth signals representing an answer set for said input query. 7. A query processor in accordance with claim 1, further comprising code generator means operatively connected to said splitter means for converting said third signals to correspond to text understood by said database engines. | 0.666667 |
9,378,740 | 1 | 3 | 1. A system comprising: a computer-readable memory storing executable instructions; and one or more physical computer processors in communication with the computer-readable memory, wherein the one or more physical computer processors are programmed by the executable instructions to at least: receive audio data from a client device; perform automatic speech recognition to obtain a transcript of the audio data, the transcript including first text for the audio data; select an intent definition from a plurality of intent definitions, the intent definition selected based on a first textual expression included in the intent definition and on the first text; generate second text using the first text and the intent definition, wherein a portion of the second text matches the first text, wherein the second text corresponds to a second textual expression included in the intent definition; and transmit the second text to the client device. | 1. A system comprising: a computer-readable memory storing executable instructions; and one or more physical computer processors in communication with the computer-readable memory, wherein the one or more physical computer processors are programmed by the executable instructions to at least: receive audio data from a client device; perform automatic speech recognition to obtain a transcript of the audio data, the transcript including first text for the audio data; select an intent definition from a plurality of intent definitions, the intent definition selected based on a first textual expression included in the intent definition and on the first text; generate second text using the first text and the intent definition, wherein a portion of the second text matches the first text, wherein the second text corresponds to a second textual expression included in the intent definition; and transmit the second text to the client device. 3. The system of claim 1 , wherein the one or more physical computer processors are further programmed by the executable instructions to: select a second intent definition from the plurality of intent definitions, wherein the second intent definition is identified by the first text; and generate third text using the first text and the second intent definition, wherein a portion of the third text matches the first text, wherein the third text corresponds to one of the second textual expressions included in the second intent definition. | 0.5 |
7,742,922 | 29 | 34 | 29. A computing system comprising: a memory configured to store instructions; and a processor configured to execute the instructions to: receive voiced utterances from a user; convert said voiced utterances into data; identify from said data, information including: (i) a query term to be searched for of a plurality of query terms to be searched for, (ii) a search engine identifier of a plurality of search engines identifiers representing a search engine of a plurality of search engines; modify said query term to be searched for of a plurality of query terms to be searched for by replacing any spaces in said query term to be searched for of a plurality of query terms to be searched for with a query term separator compatible with said search engine of a plurality of search engines, creating a modified query term to be searched for; construct a uniform resource locator that includes said modified query term to be searched for, such that said constructed uniform resource locator represents a valid request to said search engine of a plurality of search engines to perform a search; open said constructed uniform resource locator, via a uniform resource locator transmission method. | 29. A computing system comprising: a memory configured to store instructions; and a processor configured to execute the instructions to: receive voiced utterances from a user; convert said voiced utterances into data; identify from said data, information including: (i) a query term to be searched for of a plurality of query terms to be searched for, (ii) a search engine identifier of a plurality of search engines identifiers representing a search engine of a plurality of search engines; modify said query term to be searched for of a plurality of query terms to be searched for by replacing any spaces in said query term to be searched for of a plurality of query terms to be searched for with a query term separator compatible with said search engine of a plurality of search engines, creating a modified query term to be searched for; construct a uniform resource locator that includes said modified query term to be searched for, such that said constructed uniform resource locator represents a valid request to said search engine of a plurality of search engines to perform a search; open said constructed uniform resource locator, via a uniform resource locator transmission method. 34. The apparatus of claim 29 , wherein the computing system is a wireless device. | 0.633929 |
9,633,103 | 1 | 6 | 1. A method for supplementing product information, the method comprising, by a computer system: receiving a plurality of keywords; for each keyword of at least a portion of the plurality of keywords, obtaining a result set for the each keyword by searching a product taxonomy; obtaining a filtered set of keywords from the at least the portion of the plurality of keywords by filtering a set of keywords according to categories of result sets for the set of keywords, wherein the obtaining comprises, for the each keyword of the at least the portion of the plurality of keywords and the result set for the each keyword: evaluating a categorical similarity among products of the result set for the each keyword, wherein the evaluating comprises calculating a category consistency of the result set for the each keyword, and wherein the calculating comprises calculating the category consistency as n/(N-n), where n is a number of products in the result set for the each keyword and belonging to a most common category in categories represented in the result set for the each keyword and where N is a total number of products in the result set for the each keyword; assigning a score to the each keyword according to the categorical similarity; and filtering the at least the portion of the plurality of keywords according to scores assigned thereto to obtain the filtered set of keywords; and defining product groups for at least a portion of the filtered set of keywords, each product group having associated therewith a keyword from the filtered set of keywords and one or more products from the result set for the keyword from the filtered set of keywords. | 1. A method for supplementing product information, the method comprising, by a computer system: receiving a plurality of keywords; for each keyword of at least a portion of the plurality of keywords, obtaining a result set for the each keyword by searching a product taxonomy; obtaining a filtered set of keywords from the at least the portion of the plurality of keywords by filtering a set of keywords according to categories of result sets for the set of keywords, wherein the obtaining comprises, for the each keyword of the at least the portion of the plurality of keywords and the result set for the each keyword: evaluating a categorical similarity among products of the result set for the each keyword, wherein the evaluating comprises calculating a category consistency of the result set for the each keyword, and wherein the calculating comprises calculating the category consistency as n/(N-n), where n is a number of products in the result set for the each keyword and belonging to a most common category in categories represented in the result set for the each keyword and where N is a total number of products in the result set for the each keyword; assigning a score to the each keyword according to the categorical similarity; and filtering the at least the portion of the plurality of keywords according to scores assigned thereto to obtain the filtered set of keywords; and defining product groups for at least a portion of the filtered set of keywords, each product group having associated therewith a keyword from the filtered set of keywords and one or more products from the result set for the keyword from the filtered set of keywords. 6. The method of claim 1 , further comprising for each keyword of the filtered set of keywords and each result set for the keyword of the result sets corresponding to the each keyword, removing from the result sets products that do not belong to a most common category represented in the result set for the keyword. | 0.535398 |
7,644,052 | 9 | 11 | 9. The method of claim 1 , wherein the indication of symbolic knowledge comprises a tag and a keyword, the tag indicating an existing symbolic ontology, and the populating comprising mining the existing symbolic ontology based on the keyword to obtain the symbolic knowledge. | 9. The method of claim 1 , wherein the indication of symbolic knowledge comprises a tag and a keyword, the tag indicating an existing symbolic ontology, and the populating comprising mining the existing symbolic ontology based on the keyword to obtain the symbolic knowledge. 11. The method of claim 9 , wherein the indication of sample data comprises a second tag and references to sample documents, the second tag indicating the statistical machine learning process selected from multiple available statistical machine learning processes. | 0.5 |
8,364,470 | 17 | 18 | 17. A computing system for finding variants of a reference term in a text, wherein said computing system is configured to: provide a list of reference terms; break down text and a list of reference terms into tokens; generate at least one acronym candidate in the text for mapping to at least one of the reference terms; compare characters of the acronym candidate to characters of the reference term according to one or more mapping rules; generate a confidence value of the mapping based on said comparison of characters; and rank acronym candidates according to their confidence values. | 17. A computing system for finding variants of a reference term in a text, wherein said computing system is configured to: provide a list of reference terms; break down text and a list of reference terms into tokens; generate at least one acronym candidate in the text for mapping to at least one of the reference terms; compare characters of the acronym candidate to characters of the reference term according to one or more mapping rules; generate a confidence value of the mapping based on said comparison of characters; and rank acronym candidates according to their confidence values. 18. The computing system of claim 17 , wherein said computing system is further configured to: determine a number of characters of the acronym candidate which map to characters of the reference term; determine an order of the characters in the acronym candidate which map to characters of the reference term; and determine the confidence value of the mapping based on said number and order of characters. | 0.715493 |
8,694,529 | 12 | 20 | 12. A computer-implemented method for facilitating a search, comprising: under control of one or more computer systems configured with executable instructions, categorizing at least some of a first plurality of items included in a search result set of items into at least one of a plurality of categories arranged in a category hierarchy having a root category; selecting a second plurality of items from the first plurality of items based at least in part on one or more search terms and independent of categories in the category hierarchy other than the root category; selecting a plurality of refinements from a set of refinements based at least in part on the one or more search terms and a map depicting a plurality of associations between search terms and categories of the category hierarchy, and links between the categories and the set of refinements; receiving a selection of at least one of the plurality of refinements linked to the at least one of a plurality of categories; maintaining a log of a number of times the at least one refinement of the plurality of refinements is selected during searches employing the one or more search terms in one or more time periods; determining a possibly relevant set of categories of the category hierarchy below a distinguished category based at least in part on the log; increasing an associative confidence between at least one of the one or more search terms and a subset of the set of refinements linked to the possibly relevant set of categories based at least in part on the log; determining the subset of the set of refinements linked to the possibly relevant set of categories when the associative confidence at least meets a first sufficiency threshold; providing said subset of the set of refinements for presentation; and constraining subsequent search result sets to a particular distinguished category, based at least on the one or more search terms, when the associative confidence meets at least a sufficiency second threshold. | 12. A computer-implemented method for facilitating a search, comprising: under control of one or more computer systems configured with executable instructions, categorizing at least some of a first plurality of items included in a search result set of items into at least one of a plurality of categories arranged in a category hierarchy having a root category; selecting a second plurality of items from the first plurality of items based at least in part on one or more search terms and independent of categories in the category hierarchy other than the root category; selecting a plurality of refinements from a set of refinements based at least in part on the one or more search terms and a map depicting a plurality of associations between search terms and categories of the category hierarchy, and links between the categories and the set of refinements; receiving a selection of at least one of the plurality of refinements linked to the at least one of a plurality of categories; maintaining a log of a number of times the at least one refinement of the plurality of refinements is selected during searches employing the one or more search terms in one or more time periods; determining a possibly relevant set of categories of the category hierarchy below a distinguished category based at least in part on the log; increasing an associative confidence between at least one of the one or more search terms and a subset of the set of refinements linked to the possibly relevant set of categories based at least in part on the log; determining the subset of the set of refinements linked to the possibly relevant set of categories when the associative confidence at least meets a first sufficiency threshold; providing said subset of the set of refinements for presentation; and constraining subsequent search result sets to a particular distinguished category, based at least on the one or more search terms, when the associative confidence meets at least a sufficiency second threshold. 20. A computer-implemented method according to claim 12 , wherein ordering the plurality of refinements comprises ordering at least some of the plurality of refinements pseudorandomly. | 0.725373 |
9,311,296 | 6 | 7 | 6. A method of providing semantic phrase suggestions, comprising: receiving initial user input including a plurality of terms, the initial user input coming from a user who is associated with a group of users from a plurality of groups, and wherein each of the plurality of terms includes an importance indicator defined for a specific group of users; for each respective term: identifying, with an electronic processor, an associated term type if the respective term is defined in the semantic network; identifying, with the electronic processor, alternative terms related to the respective term and having a same term type and a calculated user-specific importance indicator that is greater than its related respective term; and if the respective term is not defined in the semantic network, providing alternative spelling suggestions based on the initial user input and spelling conditions, wherein user-specific importance indicator includes term importance information for a combination of all users, user groups, and a particular user, and includes the relative importance of one or more knowledge domains defined by a combination of the particular user and the particular user's associated user groups, and wherein calculation of a greater importance indicator generates an importance indicator associated with each alternative term that is associated with the group of users and indicates importance greater than the importance indicator associated with the respective term and associated with the group of users. | 6. A method of providing semantic phrase suggestions, comprising: receiving initial user input including a plurality of terms, the initial user input coming from a user who is associated with a group of users from a plurality of groups, and wherein each of the plurality of terms includes an importance indicator defined for a specific group of users; for each respective term: identifying, with an electronic processor, an associated term type if the respective term is defined in the semantic network; identifying, with the electronic processor, alternative terms related to the respective term and having a same term type and a calculated user-specific importance indicator that is greater than its related respective term; and if the respective term is not defined in the semantic network, providing alternative spelling suggestions based on the initial user input and spelling conditions, wherein user-specific importance indicator includes term importance information for a combination of all users, user groups, and a particular user, and includes the relative importance of one or more knowledge domains defined by a combination of the particular user and the particular user's associated user groups, and wherein calculation of a greater importance indicator generates an importance indicator associated with each alternative term that is associated with the group of users and indicates importance greater than the importance indicator associated with the respective term and associated with the group of users. 7. The method of claim 6 , wherein each user-specific importance indicator defines how many times a respective term was used by a particular set of users. | 0.5 |
8,510,347 | 19 | 23 | 19. A computer program product for use with a stored program computer, the computer program product comprising a non-transitory computer usable medium having a computer readable program code embodied therein for generating one or more software artifacts, the one or more software artifacts being generated for one or more requirements associated with an enterprise process, the computer readable program code comprising instructions for: a. capturing the one or more requirements; b. enabling a user to define a plurality of sets of meta-models, each of the sets of meta-models corresponding to at least one requirement and defined based on a predefined ontology, the predefined ontology comprising rules for defining and inter-relating meta models, and wherein at least one meta-model of a set of meta-models of the plurality of sets of meta-models being defined based on at least one other meta-model of the same set of meta-models, wherein each of the plurality of sets of meta-models comprises (i) one or more intent meta-models, each intent meta-model describing the corresponding requirement, wherein each intent meta-model is defined by a user, (ii) one or more inference meta-models for each intent meta-model, each inference meta-model describing business and technical requirements required for generating at least one software artifact of the one or more software artifacts, the business and technical requirements being determined based on the at least one requirement, each inference meta-model being defined by the user, (iii) a composer meta-model corresponding to the one or more inference meta-models, the composer meta-model defining the relation between the intent meta-model and the corresponding one or more inference meta-models, each composer meta-model being defined by the user, and (iv) a set of abstract meta-models, each abstract meta-model of the set of abstract meta-models being inherited from a predefined set of abstract meta-models while defining at least one of the one or more intent meta-models, at least one of the one or more inference meta-models and at least one composer meta-model c. enabling the user to build the meta-model schema by connecting at least one set of meta-models from among the plurality of sets of meta-models to at least one other set of meta-models from among the plurality of sets of meta-models, the connection being based on relations between the corresponding requirements; and d. calculating a completeness of the meta-model schema, the completeness of the meta-model schema being a function of: (i) a number of intent meta-models defined for the one or more requirements, (ii) a number of inference meta-models defined for each intent meta-model, (iii) a number of composer meta-models defined corresponding to the inference meta-models, and (iv) a number of meta-models of the one or more sets of meta-models that have a reference to at least one other meta-model of the set of meta-models, each reference being defined by the user, wherein the completeness of the meta-model schema is additionally a function of a number of quantifiable requirements among the one or more requirements, and wherein the completeness of the meta-model schema is calculated according to the following formula: SC=(Na/Nb)*(Nc/Nd)*((Ne+NfβNg)/(Ne+Nf)), wherein SC is the completeness of the meta-model schema, Na is a number of intent meta-models, Nb is the number of quantifiable requirements, Nc is a number of intent meta-models from which inference meta-models have been defined, Nd is a total number of intent meta-models, Ne is a number of inference meta-models, Nf is a number of composer meta-models, and Ng is a number of meta-models without a reference to other meta-models. | 19. A computer program product for use with a stored program computer, the computer program product comprising a non-transitory computer usable medium having a computer readable program code embodied therein for generating one or more software artifacts, the one or more software artifacts being generated for one or more requirements associated with an enterprise process, the computer readable program code comprising instructions for: a. capturing the one or more requirements; b. enabling a user to define a plurality of sets of meta-models, each of the sets of meta-models corresponding to at least one requirement and defined based on a predefined ontology, the predefined ontology comprising rules for defining and inter-relating meta models, and wherein at least one meta-model of a set of meta-models of the plurality of sets of meta-models being defined based on at least one other meta-model of the same set of meta-models, wherein each of the plurality of sets of meta-models comprises (i) one or more intent meta-models, each intent meta-model describing the corresponding requirement, wherein each intent meta-model is defined by a user, (ii) one or more inference meta-models for each intent meta-model, each inference meta-model describing business and technical requirements required for generating at least one software artifact of the one or more software artifacts, the business and technical requirements being determined based on the at least one requirement, each inference meta-model being defined by the user, (iii) a composer meta-model corresponding to the one or more inference meta-models, the composer meta-model defining the relation between the intent meta-model and the corresponding one or more inference meta-models, each composer meta-model being defined by the user, and (iv) a set of abstract meta-models, each abstract meta-model of the set of abstract meta-models being inherited from a predefined set of abstract meta-models while defining at least one of the one or more intent meta-models, at least one of the one or more inference meta-models and at least one composer meta-model c. enabling the user to build the meta-model schema by connecting at least one set of meta-models from among the plurality of sets of meta-models to at least one other set of meta-models from among the plurality of sets of meta-models, the connection being based on relations between the corresponding requirements; and d. calculating a completeness of the meta-model schema, the completeness of the meta-model schema being a function of: (i) a number of intent meta-models defined for the one or more requirements, (ii) a number of inference meta-models defined for each intent meta-model, (iii) a number of composer meta-models defined corresponding to the inference meta-models, and (iv) a number of meta-models of the one or more sets of meta-models that have a reference to at least one other meta-model of the set of meta-models, each reference being defined by the user, wherein the completeness of the meta-model schema is additionally a function of a number of quantifiable requirements among the one or more requirements, and wherein the completeness of the meta-model schema is calculated according to the following formula: SC=(Na/Nb)*(Nc/Nd)*((Ne+NfβNg)/(Ne+Nf)), wherein SC is the completeness of the meta-model schema, Na is a number of intent meta-models, Nb is the number of quantifiable requirements, Nc is a number of intent meta-models from which inference meta-models have been defined, Nd is a total number of intent meta-models, Ne is a number of inference meta-models, Nf is a number of composer meta-models, and Ng is a number of meta-models without a reference to other meta-models. 23. The computer program product of claim 19 , wherein each software artifact of the one or more software artifacts corresponds to each set of meta-models. | 0.745066 |
9,262,465 | 13 | 17 | 13. A computer system for determining whether a mismatch is present between content and a description associated with a literary work, the system comprising: one or more processor; and one or more memory having processor-executable instructions that, in response to execution by the one or more processor, cause the computer system to: receive, from a user, a content and a description; identify one or more description stems associated with the received description, each description stem to correspond to one or more words included in the description; identify one or more content stems associated with the received content, each content stem to correspond to one or more words included in the content; calculate a matching score based at least in part on whether one or more description stems identified in the description match one or more contents stems identified in the content; and determine whether the received description and the received content correspond to a same literary work based at least in part on the calculated matching score. | 13. A computer system for determining whether a mismatch is present between content and a description associated with a literary work, the system comprising: one or more processor; and one or more memory having processor-executable instructions that, in response to execution by the one or more processor, cause the computer system to: receive, from a user, a content and a description; identify one or more description stems associated with the received description, each description stem to correspond to one or more words included in the description; identify one or more content stems associated with the received content, each content stem to correspond to one or more words included in the content; calculate a matching score based at least in part on whether one or more description stems identified in the description match one or more contents stems identified in the content; and determine whether the received description and the received content correspond to a same literary work based at least in part on the calculated matching score. 17. The computer system of claim 13 , wherein the instructions further cause the computer system to: provide an indication that the received description and the received content do not correspond to the same literary work based on the determination whether the received description and the received content correspond to the same literary work. | 0.7429 |
7,831,600 | 1 | 2 | 1. A method of managing internal cluster communications in a cluster of application server instances, comprising: executing a plurality of work processes in the application server instances; establishing internal connections for internal cluster communication between a message server and each of the plurality of work processes executing in the application server instances, wherein internal cluster communication comprises internal communications relating to at least one of events occurring in the cluster and an exchange of messages between work processes executing in the application server instances, the internal connections separate from connections for external cluster communication; providing a message service for the internal cluster communication, the internal cluster communication including inter-application server instance communication via the message server in accordance with a connection-based message passing protocol in which an internal connection established in the message server receives a notification message for each event occurring in the cluster and sends acknowledgement messages to internal connections established in the application server instances responsive to receiving messages being exchanged between work processes executing in the application server instances, the message server being shared by the application server instances through the established internal connections for internal cluster communication between the message server and each of the plurality of work processes executing in the application server instances; operating a cluster manager to manage the internal cluster communication in accordance with the connection-based message passing protocol, the internal cluster communication sent over the established internal connections for internal cluster communications between the message server and each of the plurality of work processes executing in the application server instances, the cluster manager: communicating an event in the cluster to the message server using an event handler, the event handler sending a notification message of the event to the message server; relaying the notification message of the event in the cluster to one or more of the application server instances using a notification handler, the notification handler causing a function to be performed in one or more of the application server instances responsive to receiving the notification message; and communicating messages to be exchanged between work processes executing in the application server instances to and from the message server using a message server communication handler, the message server communication handler: acknowledging receipt of messages received from the work processes; and relaying messages received from an originating work process to a destination work process, including replicating a multicast message received from the originating work process for broadcast to all other work processes executing in the application server instances. | 1. A method of managing internal cluster communications in a cluster of application server instances, comprising: executing a plurality of work processes in the application server instances; establishing internal connections for internal cluster communication between a message server and each of the plurality of work processes executing in the application server instances, wherein internal cluster communication comprises internal communications relating to at least one of events occurring in the cluster and an exchange of messages between work processes executing in the application server instances, the internal connections separate from connections for external cluster communication; providing a message service for the internal cluster communication, the internal cluster communication including inter-application server instance communication via the message server in accordance with a connection-based message passing protocol in which an internal connection established in the message server receives a notification message for each event occurring in the cluster and sends acknowledgement messages to internal connections established in the application server instances responsive to receiving messages being exchanged between work processes executing in the application server instances, the message server being shared by the application server instances through the established internal connections for internal cluster communication between the message server and each of the plurality of work processes executing in the application server instances; operating a cluster manager to manage the internal cluster communication in accordance with the connection-based message passing protocol, the internal cluster communication sent over the established internal connections for internal cluster communications between the message server and each of the plurality of work processes executing in the application server instances, the cluster manager: communicating an event in the cluster to the message server using an event handler, the event handler sending a notification message of the event to the message server; relaying the notification message of the event in the cluster to one or more of the application server instances using a notification handler, the notification handler causing a function to be performed in one or more of the application server instances responsive to receiving the notification message; and communicating messages to be exchanged between work processes executing in the application server instances to and from the message server using a message server communication handler, the message server communication handler: acknowledging receipt of messages received from the work processes; and relaying messages received from an originating work process to a destination work process, including replicating a multicast message received from the originating work process for broadcast to all other work processes executing in the application server instances. 2. The method of claim 1 , wherein the application server instance is a web application server instance. | 0.87935 |
10,055,457 | 1 | 7 | 1. A computer-implemented method, comprising: obtaining one or more query terms in a first query; and for each of the one or more query terms: searching a standardized entity taxonomy to locate a standardized entity that most closely matches the query term, the standardized entity taxonomy comprising an entity identification for each of a plurality of different standardized entities; calculating a confidence score for a query term-standardized entity pair for the standardized entity that most closely matches the query term; in response to a determination that the confidence score transgresses a threshold, associating the query term with the entity identification corresponding to the standardized entity that most closely matches the query term; retrieving one or more query rewriting rules corresponding to an entity type of the standardized entity having the entity identification; and executing the one or more query rewriting rules to rewrite the first query such that the rewritten query is more restrictive than the first query. | 1. A computer-implemented method, comprising: obtaining one or more query terms in a first query; and for each of the one or more query terms: searching a standardized entity taxonomy to locate a standardized entity that most closely matches the query term, the standardized entity taxonomy comprising an entity identification for each of a plurality of different standardized entities; calculating a confidence score for a query term-standardized entity pair for the standardized entity that most closely matches the query term; in response to a determination that the confidence score transgresses a threshold, associating the query term with the entity identification corresponding to the standardized entity that most closely matches the query term; retrieving one or more query rewriting rules corresponding to an entity type of the standardized entity having the entity identification; and executing the one or more query rewriting rules to rewrite the first query such that the rewritten query is more restrictive than the first query. 7. The method of claim 1 , wherein the confidence score indicates a statistical likelihood that a user specifying the query term in a search query would have, under ideal circumstances, also entered the corresponding standardized entity in the search query, based on a confidence score model trained via a machine learning algorithm based on member profiles and member activities in a social networking service. | 0.5 |
8,640,104 | 9 | 15 | 9. A computer debugging system comprising: a diagramming member configured to form a diagram illustrating class relationships between objects at runtime by generating a class relationship diagram of a subject object from a dynamic computer language, the diagramming member effectively diagramming class relationships of the subject objects, the subject object in the dynamic computer language having an anonymous nature limiting visualization of objects' runtime relationships, wherein the dynamic computer language makes no distinction between function definition and method definition except for during function calling, and wherein the subject object in the dynamic computer language is integrated and loosely typed such that the subject object is able to be hosted in various environments, wherein the generated class relationship diagram shows class relationships between the subject object and objects that the subject object contains or inherits from, said class relationships being distinct from parent-child dependency; wherein the diagramming member forms the diagram by: traversing an inheritance chain of the subject object; for each level in the inheritance chain, reading methods of inherited objects; adding the read methods to the subject object as dynamically generated; and a display unit displaying on output to a user the generated class relationship diagram as the formed diagram. | 9. A computer debugging system comprising: a diagramming member configured to form a diagram illustrating class relationships between objects at runtime by generating a class relationship diagram of a subject object from a dynamic computer language, the diagramming member effectively diagramming class relationships of the subject objects, the subject object in the dynamic computer language having an anonymous nature limiting visualization of objects' runtime relationships, wherein the dynamic computer language makes no distinction between function definition and method definition except for during function calling, and wherein the subject object in the dynamic computer language is integrated and loosely typed such that the subject object is able to be hosted in various environments, wherein the generated class relationship diagram shows class relationships between the subject object and objects that the subject object contains or inherits from, said class relationships being distinct from parent-child dependency; wherein the diagramming member forms the diagram by: traversing an inheritance chain of the subject object; for each level in the inheritance chain, reading methods of inherited objects; adding the read methods to the subject object as dynamically generated; and a display unit displaying on output to a user the generated class relationship diagram as the formed diagram. 15. A computer system as claimed in claim 9 wherein the formed diagram visually shows relationships between the subject object and objects it contains. | 0.587432 |
9,519,766 | 14 | 25 | 14. A system of distinguishing between computers and humans through enhanced completely automated public turing test to tell computers and humans apart (e-captcha), comprising: a computer system having a memory that stores computer program instructions and one or more physical processors programmed with the computer program instructions that, when executed by the memory and one or more physical processors, cause the computer system to: provide, via the network, executable instructions configured to generate a user interface that includes an e-captcha challenge, wherein the e-captcha challenge requires-one or more words or phrases to be uttered; receive an audio input via at least one input configured to receive the audio input, the audio input comprising a response to the e-captcha challenge; use an automated speech recognition engine to convert the audio input to text; determine an edit distance between the one or more words or phrases and the text converted from the audio input; determine whether the one or more words or phrases to be uttered were was at least partially correctly uttered based on the edit distance; responsive to a determination that the one or more words or phrases were at least partially correctly uttered, cause information indicating that the response is valid to be provided; and responsive to a determination that the one or more words or phrases were not at least partially correctly uttered, cause information indicating that the response is invalid to be provided. | 14. A system of distinguishing between computers and humans through enhanced completely automated public turing test to tell computers and humans apart (e-captcha), comprising: a computer system having a memory that stores computer program instructions and one or more physical processors programmed with the computer program instructions that, when executed by the memory and one or more physical processors, cause the computer system to: provide, via the network, executable instructions configured to generate a user interface that includes an e-captcha challenge, wherein the e-captcha challenge requires-one or more words or phrases to be uttered; receive an audio input via at least one input configured to receive the audio input, the audio input comprising a response to the e-captcha challenge; use an automated speech recognition engine to convert the audio input to text; determine an edit distance between the one or more words or phrases and the text converted from the audio input; determine whether the one or more words or phrases to be uttered were was at least partially correctly uttered based on the edit distance; responsive to a determination that the one or more words or phrases were at least partially correctly uttered, cause information indicating that the response is valid to be provided; and responsive to a determination that the one or more words or phrases were not at least partially correctly uttered, cause information indicating that the response is invalid to be provided. 25. The system of claim 14 , wherein the e-captcha challenge further comprises an image to be identified and wherein the response comprises an attempted identification of the image. | 0.851882 |
8,203,767 | 7 | 12 | 7. An image reading apparatus comprising: a first image reading unit configured to read an image of a first surface of a traveling original document; a first conveying path configured to reach from a document placing unit to the first image reading unit, the first conveying path including a first reversing unit formed in an arc shape, the first conveying path being an OUT path including the first reversing unit; a second conveying path configured to reach from the document placing unit to the first image reading unit and have a path different from the first conveying path, the second conveying path having a second reversing unit formed in an arc shape, the second conveying path being an IN path including the second reversing unit having a radius smaller than a radius of the first reversing unit; a gate unit configured to direct original documents, which are sent from the document placing unit, to either the first conveying path or the second conveying path, the gate directing the original document to the OUT path when the original document has a thickness equal to or larger than a fixed thickness; a document conveying unit includes a first conveyance mode which conveying the original documents with overlap a trailing edge of a preceding original document and a leading edge of a following original document, when the gate unit alternately directs the original documents from the document placing unit, to the first conveying path or the second conveying path; a separating unit configured to separate the overlap of the trailing edge of the preceding original document and the leading edge of the following original document before the leading edge of the following original document reaches the first image reading unit; and a paper discharging unit configured to discharge the original document that finishes passing through the first image reading unit. | 7. An image reading apparatus comprising: a first image reading unit configured to read an image of a first surface of a traveling original document; a first conveying path configured to reach from a document placing unit to the first image reading unit, the first conveying path including a first reversing unit formed in an arc shape, the first conveying path being an OUT path including the first reversing unit; a second conveying path configured to reach from the document placing unit to the first image reading unit and have a path different from the first conveying path, the second conveying path having a second reversing unit formed in an arc shape, the second conveying path being an IN path including the second reversing unit having a radius smaller than a radius of the first reversing unit; a gate unit configured to direct original documents, which are sent from the document placing unit, to either the first conveying path or the second conveying path, the gate directing the original document to the OUT path when the original document has a thickness equal to or larger than a fixed thickness; a document conveying unit includes a first conveyance mode which conveying the original documents with overlap a trailing edge of a preceding original document and a leading edge of a following original document, when the gate unit alternately directs the original documents from the document placing unit, to the first conveying path or the second conveying path; a separating unit configured to separate the overlap of the trailing edge of the preceding original document and the leading edge of the following original document before the leading edge of the following original document reaches the first image reading unit; and a paper discharging unit configured to discharge the original document that finishes passing through the first image reading unit. 12. The apparatus according to claim 7 , wherein the first conveying path and the second conveying path include a common conveying unit that reaches from the first reversing unit and the second reversing unit to the separating unit. | 0.623377 |
7,725,422 | 17 | 19 | 17. An apparatus for generating a ranked list of keywords, the apparatus comprising: means for maintaining a database recording a weighted relationship between keywords; means for receiving an initial keyword from a user; means for obtaining a stored set of web page listings previously associated with the initial keyword search term; means for obtaining a set of keywords comprising, for each web page listing in the set of web page listings, keywords previously associated with the web page listings; means for ranking each keyword in the set of keywords based upon the weighted relationship between the initial keyword search term and each keyword search term, thereby forming a ranked list of keyword; means for presenting the ranked list of keywords to the user; means for receiving, by the apparatus, an indication of a selected one-keyword of that was selected by the user from the ranked list of keywords in response to the presenting; and means for receiving the indication of the selected keyword, updating the database to increase the weighted relationship between the initial keyword search and the selected one keyword of the ranked list of search terms. | 17. An apparatus for generating a ranked list of keywords, the apparatus comprising: means for maintaining a database recording a weighted relationship between keywords; means for receiving an initial keyword from a user; means for obtaining a stored set of web page listings previously associated with the initial keyword search term; means for obtaining a set of keywords comprising, for each web page listing in the set of web page listings, keywords previously associated with the web page listings; means for ranking each keyword in the set of keywords based upon the weighted relationship between the initial keyword search term and each keyword search term, thereby forming a ranked list of keyword; means for presenting the ranked list of keywords to the user; means for receiving, by the apparatus, an indication of a selected one-keyword of that was selected by the user from the ranked list of keywords in response to the presenting; and means for receiving the indication of the selected keyword, updating the database to increase the weighted relationship between the initial keyword search and the selected one keyword of the ranked list of search terms. 19. The apparatus of claim 17 , wherein the means for obtaining the set of keywords also takes into account a profile associated with the user submitting the initial keyword. | 0.747093 |
8,527,309 | 1 | 5 | 1. A computer-implemented method of targeting marketing offers comprising: defining, by one or more processors, domain attribute sets for domain names; performing, by the one or more processors, an historical analysis using the domain attribute sets; analyzing, by the one or more processors, expiring domain names based on the historical analysis and the domain attribute sets; providing, by the one or more processors, probability of deletion predictions based on the analyzing of the expiring domain names; and providing a targeted marketing offer to a current owner of a domain name based on the probability of deletion predictions. | 1. A computer-implemented method of targeting marketing offers comprising: defining, by one or more processors, domain attribute sets for domain names; performing, by the one or more processors, an historical analysis using the domain attribute sets; analyzing, by the one or more processors, expiring domain names based on the historical analysis and the domain attribute sets; providing, by the one or more processors, probability of deletion predictions based on the analyzing of the expiring domain names; and providing a targeted marketing offer to a current owner of a domain name based on the probability of deletion predictions. 5. The method of claim 1 , comprising: adjusting the probability of deletion predictions, by the one or more processors, based on any, or combinations of, political factors, economic factors, news event factors, and regional factors. | 0.598276 |
8,006,178 | 6 | 20 | 6. A system comprising: one or more processors; one or more memories; computer executable instructions stored on the one or more memories and executable by the one or more processors, the computer executable instructions comprising: a source document having hypertext markup language (HTML) content; an overlay document having extensible hypertext markup language (XHTML) content that specifies changes to be made to an HTML document, wherein the source document specifies an overlay document version with which the source document is compatible, wherein no special tags or other types of markers are required in the source document to enable the changes to be made as specified by the overlay document, wherein when the source document comprises a section of HTML content that specifies that the section is designated as immutable, modification of the section via the overlay document is prevented, the section designated as immutable selected from a group consisting of: attributes of an HTML element of the source document; content of an HTML element of the source document; and structure of an HTML element of the source document; a manifest document that defines a relationship between the source document and the overlay document such that the overlay document is usable for modifying the source document when an attribute condition in the manifest document related to the source document is fulfilled; a document used to upgrade the overlay document from one version to another version; and an interface to utilize the overlay document to modify the presentation of the source document when an associated version of the overlay document is compatible with the source document. | 6. A system comprising: one or more processors; one or more memories; computer executable instructions stored on the one or more memories and executable by the one or more processors, the computer executable instructions comprising: a source document having hypertext markup language (HTML) content; an overlay document having extensible hypertext markup language (XHTML) content that specifies changes to be made to an HTML document, wherein the source document specifies an overlay document version with which the source document is compatible, wherein no special tags or other types of markers are required in the source document to enable the changes to be made as specified by the overlay document, wherein when the source document comprises a section of HTML content that specifies that the section is designated as immutable, modification of the section via the overlay document is prevented, the section designated as immutable selected from a group consisting of: attributes of an HTML element of the source document; content of an HTML element of the source document; and structure of an HTML element of the source document; a manifest document that defines a relationship between the source document and the overlay document such that the overlay document is usable for modifying the source document when an attribute condition in the manifest document related to the source document is fulfilled; a document used to upgrade the overlay document from one version to another version; and an interface to utilize the overlay document to modify the presentation of the source document when an associated version of the overlay document is compatible with the source document. 20. The system as recited in claim 6 , wherein the interface has a plurality of functions, the functions comprising: when the associated version of the overlay document is not compatible with the source document, utilizing the document used to upgrade the overlay document to upgrade the overlay document to another version; modifying element content; modifying element attributes; removing elements; adding elements; rearranging elements; and stylization of elements. | 0.5 |
8,038,537 | 1 | 35 | 1. A method for evaluating a game outcome on a gaming machine, the method comprising: receiving during a runtime of a wagering game a game rules script, the game rules script comprising text specifying a set of displayable game elements used in the wagering game, the text further defining one or more rules to determine a set of one or more winning outcomes in terms of one or more of the set of displayable game elements; parsing the games rules script into a game rules data structure; generating a game outcome for display on the gaming machine, the game outcome including selected elements of the set of displayable game elements; and determining if the game outcome matches at least one winning outcome in the set of winning outcomes in accordance with evaluation of the selected elements against the one or more rules provided by the game rules data structure by repeating, until all rules are compared: comparing the selected elements against the one or more rules provided by the game rules data structure; and removing a matching rule from the one or more rules and removing matching elements from the selected elements responsive to matching of the matching elements and the matching rule. | 1. A method for evaluating a game outcome on a gaming machine, the method comprising: receiving during a runtime of a wagering game a game rules script, the game rules script comprising text specifying a set of displayable game elements used in the wagering game, the text further defining one or more rules to determine a set of one or more winning outcomes in terms of one or more of the set of displayable game elements; parsing the games rules script into a game rules data structure; generating a game outcome for display on the gaming machine, the game outcome including selected elements of the set of displayable game elements; and determining if the game outcome matches at least one winning outcome in the set of winning outcomes in accordance with evaluation of the selected elements against the one or more rules provided by the game rules data structure by repeating, until all rules are compared: comparing the selected elements against the one or more rules provided by the game rules data structure; and removing a matching rule from the one or more rules and removing matching elements from the selected elements responsive to matching of the matching elements and the matching rule. 35. The method of claim 1 , wherein each winning outcome in the set of winning outcomes is associated with a payout amount. | 0.818047 |
9,032,362 | 11 | 15 | 11. A computer system comprising a processor; a memory coupled to the processor; and a network interface, wherein the memory comprises computer readable code, that when executed, causes the processor to perform a method of: receiving a user-provided plain language calculation expression, wherein the user-provided plain language calculation expression specifies a plurality of calculation identifiers without specifying at least one calculational relationship between a first calculation identifier in the plurality of calculation identifiers and a second calculation identifier in the plurality of calculation identifiers; determining the at least one calculational relationship in accordance with system-provided definitions; generating a calculation definition table in accordance with the user-provided plain language calculation expression, wherein the calculation definition table comprises the plurality of calculation identifiers and the at least one calculational relationship; determining a calculational sequence associated with the plurality of calculation identifiers; generating a calculation input definition table in accordance with the calculation definition table, wherein the calculation input definition table comprises multiple calculation input definitions each associated with one of the calculation identifiers and the calculational sequence; and generating, a calculation execution graph in accordance with the calculation input definition table, wherein the calculation execution graph is readable by a plurality of enterprise applications and wherein generating the calculation execution graph comprises generating a calculation definition model comprising a plurality of calculation definitions, wherein each of the calculation definitions is associated with a calculation identifier and a length designation, wherein the length designation corresponds to a number of intermediate calculations required for an input required by the calculation definition. | 11. A computer system comprising a processor; a memory coupled to the processor; and a network interface, wherein the memory comprises computer readable code, that when executed, causes the processor to perform a method of: receiving a user-provided plain language calculation expression, wherein the user-provided plain language calculation expression specifies a plurality of calculation identifiers without specifying at least one calculational relationship between a first calculation identifier in the plurality of calculation identifiers and a second calculation identifier in the plurality of calculation identifiers; determining the at least one calculational relationship in accordance with system-provided definitions; generating a calculation definition table in accordance with the user-provided plain language calculation expression, wherein the calculation definition table comprises the plurality of calculation identifiers and the at least one calculational relationship; determining a calculational sequence associated with the plurality of calculation identifiers; generating a calculation input definition table in accordance with the calculation definition table, wherein the calculation input definition table comprises multiple calculation input definitions each associated with one of the calculation identifiers and the calculational sequence; and generating, a calculation execution graph in accordance with the calculation input definition table, wherein the calculation execution graph is readable by a plurality of enterprise applications and wherein generating the calculation execution graph comprises generating a calculation definition model comprising a plurality of calculation definitions, wherein each of the calculation definitions is associated with a calculation identifier and a length designation, wherein the length designation corresponds to a number of intermediate calculations required for an input required by the calculation definition. 15. The computer system of claim 11 wherein the computer readable code further comprises code that causes the processor to generate a platform specific application by mapping the calculation execution graph into a specific programming language. | 0.519685 |
9,021,380 | 1 | 21 | 1. A method comprising: outputting, by a computing device and for display at a presence-sensitive display, a graphical keyboard comprising a plurality of keys; receiving, by the computing device, an indication of a multi-touch gesture detected at the presence-sensitive display, the multi-touch gesture performed by a user having a first finger and a second finger, the multi-touch gesture comprising a first sub-gesture of the first finger that traverses a first group of keys of the plurality of keys and a second sub-gesture of the second finger that traverses a second group of keys of the plurality of keys, the first sub-gesture being disjoint from the second sub-gesture, wherein at least a portion of the first sub-gesture is performed simultaneously with at least a portion the second sub-gesture; determining, by the computing device and in response to receiving the indication of the first sub-gesture of the first finger and the second sub-gesture of the second finger, a candidate word based at least in part on the first and second groups of keys, wherein the determining comprises: determining, by the computing device and based at least in part on the first sub-gesture of the first finger, a first group of points on the presence-sensitive display traversed by the first sub-gesture; determining, by the computing device and based at least in part on the second sub-gesture of the second finger, a second group of points on the presence-sensitive display traversed by the second sub-gesture; determining, by the computing device and based at least in part on the first and second groups of points on the presence-sensitive display, at least one probability that at least one key included in at least one of the first and second groups of keys is associated with at least one of the first sub-gesture of the first finger and the second sub-gesture of the second finger; and determining, by the computing device, the candidate word based at least in part on the at least one probability that the at least one key is associated with at least one of the first sub-gesture of the first finger and the second sub-gesture of the second finger; and outputting, by the computing device and for display at the presence-sensitive display, the candidate word. | 1. A method comprising: outputting, by a computing device and for display at a presence-sensitive display, a graphical keyboard comprising a plurality of keys; receiving, by the computing device, an indication of a multi-touch gesture detected at the presence-sensitive display, the multi-touch gesture performed by a user having a first finger and a second finger, the multi-touch gesture comprising a first sub-gesture of the first finger that traverses a first group of keys of the plurality of keys and a second sub-gesture of the second finger that traverses a second group of keys of the plurality of keys, the first sub-gesture being disjoint from the second sub-gesture, wherein at least a portion of the first sub-gesture is performed simultaneously with at least a portion the second sub-gesture; determining, by the computing device and in response to receiving the indication of the first sub-gesture of the first finger and the second sub-gesture of the second finger, a candidate word based at least in part on the first and second groups of keys, wherein the determining comprises: determining, by the computing device and based at least in part on the first sub-gesture of the first finger, a first group of points on the presence-sensitive display traversed by the first sub-gesture; determining, by the computing device and based at least in part on the second sub-gesture of the second finger, a second group of points on the presence-sensitive display traversed by the second sub-gesture; determining, by the computing device and based at least in part on the first and second groups of points on the presence-sensitive display, at least one probability that at least one key included in at least one of the first and second groups of keys is associated with at least one of the first sub-gesture of the first finger and the second sub-gesture of the second finger; and determining, by the computing device, the candidate word based at least in part on the at least one probability that the at least one key is associated with at least one of the first sub-gesture of the first finger and the second sub-gesture of the second finger; and outputting, by the computing device and for display at the presence-sensitive display, the candidate word. 21. The method of claim 1 , wherein the candidate word is determined contemporaneously with receiving at least one of the first sub-gesture and the second sub-gesture at the presence-sensitive display. | 0.911609 |
9,753,920 | 3 | 12 | 3. A computer system for processing electronic documents including: a storage medium for storing computer instructions for processing electronic documents; and a processor for executing the computer instructions, the computer instructions causing the processor to: identify one or more custodians; collect electronic documents for one or more of the custodians; receive a plurality of the collected electronic documents: store the plurality of electronic documents in a file container created based on a file system; identify one or more user inputs; identify one or more filtering criteria based on the user inputs; retrieve metadata from the file container, the metadata indicating forensic information about the plurality of the received electronic documents; filter the metadata according to the one or more filtering criteria to generate a filtering result including filtered metadata, the filtered metadata corresponding to a portion of the received electronic documents; calculate one or more statistical characteristics of the portion of the received electronic documents based on the filtered metadata, the one or more statistical characteristics including a total number of the portion of the received electronic documents associated with at least one of a number of different document types, a number of custodians, and a number of domain names; display and update, in a user interface, as the filtering is carried out, a graphical representation of the one or more statistical characteristics of the portion of the received electronic documents; and selectively extract one or more of the portion of the received electronic documents from the file container according to the filtering result and based on the graphical representation, wherein the user interface also displays a graphical element showing a size of the electronic documents before collection, a size of the electronic documents after collection, and a size of the electronic documents after filtering. | 3. A computer system for processing electronic documents including: a storage medium for storing computer instructions for processing electronic documents; and a processor for executing the computer instructions, the computer instructions causing the processor to: identify one or more custodians; collect electronic documents for one or more of the custodians; receive a plurality of the collected electronic documents: store the plurality of electronic documents in a file container created based on a file system; identify one or more user inputs; identify one or more filtering criteria based on the user inputs; retrieve metadata from the file container, the metadata indicating forensic information about the plurality of the received electronic documents; filter the metadata according to the one or more filtering criteria to generate a filtering result including filtered metadata, the filtered metadata corresponding to a portion of the received electronic documents; calculate one or more statistical characteristics of the portion of the received electronic documents based on the filtered metadata, the one or more statistical characteristics including a total number of the portion of the received electronic documents associated with at least one of a number of different document types, a number of custodians, and a number of domain names; display and update, in a user interface, as the filtering is carried out, a graphical representation of the one or more statistical characteristics of the portion of the received electronic documents; and selectively extract one or more of the portion of the received electronic documents from the file container according to the filtering result and based on the graphical representation, wherein the user interface also displays a graphical element showing a size of the electronic documents before collection, a size of the electronic documents after collection, and a size of the electronic documents after filtering. 12. The computer system of claim 3 , wherein the computer instructions further cause the processor to: create a project and one or more tasks for processing the electronic documents according to user inputs; and assign at least one of the tasks to the project. | 0.5 |
8,448,242 | 55 | 56 | 55. A system for outputting data based on anomaly detection, comprising: a digital processing device that: receives an input dataset; generates n-grams of different sizes from the input dataset; counts the number of distinct n-grams in the n-grams of different sizes that are not present in a binary anomaly detection model; computes an anomaly score based upon the number of distinct n-grams and a total count of the n-grams in the input dataset; uses the anomaly score to determine whether an input dataset contains an anomaly; and outputs the input dataset based on whether the input dataset contains an anomaly. | 55. A system for outputting data based on anomaly detection, comprising: a digital processing device that: receives an input dataset; generates n-grams of different sizes from the input dataset; counts the number of distinct n-grams in the n-grams of different sizes that are not present in a binary anomaly detection model; computes an anomaly score based upon the number of distinct n-grams and a total count of the n-grams in the input dataset; uses the anomaly score to determine whether an input dataset contains an anomaly; and outputs the input dataset based on whether the input dataset contains an anomaly. 56. The system of claim 55 , wherein the binary anomaly detection model is represented using a Bloom filter. | 0.632653 |
8,504,487 | 13 | 14 | 13. A method for providing a user interface that evolves based on learned idiosyncrasies and collected data of a user, the method comprising: storing learned idiosyncrasies and collected data of the user in a knowledge base; executing instructions stored in memory to obtain information from the surrounding environment of the user during learning of idiosyncrasies or collection of data; executing instructions stored in memory to generate thought-based statements based at least in part on the knowledge base and the information from the environment surrounding the user during learning of idiosyncrasies or collection of data, the thought-based statements serving to invoke or respond to subsequent actions of the user; executing instructions stored in memory to present the user interface and to allow for interaction with the user based at least in part on the thought-based statements; and executing instructions stored in memory to develop personality nuances of the user interface that affect the interaction between the user and the user interface, wherein executing instructions to develop the personality nuances includes analyzing past interactions between the user and the system, wherein the generated thought-based statements are further based on the analysis of the past interactions. | 13. A method for providing a user interface that evolves based on learned idiosyncrasies and collected data of a user, the method comprising: storing learned idiosyncrasies and collected data of the user in a knowledge base; executing instructions stored in memory to obtain information from the surrounding environment of the user during learning of idiosyncrasies or collection of data; executing instructions stored in memory to generate thought-based statements based at least in part on the knowledge base and the information from the environment surrounding the user during learning of idiosyncrasies or collection of data, the thought-based statements serving to invoke or respond to subsequent actions of the user; executing instructions stored in memory to present the user interface and to allow for interaction with the user based at least in part on the thought-based statements; and executing instructions stored in memory to develop personality nuances of the user interface that affect the interaction between the user and the user interface, wherein executing instructions to develop the personality nuances includes analyzing past interactions between the user and the system, wherein the generated thought-based statements are further based on the analysis of the past interactions. 14. The method of claim 13 , wherein executing instructions to obtain the information from the surrounding environments includes deciphering detected speech from the user. | 0.600467 |
8,751,217 | 1 | 3 | 1. A computer-implemented input-method editor process comprising: receiving a request from a user of an electronic device for an application-independent input method editor having written and spoken input capabilities, wherein the application-independent input method editor is configured to receive input for a plurality of applications executable by the electronic device; identifying that the user is about to provide spoken input to the application-independent input method editor; receiving a spoken input from the user, wherein the spoken input corresponds to an input to an application from the plurality of applications; generating, with the electronic device, a correlation between the spoken input and the application, from the plurality of applications, to which the spoken input is determined to correspond, wherein generating the correlation comprises (i) determining an application type for the application that identifies a category of application to which the application is assigned, each category of application capable of including a plurality of different applications, and (ii) matching one or more utterances in the spoken input to one or more stored terms that are associated with the application type; providing the spoken input and the generated correlation to a server, wherein the server is remote to the electronic device and includes a speech recognition system configured to access one or more language models for recognizing text based on the spoken input and the correlation; receiving text from the server, wherein the text represents a translation of the spoken input; selecting an application, from the plurality of applications, to receive the text, the selection using the generated correlation; and providing the text as an input to the selected application. | 1. A computer-implemented input-method editor process comprising: receiving a request from a user of an electronic device for an application-independent input method editor having written and spoken input capabilities, wherein the application-independent input method editor is configured to receive input for a plurality of applications executable by the electronic device; identifying that the user is about to provide spoken input to the application-independent input method editor; receiving a spoken input from the user, wherein the spoken input corresponds to an input to an application from the plurality of applications; generating, with the electronic device, a correlation between the spoken input and the application, from the plurality of applications, to which the spoken input is determined to correspond, wherein generating the correlation comprises (i) determining an application type for the application that identifies a category of application to which the application is assigned, each category of application capable of including a plurality of different applications, and (ii) matching one or more utterances in the spoken input to one or more stored terms that are associated with the application type; providing the spoken input and the generated correlation to a server, wherein the server is remote to the electronic device and includes a speech recognition system configured to access one or more language models for recognizing text based on the spoken input and the correlation; receiving text from the server, wherein the text represents a translation of the spoken input; selecting an application, from the plurality of applications, to receive the text, the selection using the generated correlation; and providing the text as an input to the selected application. 3. The process of claim 1 , further comprising: receiving a written input from the user; determining a language of the written input; and providing a language indicator to the server based on the determined language indicating the language of the spoken input. | 0.623188 |
9,098,558 | 11 | 12 | 11. The method of claim 10 , wherein said receiving, said accessing, said inspecting and said populating are performed during a first pass of processing of said XML data, wherein said retrieving, said parsing, said invoking, said forming and said including are performed during a second pass of processing of said XML data, wherein examination of all of said plurality of elements is complete in said first pass prior to start of said second pass. | 11. The method of claim 10 , wherein said receiving, said accessing, said inspecting and said populating are performed during a first pass of processing of said XML data, wherein said retrieving, said parsing, said invoking, said forming and said including are performed during a second pass of processing of said XML data, wherein examination of all of said plurality of elements is complete in said first pass prior to start of said second pass. 12. The method of claim 11 , wherein said receiving receives said XML data in the form of a plurality of XML documents, wherein said plurality of XML documents are processed sequentially during said first pass such that the processing of all of said plurality of XML documents is complete prior to start of said second pass. | 0.5 |
8,768,950 | 7 | 8 | 7. The non-transitory computer readable storage medium according to claim 1 , wherein the input program further causes the computer to at least: receive an instruction to transmit the one or more characters input by the user to another information processing apparatus; and when the instruction has been received, transmit to said another information processing apparatus transmission data that contains text that only includes the fixed word. | 7. The non-transitory computer readable storage medium according to claim 1 , wherein the input program further causes the computer to at least: receive an instruction to transmit the one or more characters input by the user to another information processing apparatus; and when the instruction has been received, transmit to said another information processing apparatus transmission data that contains text that only includes the fixed word. 8. The non-transitory computer readable storage medium according to claim 7 , wherein the storage area stores the received one or more characters as one or more unfixed characters, the one or more unfixed characters stored in the storage area is/are output, and the input program further causes the computer to at least delete the one or more unfixed characters from the storage area prior to transmitting the transmission data, when the instruction has been received. | 0.5 |
9,038,008 | 8 | 9 | 8. A non-transitory computer readable medium storing instructions that, when executed by a processor, perform a method for containing analog verification intellectual property (IP) for circuit simulation, the method comprising: using a computer, reading an analog verification file containing at least one analog verification unit (vunit) that contains properties describing analog circuit design verification requirements including checks for specified simulation results, wherein the analog verification file is separate from input design IP; binding the vunit to one of a top-level circuit, a subcircuit master, and a subcircuit instance during circuit hierarchy expansion, to set vunit scope; performing a circuit simulation with a computer-operated circuit simulation tool combining the input design IP and the analog circuit design verification requirements; and tangibly outputting circuit simulation and verification results. | 8. A non-transitory computer readable medium storing instructions that, when executed by a processor, perform a method for containing analog verification intellectual property (IP) for circuit simulation, the method comprising: using a computer, reading an analog verification file containing at least one analog verification unit (vunit) that contains properties describing analog circuit design verification requirements including checks for specified simulation results, wherein the analog verification file is separate from input design IP; binding the vunit to one of a top-level circuit, a subcircuit master, and a subcircuit instance during circuit hierarchy expansion, to set vunit scope; performing a circuit simulation with a computer-operated circuit simulation tool combining the input design IP and the analog circuit design verification requirements; and tangibly outputting circuit simulation and verification results. 9. The medium of claim 8 wherein a design tool that processes the input design IP and the analog circuit design verification requirements in separate cellviews generates the analog circuit design verification requirements. | 0.574713 |
8,667,021 | 1 | 7 | 1. An intelligent system for retrieval and presentation of data to a user of an organization, comprising: a storage device that stores the data; an input device for the user to input at least one of a user initiated free-form inquiry and a user initiated structured inquiry; a computing device that receives the user initiated free-form inquiry and the user initiated structured inquiry, the computing device also structures a system initiated related knowledge search that is related to the free-form inquiry, wherein the related knowledge search is based upon sensory information, the sensory information including information associated with the user, a behavior of the user, a role of the user within the organization, previous free-form inquiries and previous structured inquiries by the user, wherein the related knowledge search is associated with, but not the same as, the free-form inquiry; and displaying the results of the user initiated free-form inquiry, the user initiated structured inquiry and the related knowledge search to a display device. | 1. An intelligent system for retrieval and presentation of data to a user of an organization, comprising: a storage device that stores the data; an input device for the user to input at least one of a user initiated free-form inquiry and a user initiated structured inquiry; a computing device that receives the user initiated free-form inquiry and the user initiated structured inquiry, the computing device also structures a system initiated related knowledge search that is related to the free-form inquiry, wherein the related knowledge search is based upon sensory information, the sensory information including information associated with the user, a behavior of the user, a role of the user within the organization, previous free-form inquiries and previous structured inquiries by the user, wherein the related knowledge search is associated with, but not the same as, the free-form inquiry; and displaying the results of the user initiated free-form inquiry, the user initiated structured inquiry and the related knowledge search to a display device. 7. The intelligent system of claim 1 , wherein the related knowledge search is based upon current deployment of tool functions and features by the user in the system. | 0.665323 |
8,898,152 | 10 | 17 | 10. One or more non-transitory computer-readable storage devices comprising instructions that, when executed by one or more processors, cause performance of operations comprising: identifying, by a computing system, a particular search result that was determined, along with a plurality of first search results, to be responsive to a first query, wherein the particular search result corresponds to a particular result document and each first search result of the first search results corresponds to a respective first result document, wherein the particular result document is a particular web page and the particular search result is configured to provide navigation to the particular web page upon user selection of the particular search result from among a presentation of multiple search results; identifying, by the computing system, a second result document that is associated with the particular result document due to the second result document including content that identifies an object that is also identified by content included in the particular result document, wherein a second search result corresponds to the second result document; identifying, by the computing system, second relevance data that indicates a popularity of the second search result as a selection by a second population of users as a result for a second query that is identical to the first query or similar to the first query; and determining, by the computing system, a score for the particular search result based on (i) first relevance data that indicates a popularity of the particular search result as a selection by a first population of users as a result for the first query, and (ii) the second relevance data that indicates the popularity of the second search result as the selection by the second population of users as the result for the second query. | 10. One or more non-transitory computer-readable storage devices comprising instructions that, when executed by one or more processors, cause performance of operations comprising: identifying, by a computing system, a particular search result that was determined, along with a plurality of first search results, to be responsive to a first query, wherein the particular search result corresponds to a particular result document and each first search result of the first search results corresponds to a respective first result document, wherein the particular result document is a particular web page and the particular search result is configured to provide navigation to the particular web page upon user selection of the particular search result from among a presentation of multiple search results; identifying, by the computing system, a second result document that is associated with the particular result document due to the second result document including content that identifies an object that is also identified by content included in the particular result document, wherein a second search result corresponds to the second result document; identifying, by the computing system, second relevance data that indicates a popularity of the second search result as a selection by a second population of users as a result for a second query that is identical to the first query or similar to the first query; and determining, by the computing system, a score for the particular search result based on (i) first relevance data that indicates a popularity of the particular search result as a selection by a first population of users as a result for the first query, and (ii) the second relevance data that indicates the popularity of the second search result as the selection by the second population of users as the result for the second query. 17. The one or more non-transitory computer-readable storage devices of claim 10 , wherein the second relevance data indicates a number of selections of the second search result by the second population of users as the result for the second query. | 0.787069 |
9,424,861 | 27 | 35 | 27. A digital conversation generating processor-implemented method, comprising: instantiating a processor-implemented dialogue agent; identifying an individual target for conversation; initiating a conversational dialogue between the individual target and the dialogue agent; recording a first dialogue segment from the individual target as part of the conversational dialogue, wherein the first dialogue segment is a subportion of the conversational dialogue; responding to the first dialogue segment from the individual target with an at least one subsequent response dialogue segment, wherein the at least one subsequent response dialogue segment is a subportion of the conversational dialogue; recording a subsequent dialogue segment from the individual target, wherein the subsequent dialogue segment is a subportion of the conversational dialogue; retrieving the recorded interactive dialogue between the individual target and the dialogue agent; allocating a value point to each interactive dialogue segment of the interactive dialogue; creating a digital conversation asset comprising at least the retrieved interactive dialogue associated with the allocated value point to each subsequent interactive dialogue segment of the interactive dialogue; determining a value for the digital conversation asset at least based on the allocated value point to each subsequent interactive dialogue segment of the interactive dialogue; and providing the created digital conversation asset associated with the determined value for exchange. | 27. A digital conversation generating processor-implemented method, comprising: instantiating a processor-implemented dialogue agent; identifying an individual target for conversation; initiating a conversational dialogue between the individual target and the dialogue agent; recording a first dialogue segment from the individual target as part of the conversational dialogue, wherein the first dialogue segment is a subportion of the conversational dialogue; responding to the first dialogue segment from the individual target with an at least one subsequent response dialogue segment, wherein the at least one subsequent response dialogue segment is a subportion of the conversational dialogue; recording a subsequent dialogue segment from the individual target, wherein the subsequent dialogue segment is a subportion of the conversational dialogue; retrieving the recorded interactive dialogue between the individual target and the dialogue agent; allocating a value point to each interactive dialogue segment of the interactive dialogue; creating a digital conversation asset comprising at least the retrieved interactive dialogue associated with the allocated value point to each subsequent interactive dialogue segment of the interactive dialogue; determining a value for the digital conversation asset at least based on the allocated value point to each subsequent interactive dialogue segment of the interactive dialogue; and providing the created digital conversation asset associated with the determined value for exchange. 35. The method of claim 27 , further comprising: providing options for a conditional logic. | 0.845763 |
8,954,909 | 4 | 6 | 4. The method of claim 1 further comprises checking feasibility of a violation in the electronic circuit by conjoining the violation with the set of design constraints to form a conjoined set of constraints, and inputting the conjoined set of constraints into a satisfiability solver. | 4. The method of claim 1 further comprises checking feasibility of a violation in the electronic circuit by conjoining the violation with the set of design constraints to form a conjoined set of constraints, and inputting the conjoined set of constraints into a satisfiability solver. 6. The method of claim 4 wherein checking feasibility of a violation further comprises using a satisfiability modulo theories solver. | 0.853846 |
8,108,801 | 6 | 7 | 6. A system comprising: a processor; a data bus coupled to said processor; a memory coupled to said data bus; and a computer readable storage device encoded with computer program code that, when executed, causes control circuitry in said system to perform the steps of: reading a plurality of characters stored in a character buffer and a plurality of character attributes stored in an attribute buffer of a computer host terminal application, wherein said computer host terminal application is displayed to a user as a plurality of lines of said plurality of characters; performing component recognition on said plurality of characters and said plurality of character attributes to identify essential characters, wherein said essential characters are required to be displayed to a user for said user to be able to interact with said computer host terminal application; generating hypertext markup language code for reconfiguring said plurality of characters for display on a portable data processing system having a small display that has a small display size, wherein said generating comprises: starting a new line of characters at a position on the small display where an original version of the line of characters was originally started in said computer host terminal application; breaking said original line of characters into more than one line of characters in order to wrap said original line of characters such that said new line of characters fits within said small display size; eliminating the display of characters from the plurality of characters that are not essential characters; and displaying all of said essential characters on said small display; and storing said generated hypertext markup language code for display on said portable data processing system. | 6. A system comprising: a processor; a data bus coupled to said processor; a memory coupled to said data bus; and a computer readable storage device encoded with computer program code that, when executed, causes control circuitry in said system to perform the steps of: reading a plurality of characters stored in a character buffer and a plurality of character attributes stored in an attribute buffer of a computer host terminal application, wherein said computer host terminal application is displayed to a user as a plurality of lines of said plurality of characters; performing component recognition on said plurality of characters and said plurality of character attributes to identify essential characters, wherein said essential characters are required to be displayed to a user for said user to be able to interact with said computer host terminal application; generating hypertext markup language code for reconfiguring said plurality of characters for display on a portable data processing system having a small display that has a small display size, wherein said generating comprises: starting a new line of characters at a position on the small display where an original version of the line of characters was originally started in said computer host terminal application; breaking said original line of characters into more than one line of characters in order to wrap said original line of characters such that said new line of characters fits within said small display size; eliminating the display of characters from the plurality of characters that are not essential characters; and displaying all of said essential characters on said small display; and storing said generated hypertext markup language code for display on said portable data processing system. 7. The system of claim 6 , wherein, said essential characters are displayed in a proportional font. | 0.5 |
7,668,889 | 11 | 18 | 11. A computer-readable storage medium, comprising operational instructions, that when executed by a processor, cause the processor to: display a user interface having a single input field to receive a search query; perform a keyword search via a keyword search engine based on the search query to generate keyword search results; perform a natural language search of a frequently-asked question (FAQ) database based on the search query to generate FAQ search results; display a first display page that combines the keyword search results and the FAQ search results, wherein the first display page categorizes the keyword search results and the FAQ search results into a plurality of categories including a first category and a second category, wherein the first display page displays at least one of the keyword search results and at least one of the FAQ search results for the first category and for the second category, wherein the first display page displays the first category and the second category in a particular order, and wherein the particular order is based on the keyword search results and the FAQ search results for the first category and for the second category and based on a correlation between the search query, the keyword search results, and the FAQ search results for the first category and for the second category; and output for display at a computer display device a second display page that expands the keyword search results and the FAQ search results that are displayed in the first display page, wherein the expanded keyword search results include a plurality of lines of text for at least one keyword search result. | 11. A computer-readable storage medium, comprising operational instructions, that when executed by a processor, cause the processor to: display a user interface having a single input field to receive a search query; perform a keyword search via a keyword search engine based on the search query to generate keyword search results; perform a natural language search of a frequently-asked question (FAQ) database based on the search query to generate FAQ search results; display a first display page that combines the keyword search results and the FAQ search results, wherein the first display page categorizes the keyword search results and the FAQ search results into a plurality of categories including a first category and a second category, wherein the first display page displays at least one of the keyword search results and at least one of the FAQ search results for the first category and for the second category, wherein the first display page displays the first category and the second category in a particular order, and wherein the particular order is based on the keyword search results and the FAQ search results for the first category and for the second category and based on a correlation between the search query, the keyword search results, and the FAQ search results for the first category and for the second category; and output for display at a computer display device a second display page that expands the keyword search results and the FAQ search results that are displayed in the first display page, wherein the expanded keyword search results include a plurality of lines of text for at least one keyword search result. 18. The computer-readable storage medium of claim 11 , wherein the keyword search results are provided in a first column of the first display page, and the FAQ results are provided in a second column of the first display page. | 0.584559 |
9,667,788 | 19 | 22 | 19. A method for analyzing electronic customer communication data, generating behavioral assessment data and generating a responsive communication, which method comprises: receiving, by a server, electronic customer communication data of two or more types, wherein the server is configured to provide a user interface comprising a web site, web portal, or virtual portal, and wherein at least one of the two or more types of electronic customer communication data comprises social media data, update status, media feed, social media review, social media data stream, social media profile or social media account setup; identifying a customer associated with the electronic customer communication data received by the server; aggregating electronic customer communication data from one or more sources based on identification of the customer from the electronic customer communication data; analyzing the aggregated electronic customer communication data by applying a predetermined linguistic-based psychological behavioral model to the electronic customer communication data for that identified customer; generating behavioral assessment data by the contact center based on said analyzing, the behavioral assessment data providing a personality type for the analyzed electronic customer communication data for that identified customer; generating a responsive communication based on the generated behavioral assessment data; and providing the responsive communication via the user interface. | 19. A method for analyzing electronic customer communication data, generating behavioral assessment data and generating a responsive communication, which method comprises: receiving, by a server, electronic customer communication data of two or more types, wherein the server is configured to provide a user interface comprising a web site, web portal, or virtual portal, and wherein at least one of the two or more types of electronic customer communication data comprises social media data, update status, media feed, social media review, social media data stream, social media profile or social media account setup; identifying a customer associated with the electronic customer communication data received by the server; aggregating electronic customer communication data from one or more sources based on identification of the customer from the electronic customer communication data; analyzing the aggregated electronic customer communication data by applying a predetermined linguistic-based psychological behavioral model to the electronic customer communication data for that identified customer; generating behavioral assessment data by the contact center based on said analyzing, the behavioral assessment data providing a personality type for the analyzed electronic customer communication data for that identified customer; generating a responsive communication based on the generated behavioral assessment data; and providing the responsive communication via the user interface. 22. The method of claim 19 , wherein the third-party server is configured to provide one or more application programming interfaces (APIs) configured to integrate mobile-to-web extension applications. | 0.514563 |
4,864,503 | 1 | 11 | 1. A universal machine method implemented on a data processing device utilizing a data base for performing interpretations between any one of a plurality of first national source languages and into any one of a plurality of second national target languages comprising: a first step of storing a source text in said any one first national language in an electronic storage means as a first text file; said first step including a first substep that parses said source text into individual sentences, with each sentence in its own separate subfile; a second step of interpreting said sentences into a created internationally universal language which serves as an intermediate pathway, as the word making up said sentences are translated into the created internationally universal language, they are entered into individual files consisting of the word plus a grammatical syntax tag, such tag consisting of a designation of the word's grammatical posture, i.e., noun, pronoun, verb, adverb . . . etc., and a third step of interpreting said tagged words from said created internationally universal language into any one of said second natural national target languages; said interpretation steps being totally reversible within said intermediate pathway of said universal international language, there being no requirement of reworking of said intermediate pathway language to accommodate changes in source or target languages. | 1. A universal machine method implemented on a data processing device utilizing a data base for performing interpretations between any one of a plurality of first national source languages and into any one of a plurality of second national target languages comprising: a first step of storing a source text in said any one first national language in an electronic storage means as a first text file; said first step including a first substep that parses said source text into individual sentences, with each sentence in its own separate subfile; a second step of interpreting said sentences into a created internationally universal language which serves as an intermediate pathway, as the word making up said sentences are translated into the created internationally universal language, they are entered into individual files consisting of the word plus a grammatical syntax tag, such tag consisting of a designation of the word's grammatical posture, i.e., noun, pronoun, verb, adverb . . . etc., and a third step of interpreting said tagged words from said created internationally universal language into any one of said second natural national target languages; said interpretation steps being totally reversible within said intermediate pathway of said universal international language, there being no requirement of reworking of said intermediate pathway language to accommodate changes in source or target languages. 11. A machine method of performing translations according to claim 1 wherein each said text subfile is provided with a flag adapted to assist in keeping track of which subfile is being worked on and said flags of the subfiles are checked to determine whether there are further sentences to be worked upon. | 0.653409 |
9,978,362 | 14 | 16 | 14. The system of claim 13 further comprising: a program module configured to populate multiple conversational utterances by fitting one or more labelled facets into one or more conversational frameworks that are consistent with the identified corresponding sentiments; and a program module configured to present one or more of the conversational utterances to the user via one or more output devices. | 14. The system of claim 13 further comprising: a program module configured to populate multiple conversational utterances by fitting one or more labelled facets into one or more conversational frameworks that are consistent with the identified corresponding sentiments; and a program module configured to present one or more of the conversational utterances to the user via one or more output devices. 16. The system of claim 14 wherein relevancy of one or more of the conversational utterances presented to the user is determined in response to current environmental circumstances associated with the user. | 0.5 |
9,489,386 | 1 | 2 | 1. A computer-implemented method comprising: importing a set of data into a data structure in a memory, the data structure having a plurality of rows and a plurality of columns, wherein the set of data includes a first column and a second column; importing metadata for the set of data into the memory; determining, by a rules engine, one or more operations on particular columns of the set of data according to a set of rules, wherein a rule of the set of rules includes a condition defined in terms of the metadata, the rule including comparing a metadata attribute of the first column with a metadata attribute of the second column; inputting the determined operations into a data analysis tool; performing the determined operations by the data analysis tool; presenting results of the operations on a display device as an additional column to the plurality of columns; determining, in the rules engine, a count for one or more rules in the set of rules, each count having an associated rule in the one or more rules, wherein each count is based on a number of times the rules engine has generated a column using the associated rule; ranking the one or more rules based on their associated counts; and displaying the one or more rules to a user in an order consistent with their ranking. | 1. A computer-implemented method comprising: importing a set of data into a data structure in a memory, the data structure having a plurality of rows and a plurality of columns, wherein the set of data includes a first column and a second column; importing metadata for the set of data into the memory; determining, by a rules engine, one or more operations on particular columns of the set of data according to a set of rules, wherein a rule of the set of rules includes a condition defined in terms of the metadata, the rule including comparing a metadata attribute of the first column with a metadata attribute of the second column; inputting the determined operations into a data analysis tool; performing the determined operations by the data analysis tool; presenting results of the operations on a display device as an additional column to the plurality of columns; determining, in the rules engine, a count for one or more rules in the set of rules, each count having an associated rule in the one or more rules, wherein each count is based on a number of times the rules engine has generated a column using the associated rule; ranking the one or more rules based on their associated counts; and displaying the one or more rules to a user in an order consistent with their ranking. 2. The method of claim 1 , wherein the rule further includes comparing a metadata attribute of the first column with a metadata attribute associated with the rule. | 0.799261 |
8,719,041 | 1 | 2 | 1. A method of customizing a seller application that facilitates communication of listings to a network-based transaction facility, the method comprising: configuring a seller application executing on a client machine according to a default targeted site, the default targeted site being the site from which a user downloaded the seller application; facilitating selection of at least one targeted site from a plurality of targeted sites presented to the user, the plurality of targeted sites being provided and supported by a network-based transaction facility; and configuring the seller application according to the at least one targeted site selected instead of the default targeted site, the configuring the seller application including configuring the seller application to communicate with the network-based transaction facility according to conventions associated with the at least one targeted site selected. | 1. A method of customizing a seller application that facilitates communication of listings to a network-based transaction facility, the method comprising: configuring a seller application executing on a client machine according to a default targeted site, the default targeted site being the site from which a user downloaded the seller application; facilitating selection of at least one targeted site from a plurality of targeted sites presented to the user, the plurality of targeted sites being provided and supported by a network-based transaction facility; and configuring the seller application according to the at least one targeted site selected instead of the default targeted site, the configuring the seller application including configuring the seller application to communicate with the network-based transaction facility according to conventions associated with the at least one targeted site selected. 2. The method of claim 1 wherein the configuring further includes configuring the seller application to present information to the user in a manner consistent with the conventions associated with the at least one targeted site selected. | 0.5 |
8,209,318 | 8 | 9 | 8. The method of claim 4 , wherein the searching of the database using the third query and the generating of the third search result comprises: separating the third query into tokens which comprise a group of only alphabetic characters or a group of only numerals; connecting the tokens with a space and generating a fourth query; and searching the database using the fourth query, and generating the third search result. | 8. The method of claim 4 , wherein the searching of the database using the third query and the generating of the third search result comprises: separating the third query into tokens which comprise a group of only alphabetic characters or a group of only numerals; connecting the tokens with a space and generating a fourth query; and searching the database using the fourth query, and generating the third search result. 9. The product search method of claim 8 , wherein the searching of the database using the fourth query and the generating of the third search result comprises: repeating searching the database and generating the third search result, while reducing a number of the tokens included in the fourth query from a tail end of the fourth query; and generating a search result as the third search result and stopping the searching, when the search result is found. | 0.5 |
8,290,923 | 11 | 12 | 11. method for searching across a plurality of repositories comprising the steps of: storing in a memory of a computing system or computing device, data that defines a plurality of nodes organized in a hierarchical structure; wherein the hierarchical structure includes a plurality of sub-graphs; wherein each sub-graph of said plurality of sub-graphs represents a distinct repository; receiving a request to perform a search based on a query, the request including identification information that identifies a node, and an attribute value for a particular logical attribute of said node; reading mapping information to identify a physical attribute to which the particular logical attribute is mapped; using an index associated with the physical attribute to find searchable items that (a) have said attribute value for logical attributes mapped to the physical attribute; and (b) are located, within the hierarchical structure, at or below said node; wherein said index includes index entries for values associated with one or more logical attributes, other than said particular logical attribute, that are mapped to said physical attribute; and wherein the logical attributes includes a logical attribute that is semantically different than said particular logical attribute. | 11. method for searching across a plurality of repositories comprising the steps of: storing in a memory of a computing system or computing device, data that defines a plurality of nodes organized in a hierarchical structure; wherein the hierarchical structure includes a plurality of sub-graphs; wherein each sub-graph of said plurality of sub-graphs represents a distinct repository; receiving a request to perform a search based on a query, the request including identification information that identifies a node, and an attribute value for a particular logical attribute of said node; reading mapping information to identify a physical attribute to which the particular logical attribute is mapped; using an index associated with the physical attribute to find searchable items that (a) have said attribute value for logical attributes mapped to the physical attribute; and (b) are located, within the hierarchical structure, at or below said node; wherein said index includes index entries for values associated with one or more logical attributes, other than said particular logical attribute, that are mapped to said physical attribute; and wherein the logical attributes includes a logical attribute that is semantically different than said particular logical attribute. 12. The method of claim 11 further comprising presenting a guided navigation interface, based on said hierarchical structure, to allow users to navigate to find searchable items that belong to at least one of said plurality of repositories. | 0.5 |
9,721,587 | 1 | 2 | 1. On a computing device, a method of providing user feedback for a speech recognition system, the method comprising: displaying a graphical feedback indicator with an appearance that indicates the speech recognition system is in a passive listening mode; receiving a triggering input; in response to the triggering input, modifying an appearance of the graphical feedback indicator to have an appearance that indicates the speech recognition system is in an active listening mode; while in the active listening mode, receiving a speech input; when the speech recognition system understands the speech input, modifying the appearance of the graphical feedback indicator to have an appearance that indicates that the speech input is understood by the system, determining a location of a user providing the speech input, and modifying the appearance of the graphical feedback indicator to indicate the location of the user by adjusting a location of a volume indicator in a direction corresponding to the location of the user, the volume indicator comprising a ring-shaped portion of the indicator having a bar that represents a volume, wherein adjusting a location indicator comprises moving the bar to a side corresponding to the location of the user providing the speech input; and when the speech recognition system does not understand the speech input, then modifying the appearance of the graphical feedback indicator in a different manner to have an appearance that indicates the speech input is not understood by the system. | 1. On a computing device, a method of providing user feedback for a speech recognition system, the method comprising: displaying a graphical feedback indicator with an appearance that indicates the speech recognition system is in a passive listening mode; receiving a triggering input; in response to the triggering input, modifying an appearance of the graphical feedback indicator to have an appearance that indicates the speech recognition system is in an active listening mode; while in the active listening mode, receiving a speech input; when the speech recognition system understands the speech input, modifying the appearance of the graphical feedback indicator to have an appearance that indicates that the speech input is understood by the system, determining a location of a user providing the speech input, and modifying the appearance of the graphical feedback indicator to indicate the location of the user by adjusting a location of a volume indicator in a direction corresponding to the location of the user, the volume indicator comprising a ring-shaped portion of the indicator having a bar that represents a volume, wherein adjusting a location indicator comprises moving the bar to a side corresponding to the location of the user providing the speech input; and when the speech recognition system does not understand the speech input, then modifying the appearance of the graphical feedback indicator in a different manner to have an appearance that indicates the speech input is not understood by the system. 2. The method of claim 1 , further comprising determining the volume of the speech input and modifying a length of the volume indicator to indicate the volume. | 0.702247 |
9,697,199 | 1 | 4 | 1. A method for identifying and extracting ideographic components, comprising: generating a bilingual sentence database after sentence alignment is performed on corpora of multilingual or bilingual text versions of same content; wherein different language texts are further associated by using ideographs; sentences of different language texts express same semantic content, the ideographs of different language texts are implemented by using four types of common ideographic components, and the four types of ideographic components are identified and extracted as follows; S1. reading a sentence and matching a frame ( 102 ); a sentence includes two parts: a sentence frame and a sentence cabin; in each round of identifying and extracting ideographic components, texts of languages A and B are selected; a machine reads a bilingual sentence pair of languages A and B from the bilingual sentence database, inquires a sentence frame database by using the current bilingual sentence pair to perform a sentence frame match operation, integrates the bilingual sentence pair into a matched sentence frame, and displays βCabin Detectionβ and βSearch, Match, and Labelβ buttons; after integration, if each sentence cabin is uneven or incomplete or stacking exists, and the βSearch, Match, and Labelβ button is clicked, the machine performs a βsearch, match, and labelβ operation, and uses a word string of the sentence of language A to inquire a conventional electronic dictionary and generate a semantic match table for the current sentence pair according to whether the sentence of language B includes a word string corresponding to semantic content; then the cabin extracts a new sentence frame; S2. identifying and labeling sentence cabins ( 103 ); the machine simultaneously identifies bilingual quantity strings, proper noun strings, and article noun strings sequentially, and pre-labels them as sentence cabins; the machine checks the sentence frame format and collates the foregoing pre-labeled sentence cabins as formally labeled sentence cabins; this is a step of identification and extraction in the first round; parts of speech do not need to be identified in identification and extraction starting from a second round; instead, labeled language sentences are used as a template to identify and label sentence cabins of unlabeled language sentences; S3. detecting cabins and extracting a cabin model ( 106 ); the machine detects sentence cabins one by one; in the first round of identification and extraction, the machine counts word strings included in sentence cabins of a sentence of a Pinyin text of language A; if the quantity of word strings included in a sentence cabin is greater than or equal to five original word strings, the machine needs to perform an operation of composing complex words; if the quantity of word strings included in a sentence cabin is greater than or equal to eight original word strings, the machine performs a βsearch, match, and labelβ operation by using the current sentence cabin, and generates a semantic match table for the current sentence cabin, so that a cabin model is further extracted as a sentence cabin with a model; the machine extracts the cabin model, and simultaneously identifies bilingual quantity strings, proper noun strings, and article noun strings sequentially, and pre-labels them as cabin eyes; a model example percentage is decreased from 100% gradually; after pre-labeling is completed, if the quantity of word strings of the three types is still greater than 70%, the machine labels zero-article noun strings or other semantic match word strings as cabin eyes under a prerequisite that spacing exists, accepts the's approval or modification or addition of a semantic match word string by using a sense group alignment operation, and continues to pre-label cabin eyes; when conditions for pre-labeling do not exist and the model example percentage is between 50% and 70%, the operation of pre-labeling cabin eyes ends; the pre-labeled cabin eyes are modified as formally labeled according to a left-to-right order of English sentence cabins; differently, in extraction starting from the second round, labeled language sentence cabins are used as a template to identify and label unlabeled language cabin eyes; when the cabin eye quantity is greater than or equal to 1, residual parts after cabin eyes are removed from the current sentence cabin are cabin model components, and they are saved to corresponding language cabin model fields in a cabin model database ( 107 ); and then the machine continues to detect other sentence cabins, until detection of sentence cabins of the whole sentence pair is completed; S4. receiving and storing sense group strings ( 108 ); the machine integrates sentence cabins with cabin models back into the corresponding cabin models, and then searches for the sentence cabins or cabin eyes one by one; with reference to the semantic match table, if word fields of language A and word fields of language B are not empty in records of the match table of the corresponding content and semantic content of texts of languages A and B is aligned, the content is determined to be sense group string components, and fetched from the records in succession, and respectively stored in corresponding language fields in a same record in a sense group database ( 109 ); and then the operation of identifying and extracting the current sentence pair ends. | 1. A method for identifying and extracting ideographic components, comprising: generating a bilingual sentence database after sentence alignment is performed on corpora of multilingual or bilingual text versions of same content; wherein different language texts are further associated by using ideographs; sentences of different language texts express same semantic content, the ideographs of different language texts are implemented by using four types of common ideographic components, and the four types of ideographic components are identified and extracted as follows; S1. reading a sentence and matching a frame ( 102 ); a sentence includes two parts: a sentence frame and a sentence cabin; in each round of identifying and extracting ideographic components, texts of languages A and B are selected; a machine reads a bilingual sentence pair of languages A and B from the bilingual sentence database, inquires a sentence frame database by using the current bilingual sentence pair to perform a sentence frame match operation, integrates the bilingual sentence pair into a matched sentence frame, and displays βCabin Detectionβ and βSearch, Match, and Labelβ buttons; after integration, if each sentence cabin is uneven or incomplete or stacking exists, and the βSearch, Match, and Labelβ button is clicked, the machine performs a βsearch, match, and labelβ operation, and uses a word string of the sentence of language A to inquire a conventional electronic dictionary and generate a semantic match table for the current sentence pair according to whether the sentence of language B includes a word string corresponding to semantic content; then the cabin extracts a new sentence frame; S2. identifying and labeling sentence cabins ( 103 ); the machine simultaneously identifies bilingual quantity strings, proper noun strings, and article noun strings sequentially, and pre-labels them as sentence cabins; the machine checks the sentence frame format and collates the foregoing pre-labeled sentence cabins as formally labeled sentence cabins; this is a step of identification and extraction in the first round; parts of speech do not need to be identified in identification and extraction starting from a second round; instead, labeled language sentences are used as a template to identify and label sentence cabins of unlabeled language sentences; S3. detecting cabins and extracting a cabin model ( 106 ); the machine detects sentence cabins one by one; in the first round of identification and extraction, the machine counts word strings included in sentence cabins of a sentence of a Pinyin text of language A; if the quantity of word strings included in a sentence cabin is greater than or equal to five original word strings, the machine needs to perform an operation of composing complex words; if the quantity of word strings included in a sentence cabin is greater than or equal to eight original word strings, the machine performs a βsearch, match, and labelβ operation by using the current sentence cabin, and generates a semantic match table for the current sentence cabin, so that a cabin model is further extracted as a sentence cabin with a model; the machine extracts the cabin model, and simultaneously identifies bilingual quantity strings, proper noun strings, and article noun strings sequentially, and pre-labels them as cabin eyes; a model example percentage is decreased from 100% gradually; after pre-labeling is completed, if the quantity of word strings of the three types is still greater than 70%, the machine labels zero-article noun strings or other semantic match word strings as cabin eyes under a prerequisite that spacing exists, accepts the's approval or modification or addition of a semantic match word string by using a sense group alignment operation, and continues to pre-label cabin eyes; when conditions for pre-labeling do not exist and the model example percentage is between 50% and 70%, the operation of pre-labeling cabin eyes ends; the pre-labeled cabin eyes are modified as formally labeled according to a left-to-right order of English sentence cabins; differently, in extraction starting from the second round, labeled language sentence cabins are used as a template to identify and label unlabeled language cabin eyes; when the cabin eye quantity is greater than or equal to 1, residual parts after cabin eyes are removed from the current sentence cabin are cabin model components, and they are saved to corresponding language cabin model fields in a cabin model database ( 107 ); and then the machine continues to detect other sentence cabins, until detection of sentence cabins of the whole sentence pair is completed; S4. receiving and storing sense group strings ( 108 ); the machine integrates sentence cabins with cabin models back into the corresponding cabin models, and then searches for the sentence cabins or cabin eyes one by one; with reference to the semantic match table, if word fields of language A and word fields of language B are not empty in records of the match table of the corresponding content and semantic content of texts of languages A and B is aligned, the content is determined to be sense group string components, and fetched from the records in succession, and respectively stored in corresponding language fields in a same record in a sense group database ( 109 ); and then the operation of identifying and extracting the current sentence pair ends. 4. The method for identifying and extracting ideographic components according to claim 1 , which is characterized in that: extracting ideographic components by Using bilingual sentence pairs is specifically as follows: in each round of Identification and extraction, texts of languages A and B are selected, and preferably, Chinese and English languages are selected in the first round, where language A is English, and language B is Chinese; in each round of identification and extraction starting from the second round, a new language text is added; another is a language text that is already identified and extracted; language A is allocated to the language text that is already identified and extracted, while language B is allocated to the new language text; in the process of identification and extraction, first the sentence frame database is inquired by Using an identified sentence, and a sentence frame match operation and integration are performed; then the identified and extracted sentence is used as a template, and in the new language sentence, a part having same semantic content is identified and labeled as a sentence cabin with a same number; if a repetitive part exists, the repetitive part is labeled as a repetitive sentence cabin by using a same number; repetitive sentence cabins are applicable to repetitive components of sentences of each language; the identified and labeled repetitive sentence cabins do not necessarily exist in the sentences of both languages, and quantities are not necessarily consistent, but this does not affect the count of labeled, sentence cabins; and for sentence cabins including cabin models, sentence cabins of the identified sentence are integrated into cabin models and used as a template to identify and label cabin eyes of corresponding sentence cabins of the new language sentence. | 0.693752 |
9,336,295 | 14 | 16 | 14. The mobile device of claim 11 wherein the determination of the first context class is an initial classification of the received sensor data. | 14. The mobile device of claim 11 wherein the determination of the first context class is an initial classification of the received sensor data. 16. The mobile device of claim 14 comprising means for identifying an operational property of the initial classification, the operational property including at least one of a motion, a location, an event, or an environment associated with the initial classification. | 0.5 |
8,074,168 | 1 | 10 | 1. A method for automated rendering of context-compensated text in a graphical environment that is displayed in a display of a computing device, comprising: receiving a specification of items to be graphically displayed in the graphical environment, wherein the specification includes text to be graphically displayed in the graphical environment, and wherein the text is associated with an enhanced type-font for the text; determining a set of graphical items that will be displayed in proximity to a graphical representation of the text; determining that graphical aspects of the proximate graphical items will interfere with a user's ability to view the graphical representation of the text; and modifying the graphical representation of the text to more clearly display the text in the graphical environment, wherein modifying the graphical representation of the text comprises using rules associated with the enhanced type-font to change the complexity and detail displayed for the graphical representation of the text based on the size of the displayed text. | 1. A method for automated rendering of context-compensated text in a graphical environment that is displayed in a display of a computing device, comprising: receiving a specification of items to be graphically displayed in the graphical environment, wherein the specification includes text to be graphically displayed in the graphical environment, and wherein the text is associated with an enhanced type-font for the text; determining a set of graphical items that will be displayed in proximity to a graphical representation of the text; determining that graphical aspects of the proximate graphical items will interfere with a user's ability to view the graphical representation of the text; and modifying the graphical representation of the text to more clearly display the text in the graphical environment, wherein modifying the graphical representation of the text comprises using rules associated with the enhanced type-font to change the complexity and detail displayed for the graphical representation of the text based on the size of the displayed text. 10. The method of claim 1 , wherein modifying the graphical representation of the text involves: representing each character of the text as an object and set of associated transformation techniques instead of as a fixed map; wherein representing each character as an object changes the character display process. | 0.84913 |
9,911,413 | 2 | 7 | 2. A method for configuring a natural language (NL) understanding system, the NL understanding system including at least a linguistic classifier, the linguistic classifier being configurable with configuration data to distinguish a plurality of linguistic categories based on a linguistic input, the method comprising: configuring the linguistic classifier with first configuration data; processing a second plurality of user inputs to the system, wherein the processing includes, for each of the second plurality of user inputs, using the linguistic classifier configured with the first configuration data to determine a recognized linguistic category corresponding to said input, and causing determination of a corresponding response to the input based on the recognized linguistic category; storing second collected data, the second collected data comprising, for each of the second plurality of user inputs, a representation of the user input and the corresponding responses; receiving annotations for the second collected data, an annotation for each item of the second collected data indicating whether the corresponding response is consistent with the user input; determining second configuration data for the first linguistic classifier, the second configuration data being determined to distinguish the plurality of linguistic categories by computing the second configuration data to match the second annotated data; and configuring the linguistic classifier with the second configuration data. | 2. A method for configuring a natural language (NL) understanding system, the NL understanding system including at least a linguistic classifier, the linguistic classifier being configurable with configuration data to distinguish a plurality of linguistic categories based on a linguistic input, the method comprising: configuring the linguistic classifier with first configuration data; processing a second plurality of user inputs to the system, wherein the processing includes, for each of the second plurality of user inputs, using the linguistic classifier configured with the first configuration data to determine a recognized linguistic category corresponding to said input, and causing determination of a corresponding response to the input based on the recognized linguistic category; storing second collected data, the second collected data comprising, for each of the second plurality of user inputs, a representation of the user input and the corresponding responses; receiving annotations for the second collected data, an annotation for each item of the second collected data indicating whether the corresponding response is consistent with the user input; determining second configuration data for the first linguistic classifier, the second configuration data being determined to distinguish the plurality of linguistic categories by computing the second configuration data to match the second annotated data; and configuring the linguistic classifier with the second configuration data. 7. The method of claim 2 wherein processing a second plurality of user inputs to the system further comprises: applying an automated speech recognition procedure to data representing speech inputs of the users to determine a text-based representations of the inputs; producing linguistic representations of the inputs from the text-based representations of the inputs; and providing the linguistic representations to the first linguistic classifier, which provides corresponding recognized linguistic categories as outputs. | 0.5 |
7,542,969 | 1 | 17 | 1. A method of searching for information, comprising: receiving a query; providing the query to a first search engine that searches a set of data sources, the data sources having relationships to at least one ontology, the ontology modeling relationships between concepts in a domain and data source content containing information specific to the concepts; receiving search results from the search engine; analyzing the search results with one or more processors to determine at least one statistic corresponding to the search results and the query, wherein the statistic is based upon a relevance score for each of a plurality of concepts given the query, the relevance score expressed as r cq = w β‘ ( c ) β’ β i β’ β’ [ w β‘ ( i ) β’ f β‘ ( h c , h q ) ] where w(c) is a weighing function related to a concept c, w(i) is a weighing function for a data source item i, h c is a set of items related to the concept c, h q is a set of items related to the query q, and Ζ(h c , h q ) is a normalized score function, wherein weighing function w (i) varies by data source; providing a subset of the concepts to a user based on the relevance score; and using a template to process domain specific rules and the subset of the concepts. | 1. A method of searching for information, comprising: receiving a query; providing the query to a first search engine that searches a set of data sources, the data sources having relationships to at least one ontology, the ontology modeling relationships between concepts in a domain and data source content containing information specific to the concepts; receiving search results from the search engine; analyzing the search results with one or more processors to determine at least one statistic corresponding to the search results and the query, wherein the statistic is based upon a relevance score for each of a plurality of concepts given the query, the relevance score expressed as r cq = w β‘ ( c ) β’ β i β’ β’ [ w β‘ ( i ) β’ f β‘ ( h c , h q ) ] where w(c) is a weighing function related to a concept c, w(i) is a weighing function for a data source item i, h c is a set of items related to the concept c, h q is a set of items related to the query q, and Ζ(h c , h q ) is a normalized score function, wherein weighing function w (i) varies by data source; providing a subset of the concepts to a user based on the relevance score; and using a template to process domain specific rules and the subset of the concepts. 17. The method of claim 1 , wherein the query comprises a concept. | 0.894231 |
7,640,563 | 7 | 9 | 7. A method implemented by a computing device including one or more processors, the method comprising: receiving a first description that identifies a first genre associated with media content and a second description that identifies a second genre associated with the media content, wherein the first and second genres respectively represent first and second types of media content; determining a first trust level associated with a first description provider from which the first description is received; determining a second trust level associated with a second description provider from which the second description is received; utilizing the one or more processors for determining a first degree based on the first trust level and a second degree based on the second trust level; assigning the first degree to the first genre and the second degree to the second genre to indicate how relative the first and second genres are to the media content; and providing for display, a representation of the media content, wherein the representation of the media content comprises an indication of how relative the first and second genres are to the media content. | 7. A method implemented by a computing device including one or more processors, the method comprising: receiving a first description that identifies a first genre associated with media content and a second description that identifies a second genre associated with the media content, wherein the first and second genres respectively represent first and second types of media content; determining a first trust level associated with a first description provider from which the first description is received; determining a second trust level associated with a second description provider from which the second description is received; utilizing the one or more processors for determining a first degree based on the first trust level and a second degree based on the second trust level; assigning the first degree to the first genre and the second degree to the second genre to indicate how relative the first and second genres are to the media content; and providing for display, a representation of the media content, wherein the representation of the media content comprises an indication of how relative the first and second genres are to the media content. 9. The method as recited in claim 7 , wherein the determining a first degree based on the first trust level and a second degree based on the second trust level comprises: multiplying a number by the first trust level to produce the first degree; and multiplying the number by the second trust level to produce the second degree. | 0.77957 |
7,548,957 | 16 | 19 | 16. A computer-readable storage medium carrying one or more sequences of instructions for providing access to a memo pad over a computer network, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to: configure a web provider to support a memo pad portlet; receive a first request for a web page from a user, the web page comprising the memo pad portlet, wherein the memo pad portlet comprises restricting access by the identity of the user, a content screen, and a listing of one or more documents created by the user for a specified duration; identify the web provider at an application server based on the request; transmit a second request to the web provider for content; parse the second request at the web provider; check, at the web provider, one or more central repositories to determine whether the content exists; fulfill the second request with the content at the web provider; transmit the information satisfying the second request from the web provider to the application server to be assembled in response to the first request for content by using information about the structure, appearance and operation of requested web page and the information obtained from the web provider; obtain the content to be displayed in the memo pad portlet from the web provider; assemble the requested web page at the application server, wherein the application server retrieves information about the structure, appearance, and operation of the web page from a database and thereafter composes the web page with the information and the content from the web provider and database; and transmit the web page to the user. | 16. A computer-readable storage medium carrying one or more sequences of instructions for providing access to a memo pad over a computer network, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to: configure a web provider to support a memo pad portlet; receive a first request for a web page from a user, the web page comprising the memo pad portlet, wherein the memo pad portlet comprises restricting access by the identity of the user, a content screen, and a listing of one or more documents created by the user for a specified duration; identify the web provider at an application server based on the request; transmit a second request to the web provider for content; parse the second request at the web provider; check, at the web provider, one or more central repositories to determine whether the content exists; fulfill the second request with the content at the web provider; transmit the information satisfying the second request from the web provider to the application server to be assembled in response to the first request for content by using information about the structure, appearance and operation of requested web page and the information obtained from the web provider; obtain the content to be displayed in the memo pad portlet from the web provider; assemble the requested web page at the application server, wherein the application server retrieves information about the structure, appearance, and operation of the web page from a database and thereafter composes the web page with the information and the content from the web provider and database; and transmit the web page to the user. 19. The computer-readable storage medium of claim 16 , wherein the web page is transmitted over a wireless network to the user. | 0.637143 |
7,668,888 | 1 | 19 | 1. A computer-implemented method for providing, via a computer processor, at least one readable object that is readable by a search engine from at least one structured data object stored in a database, the method comprising: extracting, via the computer processor, the structured data object from the database, wherein the structured data object includes a hierarchical sequence of nodes related by at least one link and a plurality of content, and wherein at least one content of the plurality of content is nonreadable content that cannot be read by the search engine; mapping, via the computer processor, the structured data object into a generic data model according to the hierarchical sequence of nodes and content; and creating, via the computer processor, the readable object from the generic data model, wherein creating includes converting the nonreadable content of the structured data object into readable content for the search engine. | 1. A computer-implemented method for providing, via a computer processor, at least one readable object that is readable by a search engine from at least one structured data object stored in a database, the method comprising: extracting, via the computer processor, the structured data object from the database, wherein the structured data object includes a hierarchical sequence of nodes related by at least one link and a plurality of content, and wherein at least one content of the plurality of content is nonreadable content that cannot be read by the search engine; mapping, via the computer processor, the structured data object into a generic data model according to the hierarchical sequence of nodes and content; and creating, via the computer processor, the readable object from the generic data model, wherein creating includes converting the nonreadable content of the structured data object into readable content for the search engine. 19. The computer-implemented method of claim 1 , wherein providing the readable object from the structured data object occurs after a variable time interval. | 0.710332 |
9,003,339 | 1 | 6 | 1. A non-transitory computer-readable storage medium having instructions stored therein for causing a processor to perform a process of synthesizing a behavioral description of a circuit into a structural description of the circuit, the process comprising: receiving the behavioral description of the circuit, the behavioral description including a first statement that is associated with a condition; identifying the condition associated with the first statement; identifying one or more other statements associated with the first statement, including: determining a downstream statement that depends on the first statement, and/or determining an upstream statement upon which the first statement depends; inferring one or more potential clock domains gated by the condition for logic associated with the first statement and the one or more other statements; scheduling the logic associated with the first statement and the one or more other statements according to the one or more potential clock domains; and generating the structural description of the circuit, the structural description including a structural description of the scheduled logic. | 1. A non-transitory computer-readable storage medium having instructions stored therein for causing a processor to perform a process of synthesizing a behavioral description of a circuit into a structural description of the circuit, the process comprising: receiving the behavioral description of the circuit, the behavioral description including a first statement that is associated with a condition; identifying the condition associated with the first statement; identifying one or more other statements associated with the first statement, including: determining a downstream statement that depends on the first statement, and/or determining an upstream statement upon which the first statement depends; inferring one or more potential clock domains gated by the condition for logic associated with the first statement and the one or more other statements; scheduling the logic associated with the first statement and the one or more other statements according to the one or more potential clock domains; and generating the structural description of the circuit, the structural description including a structural description of the scheduled logic. 6. The non-transitory computer-readable storage medium of claim 1 , wherein the scheduling comprises: assigning, based on a user directive, logic associated with the first statement and at least some of the one or more other statements to a particular gated clock domain, the particular gated clock domain being gated by the condition. | 0.72314 |
8,370,364 | 3 | 4 | 3. The method of claim 1 , further including merging some of the listing of possible time zones by grouping those of the listing of possible time zones having shared daylight saving transition rules over the predetermined period of time. | 3. The method of claim 1 , further including merging some of the listing of possible time zones by grouping those of the listing of possible time zones having shared daylight saving transition rules over the predetermined period of time. 4. The method of claim 3 , further including obtaining the shared daylight saving transition rules from a time zone database. | 0.5 |
8,170,989 | 1 | 2 | 1. A method of consolidating information in a document management and exchange system, the method comprising: adding a descriptor to an original document for exchange between two or more participant systems along a communication path, wherein the descriptor comprises at least one document identifier representing a logical subject of the document; identifying in further documents received from the communication path at the two or more participant systems modifications with respect to the original document based on comparing a descriptor of the further documents and the descriptor of the original document, wherein the further documents represent modified versions of the original document exchanged between the two or more participant systems, and wherein at least one participant system receives a further document with modifications different than modifications in another further document received by at least one other participant system; and maintaining a master document for each of the participant systems containing the original document and the modifications in the further documents received by that participant system from the communication path during the exchange of the modified versions of the original document between the two or more participant systems, the master document for each participant system providing consolidated information relating to the logical subject and the modifications received by that participant system, and wherein the master documents for at least two of the participant systems are different and include different modifications based on the further documents received at those at least two participant systems. | 1. A method of consolidating information in a document management and exchange system, the method comprising: adding a descriptor to an original document for exchange between two or more participant systems along a communication path, wherein the descriptor comprises at least one document identifier representing a logical subject of the document; identifying in further documents received from the communication path at the two or more participant systems modifications with respect to the original document based on comparing a descriptor of the further documents and the descriptor of the original document, wherein the further documents represent modified versions of the original document exchanged between the two or more participant systems, and wherein at least one participant system receives a further document with modifications different than modifications in another further document received by at least one other participant system; and maintaining a master document for each of the participant systems containing the original document and the modifications in the further documents received by that participant system from the communication path during the exchange of the modified versions of the original document between the two or more participant systems, the master document for each participant system providing consolidated information relating to the logical subject and the modifications received by that participant system, and wherein the master documents for at least two of the participant systems are different and include different modifications based on the further documents received at those at least two participant systems. 2. The method according to claim 1 , wherein the original document comprises a collection of documents and a descriptor is added to each of the collected documents. | 0.717241 |
8,935,275 | 50 | 51 | 50. A method performed by a computing device that includes a memory and one or more processors, the method comprising: maintaining in a first database a plurality of nodes of a social network or a social graph; providing an interface for users of the social network or social graph to share and post content items in one or more communication channels of the social network or social graph; receiving from the user via the interface the content item comprising selected content and instructions for selecting a referenced node; in response to receiving instructions from the user to select a referenced node via the interface, presenting in the interface a list of referenced nodes; receiving a selected referenced node from the list of referenced nodes; sending a link to the selected referenced node; and in response to receiving a user request to share and post the content item, presenting the content item in one or more communication channels of the social network, the content item comprising the link to the selected referenced node, wherein the first database is a partial component of a universal database, where the universal database comprises a plurality of databases, wherein updates to the first database are synchronized in the universal database. | 50. A method performed by a computing device that includes a memory and one or more processors, the method comprising: maintaining in a first database a plurality of nodes of a social network or a social graph; providing an interface for users of the social network or social graph to share and post content items in one or more communication channels of the social network or social graph; receiving from the user via the interface the content item comprising selected content and instructions for selecting a referenced node; in response to receiving instructions from the user to select a referenced node via the interface, presenting in the interface a list of referenced nodes; receiving a selected referenced node from the list of referenced nodes; sending a link to the selected referenced node; and in response to receiving a user request to share and post the content item, presenting the content item in one or more communication channels of the social network, the content item comprising the link to the selected referenced node, wherein the first database is a partial component of a universal database, where the universal database comprises a plurality of databases, wherein updates to the first database are synchronized in the universal database. 51. The method according to claim 50 , wherein the list of referenced nodes comprises connections from a social graph of connected nodes in a network environment, the connections from the social graph of connected nodes identifying nodes of the social network connected to the user in the social graph. | 0.5 |
9,405,997 | 12 | 14 | 12. A non-transitory computer-readable medium having instructions encoded thereon which, when executed by a processing device, causes the processing device to perform operations comprising: receiving an image file representing an image comprising text, the text comprising a plurality of letters; generating a data structure comprising a set of nodes, wherein the set of nodes comprises a plurality of parent nodes, each of the parent nodes associated with one or more terminal nodes, wherein each of the terminal nodes represents an initial letterform class of the plurality of letters and each of the parent nodes represents an initial letterform class group of initial letterform classes, wherein a first initial letterform class group represented by a first parent node is associated with a plurality of initial letterform classes of different letters having common letter properties; and determining a set of final letterform classes by: comparing two parent nodes of the set of nodes; and merging the two parent nodes of the set of nodes based on the comparison. | 12. A non-transitory computer-readable medium having instructions encoded thereon which, when executed by a processing device, causes the processing device to perform operations comprising: receiving an image file representing an image comprising text, the text comprising a plurality of letters; generating a data structure comprising a set of nodes, wherein the set of nodes comprises a plurality of parent nodes, each of the parent nodes associated with one or more terminal nodes, wherein each of the terminal nodes represents an initial letterform class of the plurality of letters and each of the parent nodes represents an initial letterform class group of initial letterform classes, wherein a first initial letterform class group represented by a first parent node is associated with a plurality of initial letterform classes of different letters having common letter properties; and determining a set of final letterform classes by: comparing two parent nodes of the set of nodes; and merging the two parent nodes of the set of nodes based on the comparison. 14. The non-transitory computer-readable medium of claim 12 , wherein comparing two of the set of nodes comprises generating a similarity metric between a first node and a second node based on letter properties associated with the first node and letter properties associated with the second node. | 0.691667 |
8,775,356 | 13 | 14 | 13. A knowledge base storing unstructured data, comprising: a non-transitory storage device for storing a plurality of separate unstructured knowledge entities in said knowledge base, the knowledge entities each having been annotated with associated properties and corresponding values to enable a semantic search of said knowledge base, certain of said properties being of one or more types of special properties that infer relations between knowledge entities; and a reasoning engine that processes a search query on said knowledge base using said inferred relations and semantic reasoning logic to locate knowledge entities providing relevant information that is inferred from but not expressly stated in the search query. | 13. A knowledge base storing unstructured data, comprising: a non-transitory storage device for storing a plurality of separate unstructured knowledge entities in said knowledge base, the knowledge entities each having been annotated with associated properties and corresponding values to enable a semantic search of said knowledge base, certain of said properties being of one or more types of special properties that infer relations between knowledge entities; and a reasoning engine that processes a search query on said knowledge base using said inferred relations and semantic reasoning logic to locate knowledge entities providing relevant information that is inferred from but not expressly stated in the search query. 14. The knowledge base of claim 13 , wherein said knowledge base is a unified content repository of an enterprise that stores unstructured enterprise data. | 0.5 |
8,707,252 | 1 | 3 | 1. A method of processing an input comprising: providing a graphical representation of a finite state machine including states and transitions between said states representing a syntax used for determining whether the input is syntactically valid, said graphical representation of said finite state machine including elements representing said states and said transitions between said states; generating, from said graphical representation, a second representation corresponding to said graphical representation; generating, using said second representation, parser source code, wherein said generating the parser source code further includes: generating code for an outer processing loop and a switch statement included within the outer processing loop whereby the switch statement switches between different cases based on a value of a parsing state variable, each of the different cases corresponding to a different parsing state; for each of the different cases corresponding to a different parsing state included in the second representation, performing first processing to generate code for the different parsing state as a case of the switch statement, said first processing including: determining a set of valid next tokens causing a state transition from the different parsing state; generating code to process each of the valid next tokens in the set; and determining a next parsing state included in the second representation for which said first processing is performed; and generating code for a default case of the switch statement corresponding to an error state; processing the parser source code to generate parser executable code for a parser used for parsing the input to determine its syntactic validity in accordance with said syntax, wherein processing the parser source code includes compiling the parser source code; parsing the input using the parser, wherein said parsing includes executing the parser executable code for the parser generated from the parser source code; responsive to said parsing and the input being syntactically correct, generating an intermediate representation of the input, and wherein said syntax is a first of a plurality of syntaxes, said parser is one of a plurality of parsers, a command is expressed in a plurality of different representations corresponding to said plurality of syntaxes, said input is one of the plurality of different representations of said command, and wherein each of said plurality of parsers parses one of the plurality of different representations of the command and generates a same intermediate representation that is said intermediate representation. | 1. A method of processing an input comprising: providing a graphical representation of a finite state machine including states and transitions between said states representing a syntax used for determining whether the input is syntactically valid, said graphical representation of said finite state machine including elements representing said states and said transitions between said states; generating, from said graphical representation, a second representation corresponding to said graphical representation; generating, using said second representation, parser source code, wherein said generating the parser source code further includes: generating code for an outer processing loop and a switch statement included within the outer processing loop whereby the switch statement switches between different cases based on a value of a parsing state variable, each of the different cases corresponding to a different parsing state; for each of the different cases corresponding to a different parsing state included in the second representation, performing first processing to generate code for the different parsing state as a case of the switch statement, said first processing including: determining a set of valid next tokens causing a state transition from the different parsing state; generating code to process each of the valid next tokens in the set; and determining a next parsing state included in the second representation for which said first processing is performed; and generating code for a default case of the switch statement corresponding to an error state; processing the parser source code to generate parser executable code for a parser used for parsing the input to determine its syntactic validity in accordance with said syntax, wherein processing the parser source code includes compiling the parser source code; parsing the input using the parser, wherein said parsing includes executing the parser executable code for the parser generated from the parser source code; responsive to said parsing and the input being syntactically correct, generating an intermediate representation of the input, and wherein said syntax is a first of a plurality of syntaxes, said parser is one of a plurality of parsers, a command is expressed in a plurality of different representations corresponding to said plurality of syntaxes, said input is one of the plurality of different representations of said command, and wherein each of said plurality of parsers parses one of the plurality of different representations of the command and generates a same intermediate representation that is said intermediate representation. 3. The method of claim 1 , wherein said second representation is a textual representation formed using a markup language. | 0.819403 |
8,156,117 | 1 | 44 | 1. A system for storing, searching and retrieval of a plurality of information objects of an arbitrary application domain, comprising: a distributed computer system comprising one or a plurality of computing devices connected with each other by communication lines, a connected logical storage network, wherein each node is an active unit of storage (AUS) and connections between nodes of said network are formed by links of one active units of storage to others, wherein every active unit of storage resides on one of the computing devices of said distributed computer system and comprises: at least one of said plurality of information objects (IOs), each of which is represented in a tree-like structure, a list of links to a certain plurality of other active units of storage by means of which said AUS participates in the operation of the logical storage network, and an associated program agent that allows performing operations on said AUS in connection with searching, storing and retrieving information by user requests using said list of links, wherein a program agent of each active unit of storage compares the IO incorporated into it with the IO of any other AUS and based on the comparison results computes the value of metric distance between the compared IOs and the IOs are electronic documents in the form of XML documents. | 1. A system for storing, searching and retrieval of a plurality of information objects of an arbitrary application domain, comprising: a distributed computer system comprising one or a plurality of computing devices connected with each other by communication lines, a connected logical storage network, wherein each node is an active unit of storage (AUS) and connections between nodes of said network are formed by links of one active units of storage to others, wherein every active unit of storage resides on one of the computing devices of said distributed computer system and comprises: at least one of said plurality of information objects (IOs), each of which is represented in a tree-like structure, a list of links to a certain plurality of other active units of storage by means of which said AUS participates in the operation of the logical storage network, and an associated program agent that allows performing operations on said AUS in connection with searching, storing and retrieving information by user requests using said list of links, wherein a program agent of each active unit of storage compares the IO incorporated into it with the IO of any other AUS and based on the comparison results computes the value of metric distance between the compared IOs and the IOs are electronic documents in the form of XML documents. 44. The method for removing information about objects of an arbitrary application domain from the system for storage and retrieval of a plurality of information objects according to claim 1 , comprising the steps of: a) marking an AUS to be removed, and b) comparing IOs of new AUSs added to said storage and search system with the IO of the AUS to be removed and, if the similarity criterion as per the metric of said IOs is met, replacing the AUS being removed with the added AUS on the logical network of said system. | 0.794141 |
8,832,103 | 1 | 7 | 1. In a computing system environment, a method of filtering to users relevancy data available from one or more computing devices, comprising: from a plurality of original files on the one or more computing devices, each file representing an underlying original bits of data and representative of a relevancy topic, creating a key in a multi-dimensional mapping space for the relevancy topic wherein the multi-dimensional mapping space is defined by an N-dimensional space according to a number of symbols N corresponding to the underlying original bits of data, said key being created by defining a digital spectrum of each of said plurality of files from an entirety of said original bits of data of said plurality of files, aggregating each said digital spectrum of each of said plurality of files, and plotting said aggregated digital spectrum as defining a single point in the multi-dimensional mapping space representing the relevancy topic for said plurality of original files; and determining whether new data on the one or more computing devices is sufficiently related to the relevancy topic by being within a predefined closeness of the key in the multi-dimensional mapping space. | 1. In a computing system environment, a method of filtering to users relevancy data available from one or more computing devices, comprising: from a plurality of original files on the one or more computing devices, each file representing an underlying original bits of data and representative of a relevancy topic, creating a key in a multi-dimensional mapping space for the relevancy topic wherein the multi-dimensional mapping space is defined by an N-dimensional space according to a number of symbols N corresponding to the underlying original bits of data, said key being created by defining a digital spectrum of each of said plurality of files from an entirety of said original bits of data of said plurality of files, aggregating each said digital spectrum of each of said plurality of files, and plotting said aggregated digital spectrum as defining a single point in the multi-dimensional mapping space representing the relevancy topic for said plurality of original files; and determining whether new data on the one or more computing devices is sufficiently related to the relevancy topic by being within a predefined closeness of the key in the multi-dimensional mapping space. 7. The method of claim 1 , further including receiving the new data as a stream of discrete data elements from multiple disparate computing sources. | 0.626263 |
8,918,716 | 1 | 5 | 1. A computer-readable medium having instructions stored thereon that, when executed by a processor, cause the processor to facilitate the application of context-based smart tags, the facilitating comprising: determining a type of a context object in a web page based on a context tag, comprising a start-tag and a matching end-tag, that surrounds the context object source code in the web page, the context tag defining the type of the context object; determining one or more context-specific actions that may be performed for the context object based on the context object type and a smart tag framework comprising: a type tag including a start-tag, a matching end-tag and a list of context object types, and a plurality of action tags, each action tag including a start-tag, a matching end-tag, a first parameter identifying one or more supported context object types and a second parameter identifying the name of an action class defining the action to be performed; receiving a selection from a user of the context object or a context indicator icon associated with, and displayed proximate to, the context object; providing the context-specific actions for the context object to the user; receiving a selection from the user of a context-specific action to be performed; and performing the selected context-specific action; wherein the smart tag framework is defined in one or more smart tag configuration files. | 1. A computer-readable medium having instructions stored thereon that, when executed by a processor, cause the processor to facilitate the application of context-based smart tags, the facilitating comprising: determining a type of a context object in a web page based on a context tag, comprising a start-tag and a matching end-tag, that surrounds the context object source code in the web page, the context tag defining the type of the context object; determining one or more context-specific actions that may be performed for the context object based on the context object type and a smart tag framework comprising: a type tag including a start-tag, a matching end-tag and a list of context object types, and a plurality of action tags, each action tag including a start-tag, a matching end-tag, a first parameter identifying one or more supported context object types and a second parameter identifying the name of an action class defining the action to be performed; receiving a selection from a user of the context object or a context indicator icon associated with, and displayed proximate to, the context object; providing the context-specific actions for the context object to the user; receiving a selection from the user of a context-specific action to be performed; and performing the selected context-specific action; wherein the smart tag framework is defined in one or more smart tag configuration files. 5. The computer-readable medium of claim 1 , wherein the smart tag configuration groups multiple actions into a single group. | 0.831081 |
7,529,676 | 1 | 2 | 1. An audio device control device for controlling an audio device for reproducing music comprising: music specification information storing means which stores specification information for specifying the music in advance; constant storing means which stores a phrase and a predetermined constant in association with one another in advance; speech recognition means which acquires speech data representing a speech, and specifies a candidate for a phrase included in said speech by performing speech recognition on said speech data, and calculates likelihood for each of the candidate of the specified phrase; operational status information acquisition means which acquires operational status information indicating an operational status of the audio device to be controlled; and audio device control means which calculates a parameter for specifying music based on the predetermined constant corresponding to the phrase specified by the speech recognition means and the likelihood calculated by the speech recognition means, specifies music reproduced by the audio device based on the operational status acquired by said operational status information acquisition means and on the calculated parameter; and controls said audio device for reproducing the specified music. | 1. An audio device control device for controlling an audio device for reproducing music comprising: music specification information storing means which stores specification information for specifying the music in advance; constant storing means which stores a phrase and a predetermined constant in association with one another in advance; speech recognition means which acquires speech data representing a speech, and specifies a candidate for a phrase included in said speech by performing speech recognition on said speech data, and calculates likelihood for each of the candidate of the specified phrase; operational status information acquisition means which acquires operational status information indicating an operational status of the audio device to be controlled; and audio device control means which calculates a parameter for specifying music based on the predetermined constant corresponding to the phrase specified by the speech recognition means and the likelihood calculated by the speech recognition means, specifies music reproduced by the audio device based on the operational status acquired by said operational status information acquisition means and on the calculated parameter; and controls said audio device for reproducing the specified music. 2. The audio device control device according to claim 1 , further comprising: environmental information acquisition means which acquires environmental data indicating environmental circumstances in which an external audio device is employed; and wherein the audio device control means specifies music reproduced by the audio device based on the environmental data acquired by the environmental information acquisition means. | 0.611722 |
9,690,767 | 1 | 9 | 1. A computer-implemented method comprising: receiving first text submitted by a first user; for each of a plurality of different previously submitted texts, calculating a text similarity score based on a textual similarity of the first text to the previously submitted text, and calculating a sentiment similarity score based on a similarity between sentiment of the first text and sentiment of the previously submitted text; based on the scores, selecting one or more of the previously submitted texts having closest similarity to the first text; for each of the selected texts, identifying an emoticon previously selected by a user for insertion into the selected text; and providing the identified emoticons for selection by the first user. | 1. A computer-implemented method comprising: receiving first text submitted by a first user; for each of a plurality of different previously submitted texts, calculating a text similarity score based on a textual similarity of the first text to the previously submitted text, and calculating a sentiment similarity score based on a similarity between sentiment of the first text and sentiment of the previously submitted text; based on the scores, selecting one or more of the previously submitted texts having closest similarity to the first text; for each of the selected texts, identifying an emoticon previously selected by a user for insertion into the selected text; and providing the identified emoticons for selection by the first user. 9. The method of claim 1 wherein a particular identified emoticon is a user-defined emoticon comprising a visual representation and being associated with a respective sentiment. | 0.775381 |
6,151,609 | 13 | 17 | 13. A remote system administration editor system, comprising: a storage medium for storing at least one computer file; and a server responsive to one or more of the computer files of the storage medium to communicate an editor input form to a client using a network in response to receiving a request from the client, the client using a forms-enabled and script-enabled web browser; receive a server path input in response to the editor input form from the web browser; communicate a file selection form to the web browser that includes the text of the filenames identifying files included in a server path defined by the server path input; receive a file selection in response to the file selection form, the file selection identifying one of the files; communicate a copy of the one of the files associated with the file selection to the web browser for editing; and receive an updated file for storage, the updated file produced by editing the copy of the one of the files that has been edited with the web browser without the use of a plug-in to the web browser. | 13. A remote system administration editor system, comprising: a storage medium for storing at least one computer file; and a server responsive to one or more of the computer files of the storage medium to communicate an editor input form to a client using a network in response to receiving a request from the client, the client using a forms-enabled and script-enabled web browser; receive a server path input in response to the editor input form from the web browser; communicate a file selection form to the web browser that includes the text of the filenames identifying files included in a server path defined by the server path input; receive a file selection in response to the file selection form, the file selection identifying one of the files; communicate a copy of the one of the files associated with the file selection to the web browser for editing; and receive an updated file for storage, the updated file produced by editing the copy of the one of the files that has been edited with the web browser without the use of a plug-in to the web browser. 17. The system of claim 13, wherein the server is responsive to search the one of the files to determine if selected text is present. | 0.78268 |
10,051,116 | 6 | 8 | 6. A line diagnosis apparatus, comprising: an acquiring module, arranged to acquire a test result reported by a test device, wherein, the test result is a test result acquired after the test device tests a line that needs line diagnosis; an invoking module, arranged to invoke a dynamic language file to analyze the test result and obtain a line diagnosis result, wherein, the dynamic language file comprises known line fault types described in a dynamic language and judging conditions corresponding to the known line fault types, and a receiving module, arranged to receive the dynamic language file modified by a user; wherein, the invoking module is further arranged to in a next process of analyzing a test result, invoke the modified dynamic language file to analyze the test result and obtain a line diagnosis result. | 6. A line diagnosis apparatus, comprising: an acquiring module, arranged to acquire a test result reported by a test device, wherein, the test result is a test result acquired after the test device tests a line that needs line diagnosis; an invoking module, arranged to invoke a dynamic language file to analyze the test result and obtain a line diagnosis result, wherein, the dynamic language file comprises known line fault types described in a dynamic language and judging conditions corresponding to the known line fault types, and a receiving module, arranged to receive the dynamic language file modified by a user; wherein, the invoking module is further arranged to in a next process of analyzing a test result, invoke the modified dynamic language file to analyze the test result and obtain a line diagnosis result. 8. The apparatus according to claim 6 , wherein, the invoking module is further arranged to invoke the dynamic language file through a dynamic language engine to analyze the test result. | 0.86015 |
9,749,270 | 1 | 6 | 1. A method for communicating via an avatar, the method comprising: sending, by one or more processors, an email that includes an embedded avatar from a sender at a first computing device to a recipient at a second computing device; responsive to the recipient at the second computing device selecting the embedded avatar, providing, by one or more processors, an interface through which said recipient interacts to submit a query via the avatar; receiving, by one or more processors, the query via a communication protocol; parsing and analyzing, by one or more processors, the received query; retrieving, by one or more processors, an answer corresponding to the parsed and analyzed query from a mailbox of the sender, wherein the mailbox of the sender includes emails associated with the parsed and analyzed query; sending, by one or more processors, the answer to the second computing device; and initiating, by one or more processors, display of the answer via the avatar on the second computing device. | 1. A method for communicating via an avatar, the method comprising: sending, by one or more processors, an email that includes an embedded avatar from a sender at a first computing device to a recipient at a second computing device; responsive to the recipient at the second computing device selecting the embedded avatar, providing, by one or more processors, an interface through which said recipient interacts to submit a query via the avatar; receiving, by one or more processors, the query via a communication protocol; parsing and analyzing, by one or more processors, the received query; retrieving, by one or more processors, an answer corresponding to the parsed and analyzed query from a mailbox of the sender, wherein the mailbox of the sender includes emails associated with the parsed and analyzed query; sending, by one or more processors, the answer to the second computing device; and initiating, by one or more processors, display of the answer via the avatar on the second computing device. 6. The method of claim 1 , further comprising: receiving, by one or more processors, the query in an audio format; performing, by one or more processors, a speech-to-text transformation on the audio query; and providing, by one or more processors, the corresponding answer in an audio format via the avatar. | 0.701362 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.