sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
31. A method for generating in an information processing machine at least one abstract that is useful during information searching and retrieval procedures, comprising: 1. sensing by said machine information signals representative of information comprising individual words in a selected language, each word comprising one of more individual character; 2. developing in said machine, signals representative of characters in said system; 3. categorizing in said machine, selected ones only of the individual character signals into predefined character groups that are based on a probability distribution of the characters represented by said signals in the language selected; 4. maintaining an abstract count by said machine of the number of character signals categorized into each of said predefined character groups; and 5. storing said abstract count in said machine as an abstract of said information.
|
31. A method for generating in an information processing machine at least one abstract that is useful during information searching and retrieval procedures, comprising: 1. sensing by said machine information signals representative of information comprising individual words in a selected language, each word comprising one of more individual character; 2. developing in said machine, signals representative of characters in said system; 3. categorizing in said machine, selected ones only of the individual character signals into predefined character groups that are based on a probability distribution of the characters represented by said signals in the language selected; 4. maintaining an abstract count by said machine of the number of character signals categorized into each of said predefined character groups; and 5. storing said abstract count in said machine as an abstract of said information. 39. The method of claim 31 further comprising: 6. developing in said machine abstract count signals from said abstract count, and 7. transferring by said machine information signals and abstract count signals between said machine and a record medium.
| 0.741417 |
1. A computer-implemented method for searching or information, comprising: under control of one or more computer systems configured with executable instructions, receiving a query from a user, the query requesting a search to be performed based at least in part on at least one image that has been captured by a digital camera of a mobile device, the at least one image being included in the query: processing the at least one image to detect at least one portion of the image including text information and to determine boundary information for the at least one portion; analyzing the at least one portion of the image based at least in part on the boundary information to recognize one or more words in the text information; searching one or more databases to identify one or more matching entries related to the one or more words obtained from the at least one image included in the query, wherein the one or more words are in a first language, and the one or more matching entries comprise one or more words in a second language that are translations of the one or more words in the first language; ranking the one or more matching entries based at least in part upon weighted combinations of scores for each of the one or more matching entries in the one or more databases; and providing information relating to at least a selected portion of the one or more matching entries to the user in response to the query, the selected portion being based at least in part upon the ranking of the one or more matching entries.
|
1. A computer-implemented method for searching or information, comprising: under control of one or more computer systems configured with executable instructions, receiving a query from a user, the query requesting a search to be performed based at least in part on at least one image that has been captured by a digital camera of a mobile device, the at least one image being included in the query: processing the at least one image to detect at least one portion of the image including text information and to determine boundary information for the at least one portion; analyzing the at least one portion of the image based at least in part on the boundary information to recognize one or more words in the text information; searching one or more databases to identify one or more matching entries related to the one or more words obtained from the at least one image included in the query, wherein the one or more words are in a first language, and the one or more matching entries comprise one or more words in a second language that are translations of the one or more words in the first language; ranking the one or more matching entries based at least in part upon weighted combinations of scores for each of the one or more matching entries in the one or more databases; and providing information relating to at least a selected portion of the one or more matching entries to the user in response to the query, the selected portion being based at least in part upon the ranking of the one or more matching entries. 8. The method of claim 1 , wherein the one or more words correspond to a street sign or a store sign.
| 0.590371 |
3. The information processing apparatus of claim 2 , wherein the CPU is further configured to receive document information associated with the electronic document.
|
3. The information processing apparatus of claim 2 , wherein the CPU is further configured to receive document information associated with the electronic document. 4. The information processing apparatus of claim 3 , wherein: the document information comprises a location of the displayed content within the electronic document.
| 0.922952 |
9. A server device, comprising: a memory to store a word repository including a plurality of key words; and a processor to: transmit a call, receive a ring tone signal based on the call, receive an indication that the call was answered, the indication including initial speech from an answering party, and the answering party including a user or a user device, perform a ring tone operation to determine a user ring tone factor and a device ring tone factor based on a duration of the ring tone signal, perform an initial speech operation to determine a user speech factor and a device speech factor based on a duration of the initial speech, determine whether one or more words, contained in the initial speech, are included among the plurality of key words in the word repository, perform a confidence operation to determine a user confidence factor and a device confidence factor based on whether the one or more words are included among the plurality of key words in the word repository, determine a total user factor by combining the user ring tone factor, the user speech factor, and the user confidence factor, determine a total device factor by combining the device ring tone factor, the device speech factor, and the device confidence factor, determine that the answering party is the user device when the total user factor is less than the total device factor, and output, to the user device, a non-interactive message when the answering party is determined to be the user device.
|
9. A server device, comprising: a memory to store a word repository including a plurality of key words; and a processor to: transmit a call, receive a ring tone signal based on the call, receive an indication that the call was answered, the indication including initial speech from an answering party, and the answering party including a user or a user device, perform a ring tone operation to determine a user ring tone factor and a device ring tone factor based on a duration of the ring tone signal, perform an initial speech operation to determine a user speech factor and a device speech factor based on a duration of the initial speech, determine whether one or more words, contained in the initial speech, are included among the plurality of key words in the word repository, perform a confidence operation to determine a user confidence factor and a device confidence factor based on whether the one or more words are included among the plurality of key words in the word repository, determine a total user factor by combining the user ring tone factor, the user speech factor, and the user confidence factor, determine a total device factor by combining the device ring tone factor, the device speech factor, and the device confidence factor, determine that the answering party is the user device when the total user factor is less than the total device factor, and output, to the user device, a non-interactive message when the answering party is determined to be the user device. 12. The server device of claim 9 , where, when determining whether the one or more words, contained in the initial speech, are included among the plurality of key words in the word repository, the processor is to: perform a speech recognition operation, on the initial speech, to obtain the one or more words from the initial speech, compare the one or more words with the plurality of key words in the word repository, and allocate a confidence level to the initial speech based on the comparing of the one or more words to the plurality of key words in the word repository.
| 0.507261 |
7. A computer software product for modeling, including a computer storage medium in which computer program instructions are stored, which instructions, when executed by a computer, cause the computer to perform the steps of: using a domain specific modeling language to prepare a first model of a subject, the subject having variants, said first model comprising elements, wherein; creating a second model of the subject that comprises a variability layer having variability elements, the variability elements having respective configuration conditions linked thereto, the configuration conditions comprising Boolean expressions, adding the second model to the first model as a separate layer on the first model to thereby produce a combined model by attaching said variability elements to at least a portion of said elements of said first model, wherein the elements of the first model are unchanged by the step of adding the second model; implementing an instance of the combined model by assigning respective constraint values to the configuration conditions; making respective evaluations of the configuration conditions of said variability elements in the instance of the combined model; and classifying said variability elements for inclusion in different ones of said variants responsively to the respective evaluations of said configuration conditions.
|
7. A computer software product for modeling, including a computer storage medium in which computer program instructions are stored, which instructions, when executed by a computer, cause the computer to perform the steps of: using a domain specific modeling language to prepare a first model of a subject, the subject having variants, said first model comprising elements, wherein; creating a second model of the subject that comprises a variability layer having variability elements, the variability elements having respective configuration conditions linked thereto, the configuration conditions comprising Boolean expressions, adding the second model to the first model as a separate layer on the first model to thereby produce a combined model by attaching said variability elements to at least a portion of said elements of said first model, wherein the elements of the first model are unchanged by the step of adding the second model; implementing an instance of the combined model by assigning respective constraint values to the configuration conditions; making respective evaluations of the configuration conditions of said variability elements in the instance of the combined model; and classifying said variability elements for inclusion in different ones of said variants responsively to the respective evaluations of said configuration conditions. 8. The computer software product according to claim 7 , wherein said variability elements of the second model comprise at least one of an optional variability element, which is included in the variants only when the respective configuration condition linked thereto evaluates to a Boolean value True; alternative variability elements, wherein exactly one of the alternative variability elements is included in the variants when the configuration condition linked thereto evaluates to the Boolean value True; selective variability elements, wherein zero or more of the selective variability elements are included in the variants when the respective configuration condition linked thereto evaluates to the Boolean value True; cardinality-based selective variability elements cardinality upper bound, wherein a number of the cardinality-based selective variability elements are included in the variants when the respective configuration condition linked thereto evaluates to the Boolean value True, and wherein the number is no greater than the cardinality upper bound; and mutually inclusive variability elements, wherein a set of the mutually inclusive variability elements are included in the variants, the set being selected from a first subset consisting of none of the mutually inclusive variability elements and a second subset consisting of all of the mutually inclusive variability elements.
| 0.508777 |
5. The system of claim 1 , wherein the at least one user comprises a group of one or more users; and wherein the at least one access right associated with the library permission policy identify each user of the group.
|
5. The system of claim 1 , wherein the at least one user comprises a group of one or more users; and wherein the at least one access right associated with the library permission policy identify each user of the group. 6. The system of claim 5 , wherein the group is an organization.
| 0.961477 |
8. A non-transitory computer readable medium including instructions that, when executed by a processor, cause the processor to perform an operation comprising: parsing a character string associated with the suspected domain name of the suspected domain to identify a character in the character string that has a known likelihood of being deceptively substituted for a corresponding legitimate character in a legitimate domain name of the legitimate domain wherein the generating comprising substituting the identified character with the corresponding legitimate character generating an alternate domain name from a suspected domain name; submitting the alternate domain name to a domain name server for resolution; when the alternate domain name is resolved, assigning, a first non-zero likelihood that the suspected domain name is a counterfeit of the legitimate domain; retrieving, by the processor, a first webpage associated with the suspected domain name; retrieving, by the processor, a second webpage associated with the alternate domain name corresponding to the first web page associated with the suspected domain name; computing similarity between a first webpage associated with the suspected domain name and a second webpage associated with the alternate domain name, wherein the second webpage corresponds to the first web page associated with the suspected domain name; in response to the computing, assigning, a processor, a second non-zero likelihood that the suspected domain name is a counterfeit of the legitimate domain, wherein the second non-zero likelihood is greater than the first non-zero likelihood: determining that the first webpage comprises a request for input of personal information; and in response to the determining, assigning, by the processor, a third non-zero likelihood that the suspected domain is a counterfeit of the legitimate domain, wherein the third non-zero likelihood is greater than the second non-zero likelihood.
|
8. A non-transitory computer readable medium including instructions that, when executed by a processor, cause the processor to perform an operation comprising: parsing a character string associated with the suspected domain name of the suspected domain to identify a character in the character string that has a known likelihood of being deceptively substituted for a corresponding legitimate character in a legitimate domain name of the legitimate domain wherein the generating comprising substituting the identified character with the corresponding legitimate character generating an alternate domain name from a suspected domain name; submitting the alternate domain name to a domain name server for resolution; when the alternate domain name is resolved, assigning, a first non-zero likelihood that the suspected domain name is a counterfeit of the legitimate domain; retrieving, by the processor, a first webpage associated with the suspected domain name; retrieving, by the processor, a second webpage associated with the alternate domain name corresponding to the first web page associated with the suspected domain name; computing similarity between a first webpage associated with the suspected domain name and a second webpage associated with the alternate domain name, wherein the second webpage corresponds to the first web page associated with the suspected domain name; in response to the computing, assigning, a processor, a second non-zero likelihood that the suspected domain name is a counterfeit of the legitimate domain, wherein the second non-zero likelihood is greater than the first non-zero likelihood: determining that the first webpage comprises a request for input of personal information; and in response to the determining, assigning, by the processor, a third non-zero likelihood that the suspected domain is a counterfeit of the legitimate domain, wherein the third non-zero likelihood is greater than the second non-zero likelihood. 15. The non-transitory computer readable medium of claim 8 wherein the personal information comprises one or more of a username, a password, a credit card number, an account number, a date of birth, a social security number, and a full name.
| 0.524368 |
16. A non-transitory medium, readable through a processor communicatively coupled to a memory and comprising instructions embodied therein that are executable through the processor, comprising: instructions to generate a data profile comprising a set of characteristics captured at various granularities of an initial result set generated from an initial query using the processor and the memory; instructions to determine what a user expects in at least one of the initial result set of the initial query and a subsequent result set of a subsequent query based on one of the data profile and a heuristically estimated data profile; instructions to enable the user to evaluate a semantic accuracy of the subsequent query based on a likely expectation of the user as determined through the set of characteristics of the data profile; instructions to determine a match ratio between the subsequent query and the initial query; and instructions to present at least some of the set of characteristics of the data profile to the user based on the match ratio through the query editor.
|
16. A non-transitory medium, readable through a processor communicatively coupled to a memory and comprising instructions embodied therein that are executable through the processor, comprising: instructions to generate a data profile comprising a set of characteristics captured at various granularities of an initial result set generated from an initial query using the processor and the memory; instructions to determine what a user expects in at least one of the initial result set of the initial query and a subsequent result set of a subsequent query based on one of the data profile and a heuristically estimated data profile; instructions to enable the user to evaluate a semantic accuracy of the subsequent query based on a likely expectation of the user as determined through the set of characteristics of the data profile; instructions to determine a match ratio between the subsequent query and the initial query; and instructions to present at least some of the set of characteristics of the data profile to the user based on the match ratio through the query editor. 26. The non-transitory medium of claim 16 , further comprising: instructions to generate a sample database having an identical schema as that of an original database using a database sampler module, wherein the sample database comprises a potentially biased random sample of all relations with a reduced set of data, and instructions to execute the subsequent query efficiently through the use of the sample database to enable the user reduce a time in debugging the subsequent query.
| 0.54707 |
2. The method of claim 1 , wherein the GUI comprises a decision table interface for creating the business rule, the decision table interface including a first column associated with the input variable of the business rule and a second column associated with the action required by the business rule.
|
2. The method of claim 1 , wherein the GUI comprises a decision table interface for creating the business rule, the decision table interface including a first column associated with the input variable of the business rule and a second column associated with the action required by the business rule. 3. The method of claim 2 , wherein receiving the input comprises: receiving a selection of a data object corresponding to the input variable of the business rule to assign to the first column; and receiving a selection of a data object corresponding to the action required by the business rule to assign to the second column.
| 0.853846 |
9. A computer debugging system comprising: a diagramming member configured to form a diagram illustrating class relationships between objects at runtime by generating a class relationship diagram of a subject object from a dynamic computer language, the diagramming member effectively diagramming class relationships of the subject objects, the subject object in the dynamic computer language having an anonymous nature limiting visualization of objects' runtime relationships, wherein the dynamic computer language makes no distinction between function definition and method definition except for during function calling, and wherein the subject object in the dynamic computer language is integrated and loosely typed such that the subject object is able to be hosted in various environments, wherein the generated class relationship diagram shows class relationships between the subject object and objects that the subject object contains or inherits from, said class relationships being distinct from parent-child dependency; wherein the diagramming member forms the diagram by: traversing an inheritance chain of the subject object; for each level in the inheritance chain, reading methods of inherited objects; adding the read methods to the subject object as dynamically generated; and a display unit displaying on output to a user the generated class relationship diagram as the formed diagram.
|
9. A computer debugging system comprising: a diagramming member configured to form a diagram illustrating class relationships between objects at runtime by generating a class relationship diagram of a subject object from a dynamic computer language, the diagramming member effectively diagramming class relationships of the subject objects, the subject object in the dynamic computer language having an anonymous nature limiting visualization of objects' runtime relationships, wherein the dynamic computer language makes no distinction between function definition and method definition except for during function calling, and wherein the subject object in the dynamic computer language is integrated and loosely typed such that the subject object is able to be hosted in various environments, wherein the generated class relationship diagram shows class relationships between the subject object and objects that the subject object contains or inherits from, said class relationships being distinct from parent-child dependency; wherein the diagramming member forms the diagram by: traversing an inheritance chain of the subject object; for each level in the inheritance chain, reading methods of inherited objects; adding the read methods to the subject object as dynamically generated; and a display unit displaying on output to a user the generated class relationship diagram as the formed diagram. 11. A computer system as claimed in claim 9 wherein the diagramming member forms the diagram by drawing the diagram using graph notation.
| 0.592593 |
2. A method, executed on one or more processors, comprising the steps of: displaying a plurality of recipient databases for enabling a user to select a recipient database, the recipient databases at least comprising contact names associated with elected offices and profiles of the contact names; displaying contact names contained within a selected recipient database for enabling the user to select at least one contact name from the recipient database to receive a message; displaying a profile associated with a selected contact name; displaying a plurality of communication templates for enabling the user to select a communication template for generating the message; displaying a selected communication template for editing by the user; and displaying a plurality of delivery options for enabling the user to select a delivery option for the message; displaying a plurality of formatting options for a selected delivery option of printing the message, the formatting options being based, at least in part, on envelope types for the printed message; and displaying an option of saving the message in which the message is saved on the user's local non-transitory storage device.
|
2. A method, executed on one or more processors, comprising the steps of: displaying a plurality of recipient databases for enabling a user to select a recipient database, the recipient databases at least comprising contact names associated with elected offices and profiles of the contact names; displaying contact names contained within a selected recipient database for enabling the user to select at least one contact name from the recipient database to receive a message; displaying a profile associated with a selected contact name; displaying a plurality of communication templates for enabling the user to select a communication template for generating the message; displaying a selected communication template for editing by the user; and displaying a plurality of delivery options for enabling the user to select a delivery option for the message; displaying a plurality of formatting options for a selected delivery option of printing the message, the formatting options being based, at least in part, on envelope types for the printed message; and displaying an option of saving the message in which the message is saved on the user's local non-transitory storage device. 9. The method as recited in claim 2 , wherein one of said plurality of delivery options comprises automatic emailing of the message to the selected contact name.
| 0.541543 |
18. An apparatus comprising: a set of processing units; and a machine readable medium storing a program which when executed by at least one processing unit analyzes a document, the program comprising sets of instructions for: receiving a document that comprises a plurality of primitive graphic elements defined separately within the document; based on values calculated for pairs of primitive graphic elements, defining a set of successive primitive graphic elements; when bounds of primitive graphic elements in the set of successive primitive graphic elements at least partially overlap each other, identifying overlapping primitive graphic elements as subsets of primitive graphic elements within the set of successive primitive elements; calculating, for each of the subsets that have one or more primitive graphic elements, a total spread using bounds of the one or more primitive graphic elements and dimensions of a page containing the primitive graphic elements; and for each of the subsets that have one or more primitive graphic elements and that have a total spread less than a predetermined value, defining a single structural graphic element within the document, the single structural graphic element comprising the primitive graphic elements in the subset.
|
18. An apparatus comprising: a set of processing units; and a machine readable medium storing a program which when executed by at least one processing unit analyzes a document, the program comprising sets of instructions for: receiving a document that comprises a plurality of primitive graphic elements defined separately within the document; based on values calculated for pairs of primitive graphic elements, defining a set of successive primitive graphic elements; when bounds of primitive graphic elements in the set of successive primitive graphic elements at least partially overlap each other, identifying overlapping primitive graphic elements as subsets of primitive graphic elements within the set of successive primitive elements; calculating, for each of the subsets that have one or more primitive graphic elements, a total spread using bounds of the one or more primitive graphic elements and dimensions of a page containing the primitive graphic elements; and for each of the subsets that have one or more primitive graphic elements and that have a total spread less than a predetermined value, defining a single structural graphic element within the document, the single structural graphic element comprising the primitive graphic elements in the subset. 19. The apparatus of claim 18 , wherein the set of instructions for identifying overlapping primitive graphic elements as subsets of primitive graphic elements comprises sets of instructions for: selecting a first graphic element in the set and assigning the graphic element to a new subset; assigning a second graphic element in the set to the new subset when a bounding box of the second graphic element overlaps a bounding box of the new subset.
| 0.536012 |
1. A method for modifying computer mediated communications, the method comprising: at a computer system including one or more processors and memory: receiving input video data from a digital camera, the input video data including a first segment of the input video data corresponding to recorded non-verbal behavior of a first participant in a computer mediated communication; generating a first portion of an output stream of video data, wherein generating the first portion of the output stream of video data includes: comparing the recorded non-verbal behavior to a predefined behavioral model, wherein the behavioral model defines behavioral parameters; and in accordance with a determination that the recorded non-verbal behavior is inconsistent with the behavioral model, determining alternative behavior that is consistent with the behavioral model; and including the alternative behavior in the first portion of the output stream of video data in place of behavior representative of the recorded non-verbal behavior in the respective video segment; and transmitting the output stream of video data to a second participant in the computer mediated communication.
|
1. A method for modifying computer mediated communications, the method comprising: at a computer system including one or more processors and memory: receiving input video data from a digital camera, the input video data including a first segment of the input video data corresponding to recorded non-verbal behavior of a first participant in a computer mediated communication; generating a first portion of an output stream of video data, wherein generating the first portion of the output stream of video data includes: comparing the recorded non-verbal behavior to a predefined behavioral model, wherein the behavioral model defines behavioral parameters; and in accordance with a determination that the recorded non-verbal behavior is inconsistent with the behavioral model, determining alternative behavior that is consistent with the behavioral model; and including the alternative behavior in the first portion of the output stream of video data in place of behavior representative of the recorded non-verbal behavior in the respective video segment; and transmitting the output stream of video data to a second participant in the computer mediated communication. 7. The method of claim 1 , further comprising, after transmitting the first portion of the output stream to the second participant: comparing subsequent recorded non-verbal behavior in a second segment of the input video data to the behavioral model; and in accordance with a determination that the subsequent recorded non-verbal behavior is consistent with the behavioral model, transmitting, to the second participant, a second portion of the output stream based on the second segment of video image, wherein the second portion of the output stream includes behavior representative of the subsequent recorded non-verbal behavior.
| 0.556137 |
1. A voice recognition system comprising: a plurality of voice activated modules for receiving voice recognition results representing voice inputs from a user and taking actions in response to the voice inputs; a voice recognition module for receiving voice inputs from a user and performing voice recognition on the voice inputs, performing voice recognition on a voice input comprising identifying members of a collection of elements representing potential matches to the voice input, the voice recognition module being operative to prepare a list of potential voice recognition results for a voice input under consideration, each of the potential voice recognition results representing a candidate for a result matching the voice input received from the user and having an associated confidence level; a results postprocessor for processing the list of potential voice recognition results to improve speed and accuracy of voice recognition, the results postprocessor being operative to make changes to the list based on information relating to past results of recognition attempts in order to associate a higher priority with members of the list having a higher likelihood of matching the voice input under consideration as indicated by the past results of recognition attempts; and wherein the processing of the list of potential voice recognition results comprises comparing the associated confidence levels of the potential voice recognition results to an upper threshold and a lower threshold, wherein the potential voice recognition results are kept if the associated confidence levels are above the upper threshold, the potential voice recognition results are not kept if the associated confidence levels are below the lower threshold, and potential voice recognition results with associated confidence levels between the upper threshold and the lower threshold are only kept if they match any of the past results of recognition attempts.
|
1. A voice recognition system comprising: a plurality of voice activated modules for receiving voice recognition results representing voice inputs from a user and taking actions in response to the voice inputs; a voice recognition module for receiving voice inputs from a user and performing voice recognition on the voice inputs, performing voice recognition on a voice input comprising identifying members of a collection of elements representing potential matches to the voice input, the voice recognition module being operative to prepare a list of potential voice recognition results for a voice input under consideration, each of the potential voice recognition results representing a candidate for a result matching the voice input received from the user and having an associated confidence level; a results postprocessor for processing the list of potential voice recognition results to improve speed and accuracy of voice recognition, the results postprocessor being operative to make changes to the list based on information relating to past results of recognition attempts in order to associate a higher priority with members of the list having a higher likelihood of matching the voice input under consideration as indicated by the past results of recognition attempts; and wherein the processing of the list of potential voice recognition results comprises comparing the associated confidence levels of the potential voice recognition results to an upper threshold and a lower threshold, wherein the potential voice recognition results are kept if the associated confidence levels are above the upper threshold, the potential voice recognition results are not kept if the associated confidence levels are below the lower threshold, and potential voice recognition results with associated confidence levels between the upper threshold and the lower threshold are only kept if they match any of the past results of recognition attempts. 2. The system of claim 1 , wherein the results postprocessor is further operative to make changes to the list based on previously stored information relating to expected user actions.
| 0.5 |
56. The method of claim 26 , wherein determining the first intent associated with the first candidate substring and the second intent associated with the second candidate substring comprises: determining the first intent or the second intent based on information displayed on a display associated with the electronic device.
|
56. The method of claim 26 , wherein determining the first intent associated with the first candidate substring and the second intent associated with the second candidate substring comprises: determining the first intent or the second intent based on information displayed on a display associated with the electronic device. 59. The method of claim 56 , wherein the information comprises one or more emails.
| 0.95704 |
14. The non-transitory computer-readable medium of claim 13 , wherein the third group of user-selectable elements, when displayed for the second user, includes elements from the first group of elements that include the access right granting access to the second user.
|
14. The non-transitory computer-readable medium of claim 13 , wherein the third group of user-selectable elements, when displayed for the second user, includes elements from the first group of elements that include the access right granting access to the second user. 15. The non-transitory computer-readable medium of claim 14 , wherein the elements include a visual distinctive feature indicative of the access right.
| 0.911341 |
4. A non-transitory program storage device in which is stored computer readable instructions for generating a markup language delta file representing contents of three or more markup language source files whenever an element type of a root element of each of the three or more markup language source files is the same, the computer readable instructions comprising: a) instructions for accessing three or more markup language source files and determining that the element type of the root element of each of the three or more markup language source files is the same, where elements of the same type are elements with the same name and namespace; b) instructions for creating and storing in a data storage device a delta file with a root element of the same type as the root element of the three or more markup language source files; c) instructions for recording in the delta file stored in the data storage device information about all non-common contents of the three or more markup language source files which is not common to all the source files, wherein for the non-common content every element in the source files has a corresponding element of the same type recorded in the delta file and ancestor elements have corresponding ancestor elements of the same type recorded in the delta file up to and including the root element, for every two elements that are siblings in a source file corresponding elements that are siblings are recorded in the delta file, and all text nodes directly or indirectly within a source file element have corresponding text nodes contained directly or indirectly within the corresponding delta file element; d) instructions for determining for every subtree in the source files whether or not a common subtree is present in at least one of the other source files; and e) instructions for recording in the delta file stored in the data storage device common subtrees as equal whereby any attribute, text string or subtree that is present and the same in all of the markup language source files is present in the delta file only once in exactly the same format as the attribute, text string or subtree appeared in the source files and any one of the source files is extractable from the delta file and when a source file is removed from the delta file, the information remaining in the resulting delta file remains true with respect to at least step c) and step e) for the remaining markup language source files.
|
4. A non-transitory program storage device in which is stored computer readable instructions for generating a markup language delta file representing contents of three or more markup language source files whenever an element type of a root element of each of the three or more markup language source files is the same, the computer readable instructions comprising: a) instructions for accessing three or more markup language source files and determining that the element type of the root element of each of the three or more markup language source files is the same, where elements of the same type are elements with the same name and namespace; b) instructions for creating and storing in a data storage device a delta file with a root element of the same type as the root element of the three or more markup language source files; c) instructions for recording in the delta file stored in the data storage device information about all non-common contents of the three or more markup language source files which is not common to all the source files, wherein for the non-common content every element in the source files has a corresponding element of the same type recorded in the delta file and ancestor elements have corresponding ancestor elements of the same type recorded in the delta file up to and including the root element, for every two elements that are siblings in a source file corresponding elements that are siblings are recorded in the delta file, and all text nodes directly or indirectly within a source file element have corresponding text nodes contained directly or indirectly within the corresponding delta file element; d) instructions for determining for every subtree in the source files whether or not a common subtree is present in at least one of the other source files; and e) instructions for recording in the delta file stored in the data storage device common subtrees as equal whereby any attribute, text string or subtree that is present and the same in all of the markup language source files is present in the delta file only once in exactly the same format as the attribute, text string or subtree appeared in the source files and any one of the source files is extractable from the delta file and when a source file is removed from the delta file, the information remaining in the resulting delta file remains true with respect to at least step c) and step e) for the remaining markup language source files. 5. The non-transitory program storage device in which is stored computer readable instructions for generating a delta file as claimed in claim 4 , the computer readable instructions including instructions for adding one or more attributes to one or more of the elements in the delta file to indicate generalized equality relationships between each element as the element appears in one or more of the source files.
| 0.5 |
3. A method as described in claim 1 , wherein the performing is controlled though a user input to a user interface.
|
3. A method as described in claim 1 , wherein the performing is controlled though a user input to a user interface. 4. A method as described in claim 3 , wherein the user input specifies a threshold for the calculated scores which is used to identify which of the plurality of segments will be modified.
| 0.943271 |
1. A method for controlling an electronic device using a single sensing element, comprising: playing back with the electronic device a first audio clip in a first manner; during the playing back in the first manner: detecting with the single sensing element a first user input; in response to the detecting the first user input, altering with the electronic device the playing back from the first manner to a second manner; and in response to the altering, playing back with the electronic device the first audio clip in the second manner; during the playing back the first audio clip in the second manner, playing back with the electronic device a second audio clip to announce the first audio clip; and after the playing back the second audio clip, playing back with the electronic device a first menu audio clip that is associated with a menu of the electronic device.
|
1. A method for controlling an electronic device using a single sensing element, comprising: playing back with the electronic device a first audio clip in a first manner; during the playing back in the first manner: detecting with the single sensing element a first user input; in response to the detecting the first user input, altering with the electronic device the playing back from the first manner to a second manner; and in response to the altering, playing back with the electronic device the first audio clip in the second manner; during the playing back the first audio clip in the second manner, playing back with the electronic device a second audio clip to announce the first audio clip; and after the playing back the second audio clip, playing back with the electronic device a first menu audio clip that is associated with a menu of the electronic device. 4. The method of claim 1 , further comprising: after the detecting the first user input, entering with the electronic device a menu mode of the electronic device; and at least one of during the playing back the first audio clip in the second manner and after the playing back the first audio clip in the second manner: detecting with the single sensing element a second user input; and exiting with the electronic device the entered menu mode in response to the detecting the second user input.
| 0.5 |
19. One or more non-transitory computer-readable media storing instructions that, when executed by one or more computing devices, cause performance of: performing a link analysis of related metadata items to which a collection of related data objects conform; calculating metadata scores for the related metadata items based upon the link analysis; identifying search results for a set of query terms, each result of the search results being a subset of related data objects within the collection, the subset comprising, for each particular term of the set of query terms, at least one data object that matches the particular term; wherein identifying the search results comprises: identifying groups of initial data objects to investigate for the search results, the groups including at least a first group matching a first query term and a second group matching a second query term; identifying particular subsets of related data objects within the collection by, in an order at least partially based on the metadata scores, expanding networks of the related data objects from the initial data objects; determining which of the particular subsets qualify as the search results.
|
19. One or more non-transitory computer-readable media storing instructions that, when executed by one or more computing devices, cause performance of: performing a link analysis of related metadata items to which a collection of related data objects conform; calculating metadata scores for the related metadata items based upon the link analysis; identifying search results for a set of query terms, each result of the search results being a subset of related data objects within the collection, the subset comprising, for each particular term of the set of query terms, at least one data object that matches the particular term; wherein identifying the search results comprises: identifying groups of initial data objects to investigate for the search results, the groups including at least a first group matching a first query term and a second group matching a second query term; identifying particular subsets of related data objects within the collection by, in an order at least partially based on the metadata scores, expanding networks of the related data objects from the initial data objects; determining which of the particular subsets qualify as the search results. 23. The one or more non-transitory computer-readable media of claim 19 , wherein the instructions, when executed by the one or more computing devices, further cause identifying particular subsets of related data objects and determining which of the particular subsets qualify as the search results by: populating a candidate set of data objects from the initial data objects; ordering at least the data objects in the candidate set, the ordering comprising, for each particular data object in the candidate set, identifying a priority score based at least partially upon a particular metadata score that has been assigned to a particular metadata item to which the particular data object conforms; based on the ordering, identifying a first data object within the candidate set to investigate; determining whether the first data object is a search result by determining whether the first data object is or comprises a subset of related data objects such that, for each particular term of the query terms, at least one data object that matches the particular term; when the first data object is not a search result, identifying one or more new data objects to investigate by adding, to the candidate set, one or more ancestor objects that are related to the first data object; iteratively repeating at least the identifying a first data object to investigate, determining whether the first data object is a search result, and identifying one or more new data objects to investigate, with respect to different data objects within the candidate set, until the search results have been identified.
| 0.5 |
1. A method comprising: converting, by a processing device, audio data of a candidate in a digital interview into voice-to-text data; generating, by an audio cue generator executing on the processing device, audio cues of the digital interview based on the voice-to-text data; applying the audio cues to a prediction model to predict an achievement index for the candidate based on the audio cues; and displaying the candidate in a list of candidates based on the achievement index, wherein the list of candidates is sorted according to the candidates' achievement index.
|
1. A method comprising: converting, by a processing device, audio data of a candidate in a digital interview into voice-to-text data; generating, by an audio cue generator executing on the processing device, audio cues of the digital interview based on the voice-to-text data; applying the audio cues to a prediction model to predict an achievement index for the candidate based on the audio cues; and displaying the candidate in a list of candidates based on the achievement index, wherein the list of candidates is sorted according to the candidates' achievement index. 10. The method of claim 1 , wherein generating the audio cues comprises calculating position-specific word clusters and weights for predictive words.
| 0.865402 |
1. A computer-implemented method for reporting a performance score for a Web page, comprising computer-implemented operations of: sending, by a Web browser tool on a first computing system a request to a second computing system to load data from the Web page, such that the first computing system causes the second computing system to respond by sending the data to load the Web page in the Web browser tool of the first computing system; heuristically calculating a performance sub-score for each of a plurality of Web page performance metrics; combining said performance sub-scores to produce at least one interpretable Web page performance score; and compiling and outputting a report of the at least one interpretable Web page performance score.
|
1. A computer-implemented method for reporting a performance score for a Web page, comprising computer-implemented operations of: sending, by a Web browser tool on a first computing system a request to a second computing system to load data from the Web page, such that the first computing system causes the second computing system to respond by sending the data to load the Web page in the Web browser tool of the first computing system; heuristically calculating a performance sub-score for each of a plurality of Web page performance metrics; combining said performance sub-scores to produce at least one interpretable Web page performance score; and compiling and outputting a report of the at least one interpretable Web page performance score. 6. The method according to claim 1 , further comprising: loading the Web page in a browser; and observing operation of the Web page as the Web page loads in real time.
| 0.51253 |
1. A method for automatic speech recognition, wherein the method comprises: obtaining at least one language model word; determining an acoustic similarity between the at least one language model word and each rule-based grammar word in a set of multiple rule-based grammar words; and increasing a transition cost to the at least one language model word proportionally to the acoustic similarity between the at least one language model word and at least one of the multiple rule-based grammar words to generate a modified language model for automatic speech recognition, wherein said increasing the transition cost to the at least one language model word comprises increasing a likelihood of selecting at least one of the multiple rule-based grammar words over the at least one language model word as a recognition output; wherein at least one of the steps is carried out by a computer device.
|
1. A method for automatic speech recognition, wherein the method comprises: obtaining at least one language model word; determining an acoustic similarity between the at least one language model word and each rule-based grammar word in a set of multiple rule-based grammar words; and increasing a transition cost to the at least one language model word proportionally to the acoustic similarity between the at least one language model word and at least one of the multiple rule-based grammar words to generate a modified language model for automatic speech recognition, wherein said increasing the transition cost to the at least one language model word comprises increasing a likelihood of selecting at least one of the multiple rule-based grammar words over the at least one language model word as a recognition output; wherein at least one of the steps is carried out by a computer device. 8. The method of claim 1 , wherein said determining comprises using a conditional random field-based technique, wherein a conditional random field is trained to model at least one confusion and account for at least one error in a phonetic decoding derived from an automatic speech recognition output.
| 0.580365 |
1. A computer program product tangibly embodied in a machine-readable storage device, the computer program product including instructions that, when executed, cause a processor to perform operations when a new tag name is to be added to a collection of tag names, the operations comprising: receiving, in a computer system, a new tag name that is entered by a user, the new tag name entered to be added to a collection of existing tag names that conform to a standardized protocol for defining semantics of contents in electronic communications, the new tag name including at least first and second terms; determining that the collection of existing tag names already includes the first term but not the second term, wherein each term included in the collection of existing tag names is associated with a corresponding unique identifier selected from a collection of existing unique identifiers, the first term being associated with a first unique identifier from the collection of existing unique identifiers; adding a new term to the collection of existing tag names and generating for the new term a second unique identifier that is not associated with any of the existing tag names and is not already in the collection of existing unique identifiers, wherein the new term is one of (i) the second term and (ii) a synonym for the second term that is not already in the collection of existing tag names, wherein the second unique identifier is associated with the new term; adding the second unique identifier to the collection of existing unique identifiers; selecting, for the new tag name, the first unique identifier for the first term, and the second unique identifier for the new term, wherein the new tag name signifies that the new term is a qualifier for the first term in accordance with the standardized protocol, wherein the collection of existing tag names further includes a third term that is currently not qualified by the new term; and updating the collection of existing tag names so that the new term qualifies also the third term, the second unique identifier being associated with the new term both for qualifying the first term and the third term.
|
1. A computer program product tangibly embodied in a machine-readable storage device, the computer program product including instructions that, when executed, cause a processor to perform operations when a new tag name is to be added to a collection of tag names, the operations comprising: receiving, in a computer system, a new tag name that is entered by a user, the new tag name entered to be added to a collection of existing tag names that conform to a standardized protocol for defining semantics of contents in electronic communications, the new tag name including at least first and second terms; determining that the collection of existing tag names already includes the first term but not the second term, wherein each term included in the collection of existing tag names is associated with a corresponding unique identifier selected from a collection of existing unique identifiers, the first term being associated with a first unique identifier from the collection of existing unique identifiers; adding a new term to the collection of existing tag names and generating for the new term a second unique identifier that is not associated with any of the existing tag names and is not already in the collection of existing unique identifiers, wherein the new term is one of (i) the second term and (ii) a synonym for the second term that is not already in the collection of existing tag names, wherein the second unique identifier is associated with the new term; adding the second unique identifier to the collection of existing unique identifiers; selecting, for the new tag name, the first unique identifier for the first term, and the second unique identifier for the new term, wherein the new tag name signifies that the new term is a qualifier for the first term in accordance with the standardized protocol, wherein the collection of existing tag names further includes a third term that is currently not qualified by the new term; and updating the collection of existing tag names so that the new term qualifies also the third term, the second unique identifier being associated with the new term both for qualifying the first term and the third term. 9. The computer program product of claim 1 , wherein the collection of existing tag names further includes fourth and fifth terms that are subqualifier terms for the new term, the fourth and fifth terms having associated therewith fourth and fifth unique identifiers, respectively, wherein the fourth and fifth unique identifiers are associated with the fourth and fifth terms both when the new term qualifies the first term and when the second term qualifies the third term.
| 0.61641 |
1. A method of training an information extraction system to extract information from a natural language input, comprising: initializing a structured language model with syntactically annotated training data, the annotated training data including a parse tree for a sentence having syntactic labels comprising a frame label indicating an overall action being referred to by the sentence and slot labels identifying attributes of the action; training the structured language model by generating parses with the initialized structured language model using annotated training data that has semantic constituent labels with semantic constituent boundaries identified, wherein the structured language model is trained as a match constrained parser which generates a set of syntactic parses for a given word string that all match the constituent boundaries specified by the semantic parse, by determining whether unlabeled constituents that define the semantic parse are included in a set of constituents that define the syntactic parse, wherein any parses that do not match the constituent boundaries are discarded; replacing the syntactic labels in the parse tree with joint syntactic and semantic labels based on the generated parses excluding the discarded parses; and retraining the structured language model in which the structured language model generates parses that are constrained to identically match the semantic constituent labels of the joint syntactic and semantic labels and constrained to match all of the semantic constituent boundaries.
|
1. A method of training an information extraction system to extract information from a natural language input, comprising: initializing a structured language model with syntactically annotated training data, the annotated training data including a parse tree for a sentence having syntactic labels comprising a frame label indicating an overall action being referred to by the sentence and slot labels identifying attributes of the action; training the structured language model by generating parses with the initialized structured language model using annotated training data that has semantic constituent labels with semantic constituent boundaries identified, wherein the structured language model is trained as a match constrained parser which generates a set of syntactic parses for a given word string that all match the constituent boundaries specified by the semantic parse, by determining whether unlabeled constituents that define the semantic parse are included in a set of constituents that define the syntactic parse, wherein any parses that do not match the constituent boundaries are discarded; replacing the syntactic labels in the parse tree with joint syntactic and semantic labels based on the generated parses excluding the discarded parses; and retraining the structured language model in which the structured language model generates parses that are constrained to identically match the semantic constituent labels of the joint syntactic and semantic labels and constrained to match all of the semantic constituent boundaries. 7. The method of claim 1 wherein generating parses comprises: generating the parses in a left-to-right fashion; associating headwords with nodes in the parses; and utilizing the headwords as historical contexts to predict words in the parses.
| 0.599184 |
1. A computer system for generating synthetic words for parts of documents, the computer system comprising: an indexing module for receiving an electronic document comprising a first part and a second part, identifying a first bounding box for the first part, identifying a second bounding box for the second part, generating a synthetic word of the first bounding box, the synthetic word including a location of the first bounding box, a first quantized angle measured between a line originating from the first bounding box and a path joining a center of the first bounding box to a center of the second bounding box and a second quantized angle defining a width of the second bounding box, and producing an association between the electronic document and the synthetic word; and a data storage for storing the electronic document, the synthetic word and the association between the electronic document and the synthetic word, wherein the first part and the second part are at least one of text, a character and an image.
|
1. A computer system for generating synthetic words for parts of documents, the computer system comprising: an indexing module for receiving an electronic document comprising a first part and a second part, identifying a first bounding box for the first part, identifying a second bounding box for the second part, generating a synthetic word of the first bounding box, the synthetic word including a location of the first bounding box, a first quantized angle measured between a line originating from the first bounding box and a path joining a center of the first bounding box to a center of the second bounding box and a second quantized angle defining a width of the second bounding box, and producing an association between the electronic document and the synthetic word; and a data storage for storing the electronic document, the synthetic word and the association between the electronic document and the synthetic word, wherein the first part and the second part are at least one of text, a character and an image. 5. The computer system of claim 1 wherein the synthetic word does not represent any natural language content of the electronic document.
| 0.557965 |
12. A technology tracking system comprising: a network interface providing coupling over a network; a hardware processor coupled to the network interface; and electronic hardware memory coupled to the hardware processor wherein the electronic hardware memory provides a taxonomy including a plurality of software application names and a plurality of capability terms associated with the software application names, wherein for each of the capability terms, the respective capability term is associated with at least a respective one of the software application names, and wherein the electronic hardware memory comprises computer readable program code that when executed by the hardware processor causes the hardware processor to perform operations to, perform a first search of a data source using the plurality of software application names and the plurality of capability terms from the taxonomy in the electronic hardware memory, wherein the data source is a first data source, retrieve a first plurality of text segments from the data source responsive to performing the first search the data source, wherein each of the text segments includes at least one of the software application names or at least one of the capability terms from the taxonomy in the electronic hardware memory, identify at least one new software application name or at least one new capability term from the first plurality of text segments retrieved from the data source responsive to performing the first search, determine a respective use frequency for each of the at least one new software application name or for each of the at least one new capability term, wherein determining the respective use frequency for each of the at least one new software application name or for each of the at least one new capability term comprises searching a second data source for a number of instances of each of the at least one new software application name of for each of the at least one new capability term, and wherein the second data source is different than the first data source, update the taxonomy in the electronic hardware memory to include at least a first one of the at least one new software application name having the respective use frequency that is greater than the use frequency threshold or to include a first one of the at least one new capability term having the respective use frequency that is greater than the use frequency threshold; update a fringe list in the electronic hardware memory to include a second one of the at least one new software application name having a respective first use frequency that is less than the use frequency threshold or to include a second one of the at least one new capability term having a respective first use frequency that is less than the use frequency threshold, wherein the second one of the at least one new software application name or the second one of the at least one new capability term is preserved in the fringe list after performing the first search; perform a second search of the data source using the software application names and the capability terms from the taxonomy in electronic hardware memory, after performing the first search, and after updating the taxonomy and updating the fringe list in electronic hardware memory; retrieve a second plurality of text segments from the data source responsive to performing the second search of the data source after updating, wherein each of the text segments of the second plurality includes at least one of the software application names or at least one of the capability terms from the taxonomy in electronic hardware memory; and automatically remove the second new software application name or the second new capability term from the fringe list after updating the fringe list to include the second new software application name or the second new capability term and after performing the second search responsive to a second use frequency for the second new software application name or the second new capability term that is less than the use frequency threshold wherein the second use frequency for the second new software application name or the second new capability term is determined subsequent to performing the second search.
|
12. A technology tracking system comprising: a network interface providing coupling over a network; a hardware processor coupled to the network interface; and electronic hardware memory coupled to the hardware processor wherein the electronic hardware memory provides a taxonomy including a plurality of software application names and a plurality of capability terms associated with the software application names, wherein for each of the capability terms, the respective capability term is associated with at least a respective one of the software application names, and wherein the electronic hardware memory comprises computer readable program code that when executed by the hardware processor causes the hardware processor to perform operations to, perform a first search of a data source using the plurality of software application names and the plurality of capability terms from the taxonomy in the electronic hardware memory, wherein the data source is a first data source, retrieve a first plurality of text segments from the data source responsive to performing the first search the data source, wherein each of the text segments includes at least one of the software application names or at least one of the capability terms from the taxonomy in the electronic hardware memory, identify at least one new software application name or at least one new capability term from the first plurality of text segments retrieved from the data source responsive to performing the first search, determine a respective use frequency for each of the at least one new software application name or for each of the at least one new capability term, wherein determining the respective use frequency for each of the at least one new software application name or for each of the at least one new capability term comprises searching a second data source for a number of instances of each of the at least one new software application name of for each of the at least one new capability term, and wherein the second data source is different than the first data source, update the taxonomy in the electronic hardware memory to include at least a first one of the at least one new software application name having the respective use frequency that is greater than the use frequency threshold or to include a first one of the at least one new capability term having the respective use frequency that is greater than the use frequency threshold; update a fringe list in the electronic hardware memory to include a second one of the at least one new software application name having a respective first use frequency that is less than the use frequency threshold or to include a second one of the at least one new capability term having a respective first use frequency that is less than the use frequency threshold, wherein the second one of the at least one new software application name or the second one of the at least one new capability term is preserved in the fringe list after performing the first search; perform a second search of the data source using the software application names and the capability terms from the taxonomy in electronic hardware memory, after performing the first search, and after updating the taxonomy and updating the fringe list in electronic hardware memory; retrieve a second plurality of text segments from the data source responsive to performing the second search of the data source after updating, wherein each of the text segments of the second plurality includes at least one of the software application names or at least one of the capability terms from the taxonomy in electronic hardware memory; and automatically remove the second new software application name or the second new capability term from the fringe list after updating the fringe list to include the second new software application name or the second new capability term and after performing the second search responsive to a second use frequency for the second new software application name or the second new capability term that is less than the use frequency threshold wherein the second use frequency for the second new software application name or the second new capability term is determined subsequent to performing the second search. 18. The technology tracking system of claim 12 wherein at least one of the capability terms is associated with each of the software application names.
| 0.707999 |
9. A system for processing XML documents, comprising: processing resources including at least one processor, a memory, and a non-transitory computer readable storage medium; wherein the processing resources are configured to: parse an XML document into a plurality of constituent nodes, the XML document including a plurality of Document Object Model (DOM) objects representable in accordance with an object model; store the parsed constituent nodes and associated metadata in a plurality of partitions, wherein a first node of the parsed constituent nodes and associated metadata is stored in a first partition of the plurality of partitions and a second node of the parsed constituent nodes and associated metadata is stored in a second partition of the plurality of partitions, and each said partition having an associated commit level that initially is set to 0; store, for each said partition, an identifier thereof in a partition table list, the identifier(s) in the partition table list collectively identifying the working contents of the XML document, the partition table list initially being designated as a current partition table list and initially being designated as having a current commit level of 0; in response to a request for an atomic update to the XML document: push onto a stack, configured to hold one or more previous partition table lists, a copy of the current partition table list; increment the current commit level; determine whether a given partition's contents are changed as a result of the atomic update and whether the commit level associated with the given partition does not match the current commit level; and when a given partition's contents are changed as a result of the atomic update and the commit level associated with the given partition does not match the current commit level, copy the given partition's contents to create a new partition with the changed contents and replace the identifier for the given partition in the current partition table list with an identifier for the new partition; and in response to an atomic update being completed: pop from the stack the uppermost partition table list, the popped partition table list being a candidate partition table list; determine partitions in the current partition table list that have associated commit levels that match the current commit level into the candidate partition table list; copy identifiers for any partitions in the current partition table list that have associated commit levels that match the current commit level into the candidate partition table list; replace the current partition table list with the candidate list; and decrement the current commit level.
|
9. A system for processing XML documents, comprising: processing resources including at least one processor, a memory, and a non-transitory computer readable storage medium; wherein the processing resources are configured to: parse an XML document into a plurality of constituent nodes, the XML document including a plurality of Document Object Model (DOM) objects representable in accordance with an object model; store the parsed constituent nodes and associated metadata in a plurality of partitions, wherein a first node of the parsed constituent nodes and associated metadata is stored in a first partition of the plurality of partitions and a second node of the parsed constituent nodes and associated metadata is stored in a second partition of the plurality of partitions, and each said partition having an associated commit level that initially is set to 0; store, for each said partition, an identifier thereof in a partition table list, the identifier(s) in the partition table list collectively identifying the working contents of the XML document, the partition table list initially being designated as a current partition table list and initially being designated as having a current commit level of 0; in response to a request for an atomic update to the XML document: push onto a stack, configured to hold one or more previous partition table lists, a copy of the current partition table list; increment the current commit level; determine whether a given partition's contents are changed as a result of the atomic update and whether the commit level associated with the given partition does not match the current commit level; and when a given partition's contents are changed as a result of the atomic update and the commit level associated with the given partition does not match the current commit level, copy the given partition's contents to create a new partition with the changed contents and replace the identifier for the given partition in the current partition table list with an identifier for the new partition; and in response to an atomic update being completed: pop from the stack the uppermost partition table list, the popped partition table list being a candidate partition table list; determine partitions in the current partition table list that have associated commit levels that match the current commit level into the candidate partition table list; copy identifiers for any partitions in the current partition table list that have associated commit levels that match the current commit level into the candidate partition table list; replace the current partition table list with the candidate list; and decrement the current commit level. 10. The system of claim 9 , wherein each of the partitions is structured to include only logical references among and between the parsed constituent nodes.
| 0.588947 |
11. A method by which a first computer system automatically converts a document to an interactive reference that can be interpreted by and displayed on a second computer system having a display screen sensitive to the position of a pointer, a processor in communication with the display screen, and a memory in communication with the processor such that at least portions of the interactive reference residing in the memory can be retrieved by interaction of the pointer with the display screen, the method comprising the following steps: separating the document into content blocks delineated by content commands within the document, some content blocks containing text or a picture, and at least one other content block containing a template for an interactive navigation dialog box allowing live interaction between the pointer and the display screen; creating page descriptions in which the content blocks are arranged on pages whose boundaries are defined by the display screen of the second computer, at least one of the page descriptions specifying the structure of a menu page; linking one or more buttons in the interactive navigation dialog box to other locations in the interactive reference such that when one of the buttons is selected with said pointer, another location within the interactive reference is displayed; and outputting commands describing the interactive reference, the commands having a format, at least when compiled, that can be stored in the memory of the second computer system and interpreted by the processor of the second computer system.
|
11. A method by which a first computer system automatically converts a document to an interactive reference that can be interpreted by and displayed on a second computer system having a display screen sensitive to the position of a pointer, a processor in communication with the display screen, and a memory in communication with the processor such that at least portions of the interactive reference residing in the memory can be retrieved by interaction of the pointer with the display screen, the method comprising the following steps: separating the document into content blocks delineated by content commands within the document, some content blocks containing text or a picture, and at least one other content block containing a template for an interactive navigation dialog box allowing live interaction between the pointer and the display screen; creating page descriptions in which the content blocks are arranged on pages whose boundaries are defined by the display screen of the second computer, at least one of the page descriptions specifying the structure of a menu page; linking one or more buttons in the interactive navigation dialog box to other locations in the interactive reference such that when one of the buttons is selected with said pointer, another location within the interactive reference is displayed; and outputting commands describing the interactive reference, the commands having a format, at least when compiled, that can be stored in the memory of the second computer system and interpreted by the processor of the second computer system. 12. The method of claim 11 wherein the navigation dialog box includes a return to menu button which when selected causes a menu page to be displayed.
| 0.682247 |
1. A method, implemented on at least one machine having at least one processor, storage, and a communication platform connected to a network for ranking a search result, comprising: accessing, by the at least one machine, a set of recency ranking data comprising one or more past search queries, one or more past search results, and one or more recency features, wherein the recency features comprise: a time-sensitive feature representing a particular time period that was determined based on content of at least some of the past search queries, wherein the at least some of the past search queries were sensitive to the particular time period, and a query timestamp feature representing the time at which the past search queries were received at a search engine; training, by the at least one machine, a first ranking model via machine learning based on the recency features; and determining when recency is to be utilized for ranking a search result based on the ranking model.
|
1. A method, implemented on at least one machine having at least one processor, storage, and a communication platform connected to a network for ranking a search result, comprising: accessing, by the at least one machine, a set of recency ranking data comprising one or more past search queries, one or more past search results, and one or more recency features, wherein the recency features comprise: a time-sensitive feature representing a particular time period that was determined based on content of at least some of the past search queries, wherein the at least some of the past search queries were sensitive to the particular time period, and a query timestamp feature representing the time at which the past search queries were received at a search engine; training, by the at least one machine, a first ranking model via machine learning based on the recency features; and determining when recency is to be utilized for ranking a search result based on the ranking model. 7. The method of claim 1 , wherein training the first ranking model via machine learning comprises training the first ranking model using the recency features and a plurality of relevance features.
| 0.748722 |
30. The apparatus for prosody parsing according to claim 28 , wherein said pause weight calculator is configured to calculate a pause weight for each pause position in said token sequence according to the pause probabilities at associated positions of corresponding token pairs in the prosody statistic model.
|
30. The apparatus for prosody parsing according to claim 28 , wherein said pause weight calculator is configured to calculate a pause weight for each pause position in said token sequence according to the pause probabilities at associated positions of corresponding token pairs in the prosody statistic model. 31. The apparatus for prosody parsing according to claim 30 , wherein the associated positions of each token pair includes before, after and amid said token pair, said pause weight calculator is configured to calculate the pause weight for each pause position with weight=−log(Prob ttp ×Prob tpt ×Prob ptt ) wherein Prob ttp represents the pause probability after the token pair that is located before said pause position, Prob ptt represents the pause probability before the token pair that is located after said pause position, and Prob tpt represents the pause probability amid the token pair that is located across said pause position.
| 0.625488 |
5. A computer readable medium containing computer readable instructions for quantifying document image data, the computer-readable instructions performing the tasks of: quantifying a predetermined number of consecutive characters in first document image data into first quantified data based upon layout characteristic information, the first document image data containing character lines, each of the character lines including characters, the layout characteristic information being based upon a minimal circumscribing rectangle around each of the characters, the layout characteristic information including a plurality of parameters, the parameters including a combination of information on a height of the minimal circumscribing rectangle starting from a bottom line in the character line, a height of the minimal circumscribing rectangle, a width of the minimal circumscribing rectangle, a black pixel density in the minimal circumscribing rectangle and a distance between two adjacent ones of the minimal circumscribing rectangles; converting the first quantified data into symbol series; and generating a table representing occurrence probabilities of the consecutive characters based upon the symbol series.
|
5. A computer readable medium containing computer readable instructions for quantifying document image data, the computer-readable instructions performing the tasks of: quantifying a predetermined number of consecutive characters in first document image data into first quantified data based upon layout characteristic information, the first document image data containing character lines, each of the character lines including characters, the layout characteristic information being based upon a minimal circumscribing rectangle around each of the characters, the layout characteristic information including a plurality of parameters, the parameters including a combination of information on a height of the minimal circumscribing rectangle starting from a bottom line in the character line, a height of the minimal circumscribing rectangle, a width of the minimal circumscribing rectangle, a black pixel density in the minimal circumscribing rectangle and a distance between two adjacent ones of the minimal circumscribing rectangles; converting the first quantified data into symbol series; and generating a table representing occurrence probabilities of the consecutive characters based upon the symbol series. 8. The computer readable medium containing computer-readable instructions for quantifying document image data according to claim 5 further performing additional tasks of: inputting second document image data in an unknown language; converting the second document image data into second quantified data representing the predetermined number of the consecutive characters based upon the layout characteristic information; comparing the second quantified data in the table; totaling the occurrence probabilities for a predetermined amount of the second document image to generate a totaled occurrence probability result; and determining whether or not the second document image data is in the same language as the first document image data based upon the totaled occurrence probability result.
| 0.621766 |
1. A method comprising: detecting, by a computing system, a presence of a combinational loop in a word-level netlist representation of a circuit design by identifying a portion of the word-level netlist having at least one characteristic associated with the combinational loop, translating the identified portion of the word-level netlist into a bit-level circuit representation, and utilizing the bit-level circuit representation to determine the identified portion of the word-level netlist includes the combinational loop; and modifying, by the computing system, the word-level netlist corresponding to the detected presence of the combinational loop.
|
1. A method comprising: detecting, by a computing system, a presence of a combinational loop in a word-level netlist representation of a circuit design by identifying a portion of the word-level netlist having at least one characteristic associated with the combinational loop, translating the identified portion of the word-level netlist into a bit-level circuit representation, and utilizing the bit-level circuit representation to determine the identified portion of the word-level netlist includes the combinational loop; and modifying, by the computing system, the word-level netlist corresponding to the detected presence of the combinational loop. 3. The method of claim 1 , wherein modifying the word-level netlist further comprises annotating the word-level netlist to annunciate the presence of the combinational loop included in the identified portion of the word-level netlist.
| 0.716646 |
15. The computer-readable storage medium of claim 10 , wherein the export options provided for one or more of the first report or the second report include at least one delimiter character used to organize information in the respective report and export the data from the respective report.
|
15. The computer-readable storage medium of claim 10 , wherein the export options provided for one or more of the first report or the second report include at least one delimiter character used to organize information in the respective report and export the data from the respective report. 16. The computer-readable storage medium of claim 15 , wherein the computer-executable instructions are further operable to treat two or more consecutive occurrences of the delimiter character as one occurrence of the delimiter character to export the data from the first report or the second report in response to the export options including a selection to treat consecutive delimiters as one.
| 0.937757 |
16. An electronic device configured to perform a method comprising: receiving a swipe gesture from an initial touch location on a touch-sensitive display of an electronic device; determining touch attributes for the swipe gesture, the touch attributes comprising a touch location of the swipe gesture; performing a first lock function when the swipe gesture progresses to a first touch location on the touch-sensitive display that is beyond a first threshold from the initial touch location, wherein the first lock function locks a first set of functionalities of the electronic device; and performing a second lock function when the swipe gesture progresses to a second touch location on the touch-sensitive display that is beyond a second threshold from the initial touch location, wherein the second lock function locks a second, different set of functionalities of the electronic device and the second threshold is beyond the first threshold.
|
16. An electronic device configured to perform a method comprising: receiving a swipe gesture from an initial touch location on a touch-sensitive display of an electronic device; determining touch attributes for the swipe gesture, the touch attributes comprising a touch location of the swipe gesture; performing a first lock function when the swipe gesture progresses to a first touch location on the touch-sensitive display that is beyond a first threshold from the initial touch location, wherein the first lock function locks a first set of functionalities of the electronic device; and performing a second lock function when the swipe gesture progresses to a second touch location on the touch-sensitive display that is beyond a second threshold from the initial touch location, wherein the second lock function locks a second, different set of functionalities of the electronic device and the second threshold is beyond the first threshold. 28. The electronic device of claim 16 , wherein at least one of the first and second lock functions comprises at least one of: locking a service, locking an application, a device lock, a partial device lock, or a perimeter lock.
| 0.619269 |
13. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, direct the apparatus at least to: receive, via an active address field, a character string comprising one or more characters, cause repeated checking of validity by repeatedly requesting information on the validity of said character string as a document identifier wherein the checking is implemented by the active address field receiving the character string, cause indication of a valid part of said character string comprising at least a domain part, cause indication of the validity of said character string as a whole by changing an appearance of a control element, wherein the control element is configured to cause a request for a document relating to the document identifier defined by said character string to be sent in response to selection of the control element by a user and wherein the control element does not include an indication of the document identifier defined by said character string; and cause an offering of a possibility to send a request for a document relating to the document identifier defined at least by the valid part of the character string and ignore any other part of said character string.
|
13. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, direct the apparatus at least to: receive, via an active address field, a character string comprising one or more characters, cause repeated checking of validity by repeatedly requesting information on the validity of said character string as a document identifier wherein the checking is implemented by the active address field receiving the character string, cause indication of a valid part of said character string comprising at least a domain part, cause indication of the validity of said character string as a whole by changing an appearance of a control element, wherein the control element is configured to cause a request for a document relating to the document identifier defined by said character string to be sent in response to selection of the control element by a user and wherein the control element does not include an indication of the document identifier defined by said character string; and cause an offering of a possibility to send a request for a document relating to the document identifier defined at least by the valid part of the character string and ignore any other part of said character string. 17. The apparatus according to claim 13 , wherein the apparatus is further directed to implement a browser having an address field for receiving the character string.
| 0.516028 |
2. The method of claim 1, wherein: (a) said code words include a sequence of K N-bit binary words; and (b) said recursive generation includes the steps of: (i) providing a neural network with N neurons, each neuron has two states with output values 0 and 1, interconnection strengths T.sub.ij connecting the output of the jth neuron to an input of the ith neuron, and dynamical evolution given by EQU V.sub.i .fwdarw.1 if .SIGMA..sub.j T.sub.ij V.sub.j <.theta..sub.i and EQU V.sub.i .fwdarw.0 if .SIGMA..sub.j T.sub.ij V.sub.j >.theta..sub.i where V.sub.i is the output value of the ith neuron and .theta..sub.i is a threshold; (ii) providing an initial N-bit binary code word U.sup.1 with components U.sub.j.sup.1 . (iii) setting said interconnection strengths T.sub.ij =U.sub.i.sup.1.1 U.sub.j.sup.1 for all i and j except setting T.sub.ii =0; (iv) inputting U.sup.1 into said neural network, and letting said neural network evolve to a stable state V; (v) taking said stable state V to define a new binary code word U.sup.2 ; (vi) updating said interconnection strengths by adding U.sub.i.sup.2 U.sub.j.sup.2 to the current T.sub.ij for all i and j except i=j; (vii) repeating steps (iv)-(vi) with U.sup.k replaced by U.sup.k+1 for k=1, 2, . . . , K-1; and (viii) taking U.sup.1, U.sup.2, . . . U.sup.K as said code words.
|
2. The method of claim 1, wherein: (a) said code words include a sequence of K N-bit binary words; and (b) said recursive generation includes the steps of: (i) providing a neural network with N neurons, each neuron has two states with output values 0 and 1, interconnection strengths T.sub.ij connecting the output of the jth neuron to an input of the ith neuron, and dynamical evolution given by EQU V.sub.i .fwdarw.1 if .SIGMA..sub.j T.sub.ij V.sub.j <.theta..sub.i and EQU V.sub.i .fwdarw.0 if .SIGMA..sub.j T.sub.ij V.sub.j >.theta..sub.i where V.sub.i is the output value of the ith neuron and .theta..sub.i is a threshold; (ii) providing an initial N-bit binary code word U.sup.1 with components U.sub.j.sup.1 . (iii) setting said interconnection strengths T.sub.ij =U.sub.i.sup.1.1 U.sub.j.sup.1 for all i and j except setting T.sub.ii =0; (iv) inputting U.sup.1 into said neural network, and letting said neural network evolve to a stable state V; (v) taking said stable state V to define a new binary code word U.sup.2 ; (vi) updating said interconnection strengths by adding U.sub.i.sup.2 U.sub.j.sup.2 to the current T.sub.ij for all i and j except i=j; (vii) repeating steps (iv)-(vi) with U.sup.k replaced by U.sup.k+1 for k=1, 2, . . . , K-1; and (viii) taking U.sup.1, U.sup.2, . . . U.sup.K as said code words. 3. The method of claim 2, wherein: (a) said providing an initial N-bit binary code word U.sup.1 of claim 2 step (b)(ii) is by random selection.
| 0.564891 |
9. A non-transitory computer readable medium having instruction stored thereon, wherein the instructions, when executed by a processor, cause the processor to: provide an associative mapping for a first communication protocol and a second communication protocol in a memory, wherein the second communication protocol is different from the first communication protocol, wherein a data message structured according to the first communication protocol comprises a serialized-binary message having a self-describing schema, the serialized-binary message comprising i) a data set comprising data values originating from a connected device, and ii) a metadata construct that includes one or more description values of the data set, and wherein the associative mapping includes one or more control parameters associated with transmission events of the data message to one or more devices in the network, wherein a configuration message structured according to the first communication protocol comprises a second serialized-binary message having the self-describing schema, the second serialized binary message comprising i) the one or more control parameters associated with the transmission events of the data message to the one or more devices in the network, and ii) a second metadata construct that includes one or more description values of the one or more control parameters; in response to receiving, from a given connected device, a first data message transmitted according to the second communication protocol, generate, according to the associative mapping, a second data message structured according to the first communication protocol and transmit, according to the associative mapping, the second data packet to a device in the network; in response to receiving, from the device in the network, a given configuration message structured according to the first communication protocol, wherein the given configuration message includes one or more control parameters associated with one or more transmission events of a given data message to one or more devices in the network, update the associative mapping with the one or more control parameters of the given configuration message; and in response to receiving, from the given connected device, a third data message transmitted according to the second communication protocol, generate, according to the updated associative mapping, a fourth data message structured according to the first communication protocol and transmit, according to the updated associative mapping, the fourth data message to a device in the network.
|
9. A non-transitory computer readable medium having instruction stored thereon, wherein the instructions, when executed by a processor, cause the processor to: provide an associative mapping for a first communication protocol and a second communication protocol in a memory, wherein the second communication protocol is different from the first communication protocol, wherein a data message structured according to the first communication protocol comprises a serialized-binary message having a self-describing schema, the serialized-binary message comprising i) a data set comprising data values originating from a connected device, and ii) a metadata construct that includes one or more description values of the data set, and wherein the associative mapping includes one or more control parameters associated with transmission events of the data message to one or more devices in the network, wherein a configuration message structured according to the first communication protocol comprises a second serialized-binary message having the self-describing schema, the second serialized binary message comprising i) the one or more control parameters associated with the transmission events of the data message to the one or more devices in the network, and ii) a second metadata construct that includes one or more description values of the one or more control parameters; in response to receiving, from a given connected device, a first data message transmitted according to the second communication protocol, generate, according to the associative mapping, a second data message structured according to the first communication protocol and transmit, according to the associative mapping, the second data packet to a device in the network; in response to receiving, from the device in the network, a given configuration message structured according to the first communication protocol, wherein the given configuration message includes one or more control parameters associated with one or more transmission events of a given data message to one or more devices in the network, update the associative mapping with the one or more control parameters of the given configuration message; and in response to receiving, from the given connected device, a third data message transmitted according to the second communication protocol, generate, according to the updated associative mapping, a fourth data message structured according to the first communication protocol and transmit, according to the updated associative mapping, the fourth data message to a device in the network. 14. The computer readable medium of claim 9 , wherein the second and fourth data messages include a service request code selected from the group consisting of a GET request code, a PUT request code, a POST request code, and a DELETE request code.
| 0.545684 |
19. A system comprising: memory; one or more processors coupled to the memory and configured to perform operations comprising: ranking indexed queries based on a respective query rank of each indexed query, the query rank calculated based on a frequency of occurrence of the indexed query and a user satisfaction score of the indexed query, the indexed queries including highly-ranked queries and nearby queries that are queries that have a statistically significant probability of being revised to one of the highly-ranked queries, wherein the user satisfaction score of a particular indexed query is determined from estimates of lengths of clicks on search results, wherein the estimates of the lengths of clicks on search results are based on a duration of time from a selection of a search result for the particular indexed query to a subsequent selection of another search result; calculating a respective revision score for each indexed query as a function of a revision probability of a first query and the respective query rank for the particular indexed query, the revision probability based on at least one of a semantic similarity or syntactic similarity between the first query and the particular indexed query; selecting one of the indexed queries as an alternative query to the first query based on the respective revision score of the selected indexed query; and providing the selected query as a suggested revision for the first query.
|
19. A system comprising: memory; one or more processors coupled to the memory and configured to perform operations comprising: ranking indexed queries based on a respective query rank of each indexed query, the query rank calculated based on a frequency of occurrence of the indexed query and a user satisfaction score of the indexed query, the indexed queries including highly-ranked queries and nearby queries that are queries that have a statistically significant probability of being revised to one of the highly-ranked queries, wherein the user satisfaction score of a particular indexed query is determined from estimates of lengths of clicks on search results, wherein the estimates of the lengths of clicks on search results are based on a duration of time from a selection of a search result for the particular indexed query to a subsequent selection of another search result; calculating a respective revision score for each indexed query as a function of a revision probability of a first query and the respective query rank for the particular indexed query, the revision probability based on at least one of a semantic similarity or syntactic similarity between the first query and the particular indexed query; selecting one of the indexed queries as an alternative query to the first query based on the respective revision score of the selected indexed query; and providing the selected query as a suggested revision for the first query. 20. The system of claim 19 in which the first query is a query revision of an earlier query.
| 0.568945 |
1. A method for capturing information from a live conversation between an operator and a customer, comprising: designating a context for the live conversation between the operator and the customer wherein the context is a form viewed on a computer screen and actively in use by the operator; setting, by the operator during the live conversation, a visual cue by physically moving a cursor to an information field in the form; monitoring the live conversation in response to setting the visual cue, wherein the visual cue triggers the conversion of the live conversation to text; recognizing at least one portion of the live conversation as a text portion after converting the live conversation to text; interpreting one or more cues in the live conversation, wherein the one or more cues comprises at least the visual cue; relating the one or more cues to the information field associated with the context for the live conversation; and storing information obtained from the text portion of the live conversation into the information field, wherein the information obtained from the text portion comprises at least one word spoken after the one or more cues.
|
1. A method for capturing information from a live conversation between an operator and a customer, comprising: designating a context for the live conversation between the operator and the customer wherein the context is a form viewed on a computer screen and actively in use by the operator; setting, by the operator during the live conversation, a visual cue by physically moving a cursor to an information field in the form; monitoring the live conversation in response to setting the visual cue, wherein the visual cue triggers the conversion of the live conversation to text; recognizing at least one portion of the live conversation as a text portion after converting the live conversation to text; interpreting one or more cues in the live conversation, wherein the one or more cues comprises at least the visual cue; relating the one or more cues to the information field associated with the context for the live conversation; and storing information obtained from the text portion of the live conversation into the information field, wherein the information obtained from the text portion comprises at least one word spoken after the one or more cues. 6. The method of claim 1 , wherein the operator confirms an accuracy of the information stored before the context is saved.
| 0.623377 |
2. A method according to claim 1 wherein the hierarchical data source comprises a schema representation of said at least one data source and at least one previous view of the hierarchical data source.
|
2. A method according to claim 1 wherein the hierarchical data source comprises a schema representation of said at least one data source and at least one previous view of the hierarchical data source. 22. A method according to claim 2 wherein said schema representation is updated as at least one new query is logged.
| 0.967048 |
4. The method of claim 1 , wherein said first set of variable parameters comprises a first variable parameter corresponding to a network connection type and a second variable parameter corresponding to an identifier for the at least one other node in a communication network.
|
4. The method of claim 1 , wherein said first set of variable parameters comprises a first variable parameter corresponding to a network connection type and a second variable parameter corresponding to an identifier for the at least one other node in a communication network. 7. The method of claim 4 , wherein said first variable parameter corresponding to a network connection type is selectable as one of a PPTP connection type, an OpenVPN connection type, or a L2TP connection type.
| 0.957733 |
1. A method performed by a data processing apparatus, the method comprising: determining one or more trust relationships between a user and one or more entities based on a frequency with which the user visits one or more resources associated with the one or more entities; receiving a search query from the user; identifying one or more resources responsive to the search query, wherein each of the resources is associated with one or more annotation label terms assigned by the one or more entities; determining whether a query label term matches any of the one or more annotation label terms; identifying, for each of the one or more annotation label terms matching the query label term, a trust rank of the entity that associated the annotation label term with the resource, each trust rank indicating a level of trust for annotation label terms that are assigned by the entity, and each trust rank being based on the determined one or more trust relationships that are based on the frequency with which the user visits the one or more resources; determining a relevance score of each of one or more resources that have the annotation label term based on the respective trust rank, the relevance score indicating a degree of relevance between the respective resource and the query term; ranking each of the one or more resources based on the respective relevance scores; and providing the ranking.
|
1. A method performed by a data processing apparatus, the method comprising: determining one or more trust relationships between a user and one or more entities based on a frequency with which the user visits one or more resources associated with the one or more entities; receiving a search query from the user; identifying one or more resources responsive to the search query, wherein each of the resources is associated with one or more annotation label terms assigned by the one or more entities; determining whether a query label term matches any of the one or more annotation label terms; identifying, for each of the one or more annotation label terms matching the query label term, a trust rank of the entity that associated the annotation label term with the resource, each trust rank indicating a level of trust for annotation label terms that are assigned by the entity, and each trust rank being based on the determined one or more trust relationships that are based on the frequency with which the user visits the one or more resources; determining a relevance score of each of one or more resources that have the annotation label term based on the respective trust rank, the relevance score indicating a degree of relevance between the respective resource and the query term; ranking each of the one or more resources based on the respective relevance scores; and providing the ranking. 10. The method of claim 1 , wherein identifying, for each of the one or more annotation label terms matching the query label term, a trust rank of the entity that associated the annotation label term with the resource, each trust rank indicating a level of trust for annotation label terms that are associated by the entity, and each trust rank being based on the determined one or more trust relationships that are based on the frequency with which the user visits the one or more resources comprises: calculating, for an annotation label matching the query label term, an aggregated trust rank based on two or more topic-specific trust ranks of different entities that each associated the annotation label to the corresponding resource.
| 0.595992 |
3. The computer implemented method of claim 1 , wherein obtaining synonyms for each constituent word is performed by a dictionary lookup component within the enterprise service bus, and wherein the dictionary lookup component retrieves synonyms for each constituent word in a dictionary and creates a synonym list for each constituent word.
|
3. The computer implemented method of claim 1 , wherein obtaining synonyms for each constituent word is performed by a dictionary lookup component within the enterprise service bus, and wherein the dictionary lookup component retrieves synonyms for each constituent word in a dictionary and creates a synonym list for each constituent word. 4. The computer implemented method of claim 3 , wherein the dictionary is a custom dictionary comprising only words, definitions, and associated synonyms applicable to a specific enterprise, a set of related enterprises, or a specific type of industry.
| 0.903244 |
1. A computer-implemented method of searching for at least one data file matching a user-defined query definition, the method comprising: receiving a first user input defining a first query definition for a first query, wherein the first query definition includes a first scope defining a first physical file location to be searched and a first set of one or more textual search terms used; executing the first query to generate a first plurality of data files stored on the first physical file location that have one or more characteristics that match the first set of the one or more textual search terms; receiving a second user input defining a second query definition for a second query, wherein the second query definition includes a second scope defining a second physical file location to be searched and a second set of one or more textual search terms, wherein the second scope incorporates by reference a third query definition that comprises a third query definition having a third scope and a third set of one or more textual search terms, thereby defining the second scope as a combination of items satisfying the third query definition and items that are stored in the second physical file location; receiving a third user input modifying the third scope of the third query definition to incorporate by reference the first query definition and the second query definition, thereby defining the third scope as a combination of items satisfying the first query definition and items that satisfy the second query definition; detecting an attempted cycle within the third query definition by determining that the second query definition incorporates the third query definition by a reference and the third query definition incorporates the second query definition by reference; automatically removing the attempted cycle from the third query definition by trimming the incorporation by reference of the second query definition from third query definition; executing the third query to identify multiple data files matching the third query definition, wherein the multiple data files are in the first plurality of data files generated by executing the first query definition and have one or more characteristics that match the third set of one or more textual search terms; and displaying a representation of the multiple data files with only one unique copy of each data file.
|
1. A computer-implemented method of searching for at least one data file matching a user-defined query definition, the method comprising: receiving a first user input defining a first query definition for a first query, wherein the first query definition includes a first scope defining a first physical file location to be searched and a first set of one or more textual search terms used; executing the first query to generate a first plurality of data files stored on the first physical file location that have one or more characteristics that match the first set of the one or more textual search terms; receiving a second user input defining a second query definition for a second query, wherein the second query definition includes a second scope defining a second physical file location to be searched and a second set of one or more textual search terms, wherein the second scope incorporates by reference a third query definition that comprises a third query definition having a third scope and a third set of one or more textual search terms, thereby defining the second scope as a combination of items satisfying the third query definition and items that are stored in the second physical file location; receiving a third user input modifying the third scope of the third query definition to incorporate by reference the first query definition and the second query definition, thereby defining the third scope as a combination of items satisfying the first query definition and items that satisfy the second query definition; detecting an attempted cycle within the third query definition by determining that the second query definition incorporates the third query definition by a reference and the third query definition incorporates the second query definition by reference; automatically removing the attempted cycle from the third query definition by trimming the incorporation by reference of the second query definition from third query definition; executing the third query to identify multiple data files matching the third query definition, wherein the multiple data files are in the first plurality of data files generated by executing the first query definition and have one or more characteristics that match the third set of one or more textual search terms; and displaying a representation of the multiple data files with only one unique copy of each data file. 2. The method of claim 1 wherein the second scope comprises a plurality of memory locations.
| 0.511935 |
29. The method according to claim 1 wherein said signals are digital media and also comprising providing associations from said reference signal to regions of said query signal which have high local evidence scores.
|
29. The method according to claim 1 wherein said signals are digital media and also comprising providing associations from said reference signal to regions of said query signal which have high local evidence scores. 31. The method according to claim 29 and wherein said query digital media is one portion of input digital media and said reference digital media is another portion of said input digital media.
| 0.922074 |
12. A system comprising: a processor; a memory being in communication with the processor and having stored thereon computer-executable instructions that, when executed by the processor, cause the processor to perform operations comprising: receiving, from a short message entity, for delivery to a mobile device, a message comprising a payload, the payload having a character encoded therein in accordance with a first character encoding scheme, wherein receiving the message comprises receiving a Parlay-X send short messaging service message comprising the payload with the character encoded in accordance with a Parlay-X extensible markup language data coding scheme; receiving a second encoding scheme for the message, wherein receiving the second encoding scheme comprises receiving a short message peer-to-peer data coding scheme for the message; and transforming, by the processor, the message from the first character encoding to the second character encoding scheme, yielding a modified message comprising the payload of the message encoded in the second character encoding scheme, wherein transforming the message from the first character encoding to the second character encoding scheme comprises transforming the message from the Parlay-X extensible markup language data coding scheme to the short message peer-to-peer data coding scheme, yielding the modified message comprising the payload of the message encoded in the short message peer-to-peer data coding scheme.
|
12. A system comprising: a processor; a memory being in communication with the processor and having stored thereon computer-executable instructions that, when executed by the processor, cause the processor to perform operations comprising: receiving, from a short message entity, for delivery to a mobile device, a message comprising a payload, the payload having a character encoded therein in accordance with a first character encoding scheme, wherein receiving the message comprises receiving a Parlay-X send short messaging service message comprising the payload with the character encoded in accordance with a Parlay-X extensible markup language data coding scheme; receiving a second encoding scheme for the message, wherein receiving the second encoding scheme comprises receiving a short message peer-to-peer data coding scheme for the message; and transforming, by the processor, the message from the first character encoding to the second character encoding scheme, yielding a modified message comprising the payload of the message encoded in the second character encoding scheme, wherein transforming the message from the first character encoding to the second character encoding scheme comprises transforming the message from the Parlay-X extensible markup language data coding scheme to the short message peer-to-peer data coding scheme, yielding the modified message comprising the payload of the message encoded in the short message peer-to-peer data coding scheme. 17. The system of claim 12 , wherein the message comprises a multimedia component, the multimedia component comprising at least one characteristic selected from a group consisting of an image, a sound, and a video.
| 0.663048 |
1. A system that facilitates re-ranking search results retrieved by a search engine, comprising one or more computers configured with: a query log component that, responsive to a target query, builds a language model specific to the target query based on queries stored in a query log of a search engine, the query log component comprising: a compilation module that determines absolute frequencies of search terms corresponding to the queries related lexically including a number of queries submitted by users that include the target query, and a session module that determines relative frequencies of the queries related temporally and submitted during a user session; a matching component that compares a lexical property of an initial search result for the target query and the language model and computes a match score that indicates a probability that two or more search results are related by utilizing a cosine similarity and a KL-divergence for comparing; a ranking component that re-ranks a subset of the initial search result based on the match score and a rank of the initial search result, wherein the re-ranking of the subset of the initial search result comprises processing a URL, one or more page titles, a plurality of page content and a plurality of snippets resulting from a document query pairing, and further wherein, the plurality of snippets are search-engine dependent; a user control selection component that allows a user to further re-rank the initial search result, wherein the user control selection component is configured to accept user input to manually control the further re-ranking of the initial search result; and a user control component that applies a selectable modification to at least one of the system components to change the re-ranking of the subset of the initial search result and the selectable modification is one of an increase in a diversity of top re-ranked search results and a decrease in the diversity of the top re-ranked search results.
|
1. A system that facilitates re-ranking search results retrieved by a search engine, comprising one or more computers configured with: a query log component that, responsive to a target query, builds a language model specific to the target query based on queries stored in a query log of a search engine, the query log component comprising: a compilation module that determines absolute frequencies of search terms corresponding to the queries related lexically including a number of queries submitted by users that include the target query, and a session module that determines relative frequencies of the queries related temporally and submitted during a user session; a matching component that compares a lexical property of an initial search result for the target query and the language model and computes a match score that indicates a probability that two or more search results are related by utilizing a cosine similarity and a KL-divergence for comparing; a ranking component that re-ranks a subset of the initial search result based on the match score and a rank of the initial search result, wherein the re-ranking of the subset of the initial search result comprises processing a URL, one or more page titles, a plurality of page content and a plurality of snippets resulting from a document query pairing, and further wherein, the plurality of snippets are search-engine dependent; a user control selection component that allows a user to further re-rank the initial search result, wherein the user control selection component is configured to accept user input to manually control the further re-ranking of the initial search result; and a user control component that applies a selectable modification to at least one of the system components to change the re-ranking of the subset of the initial search result and the selectable modification is one of an increase in a diversity of top re-ranked search results and a decrease in the diversity of the top re-ranked search results. 5. The system of claim 1 , the language model is a probability distribution over query terms extracted from the queries in the query log.
| 0.549051 |
1. An apparatus for correcting errors in speech recognition, the apparatus comprising: a feature vector extracting unit extracting feature vectors from a received speech; a speech recognizing unit recognizing the received speech as a word sequence on the basis of the extracted feature vectors; a phoneme weighted finite state transducer (WFST)-based converting unit converting the recognized word sequence recognized by the speech recognizing unit into a phoneme WFST; and a speech recognition error correcting unit correcting errors in the converted phoneme WFST, wherein the speech recognition error correcting unit comprises a WFST synthesizing unit modeling a phoneme WFST transferred from the phoneme WFST-based converting unit as pronunciation variation on the basis of a Kullback-Leibler (KL) distance matrix, and wherein the KL distance is calculated by an equation 1, KL ( L - C i + R || L - C j + R ) = ∑ k = 1 M ω i , k KL ( b i , k || b j , k ) + ∑ k = 1 M ω i , k log ω i , k ω j , k . ( 1 )
|
1. An apparatus for correcting errors in speech recognition, the apparatus comprising: a feature vector extracting unit extracting feature vectors from a received speech; a speech recognizing unit recognizing the received speech as a word sequence on the basis of the extracted feature vectors; a phoneme weighted finite state transducer (WFST)-based converting unit converting the recognized word sequence recognized by the speech recognizing unit into a phoneme WFST; and a speech recognition error correcting unit correcting errors in the converted phoneme WFST, wherein the speech recognition error correcting unit comprises a WFST synthesizing unit modeling a phoneme WFST transferred from the phoneme WFST-based converting unit as pronunciation variation on the basis of a Kullback-Leibler (KL) distance matrix, and wherein the KL distance is calculated by an equation 1, KL ( L - C i + R || L - C j + R ) = ∑ k = 1 M ω i , k KL ( b i , k || b j , k ) + ∑ k = 1 M ω i , k log ω i , k ω j , k . ( 1 ) 3. The apparatus according to claim 1 , wherein KL(b i,k ∥b j,k ) in the equation 1 is calculated by equation 2, KL ( b i , k || b j , k ) = 1 2 ( ln ( ∑ j , k ∑ i , k ) + tr ( ∑ j , k - 1 ∑ i , k ) + ( μ j , k - μ i , k ) T ∑ j , k - 1 ( μ j , k - μ i , k ) - K ) . ( 2 )
| 0.544007 |
28. A Mandarin speech input method for directly translating arbitrary sentences of a Mandarin speech input into corresponding Chinese characters, comprising: inputting the Mandarin speech, the Mandarin speech being continuous speech; acoustic processing of the arbitrary sentences of the continuous Mandarin speech, the acoustic processing step comprising: employing "Base Syllable Models", formed form "sub-syllable units" of the Mandarin speech, based on "Hidden Markov Models" developed for characteristics of Mandarin mono-syllables in the Mandarin speech, and based on "Tone Models" developed for characteristics of tone of the Mandarin speech, to calculate probabilities of each of the mono-syllables in the Mandarin speech input for further recognition; and linguistic decoding an output of the acoustic processing, the linguistic decoding comprising: employing "Chinese Language Models" to locate the corresponding Chinese characters for a sequence of the recognized mono-syllables, wherein words and sentences are formed by the "Base Syllable Models" for further recognition.
|
28. A Mandarin speech input method for directly translating arbitrary sentences of a Mandarin speech input into corresponding Chinese characters, comprising: inputting the Mandarin speech, the Mandarin speech being continuous speech; acoustic processing of the arbitrary sentences of the continuous Mandarin speech, the acoustic processing step comprising: employing "Base Syllable Models", formed form "sub-syllable units" of the Mandarin speech, based on "Hidden Markov Models" developed for characteristics of Mandarin mono-syllables in the Mandarin speech, and based on "Tone Models" developed for characteristics of tone of the Mandarin speech, to calculate probabilities of each of the mono-syllables in the Mandarin speech input for further recognition; and linguistic decoding an output of the acoustic processing, the linguistic decoding comprising: employing "Chinese Language Models" to locate the corresponding Chinese characters for a sequence of the recognized mono-syllables, wherein words and sentences are formed by the "Base Syllable Models" for further recognition. 29. A method as claimed in claim 28, wherein the "sub-syllable Unit Models" and "tone models", for tone recognition, are the "Hidden Markov Models" trained by interpolation training, the interpolation training comprising: first stage training of models; and performing second stage training by processing an output of the first stage training to produce required models; interpolating the models generated from each recursive training iteration during the second stage training step with the models generated from the first stage training step for utilizing a precision of the models generated during the first stage training step.
| 0.745932 |
13. The one or more computer-readable memory devices of claim 8 , wherein the processor-executable instructions, when executed, direct the device to perform further actions comprising: receiving selection information indicating which one of the one or more suggested characters is a command input recognizable by an interactive media device.
|
13. The one or more computer-readable memory devices of claim 8 , wherein the processor-executable instructions, when executed, direct the device to perform further actions comprising: receiving selection information indicating which one of the one or more suggested characters is a command input recognizable by an interactive media device. 14. The one or more computer-readable memory devices of claim 13 , wherein the processor-executable instructions, when executed, direct the device to perform further actions comprising inserting the one or more suggested characters into an input box of the interactive media device.
| 0.840926 |
5. A method for decoding a first character code by a user equipment (UE), comprising: receiving one or more hexadecimal codes at the UE, wherein the one or more hexadecimal codes comprise the first character code, and the first character code refers at least to a first character in a first language and to a second character in a second language, wherein the one or more hexadecimal codes indicate a name of a network to which the UE is connected; determining whether to display the first character or the second character based upon a mobile country code (MCC) provided to the UE by a public land mobile network (PLMN) currently applicable to the UE, wherein the determination comprises mapping the MCC to a country selected from a plurality of countries; displaying the first character or the second character if the country is associated with the first language or the second language, respectively; and using the MCC in a mapping table to determine a display language within a set of different languages.
|
5. A method for decoding a first character code by a user equipment (UE), comprising: receiving one or more hexadecimal codes at the UE, wherein the one or more hexadecimal codes comprise the first character code, and the first character code refers at least to a first character in a first language and to a second character in a second language, wherein the one or more hexadecimal codes indicate a name of a network to which the UE is connected; determining whether to display the first character or the second character based upon a mobile country code (MCC) provided to the UE by a public land mobile network (PLMN) currently applicable to the UE, wherein the determination comprises mapping the MCC to a country selected from a plurality of countries; displaying the first character or the second character if the country is associated with the first language or the second language, respectively; and using the MCC in a mapping table to determine a display language within a set of different languages. 6. The method of claim 5 , wherein the one or more hexadecimal codes include a second character code that refers to only one character.
| 0.849558 |
1. A method executed by a search engine for ranking items responsive to receipt of a query, the method comprising: at the search engine, responsive to receiving the query that is to be executed over a plurality of items in a data repository, identifying a document-query feature that pertains to a combination of the query and an item in the plurality of items, wherein the document-query feature is based upon: a document category that has been previously assigned to the item; and a query category that has been previously assigned to the query, wherein the query category is dependent upon document categories assigned to items previously retrieved by the search engine when executing the query over a data repository, the document-query feature is indicative of a correlation between the document category and the query category; at the search engine, retrieving items from the data repository based upon the query; ranking the items based upon document-query features assigned to the items; and responsive to ranking the items, outputting a ranked list of items, the item positioned in the ranked list of items based upon the document-query feature.
|
1. A method executed by a search engine for ranking items responsive to receipt of a query, the method comprising: at the search engine, responsive to receiving the query that is to be executed over a plurality of items in a data repository, identifying a document-query feature that pertains to a combination of the query and an item in the plurality of items, wherein the document-query feature is based upon: a document category that has been previously assigned to the item; and a query category that has been previously assigned to the query, wherein the query category is dependent upon document categories assigned to items previously retrieved by the search engine when executing the query over a data repository, the document-query feature is indicative of a correlation between the document category and the query category; at the search engine, retrieving items from the data repository based upon the query; ranking the items based upon document-query features assigned to the items; and responsive to ranking the items, outputting a ranked list of items, the item positioned in the ranked list of items based upon the document-query feature. 9. The method of claim 1 , the document-query feature is based upon a binary value indicating a probability of the query category assigned to the query being correct.
| 0.754541 |
18. The system as recited in claim 15 , wherein said first profile is populated with said characteristics of said recipient by monitoring messages composed by said recipient and extracting characteristics of said monitored messages comprising one or more of the following: said topic affinities for particular users, said language pattern, said historical topics discussed, said topic discussed in current conversation thread and said conversation pattern.
|
18. The system as recited in claim 15 , wherein said first profile is populated with said characteristics of said recipient by monitoring messages composed by said recipient and extracting characteristics of said monitored messages comprising one or more of the following: said topic affinities for particular users, said language pattern, said historical topics discussed, said topic discussed in current conversation thread and said conversation pattern. 19. The system as recited in claim 18 , wherein said characteristics of said monitored messages are extracted using natural language processing.
| 0.961049 |
1. A method of discovering work-item relations, comprising: analyzing, automatically by a processor, a description of a collection of work-items created in one or more projects, to generate a plurality of work-item elements and their relationships; analyzing, automatically by the processor, one or more standardized specifications describing practice guidelines to follow in executing said one or more projects and deliverables expected to be generated, to generate a plurality of standardized specification elements and their relationships represented as nodes and edges, the one or more standardized specifications specified in a text form and comprising a title of a task involved in the one or more projects, a relationship the task in the one or more projects has with another task in the one or more projects, description of the task, the one or more standardized specification further comprising a work-breakdown tree with different tasks comprising at least the task; mapping, automatically by the processor, said plurality of work-item elements to said plurality of standardized specification elements, the mapping comprising identifying a threshold similarity between a single work-item element node and a standardized specification element, and between a pair of work-item element nodes with associated link relationship and a pair of standardized specification elements with associated link relationship, wherein the single work-item element node is mapped at most to one standardized specification element, the identifying the threshold similarity comprising one or more of string similarity, Boolean similarity and relational similarity; discovering, automatically by the processor, at least one or more missing relations among said plurality of work-item elements based on said mapping, wherein the relationships comprise at least one or more of changed by, has same owner as, input from and output to; receiving, based on at least on one of a determination that the mapping creates a conflict and the mapping has a low confidence, input from a user to resolve the at least one of the conflict in the mapping and the low confidence in the mapping; and adding, automatically by the processor, the discovered one or more missing relations as edges to the mapping.
|
1. A method of discovering work-item relations, comprising: analyzing, automatically by a processor, a description of a collection of work-items created in one or more projects, to generate a plurality of work-item elements and their relationships; analyzing, automatically by the processor, one or more standardized specifications describing practice guidelines to follow in executing said one or more projects and deliverables expected to be generated, to generate a plurality of standardized specification elements and their relationships represented as nodes and edges, the one or more standardized specifications specified in a text form and comprising a title of a task involved in the one or more projects, a relationship the task in the one or more projects has with another task in the one or more projects, description of the task, the one or more standardized specification further comprising a work-breakdown tree with different tasks comprising at least the task; mapping, automatically by the processor, said plurality of work-item elements to said plurality of standardized specification elements, the mapping comprising identifying a threshold similarity between a single work-item element node and a standardized specification element, and between a pair of work-item element nodes with associated link relationship and a pair of standardized specification elements with associated link relationship, wherein the single work-item element node is mapped at most to one standardized specification element, the identifying the threshold similarity comprising one or more of string similarity, Boolean similarity and relational similarity; discovering, automatically by the processor, at least one or more missing relations among said plurality of work-item elements based on said mapping, wherein the relationships comprise at least one or more of changed by, has same owner as, input from and output to; receiving, based on at least on one of a determination that the mapping creates a conflict and the mapping has a low confidence, input from a user to resolve the at least one of the conflict in the mapping and the low confidence in the mapping; and adding, automatically by the processor, the discovered one or more missing relations as edges to the mapping. 7. The method of claim 1 , wherein the work-items include functional specification, technical specification, reports, interfaces, process definition, strategy, and organizational change.
| 0.542985 |
1. A system having a storage and hardware processor processes and generates a combined audio and video report of a radiographic image, the system comprising: a video recording of the one or more radiographic images, wherein the video recording is to be viewed on a display of the system; an audio recording of a radiologist describing one or more features of the radiographic image, wherein the audio recording enables the voice of the radiologist to be heard while viewing the video recording; and a play menu for playing the video and audio recording, wherein the video and audio recording is played: from within a radiology information system program executable on the system, the radiology information system program comprising a graphical user interface to facilitate retrieval of patient data stored in the storage, wherein the video recording, the patient data, and the play menu are simultaneously viewable on the display of the system, and the audio recording is playable while viewing the video recording, the patient data, and the play menu; or as a standalone program executable on the system or on any other system having media player software; wherein the audio/video report is stored in the storage for subsequent retrieval and playback.
|
1. A system having a storage and hardware processor processes and generates a combined audio and video report of a radiographic image, the system comprising: a video recording of the one or more radiographic images, wherein the video recording is to be viewed on a display of the system; an audio recording of a radiologist describing one or more features of the radiographic image, wherein the audio recording enables the voice of the radiologist to be heard while viewing the video recording; and a play menu for playing the video and audio recording, wherein the video and audio recording is played: from within a radiology information system program executable on the system, the radiology information system program comprising a graphical user interface to facilitate retrieval of patient data stored in the storage, wherein the video recording, the patient data, and the play menu are simultaneously viewable on the display of the system, and the audio recording is playable while viewing the video recording, the patient data, and the play menu; or as a standalone program executable on the system or on any other system having media player software; wherein the audio/video report is stored in the storage for subsequent retrieval and playback. 9. The system of claim 1 , wherein the audio/video report is a streaming file.
| 0.627748 |
20. A method for receiving and processing one or more claim files and authoring and electronically filing legal documents associated with legal actions, comprising the steps of: (A) electronically receiving at a system interface a first claim file in electronic form from a first entity wherein the first claim file includes a first source data element having a first format; (B) electronically receiving at the system interface a second claim file in electronic form from a second entity different from the first entity, wherein the second claim file includes a second source data element having a second format different from the first format; (C) mapping, using a processor, the first and second source data elements into first and second destination data elements conforming to a desired format to form first and second modified claim files; (D) selecting, using the processor, first and second courts, based respectively on data included in the first and second modified claim files and predetermined court selection criteria; (E) generating, using the processor, at least first and second legal documents in electronic form, respectively configured for electronic filing in the first and second courts and which are compliant with requirements of the first and second courts, said generating step using the first and second modified claim files and predetermined requirement data associated with the first and second courts; and (F) electronically filing the first and second legal documents respectively in the first and second courts to thereby institute legal actions in each court.
|
20. A method for receiving and processing one or more claim files and authoring and electronically filing legal documents associated with legal actions, comprising the steps of: (A) electronically receiving at a system interface a first claim file in electronic form from a first entity wherein the first claim file includes a first source data element having a first format; (B) electronically receiving at the system interface a second claim file in electronic form from a second entity different from the first entity, wherein the second claim file includes a second source data element having a second format different from the first format; (C) mapping, using a processor, the first and second source data elements into first and second destination data elements conforming to a desired format to form first and second modified claim files; (D) selecting, using the processor, first and second courts, based respectively on data included in the first and second modified claim files and predetermined court selection criteria; (E) generating, using the processor, at least first and second legal documents in electronic form, respectively configured for electronic filing in the first and second courts and which are compliant with requirements of the first and second courts, said generating step using the first and second modified claim files and predetermined requirement data associated with the first and second courts; and (F) electronically filing the first and second legal documents respectively in the first and second courts to thereby institute legal actions in each court. 25. The method of claim 20 wherein said step of selecting a first court includes the sub-steps of: defining selection rules for selection of the first court; and identifying the selected first court from a list of a plurality of candidate courts using the selection rules and data included in the first claim file.
| 0.607577 |
1. A method, comprising: receiving, at a computing device, training samples for training a neural network to learn an acoustic speech model, wherein at least one training sample of the training samples represents at least one phone of captured speech; determining a curriculum function for acoustic speech modeling, wherein the curriculum function assigns a difficulty value for a designated training sample of the training samples based on a combination comprising a duration value for the designated training sample and a sound quality value for the designated training sample; for each training sample of the training samples, determining a corresponding difficulty value for the training sample using the curriculum function; ordering the training samples based on the corresponding difficulty values for the training samples; presenting the ordered training samples to the neural network using the computing device to train the neural network on at least a portion of the acoustic speech model; and recognizing a received speech sample using the trained neural network.
|
1. A method, comprising: receiving, at a computing device, training samples for training a neural network to learn an acoustic speech model, wherein at least one training sample of the training samples represents at least one phone of captured speech; determining a curriculum function for acoustic speech modeling, wherein the curriculum function assigns a difficulty value for a designated training sample of the training samples based on a combination comprising a duration value for the designated training sample and a sound quality value for the designated training sample; for each training sample of the training samples, determining a corresponding difficulty value for the training sample using the curriculum function; ordering the training samples based on the corresponding difficulty values for the training samples; presenting the ordered training samples to the neural network using the computing device to train the neural network on at least a portion of the acoustic speech model; and recognizing a received speech sample using the trained neural network. 7. The method of claim 1 , further comprising: receiving, as an input to the trained neural network, a second plurality of samples corresponding to captured human speech, wherein at least some samples in the second plurality of samples differ from the training samples; and in response to receiving the second plurality of samples, generating a plurality of phones corresponding to the captured human speech using the trained neural network.
| 0.560636 |
13. The method of claim 8 wherein the suggestions relative to items shown on one or more websites based on preference associations across multiple websites are based on both positive and negative preferences published on the multiple websites; and wherein the positive and negative preferences are combined according to a weighting profile for rating distinct rating values supplied by the persons using the first and second sets of published login names.
|
13. The method of claim 8 wherein the suggestions relative to items shown on one or more websites based on preference associations across multiple websites are based on both positive and negative preferences published on the multiple websites; and wherein the positive and negative preferences are combined according to a weighting profile for rating distinct rating values supplied by the persons using the first and second sets of published login names. 14. The method of claim 13 wherein the weighting profile is uneven.
| 0.968599 |
7. The method of handling contact requests as in claim 6 further comprising the contact broker receiving contact associated information along with the contact.
|
7. The method of handling contact requests as in claim 6 further comprising the contact broker receiving contact associated information along with the contact. 8. The method of handling contact requests as in claim 7 further comprising the contact broker identifying a set of required skills for handling the contact from the contact associated information.
| 0.93101 |
1. A computer system comprising: a touch screen; a processor communicatively connected to a memory; the memory comprising program instructions that when executed by the processor, cause the computer system to: display a mimicked view of an application graphical user interface (GUI) upon the touch screen in a simulation layer of a multilayered translation interface, wherein the mimicked view is a graphical reproduction of the application GUI with functionality of the one or more text objects of the application GUI disabled, and wherein the simulation layer comprises one or more text objects; subsequent to a user touch engaging a text object within the simulation layer, display a prompt for a user to enter a text translation of the touch engaged text object within a translation layer of the multilayered translation interface, wherein the prompt further comprises an accentuation object within the translation layer to visually accentuate the engaged text object; a text-editing object within the translation layer to receive the text translation of the engaged text objet from the user via the touch screen, and a link object within the translation layer that visually connects the accentuation object and the text-editing object; receive the text translation of the touch engaged text object; and display the text translation within the mimicked view in the simulation layer in place of the engaged text object.
|
1. A computer system comprising: a touch screen; a processor communicatively connected to a memory; the memory comprising program instructions that when executed by the processor, cause the computer system to: display a mimicked view of an application graphical user interface (GUI) upon the touch screen in a simulation layer of a multilayered translation interface, wherein the mimicked view is a graphical reproduction of the application GUI with functionality of the one or more text objects of the application GUI disabled, and wherein the simulation layer comprises one or more text objects; subsequent to a user touch engaging a text object within the simulation layer, display a prompt for a user to enter a text translation of the touch engaged text object within a translation layer of the multilayered translation interface, wherein the prompt further comprises an accentuation object within the translation layer to visually accentuate the engaged text object; a text-editing object within the translation layer to receive the text translation of the engaged text objet from the user via the touch screen, and a link object within the translation layer that visually connects the accentuation object and the text-editing object; receive the text translation of the touch engaged text object; and display the text translation within the mimicked view in the simulation layer in place of the engaged text object. 4. The computer system of claim 1 , further comprising: a language resource file of the application stored within the memory, the language resource file corresponding with the language of translation and comprising the received text translation of the touch engaged text object.
| 0.5 |
12. The system of claim 6 , wherein the editor component comprises a stencil editor component configured to create at least one of a stencil, or a shape associated with a stencil, as a function of the third programming language being created.
|
12. The system of claim 6 , wherein the editor component comprises a stencil editor component configured to create at least one of a stencil, or a shape associated with a stencil, as a function of the third programming language being created. 13. The system of claim 12 , wherein the stencil is a group comprising at least one shape, and the at least one shape is an object defined by at least one of a method or a function.
| 0.940601 |
1. A method for use in converting semantic information from a source form to a target form, comprising the steps of: obtaining an input string comprising a portion of the semantic information for conversion from said source form to said target form; first identifying a source term of said input string for conversion, wherein a context of said source term is ambiguous; second identifying a plurality of potential subject matter contexts of said input string including a plurality of different usage contexts for said source term in said source form from a portion of the semantic information other than said input string, wherein said plurality of different usage contexts represent identified potential usage contexts of said contextually ambiguous source term that are identified from said semantic information other than said input string in said source form of said semantic information; based on said plurality of subject matter contexts, establishing a set of at least two alternative candidate conversion terms in said target form for said source term, wherein said alternative candidate conversion terms comprise different possible representations of said contextually ambiguous source term in said target form corresponding to different ones of said plurality of different potential usage contexts; performing, using a computer based system, a statistical analysis at least partially based on said plurality of different usage contexts corresponding to said alternative candidate conversion terms, said statistical analysis including establishing a statistical probability for each of said alternative candidate conversion terms and selecting a selected one of said alternative candidate conversion terms having a highest probability of corresponding to a correct usage context of the source term in said string; and using said selected one of said alternative conversion terms to convert said source term from said source form to said target form.
|
1. A method for use in converting semantic information from a source form to a target form, comprising the steps of: obtaining an input string comprising a portion of the semantic information for conversion from said source form to said target form; first identifying a source term of said input string for conversion, wherein a context of said source term is ambiguous; second identifying a plurality of potential subject matter contexts of said input string including a plurality of different usage contexts for said source term in said source form from a portion of the semantic information other than said input string, wherein said plurality of different usage contexts represent identified potential usage contexts of said contextually ambiguous source term that are identified from said semantic information other than said input string in said source form of said semantic information; based on said plurality of subject matter contexts, establishing a set of at least two alternative candidate conversion terms in said target form for said source term, wherein said alternative candidate conversion terms comprise different possible representations of said contextually ambiguous source term in said target form corresponding to different ones of said plurality of different potential usage contexts; performing, using a computer based system, a statistical analysis at least partially based on said plurality of different usage contexts corresponding to said alternative candidate conversion terms, said statistical analysis including establishing a statistical probability for each of said alternative candidate conversion terms and selecting a selected one of said alternative candidate conversion terms having a highest probability of corresponding to a correct usage context of the source term in said string; and using said selected one of said alternative conversion terms to convert said source term from said source form to said target form. 14. The method as set forth in claim 1 , wherein said step of establishing comprises accessing a master set of conversion terms and using a linguistic comparison tool to select first alternative candidate conversion terms from said master set of conversion terms.
| 0.5 |
1. A system to facilitate specification of queries or commands, comprising: a user input module that receives a user input; a graphical user interface responsive to the user input, the graphical user interface including a taxonomically organized visualization of a plurality of dimensions that form at least a subset of a taxonomy for an associated information space, the dimensions including headings derived from metadata for data items in the information space; a filter generator that generates a filter based on metadata associated with each heading selected in the visualization; and a results component that presents results items that substantially satisfy the filter.
|
1. A system to facilitate specification of queries or commands, comprising: a user input module that receives a user input; a graphical user interface responsive to the user input, the graphical user interface including a taxonomically organized visualization of a plurality of dimensions that form at least a subset of a taxonomy for an associated information space, the dimensions including headings derived from metadata for data items in the information space; a filter generator that generates a filter based on metadata associated with each heading selected in the visualization; and a results component that presents results items that substantially satisfy the filter. 18. The system of claim 1 , further comprising a feedback component programmed to implement visual feedback relative to the graphical user interface based on the user input.
| 0.573722 |
1. A voice quality conversion device that converts voice quality of an input speech using information corresponding to the input speech, said voice quality conversion device comprising: a target vowel vocal tract information hold unit configured to hold target vowel vocal tract information of each vowel, the target vowel vocal tract information indicating target voice quality; a vowel conversion unit configured to (i) receive vocal tract information with phoneme boundary information which is vocal tract information that corresponds to the input speech and that is added with information of (1) a phoneme in the input speech and (2) a duration of the phoneme, (ii) approximate, as a first polynomial expression, a temporal change of received vocal tract information of a vowel included in the received vocal tract information with phoneme boundary information, (iii) approximate, as a second polynomial expression, a temporal change of target vocal tract information of the vowel, the target vocal tract information being included in the target vowel vocal tract information held in said target vowel vocal tract information hold unit, (iv) approximate, as a third polynomial expression, interpolated vocal tract information of the vowel by combining (1) the first polynomial expression approximating the temporal change of the received vocal tract information of the vowel with (2) the second polynomial expression approximating the temporal change of the target vocal tract information of the vowel, and (v) convert the received vocal tract information of the vowel using the third polynomial expression approximating the interpolated vocal tract information of the vowel; and a synthesis unit configured to synthesize a speech using the converted vocal tract information of the vowel converted by said vowel conversion unit, wherein (i) the first polynomial expression approximates a change in the received vocal tract information of the vowel over time, (ii) the second polynomial expression approximates a change in the target vocal tract information of the vowel over time, and (iii) the third polynomial expression approximates a change in the interpolated vocal tract information of the vowel over time, wherein the first polynomial expression approximating the temporal change of the received vocal tract information of the vowel and the second polynomial expression approximating the temporal change of the target vocal tract information of the vowel have a same time period that overlaps over the entire time period of the vowel, and wherein said vowel conversion unit is configured to generate the third polynomial expression by adding the first polynomial expression with the second polynomial expression based on a predetermined conversion ratio.
|
1. A voice quality conversion device that converts voice quality of an input speech using information corresponding to the input speech, said voice quality conversion device comprising: a target vowel vocal tract information hold unit configured to hold target vowel vocal tract information of each vowel, the target vowel vocal tract information indicating target voice quality; a vowel conversion unit configured to (i) receive vocal tract information with phoneme boundary information which is vocal tract information that corresponds to the input speech and that is added with information of (1) a phoneme in the input speech and (2) a duration of the phoneme, (ii) approximate, as a first polynomial expression, a temporal change of received vocal tract information of a vowel included in the received vocal tract information with phoneme boundary information, (iii) approximate, as a second polynomial expression, a temporal change of target vocal tract information of the vowel, the target vocal tract information being included in the target vowel vocal tract information held in said target vowel vocal tract information hold unit, (iv) approximate, as a third polynomial expression, interpolated vocal tract information of the vowel by combining (1) the first polynomial expression approximating the temporal change of the received vocal tract information of the vowel with (2) the second polynomial expression approximating the temporal change of the target vocal tract information of the vowel, and (v) convert the received vocal tract information of the vowel using the third polynomial expression approximating the interpolated vocal tract information of the vowel; and a synthesis unit configured to synthesize a speech using the converted vocal tract information of the vowel converted by said vowel conversion unit, wherein (i) the first polynomial expression approximates a change in the received vocal tract information of the vowel over time, (ii) the second polynomial expression approximates a change in the target vocal tract information of the vowel over time, and (iii) the third polynomial expression approximates a change in the interpolated vocal tract information of the vowel over time, wherein the first polynomial expression approximating the temporal change of the received vocal tract information of the vowel and the second polynomial expression approximating the temporal change of the target vocal tract information of the vowel have a same time period that overlaps over the entire time period of the vowel, and wherein said vowel conversion unit is configured to generate the third polynomial expression by adding the first polynomial expression with the second polynomial expression based on a predetermined conversion ratio. 6. The voice quality conversion device according to claim 1 , further comprising a conversion ratio receiving unit configured to receive a conversion ratio representing a degree of conversion to the target voice quality, wherein said vowel conversion unit is configured to (i) receive the conversion ratio received by said conversion ratio unit and (ii) approximate, as the third polynomial expression, the interpolated vocal tract information by combining (1) the first polynomial expression approximating the temporal change of the received vocal tract information of the vowel with (2) the second polynomial expression approximating the temporal change of the target vocal tract information of the vowel at the conversion ratio received by said conversion ratio receiving unit.
| 0.5 |
1. A method comprising: receiving audio input into a hearing prosthesis that is operable to stimulate a physiological system of a recipient in accordance with the received audio input, the received audio input representing an audio environment of the recipient; determining by the hearing prosthesis, based on the received audio input, linguistic characteristics of the audio environment, wherein the linguistic characteristics comprise (i) a measure of quantity of speech by the recipient and (ii) a measure of quantity of speech by one or more people other than the recipient; generating by the hearing prosthesis data representing the determined linguistic characteristics; and outputting the data from the hearing prosthesis.
|
1. A method comprising: receiving audio input into a hearing prosthesis that is operable to stimulate a physiological system of a recipient in accordance with the received audio input, the received audio input representing an audio environment of the recipient; determining by the hearing prosthesis, based on the received audio input, linguistic characteristics of the audio environment, wherein the linguistic characteristics comprise (i) a measure of quantity of speech by the recipient and (ii) a measure of quantity of speech by one or more people other than the recipient; generating by the hearing prosthesis data representing the determined linguistic characteristics; and outputting the data from the hearing prosthesis. 7. The method of claim 1 , further comprising receiving the output data into an external computing device, time-stamping the received data at the external computing device, and using the timestamped received data as a basis to present at least one comparison of change in linguistic characteristics over time.
| 0.703924 |
7. The computer system of claim 1 , further comprising an act of a software application establishing a link between the application and the local data store using the extended RDMA semantics, wherein the software application accesses at least a portion of application data stored in the local data store using the established link.
|
7. The computer system of claim 1 , further comprising an act of a software application establishing a link between the application and the local data store using the extended RDMA semantics, wherein the software application accesses at least a portion of application data stored in the local data store using the established link. 8. The computer system of claim 7 , wherein after the link is established, data is transferred between the software application and the local data store without any processor involvement.
| 0.931736 |
17. A non-transitory computer-readable medium storing instructions for controlling a computer device to exploit information in an utterance for dialog act tagging, the instructions comprising: receiving a user utterance; computing at periodic intervals at least one parameter in the user utterance; quantizing the at least one parameter at each periodic interval; approximating conditional probabilities using an n-gram over a sliding window over the periodic intervals; and tagging the utterance as a dialog act based on the approximated conditional probabilities.
|
17. A non-transitory computer-readable medium storing instructions for controlling a computer device to exploit information in an utterance for dialog act tagging, the instructions comprising: receiving a user utterance; computing at periodic intervals at least one parameter in the user utterance; quantizing the at least one parameter at each periodic interval; approximating conditional probabilities using an n-gram over a sliding window over the periodic intervals; and tagging the utterance as a dialog act based on the approximated conditional probabilities. 19. The non-transitory computer-readable medium of claim 17 , wherein the conditional probability is further approximated based on a length of the utterance.
| 0.62604 |
7. The method of claim 6 wherein said at least one information source is accessible via a telecommunications network.
|
7. The method of claim 6 wherein said at least one information source is accessible via a telecommunications network. 8. The method of claim 7 wherein said at least one search engine is accessible via a telecommunications network.
| 0.976813 |
1. A method for generating an electronic task item from captured audio input, comprising: receiving a first audio content item; transcribing the first audio content item into a first text string representing the first audio content item; applying one or more metadata items to the first text string for identifying one or more components of the first text string; generating a first electronic task item including the one or more components of the first text string; displaying the first electronic task item in a list authoring user interface; associating an audio file containing the first audio content item with the displayed first electronic task item; and displaying a selectable visual indicator of the associated audio file in proximity to the displayed first electronic task item.
|
1. A method for generating an electronic task item from captured audio input, comprising: receiving a first audio content item; transcribing the first audio content item into a first text string representing the first audio content item; applying one or more metadata items to the first text string for identifying one or more components of the first text string; generating a first electronic task item including the one or more components of the first text string; displaying the first electronic task item in a list authoring user interface; associating an audio file containing the first audio content item with the displayed first electronic task item; and displaying a selectable visual indicator of the associated audio file in proximity to the displayed first electronic task item. 7. The method of claim 1 , further comprising comparing the one or more components of the first text string with one or more components of a second text string transcribed from a second audio content item for associating the first text string with the second text string.
| 0.645018 |
1. A method for extending markup supported by a browser comprising: identifying a Web browser that presents information written in a markup language, wherein said Web browser comprises a markup rendering processor that is a runtime processor that renders or interprets markup documents, and wherein said Web browser comprises a syntax processor that is a Document Type Definition (DTD) processor; identifying an extender comprising an extension module and linking instructions, wherein the extension module defines a new language tag that was not previously part of a markup language supported by the Web browser; loading the extender; and extending the markup language supported by the Web browser to include the new language tag, wherein the extending step further comprises: the syntax processor using the extender to dynamically produce an operational DTD based upon the linking instructions, wherein said operational DTD is used by the Web browser in parsing a markup document that includes the new language tag; wherein the identified extender further comprises a plurality of attributes, wherein said Web browser further comprises an extension loader for loading the extender at runtime, wherein the attributes of the extender define times at which the extension loader is to load the extender, wherein specifiable times via the attributes comprise at least two of “when the Web browser loads,” “when a markup document is parsed,” when a markup document is rendered,” and when specified Document Object Model (DOM) events occur.
|
1. A method for extending markup supported by a browser comprising: identifying a Web browser that presents information written in a markup language, wherein said Web browser comprises a markup rendering processor that is a runtime processor that renders or interprets markup documents, and wherein said Web browser comprises a syntax processor that is a Document Type Definition (DTD) processor; identifying an extender comprising an extension module and linking instructions, wherein the extension module defines a new language tag that was not previously part of a markup language supported by the Web browser; loading the extender; and extending the markup language supported by the Web browser to include the new language tag, wherein the extending step further comprises: the syntax processor using the extender to dynamically produce an operational DTD based upon the linking instructions, wherein said operational DTD is used by the Web browser in parsing a markup document that includes the new language tag; wherein the identified extender further comprises a plurality of attributes, wherein said Web browser further comprises an extension loader for loading the extender at runtime, wherein the attributes of the extender define times at which the extension loader is to load the extender, wherein specifiable times via the attributes comprise at least two of “when the Web browser loads,” “when a markup document is parsed,” when a markup document is rendered,” and when specified Document Object Model (DOM) events occur. 5. The method of claim 1 , wherein the extension includes a definition for new markup not previously part of the markup language, a definition of platform object, and a definition of platform properties.
| 0.562311 |
13. A tangible computer program product comprising a computer readable storage medium having control logic stored therein for causing a computer to process text, the control logic comprising: computer readable first program code that causes the computer to generate an abstract mathematical vector space based on a collection of documents, wherein respective documents in the collection of documents have a representation in the abstract mathematical vector space and respective terms contained in the collection of documents have a representation in the abstract mathematical vector space; and computer readable second program code that causes the computer to perturb the abstract mathematical vector space to produce a perturbed abstract mathematical vector space that is stored in an electronic format accessible to a user, wherein perturbing the abstract mathematical vector space comprises at least one of (i) modifying the representation of a document with a newly computed representation for that document, and (ii) modifying the representation of a term with a newly computed representation for that term.
|
13. A tangible computer program product comprising a computer readable storage medium having control logic stored therein for causing a computer to process text, the control logic comprising: computer readable first program code that causes the computer to generate an abstract mathematical vector space based on a collection of documents, wherein respective documents in the collection of documents have a representation in the abstract mathematical vector space and respective terms contained in the collection of documents have a representation in the abstract mathematical vector space; and computer readable second program code that causes the computer to perturb the abstract mathematical vector space to produce a perturbed abstract mathematical vector space that is stored in an electronic format accessible to a user, wherein perturbing the abstract mathematical vector space comprises at least one of (i) modifying the representation of a document with a newly computed representation for that document, and (ii) modifying the representation of a term with a newly computed representation for that term. 18. The computer program product of claim 13 , wherein the computer readable second program code further comprises code that causes the computer to represent an additional term in the perturbed abstract mathematical vector space.
| 0.752508 |
1. A method comprising: instantiating a gesture object for an application to handle gesture recognition for the application through native gesture functionality provided by a computing device; associating the gesture object with interaction inputs and a target element specified by the application such that the interaction inputs directed to the target element are offloaded to the gesture object configured for the application, the target element representing a selectable element rendered by the computing device; creating a recognizer on behalf of the application to facilitate gesture recognition through the native gesture functionality provided by the computing device; feeding interaction input data for the interaction inputs to the recognizer to enable recognition of gestures corresponding to the application based on the interaction input data; obtaining gesture event messages from the recognizer that are indicative of recognized gestures for the application; processing raw gesture data described by the gesture event messages on behalf of the application using the gesture object; and firing gesture events having processed gesture data to the associated target element in accordance with a content model for the application such that the recognized gestures conveyed via the gesture event messages are applied to the target element.
|
1. A method comprising: instantiating a gesture object for an application to handle gesture recognition for the application through native gesture functionality provided by a computing device; associating the gesture object with interaction inputs and a target element specified by the application such that the interaction inputs directed to the target element are offloaded to the gesture object configured for the application, the target element representing a selectable element rendered by the computing device; creating a recognizer on behalf of the application to facilitate gesture recognition through the native gesture functionality provided by the computing device; feeding interaction input data for the interaction inputs to the recognizer to enable recognition of gestures corresponding to the application based on the interaction input data; obtaining gesture event messages from the recognizer that are indicative of recognized gestures for the application; processing raw gesture data described by the gesture event messages on behalf of the application using the gesture object; and firing gesture events having processed gesture data to the associated target element in accordance with a content model for the application such that the recognized gestures conveyed via the gesture event messages are applied to the target element. 7. A method as described in claim 1 , wherein the recognizer is configured to track interaction inputs designated by the gesture object and map the interaction inputs to a library of supported gestures to recognize when particular gestures occur.
| 0.52797 |
17. The method according to claim 13 , further comprising the steps of: sensing the completion of a document scanning procedure; and determining whether subsequent batches to be scanned exist within the document set; and scanning such subsequent batches in the document set.
|
17. The method according to claim 13 , further comprising the steps of: sensing the completion of a document scanning procedure; and determining whether subsequent batches to be scanned exist within the document set; and scanning such subsequent batches in the document set. 18. The method according to claim 17 , wherein the determination of whether subsequent batches to be scanned exist within the document set is made by receiving an operator input.
| 0.908127 |
1. A system configured to facilitate associating structured content in a structured document with unstructured content in an unstructured document, the system comprising: one or more processors configured to execute computer program modules, the computer program modules comprising: a document module configured to obtain a matched set of documents, wherein the matched set of documents includes an unstructured document, and a structured document generated from the unstructured document having related content so that segmented unstructured content fragments from the unstructured document correspond to structured content fragments in the structured document; wherein the document module is configured such that generating the structured document from the unstructured document comprises: analyzing human-readable textual content in the unstructured document, segmenting the human-readable textual content into individual unstructured content fragments based on the analysis, the unstructured content fragments being contiguous sections of textual content in the unstructured document; facilitating application of tags to the unstructured content fragments by a user, the tags determined based on one or more of tags previously applied by the user or tags previously applied to content associated with the unstructured document; and generating the structured document based on the tags and the unstructured content fragments such that the segmented unstructured content fragments from the unstructured document correspond to the structured content fragments in the structured document; a fact module configured to identify numeric instances present in the documents obtained by the document module such that, responsive to the document module obtaining the matched set of documents, the fact module identifies a first set of numeric instances present in the structured document and a second set of numeric instances present in the unstructured document, the first set of numeric instances including a first numeric instance appearing in the structured document within a first structured content fragment; a uniqueness module configured to determine the uniqueness of the individual ones of the first set of numeric instances present in the structured document, wherein a unique numeric instance expresses a unique first number; a disambiguation module configured to obtain differentiated data sets associated with non-unique numeric instances in the structured document that differentiate the non-unique numeric instances from other non-unique numeric instances with the same numeric value such that, responsive to the first numeric instance being non-unique, the disambiguation module obtains a differentiated data set associated with the first numeric instance, the differentiated data set including structured contextual information assigned to the first numeric instance; and a correlation module configured to correlate structured content fragments in the structured document with unstructured content fragments in the unstructured document such that, responsive to the disambiguation module obtaining the differentiated data set associated with the first numeric instance in the structured document, the correlation module identifies a corresponding second numeric instance from the second set of numeric instances in the unstructured document, and correlates the first structured content fragment with an unstructured content fragment containing the second numeric instance in the unstructured document.
|
1. A system configured to facilitate associating structured content in a structured document with unstructured content in an unstructured document, the system comprising: one or more processors configured to execute computer program modules, the computer program modules comprising: a document module configured to obtain a matched set of documents, wherein the matched set of documents includes an unstructured document, and a structured document generated from the unstructured document having related content so that segmented unstructured content fragments from the unstructured document correspond to structured content fragments in the structured document; wherein the document module is configured such that generating the structured document from the unstructured document comprises: analyzing human-readable textual content in the unstructured document, segmenting the human-readable textual content into individual unstructured content fragments based on the analysis, the unstructured content fragments being contiguous sections of textual content in the unstructured document; facilitating application of tags to the unstructured content fragments by a user, the tags determined based on one or more of tags previously applied by the user or tags previously applied to content associated with the unstructured document; and generating the structured document based on the tags and the unstructured content fragments such that the segmented unstructured content fragments from the unstructured document correspond to the structured content fragments in the structured document; a fact module configured to identify numeric instances present in the documents obtained by the document module such that, responsive to the document module obtaining the matched set of documents, the fact module identifies a first set of numeric instances present in the structured document and a second set of numeric instances present in the unstructured document, the first set of numeric instances including a first numeric instance appearing in the structured document within a first structured content fragment; a uniqueness module configured to determine the uniqueness of the individual ones of the first set of numeric instances present in the structured document, wherein a unique numeric instance expresses a unique first number; a disambiguation module configured to obtain differentiated data sets associated with non-unique numeric instances in the structured document that differentiate the non-unique numeric instances from other non-unique numeric instances with the same numeric value such that, responsive to the first numeric instance being non-unique, the disambiguation module obtains a differentiated data set associated with the first numeric instance, the differentiated data set including structured contextual information assigned to the first numeric instance; and a correlation module configured to correlate structured content fragments in the structured document with unstructured content fragments in the unstructured document such that, responsive to the disambiguation module obtaining the differentiated data set associated with the first numeric instance in the structured document, the correlation module identifies a corresponding second numeric instance from the second set of numeric instances in the unstructured document, and correlates the first structured content fragment with an unstructured content fragment containing the second numeric instance in the unstructured document. 10. The system of claim 1 , wherein the unstructured document is a corporate financial filing.
| 0.621594 |
11. The method of claim 9 , further comprising: after said anchor is built, using positive hits generated during anchor building in connection with edit-distance to obtain a temporary categorization of a team/department.
|
11. The method of claim 9 , further comprising: after said anchor is built, using positive hits generated during anchor building in connection with edit-distance to obtain a temporary categorization of a team/department. 15. The method of claim 11 , further comprising: after said anchor is built, categorizing said chat data into said team/department names.
| 0.902308 |
1. A method comprising, by a computing device: receiving, from a client system of a first user, a text query inputted by the first user at a query field of a currently accessed interface of an online social network; generating a plurality of structured queries based on the text query, each structured query comprising one or more query tokens, wherein one or more of the query tokens are unique query tokens comprising references to one or more unique objects associated with the online social network, respectively; generating one or more search results corresponding to at least one of the structured queries; and sending, to the client system responsive to receiving the text query, instructions for displaying one or more suggested queries on the interface, wherein the one or more suggested queries correspond to one or more structured queries, respectively, at least one of the suggested queries being displayed with a preview of one or more search results matching the structured query corresponding to the suggested query, and wherein each suggested query that is displayed is selectable by the first user to retrieve search results matching the structured query corresponding to the selected suggested query.
|
1. A method comprising, by a computing device: receiving, from a client system of a first user, a text query inputted by the first user at a query field of a currently accessed interface of an online social network; generating a plurality of structured queries based on the text query, each structured query comprising one or more query tokens, wherein one or more of the query tokens are unique query tokens comprising references to one or more unique objects associated with the online social network, respectively; generating one or more search results corresponding to at least one of the structured queries; and sending, to the client system responsive to receiving the text query, instructions for displaying one or more suggested queries on the interface, wherein the one or more suggested queries correspond to one or more structured queries, respectively, at least one of the suggested queries being displayed with a preview of one or more search results matching the structured query corresponding to the suggested query, and wherein each suggested query that is displayed is selectable by the first user to retrieve search results matching the structured query corresponding to the selected suggested query. 13. The method of claim 1 , wherein the structured queries are displayed on a user interface of a native application associated with the online social network.
| 0.595904 |
20. A computer system for enhancing communication within a community, the computer system comprising: a storage medium containing code instructions that when executed on a processor in the computer system provide: an application platform running an application that organizes a plurality of communications, said application further comprising: a database for storing said plurality of communications; an inherited parameters responsibility module for establishing a hierarchical structure for said plurality of communications and for distributing control of said hierarchical structure to a plurality of users within the community, through selection of inherited parameters comprising access parameters defining access by said plurality of users to said plurality of communications organized within said hierarchical structure and wherein said access parameters are selected from the group consisting of an inclusive access in which access to each of said stored communications in said hierarchical structure is allowed except where excluded by said inherited parameters and an exclusive access in which access to each of said stored communications in said hierarchical structure is allowed only where explicitly assigned; an input module for capturing said plurality of communications within said hierarchical structure sent by said plurality of users from a plurality of communication devices and storing at least a portion of said plurality of communications in relation to at least one of a plurality of topics that is user selected, wherein said plurality of communications comprises at least one link to a resource associated with said at least a portion of said plurality of communications that is stored, wherein said link is available for access by authorized users; a thread synchronization module for synchronizing said plurality of communications within said hierarchical structure; an initial priority-based content placement module for determining a priority assignment for an initial communication of said plurality of communications; an authorization module for authorizing each of said plurality of users to access a portion of said plurality of communications stored in said database to which each of said plurality of users have access rights based upon an access status and in conjunction with said inherited parameters responsibility module and wherein said access status is selected from the group consisting of an inclusive access in which access to each of said stored communications in said hierarchical structure is allowed and an exclusive access in which access to each of said stored communications in said hierarchical structure is allowed only where explicitly assigned; a response priority-based content placement module for determining a priority assignment for a response communication of said plurality of communications, wherein said priority assignment for a response communication is lower than said priority assignment for an initial communication; a reviewing module for presenting said synchronized plurality of communications in said hierarchical structure to said plurality of users for dynamic interaction enabled through further contributions of communications by said plurality of users, wherein said further contributions of communications are stored and accessed within said hierarchical structure in relation to said at least one of a plurality of topics that is user selected, wherein said further contributions are associated with at least one discussion thread comprising recorded communication under said at least one of a plurality of topics that is conducted between participating users of said plurality of users; and an output module for outputting a plurality of responses to said plurality of communications from said plurality of users to said plurality of communication devices.
|
20. A computer system for enhancing communication within a community, the computer system comprising: a storage medium containing code instructions that when executed on a processor in the computer system provide: an application platform running an application that organizes a plurality of communications, said application further comprising: a database for storing said plurality of communications; an inherited parameters responsibility module for establishing a hierarchical structure for said plurality of communications and for distributing control of said hierarchical structure to a plurality of users within the community, through selection of inherited parameters comprising access parameters defining access by said plurality of users to said plurality of communications organized within said hierarchical structure and wherein said access parameters are selected from the group consisting of an inclusive access in which access to each of said stored communications in said hierarchical structure is allowed except where excluded by said inherited parameters and an exclusive access in which access to each of said stored communications in said hierarchical structure is allowed only where explicitly assigned; an input module for capturing said plurality of communications within said hierarchical structure sent by said plurality of users from a plurality of communication devices and storing at least a portion of said plurality of communications in relation to at least one of a plurality of topics that is user selected, wherein said plurality of communications comprises at least one link to a resource associated with said at least a portion of said plurality of communications that is stored, wherein said link is available for access by authorized users; a thread synchronization module for synchronizing said plurality of communications within said hierarchical structure; an initial priority-based content placement module for determining a priority assignment for an initial communication of said plurality of communications; an authorization module for authorizing each of said plurality of users to access a portion of said plurality of communications stored in said database to which each of said plurality of users have access rights based upon an access status and in conjunction with said inherited parameters responsibility module and wherein said access status is selected from the group consisting of an inclusive access in which access to each of said stored communications in said hierarchical structure is allowed and an exclusive access in which access to each of said stored communications in said hierarchical structure is allowed only where explicitly assigned; a response priority-based content placement module for determining a priority assignment for a response communication of said plurality of communications, wherein said priority assignment for a response communication is lower than said priority assignment for an initial communication; a reviewing module for presenting said synchronized plurality of communications in said hierarchical structure to said plurality of users for dynamic interaction enabled through further contributions of communications by said plurality of users, wherein said further contributions of communications are stored and accessed within said hierarchical structure in relation to said at least one of a plurality of topics that is user selected, wherein said further contributions are associated with at least one discussion thread comprising recorded communication under said at least one of a plurality of topics that is conducted between participating users of said plurality of users; and an output module for outputting a plurality of responses to said plurality of communications from said plurality of users to said plurality of communication devices. 29. A computer system for enhancing communication within a community according to claim 20 wherein said thread synchronization module further comprises: wherein said initial priority-based content placement module is configured so that when reviewed by a one of said plurality of users accessing said application, said initial communication is reviewed in proper relationship to a portion of said plurality of communications related to said initial communication; and wherein said response priority-based content placement module is configured so that when reviewed by a one of said plurality of users accessing said application, said response communication is reviewed in proper relationship to a portion of said plurality of communications related to said response communication.
| 0.533726 |
1. A computer program product, comprising a non-transitory computer usable medium having a computer readable program code embodied therein, the computer readable program code configured to cause a computer to implement a method, the method comprising: providing, in a system, a set of logically separated storage areas, where each logically separated storage area is associated with a corresponding organization from a plurality of organizations and is inaccessible to organizations other than the corresponding organization; receiving a first search parameter from one of a plurality of subscribers of one of the plurality of organizations of the system, where the system provides hosted applications and content for the plurality of logically separate organizations; formulating, by the system, a search query including the first search parameter received from the subscriber; sending the search query to a query server; searching, by the system, indexed data records accessible to the subscriber via the organization of the system using the first search parameter, each of the plurality of indexed data records including: a last update field indicating a time when the record was last modified by any subscriber of the organization of the system; at least one last activity field separate from the last update field indicating a time when an action was last performed utilizing the record; a record owner field indicating an owner of the record within the organization, and a record owner role field indicating a location of the owner of the record within a hierarchy of the organization; returning, by the system, a plurality of matching records within the indexed data records, based on the searching of the indexed data records, wherein the matching records are ordered by: determining a normalized search relevancy score that is returned by a search engine for each of the plurality of matching records, assigning a last update score to each of the plurality of matching records based on a value of the last update field of each of the plurality of matching records, assigning a last activity score to each of the plurality of matching records based on a value of the last activity field of each of the plurality of matching records, multiplying the normalized search relevancy score by a first predetermined weight factor for each of the plurality of matching records, multiplying the last update score by a second predetermined weight factor for each of the plurality of matching records, multiplying the at least one last activity score by a third predetermined weight factor for each of the plurality of matching records, summing all of the weighted scores to determine a final relevancy score for each of the plurality of matching records, and ordering the plurality of first data records such that data records of the plurality of matching records having a higher final relevancy score are ranked higher than data records of the plurality of matching records having a lower final relevancy score.
|
1. A computer program product, comprising a non-transitory computer usable medium having a computer readable program code embodied therein, the computer readable program code configured to cause a computer to implement a method, the method comprising: providing, in a system, a set of logically separated storage areas, where each logically separated storage area is associated with a corresponding organization from a plurality of organizations and is inaccessible to organizations other than the corresponding organization; receiving a first search parameter from one of a plurality of subscribers of one of the plurality of organizations of the system, where the system provides hosted applications and content for the plurality of logically separate organizations; formulating, by the system, a search query including the first search parameter received from the subscriber; sending the search query to a query server; searching, by the system, indexed data records accessible to the subscriber via the organization of the system using the first search parameter, each of the plurality of indexed data records including: a last update field indicating a time when the record was last modified by any subscriber of the organization of the system; at least one last activity field separate from the last update field indicating a time when an action was last performed utilizing the record; a record owner field indicating an owner of the record within the organization, and a record owner role field indicating a location of the owner of the record within a hierarchy of the organization; returning, by the system, a plurality of matching records within the indexed data records, based on the searching of the indexed data records, wherein the matching records are ordered by: determining a normalized search relevancy score that is returned by a search engine for each of the plurality of matching records, assigning a last update score to each of the plurality of matching records based on a value of the last update field of each of the plurality of matching records, assigning a last activity score to each of the plurality of matching records based on a value of the last activity field of each of the plurality of matching records, multiplying the normalized search relevancy score by a first predetermined weight factor for each of the plurality of matching records, multiplying the last update score by a second predetermined weight factor for each of the plurality of matching records, multiplying the at least one last activity score by a third predetermined weight factor for each of the plurality of matching records, summing all of the weighted scores to determine a final relevancy score for each of the plurality of matching records, and ordering the plurality of first data records such that data records of the plurality of matching records having a higher final relevancy score are ranked higher than data records of the plurality of matching records having a lower final relevancy score. 3. The computer program product of claim 1 , further including displaying at least a portion of the matching records in said order.
| 0.596105 |
15. The method of claim 14 , wherein the operation of receiving a voice-based response from a mediation system, at the first communication device of the calling party, further comprises: receiving notification at the first communication device of the calling party of a procedure for leaving a voice-based mail message for the called party.
|
15. The method of claim 14 , wherein the operation of receiving a voice-based response from a mediation system, at the first communication device of the calling party, further comprises: receiving notification at the first communication device of the calling party of a procedure for leaving a voice-based mail message for the called party. 16. The method of claim 15 , wherein the operation of receiving a voice-based message from a mediation system, at the first communication device of the calling party, further comprises: receiving a mediation notification at the first communication device, wherein the mediation bypass notification informs the calling party that the called party may accept a subsequent telephone call from the calling party.
| 0.855898 |
14. The media of claim 13 , wherein updating the node score includes utilizing the formula:
node score=prior node score+α·Σoutgoing edge scores+β·Σincoming edge scores, wherein α and β are selectable parameters.
|
14. The media of claim 13 , wherein updating the node score includes utilizing the formula:
node score=prior node score+α·Σoutgoing edge scores+β·Σincoming edge scores, wherein α and β are selectable parameters. 15. The media of claim 14 , wherein α and β are selected based on a training set of documents.
| 0.964572 |
15. A system for associating events occurring in connection with a computing device with electronic documents, comprising: a processor to instruct: a composer to compose a number of search queries based on text included in an event message, the event message being generated as a result of change in state of a process within the computing device; and a ranker to rank electronic documents within results of a search performed based on the composed search queries, in which the ranker ranks the electronic documents within the results of the search based on a quality of information (QOI) ranking criteria, in which ranking the electronic documents based on the QOI ranking criteria comprises extracting a number of attributes from the electronic documents within the results of the search, in which the extracted attributes designate whether questions within the electronic documents were answered or not answered.
|
15. A system for associating events occurring in connection with a computing device with electronic documents, comprising: a processor to instruct: a composer to compose a number of search queries based on text included in an event message, the event message being generated as a result of change in state of a process within the computing device; and a ranker to rank electronic documents within results of a search performed based on the composed search queries, in which the ranker ranks the electronic documents within the results of the search based on a quality of information (QOI) ranking criteria, in which ranking the electronic documents based on the QOI ranking criteria comprises extracting a number of attributes from the electronic documents within the results of the search, in which the extracted attributes designate whether questions within the electronic documents were answered or not answered. 16. The system of claim 15 , in which ranking the electronic documents within results of the search based on a quality of information (QOI) ranking criteria comprises: extracting a number of attributes from the electronic documents within the results of the search; and ranking the electronic documents based on the extracted attributes.
| 0.728148 |
10. A computer program product including software instructions stored on a computer-readable medium, adapted to enable a computer to perform a routine for real-time correlating between requests to a web server and requests to a database server, the routing comprising: identifying correlated pairs of structured query language (SQL) templates and uniform resource locators (URLs); for each incoming request to the database server binding a web application context in which the request to the database server is made; wherein identifying the correlated pairs of SQL templates and URLs, further comprises: creating a first matrix, wherein each row of the first matrix represents a URL and each column represents a SQL template and wherein each entry in the first matrix includes a counter; extracting the URL from an incoming HTTP request; inserting the URL to an available row in the first matrix; adding the incoming HTTP request to a list of pending HTTP requests for the URL; converting an incoming SQL query to a SQL template; inserting the SQL template to an available column in the first matrix; and incrementing the counter of each entry of a respective URL that has at least one pending HTTP request; and marking all entries in the first matrix having a counter's value greater than a predefined threshold.
|
10. A computer program product including software instructions stored on a computer-readable medium, adapted to enable a computer to perform a routine for real-time correlating between requests to a web server and requests to a database server, the routing comprising: identifying correlated pairs of structured query language (SQL) templates and uniform resource locators (URLs); for each incoming request to the database server binding a web application context in which the request to the database server is made; wherein identifying the correlated pairs of SQL templates and URLs, further comprises: creating a first matrix, wherein each row of the first matrix represents a URL and each column represents a SQL template and wherein each entry in the first matrix includes a counter; extracting the URL from an incoming HTTP request; inserting the URL to an available row in the first matrix; adding the incoming HTTP request to a list of pending HTTP requests for the URL; converting an incoming SQL query to a SQL template; inserting the SQL template to an available column in the first matrix; and incrementing the counter of each entry of a respective URL that has at least one pending HTTP request; and marking all entries in the first matrix having a counter's value greater than a predefined threshold. 11. The computer program product of claim 10 , wherein requests to web servers are hypertext transfer protocol (HTTP) requests and wherein requests to database server are SQL queries.
| 0.544671 |
22. A method for integrating collaborative activities amongst participants in a social network utilizing computers having nodes and storage comprising the steps of: in a social network having linked computers, gathering information for at least two participants on the social network via at least one of the computers, and assigning each participant to a computer node; identifying an original state for each computer node via at least another of the computers; identifying similarly-situated participants by identifying similarly-situated computer nodes in the network via the at least another of the computers; for each of the computer nodes having a new state at some point in time that is a change in state from the original state, identifying the new state for each of the computer nodes having the new state via at least another of the computers wherein the new state is different than the original state and indicates a state change; identifying the change to the computer node's new state from the original state of each computer node that was identified for each of the similarly-situated participants via the at least another of the computers after the state change; storing on the storage, information about the identified state change; and managing collaboration of at least one similarly-situated participant assigned to a computer node via at least one of the networks.
|
22. A method for integrating collaborative activities amongst participants in a social network utilizing computers having nodes and storage comprising the steps of: in a social network having linked computers, gathering information for at least two participants on the social network via at least one of the computers, and assigning each participant to a computer node; identifying an original state for each computer node via at least another of the computers; identifying similarly-situated participants by identifying similarly-situated computer nodes in the network via the at least another of the computers; for each of the computer nodes having a new state at some point in time that is a change in state from the original state, identifying the new state for each of the computer nodes having the new state via at least another of the computers wherein the new state is different than the original state and indicates a state change; identifying the change to the computer node's new state from the original state of each computer node that was identified for each of the similarly-situated participants via the at least another of the computers after the state change; storing on the storage, information about the identified state change; and managing collaboration of at least one similarly-situated participant assigned to a computer node via at least one of the networks. 27. The method of claim 22 wherein the identification of similarly-situated participants is based at least in part on the new state.
| 0.56164 |
9. A method for associating and aggregating attributes in a token-based environment, comprising: storing a plurality of tokens indicating a device has been identified and is capable of consuming a resource; receiving a subject token indicating an attempt to authenticate a user that is attempting to access a resource, the subject token representing at least one attribute associated with the user; determining, by a hardware processor, at least one token-based rule based at least in part upon a token in the plurality of tokens and the subject token, the at least one token-based rule indicating a plurality of attributes required to access the resource; determining, by the hardware processor, from the at least one token-based rule, the plurality of attributes required to access the resource; determining, by the hardware processor, a second plurality of attributes represented by the plurality of tokens and the subject token; determining, by the hardware processor, at least one missing attribute, the at least one missing attribute in the plurality of attributes but not in the second plurality of attributes; requesting the at least one missing attribute; and receiving, in response to the request for the at least one missing attribute, a first token representing the at least one missing attribute.
|
9. A method for associating and aggregating attributes in a token-based environment, comprising: storing a plurality of tokens indicating a device has been identified and is capable of consuming a resource; receiving a subject token indicating an attempt to authenticate a user that is attempting to access a resource, the subject token representing at least one attribute associated with the user; determining, by a hardware processor, at least one token-based rule based at least in part upon a token in the plurality of tokens and the subject token, the at least one token-based rule indicating a plurality of attributes required to access the resource; determining, by the hardware processor, from the at least one token-based rule, the plurality of attributes required to access the resource; determining, by the hardware processor, a second plurality of attributes represented by the plurality of tokens and the subject token; determining, by the hardware processor, at least one missing attribute, the at least one missing attribute in the plurality of attributes but not in the second plurality of attributes; requesting the at least one missing attribute; and receiving, in response to the request for the at least one missing attribute, a first token representing the at least one missing attribute. 15. The method of claim 9 , the first token comprises a new subject token.
| 0.753388 |
26. The system of claim 17 wherein determining permissible transitions between the objects of the hierarchical data format in the input stream includes processing the compilation tree representation to determine all permissible transitions between the nodes of the compilation tree representation.
|
26. The system of claim 17 wherein determining permissible transitions between the objects of the hierarchical data format in the input stream includes processing the compilation tree representation to determine all permissible transitions between the nodes of the compilation tree representation. 29. The system of claim 26 wherein generating the compilation tree representation further comprises generating an elaborated edge for each permissible transition identified, the elaborated edge including a source node associated with the transition, a destination node associated with the transition, a container node associated with the transition, and a looping behavior associated with the transition.
| 0.880338 |
19. A system that handles input parameters, the system comprising: one or more processors; and memory to store a plurality of computer-executable instructions for execution by the one or more processors, the computer-executable instructions, when execute, operable to: receive a string into a command line interactive environment, the string including a plurality of pipelined cmdlets, the plurality of pipelined cmdlets to share use of one or more common directive functions provided by an administrative tool framework, the one or more common directive functions are applicable to each of the cmdlets via attributions; identify an attribution for each of the plurality of pipelined cmdlets within the string, each attribution to specify a constraint for an associated construct; identify the associated construct of each attribution in the string; save information that correlates each constraint with its associated construct as metadata that is associated with each construct; and execute the string in the interactive environment, wherein the execution includes: executing a first cmdlet of the plurality of pipelined cmdlets by using metadata associated with a first construct to apply a first constraint to the first construct to produce output objects; providing the output objects to a second cmdlet of the plurality of pipelined cmdlets as input for a second construct; and executing the second cmdlet by using metadata associated with the second construct to apply a second constraint to the second construct, wherein the one or more common directive functions used by each cmdlet is specified by a corresponding data structure that is instantiated into an object for the administrative tool framework.
|
19. A system that handles input parameters, the system comprising: one or more processors; and memory to store a plurality of computer-executable instructions for execution by the one or more processors, the computer-executable instructions, when execute, operable to: receive a string into a command line interactive environment, the string including a plurality of pipelined cmdlets, the plurality of pipelined cmdlets to share use of one or more common directive functions provided by an administrative tool framework, the one or more common directive functions are applicable to each of the cmdlets via attributions; identify an attribution for each of the plurality of pipelined cmdlets within the string, each attribution to specify a constraint for an associated construct; identify the associated construct of each attribution in the string; save information that correlates each constraint with its associated construct as metadata that is associated with each construct; and execute the string in the interactive environment, wherein the execution includes: executing a first cmdlet of the plurality of pipelined cmdlets by using metadata associated with a first construct to apply a first constraint to the first construct to produce output objects; providing the output objects to a second cmdlet of the plurality of pipelined cmdlets as input for a second construct; and executing the second cmdlet by using metadata associated with the second construct to apply a second constraint to the second construct, wherein the one or more common directive functions used by each cmdlet is specified by a corresponding data structure that is instantiated into an object for the administrative tool framework. 21. The system of claim 19 , wherein at least one of the attributions specifies applying intellisense to the construct to auto-complete the construct.
| 0.589457 |
13. The method of claim 3 , wherein the aspect-oriented action is related to a security check.
|
13. The method of claim 3 , wherein the aspect-oriented action is related to a security check. 14. The method of claim 13 , wherein during the applying step, the security check is applied to one or more identified units of source code to determine if the one or more selected units of source code meet a plurality of security guidelines associated with the security check.
| 0.902319 |
16. A computer-implemented method for searching for multidimensional social media content, comprising: receiving, from a user, a request for a search of social media content, wherein said search is directed to a search term selected by said user, wherein said search term comprises one or more of a social contributor, social entity and social tag; conducting, with the aid of a computer processor operatively coupled to a database of social media content, a search of social media content in said database, wherein said search of social media content is directed to said search term, wherein said social media content in said database is collected from a plurality of social media providers, wherein said social media content is organized in said database based upon relationships between social entities, social contributors and social tags identified in said social media content, wherein said social contributors have posted said social media content on said plurality of social media providers, wherein each of said social entities is a subject of an individual social media content, wherein said social entities are not social contributors for said collected social media content, and wherein said relationships are based upon social tags present in social media content of social entities and social contributors; sorting one or more results of said search by a social score that is calculated from a social engagement score and a social post score, wherein said social engagement score is based on a social relevance of said social contributors and social entities and is determined by the number of friends, fans, followers, or other measurement that assesses a social network presence of said social contributors and social entities, wherein said social post score is based on a degree of interaction of a social contributor or a social entity among said social contributors and social entities with social posts at one or more remote social media providers, wherein said degree of interaction is determined as a net of positive and any negative interactions by said social contributor or social entity with respect to said social posts on said one or more remote social media providers; grouping, with the aid of a computer processor, at least a portion of said one or more results of said search by social contributor, social entity and social tag to provide a first subset and a second subset of results, wherein the second subset has a hierarchical relationship to the first subset; generating a social stream from at least a portion of said one or more results of said search, wherein said social stream includes social media activities of a social entity or social contributor that can be searched, grouped and filtered by said user; and displaying, on a graphical user interface of said user including a first panel and a second panel, said social stream comprising the first subset and the second subset in said first panel in sequence upon said search; said hierarchical relationship between said first subset and said subset in said second panel; and a social search path that is indicative of a search or navigation path taken by said user in arriving at said social stream comprising said first subset and said second subset, thereby presenting said results to said user hierarchically across multiple dimensions to reflect their relationship to said search term.
|
16. A computer-implemented method for searching for multidimensional social media content, comprising: receiving, from a user, a request for a search of social media content, wherein said search is directed to a search term selected by said user, wherein said search term comprises one or more of a social contributor, social entity and social tag; conducting, with the aid of a computer processor operatively coupled to a database of social media content, a search of social media content in said database, wherein said search of social media content is directed to said search term, wherein said social media content in said database is collected from a plurality of social media providers, wherein said social media content is organized in said database based upon relationships between social entities, social contributors and social tags identified in said social media content, wherein said social contributors have posted said social media content on said plurality of social media providers, wherein each of said social entities is a subject of an individual social media content, wherein said social entities are not social contributors for said collected social media content, and wherein said relationships are based upon social tags present in social media content of social entities and social contributors; sorting one or more results of said search by a social score that is calculated from a social engagement score and a social post score, wherein said social engagement score is based on a social relevance of said social contributors and social entities and is determined by the number of friends, fans, followers, or other measurement that assesses a social network presence of said social contributors and social entities, wherein said social post score is based on a degree of interaction of a social contributor or a social entity among said social contributors and social entities with social posts at one or more remote social media providers, wherein said degree of interaction is determined as a net of positive and any negative interactions by said social contributor or social entity with respect to said social posts on said one or more remote social media providers; grouping, with the aid of a computer processor, at least a portion of said one or more results of said search by social contributor, social entity and social tag to provide a first subset and a second subset of results, wherein the second subset has a hierarchical relationship to the first subset; generating a social stream from at least a portion of said one or more results of said search, wherein said social stream includes social media activities of a social entity or social contributor that can be searched, grouped and filtered by said user; and displaying, on a graphical user interface of said user including a first panel and a second panel, said social stream comprising the first subset and the second subset in said first panel in sequence upon said search; said hierarchical relationship between said first subset and said subset in said second panel; and a social search path that is indicative of a search or navigation path taken by said user in arriving at said social stream comprising said first subset and said second subset, thereby presenting said results to said user hierarchically across multiple dimensions to reflect their relationship to said search term. 21. The computer-implemented method of claim 16 , wherein said hierarchical relationship and said subsets of results are simultaneously displayed in said first panel and said second panel, respectively.
| 0.550702 |
12. A method in accordance with claim 1 , further comprising: providing one or more additional recommended items to the user based on the modified implicit profile.
|
12. A method in accordance with claim 1 , further comprising: providing one or more additional recommended items to the user based on the modified implicit profile. 13. A method in accordance with claim 12 , wherein the one or more additional recommended items or the peer recommendations provided to the user are modified based on the modified implicit profile.
| 0.970771 |
14. The system of claim 13 , wherein the identification of the third text fragment is performed in response to identifying the absence of other text fragments from among the one or more text fragments that are horizontally adjacent to the second text fragment.
|
14. The system of claim 13 , wherein the identification of the third text fragment is performed in response to identifying the absence of other text fragments from among the one or more text fragments that are horizontally adjacent to the second text fragment. 15. The system of claim 14 , wherein the block type assigned to each of the one or more wrapping regions corresponds to the highest of the tabular score, the narrative score, and the label score calculated for the respective wrapping region.
| 0.979044 |
12. An apparatus that creates a tutorial presentation, comprising: (a) a processor that runs a computer program to create the tutorial presentation, the computer program comprising of logic; (b) a memory that stores information under control of the processor; (c) logic that matches a profile against a simulation domain, wherein the profile comprises a set of criteria and identifies a desired aspect for a current simulation task; (d) logic that presents information indicative of a goal; (e) logic that integrates information that motivates accomplishment of the goal; (f) logic that monitors progress toward the goal, determines at least one profile that is true for the current simulation task from a set of profiles, and provides feedback to a student, based on the at least one profile, the at least one profile comprising at least one collective characteristic, the at least one collective characteristic being a conditional using a plurality of characteristics as operands at a particular instance of time, each characteristic identifying a subset of the simulation domain, at least one of the plurality of characteristics being time-dependent; and (g) logic that displays details of the computer program and that displays the tutorial presentation as the tutorial presentation executes and further comprises: firing the at least one profile to identify mistakes and correct answers provided by the student, and triggering a topic in a concept tree when the at least one profile fires, wherein the concept tree contains a plurality of concepts associated with the current simulation task and, wherein the tutorial presentation provides a cognitive educational experience.
|
12. An apparatus that creates a tutorial presentation, comprising: (a) a processor that runs a computer program to create the tutorial presentation, the computer program comprising of logic; (b) a memory that stores information under control of the processor; (c) logic that matches a profile against a simulation domain, wherein the profile comprises a set of criteria and identifies a desired aspect for a current simulation task; (d) logic that presents information indicative of a goal; (e) logic that integrates information that motivates accomplishment of the goal; (f) logic that monitors progress toward the goal, determines at least one profile that is true for the current simulation task from a set of profiles, and provides feedback to a student, based on the at least one profile, the at least one profile comprising at least one collective characteristic, the at least one collective characteristic being a conditional using a plurality of characteristics as operands at a particular instance of time, each characteristic identifying a subset of the simulation domain, at least one of the plurality of characteristics being time-dependent; and (g) logic that displays details of the computer program and that displays the tutorial presentation as the tutorial presentation executes and further comprises: firing the at least one profile to identify mistakes and correct answers provided by the student, and triggering a topic in a concept tree when the at least one profile fires, wherein the concept tree contains a plurality of concepts associated with the current simulation task and, wherein the tutorial presentation provides a cognitive educational experience. 14. The apparatus that creates a tutorial presentation as recited in claim 12 , including logic that receives and analyzes user responses using a rule based expert training system to determine details of the computer program to display.
| 0.5 |
5. The computer-implemented method of claim 4 , wherein performing the search further comprises determining a multi-dimensional point of the plurality of documents stored within the document context.
|
5. The computer-implemented method of claim 4 , wherein performing the search further comprises determining a multi-dimensional point of the plurality of documents stored within the document context. 6. The computer-implemented method of claim 5 , wherein performing the search further comprises measuring a distance between the multi-dimensional point of the plurality of documents and the multi-dimensional point of the user profile.
| 0.830719 |
3. The method of claim 1 , wherein the HQM expression is defined by the first and second providers.
|
3. The method of claim 1 , wherein the HQM expression is defined by the first and second providers. 4. The method of claim 3 , wherein the step of defining the HQM expression comprises allowing the first provider to drag and drop elements of selection criteria to form the HQM expression.
| 0.949357 |
18. A system comprising computer-executable instructions embodied on a computer-readable storage medium that when executed on one or more processors provides efficient storage and access of geographic data, comprising: means to obtain a query from a user, the query identifying a geographic feature to be located, a starting context for locating a data object in a data store corresponding to the geographic feature, and a navigation strategy for navigating a hierarchical data store; means to access the hierarchical data store, the hierarchical data store comprising a plurality of contexts arranged in a hierarchy of contexts of at least two levels, each context storing at least one of a link to another context or a data object corresponding to a geographic feature, wherein each context corresponds to a geographic aspect pertaining to each geographic feature represented by a data object in the context and to all child contexts of the respective context, and wherein at least one context of the plurality of contexts links to a sibling context in the hierarchy; means to search the contexts of the hierarchical data store for the identified geographic feature of the query according to the navigation strategy specified in the query beginning at the starting context identified in the query; and means to return at least one data object corresponding to the identified geographic feature in response to the query upon locating the identified geographic feature in the at least one data object of a context in the hierarchical data store.
|
18. A system comprising computer-executable instructions embodied on a computer-readable storage medium that when executed on one or more processors provides efficient storage and access of geographic data, comprising: means to obtain a query from a user, the query identifying a geographic feature to be located, a starting context for locating a data object in a data store corresponding to the geographic feature, and a navigation strategy for navigating a hierarchical data store; means to access the hierarchical data store, the hierarchical data store comprising a plurality of contexts arranged in a hierarchy of contexts of at least two levels, each context storing at least one of a link to another context or a data object corresponding to a geographic feature, wherein each context corresponds to a geographic aspect pertaining to each geographic feature represented by a data object in the context and to all child contexts of the respective context, and wherein at least one context of the plurality of contexts links to a sibling context in the hierarchy; means to search the contexts of the hierarchical data store for the identified geographic feature of the query according to the navigation strategy specified in the query beginning at the starting context identified in the query; and means to return at least one data object corresponding to the identified geographic feature in response to the query upon locating the identified geographic feature in the at least one data object of a context in the hierarchical data store. 20. The system of claim 18 , means to search the contexts of the hierarchical data store further comprises: means to search for the identified geographic feature within contexts having a sibling relationship with the starting context when the navigation strategy is identified as a sibling navigation strategy, wherein sibling relationships between contexts are determined based at least on a geographic proximity between geographical features represented by the contexts.
| 0.509414 |
11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to: receive a document from a corpus of documents; determine whether or not the document comprises one or more titles; in response to the document comprising one or more titles, evaluate the one or more titles to determine if the one or more titles sufficiently represent content of the document; in response to either the document not comprising one or more titles or the one or more titles not being sufficient to represent the content of the document: generate a title for the document based on an analysis of content of the document; generate a score value for the title based on a measure of a degree to which the title represents the content of the document; and store the score value in association with the title as document metadata associated with the document; and output the document and document metadata to a Question and Answer (QA) system, wherein the QA system utilizes the document metadata and document to generate a candidate answer to an input question, wherein evaluating the one or more titles to determine if the one or more titles sufficiently represent the content of the document comprises: comparing characteristics of the one or more titles to subject matter content of the document; generating a score for each title in the one or more titles based on results of the comparison; comparing each score for each title to one or more thresholds representing sufficiency of titles; and determining that the one or more titles sufficiently represent the content of the document in response to at least one of the scores having a predetermined relationship to the one or more thresholds.
|
11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to: receive a document from a corpus of documents; determine whether or not the document comprises one or more titles; in response to the document comprising one or more titles, evaluate the one or more titles to determine if the one or more titles sufficiently represent content of the document; in response to either the document not comprising one or more titles or the one or more titles not being sufficient to represent the content of the document: generate a title for the document based on an analysis of content of the document; generate a score value for the title based on a measure of a degree to which the title represents the content of the document; and store the score value in association with the title as document metadata associated with the document; and output the document and document metadata to a Question and Answer (QA) system, wherein the QA system utilizes the document metadata and document to generate a candidate answer to an input question, wherein evaluating the one or more titles to determine if the one or more titles sufficiently represent the content of the document comprises: comparing characteristics of the one or more titles to subject matter content of the document; generating a score for each title in the one or more titles based on results of the comparison; comparing each score for each title to one or more thresholds representing sufficiency of titles; and determining that the one or more titles sufficiently represent the content of the document in response to at least one of the scores having a predetermined relationship to the one or more thresholds. 15. The computer program product of claim 11 , wherein the computer readable program further causes the computing device to generate a score value for the title based on a measure of a degree to which the title represents the content of the document comprises utilizing a trained evaluation model to evaluate a relevance and degree of coverage of a subject matter of the document of the title, and wherein the trained evaluation model evaluates the relevance and degree of coverage based on evaluation model features, and wherein the evaluation model features comprise at least one of a frequency of terms occurring in the document and in the title, acronyms used in the title and the document, word popularity, whether the title is obtained from an abstract of the document, or whether the title is obtained from identifiable key subsections of the document.
| 0.509016 |
2. The method of claim 1 , further comprising: detecting user input of a second new character at a second location in the scanned document; determining that the second new character is not among the synthesized characters of the synthesized digital font; and based on the determination that the second new character is not among the synthesized characters of the synthesized digital font, creating a similar-looking character for the second new character.
|
2. The method of claim 1 , further comprising: detecting user input of a second new character at a second location in the scanned document; determining that the second new character is not among the synthesized characters of the synthesized digital font; and based on the determination that the second new character is not among the synthesized characters of the synthesized digital font, creating a similar-looking character for the second new character. 3. The method of claim 2 , further comprising adding the similar-looking character to the editable version of the scanned document at the second location.
| 0.901341 |
10. A computer-implemented method of recognizing speech for a medical response environment, the method comprising: operating one or more filters to each generate a set of processed audio data based on raw audio data received from one or more computing devices, the one or more filters being operated to apply filter processes to the raw audio data to generate the set of processed audio data, wherein the one or more filters comprise at least one filter appropriate for the medical response environment; operating a translator to provide a set of translation results for the raw audio data based on the set of processed audio data, each translation result being associated with at least one processed audio data and each translation result including a text data and a confidence level associated with that text data; and in response to receiving the set of translation results, automatically trigger a decision controller to select the text data that corresponds to the raw audio data, wherein the decision controller is operable to: identify at least one translation result from the set of translation results that includes the text data associated with the confidence level that exceeds a confidence threshold, determine whether the identified at least one translation result comprises more than one translation result; in response to determining the identified at least one translation result comprises more than one translation result, determine an occurrence frequency for each text data of the identified at least one translation result and select the text data based on the occurrence frequency, the occurrence frequency representing a number of times that the text data appears in the set of translation results; and generate an output signal associated with the selection by the decision controller.
|
10. A computer-implemented method of recognizing speech for a medical response environment, the method comprising: operating one or more filters to each generate a set of processed audio data based on raw audio data received from one or more computing devices, the one or more filters being operated to apply filter processes to the raw audio data to generate the set of processed audio data, wherein the one or more filters comprise at least one filter appropriate for the medical response environment; operating a translator to provide a set of translation results for the raw audio data based on the set of processed audio data, each translation result being associated with at least one processed audio data and each translation result including a text data and a confidence level associated with that text data; and in response to receiving the set of translation results, automatically trigger a decision controller to select the text data that corresponds to the raw audio data, wherein the decision controller is operable to: identify at least one translation result from the set of translation results that includes the text data associated with the confidence level that exceeds a confidence threshold, determine whether the identified at least one translation result comprises more than one translation result; in response to determining the identified at least one translation result comprises more than one translation result, determine an occurrence frequency for each text data of the identified at least one translation result and select the text data based on the occurrence frequency, the occurrence frequency representing a number of times that the text data appears in the set of translation results; and generate an output signal associated with the selection by the decision controller. 15. The computer-implemented method of claim 10 , wherein the confidence threshold comprises a set of confidence thresholds, the set of confidence thresholds including a first confidence threshold and at least one subsequent confidence threshold that is lower than the first confidence threshold; and the method further comprises: determining that none of the text data is associated with the respective confidence level that exceeds the first confidence threshold; and determining whether any text data is associated with the respective confidence level that exceeds the at least one subsequent confidence threshold.
| 0.5 |
7. The method of claim 1 , wherein prior to evaluating: receiving and processing the user query input to determine a key term and one or more associated terms, wherein the key term is a query string and the one or more associated terms comprise taxonomic hierarchal relationship nodes related to the key term.
|
7. The method of claim 1 , wherein prior to evaluating: receiving and processing the user query input to determine a key term and one or more associated terms, wherein the key term is a query string and the one or more associated terms comprise taxonomic hierarchal relationship nodes related to the key term. 10. The method of claim 7 , wherein the evaluating the presentation media to select winning media candidates further comprises using design rules to select one or more candidate template elements as winning media candidates based on a context of at least one of the key term or the one more associated terms.
| 0.868794 |
6. A computer program product for use in conjunction with a computer system, the computer program product comprising a computer readable storage medium and a computer program mechanism embedded therein, the computer program mechanism comprising: a one-way hash procedure for generating a digest of a specified document; pseudo-random key generation instructions, including instructions for combining the document digest with at least one other value in accordance with a predefined computational methodology to generate a pseudo-random key k; and digital signature generation instructions for generating a digital signature for the specified document as a predefined function of a private key, the document digest, and the pseudo-random key k; wherein the private key is associated with a person or entity signing the specified document; whereby a distinct pseudo-random key is generated for each distinct specified document; and for a given value of the private key, a distinct digital signature is generated for each distinct specified document.
|
6. A computer program product for use in conjunction with a computer system, the computer program product comprising a computer readable storage medium and a computer program mechanism embedded therein, the computer program mechanism comprising: a one-way hash procedure for generating a digest of a specified document; pseudo-random key generation instructions, including instructions for combining the document digest with at least one other value in accordance with a predefined computational methodology to generate a pseudo-random key k; and digital signature generation instructions for generating a digital signature for the specified document as a predefined function of a private key, the document digest, and the pseudo-random key k; wherein the private key is associated with a person or entity signing the specified document; whereby a distinct pseudo-random key is generated for each distinct specified document; and for a given value of the private key, a distinct digital signature is generated for each distinct specified document. 7. The computer program product of claim 6, wherein the predefined one-way hash function has the property that it generates distinct digest values for virtually all pairs of distinct documents.
| 0.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.