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
|
|---|---|---|---|---|---|
7,650,286 | 14 | 17 |
14. The system of claim 13 , wherein said at least one attribute includes a name, a residence or business address, a telephone number, an electronic mail address, education data, past employer data, or salary data.
|
14. The system of claim 13 , wherein said at least one attribute includes a name, a residence or business address, a telephone number, an electronic mail address, education data, past employer data, or salary data. 17. The system of claim 14 , wherein the past employer data includes an employer name, a last title, and a period of employment.
| 0.536232 |
7,986,427 | 1 | 5 |
1. A system for copying interactive documents, the system comprising: a copier for scanning a surface of a document, the document being printed with document content and a plurality of coded tags, each tag encoding an identity of the document and the position of that tag on the document, the copier incorporating a sensor for sensing the coded tags; a computer system networked with the copier for identifying a digital version of the document from the document identity of a sensed tag and determining user input on the scanned document using the tag position of the sensed tag, the user input requesting copy content and/or coded data from the computer system; and a printer networked with the computer system for printing a copy of the scanned document incorporating said scanned document content and coded tags and the requested copy content and/or coded data.
|
1. A system for copying interactive documents, the system comprising: a copier for scanning a surface of a document, the document being printed with document content and a plurality of coded tags, each tag encoding an identity of the document and the position of that tag on the document, the copier incorporating a sensor for sensing the coded tags; a computer system networked with the copier for identifying a digital version of the document from the document identity of a sensed tag and determining user input on the scanned document using the tag position of the sensed tag, the user input requesting copy content and/or coded data from the computer system; and a printer networked with the computer system for printing a copy of the scanned document incorporating said scanned document content and coded tags and the requested copy content and/or coded data. 5. A system according to claim 1 further comprising a network interface for transmitting to the computer system second document data representing said copy of the document to enable said second document data to be stored.
| 0.605357 |
8,903,802 | 1 | 9 |
1. A method for managing a new continuous query that includes folding a new continuous query into a shared continuous query plan (SCP) associated with a global range table, the method comprising: receiving via a computer readable storage medium a new continuous query; compiling the new continuous query to generate an iterator model plan (IMP) and an associated local range table that includes a list of range variables, each of which uniquely identifies an object in the new continuous query, and wherein the IMP corresponds to an execution plan generated for the new continuous query and comprises one or more IMP operators, each of which includes one or more expressions whose variables are associated with the local range table; analyzing the one or more IMP operators of the IMP and one or more SCP operators of the SCP to produce one or more variable transforms and one or more plan items; wherein the one or more variable transforms modify the one or more expressions of the one or more IMP operators by associating the one or more IMP operators with variables of a global range table; wherein the one or more plan items comprise one or more groups of the one or more IMP operators; applying the variable transforms to modify the variables of the one or more iterator model plan IMP operators; generating a continuous query operator based on each plan item included in the one or more plan items; and providing the generated continuous query operator to a shared continuous query plan.
|
1. A method for managing a new continuous query that includes folding a new continuous query into a shared continuous query plan (SCP) associated with a global range table, the method comprising: receiving via a computer readable storage medium a new continuous query; compiling the new continuous query to generate an iterator model plan (IMP) and an associated local range table that includes a list of range variables, each of which uniquely identifies an object in the new continuous query, and wherein the IMP corresponds to an execution plan generated for the new continuous query and comprises one or more IMP operators, each of which includes one or more expressions whose variables are associated with the local range table; analyzing the one or more IMP operators of the IMP and one or more SCP operators of the SCP to produce one or more variable transforms and one or more plan items; wherein the one or more variable transforms modify the one or more expressions of the one or more IMP operators by associating the one or more IMP operators with variables of a global range table; wherein the one or more plan items comprise one or more groups of the one or more IMP operators; applying the variable transforms to modify the variables of the one or more iterator model plan IMP operators; generating a continuous query operator based on each plan item included in the one or more plan items; and providing the generated continuous query operator to a shared continuous query plan. 9. The method according to claim 1 , further comprising producing for each plan item a new continuous query operator to be added to the shared continuous query plan based on an iterator model plan sub-plan.
| 0.538117 |
7,496,559 | 26 | 29 |
26. A computerized search system, comprising: at least one processor configured to generate for display: a single search interface configured for display on a display device, the single search interface comprising at least: an email search interface having at least a first email-specific attribute search field selected from the group comprising a date field, a from field, and a sender field; and a file search interface having at least a first file-specific attribute search field selected from the group comprising a file name field, a file type field, a date field, a file size field, and a path field; a Web history search interface having Web page-specific attribute search fields, including one or more of a date field, a title field, a size field, and a search term field; an email attachment search interface having email attachment-specific attribute search fields including one or more of a name field, a date field, a size field, and an extension field; a favorites search interface used to search Web pages designated by a user as favorite Web pages; at least one index comprising data regarding emails and files; one or more memories configured to store the at least one index; and an apparatus configured to access the at least one index in order to perform incremental searching of the emails and files as the user enters characters into at least one of the email-specific search fields and the file-specific search fields, wherein the processor executes the apparatus.
|
26. A computerized search system, comprising: at least one processor configured to generate for display: a single search interface configured for display on a display device, the single search interface comprising at least: an email search interface having at least a first email-specific attribute search field selected from the group comprising a date field, a from field, and a sender field; and a file search interface having at least a first file-specific attribute search field selected from the group comprising a file name field, a file type field, a date field, a file size field, and a path field; a Web history search interface having Web page-specific attribute search fields, including one or more of a date field, a title field, a size field, and a search term field; an email attachment search interface having email attachment-specific attribute search fields including one or more of a name field, a date field, a size field, and an extension field; a favorites search interface used to search Web pages designated by a user as favorite Web pages; at least one index comprising data regarding emails and files; one or more memories configured to store the at least one index; and an apparatus configured to access the at least one index in order to perform incremental searching of the emails and files as the user enters characters into at least one of the email-specific search fields and the file-specific search fields, wherein the processor executes the apparatus. 29. The computerized search system as defined in claim 26 , further comprising an index apparatus configured to generate at least a first index, the first index including at least an attribute data file, an occurrence file, and a deletions file.
| 0.739362 |
9,608,893 | 1 | 3 |
1. A method for applying an update to a communication protocol in a software application executed by a computing device, the method comprising: storing a first machine-executable object parser configured to parse received data objects based on a communication protocol, wherein the first machine-executable object parser is associated with a first timestamp, and wherein the first machine-executable object parser is based on a first protocol definition, wherein the first protocol definition indicates positions of data elements within data objects corresponding to the communication protocol; executing, by the computer device, the software application including the first machine-executable object parser, wherein the first machine-executable object parser is loaded in active memory of the computing device and is in communication with the software application; receiving, by the computing device, a second protocol definition corresponding to the communication protocol, wherein the second protocol definition indicates positions of data elements within data objects corresponding to the communication protocol, and wherein the second protocol definition includes a second timestamp; determining, by the computing device, that the second protocol definition differs from the first protocol definition; determining that the second timestamp is newer than the first timestamp; upon determining that the second timestamp is newer than the first timestamp, automatically creating, by the computing device and without pausing execution of the software application, a second machine-executable object parser based on the second protocol definition; replacing the first machine-executable object parser in active memory with the second machine-executable object parser; receiving, by the software application, a data object corresponding to the communication protocol; and executing, by the computing device, the second machine-executable object parser to parse at least a portion of the data elements in the data object received by the software application and communicating the parsed data elements to the software application.
|
1. A method for applying an update to a communication protocol in a software application executed by a computing device, the method comprising: storing a first machine-executable object parser configured to parse received data objects based on a communication protocol, wherein the first machine-executable object parser is associated with a first timestamp, and wherein the first machine-executable object parser is based on a first protocol definition, wherein the first protocol definition indicates positions of data elements within data objects corresponding to the communication protocol; executing, by the computer device, the software application including the first machine-executable object parser, wherein the first machine-executable object parser is loaded in active memory of the computing device and is in communication with the software application; receiving, by the computing device, a second protocol definition corresponding to the communication protocol, wherein the second protocol definition indicates positions of data elements within data objects corresponding to the communication protocol, and wherein the second protocol definition includes a second timestamp; determining, by the computing device, that the second protocol definition differs from the first protocol definition; determining that the second timestamp is newer than the first timestamp; upon determining that the second timestamp is newer than the first timestamp, automatically creating, by the computing device and without pausing execution of the software application, a second machine-executable object parser based on the second protocol definition; replacing the first machine-executable object parser in active memory with the second machine-executable object parser; receiving, by the software application, a data object corresponding to the communication protocol; and executing, by the computing device, the second machine-executable object parser to parse at least a portion of the data elements in the data object received by the software application and communicating the parsed data elements to the software application. 3. The method in accordance with claim 1 , wherein creating the second machine-executable object parser comprises generating source code based on the second protocol definition.
| 0.817526 |
7,983,963 | 1 | 9 |
1. A computer implemented method of facilitating a guided navigational search by one or more users of one or more remote user computers in communication with an online retail or wholesale store computer defining an online e-commerce computer associated with an online e-commerce product provider, through an electronic communication network, the method comprising the steps of: providing a product search request content page of an online e-commerce website having a pre-selected format, through the communication network, the product search request content page viewable on a display of one or more user computers and including fields for entering into the product search request content page product search request criteria comprising one or more search terms; initiating an initial product search request responsive to receipt of the one or more search terms from the one or more remote second computers; returning a plurality of product search results responsive to the initial product search request; accessing a plurality of general product attributes associated with the plurality of returned product search results; determining at least one website user interaction refinement associated with a specific customer user by the online e-commerce computer, the at least one website user interaction refinement based upon a customer user lifecycle stage with the e-commerce product provider for the specific customer user and a traffic segment purchasing expectation associated with a traffic segment classification associated with the specific customer user; sorting the returned product search results responsive to the at least one website user interaction refinement to thereby form a plurality of potential refined product search results; and generating a product search results content page including at least a subset of the plurality of potential refined product search results and at least a subset of the sorted plurality of general product attributes for display on a display of the one or more remote second computers responsive to the plurality of refined product search results and the associated general product attributes.
|
1. A computer implemented method of facilitating a guided navigational search by one or more users of one or more remote user computers in communication with an online retail or wholesale store computer defining an online e-commerce computer associated with an online e-commerce product provider, through an electronic communication network, the method comprising the steps of: providing a product search request content page of an online e-commerce website having a pre-selected format, through the communication network, the product search request content page viewable on a display of one or more user computers and including fields for entering into the product search request content page product search request criteria comprising one or more search terms; initiating an initial product search request responsive to receipt of the one or more search terms from the one or more remote second computers; returning a plurality of product search results responsive to the initial product search request; accessing a plurality of general product attributes associated with the plurality of returned product search results; determining at least one website user interaction refinement associated with a specific customer user by the online e-commerce computer, the at least one website user interaction refinement based upon a customer user lifecycle stage with the e-commerce product provider for the specific customer user and a traffic segment purchasing expectation associated with a traffic segment classification associated with the specific customer user; sorting the returned product search results responsive to the at least one website user interaction refinement to thereby form a plurality of potential refined product search results; and generating a product search results content page including at least a subset of the plurality of potential refined product search results and at least a subset of the sorted plurality of general product attributes for display on a display of the one or more remote second computers responsive to the plurality of refined product search results and the associated general product attributes. 9. A method as defined in claim 1 , further comprising the step of: positioning the plurality of product search results in a pre-selected repository to define a plurality of predetermined product search results so that subsequent product search requests access the pre-selected repository prior to accessing a searchable database including a plurality of product attributes; wherein the step of initiating an initial product search request is initiated to a plurality of searchable databases if the one or more search terms have not been previously stored in the pre-selected repository, or if a pre-selected time threshold has been met since the last time that the one or more search terms have been previously searched in the plurality of searchable databases; and wherein the plurality of searchable databases includes a product attributes database containing the plurality of general product attributes associated with the one or more search terms to enhance search efficiency.
| 0.816223 |
9,785,676 | 8 | 17 |
8. A system, comprising: a memory that stores a set of instructions; and at least one processor that executes the set of instructions to: receive a query including at least one search term; access a default boost value from a memory device; search a content database to identify content items related to the at least one search term; determine whether the query includes a first override boost value; select a boost value as one of: the default boost value when the query is determined to not include the first override boost value, or the first override boost value when the query is determined to include the first override boost value; access a second override boost value from the query; generate a first relevance score for each content item of the identified content items by combining a plurality of scores assigned characteristics that apply to the identified content items; select at least one content item that includes a characteristic associated with the boost value from the identified content items; generate a second relevance score for the selected at least one content item by modifying the first relevance score of the at least one content item using the boost value and the second override boost value; generate an ordered list of the identified content items based on the first and second relevance scores; and transmit the ordered list to a display device.
|
8. A system, comprising: a memory that stores a set of instructions; and at least one processor that executes the set of instructions to: receive a query including at least one search term; access a default boost value from a memory device; search a content database to identify content items related to the at least one search term; determine whether the query includes a first override boost value; select a boost value as one of: the default boost value when the query is determined to not include the first override boost value, or the first override boost value when the query is determined to include the first override boost value; access a second override boost value from the query; generate a first relevance score for each content item of the identified content items by combining a plurality of scores assigned characteristics that apply to the identified content items; select at least one content item that includes a characteristic associated with the boost value from the identified content items; generate a second relevance score for the selected at least one content item by modifying the first relevance score of the at least one content item using the boost value and the second override boost value; generate an ordered list of the identified content items based on the first and second relevance scores; and transmit the ordered list to a display device. 17. The system of claim 8 , where the at least one processor, when generating the second relevance score, is to: add the boost value to the first relevance score.
| 0.600985 |
7,583,845 | 23 | 25 |
23. The system of claim 22 , wherein an output of the real-time encoding module is a transformed vector set including a transformed vector and vector-descriptor.
|
23. The system of claim 22 , wherein an output of the real-time encoding module is a transformed vector set including a transformed vector and vector-descriptor. 25. The system of claim 23 , wherein the vector descriptor contains information including a projection of a vector.
| 0.54 |
9,633,650 | 8 | 9 |
8. The method of claim 7 , further comprising: comparing the at least one contusion network to at least one model used in the large vocabulary speech recognition system to determine a conformity between the at least one confusion network and the at least one model; and calculating a transcription quality score for each of the audio files from the determined conformity.
|
8. The method of claim 7 , further comprising: comparing the at least one contusion network to at least one model used in the large vocabulary speech recognition system to determine a conformity between the at least one confusion network and the at least one model; and calculating a transcription quality score for each of the audio files from the determined conformity. 9. The method of claim 8 , further comprising filtering the plurality of transcription alternatives based upon the transcription quality score.
| 0.817602 |
8,020,091 | 13 | 14 |
13. A method as defined in claim 8 , wherein a user interface allows a user to select the anchor point for the first mathematical expression.
|
13. A method as defined in claim 8 , wherein a user interface allows a user to select the anchor point for the first mathematical expression. 14. A method as defined in claim 13 , wherein the selected anchor point is provided to the expression editing tool.
| 0.5 |
9,064,025 | 1 | 5 |
1. A method, comprising: receiving a search request from a user; presenting a list of a plurality of structured queries based on the search request to a human assistant; receiving a selection of one of the plurality of structured queries from the human assistant; obtaining an answer from a source using the selected structured query, wherein the answer is responsive to the search request; and providing the answer to the user.
|
1. A method, comprising: receiving a search request from a user; presenting a list of a plurality of structured queries based on the search request to a human assistant; receiving a selection of one of the plurality of structured queries from the human assistant; obtaining an answer from a source using the selected structured query, wherein the answer is responsive to the search request; and providing the answer to the user. 5. The method of claim 1 , further comprising: assisting the human assistant by providing a template associated with a category of the selection.
| 0.673423 |
9,740,690 | 12 | 14 |
12. The computer system of claim 11 , wherein the processor, when configured by the executable instructions, is operable to customize the flexible sentence syntax by at least one of inserting, omitting, reordering, or modifying the selected token.
|
12. The computer system of claim 11 , wherein the processor, when configured by the executable instructions, is operable to customize the flexible sentence syntax by at least one of inserting, omitting, reordering, or modifying the selected token. 14. The computer system of claim 12 , wherein the flexible sentence syntax is customized by modifying the token selection and wherein modifying the token selection includes customizing, via the developer interface, the sentence element with a computed derivative of one or more property expressions of the sentence element.
| 0.5 |
7,958,138 | 16 | 18 |
16. The method of claim 1 , wherein said related material of step (c) is related to said text section of step (b) by discussion of concepts that are related to one another.
|
16. The method of claim 1 , wherein said related material of step (c) is related to said text section of step (b) by discussion of concepts that are related to one another. 18. The method of claim 16 , wherein said concepts are considered related to one another when one is included within the other.
| 0.526119 |
7,505,956 | 1 | 8 |
1. A method for classification of objects for retrieval from a database, the method comprising: classifying an object by designating one or more terms for the object, the one or more terms being different from previously assigned terms for the object; saving the one or more terms in association with an address for the object in a user search index, the user search index being in a local environment of a user, the user search index containing a list of search terms for use by the user in a search query; promoting the one or more terms for the object from the user search index to a global search index if the one or more terms meet a predefined set of rules, the global search index being accessible by multiple users, the predefined set of rules being based on a number of different users classifying the object with the one or more terms after retrieval of the object from search query results; and combining user search index terms with global search index terms to form a master search query, the master search query operable by the user on a global object database.
|
1. A method for classification of objects for retrieval from a database, the method comprising: classifying an object by designating one or more terms for the object, the one or more terms being different from previously assigned terms for the object; saving the one or more terms in association with an address for the object in a user search index, the user search index being in a local environment of a user, the user search index containing a list of search terms for use by the user in a search query; promoting the one or more terms for the object from the user search index to a global search index if the one or more terms meet a predefined set of rules, the global search index being accessible by multiple users, the predefined set of rules being based on a number of different users classifying the object with the one or more terms after retrieval of the object from search query results; and combining user search index terms with global search index terms to form a master search query, the master search query operable by the user on a global object database. 8. The method as claimed in claim 1 , wherein the user registers with a global search engine and the local environment of the user is a partition of a global search engine.
| 0.516854 |
9,021,553 | 4 | 5 |
4. The method of claim 1 , wherein said encoding scheme comprises providing an n-th order answer to a particular question having a plurality of possible answers.
|
4. The method of claim 1 , wherein said encoding scheme comprises providing an n-th order answer to a particular question having a plurality of possible answers. 5. The method of claim 4 , wherein said n-th order is previously defined between said server and said user.
| 0.5 |
4,713,008 | 2 | 4 |
2. A method of teaching as in claim 1, wherein said indicium comprises: a graphic representation of essential components of said soniferous event, whereby said student is given a meaningful connection between said indicium and said language sound.
|
2. A method of teaching as in claim 1, wherein said indicium comprises: a graphic representation of essential components of said soniferous event, whereby said student is given a meaningful connection between said indicium and said language sound. 4. A method of teaching as in claim 2, wherein said indicium consists of: a symbol distinct from the Roman alphabet, whereby confusion between said language sound and an alphabetic representation of said language sound is avoided.
| 0.5 |
5,513,311 | 8 | 9 |
8. The data processing system of claim 7, wherein said new object and said plurality of objects are located in a display having a x-axis and a y-axis and wherein said creation means includes means for creating an OR connection in response to said new graphic object and an identified existing graphic object being located along a line parallel to a y-axis.
|
8. The data processing system of claim 7, wherein said new object and said plurality of objects are located in a display having a x-axis and a y-axis and wherein said creation means includes means for creating an OR connection in response to said new graphic object and an identified existing graphic object being located along a line parallel to a y-axis. 9. The data processing system of claim 8 further means for ascertaining a logical expression utilizing said new object and said plurality of existing objects having a logical connection with said new object.
| 0.5 |
7,624,075 | 12 | 16 |
12. A transformation framework for transducing directed graph data structures representing finite state transducers (FSTs) to a modular finite state transducer (MFST) in a computing system, comprising: means for storing a plurality of directed graph data structures of varying types for representing FSTs in a computing system including action semantics information of the plurality of directed graph data structures; and means for employing a transducer that analyzes the plurality of directed graph data structures based on a pre-defined tree grammar and transduces the plurality of directed graph data structures to at least one MFST while preserving action semantics information of the plurality of directed graph data structures, wherein the transducer performs any of intersect, complement and union operations, or performs any transformations that are reducible to any of intersection, union and complement operations, on the plurality of directed graph data structures, wherein it is determinable whether the resulting MFST accepts a non-empty input.
|
12. A transformation framework for transducing directed graph data structures representing finite state transducers (FSTs) to a modular finite state transducer (MFST) in a computing system, comprising: means for storing a plurality of directed graph data structures of varying types for representing FSTs in a computing system including action semantics information of the plurality of directed graph data structures; and means for employing a transducer that analyzes the plurality of directed graph data structures based on a pre-defined tree grammar and transduces the plurality of directed graph data structures to at least one MFST while preserving action semantics information of the plurality of directed graph data structures, wherein the transducer performs any of intersect, complement and union operations, or performs any transformations that are reducible to any of intersection, union and complement operations, on the plurality of directed graph data structures, wherein it is determinable whether the resulting MFST accepts a non-empty input. 16. The transformation framework of claim 12 , wherein said transducer compiles variable bindings of the plurality of directed graph data structures to slots in an activation record.
| 0.786385 |
9,565,275 | 1 | 5 |
1. An industrial automation device, comprising: a memory that stores executable components; a processor operatively coupled to the memory that executes the executable components, the executable components comprising: a component that generates and collects data generated by an industrial automation event, activity, or process; a cloud interface component that communicatively couples the industrial automation device to a web-based cloud and receives a request from an application executing on the web-based cloud to append a specified item of contextual metadata to the data, wherein the contextual metadata identifies at least an identity of a site and a production area that yielded the data, an identity of a product being produced at a time the data was generated, a state of a machine at the time the data was generated, and an actionable tag; and a transformation component that transforms the data into refined data for storage, analysis, or processing by the web-based cloud according to a determined requirement of the web-based cloud, wherein the transformation component appends the contextual metadata specified by the request to the data, wherein the identity of the site and the production area indicates an origin of the data within a hierarchical organization model of an industrial enterprise that includes at least an enterprise level, a site level, and a production area level; and wherein the cloud interface component sends the refined data to a cloud-based application running on the web-based cloud to notify a user in accordance with the actionable tag.
|
1. An industrial automation device, comprising: a memory that stores executable components; a processor operatively coupled to the memory that executes the executable components, the executable components comprising: a component that generates and collects data generated by an industrial automation event, activity, or process; a cloud interface component that communicatively couples the industrial automation device to a web-based cloud and receives a request from an application executing on the web-based cloud to append a specified item of contextual metadata to the data, wherein the contextual metadata identifies at least an identity of a site and a production area that yielded the data, an identity of a product being produced at a time the data was generated, a state of a machine at the time the data was generated, and an actionable tag; and a transformation component that transforms the data into refined data for storage, analysis, or processing by the web-based cloud according to a determined requirement of the web-based cloud, wherein the transformation component appends the contextual metadata specified by the request to the data, wherein the identity of the site and the production area indicates an origin of the data within a hierarchical organization model of an industrial enterprise that includes at least an enterprise level, a site level, and a production area level; and wherein the cloud interface component sends the refined data to a cloud-based application running on the web-based cloud to notify a user in accordance with the actionable tag. 5. The industrial automation device of claim 1 , wherein the transformation component tags the data with the actionable tag in response to determining that a value contained in the data is indicative of at least one of an alarm condition or an achieved production goal.
| 0.791149 |
9,704,487 | 7 | 11 |
7. A vehicle comprising: a speech recognition module configured to recognize a speech uttered by a user; a communication unit configured to receive a result of processing for speech recognition acquired by at least one user terminal; and a controller configured to: compare a result of processing for speech recognition acquired by the speech recognition module to the result of processing for speech recognition acquired by the at least one user terminal, and to control a device in the vehicle based on the comparison; and when the controller determines a speech waveform of the speech uttered from the user is different from a speech waveform acquired by the at least one user terminal and determines a number of the result of processing for speech recognition acquired by the speech recognition module is one, control the device in the vehicle based on the result of processing for speech recognition acquired by the speech recognition module.
|
7. A vehicle comprising: a speech recognition module configured to recognize a speech uttered by a user; a communication unit configured to receive a result of processing for speech recognition acquired by at least one user terminal; and a controller configured to: compare a result of processing for speech recognition acquired by the speech recognition module to the result of processing for speech recognition acquired by the at least one user terminal, and to control a device in the vehicle based on the comparison; and when the controller determines a speech waveform of the speech uttered from the user is different from a speech waveform acquired by the at least one user terminal and determines a number of the result of processing for speech recognition acquired by the speech recognition module is one, control the device in the vehicle based on the result of processing for speech recognition acquired by the speech recognition module. 11. The vehicle according to claim 7 , wherein when the controller determines that a speech waveform of the speech uttered from the user is different from a speech waveform acquired by the at least one user terminal, and that a plurality of results of speech recognition are acquired by the speech recognition module, the controller is configured to exclude the result of speech recognition acquired by the at least one user terminal from among the plurality of results of speech recognition.
| 0.535849 |
8,812,531 | 14 | 17 |
14. One or more computer-readable non-transitory storage media embodying software that is operable when executed by one or more computing devices to: derive a concept matrix from a plurality of sample documents using singular value decomposition of a term-document matrix, the concept matrix identifying a latent pattern of word usage in the plurality of sample documents around a concept; derive concept terms by extracting significant terms from search text and inferring relevant terms therefrom using the concept matrix; and generate a first query for a first index of a first search engine and a second query for a second index of a second search engine, the first and second queries comprising at least one of the derived concept terms.
|
14. One or more computer-readable non-transitory storage media embodying software that is operable when executed by one or more computing devices to: derive a concept matrix from a plurality of sample documents using singular value decomposition of a term-document matrix, the concept matrix identifying a latent pattern of word usage in the plurality of sample documents around a concept; derive concept terms by extracting significant terms from search text and inferring relevant terms therefrom using the concept matrix; and generate a first query for a first index of a first search engine and a second query for a second index of a second search engine, the first and second queries comprising at least one of the derived concept terms. 17. The media of claim 14 , the software further operable when executed by the one or more computing devices to cluster concept terms in synonym groups with an operator therebetween.
| 0.521053 |
7,711,676 | 1 | 11 |
1. A computer program product, embodied in a computer-readable medium, the computer program product being operable to cause data processing apparatus to: a) receive, during a first time duration, a first electronic document being communicated between business entities, the first electronic document comprising instances of a plurality of business data elements, the first electronic document having a format corresponding to a business communication schema, wherein the business communication schema includes a set of predefined business data elements for use in electronically communicating business data from a first business entity to a second business entity; b) identify an instance of a particular business data element in the first electronic document; c) increment a counter associated with the particular business data element in response to identifying the instance of the particular business data element in the first electronic document; d) receive, during the first time duration, a second electronic document being communicated between business entities; e) identify an instance of the particular business data element in the second electronic document; f) increment the counter associated with the particular business data element in response to identifying the instance of the particular business data element in the second electronic document; g) subsequent to elapse of the first time duration, compare the counter with a threshold value; h) based on the counter being less than the threshold value, delete the particular business data element from the business communication schema; i) prior to deleting the particular business data element from the business communication schema, notify a user if the counter is less than the threshold value; j) receive an instruction from the user to remove the particular business data element from the business communication schema: k) reset the counter when the counter is at least equal to the threshold value; l) begin a second time duration upon resetting of the counter; and m) repeat operations b) through h) for a third electronic document being communicated between business entities during the second time duration.
|
1. A computer program product, embodied in a computer-readable medium, the computer program product being operable to cause data processing apparatus to: a) receive, during a first time duration, a first electronic document being communicated between business entities, the first electronic document comprising instances of a plurality of business data elements, the first electronic document having a format corresponding to a business communication schema, wherein the business communication schema includes a set of predefined business data elements for use in electronically communicating business data from a first business entity to a second business entity; b) identify an instance of a particular business data element in the first electronic document; c) increment a counter associated with the particular business data element in response to identifying the instance of the particular business data element in the first electronic document; d) receive, during the first time duration, a second electronic document being communicated between business entities; e) identify an instance of the particular business data element in the second electronic document; f) increment the counter associated with the particular business data element in response to identifying the instance of the particular business data element in the second electronic document; g) subsequent to elapse of the first time duration, compare the counter with a threshold value; h) based on the counter being less than the threshold value, delete the particular business data element from the business communication schema; i) prior to deleting the particular business data element from the business communication schema, notify a user if the counter is less than the threshold value; j) receive an instruction from the user to remove the particular business data element from the business communication schema: k) reset the counter when the counter is at least equal to the threshold value; l) begin a second time duration upon resetting of the counter; and m) repeat operations b) through h) for a third electronic document being communicated between business entities during the second time duration. 11. The computer program product of claim 1 wherein the counter associated with the particular business data element is incremented only once in response to identifying more than one instance of the particular business data element.
| 0.881994 |
9,477,652 | 6 | 8 |
6. The method of claim 1 , further comprising: generating a language model for the language dialect based on the current training data set.
|
6. The method of claim 1 , further comprising: generating a language model for the language dialect based on the current training data set. 8. The method of claim 6 , further comprising: recognizing, using the language model, a dialect of an audio portion of a content item to convert into text.
| 0.5 |
9,800,898 | 10 | 11 |
10. The computer-readable medium of claim 6 , wherein the different syntax structure includes a next slice segment address that indicates a slice segment address for a next slice segment header when the slice segment address for the next slice segment header is present in the elementary bitstream.
|
10. The computer-readable medium of claim 6 , wherein the different syntax structure includes a next slice segment address that indicates a slice segment address for a next slice segment header when the slice segment address for the next slice segment header is present in the elementary bitstream. 11. The computer-readable medium of claim 10 , wherein: if the next slice segment address is zero, the completion of the coded region is completion of encoded data for a final slice of a picture; and if the next slice segment address is greater than zero, the completion of the coded region is completion of encoded data for a non-final slice of the picture.
| 0.5 |
8,386,912 | 1 | 8 |
1. A computer-implemented method for preparing hypermedia documents for publishing, the method comprising: generating an unpublished hypermedia document at a computer system in a non-web-publishable format; recursively parsing the unpublished hypermedia document to identify at least one direct linked document and at least one nested linked document; remapping addresses for the unpublished hypermedia document, the direct linked document and the nested linked document, wherein cross-references between the unpublished hypermedia document, the direct linked document and the nested linked document are represented with relative remapped addresses; converting at least a version of the unpublished hypermedia document from the non-web-publishable format to a web-publishable format at the computer system; storing a package of documents comprising the version of the unpublished hypermedia document, versions of the direct linked document, and the nested linked document in a directory at their remapped addresses, wherein storing the versions of the documents comprises storing the versions in a hierarchical organization within the directory; and transmitting the package of documents from the computer system to a web server to publish the unpublished hypermedia document to the World Wide Web.
|
1. A computer-implemented method for preparing hypermedia documents for publishing, the method comprising: generating an unpublished hypermedia document at a computer system in a non-web-publishable format; recursively parsing the unpublished hypermedia document to identify at least one direct linked document and at least one nested linked document; remapping addresses for the unpublished hypermedia document, the direct linked document and the nested linked document, wherein cross-references between the unpublished hypermedia document, the direct linked document and the nested linked document are represented with relative remapped addresses; converting at least a version of the unpublished hypermedia document from the non-web-publishable format to a web-publishable format at the computer system; storing a package of documents comprising the version of the unpublished hypermedia document, versions of the direct linked document, and the nested linked document in a directory at their remapped addresses, wherein storing the versions of the documents comprises storing the versions in a hierarchical organization within the directory; and transmitting the package of documents from the computer system to a web server to publish the unpublished hypermedia document to the World Wide Web. 8. The method of claim 1 further comprising determining, for each identified document, whether the version of the document is to be stored in the directory.
| 0.680328 |
10,152,556 | 13 | 17 |
13. A non-transitory machine readable medium having stored thereon instructions for updating an ontology in a database comprising executable code which when executed by one or more processors, causes the one or more processors to: scan one or more databases to determine when at least one of the one or more databases is ready to update; receive an indication for updating at least one of the one or more databases to accommodate data, when the determination indicates that the at least one of the one or more databases is ready to update; parse a first ontology associated with at least one table in the at least one of the one or more databases; create a second ontology that describes the data to is accommodated; map the parsed first ontology on to the created second ontology; analyzing the mapping of the first ontology on to the created second ontology; determine one or more differences between the first and the second ontologies based on the analyzing; recommend one or more changes to the second ontology based on the determined one or more differences between the first and the second ontologies; and update the created second ontology based on the recommended one or more changes to the second ontology.
|
13. A non-transitory machine readable medium having stored thereon instructions for updating an ontology in a database comprising executable code which when executed by one or more processors, causes the one or more processors to: scan one or more databases to determine when at least one of the one or more databases is ready to update; receive an indication for updating at least one of the one or more databases to accommodate data, when the determination indicates that the at least one of the one or more databases is ready to update; parse a first ontology associated with at least one table in the at least one of the one or more databases; create a second ontology that describes the data to is accommodated; map the parsed first ontology on to the created second ontology; analyzing the mapping of the first ontology on to the created second ontology; determine one or more differences between the first and the second ontologies based on the analyzing; recommend one or more changes to the second ontology based on the determined one or more differences between the first and the second ontologies; and update the created second ontology based on the recommended one or more changes to the second ontology. 17. The non-transitory machine readable medium of claim 13 , wherein the executable code when executed by the processors further causes the one or more processors to: receive an input indicating one or more web services are updated to accommodate data; parse a first ontology associated with at least one of the one or more web services; create a second ontology that describes the data based on the first XSD file; map the parsed first ontology on to the created second ontology; determine one or more differences between the first and the second ontologies; update the created second ontology based on the determined differences between the first and the second ontologies; and export the updated ontology to a data modeler that creates and utilizes a second XSD file to modify the one or more web services or create a new web service.
| 0.520619 |
10,104,221 | 12 | 17 |
12. A system comprising: first, second, and third computerized communication devices associated with respective first, second, and third users for text communication therebetween, each computerized communication device adapted to establish language settings according to: establishing first language settings responsive to the first language settings having been established between the first, second, and third users during a previous conversation; establishing first language settings responsive to the first language settings being associated with a language shared between the first, second, and third users under the condition that no other language is shared between the first, second, and third users; and establishing first language settings responsive to the first language settings being associated with a most preferred language of plural of the first, second, and third users under the condition that plural languages are shared between the first, second, and third users.
|
12. A system comprising: first, second, and third computerized communication devices associated with respective first, second, and third users for text communication therebetween, each computerized communication device adapted to establish language settings according to: establishing first language settings responsive to the first language settings having been established between the first, second, and third users during a previous conversation; establishing first language settings responsive to the first language settings being associated with a language shared between the first, second, and third users under the condition that no other language is shared between the first, second, and third users; and establishing first language settings responsive to the first language settings being associated with a most preferred language of plural of the first, second, and third users under the condition that plural languages are shared between the first, second, and third users. 17. The system of claim 12 , wherein the first language settings include a language in which a menu is presented.
| 0.873602 |
8,429,157 | 12 | 15 |
12. The system of claim 10 , further comprising: one or more web graph machines having stored thereon a web graph, the one or more web graph machines coupled with the search engine, wherein the web graph contains a plurality of interlinked web documents each represented by a node (u 1 , u 2 , . . . u n ); and wherein the search engine retrieves values of one or more operators from the one or more web graph machines based on the relative linking within the web graph of the one or more organic search results, the plurality of sponsored search results, and any of the plurality of web documents, each of which corresponds to a node in the web graph.
|
12. The system of claim 10 , further comprising: one or more web graph machines having stored thereon a web graph, the one or more web graph machines coupled with the search engine, wherein the web graph contains a plurality of interlinked web documents each represented by a node (u 1 , u 2 , . . . u n ); and wherein the search engine retrieves values of one or more operators from the one or more web graph machines based on the relative linking within the web graph of the one or more organic search results, the plurality of sponsored search results, and any of the plurality of web documents, each of which corresponds to a node in the web graph. 15. The system of claim 12 , wherein the operator comprises Edge Distance, which is a function, f(u 1 ,u 2 ), that generates an inverse of a shortest path between the web documents u 1 and u 2 .
| 0.866575 |
9,582,278 | 11 | 18 |
11. A computer-implemented method for designing a configurable processor, the method comprising: generating, based on a user-defined specification a description of a hardware implementation of the processor; generating, based on the user-defined specification, software development tools specific to the hardware implementation; and generating documentation of an instruction set of the processor having the generated hardware implementation description and software development tools, based on the user-defined specification.
|
11. A computer-implemented method for designing a configurable processor, the method comprising: generating, based on a user-defined specification a description of a hardware implementation of the processor; generating, based on the user-defined specification, software development tools specific to the hardware implementation; and generating documentation of an instruction set of the processor having the generated hardware implementation description and software development tools, based on the user-defined specification. 18. The method of claim 11 , wherein the user-defined specification includes a description of an instruction which requires a plurality of processor cycles to be processed.
| 0.802752 |
9,324,330 | 1 | 19 |
1. A computational method for transforming an input audio encoding of speech into an output that is rhythmically consistent with a target song, the method comprising: segmenting the input audio encoding of the speech into plural segments, the segments corresponding to successive sequences of samples of the audio encoding and delimited by onsets identified therein; mapping individual ones of the plural segments to respective sub-phrase portions of a phrase template for the target song, the mapping establishing one or more phrase candidates; temporally aligning at least one of the phrase candidates with a rhythmic skeleton for the target song; and preparing a resultant audio encoding of the speech in correspondence with the temporally aligned phrase candidate-mapped from onset-delimited segments of the input audio encoding.
|
1. A computational method for transforming an input audio encoding of speech into an output that is rhythmically consistent with a target song, the method comprising: segmenting the input audio encoding of the speech into plural segments, the segments corresponding to successive sequences of samples of the audio encoding and delimited by onsets identified therein; mapping individual ones of the plural segments to respective sub-phrase portions of a phrase template for the target song, the mapping establishing one or more phrase candidates; temporally aligning at least one of the phrase candidates with a rhythmic skeleton for the target song; and preparing a resultant audio encoding of the speech in correspondence with the temporally aligned phrase candidate-mapped from onset-delimited segments of the input audio encoding. 19. The computational method of claim 1 , further comprising: mapping onsets of notes for the target song to temporally-proximate, segment delimiting onsets in the speech encoding; and for respective portions of the speech encoding that correspond to the mapped note onsets, temporally stretching or compressing the respective portion to fill duration of the mapped note.
| 0.611925 |
8,233,726 | 1 | 10 |
1. A computer-implemented method of identifying a writing system associated with a document image containing one or more words written in the writing system, the method comprising: identifying a document image fragment based on the document image, wherein the document image fragment contains one or more pixels from one or more of the words in the document image; generating a set of sequential features associated with the document image fragment, wherein each sequential feature describes one dimensional graphic information derived from the one or more pixels in the document image fragment; identifying a plurality of n-grams based on the set of sequential features, wherein each n-gram comprises an ordered subset of sequential features; generating a classification score for the document image fragment based at least in part on a frequency of occurrence of the n-grams in sets of sequential features associated with known writing systems, the classification score indicating a likelihood that the document image fragment is written in the writing system; and identifying the writing system associated with the document image based at least in part on the classification score for the document image fragment.
|
1. A computer-implemented method of identifying a writing system associated with a document image containing one or more words written in the writing system, the method comprising: identifying a document image fragment based on the document image, wherein the document image fragment contains one or more pixels from one or more of the words in the document image; generating a set of sequential features associated with the document image fragment, wherein each sequential feature describes one dimensional graphic information derived from the one or more pixels in the document image fragment; identifying a plurality of n-grams based on the set of sequential features, wherein each n-gram comprises an ordered subset of sequential features; generating a classification score for the document image fragment based at least in part on a frequency of occurrence of the n-grams in sets of sequential features associated with known writing systems, the classification score indicating a likelihood that the document image fragment is written in the writing system; and identifying the writing system associated with the document image based at least in part on the classification score for the document image fragment. 10. The method of claim 1 , further comprising: generating a plurality of conditional probability values associated with the plurality of n-grams, wherein each conditional probability value is based at least in part on a frequency of occurrence of an n-gram in the plurality of sets of sequential features associated with known writing systems; and generating the classification score based on the plurality of conditional probability values.
| 0.734055 |
8,515,934 | 11 | 14 |
11. A machine-readable storage device comprising a computer program product, the computer program product including instructions which, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising: receiving a search query in a first language; receiving a plurality of search results responsive to the search query, wherein the search results comprise one or more first search results and a plurality of second search results, wherein each first result identifies a respective document in the first language and a corresponding respective document in a different second language, and wherein the second search results each identify a respective document in the first language; ordering the search results based on, at least, a respective number of documents identified by each of the search results; and providing the ordered search results in response to the search query.
|
11. A machine-readable storage device comprising a computer program product, the computer program product including instructions which, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising: receiving a search query in a first language; receiving a plurality of search results responsive to the search query, wherein the search results comprise one or more first search results and a plurality of second search results, wherein each first result identifies a respective document in the first language and a corresponding respective document in a different second language, and wherein the second search results each identify a respective document in the first language; ordering the search results based on, at least, a respective number of documents identified by each of the search results; and providing the ordered search results in response to the search query. 14. The storage device of claim 11 , wherein the operations further comprise: translating the search query to the second language; and identifying a particular document in the second language by searching using the translated query.
| 0.548638 |
5,585,793 | 1 | 6 |
1. In a computer system, a method for processing data stored as input strings, the input strings including a plurality of sub-strings, each sub-string associated with a value, the values of the sub-strings distributed over an interval, the interval of the values including a plurality of ranges of the values, comprising arranging the sub-strings into disjoint sets, each set including the sub-strings having values selected from a predetermined range of the interval of the values, a prefix of the sub-strings of each set being identical; and for each input string repeatedly truncating the input string, by deleting the prefix of a leading sub-string of the input string to produce a token in an output string, until the input strings have been parsed into the tokens of the output strings.
|
1. In a computer system, a method for processing data stored as input strings, the input strings including a plurality of sub-strings, each sub-string associated with a value, the values of the sub-strings distributed over an interval, the interval of the values including a plurality of ranges of the values, comprising arranging the sub-strings into disjoint sets, each set including the sub-strings having values selected from a predetermined range of the interval of the values, a prefix of the sub-strings of each set being identical; and for each input string repeatedly truncating the input string, by deleting the prefix of a leading sub-string of the input string to produce a token in an output string, until the input strings have been parsed into the tokens of the output strings. 6. The method of claim 1 wherein the output strings include a plurality of encoded sub-strings, each encoded sub-string associated with an encoded value, the encoded values distributed over an other interval, the other interval of the encoded values including a plurality of other ranges of the encoded values, and further comprising arranging the encoded sub-strings into disjoint encoded sets, each encoded set including an other predetermined range of the encoded sub-strings, an encoded prefix of the encoded sub-strings of each encoded set being identical; and for each output string, repeatedly truncating the output string, by deleting the encoded prefix of a leading encoded sub-string of the output string to produce an encoded token in an input string, until the output strings have been parsed into the encoded tokens of the input strings.
| 0.5 |
7,693,829 | 20 | 24 |
20. A computer-program product, comprising: a computer readable storage medium and a computer program mechanism embedded therein, the computer program mechanism comprising: instructions for receiving a fill-the-blank query comprising one or more term segments and one or more missing term identifiers signifying missing information sought by a user; instructions for converting the fill-the-blank query into a corresponding search pattern, wherein the search pattern includes: one or more missing content identifiers corresponding to the one or more missing term identifiers, and a set of one or more query expressions corresponding to each term segment; instructions for identifying a set of documents matching the search pattern; instructions for identifying content in the set of documents corresponding to the search pattern, the identified content including one or more potential answers corresponding to the one or more missing term identifiers; and instructions for responding to the query by providing at least one of the one or more potential answers.
|
20. A computer-program product, comprising: a computer readable storage medium and a computer program mechanism embedded therein, the computer program mechanism comprising: instructions for receiving a fill-the-blank query comprising one or more term segments and one or more missing term identifiers signifying missing information sought by a user; instructions for converting the fill-the-blank query into a corresponding search pattern, wherein the search pattern includes: one or more missing content identifiers corresponding to the one or more missing term identifiers, and a set of one or more query expressions corresponding to each term segment; instructions for identifying a set of documents matching the search pattern; instructions for identifying content in the set of documents corresponding to the search pattern, the identified content including one or more potential answers corresponding to the one or more missing term identifiers; and instructions for responding to the query by providing at least one of the one or more potential answers. 24. The computer program product of claim 20 , further comprising instructions for providing for display snippets of text containing the one or more potential answers wherein the one or more potential answers are highlighted.
| 0.741379 |
4,689,682 | 1 | 3 |
1. A method of deriving an output video signal from an input video signal that is representative of an input scene, comprising writing the input video signal into a frame buffer, generating a sequence of address words, comparing each address word with a reference word that defines a predetermined location of the input scene, modifying at least those address words that define locations of the input scene having a selected spatial relationship with said predetermined location by combining each of them with an offset word, whereby a modified sequence of address words is generated, and using the modified sequence of address words to read the video signal from the frame buffer.
|
1. A method of deriving an output video signal from an input video signal that is representative of an input scene, comprising writing the input video signal into a frame buffer, generating a sequence of address words, comparing each address word with a reference word that defines a predetermined location of the input scene, modifying at least those address words that define locations of the input scene having a selected spatial relationship with said predetermined location by combining each of them with an offset word, whereby a modified sequence of address words is generated, and using the modified sequence of address words to read the video signal from the frame buffer. 3. A method according to claim 1, wherein the address words that define locations of the input scene having said selected spatial relationship with said predetermined location are modified by subtracting each of them from the offset word.
| 0.672176 |
6,023,677 | 8 | 12 |
8. A method for recognizing a spoken sentence composed of words selected from a predetermined vocabulary from which a plurality of permissible sentences can be formed, comprising: (a) selecting a subset of the predetermined vocabulary; (b) recognizing a word in the subset selected in step (a) as the first word of the spoken sentence; (c) selecting another subset of the predetermined vocabulary, based at least in part on the previously recognized word; (d) recognizing a word in the subset selected in step (c) as the next word of the spoken sentence; and (e) repeating steps (c) and (d) until the last word of the spoken sentence is recognized, wherein a given word in the predetermined vocabulary appears in a first syntactical position in at least one of the permissible sentences and also appears in a second syntactical position in at least one of the permissible sentences, and wherein step (c) is conducted so that if the given word appears in its first syntactical position in the spoken sentence, the subset selected following recognition of the given word is a first subset, and if the given word appears in its second syntactical position in the spoken sentence, the subset selected following recognition of the given word is a second subset that differs from the first subset.
|
8. A method for recognizing a spoken sentence composed of words selected from a predetermined vocabulary from which a plurality of permissible sentences can be formed, comprising: (a) selecting a subset of the predetermined vocabulary; (b) recognizing a word in the subset selected in step (a) as the first word of the spoken sentence; (c) selecting another subset of the predetermined vocabulary, based at least in part on the previously recognized word; (d) recognizing a word in the subset selected in step (c) as the next word of the spoken sentence; and (e) repeating steps (c) and (d) until the last word of the spoken sentence is recognized, wherein a given word in the predetermined vocabulary appears in a first syntactical position in at least one of the permissible sentences and also appears in a second syntactical position in at least one of the permissible sentences, and wherein step (c) is conducted so that if the given word appears in its first syntactical position in the spoken sentence, the subset selected following recognition of the given word is a first subset, and if the given word appears in its second syntactical position in the spoken sentence, the subset selected following recognition of the given word is a second subset that differs from the first subset. 12. The method of claim 8, wherein steps (b) and (d) are conducted using an HMM recognition process.
| 0.904215 |
8,428,241 | 11 | 16 |
11. An apparatus, comprising: a storage for storing a destination map comprising a plurality of destination information; an interface for receiving a speech signal from a caller; a recognizer module for producing a speech recognition string based on the received speech signal; and at least one processor programmed to determine if there is destination information that matches the speech recognition string; wherein if there is destination information that matches the speech recognition string, the processor is programmed to any of output the destination information to the caller, or connect the caller to a destination that corresponds to the matching destination information; and wherein if there is no destination information that matches the speech recognition string, the processor is programmed to direct the caller to an operator to initiate an interaction, provide the operator with any of the received speech signal or a request by the caller for the destination during the interaction, record destination identifying information input from the operator in response to the request by the caller, and proceed to any of output the recorded destination identifying information to the caller, or connect the caller to the matched destination using the recorded destination identifying information.
|
11. An apparatus, comprising: a storage for storing a destination map comprising a plurality of destination information; an interface for receiving a speech signal from a caller; a recognizer module for producing a speech recognition string based on the received speech signal; and at least one processor programmed to determine if there is destination information that matches the speech recognition string; wherein if there is destination information that matches the speech recognition string, the processor is programmed to any of output the destination information to the caller, or connect the caller to a destination that corresponds to the matching destination information; and wherein if there is no destination information that matches the speech recognition string, the processor is programmed to direct the caller to an operator to initiate an interaction, provide the operator with any of the received speech signal or a request by the caller for the destination during the interaction, record destination identifying information input from the operator in response to the request by the caller, and proceed to any of output the recorded destination identifying information to the caller, or connect the caller to the matched destination using the recorded destination identifying information. 16. The apparatus of claim 11 , wherein the destination comprises any of a telephone number, an address, a name, a part of an organization, a topic, a category, an entity, or information.
| 0.803983 |
9,020,864 | 4 | 5 |
4. The method of claim 1 , wherein providing the recommendation to the user comprises: receiving an input context associated with the user; selecting the recommendation from a corpus of recommendations based on the plurality of personality metrics and the input context; and providing the recommendation for presentation to the user.
|
4. The method of claim 1 , wherein providing the recommendation to the user comprises: receiving an input context associated with the user; selecting the recommendation from a corpus of recommendations based on the plurality of personality metrics and the input context; and providing the recommendation for presentation to the user. 5. The method of claim 4 , wherein selecting the recommendation comprises: calculating a weight for each of a plurality of recommendations from the corpus, each weight based on a degree of correspondence between the plurality of personality metrics and a corresponding recommendation; and selecting the recommendation from the plurality of recommendations responsive to the weight corresponding to the recommendation.
| 0.5 |
9,484,035 | 10 | 11 |
10. A method for distributed speech recognition, comprising: transmitting a prompt to a caller during a call; receiving one or more audio responses from the caller in response to the prompt; performing distributed speech recognition on the audio responses, comprising: providing a non-overlapping section of a main grammar to each of a plurality of secondary recognizers for each audio response; performing speech recognition on the audio responses by each of the secondary recognizers using the non-overlapping section of the main grammar associated with that secondary recognizer; providing a main grammar template to a main recognizer; constructing a new grammar based on the main grammar template using speech recognition search results from each of the secondary recognizers; and performing further speech recognition on the audio responses against the new grammar; and selecting a further prompt for providing to the caller based on results of the distributed speech recognition.
|
10. A method for distributed speech recognition, comprising: transmitting a prompt to a caller during a call; receiving one or more audio responses from the caller in response to the prompt; performing distributed speech recognition on the audio responses, comprising: providing a non-overlapping section of a main grammar to each of a plurality of secondary recognizers for each audio response; performing speech recognition on the audio responses by each of the secondary recognizers using the non-overlapping section of the main grammar associated with that secondary recognizer; providing a main grammar template to a main recognizer; constructing a new grammar based on the main grammar template using speech recognition search results from each of the secondary recognizers; and performing further speech recognition on the audio responses against the new grammar; and selecting a further prompt for providing to the caller based on results of the distributed speech recognition. 11. A method according to claim 10 , further comprising: displaying the results of the distributed speech recognition to an agent participating in the call.
| 0.736486 |
8,843,466 | 1 | 8 |
1. A method performed by a system comprising one or more computers, the method comprising: determining that a first search query includes a respective text reference to each of one or more predetermined attributes, wherein each attribute is associated with a first entity type, wherein determining that the first search query includes the respective text reference to each of the one or more predetermined attributes comprises determining that at least one term in the first search query appears in an attribute data store, and wherein the attribute data store contains terms from previously submitted queries determined to relate to entities of the first entity type by a query classifier; obtaining search results for the first search query from a search engine, each search result identifying a respective resource; for each of a plurality of the obtained search results, determining an initial score for each of a plurality of entities of the first entity type based on occurrences of names of the entity in the resource identified by the search result; generating a final score for each of the plurality of entities based on the initial scores; and selecting one or more names of entities of the first entity type to include in a response to the first search query based on the final scores.
|
1. A method performed by a system comprising one or more computers, the method comprising: determining that a first search query includes a respective text reference to each of one or more predetermined attributes, wherein each attribute is associated with a first entity type, wherein determining that the first search query includes the respective text reference to each of the one or more predetermined attributes comprises determining that at least one term in the first search query appears in an attribute data store, and wherein the attribute data store contains terms from previously submitted queries determined to relate to entities of the first entity type by a query classifier; obtaining search results for the first search query from a search engine, each search result identifying a respective resource; for each of a plurality of the obtained search results, determining an initial score for each of a plurality of entities of the first entity type based on occurrences of names of the entity in the resource identified by the search result; generating a final score for each of the plurality of entities based on the initial scores; and selecting one or more names of entities of the first entity type to include in a response to the first search query based on the final scores. 8. The method of claim 1 , further comprising: normalizing the final scores for each of the plurality of entities based on a respective inverse document frequency of a name of each of the entities.
| 0.70944 |
8,560,301 | 7 | 9 |
7. The apparatus of claim 1 , further comprising: an information collecting unit configured to collect the sensing information from the user's environment through at least one of a hardware sensor and a software sensor.
|
7. The apparatus of claim 1 , further comprising: an information collecting unit configured to collect the sensing information from the user's environment through at least one of a hardware sensor and a software sensor. 9. The apparatus of claim 7 , wherein the software sensor collects sensing data from at least one of an electronic calendar application, a scheduler application, an e-mail management application, a message management application, a communication application, a social network application, and a web site management application.
| 0.611639 |
8,244,599 | 1 | 2 |
1. A system comprising: at least one processor for executing: a receiving module to receive, over a network at a social shopping platform, a request from a user in a first community of users, the social shopping platform includes a plurality of network-based marketplaces respectively associated with a plurality of communities, plurality of communities includes the first community of users that is associated with a first network-based marketplace; a processing application to identify the first network-based marketplace from the plurality of network-based marketplaces based on the request, the request for an activity associated with a listing that describes an item for sale in the first network-based marketplace that is used by the first community of users to transact listings of items of a single domain that is of interest to the first community of users; and a reputation module to update a listing reputation score for the listing based on a user reputation score for the user and based upon the activity associated with the listing, the reputation module further to update the user reputation score based on the listing reputation score.
|
1. A system comprising: at least one processor for executing: a receiving module to receive, over a network at a social shopping platform, a request from a user in a first community of users, the social shopping platform includes a plurality of network-based marketplaces respectively associated with a plurality of communities, plurality of communities includes the first community of users that is associated with a first network-based marketplace; a processing application to identify the first network-based marketplace from the plurality of network-based marketplaces based on the request, the request for an activity associated with a listing that describes an item for sale in the first network-based marketplace that is used by the first community of users to transact listings of items of a single domain that is of interest to the first community of users; and a reputation module to update a listing reputation score for the listing based on a user reputation score for the user and based upon the activity associated with the listing, the reputation module further to update the user reputation score based on the listing reputation score. 2. The system of claim 1 , wherein the listing reputation score is displayed on a user interface.
| 0.861823 |
8,526,739 | 40 | 41 |
40. The method as recited in claim 30 , wherein the complementary textual information corresponds to one or more fields of a complementary document.
|
40. The method as recited in claim 30 , wherein the complementary textual information corresponds to one or more fields of a complementary document. 41. The method as recited in claim 40 , wherein the complementary document is an electronic document in the second database.
| 0.5 |
9,606,984 | 1 | 6 |
1. A natural language understanding system using at least one hardware implemented computer processor for automatic unsupervised clustering of dialog data from a natural language dialog application, the arrangement comprising: a log parser configured to extract structured dialog data from application logs, the structured dialog data including a transcription of a dialog between a user and the natural language dialog application, the transcription being generated by the natural language dialog application; a dialog generalizing module configured to automatically generalize the extracted dialog data using different independent generalization methods to produce generalization identifier vectors aggregating the results of the generalization methods used, the generalization identifier vectors indicating descriptive categories of the different independent generalization methods that correspond to statements by the user and statements by the natural language dialog application included in the extracted dialog data; and a data clustering module configured to automatically cluster the dialog data based on the generalization identifier vectors using an unsupervised density-based clustering algorithm without a predefined number of clusters and without a predefined distance threshold.
|
1. A natural language understanding system using at least one hardware implemented computer processor for automatic unsupervised clustering of dialog data from a natural language dialog application, the arrangement comprising: a log parser configured to extract structured dialog data from application logs, the structured dialog data including a transcription of a dialog between a user and the natural language dialog application, the transcription being generated by the natural language dialog application; a dialog generalizing module configured to automatically generalize the extracted dialog data using different independent generalization methods to produce generalization identifier vectors aggregating the results of the generalization methods used, the generalization identifier vectors indicating descriptive categories of the different independent generalization methods that correspond to statements by the user and statements by the natural language dialog application included in the extracted dialog data; and a data clustering module configured to automatically cluster the dialog data based on the generalization identifier vectors using an unsupervised density-based clustering algorithm without a predefined number of clusters and without a predefined distance threshold. 6. The system according to claim 1 , wherein the clustering algorithm is an iterative clustering algorithm.
| 0.742788 |
8,868,586 | 2 | 3 |
2. The method of claim 1 , further comprising identifying the selected identified individuals, relevant to the user context, from an information context identifying destinations in the system that are accessible by the individual.
|
2. The method of claim 1 , further comprising identifying the selected identified individuals, relevant to the user context, from an information context identifying destinations in the system that are accessible by the individual. 3. The method of claim 2 , wherein the selected identified individuals specified in the ordered list of destination targets provide, for a given identified individual, a link to any one of: user profile information of the given identified individual, initiation of an IP Phone call to the given identified individual, meeting availability for the given identified individual, sending a message to the given identified individual, accessing stored messages related to the given identified individual, or accessing stored documents related to the given identified individual.
| 0.5 |
7,818,282 | 1 | 5 |
1. A method for preparing multilingual reports at client sites, the client sites connected to a server and a data source of a database, the method comprising: receiving selection of a product locale from a plurality of locales at a client site, wherein the product locale defines a user interface appearance for a user interface, and wherein each of the client sites uses at least one of the plurality of locales; generating a report specification based on input received from the user interface, wherein the report specification is used to extract data from the data source of the database, and wherein the report specification provides a structure for a report produced from the report specification; receiving selection of a content locale from the plurality of locales at the client site; constructing a metadata model having run-time parameters, wherein the run-time parameters include a session parameter that is based on the content locale, and wherein the metadata model includes model objects representing the data source of the database; building a query using the report specification and the metadata model, wherein the query includes at least one data access statement having one or more expressions that determine one or more tables to use for substitution into the one or more expressions, wherein each of the one or more tables maps session parameters to values, and wherein at least one of the one or more tables comprises a parameter map defining an entire expression; substituting one or more values into the one or more expressions based on the session parameter and the one or more tables to generate a resultant query, wherein the session parameter determines an appropriate entry in each of the one or more tables; extracting content locale-specific data from the data source of the database using the resultant query; and preparing a report using the extracted content locale-specific data, wherein the content locale defines an appearance and a format for content within the report.
|
1. A method for preparing multilingual reports at client sites, the client sites connected to a server and a data source of a database, the method comprising: receiving selection of a product locale from a plurality of locales at a client site, wherein the product locale defines a user interface appearance for a user interface, and wherein each of the client sites uses at least one of the plurality of locales; generating a report specification based on input received from the user interface, wherein the report specification is used to extract data from the data source of the database, and wherein the report specification provides a structure for a report produced from the report specification; receiving selection of a content locale from the plurality of locales at the client site; constructing a metadata model having run-time parameters, wherein the run-time parameters include a session parameter that is based on the content locale, and wherein the metadata model includes model objects representing the data source of the database; building a query using the report specification and the metadata model, wherein the query includes at least one data access statement having one or more expressions that determine one or more tables to use for substitution into the one or more expressions, wherein each of the one or more tables maps session parameters to values, and wherein at least one of the one or more tables comprises a parameter map defining an entire expression; substituting one or more values into the one or more expressions based on the session parameter and the one or more tables to generate a resultant query, wherein the session parameter determines an appropriate entry in each of the one or more tables; extracting content locale-specific data from the data source of the database using the resultant query; and preparing a report using the extracted content locale-specific data, wherein the content locale defines an appearance and a format for content within the report. 5. The method of claim 1 , wherein the run-time parameters are updated by a lookup on a key-value table with separate query items on separate columns.
| 0.587912 |
10,083,690 | 25 | 26 |
25. A non-transitory computer-readable storage medium comprising computer-executable instructions for: receiving user speech input; generating a textual representation of the user speech input; parsing the textual representation to determine a primary domain representing a user intent for the textual representation; identifying a first substring from the textual representation that corresponds to a first attribute of the primary domain; parsing the identified first substring to determine a secondary domain representing a user intent for the first sub string; performing a task flow comprising one or more tasks based on the primary domain and the secondary domain; and outputting a response in accordance with the performed task flow.
|
25. A non-transitory computer-readable storage medium comprising computer-executable instructions for: receiving user speech input; generating a textual representation of the user speech input; parsing the textual representation to determine a primary domain representing a user intent for the textual representation; identifying a first substring from the textual representation that corresponds to a first attribute of the primary domain; parsing the identified first substring to determine a secondary domain representing a user intent for the first sub string; performing a task flow comprising one or more tasks based on the primary domain and the secondary domain; and outputting a response in accordance with the performed task flow. 26. The non-transitory computer-readable storage medium of claim 25 , wherein parsing the textual representation comprises: determining a confidence score for a plurality of interpretations of the textual representation; and determining the primary domain representing the user intent for the textual representation based on an interpretation of the plurality of interpretations of the textual representation having the highest confidence score.
| 0.60689 |
7,519,567 | 14 | 24 |
14. A machine-implemented classification method, comprising: classifying input data instances in a series of successive forward classification stages, wherein each of the forward classification stages determines a respective likelihood score for each of the input data instances based on one or more attributes of the input data instance and classifies each of the input data instances by one of rejecting the input data instance, unconditionally accepting the input data instance, and conditionally accepting the input data instance based on the respective likelihood score; generating for each of the input data instances rejected in at least one of the forward classification stages a respective classification record indicative of classification into the rejected class; generating for each of the input data instances unconditionally accepted in all of the forward classification stages a respective classification record indicative of classification into an accepted class; designating as conditionally accepted each of the input data instances that is conditionally accepted in at least one of the forward classification stages and is unconditionally accepted by all other ones of the forward classification stages; and producing for each of the input data instances designated as conditionally accepted a respective classification record indicative of classification into one of the rejected class and the accepted class based on the respective likelihood score determined by each of the forward classification stages for the input data instance.
|
14. A machine-implemented classification method, comprising: classifying input data instances in a series of successive forward classification stages, wherein each of the forward classification stages determines a respective likelihood score for each of the input data instances based on one or more attributes of the input data instance and classifies each of the input data instances by one of rejecting the input data instance, unconditionally accepting the input data instance, and conditionally accepting the input data instance based on the respective likelihood score; generating for each of the input data instances rejected in at least one of the forward classification stages a respective classification record indicative of classification into the rejected class; generating for each of the input data instances unconditionally accepted in all of the forward classification stages a respective classification record indicative of classification into an accepted class; designating as conditionally accepted each of the input data instances that is conditionally accepted in at least one of the forward classification stages and is unconditionally accepted by all other ones of the forward classification stages; and producing for each of the input data instances designated as conditionally accepted a respective classification record indicative of classification into one of the rejected class and the accepted class based on the respective likelihood score determined by each of the forward classification stages for the input data instance. 24. The method of claim 14 , wherein each of the input data instances comprises image data.
| 0.873961 |
8,539,359 | 58 | 110 |
58. A machine system that is structured to automatically present as first presentations to a first user thereof, immediately-acceptable invitations to join in on telecommunications-mediated information exchange forums and/or immediately actionable-upon and user-acceptable suggestions of additional telecommunications-conveyed informational content to investigate, the machine system comprising: a focus information report transmitter structured for automatically repeatedly transmitting to a network, reporting signals respectively reporting respectively recent ones of at least one of: an automatically-wise machine-system-determined identity of a focused upon sub-portion of presented content that was recently attentively focused upon by the first user, an automatically-wise machine-system-determined degree of attentive focus upon a focused upon sub-portion of presented content which sub-portion has been or will be identified, an automatically-wise machine-system-determined degree of emotional engagement with the attentively focused upon sub-portion of content that has been or will be identified, and an automatically-wise machine-system-determined emotional reaction by the user and/or degree of emotional reaction by the user to the attentively focused upon sub-portion of content that has been or will be identified; wherein the automatically-wise machine-system-determined identities or degrees of attentive focus are repeatedly determined transparently by the machine system without need for diverted focusing of attention by the user directed to aiding the repeated determinations, wherein at least a portion of the machine system includes a data processing machine, and wherein said automatically determined and repeatedly reported recent attentive focusings by the first user occurred no more than at least one of: 3 hours prior to said presentation of the first presentations to the first user; and a determined time duration prior to said presentation of the first presentations to the first user, the determined time duration being determined based on a currently active profile characterizing the first user.
|
58. A machine system that is structured to automatically present as first presentations to a first user thereof, immediately-acceptable invitations to join in on telecommunications-mediated information exchange forums and/or immediately actionable-upon and user-acceptable suggestions of additional telecommunications-conveyed informational content to investigate, the machine system comprising: a focus information report transmitter structured for automatically repeatedly transmitting to a network, reporting signals respectively reporting respectively recent ones of at least one of: an automatically-wise machine-system-determined identity of a focused upon sub-portion of presented content that was recently attentively focused upon by the first user, an automatically-wise machine-system-determined degree of attentive focus upon a focused upon sub-portion of presented content which sub-portion has been or will be identified, an automatically-wise machine-system-determined degree of emotional engagement with the attentively focused upon sub-portion of content that has been or will be identified, and an automatically-wise machine-system-determined emotional reaction by the user and/or degree of emotional reaction by the user to the attentively focused upon sub-portion of content that has been or will be identified; wherein the automatically-wise machine-system-determined identities or degrees of attentive focus are repeatedly determined transparently by the machine system without need for diverted focusing of attention by the user directed to aiding the repeated determinations, wherein at least a portion of the machine system includes a data processing machine, and wherein said automatically determined and repeatedly reported recent attentive focusings by the first user occurred no more than at least one of: 3 hours prior to said presentation of the first presentations to the first user; and a determined time duration prior to said presentation of the first presentations to the first user, the determined time duration being determined based on a currently active profile characterizing the first user. 110. The machine system of claim 58 and further comprising: an emotional state detector comprising at least one of a body language detector configured to detect a body language state of the first user; and a biometric state detector configured to detect a biometric state of the first user; wherein the emotional state detector is configured to automatically repeatedly determine a recent at least one of the body language state and the biometric state of the first user transparently without need for diverted centering of attention by the user directed to aiding the automatically repeated determining of the recent at least one of the body language state and the biometric state of the first user; and wherein the immediately actionable on invitations and/or suggestions to respectively connect with system-identified and telecommunications-mediated forums and/or information providing sources are based on the automatically repeated determinations by the body language detector of recent ones of body language states or the biometric states of the first user.
| 0.522032 |
8,726,176 | 6 | 9 |
6. An article of manufacture comprising a non-transitory computer readable storage medium having content stored thereon to provide instructions, which when executed cause a machine to perform operations including: identifying actionable context data of a business scenario hosted by a server, the actionable context data to be performed on a client device having particular user interface capabilities, the client device capable of operation while disconnected from the server, the business scenario providing an end business purpose for a work action; identifying a disconnect condition indicating a likelihood that the client device will be disconnected; automatically identifying a resource and a service associated with the actionable context data based on identifying the business scenario; automatically accessing the resource and the service from the server while connected to the server in response to detecting the disconnect condition; and locally storing the accessed resource and service at the client device to enable performing the work action on the actionable context data while the client device is disconnected from the server.
|
6. An article of manufacture comprising a non-transitory computer readable storage medium having content stored thereon to provide instructions, which when executed cause a machine to perform operations including: identifying actionable context data of a business scenario hosted by a server, the actionable context data to be performed on a client device having particular user interface capabilities, the client device capable of operation while disconnected from the server, the business scenario providing an end business purpose for a work action; identifying a disconnect condition indicating a likelihood that the client device will be disconnected; automatically identifying a resource and a service associated with the actionable context data based on identifying the business scenario; automatically accessing the resource and the service from the server while connected to the server in response to detecting the disconnect condition; and locally storing the accessed resource and service at the client device to enable performing the work action on the actionable context data while the client device is disconnected from the server. 9. The article of manufacture of claim 6 , wherein the content to provide instructions for identifying the disconnect condition further comprises content to provide instructions for detecting a user request to disconnect the client device.
| 0.844198 |
8,954,404 | 1 | 6 |
1. A method, comprising: storing, in a data processing system, a plurality of rules, wherein, when applied to a text string, each respective rule of the plurality of rules identifies: a condition of whether the text string contains a predetermined pattern, a predetermined part of speech, one or more predetermined words, or a predetermined word combination, and a set of metadata to be attached to the text string in response to determining that the text string has the condition, wherein metadata of the plurality of rules identifies: one or more tags for text strings having respective conditions of the plurality of rules, indication of intent of text strings having respective conditions of the plurality of rules, one or more query types of text string having respective conditions of the plurality of rules, and indication of suitability of text strings having respective conditions of the plurality of rules for use as a title; receiving, in the data processing system, a plurality of search queries as a plurality text strings; applying, by the data processing system, the plurality of rules to the plurality text strings of the plurality of search queries, wherein when the respective rule is applied to each respective text string of a respective search query of the plurality of search queries, in response to a determination that the respective text string representing the respective search query having the condition, associating, by the data processing system, the set of metadata with the respective search query; selecting, by the data processing system, a text string as a potential title, based on processing the plurality of search queries in accordance with metadata that is associated with the plurality of search queries via the applying the plurality of rules, wherein the processing of the plurality of search queries includes sorting the plurality of text strings of the plurality of search queries based on a combination of two or more of metadata; providing, by the data processing system, the potential title to arrange creating of content consistent with the potential title and predefined guidelines; and publishing, by the data processing system in an electronic publication under a final title, the content created based on the potential title.
|
1. A method, comprising: storing, in a data processing system, a plurality of rules, wherein, when applied to a text string, each respective rule of the plurality of rules identifies: a condition of whether the text string contains a predetermined pattern, a predetermined part of speech, one or more predetermined words, or a predetermined word combination, and a set of metadata to be attached to the text string in response to determining that the text string has the condition, wherein metadata of the plurality of rules identifies: one or more tags for text strings having respective conditions of the plurality of rules, indication of intent of text strings having respective conditions of the plurality of rules, one or more query types of text string having respective conditions of the plurality of rules, and indication of suitability of text strings having respective conditions of the plurality of rules for use as a title; receiving, in the data processing system, a plurality of search queries as a plurality text strings; applying, by the data processing system, the plurality of rules to the plurality text strings of the plurality of search queries, wherein when the respective rule is applied to each respective text string of a respective search query of the plurality of search queries, in response to a determination that the respective text string representing the respective search query having the condition, associating, by the data processing system, the set of metadata with the respective search query; selecting, by the data processing system, a text string as a potential title, based on processing the plurality of search queries in accordance with metadata that is associated with the plurality of search queries via the applying the plurality of rules, wherein the processing of the plurality of search queries includes sorting the plurality of text strings of the plurality of search queries based on a combination of two or more of metadata; providing, by the data processing system, the potential title to arrange creating of content consistent with the potential title and predefined guidelines; and publishing, by the data processing system in an electronic publication under a final title, the content created based on the potential title. 6. The method of claim 1 , wherein the plurality of rules comprises a first rule, and further comprising: where a condition specified in the first rule exists in a first text string of the plurality of text strings, extracting one or more words from the first text string; and associating the one or more extracted words to the first text string as one or more attributes for selecting the potential title.
| 0.5 |
9,182,831 | 2 | 4 |
2. The system according to claim 1 , characterized in that, said processor is further configured to: calculate a rough matching degree between words stored in said memory device according to the ideal sliding trajectory features and said user-sliding trajectory features set.
|
2. The system according to claim 1 , characterized in that, said processor is further configured to: calculate a rough matching degree between words stored in said memory device according to the ideal sliding trajectory features and said user-sliding trajectory features set. 4. The system according to claim 2 , characterized in that, said processor is further configured to apply an incremental calculation method or a prefix matching method to calculate the rough match degree.
| 0.818505 |
9,244,952 | 1 | 2 |
1. A method comprising: automatically generating, through a processor communicatively coupled to a memory, an editable and searchable markup page based on an initial query of a database; associating, through the processor, the generated editable and searchable markup page with a user of the database; automatically extracting, through the processor, metadata of at least one data object of the database utilized by another query of the database from a corresponding at least one data source, the another query capable of being both the initial query and a query similar to the initial query, the another query being at least one of: from another user of the database and a previous query from the user of the database, and the at least one data object comprising at least one of: an attribute, a table, a schema, a predicate, an expression and an attribute value; associating, through the processor, the automatically extracted metadata of the at least one data object with the initial query; appending, through the processor, information to the editable and searchable markup page based on the association of the automatically extracted metadata of the at least one data object with the initial query; enhancing, through the processor, the information appended to the editable and searchable markup page based on extracting an action related to the at least one data object by at least one knowledgeable user of the database; generating, through the processor, a social data catalog that populates the editable and searchable markup page; populating, through the processor, the social data catalog with metadata, a logical definition and description of attributes, information about usage, page views between users, a social data network, and a statistical data profile; extracting, through the processor, information from external data sources and social media profiles to generate the social data catalog of information; and enabling, through the processor, crowdsourcing of information from a ranked list of knowledgeable users to generate a ranked order of priority of information presented in profile pages of a curated answers system, wherein the information about usage includes related tables and join predicates as well as relevant filters associated with each table of at least one of the database and a sample database, wherein the social data network includes a list of users who are knowledgeable about a particular object related to the another query, and wherein the information extracted is metadata comprising at least one of a schema name, a table in the schema, a name of the attribute, a data type of the attribute, a primary key associated with the attribute, a constraint of the attribute, a functional dependency between attributes, an index, a foreign key, a field name, a column name, a table name, and a query description.
|
1. A method comprising: automatically generating, through a processor communicatively coupled to a memory, an editable and searchable markup page based on an initial query of a database; associating, through the processor, the generated editable and searchable markup page with a user of the database; automatically extracting, through the processor, metadata of at least one data object of the database utilized by another query of the database from a corresponding at least one data source, the another query capable of being both the initial query and a query similar to the initial query, the another query being at least one of: from another user of the database and a previous query from the user of the database, and the at least one data object comprising at least one of: an attribute, a table, a schema, a predicate, an expression and an attribute value; associating, through the processor, the automatically extracted metadata of the at least one data object with the initial query; appending, through the processor, information to the editable and searchable markup page based on the association of the automatically extracted metadata of the at least one data object with the initial query; enhancing, through the processor, the information appended to the editable and searchable markup page based on extracting an action related to the at least one data object by at least one knowledgeable user of the database; generating, through the processor, a social data catalog that populates the editable and searchable markup page; populating, through the processor, the social data catalog with metadata, a logical definition and description of attributes, information about usage, page views between users, a social data network, and a statistical data profile; extracting, through the processor, information from external data sources and social media profiles to generate the social data catalog of information; and enabling, through the processor, crowdsourcing of information from a ranked list of knowledgeable users to generate a ranked order of priority of information presented in profile pages of a curated answers system, wherein the information about usage includes related tables and join predicates as well as relevant filters associated with each table of at least one of the database and a sample database, wherein the social data network includes a list of users who are knowledgeable about a particular object related to the another query, and wherein the information extracted is metadata comprising at least one of a schema name, a table in the schema, a name of the attribute, a data type of the attribute, a primary key associated with the attribute, a constraint of the attribute, a functional dependency between attributes, an index, a foreign key, a field name, a column name, a table name, and a query description. 2. The method of claim 1 , further comprising at least one of: permitting, through the processor, other users of the database to access the editable and searchable markup page; permitting, through the processor, the other users of the database to modify the editable and searchable markup page; permitting, through the processor, the other users of the database to append more information in the editable and searchable markup page; and permitting, through the processor, the other users of the database to delete the information in the editable and searchable markup page.
| 0.609141 |
9,582,278 | 1 | 2 |
1. A computer-implemented system for designing a configurable processor, the system comprising: hardware generation means for, based on a user-defined specification, generating a description of a hardware implementation of the processor; software generation means for, based on the user-defined specification, generating software development tools specific to the hardware implementation; and document generation means for generating documentation of an instruction set of the processor whose hardware implementation description and software development tools are generated by the hardware generation means and software means, respectively, based on the user-defined specification.
|
1. A computer-implemented system for designing a configurable processor, the system comprising: hardware generation means for, based on a user-defined specification, generating a description of a hardware implementation of the processor; software generation means for, based on the user-defined specification, generating software development tools specific to the hardware implementation; and document generation means for generating documentation of an instruction set of the processor whose hardware implementation description and software development tools are generated by the hardware generation means and software means, respectively, based on the user-defined specification. 2. The system of claim 1 , wherein the document generation means includes means for using reference semantics of instructions defined in the user-defined specification to generate the processor instruction set documentation.
| 0.748315 |
9,792,894 | 3 | 4 |
3. The device according to claim 1 , wherein the processing circuitry is configured to determine whether the speaker of the first speech data is the same as the speaker of the second speech data by comparing feature quantity of the first speech data with feature quantity of the second speech data.
|
3. The device according to claim 1 , wherein the processing circuitry is configured to determine whether the speaker of the first speech data is the same as the speaker of the second speech data by comparing feature quantity of the first speech data with feature quantity of the second speech data. 4. The device according to claim 3 , wherein the processing circuitry is configured to compare feature quantities based on at least either word recognition rates, word accuracy rates, amplitudes, fundamental frequencies, and spectral envelops of the first speech data and the second speech data.
| 0.5 |
7,711,525 | 7 | 8 |
7. The method of claim 6 further comprising checking for completeness of the solution between steps d and e, to determine failure wherein, failure characterizes that the said success in step c is not achievable for any time frame i.
|
7. The method of claim 6 further comprising checking for completeness of the solution between steps d and e, to determine failure wherein, failure characterizes that the said success in step c is not achievable for any time frame i. 8. The method of claim 7 wherein the checking for completeness further comprises: (i) adding constraints to ensure that same states are not revisited in the said path, and checking satisfiability of the constraint database; (ii) if unsatisfiable, terminating the search with the said failure, (iii) otherwise, continuing search; and (iv) repeating steps (i)-(iii) until all previous states have been examined.
| 0.5 |
8,412,566 | 3 | 5 |
3. The method of claim 1 , wherein said promotional offers relate to a plurality of products organized in taxonomic groupings, and the method further comprises: basing the scores associated with one or more of said offers on the grouping probability that a customer will purchase any product in a given taxonomic grouping.
|
3. The method of claim 1 , wherein said promotional offers relate to a plurality of products organized in taxonomic groupings, and the method further comprises: basing the scores associated with one or more of said offers on the grouping probability that a customer will purchase any product in a given taxonomic grouping. 5. The method of claim 3 wherein a score is based on said grouping probability and the offer associated with said score is for a product not included in said given taxonomic grouping.
| 0.5 |
9,286,373 | 17 | 18 |
17. The non-transitory computer readable medium of claim 15 , wherein the set of instructions that are executable by the at least one processor of the electronic device to cause the electronic device to further perform: causing the data structure of a first type to add each of the data structures of a first type into a bin in the data structure of a second type, the bin being one of a plurality of bins in the data structure of a second type; and for each bin comprising two or more data structures of a first type: adding the two or more data structures of a first type to a multimap.
|
17. The non-transitory computer readable medium of claim 15 , wherein the set of instructions that are executable by the at least one processor of the electronic device to cause the electronic device to further perform: causing the data structure of a first type to add each of the data structures of a first type into a bin in the data structure of a second type, the bin being one of a plurality of bins in the data structure of a second type; and for each bin comprising two or more data structures of a first type: adding the two or more data structures of a first type to a multimap. 18. The non-transitory computer readable medium of claim 17 , wherein the set of instructions that are executable by the at least one processor of the electronic device to cause the electronic device to further perform: adding two or more objects that correspond to the two or more data structures of a first type added to the multimap to the multimap; and in response to the added two or more objects being different from each other, removing at least one of the two or more data structures of a first type from their respective bin of the plurality of bins.
| 0.5 |
9,483,250 | 10 | 13 |
10. A computer program product for managing deployable computing environments, the computer program product comprising: a non-transitory storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising: analyzing a semantic model of a computing environment; performing, based on the analyzing, the computing environment, wherein the deploying executes one or more automation scripts; identifying, the one or more changes in the state of the computing environment as an expected stated of the computing environment; and updating the semantic model based on the one or more changes in state identified for each automation script, wherein the updating comprises adding at least one validation operation to the semantic model for each change in state that has been identified, wherein upon subsequent deployments of the computing environment, based on the updated semantic model, the at least one validation operation automatically configures at least one computing resource of the computing environment to automatically monitor a given change in state of the computing environment and determine if the given change in state complies with the expected state of the computing environment identified during the initial deployment of the computing environment.
|
10. A computer program product for managing deployable computing environments, the computer program product comprising: a non-transitory storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising: analyzing a semantic model of a computing environment; performing, based on the analyzing, the computing environment, wherein the deploying executes one or more automation scripts; identifying, the one or more changes in the state of the computing environment as an expected stated of the computing environment; and updating the semantic model based on the one or more changes in state identified for each automation script, wherein the updating comprises adding at least one validation operation to the semantic model for each change in state that has been identified, wherein upon subsequent deployments of the computing environment, based on the updated semantic model, the at least one validation operation automatically configures at least one computing resource of the computing environment to automatically monitor a given change in state of the computing environment and determine if the given change in state complies with the expected state of the computing environment identified during the initial deployment of the computing environment. 13. The computer program product of claim 10 , further comprising: determining, based on executing the at least one validation operation, that a current state of the computing environment fails to correspond to the expected state; and notifying at least one user that the current state of the computing environment fails to correspond to the desired state.
| 0.5 |
9,117,448 | 9 | 12 |
9. A method comprising: receiving an audio signal representative of a voice input of an associated calling party; generating audio data corresponding to the received audio signal; identifying the associated calling party and a plurality of associated social graphs associated with the calling party; acquiring data representative of a called party from the audio data; searching, by a processor, for the called party; obtaining, by the processor, a plurality of matches for the called party; initiating a session with the plurality of associated social graphs in accordance with one or more Application Programming Interfaces (APIs) associated with the plurality of social graphs and the identity of the calling party via an associated internetworking system; searching by the processor, in accordance with a predetermined priority, the plurality of social graphs for the data representative of the called party responsive to acquiring the data representative of the called party and obtaining a plurality of matches for the called party, wherein the predetermined priority comprises one or more of a time of day, a social characteristic of the plurality of social graphs, a business characteristic of the plurality of social graphs, a preference of the associated calling party, or a frequency of use by the associated calling party of social graphs of the plurality of social graphs; and eliminating, by the processor, a called party from the plurality of matches for the called party that are not found in the at least one social graph.
|
9. A method comprising: receiving an audio signal representative of a voice input of an associated calling party; generating audio data corresponding to the received audio signal; identifying the associated calling party and a plurality of associated social graphs associated with the calling party; acquiring data representative of a called party from the audio data; searching, by a processor, for the called party; obtaining, by the processor, a plurality of matches for the called party; initiating a session with the plurality of associated social graphs in accordance with one or more Application Programming Interfaces (APIs) associated with the plurality of social graphs and the identity of the calling party via an associated internetworking system; searching by the processor, in accordance with a predetermined priority, the plurality of social graphs for the data representative of the called party responsive to acquiring the data representative of the called party and obtaining a plurality of matches for the called party, wherein the predetermined priority comprises one or more of a time of day, a social characteristic of the plurality of social graphs, a business characteristic of the plurality of social graphs, a preference of the associated calling party, or a frequency of use by the associated calling party of social graphs of the plurality of social graphs; and eliminating, by the processor, a called party from the plurality of matches for the called party that are not found in the at least one social graph. 12. The method set forth in claim 9 , further comprising retrieving the calling party's relationships from the at least one social graph by employing one of the group consisting of an Application Programming Interface and a markup language.
| 0.685864 |
8,121,999 | 1 | 13 |
1. A method for searching a database that includes private social network data, comprising: providing one or more databases including a plurality of database entries, a first portion of the database entries including private social network data and a second portion including non-social network data that is publicly accessible on the World Wide Web; associating a plurality of permission rules with the first portion of database entries, the plurality of permission rules individually defining access rights to a respective subset of the private social network data; receiving a keyword search request from a search request user; receiving auntication data associated with the user, wherein the auntication data identifies access rights of the user to a subset of the private social network data according to at least one of the permission rules; searching the one or more databases or a keyword index thereof using one or more keywords received in the keyword search request and generating a search result comprising a plurality of search result items; determining a hierarchy for the search result items; displaying at least a portion of the search results items according to the hierarchy; and determining whether the user has access rights to a particular subset Of the private social network data and wherein if the user has access rights to particular subset of private social network data, using at least a portion of the particular subset of private social network data in the step of (i) searching the one or more databases, (ii) determining the hierarchy, and/or (iii) displaying the search result items.
|
1. A method for searching a database that includes private social network data, comprising: providing one or more databases including a plurality of database entries, a first portion of the database entries including private social network data and a second portion including non-social network data that is publicly accessible on the World Wide Web; associating a plurality of permission rules with the first portion of database entries, the plurality of permission rules individually defining access rights to a respective subset of the private social network data; receiving a keyword search request from a search request user; receiving auntication data associated with the user, wherein the auntication data identifies access rights of the user to a subset of the private social network data according to at least one of the permission rules; searching the one or more databases or a keyword index thereof using one or more keywords received in the keyword search request and generating a search result comprising a plurality of search result items; determining a hierarchy for the search result items; displaying at least a portion of the search results items according to the hierarchy; and determining whether the user has access rights to a particular subset Of the private social network data and wherein if the user has access rights to particular subset of private social network data, using at least a portion of the particular subset of private social network data in the step of (i) searching the one or more databases, (ii) determining the hierarchy, and/or (iii) displaying the search result items. 13. the method as in claim 1 , further comprising displaying an advertisement in association with the search results, wherein the advertisement is selected at least in part based on the one or more keywords received in the search request.
| 0.5 |
9,864,808 | 4 | 5 |
4. The method of claim 1 , wherein the identifying one or more potentially matching entities comprises performing one or more initial steps to reduce a number of entities from an entire set of a knowledge store down to a subset relevant to the search query.
|
4. The method of claim 1 , wherein the identifying one or more potentially matching entities comprises performing one or more initial steps to reduce a number of entities from an entire set of a knowledge store down to a subset relevant to the search query. 5. The method of claim 4 , wherein the knowledge store tracks most relevant ones of the results discovered for each entity that can be provided as search results when that entity is identified.
| 0.5 |
7,813,916 | 14 | 17 |
14. A method for associating anaphors with antecedents in a written work, comprising the steps of: processing a training corpus containing textual documents that are topically related to the written work, said processing producing interpretive information useful to categorize noun phrases of the training corpus as independent or potentially anaphoric; processing the training corpus to extract a set of thematic caseframes; identifying noun phrases within the written work; using the interpretive information, filtering those identified noun phrases to exclude noun phrases that can be identified to be independent in nature; identifying a set of potentially anaphoric noun phrases occurring in the written work; following said identifying a set of potentially anaphoric noun phrases, recognizing cases of unambiguous coreferences in the set of potentially anaphoric noun phrases, said recognizing associating a noun phrase with an antecedent for each case; following said recognizing, identifying coreference combinations for unrecognized noun phrases from the set of potentially anaphoric noun phrases, each coreference combination including an unrecognized noun phrase and a potential antecedent; applying a plurality of general knowledge sources and a contextual role knowledge source to the coreference combinations, said applying producing evidentiary values for the coreference combinations, wherein the contextual knowledge sources apply extracted thematic caseframes that identify relatedness between the noun phrase and potential antecedent in each coreference combination at a thematic role level and wherein the contextual role knowledge sources include lexical expectations and semantic expectations to resolve the coreference combination by comparing the lexical expectations and the semantic expectations of the coreference combination to the antecedent; applying a factor to each of the produced evidentiary values to favor more credible knowledge sources; for each unrecognized noun phrase, applying a probabilistic model to the produced evidentiary values associated with the noun phrase; and for each application of the probabilistic model to an unrecognized noun phrase, selecting either an antecedent for that unrecognized noun phrase, if the coreference of that antecedent has a corresponding evidentiary value above a selected threshold value, or no antecedent otherwise.
|
14. A method for associating anaphors with antecedents in a written work, comprising the steps of: processing a training corpus containing textual documents that are topically related to the written work, said processing producing interpretive information useful to categorize noun phrases of the training corpus as independent or potentially anaphoric; processing the training corpus to extract a set of thematic caseframes; identifying noun phrases within the written work; using the interpretive information, filtering those identified noun phrases to exclude noun phrases that can be identified to be independent in nature; identifying a set of potentially anaphoric noun phrases occurring in the written work; following said identifying a set of potentially anaphoric noun phrases, recognizing cases of unambiguous coreferences in the set of potentially anaphoric noun phrases, said recognizing associating a noun phrase with an antecedent for each case; following said recognizing, identifying coreference combinations for unrecognized noun phrases from the set of potentially anaphoric noun phrases, each coreference combination including an unrecognized noun phrase and a potential antecedent; applying a plurality of general knowledge sources and a contextual role knowledge source to the coreference combinations, said applying producing evidentiary values for the coreference combinations, wherein the contextual knowledge sources apply extracted thematic caseframes that identify relatedness between the noun phrase and potential antecedent in each coreference combination at a thematic role level and wherein the contextual role knowledge sources include lexical expectations and semantic expectations to resolve the coreference combination by comparing the lexical expectations and the semantic expectations of the coreference combination to the antecedent; applying a factor to each of the produced evidentiary values to favor more credible knowledge sources; for each unrecognized noun phrase, applying a probabilistic model to the produced evidentiary values associated with the noun phrase; and for each application of the probabilistic model to an unrecognized noun phrase, selecting either an antecedent for that unrecognized noun phrase, if the coreference of that antecedent has a corresponding evidentiary value above a selected threshold value, or no antecedent otherwise. 17. A method according to claim 14 , further comprising the steps of: constructing a caseframe lexical expectations knowledge base; following said recognizing cases of unambiguous coreferences, identifying thematic caseframes for noun phrases of unambiguous coreferences; and expanding the caseframe lexical expectation knowledge base to register identified thematic caseframes for the noun phrases of unambiguous coreferences.
| 0.54086 |
8,078,469 | 1 | 2 |
1. A system for providing a distributed voice interface to a device, comprising: a transceiver configured to receive input from the device via a communication network, wherein the input is the result of preliminary signal processing comprising keyword detection by the device prior to receipt of the input at the transceiver; a memory configured to store an acoustic model of the input; and a processing module coupled to the transceiver and configured to perform speech recognition on the received input based at least in part on a previously stored acoustic model in order to recognize a command, wherein the transceiver is further configured to transmit data to the device, responsive to the command, via the communication network using communication channels comprising: a high bandwidth communication channel configured to transmit data supporting audio or video output at the device, and a low bandwidth communication channel configured to transmit data supporting control signals for operation of a primary functionality component of the device, and wherein the data comprises audio data generated to be consistent with audio data generated by the device based on a type of the device.
|
1. A system for providing a distributed voice interface to a device, comprising: a transceiver configured to receive input from the device via a communication network, wherein the input is the result of preliminary signal processing comprising keyword detection by the device prior to receipt of the input at the transceiver; a memory configured to store an acoustic model of the input; and a processing module coupled to the transceiver and configured to perform speech recognition on the received input based at least in part on a previously stored acoustic model in order to recognize a command, wherein the transceiver is further configured to transmit data to the device, responsive to the command, via the communication network using communication channels comprising: a high bandwidth communication channel configured to transmit data supporting audio or video output at the device, and a low bandwidth communication channel configured to transmit data supporting control signals for operation of a primary functionality component of the device, and wherein the data comprises audio data generated to be consistent with audio data generated by the device based on a type of the device. 2. The system of claim 1 , wherein the data includes video data.
| 0.869388 |
8,112,402 | 1 | 3 |
1. A computer implemented method, performed by a computer having a processor, of disambiguating references to named entities, comprising: identifying a surface form of a named entity in a text, the surface form being an ambiguous orthographic representation of a common name for the named entity, the surface form having a corresponding surface form reference in a surface form reference database; enumerating, from the surface form reference, a plurality of different reference named entities based on the identified surface form of the named entity, wherein the surface form is associated in the surface form reference with the plurality of different reference named entities each being formed of a different set of words, and each of the different reference named entities is associated with a named entity reference, the named entity references being stored in a named entity reference database that is separate from the surface form reference database, each of the named entity references associating one of the different reference named entities to multiple entity indicators, the entity indicators including both labels applied to a respective named entity in an information resource, and context indicators applied to the respective named entity in the information resource, in which the labels comprise classifying identifiers applied to the respective named entities in the information resource; evaluating, with the processor, one or more measures of correlation between one or more of the entity indicators in the information resource for each of the identified reference named entities, and the text, the evaluation including comparisons of the text to both the labels and the context indicators; identifying, with the processor, one of the reference named entities for which the associated entity indicators have a relatively high correlation to the text; and providing a disambiguation output that indicates the identified reference named entity to be associated with the surface form of the named entity in the text.
|
1. A computer implemented method, performed by a computer having a processor, of disambiguating references to named entities, comprising: identifying a surface form of a named entity in a text, the surface form being an ambiguous orthographic representation of a common name for the named entity, the surface form having a corresponding surface form reference in a surface form reference database; enumerating, from the surface form reference, a plurality of different reference named entities based on the identified surface form of the named entity, wherein the surface form is associated in the surface form reference with the plurality of different reference named entities each being formed of a different set of words, and each of the different reference named entities is associated with a named entity reference, the named entity references being stored in a named entity reference database that is separate from the surface form reference database, each of the named entity references associating one of the different reference named entities to multiple entity indicators, the entity indicators including both labels applied to a respective named entity in an information resource, and context indicators applied to the respective named entity in the information resource, in which the labels comprise classifying identifiers applied to the respective named entities in the information resource; evaluating, with the processor, one or more measures of correlation between one or more of the entity indicators in the information resource for each of the identified reference named entities, and the text, the evaluation including comparisons of the text to both the labels and the context indicators; identifying, with the processor, one of the reference named entities for which the associated entity indicators have a relatively high correlation to the text; and providing a disambiguation output that indicates the identified reference named entity to be associated with the surface form of the named entity in the text. 3. The method of claim 1 , wherein the context indicators comprise at least one element selected from among: an attribute included in a title of a document about the respective named entity in the information resource; an attribute appearing proximate to the respective named entity in the information resource; an attribute that links to a document about the respective named entity in the information resource; and an attribute that is linked from a document about the respective named entity in the information resource.
| 0.73745 |
9,104,769 | 21 | 22 |
21. The method of claim 9 , wherein determining the size of multiple requests of the plurality of requests comprises determining that a first request of the multiple requests is to be a first size and that a second request of the multiple requests is to be a second size that is different than the first size.
|
21. The method of claim 9 , wherein determining the size of multiple requests of the plurality of requests comprises determining that a first request of the multiple requests is to be a first size and that a second request of the multiple requests is to be a second size that is different than the first size. 22. One or more non-transitory storage media carrying instructions which, when executed by one or more processors, cause performance of the method recited in claim 21 .
| 0.5 |
8,527,307 | 1 | 2 |
1. A method for providing distribution of customer feedback in a retail environment, said method comprising the steps of: receiving, into a tool, feedback inputted by one or more customers using a plurality of portable devices that are configured to communicate with said tool, said feedback inputted pertaining to one or more aspects of a retail environment; identifying, using said plurality of portable devices that are configured to communicate with said tool, respective locations of said one or more customers by continuously tracking, in real-time, movement of said plurality of portable devices; collecting, using said tool, said feedback inputted by said one or more customers pertaining to said one or more aspects of said retail environment, wherein said feedback comprises a respective first tag for inputting a respective feedback into said tool, said respective first tag being configured to extrapolate on said respective feedback inputted, wherein said respective first tag comprises at least one of: an image tag, an audio tag and a textual tag, and wherein said respective first tag comprises at least one of: a product-related tag and a location-related tag; determining whether said feedback inputted pertains to either a product or a location within said retail environment; adding, by said tool, based on said determining in order to facilitate retrieval of said feedback collected, one or more additional tags to said feedback inputted by said one or more customers pertaining to said one or more aspects of said retail environment, wherein said one or more additional tags are extrapolated from said respective first tag in order to facilitate retrieval of said feedback inputted; providing a user access to said feedback collected, including said one or more additional tags extrapolated from said respective first tag based on either an inquiry submitted to said tool by said user or based on a current location of said user identified by said tool, wherein said user comprises at least one of: a customer of said one or more customers that has inputted said feedback and a customer, other than said one or more customers, that has not inputted said feedback, and wherein access by the user to said one or more additional tags extrapolated from said respective first tag is determined based on a preference of the user to specify an amount and degree to which the one or more additional extrapolated tags are retrieved and provided to the user; and presenting said user with additional information besides said feedback collected based on either said inquiry submitted to said tool by said user or based on said current location of said user identified by said tool.
|
1. A method for providing distribution of customer feedback in a retail environment, said method comprising the steps of: receiving, into a tool, feedback inputted by one or more customers using a plurality of portable devices that are configured to communicate with said tool, said feedback inputted pertaining to one or more aspects of a retail environment; identifying, using said plurality of portable devices that are configured to communicate with said tool, respective locations of said one or more customers by continuously tracking, in real-time, movement of said plurality of portable devices; collecting, using said tool, said feedback inputted by said one or more customers pertaining to said one or more aspects of said retail environment, wherein said feedback comprises a respective first tag for inputting a respective feedback into said tool, said respective first tag being configured to extrapolate on said respective feedback inputted, wherein said respective first tag comprises at least one of: an image tag, an audio tag and a textual tag, and wherein said respective first tag comprises at least one of: a product-related tag and a location-related tag; determining whether said feedback inputted pertains to either a product or a location within said retail environment; adding, by said tool, based on said determining in order to facilitate retrieval of said feedback collected, one or more additional tags to said feedback inputted by said one or more customers pertaining to said one or more aspects of said retail environment, wherein said one or more additional tags are extrapolated from said respective first tag in order to facilitate retrieval of said feedback inputted; providing a user access to said feedback collected, including said one or more additional tags extrapolated from said respective first tag based on either an inquiry submitted to said tool by said user or based on a current location of said user identified by said tool, wherein said user comprises at least one of: a customer of said one or more customers that has inputted said feedback and a customer, other than said one or more customers, that has not inputted said feedback, and wherein access by the user to said one or more additional tags extrapolated from said respective first tag is determined based on a preference of the user to specify an amount and degree to which the one or more additional extrapolated tags are retrieved and provided to the user; and presenting said user with additional information besides said feedback collected based on either said inquiry submitted to said tool by said user or based on said current location of said user identified by said tool. 2. The method according to claim 1 , wherein said identifying step further comprises the step of: tracking, using said tool, a respective location of said user for identifying a respective location of said user.
| 0.638699 |
10,061,846 | 3 | 21 |
3. A system comprising: one or more processors; and a non-transitory memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to: receive, from a client system of a first user, a search query requesting objects of a first object type, the search query comprising an inner query requesting objects of a second object type, wherein the requested objects are structured documents stored on a plurality of data stores storing objects of a plurality of object types, respectively, wherein each data store only stores objects of a single object type, and wherein each data store comprises an index server coupled to the data store for processing query requests for objects of the particular object type stored on the data store; retrieve, by an index server of a second data store that only stores objects of the second object type, identifiers of one or more objects of the second object type requested by the inner query using an inverted index of the second data store, wherein the index server of the second data store maintains one or more search indices of the objects of the second object type stored on the second data store, and wherein one of the search indices is the inverted index of the second data store; retrieve, by an index server of a first data store that only stores objects of the first object type, for each of the identified one or more objects of the second object type, identifiers of one or more objects of the first object type requested by the search query, the one or more objects of the first object type being identified using an inverted index of the first data store, wherein the index server of the first data store maintains one or more search indices of the objects of the first object type stored on the first data store, and wherein one of the search indices is the inverted index of the first data store; aggregate a plurality of search results responsive to the search query, each search result corresponding to an identified object of the first object type; and send, to the client system of the first user, one or more of the aggregated search results.
|
3. A system comprising: one or more processors; and a non-transitory memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to: receive, from a client system of a first user, a search query requesting objects of a first object type, the search query comprising an inner query requesting objects of a second object type, wherein the requested objects are structured documents stored on a plurality of data stores storing objects of a plurality of object types, respectively, wherein each data store only stores objects of a single object type, and wherein each data store comprises an index server coupled to the data store for processing query requests for objects of the particular object type stored on the data store; retrieve, by an index server of a second data store that only stores objects of the second object type, identifiers of one or more objects of the second object type requested by the inner query using an inverted index of the second data store, wherein the index server of the second data store maintains one or more search indices of the objects of the second object type stored on the second data store, and wherein one of the search indices is the inverted index of the second data store; retrieve, by an index server of a first data store that only stores objects of the first object type, for each of the identified one or more objects of the second object type, identifiers of one or more objects of the first object type requested by the search query, the one or more objects of the first object type being identified using an inverted index of the first data store, wherein the index server of the first data store maintains one or more search indices of the objects of the first object type stored on the first data store, and wherein one of the search indices is the inverted index of the first data store; aggregate a plurality of search results responsive to the search query, each search result corresponding to an identified object of the first object type; and send, to the client system of the first user, one or more of the aggregated search results. 21. The system of claim 3 , wherein the first object type corresponds to a user of an online social network and the second object type corresponds to a concept of the online social network.
| 0.893939 |
10,068,085 | 1 | 8 |
1. A method for operating an electronic device having a keyboard, the method comprising: presenting, by the electronic device, a prompt for a choice of at least one selected language during password creation; receiving a user input selecting the at least one selected language in response to the prompt, wherein the at least one selected language is different from a device language that the electronic device defaults to once the electronic device is unlocked; presenting the keyboard with a first character mapping for the at least one selected language; receiving a password input for password creation through the keyboard with the first character mapping, wherein the received password input for password creation is inputted in multiple languages; storing data related to the at least one selected language used during password creation based on the user input, wherein the data comprises an identifier of the at least one selected language; presenting, by the electronic device, the keyboard with a second character mapping for the device language; after presenting the keyboard with the second character mapping, presenting, by the electronic device, a prompt for password entry; in response to the prompt for the password entry: selecting, by the electronic device, the first character mapping based on the identifier stored during password creation; and in response to selecting the first character mapping by the electronic device, automatically updating, by the electronic device, the keyboard from the second character mapping for the device language to the first character mapping, wherein the keyboard is updated to the first character mapping while presenting the prompt for password entry; and receiving a password input for password entry using the first character mapping, wherein the received password input for password entry is inputted in the multiple languages.
|
1. A method for operating an electronic device having a keyboard, the method comprising: presenting, by the electronic device, a prompt for a choice of at least one selected language during password creation; receiving a user input selecting the at least one selected language in response to the prompt, wherein the at least one selected language is different from a device language that the electronic device defaults to once the electronic device is unlocked; presenting the keyboard with a first character mapping for the at least one selected language; receiving a password input for password creation through the keyboard with the first character mapping, wherein the received password input for password creation is inputted in multiple languages; storing data related to the at least one selected language used during password creation based on the user input, wherein the data comprises an identifier of the at least one selected language; presenting, by the electronic device, the keyboard with a second character mapping for the device language; after presenting the keyboard with the second character mapping, presenting, by the electronic device, a prompt for password entry; in response to the prompt for the password entry: selecting, by the electronic device, the first character mapping based on the identifier stored during password creation; and in response to selecting the first character mapping by the electronic device, automatically updating, by the electronic device, the keyboard from the second character mapping for the device language to the first character mapping, wherein the keyboard is updated to the first character mapping while presenting the prompt for password entry; and receiving a password input for password entry using the first character mapping, wherein the received password input for password entry is inputted in the multiple languages. 8. The method of claim 1 , wherein the stored data includes the received password input for password creation.
| 0.729064 |
9,600,231 | 6 | 7 |
6. The computer-implemented method of claim 5 , further comprising: determining a first value of a first feature dimension, the first value associated with first audio data including a first keyword; determining a second value of the first feature dimension, the second value associated with second audio data not including a keyword; and determining a first utility metric for the first feature dimension using the first value and the second value.
|
6. The computer-implemented method of claim 5 , further comprising: determining a first value of a first feature dimension, the first value associated with first audio data including a first keyword; determining a second value of the first feature dimension, the second value associated with second audio data not including a keyword; and determining a first utility metric for the first feature dimension using the first value and the second value. 7. The computer-implemented method of claim 6 , further comprising: processing a plurality of training audio data samples to determine a plurality of feature vectors, wherein each feature vector includes a value for each of a second plurality of feature dimensions and wherein the first plurality of feature dimensions is a subset of the second plurality of feature dimensions and the second plurality of feature dimensions includes the first feature dimension; determining a threshold utility; determining the first utility metric is above the threshold utility; and including the first feature dimension in the first plurality of feature dimensions.
| 0.5 |
9,875,309 | 7 | 9 |
7. A method comprising: identifying a set of topics appearing in sentences included in a plurality of data sources; associating each topic with a context vector, each context vector representing a frequency of a given identified topic associated with a topic identifier co-occurring in one or more text strings with a plurality of topics from the set of topics and comprising: a plurality of context confidence values, each context confidence value representing a relationship between the given identified topic and an additional identified topic that co-occurs within a sentence from the plurality of data sources with the given identified topic; and where each context confidence value of the plurality of context confidence values is based upon a combination of a topic confidence value of the given identified topic and a topic confidence value of the additional identified topic that co-occurs within the sentence from the plurality of data sources with the given identified topic; receiving a search query comprising a keyword; identifying one or more topics associated with the keyword included in the search query; identifying one or more sentences from the plurality of data sources that include one or more of the topics associated with the keyword included in the search query; and generating a search result for the search query that includes the identified sentences.
|
7. A method comprising: identifying a set of topics appearing in sentences included in a plurality of data sources; associating each topic with a context vector, each context vector representing a frequency of a given identified topic associated with a topic identifier co-occurring in one or more text strings with a plurality of topics from the set of topics and comprising: a plurality of context confidence values, each context confidence value representing a relationship between the given identified topic and an additional identified topic that co-occurs within a sentence from the plurality of data sources with the given identified topic; and where each context confidence value of the plurality of context confidence values is based upon a combination of a topic confidence value of the given identified topic and a topic confidence value of the additional identified topic that co-occurs within the sentence from the plurality of data sources with the given identified topic; receiving a search query comprising a keyword; identifying one or more topics associated with the keyword included in the search query; identifying one or more sentences from the plurality of data sources that include one or more of the topics associated with the keyword included in the search query; and generating a search result for the search query that includes the identified sentences. 9. The method of claim 7 , wherein generating the search result comprises: identifying topics that are commonly associated with the keyword; and including the identified topics that are commonly associated with the keyword in the search result.
| 0.5 |
7,536,708 | 7 | 8 |
7. A telecommunications server, comprising: a first database for storing one or more keywords related to television programming information; a second database for storing program schedules for related television programs; a keyword extractor for accessing said first database and extracting keywords in a received control message having incomplete program schedule information; and a message search unit for searching said second database for programs corresponding to said keywords and determining schedule information for each identified corresponding television program; and a digital personal video stream manager controller scheduling and setting a video recording device to record a particular program at a scheduled time identified by said message search unit in response to said keywords in said control message.
|
7. A telecommunications server, comprising: a first database for storing one or more keywords related to television programming information; a second database for storing program schedules for related television programs; a keyword extractor for accessing said first database and extracting keywords in a received control message having incomplete program schedule information; and a message search unit for searching said second database for programs corresponding to said keywords and determining schedule information for each identified corresponding television program; and a digital personal video stream manager controller scheduling and setting a video recording device to record a particular program at a scheduled time identified by said message search unit in response to said keywords in said control message. 8. A telecommunications server in accordance with claim 7 , further including a confirmation message generator adapted to transmit a confirmation message to a sender of said control message in response to a result returned by said message search unit, said confirmation message indicating determined schedule information.
| 0.5 |
7,603,344 | 8 | 22 |
8. A digital forensic analysis method, comprising: extracting information from input data; detecting suspect data contained in said extracted data using a forensic search tool of a computing platform associated with a first agency, said detecting performed by matching said extracted data with one or more pre-defined data patterns specified by said forensic search tool, wherein said suspect data comprises data identified by said forensic search tool as being associated with inappropriate or illegal activities; including the suspect data and a non-readable and non-modifiable representation of sensitive data in the forensic search tool; outputting a report identifying said suspect data; and outputting said forensic search tool by said computing platform associated with said first agency to at least one computing platform associated with a second agency, wherein the digital forensic search tool comprises a header; a search markup language portion; a data features portion containing features of data, wherein the digital forensic search tool enables said computing platform associated with said first agency to share the suspect data with said at least one computing platform associated with said second agency in a manner that enables utilization of the suspect data by the second agency while not revealing the actual content of the sensitive data to the second agency, and wherein said forensic search tool is implemented using said search markup language to permit sharing of said forensic search tool by said computing platform associated with the first agency with said at least one computing platform associated with the second agency.
|
8. A digital forensic analysis method, comprising: extracting information from input data; detecting suspect data contained in said extracted data using a forensic search tool of a computing platform associated with a first agency, said detecting performed by matching said extracted data with one or more pre-defined data patterns specified by said forensic search tool, wherein said suspect data comprises data identified by said forensic search tool as being associated with inappropriate or illegal activities; including the suspect data and a non-readable and non-modifiable representation of sensitive data in the forensic search tool; outputting a report identifying said suspect data; and outputting said forensic search tool by said computing platform associated with said first agency to at least one computing platform associated with a second agency, wherein the digital forensic search tool comprises a header; a search markup language portion; a data features portion containing features of data, wherein the digital forensic search tool enables said computing platform associated with said first agency to share the suspect data with said at least one computing platform associated with said second agency in a manner that enables utilization of the suspect data by the second agency while not revealing the actual content of the sensitive data to the second agency, and wherein said forensic search tool is implemented using said search markup language to permit sharing of said forensic search tool by said computing platform associated with the first agency with said at least one computing platform associated with the second agency. 22. The digital forensic analysis method of claim 8 , further comprising: computing said features of data based on said extracted data, wherein said detecting suspect data further comprises matching said computed features of data with said extracted data.
| 0.679648 |
9,811,870 | 8 | 13 |
8. A portable electronic device for presenting a recommendation message, comprising: a display; a motion sensor; one or more processors; and memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions for: detecting a trigger event based on a user input in an application running on the portable electronic device, the trigger event initiating a predefined time window for receipt of a non-tactile user input; in response to detecting the trigger event, receiving sensor data captured by the motion sensor resulting from a non-tactile user input, wherein the sensor data is captured within the predefined time window; determining whether values of the sensor data captured by the motion sensor satisfy a predefined movement pattern of the portable electronic device; in response to determining that the values of the sensor data satisfy the predefined movement pattern of the portable electronic device, generating one or more character strings based, at least in part, on the values of the sensor data, each character string of the one or more character strings including multiple characters; generating a recommendation message that includes the one or more character strings; and displaying the recommendation message on the display.
|
8. A portable electronic device for presenting a recommendation message, comprising: a display; a motion sensor; one or more processors; and memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions for: detecting a trigger event based on a user input in an application running on the portable electronic device, the trigger event initiating a predefined time window for receipt of a non-tactile user input; in response to detecting the trigger event, receiving sensor data captured by the motion sensor resulting from a non-tactile user input, wherein the sensor data is captured within the predefined time window; determining whether values of the sensor data captured by the motion sensor satisfy a predefined movement pattern of the portable electronic device; in response to determining that the values of the sensor data satisfy the predefined movement pattern of the portable electronic device, generating one or more character strings based, at least in part, on the values of the sensor data, each character string of the one or more character strings including multiple characters; generating a recommendation message that includes the one or more character strings; and displaying the recommendation message on the display. 13. The device of claim 8 , wherein generating the one or more character strings based on the values of the sensor data comprises: generating the one or more character strings in a first specified value range upon determining that the values of the sensor data satisfy a criterion; and generating the one or more character strings in a second specified value range upon determining that the values of the sensor data do not satisfy the criterion, wherein the second specified value range is less than the first specified value range.
| 0.598039 |
9,318,105 | 19 | 20 |
19. A method, comprising: selecting a return value corresponding to a spoken input; generating a subset of alternative return values for the spoken input, wherein the alternative return value is related to the selected return value based on one of a synonym relationship and a phonetic similarity threshold between the grammars for the return value and the alternative return value; generating a first string in a pair of strings is from the grammar for a first return value, and a second string in the pair of strings is from the grammar for a second return value and is not in the grammar for the first return value, then selecting the second string as a likely alternative for the first return value, and constructing the subset of return values that are likely alternatives for each return value in a dictionary; and presenting the alternative return values to the user for selection, wherein the user is notified of each string that has a likelihood of being confused so that the user can make changes to the grammar.
|
19. A method, comprising: selecting a return value corresponding to a spoken input; generating a subset of alternative return values for the spoken input, wherein the alternative return value is related to the selected return value based on one of a synonym relationship and a phonetic similarity threshold between the grammars for the return value and the alternative return value; generating a first string in a pair of strings is from the grammar for a first return value, and a second string in the pair of strings is from the grammar for a second return value and is not in the grammar for the first return value, then selecting the second string as a likely alternative for the first return value, and constructing the subset of return values that are likely alternatives for each return value in a dictionary; and presenting the alternative return values to the user for selection, wherein the user is notified of each string that has a likelihood of being confused so that the user can make changes to the grammar. 20. The method of claim 19 , wherein the step of generating the subset of alternative return values is performed at compile time as opposed to at runtime.
| 0.5 |
7,818,665 | 13 | 15 |
13. A server comprising: a data store to store a first markup language document associated with a first version of a schema; a transform module operably coupled to the data store, the transform module to generate a second markup language document associated with a second version of the schema based on the first markup language document and a first transform, and generate a third markup language document associated with the first version of the schema based on the second markup language document and a second transform, wherein the first transform represents a transform from the first version of the schema to the second version of the schema and the second transform represents a transform from the second version of the schema to the first version of the schema; a compare module operably coupled to the transform module, the compare module to generate a comparison report based on a comparison of the third markup language document to the first markup language document, wherein the comparison report represents discrepancies between the first markup language document and the third markup language document identified from the comparison of the third markup language document with the first markup language document; and a verify module operably coupled to the transform module and the compare module, the verify module to filter out previously identified discrepancies from the comparison report to generate a discrepancies report.
|
13. A server comprising: a data store to store a first markup language document associated with a first version of a schema; a transform module operably coupled to the data store, the transform module to generate a second markup language document associated with a second version of the schema based on the first markup language document and a first transform, and generate a third markup language document associated with the first version of the schema based on the second markup language document and a second transform, wherein the first transform represents a transform from the first version of the schema to the second version of the schema and the second transform represents a transform from the second version of the schema to the first version of the schema; a compare module operably coupled to the transform module, the compare module to generate a comparison report based on a comparison of the third markup language document to the first markup language document, wherein the comparison report represents discrepancies between the first markup language document and the third markup language document identified from the comparison of the third markup language document with the first markup language document; and a verify module operably coupled to the transform module and the compare module, the verify module to filter out previously identified discrepancies from the comparison report to generate a discrepancies report. 15. The server of claim 13 , wherein the verify module further is to determine a suitability of the first transform and the second transform based on the discrepancies report.
| 0.773902 |
7,587,412 | 12 | 13 |
12. A computer-implemented method for operation of a mixed media reality brokerage network, the method comprising: identifying electronic data from a customer; associating and optimizing the identified electronic data with a hot spot; securing a hot spot license; transferring a revenue model and content to a service bureau; interacting with users via service bureau; and collecting and distributing revenue generated by the interacting.
|
12. A computer-implemented method for operation of a mixed media reality brokerage network, the method comprising: identifying electronic data from a customer; associating and optimizing the identified electronic data with a hot spot; securing a hot spot license; transferring a revenue model and content to a service bureau; interacting with users via service bureau; and collecting and distributing revenue generated by the interacting. 13. The method of claim 12 , wherein associating and optimizing further comprises advising the customer how best to associate the electronic data with the hot spot based on a criterion.
| 0.734957 |
7,657,434 | 1 | 5 |
1. A computer-implemented method for interpreting a frame definition, the frame definition comprising at least one data field and at least one goal, to control a dialog with a user, the method comprising: receiving information input from the user; updating frame data associated with the frame definition dependent upon the information input from the user; determining that at least one goal of the frame definition is activated, wherein a goal is activated when at least one field referred to inside the goal has been modified; selecting a goal that has been determined to be activated; if the selected activated goal is satisfied: evaluating final rules of the frame definition; and completing the interpretation of the frame definition; and if the selected activated goal is not satisfied: selecting an unfilled data field in the goal; and generating an output to the user using information in the frame definition that is associated with the selected unfilled data field.
|
1. A computer-implemented method for interpreting a frame definition, the frame definition comprising at least one data field and at least one goal, to control a dialog with a user, the method comprising: receiving information input from the user; updating frame data associated with the frame definition dependent upon the information input from the user; determining that at least one goal of the frame definition is activated, wherein a goal is activated when at least one field referred to inside the goal has been modified; selecting a goal that has been determined to be activated; if the selected activated goal is satisfied: evaluating final rules of the frame definition; and completing the interpretation of the frame definition; and if the selected activated goal is not satisfied: selecting an unfilled data field in the goal; and generating an output to the user using information in the frame definition that is associated with the selected unfilled data field. 5. A method in accordance with claim 1 wherein the frame comprises a plurality of goals, the method further comprising: detecting if an alternative goal of the plurality of goals is activated as a result of user input; and using the alternative goal to guide the dialog.
| 0.5 |
7,617,078 | 1 | 26 |
1. A system for producing structured clinical information from patient records, comprising: a computerized patient record comprising at least one data source storing patient information, at least some of the patient information being unstructured, the patient information including clinical information related to a plurality of variables representing a state of the patient; a memory comprising a domain knowledge base containing domain-specific criteria relating the clinical information to values of the variables; and a processor configured to apply a data miner for extracting the clinical information from the data source using the domain-specific criteria, the data miner operable to create structured clinical information from the extracted clinical information including at least some of the unstructured patient information, the structured clinical information including the variables representing a state of the patient as a summary, the data miner operable to resolve discrepancies of different clinical information indicating different values of one of the variables.
|
1. A system for producing structured clinical information from patient records, comprising: a computerized patient record comprising at least one data source storing patient information, at least some of the patient information being unstructured, the patient information including clinical information related to a plurality of variables representing a state of the patient; a memory comprising a domain knowledge base containing domain-specific criteria relating the clinical information to values of the variables; and a processor configured to apply a data miner for extracting the clinical information from the data source using the domain-specific criteria, the data miner operable to create structured clinical information from the extracted clinical information including at least some of the unstructured patient information, the structured clinical information including the variables representing a state of the patient as a summary, the data miner operable to resolve discrepancies of different clinical information indicating different values of one of the variables. 26. The system of claim 1 , wherein the unstructured information includes one or more of: ASCII text strings, image information in DICOM format, text documents or combinations thereof partitioned based on domain knowledge.
| 0.733173 |
7,743,317 | 11 | 13 |
11. The computer-readable storage medium of claim 10 , further comprising, in response to pasting the spreadsheet element in the target document, displaying a recovery action user interface having at least one selectable recovery action.
|
11. The computer-readable storage medium of claim 10 , further comprising, in response to pasting the spreadsheet element in the target document, displaying a recovery action user interface having at least one selectable recovery action. 13. The computer-readable storage medium of claim 11 , further comprising, in response to receiving a recovery action selection from the recovery action user interface: removing the spreadsheet element from the target document, and pasting the spreadsheet element as unformatted text.
| 0.697228 |
8,667,007 | 8 | 11 |
8. A computer program product for providing recommendations to improve a query, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code, when executed by a processor of a computer, is configured to perform: receiving a query with query keywords and selected categories; and in response to determining that the selected categories are ranked high with reference to query relevance indicator values for each of the selected categories, determining whether a lowest category level has been reached in the selected categories; in response to determining that the lowest category level has been reached, ranking individual services that are at the lowest category Levels; and providing one or more high ranked services from the ranked individual services; and in response to determining that the lowest category level has not been reached, calculating a keyword relevance indicator of each keyword in the query for each subcategory of each of the selected categories, wherein the keyword relevance indicator for a keyword is calculated using a keyword frequency of the keyword and an inverse service frequency of a subcategory; calculating a query relevance indicator of the query with each subcategory using the calculated keyword relevance indicators, wherein the query relevance indicator is calculated based on a keyword relevance indicator of a keyword specified in the query and a keyword relevance indicator of a keyword in the subcategory that is not specified in the query; ranking each subcategory based on the query relevance indicators; and providing the ranked subcategories for use in selecting new categories to be submitted with the query.
|
8. A computer program product for providing recommendations to improve a query, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code, when executed by a processor of a computer, is configured to perform: receiving a query with query keywords and selected categories; and in response to determining that the selected categories are ranked high with reference to query relevance indicator values for each of the selected categories, determining whether a lowest category level has been reached in the selected categories; in response to determining that the lowest category level has been reached, ranking individual services that are at the lowest category Levels; and providing one or more high ranked services from the ranked individual services; and in response to determining that the lowest category level has not been reached, calculating a keyword relevance indicator of each keyword in the query for each subcategory of each of the selected categories, wherein the keyword relevance indicator for a keyword is calculated using a keyword frequency of the keyword and an inverse service frequency of a subcategory; calculating a query relevance indicator of the query with each subcategory using the calculated keyword relevance indicators, wherein the query relevance indicator is calculated based on a keyword relevance indicator of a keyword specified in the query and a keyword relevance indicator of a keyword in the subcategory that is not specified in the query; ranking each subcategory based on the query relevance indicators; and providing the ranked subcategories for use in selecting new categories to be submitted with the query. 11. The computer program product of claim 8 , wherein the computer readable program code, when executed by the processor of the computer, is configured to perform: for category keywords in non-top-ranked selected categories with high keyword relevance indicator values, identifying the category keywords that are not in the query and for which synonyms are not identified; and providing a recommendation that the identified category keywords be added to the query.
| 0.621533 |
9,461,834 | 16 | 17 |
16. The method of claim 1 wherein establishing the repository for the first online meeting includes the meeting server establishing a plurality of categories associated with the first online meeting; and, the method further comprising: subsequent to receiving the document, the meeting server associating the document with one of the first online meeting categories.
|
16. The method of claim 1 wherein establishing the repository for the first online meeting includes the meeting server establishing a plurality of categories associated with the first online meeting; and, the method further comprising: subsequent to receiving the document, the meeting server associating the document with one of the first online meeting categories. 17. The method of claim 16 wherein associating the document with one of the first online meeting categories includes the meeting server performing an operation on a document request, returned with the received document, the operation selected from a group consisting of parsing a document request for keywords associated with categories and recognizing an embedded category identifier in the document request.
| 0.5 |
7,925,656 | 1 | 8 |
1. A method, in a data processing system, for evaluating an electronic document query, comprising: receiving a hierarchical query; separating the hierarchical query into a plurality of query legs; performing an index scan for evaluating the hierarchical query against at least one index of at least one hierarchically structured electronic document by processing a query leg on the at least one index of the at least one hierarchically structured electronic document to determine if a condition of the query leg is met by at least one node in the at least one index of the at least one hierarchically structured electronic document, wherein if at least one node in the at least one index of the at least one hierarchically structured electronic document satisfies the condition of the query leg, an entry in at least one hash table is populated with information regarding the at least one node; generating results of the hierarchical query based on content of the at least one hash table; and returning the results of the hierarchical query to an originator of the hierarchical query, wherein the at least one hash table comprises a BUILD hash table and a PROBE hash table, wherein the BUILD hash table is used to store document nodes matching a predicate of the query leg and to buffer document nodes satisfying extraction nodes of the query leg, and wherein the PROBE hash table stores document nodes satisfying predicates from query legs evaluated prior to a current query leg being evaluated.
|
1. A method, in a data processing system, for evaluating an electronic document query, comprising: receiving a hierarchical query; separating the hierarchical query into a plurality of query legs; performing an index scan for evaluating the hierarchical query against at least one index of at least one hierarchically structured electronic document by processing a query leg on the at least one index of the at least one hierarchically structured electronic document to determine if a condition of the query leg is met by at least one node in the at least one index of the at least one hierarchically structured electronic document, wherein if at least one node in the at least one index of the at least one hierarchically structured electronic document satisfies the condition of the query leg, an entry in at least one hash table is populated with information regarding the at least one node; generating results of the hierarchical query based on content of the at least one hash table; and returning the results of the hierarchical query to an originator of the hierarchical query, wherein the at least one hash table comprises a BUILD hash table and a PROBE hash table, wherein the BUILD hash table is used to store document nodes matching a predicate of the query leg and to buffer document nodes satisfying extraction nodes of the query leg, and wherein the PROBE hash table stores document nodes satisfying predicates from query legs evaluated prior to a current query leg being evaluated. 8. The method of claim 1 , wherein the BUILD hash table buffers document nodes satisfying extraction nodes of the query leg in at least one buffer list having a first pointer that points to a next buffer list for a same extraction node and a second pointer that points to a buffer list for the next extraction node.
| 0.569672 |
6,055,515 | 10 | 11 |
10. A method of building and maintaining a multi-taxonomy of product categories, organizing categories into hierarchies, creating products and attribute descriptions and adding values to said attributes, comprising the steps of: providing a computer user interface display that presents said hierarchies of data in a tree presentation form of lattice structures, navigating through said tree presentation form by means of an integrated multi-navigation path browsing system, building a multi-inheritance taxonomy by the means of said integrated multi-navigation path browsing system, and employing at least one indicator means for allowing a user to find information in said multi-taxonomy, without requiring expansion of said tree, said indicator means indicating categories beyond the immediate window wherein said products would be located.
|
10. A method of building and maintaining a multi-taxonomy of product categories, organizing categories into hierarchies, creating products and attribute descriptions and adding values to said attributes, comprising the steps of: providing a computer user interface display that presents said hierarchies of data in a tree presentation form of lattice structures, navigating through said tree presentation form by means of an integrated multi-navigation path browsing system, building a multi-inheritance taxonomy by the means of said integrated multi-navigation path browsing system, and employing at least one indicator means for allowing a user to find information in said multi-taxonomy, without requiring expansion of said tree, said indicator means indicating categories beyond the immediate window wherein said products would be located. 11. A method of claim 10 wherein said indicator means is any one of a plurality of geometric symbols to indicate an immediate super node and the parents of the product below and an alternate one of said plurality of geometric symbols to indicate that said product is also under another category.
| 0.5 |
9,552,601 | 1 | 5 |
1. A system, comprising: a processor and executable instructions accessible on a computer-readable medium that, when executed, cause the processor to perform operations comprising: generating one or more containers, each container being associated with a subset of a dynamically changing inventory of items of a network-based publication system and including a cluster of one or more items of the subset of the dynamically changing inventory of items; accessing a search query received by the network-based publication system; determining that a container of the one or more containers is associated with a subset of the dynamically changing inventory that includes one or more uncategorized items, the container having a title that satisfies the search query; determining a match score for each of the one or more uncategorized items associated with the container; adjusting the match score for each of the one or more uncategorized items based on a comparison of each of the uncategorized items to the search query; and generating a container page displaying item information associated with the container, including information associated with an uncategorized item having a best adjusted match score.
|
1. A system, comprising: a processor and executable instructions accessible on a computer-readable medium that, when executed, cause the processor to perform operations comprising: generating one or more containers, each container being associated with a subset of a dynamically changing inventory of items of a network-based publication system and including a cluster of one or more items of the subset of the dynamically changing inventory of items; accessing a search query received by the network-based publication system; determining that a container of the one or more containers is associated with a subset of the dynamically changing inventory that includes one or more uncategorized items, the container having a title that satisfies the search query; determining a match score for each of the one or more uncategorized items associated with the container; adjusting the match score for each of the one or more uncategorized items based on a comparison of each of the uncategorized items to the search query; and generating a container page displaying item information associated with the container, including information associated with an uncategorized item having a best adjusted match score. 5. The system of claim 1 , wherein the returning of the result of the container page is based on a selection of an uncategorized item associated with the container that has not been published by the network-based publication system within a certain time period.
| 0.5 |
7,953,600 | 49 | 53 |
49. A system for speech synthesis comprising: a processor; and a storage medium having program instructions written thereon for execution on the processor, the program instructions including program instructions for: a front end module configured to receive symbolic input descriptive of an utterance to be synthesized, a back end module configured to select a portion of the utterance to be constructed from a speech unit of a speech corpus, the speech unit recorded from a human speaker, the speech unit lacking transitions at one or both of the speech unit's edges, a synthesis module configured to synthesize a transition for use at an edge of the speech unit by use of Rule-Based Speech Synthesis (RBSS) rules, and a concatenation engine of the back end module configured to concatenate the speech unit with the synthesized transition in production of a speech waveform for the utterance.
|
49. A system for speech synthesis comprising: a processor; and a storage medium having program instructions written thereon for execution on the processor, the program instructions including program instructions for: a front end module configured to receive symbolic input descriptive of an utterance to be synthesized, a back end module configured to select a portion of the utterance to be constructed from a speech unit of a speech corpus, the speech unit recorded from a human speaker, the speech unit lacking transitions at one or both of the speech unit's edges, a synthesis module configured to synthesize a transition for use at an edge of the speech unit by use of Rule-Based Speech Synthesis (RBSS) rules, and a concatenation engine of the back end module configured to concatenate the speech unit with the synthesized transition in production of a speech waveform for the utterance. 53. The system of claim 49 wherein the speech unit of the speech corpus is a Phone-and-Transition (P&T) speech unit in which a beginning and an end of at least one phone or transition component have been labeled.
| 0.579365 |
8,010,547 | 12 | 13 |
12. The system of claim 11 , wherein the reformulator is operable to compare the generated candidates of the query with the candidates in the three sub-dictionaries, and automatically submit to the search engine the generated candidates that are found in either the must-split or the must-join sub-dictionaries; and the language modeler is operable to apply the language model to the generated candidates that are found in the normal sub-dictionary.
|
12. The system of claim 11 , wherein the reformulator is operable to compare the generated candidates of the query with the candidates in the three sub-dictionaries, and automatically submit to the search engine the generated candidates that are found in either the must-split or the must-join sub-dictionaries; and the language modeler is operable to apply the language model to the generated candidates that are found in the normal sub-dictionary. 13. The system of claim 12 , wherein the language modeler is operable to: determine a probability that the generated candidates found in the normal sub-dictionary may be found in the query logs based on a frequency of their occurrence therein; rank the normal generated candidates of the reformulated query based on their respective probabilities; and rewrite the query using a highest-ranked, normal generated candidate for submission to the search engine, wherein the highest-ranked reformulated query is different from the query originally accepted.
| 0.5 |
9,183,321 | 15 | 16 |
15. One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, cause: storing, within a repository, a plurality of compound documents, each compound document of the plurality of compound documents including: a parent document, a plurality of subdocuments of said parent document; wherein the parent document includes, for each subdocument of the plurality of subdocuments, a link to said each subdocument; storing, in association with a first compound document of the plurality of compound documents, a first compound document declaration that declares a first type of link; storing, in association with a second compound document of the plurality of compound documents, a second compound document declaration that declares a second type of link that is different than the first type of link; wherein the first type of link is one of a hard link, a weak link, or a symbolic link; wherein the second type of link is another one of the hard link, the weak link, or the symbolic link; wherein the hard link is a link such that a first subdocument that is a target of the hard link cannot be deleted from the repository as long as the hard link is included in a first parent document, wherein the hard link is uniquely associated with the first subdocument, and wherein the hard link between a first parent document and the first subdocument is preserved if the first subdocument is moved to another location within the repository; wherein the weak link is a link such that a second subdocument that is a target of the weak link is uniquely associated with the weak link and can be deleted from the repository even while a second parent document includes the weak link to the second subdocument; wherein the symbolic link is a link such that a third parent document that includes the symbolic link is no longer linked to a third subdocument that is a target of the symbolic link when the third subdocument is moved to a different location in the repository, wherein the symbolic link is not uniquely associated with the third subdocument.
|
15. One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, cause: storing, within a repository, a plurality of compound documents, each compound document of the plurality of compound documents including: a parent document, a plurality of subdocuments of said parent document; wherein the parent document includes, for each subdocument of the plurality of subdocuments, a link to said each subdocument; storing, in association with a first compound document of the plurality of compound documents, a first compound document declaration that declares a first type of link; storing, in association with a second compound document of the plurality of compound documents, a second compound document declaration that declares a second type of link that is different than the first type of link; wherein the first type of link is one of a hard link, a weak link, or a symbolic link; wherein the second type of link is another one of the hard link, the weak link, or the symbolic link; wherein the hard link is a link such that a first subdocument that is a target of the hard link cannot be deleted from the repository as long as the hard link is included in a first parent document, wherein the hard link is uniquely associated with the first subdocument, and wherein the hard link between a first parent document and the first subdocument is preserved if the first subdocument is moved to another location within the repository; wherein the weak link is a link such that a second subdocument that is a target of the weak link is uniquely associated with the weak link and can be deleted from the repository even while a second parent document includes the weak link to the second subdocument; wherein the symbolic link is a link such that a third parent document that includes the symbolic link is no longer linked to a third subdocument that is a target of the symbolic link when the third subdocument is moved to a different location in the repository, wherein the symbolic link is not uniquely associated with the third subdocument. 16. The one or more non-transitory computer-readable media of claim 15 , wherein the instructions when executed by the one or more processors, further cause: receiving a statement that requires that a particular operation be performed on content stored within a certain subdocument of said plurality of subdocuments; and based on one or more compound document declarations that are stored separate from the plurality of compound documents, making a determination that said particular operation is not permitted.
| 0.745264 |
10,061,469 | 8 | 12 |
8. A computer system comprising: one or more processors which process program instructions; a display device; a memory device connected to said one or more processors; and program instructions residing in said memory device for displaying secondary data associated with primary data by generating a three-dimensional visualization of the primary data on the display device, the three-dimensional visualization including a plurality of primary graphical elements representing primary quantitative values and a plurality of primary labels respectively associated with and proximate to the primary graphical elements, the primary graphical elements and primary labels being presented on a front plane of the three-dimensional visualization, the front plane defining first and second axes, and at least one of the primary graphical elements having associated secondary graphical elements representing secondary quantitative values wherein the secondary graphical elements are presented along a third axis of the three-dimensional visualization, the third axis being different from the first and second axes, detecting that the at least one primary graphical elements has been selected, and responsive to the detecting, transitioning the three-dimensional visualization by moving the secondary graphical elements from the third axis of the three-dimensional visualization to the front plane of the three-dimensional visualization.
|
8. A computer system comprising: one or more processors which process program instructions; a display device; a memory device connected to said one or more processors; and program instructions residing in said memory device for displaying secondary data associated with primary data by generating a three-dimensional visualization of the primary data on the display device, the three-dimensional visualization including a plurality of primary graphical elements representing primary quantitative values and a plurality of primary labels respectively associated with and proximate to the primary graphical elements, the primary graphical elements and primary labels being presented on a front plane of the three-dimensional visualization, the front plane defining first and second axes, and at least one of the primary graphical elements having associated secondary graphical elements representing secondary quantitative values wherein the secondary graphical elements are presented along a third axis of the three-dimensional visualization, the third axis being different from the first and second axes, detecting that the at least one primary graphical elements has been selected, and responsive to the detecting, transitioning the three-dimensional visualization by moving the secondary graphical elements from the third axis of the three-dimensional visualization to the front plane of the three-dimensional visualization. 12. The computer system of claim 8 wherein the transitioning further includes shifting certain ones of the primary graphical elements along the first axis to provide spacing to accommodate the secondary graphical elements at the front plane.
| 0.673442 |
9,594,731 | 4 | 5 |
4. The computer-implemented method of claim 1 , wherein the plurality of editing handlers inserted within the HTML representation includes one or more of: a conditional XSL statement configured to cause the second XML element to be visually represented in the HTML representation whereby the user can engage the second XML element; an identifier associated with the first XML element, including: an indication of one of a beginning and an end of an XSL template; and an XPath query to the first XML element; and an HTML event handler associated with an element indicating one or more editing features are available to manipulate the element.
|
4. The computer-implemented method of claim 1 , wherein the plurality of editing handlers inserted within the HTML representation includes one or more of: a conditional XSL statement configured to cause the second XML element to be visually represented in the HTML representation whereby the user can engage the second XML element; an identifier associated with the first XML element, including: an indication of one of a beginning and an end of an XSL template; and an XPath query to the first XML element; and an HTML event handler associated with an element indicating one or more editing features are available to manipulate the element. 5. The computer-implemented method of claim 4 , wherein the one or more editing features include: a dialog-based editor configured to one or more of: edit text; and change attributes of the first XML element; a rich-text editor configured to one or more of: edit a text-only XML element via a text-editing interface; and receive a modification to one or more in-line elements within the text-only XML element; a drag and drop editor configured to receive a graphical input including: selection of an element; and dragging the selected element to one of: move the selected element to a new location; and replace an existing element at a specified location; and a template editor configured to one or more of: upon a new XML element being inserted, determining if the new XML element is associated with at least one XML segment; and when the new XML element is associated with at least one XML segment, inserting the at least one XML segment a number of times associated with the new XML element and the at least one XML segment.
| 0.5 |
9,378,299 | 7 | 9 |
7. The non-transitory computer-readable storage medium of claim 6 further comprising program code for: calculating a score for a candidate page in the set, the score indicating a measure of how interesting the candidate page is likely to be to a user of the client.
|
7. The non-transitory computer-readable storage medium of claim 6 further comprising program code for: calculating a score for a candidate page in the set, the score indicating a measure of how interesting the candidate page is likely to be to a user of the client. 9. The non-transitory computer-readable storage medium of claim 7 wherein program code for calculating the score for the candidate page comprises program code for: calculating the score responsive to intrinsic components of the candidate page, the intrinsic components describing characteristics inherent in the candidate page.
| 0.606971 |
8,941,589 | 25 | 28 |
25. The system of claim 24 , wherein the pose information includes translation information and rotation information.
|
25. The system of claim 24 , wherein the pose information includes translation information and rotation information. 28. The system of claim 25 , wherein the pose information relates a position and orientation of a tag to a position and orientation of the SOE.
| 0.5 |
8,843,495 | 1 | 4 |
1. A method for the efficient selection of runtime rules for programmable search, said method comprising: a processor of a computer system translating a plurality of runtime rules into a plurality of fielded documents, wherein a first runtime rule of said plurality of runtime rules comprises a first rule pattern and a first rewrite pattern, wherein said first rule pattern comprises a first set of tokens of a plurality of tokens, and wherein a first fielded document of said plurality of fielded documents comprises said first set of tokens; said processor partitioning said plurality of fielded documents into a plurality of disjoint clusters of fielded documents; said processor converting a first cluster of said plurality of disjoint clusters into a first inverted index of a plurality of inverted indices, wherein said first inverted index associates a first token comprised by said first cluster with a related subset of fielded documents of said first cluster, and wherein a fielded document of said related subset comprises said first token; said processor generating a set of fielded queries as a function of said plurality of inverted indices, wherein said set of fielded queries satisfies a set of conditions, and wherein a condition of the set of conditions is related to a parameter of the input query; and said processor selecting a set of candidate rules of said plurality of runtime rules as a function of said set of fielded queries and of said plurality of inverted indices, and wherein the number of candidate rules comprised by the set of candidate rules is reduced by the requirement that the set of fielded queries satisfy the condition of the set of conditions.
|
1. A method for the efficient selection of runtime rules for programmable search, said method comprising: a processor of a computer system translating a plurality of runtime rules into a plurality of fielded documents, wherein a first runtime rule of said plurality of runtime rules comprises a first rule pattern and a first rewrite pattern, wherein said first rule pattern comprises a first set of tokens of a plurality of tokens, and wherein a first fielded document of said plurality of fielded documents comprises said first set of tokens; said processor partitioning said plurality of fielded documents into a plurality of disjoint clusters of fielded documents; said processor converting a first cluster of said plurality of disjoint clusters into a first inverted index of a plurality of inverted indices, wherein said first inverted index associates a first token comprised by said first cluster with a related subset of fielded documents of said first cluster, and wherein a fielded document of said related subset comprises said first token; said processor generating a set of fielded queries as a function of said plurality of inverted indices, wherein said set of fielded queries satisfies a set of conditions, and wherein a condition of the set of conditions is related to a parameter of the input query; and said processor selecting a set of candidate rules of said plurality of runtime rules as a function of said set of fielded queries and of said plurality of inverted indices, and wherein the number of candidate rules comprised by the set of candidate rules is reduced by the requirement that the set of fielded queries satisfy the condition of the set of conditions. 4. The method of claim 1 , wherein a first fielded query of said set of fielded queries is associated with said input query and with said first inverted index, wherein said first fielded query comprises a first conditioned subset of concept tokens of said plurality of tokens, a second conditioned subset of term tokens of said plurality of tokens, and a third conditioned subset of variable tokens of said plurality of tokens, wherein said first conditioned subset is a subset of a set of concept tokens comprised by an intersection of said input query and said first inverted index, wherein said second conditioned subset is a subset of a set of term tokens comprised by an intersection of said input query and said first inverted index, and wherein said third conditioned subset is a subset of a set of variable tokens comprised by said first inverted index.
| 0.5 |
9,235,635 | 1 | 3 |
1. A computer-implemented method for identifying story trends, the method comprising: identifying a set of words in a fixed size data stream based on a subword cache; electronically determining at least one story trend associated with the set of words and electronically generating a story hash associated with the set of words; storing the story hash in a story trend cache and updating the story trend cache according to the story hash; and retrieving one or more popular story topics according to the story trend cache for presentation to a user.
|
1. A computer-implemented method for identifying story trends, the method comprising: identifying a set of words in a fixed size data stream based on a subword cache; electronically determining at least one story trend associated with the set of words and electronically generating a story hash associated with the set of words; storing the story hash in a story trend cache and updating the story trend cache according to the story hash; and retrieving one or more popular story topics according to the story trend cache for presentation to a user. 3. The method of claim 1 , wherein generating a story hash associated with the set of words comprises generating a SimHash based on the set of words.
| 0.777612 |
8,739,019 | 10 | 12 |
10. A computer-implemented method for presenting on a computer output device a news story, wherein said news story is presented at least primarily on a single electronic page, wherein said news story includes a primary body of text, wherein a user activates a scrolling-oriented electronic touch screen control to synchronize text presented within said news story to related media content presented, including visual imagery configured primarily to illustrate associated text in said news story, and wherein said scrolling-oriented electronic touch screen control commences displaying each successive presentation of said visual imagery automatically no later than effectively simultaneous to a reviewing of each associated text segment by said user, said computer-implemented method comprising: displaying on said computer output device a current presentation of said news story that is retrieved from a non-transitory computer-useable storage medium, wherein said current presentation at least includes a current segment of text from said primary body of text and at least one associated visual image; detecting through a computer processor a maneuvering by said user of said scrolling-oriented electronic touch screen control to choose a select next segment of text within said primary body of text; performing through said computer processor an operation responsive to said detecting of said maneuvering by said user of said scrolling-oriented electronic touch screen control to choose said select next segment of text, said operation causing a next media presentation to be retrieved from said non-transitory computer-useable storage medium, wherein said next media presentation includes displaying said select next segment of text and at least one changed component of related media content, wherein at least one of the changed components includes a continued, modified presentation of at least one of said at least one associated visual image on said single electronic page of said computer output device; displaying on said computer output device said next media presentation that includes said select next segment of text and said at least one changed component of related media content, wherein said changed component relates to said select next segment of text, wherein at least one of the changed components includes said continued, modified presentation of at least one of said at least one associated visual image relating to said select next segment of text, wherein said continued, modified presentation of at least one of said at least one associated visual image includes at least one visual enhancement presented on said single electronic page of said computer output device, and wherein said visual enhancement is a result of at least one of changing at least one associated camera's visual perspective of at least one depicted subject, zooming-in on at least one depicted subject, zooming-out on at least one depicted subject, panning across at least one depicted subject, moving at least one camera toward at least one depicted subject, and moving at least one camera away from at least one depicted subject; detecting through said computer processor a new maneuvering by said user of said scrolling-oriented electronic touch screen control to choose a new select next segment of text within said primary body of text; performing through said computer processor a new operation responsive to said detecting of said new maneuvering by said user of said scrolling-oriented electronic touch screen control to choose said new select next segment of text, said new operation causing a new next media presentation to be retrieved from said non-transitory computer-useable storage medium, wherein said new next media presentation includes displaying said new select next segment of text and at least one newly changed component of related media content on said single electronic page of said computer output device; displaying on said computer output device said new next media presentation that includes said new select next segment of text and said at least one newly changed component of related media content, wherein said at least one newly changed component relates to said new select next segment of text displayed on said single electronic page of said computer output device.
|
10. A computer-implemented method for presenting on a computer output device a news story, wherein said news story is presented at least primarily on a single electronic page, wherein said news story includes a primary body of text, wherein a user activates a scrolling-oriented electronic touch screen control to synchronize text presented within said news story to related media content presented, including visual imagery configured primarily to illustrate associated text in said news story, and wherein said scrolling-oriented electronic touch screen control commences displaying each successive presentation of said visual imagery automatically no later than effectively simultaneous to a reviewing of each associated text segment by said user, said computer-implemented method comprising: displaying on said computer output device a current presentation of said news story that is retrieved from a non-transitory computer-useable storage medium, wherein said current presentation at least includes a current segment of text from said primary body of text and at least one associated visual image; detecting through a computer processor a maneuvering by said user of said scrolling-oriented electronic touch screen control to choose a select next segment of text within said primary body of text; performing through said computer processor an operation responsive to said detecting of said maneuvering by said user of said scrolling-oriented electronic touch screen control to choose said select next segment of text, said operation causing a next media presentation to be retrieved from said non-transitory computer-useable storage medium, wherein said next media presentation includes displaying said select next segment of text and at least one changed component of related media content, wherein at least one of the changed components includes a continued, modified presentation of at least one of said at least one associated visual image on said single electronic page of said computer output device; displaying on said computer output device said next media presentation that includes said select next segment of text and said at least one changed component of related media content, wherein said changed component relates to said select next segment of text, wherein at least one of the changed components includes said continued, modified presentation of at least one of said at least one associated visual image relating to said select next segment of text, wherein said continued, modified presentation of at least one of said at least one associated visual image includes at least one visual enhancement presented on said single electronic page of said computer output device, and wherein said visual enhancement is a result of at least one of changing at least one associated camera's visual perspective of at least one depicted subject, zooming-in on at least one depicted subject, zooming-out on at least one depicted subject, panning across at least one depicted subject, moving at least one camera toward at least one depicted subject, and moving at least one camera away from at least one depicted subject; detecting through said computer processor a new maneuvering by said user of said scrolling-oriented electronic touch screen control to choose a new select next segment of text within said primary body of text; performing through said computer processor a new operation responsive to said detecting of said new maneuvering by said user of said scrolling-oriented electronic touch screen control to choose said new select next segment of text, said new operation causing a new next media presentation to be retrieved from said non-transitory computer-useable storage medium, wherein said new next media presentation includes displaying said new select next segment of text and at least one newly changed component of related media content on said single electronic page of said computer output device; displaying on said computer output device said new next media presentation that includes said new select next segment of text and said at least one newly changed component of related media content, wherein said at least one newly changed component relates to said new select next segment of text displayed on said single electronic page of said computer output device. 12. The computer-implemented method of claim 10 , wherein said at least one associated visual image includes a video.
| 0.55 |
8,775,162 | 8 | 9 |
8. A method in accordance with claim 1 wherein: the output communication indicates that an action should be taken.
|
8. A method in accordance with claim 1 wherein: the output communication indicates that an action should be taken. 9. A method in accordance with claim 8 wherein: the action includes modification of the communication of the person.
| 0.5 |
7,801,899 | 1 | 14 |
1. A machine-implemented method comprising: receiving a request for keyword suggestions, the request including a seed keyword with which the keyword suggestions are to be generated; accepting, from two or more keyword suggestion tools, at least two heterogeneous sets of keyword suggestions for an online advertisement, wherein each set of keyword suggestions includes targeting keyword suggestions that are ranked and scored by a keyword suggestion tool that suggested the set of keyword suggestions, and wherein targeting keyword suggestions in each set of targeting keyword suggestions have been generated based on the seed keyword; for each heterogeneous sets of keyword suggestions accepted from the at least two or more keyword suggestion tools, determining, by one or more processors, a new normalized score for each of the targeting keyword suggestions in the heterogeneous set of keyword suggestions, wherein the new normalized score is computed based on a cardinal aspect of the targeting keyword suggestion and an ordinal aspect of the targeting keyword suggestion in the heterogeneous set of keyword suggestions, the cardinal aspect representing an absolute score corresponding to the targeting keyword suggestion and the ordinal aspect representing a rank of the targeting keyword suggestion in the heterogeneous set of keyword suggestions, and wherein the new normalized score for each targeting keyword suggestion in a particular set of heterogeneous keyword suggestions is defined as a sum of a first weight multiplied by the cardinal aspect and a second weight multiplied by the ordinal aspect; generating, by the one or more processors, an adjusted new score for each targeting keyword suggestion based on a result of a function of a new normalized score corresponding to the targeting keyword suggestion and trust factor of a keyword suggestion tool from which the targeting keyword was accepted, the trust factor representing a measure of reliability of the keyword suggestion tool; combining, by the one or more processors, the targeting keyword suggestions scored by a first keyword suggestion tool selected from the at least two or more keyword suggestion tools and the targeting keyword suggestions scored by a second suggestion tool selected from the at least two or more keyword suggestion tools using the new scores to generate a combined set of ordered and scored suggestions according to the adjusted new score for each targeting keyword suggestion; and providing the combined set of keyword suggestions to a user device.
|
1. A machine-implemented method comprising: receiving a request for keyword suggestions, the request including a seed keyword with which the keyword suggestions are to be generated; accepting, from two or more keyword suggestion tools, at least two heterogeneous sets of keyword suggestions for an online advertisement, wherein each set of keyword suggestions includes targeting keyword suggestions that are ranked and scored by a keyword suggestion tool that suggested the set of keyword suggestions, and wherein targeting keyword suggestions in each set of targeting keyword suggestions have been generated based on the seed keyword; for each heterogeneous sets of keyword suggestions accepted from the at least two or more keyword suggestion tools, determining, by one or more processors, a new normalized score for each of the targeting keyword suggestions in the heterogeneous set of keyword suggestions, wherein the new normalized score is computed based on a cardinal aspect of the targeting keyword suggestion and an ordinal aspect of the targeting keyword suggestion in the heterogeneous set of keyword suggestions, the cardinal aspect representing an absolute score corresponding to the targeting keyword suggestion and the ordinal aspect representing a rank of the targeting keyword suggestion in the heterogeneous set of keyword suggestions, and wherein the new normalized score for each targeting keyword suggestion in a particular set of heterogeneous keyword suggestions is defined as a sum of a first weight multiplied by the cardinal aspect and a second weight multiplied by the ordinal aspect; generating, by the one or more processors, an adjusted new score for each targeting keyword suggestion based on a result of a function of a new normalized score corresponding to the targeting keyword suggestion and trust factor of a keyword suggestion tool from which the targeting keyword was accepted, the trust factor representing a measure of reliability of the keyword suggestion tool; combining, by the one or more processors, the targeting keyword suggestions scored by a first keyword suggestion tool selected from the at least two or more keyword suggestion tools and the targeting keyword suggestions scored by a second suggestion tool selected from the at least two or more keyword suggestion tools using the new scores to generate a combined set of ordered and scored suggestions according to the adjusted new score for each targeting keyword suggestion; and providing the combined set of keyword suggestions to a user device. 14. The machine-implemented method of claim 1 further comprising: for each of the at least two sets of keyword suggestions, and for each new normalized score for each of the keyword suggestions of the heterogeneous set of keyword suggestions, adjusting the new normalized score to generate an adjusted new score so that a sum of the adjusted new score for each of the sets equals one.
| 0.531707 |
8,892,549 | 26 | 32 |
26. The program product of claim 24 , further operable to cause data processing apparatus to perform operations comprising: identifying the plurality of topics from a corpus of documents.
|
26. The program product of claim 24 , further operable to cause data processing apparatus to perform operations comprising: identifying the plurality of topics from a corpus of documents. 32. The system of claim 26 , where determining the topic score for the topic with respect to the document includes determining the topic score based on features of occurrence of the topic in the document.
| 0.693694 |
7,747,648 | 11 | 12 |
11. A computer-implemented method for providing information to a user, the method comprising: defining in a data store, a plurality of interrelated entity models for a plurality of different categories, each of the entity models being associated with one of the plurality different categories, the categories including two or more of: a person, a business, a place, tangible things, communities, thoughts and events, the entity models containing information defining relationships between other entity models of different categories about a corresponding one of a plurality of entities; defining, in the data store, each entity model further having core data that defines each entity being modeled including the name of the entity, a category label, a unique entity identifier and a manager identifier, the entity model further including content section data that includes media content links to audio or video clips relating to the entity, web log content links to web log entries that discuss the entity or are authored by a writer associated with the entity, the entity model further includes a feedback section that stores evaluative information about the entity contributed to the entity model by at least one outside party providing an experience feedback, the entity model further including interrelated entity data to store feedback related to a corresponding entity of the same category; associating with each of the plurality of entity models in the data store a communication channel for initiating direct electronic communication with a manager responsible for that one of the plurality of entity models, wherein the direct electronic communication comprises the identifier of the manager together with the information contained in the requested one of the plurality of entity models; receiving, at a world server, a user request for an entity model; returning, by the world server, the information contained in the requested one of the plurality of entity models including related entity models based on defined relationships to entity models of different categories; and executing a set of instructions executed on a processor, wherein executing the set of instructions performs the steps of: automatically enabling the user to access the communication channel associated with the requested entity model and returning the identifier of the manager together with the information contained in the requested one of the plurality of entity models.
|
11. A computer-implemented method for providing information to a user, the method comprising: defining in a data store, a plurality of interrelated entity models for a plurality of different categories, each of the entity models being associated with one of the plurality different categories, the categories including two or more of: a person, a business, a place, tangible things, communities, thoughts and events, the entity models containing information defining relationships between other entity models of different categories about a corresponding one of a plurality of entities; defining, in the data store, each entity model further having core data that defines each entity being modeled including the name of the entity, a category label, a unique entity identifier and a manager identifier, the entity model further including content section data that includes media content links to audio or video clips relating to the entity, web log content links to web log entries that discuss the entity or are authored by a writer associated with the entity, the entity model further includes a feedback section that stores evaluative information about the entity contributed to the entity model by at least one outside party providing an experience feedback, the entity model further including interrelated entity data to store feedback related to a corresponding entity of the same category; associating with each of the plurality of entity models in the data store a communication channel for initiating direct electronic communication with a manager responsible for that one of the plurality of entity models, wherein the direct electronic communication comprises the identifier of the manager together with the information contained in the requested one of the plurality of entity models; receiving, at a world server, a user request for an entity model; returning, by the world server, the information contained in the requested one of the plurality of entity models including related entity models based on defined relationships to entity models of different categories; and executing a set of instructions executed on a processor, wherein executing the set of instructions performs the steps of: automatically enabling the user to access the communication channel associated with the requested entity model and returning the identifier of the manager together with the information contained in the requested one of the plurality of entity models. 12. The method of claim 11 wherein enabling the user to access the communication channel includes: providing to the user a form for entry of input to be communicated; receiving input from the user via the form; and transmitting the received input to the manager via the communication channel.
| 0.581662 |
9,177,540 | 1 | 5 |
1. A method of conforming an audio input to a musical key, the method comprising: receiving an audio input; determining a musical key of the audio input; sequentially for each consecutive note of the audio input, determining a pitch value for a preceding note and a subsequent note and an interval between the preceding note and the subsequent note of the audio input, selecting a plurality of alternative subsequent notes for each subsequent note based on the determined musical key and the determined pitch value of the subsequent note, scoring each interval between each alternative subsequent note and each respective note of a selected plurality of alternative subsequent notes corresponding to the preceding note based on the interval between the preceding note and the subsequent note of the audio input, selecting a best interval for each alternative subsequent note based on the scored intervals, and selecting a best-match note for each note of the audio input based on the best intervals of all of the plurality of notes of the audio input; and conforming each note of the audio input to a frequency of each respective best-match note.
|
1. A method of conforming an audio input to a musical key, the method comprising: receiving an audio input; determining a musical key of the audio input; sequentially for each consecutive note of the audio input, determining a pitch value for a preceding note and a subsequent note and an interval between the preceding note and the subsequent note of the audio input, selecting a plurality of alternative subsequent notes for each subsequent note based on the determined musical key and the determined pitch value of the subsequent note, scoring each interval between each alternative subsequent note and each respective note of a selected plurality of alternative subsequent notes corresponding to the preceding note based on the interval between the preceding note and the subsequent note of the audio input, selecting a best interval for each alternative subsequent note based on the scored intervals, and selecting a best-match note for each note of the audio input based on the best intervals of all of the plurality of notes of the audio input; and conforming each note of the audio input to a frequency of each respective best-match note. 5. The method of claim 1 , wherein each interval is determined based on midi pitch range.
| 0.902626 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.