patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
8,195,467 | 20 | 25 | 20. A wireless electronic device comprising: a speech recognizer coupled to receive first speech input; a memory, the memory comprising one or more stored resource access numbers; a voice user interface for interacting with a user using speech recognition or speech synthesis; and a Bluetooth wireless transceiver for communicating with a second electronic device, the second electronic device comprising a cellular phone, wherein said wireless electronic device is a Bluetooth headset, wherein the speech recognizer is configured to recognize a first spoken command word, and wherein if the first command word is recognized in the first speech input, then the speech recognizer generates a corresponding first command result, and wherein if the first command result matches a predefined criteria, then the Bluetooth headset automatically accesses the resource access number from memory and establishes a Bluetooth communication channel between said Bluetooth headset and the second electronic device and sends the resource access number and an externally executed command to the second electronic device, wherein the externally executed command and resource access number are received by the second electronic device, and the externally executed command is executed on the second electronic device, and in accordance therewith, the second electronic device uses the resource access number to establish a communication channel between said second electronic device and at least one remote device, the at least one remote device comprising a voice search engine, and wherein a user provides second speech input to said microphone, and wherein the second speech input is sent from the Bluetooth headset to the second electronic device and through the communication channel to the at least one remote device, and the voice search engine on the at least one remote device performs speech recognition on the second speech input. | 20. A wireless electronic device comprising: a speech recognizer coupled to receive first speech input; a memory, the memory comprising one or more stored resource access numbers; a voice user interface for interacting with a user using speech recognition or speech synthesis; and a Bluetooth wireless transceiver for communicating with a second electronic device, the second electronic device comprising a cellular phone, wherein said wireless electronic device is a Bluetooth headset, wherein the speech recognizer is configured to recognize a first spoken command word, and wherein if the first command word is recognized in the first speech input, then the speech recognizer generates a corresponding first command result, and wherein if the first command result matches a predefined criteria, then the Bluetooth headset automatically accesses the resource access number from memory and establishes a Bluetooth communication channel between said Bluetooth headset and the second electronic device and sends the resource access number and an externally executed command to the second electronic device, wherein the externally executed command and resource access number are received by the second electronic device, and the externally executed command is executed on the second electronic device, and in accordance therewith, the second electronic device uses the resource access number to establish a communication channel between said second electronic device and at least one remote device, the at least one remote device comprising a voice search engine, and wherein a user provides second speech input to said microphone, and wherein the second speech input is sent from the Bluetooth headset to the second electronic device and through the communication channel to the at least one remote device, and the voice search engine on the at least one remote device performs speech recognition on the second speech input. 25. The device of claim 20 wherein the communication channel comprises a cellular phone network. | 0.920133 |
8,166,060 | 12 | 13 | 12. The location search device according to claim 11 , wherein if the pressed time is not less than the specified time and the character determination portion determines that none of the search object character strings stored in the character string storage portion partially matches the character string that includes the character to be displayed, the input character display control portion displays the character in a form that is different from a form that is used when the character determination portion determines that at least one of the search object character strings stored in the character string storage portion partially matches the character string that includes the character. | 12. The location search device according to claim 11 , wherein if the pressed time is not less than the specified time and the character determination portion determines that none of the search object character strings stored in the character string storage portion partially matches the character string that includes the character to be displayed, the input character display control portion displays the character in a form that is different from a form that is used when the character determination portion determines that at least one of the search object character strings stored in the character string storage portion partially matches the character string that includes the character. 13. The location search device according to claim 12 , wherein if the character determination portion determines that none of the search object character strings stored in the character string storage portion partially matches the character string that includes the character to be displayed, the input character display control portion displays the character using, at least one of a font and a color that is different from the corresponding at least one of a font and a color that is used when the character determination portion determines that at least one of the search object character strings stored in the character string storage portion partially matches the character string that includes the character. | 0.606828 |
9,852,348 | 15 | 21 | 15. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by one or more computers cause the one or more computers to perform operations comprising: receiving a scan request, wherein the scan request includes a plurality of text images, each text image representing a portion of a text document, wherein the plurality of text images includes a first text image and a second text image that at least partially overlap; for each text image of the plurality of text images: rectifying the text image to generate a text image with parallel image lines, generating a plurality of word bounding boxes that enclose one or more connected components in the text image, wherein each word bounding box is associated with a respective word of the text image, and generating, for each respective word bounding box in the text image, a vector that describes a shape of the respective word; combining text images of the plurality of text images that at least partially overlap to form a single text document including combining the first text image of the plurality of text images and the second text image of the plurality of text images by matching one or more shape descriptors from a first set of vectors generated for each respective word in the first text image and one or more shape descriptors from a second set of vectors generated for each respective word in the second text image; and providing the combined image as a scannable document. | 15. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by one or more computers cause the one or more computers to perform operations comprising: receiving a scan request, wherein the scan request includes a plurality of text images, each text image representing a portion of a text document, wherein the plurality of text images includes a first text image and a second text image that at least partially overlap; for each text image of the plurality of text images: rectifying the text image to generate a text image with parallel image lines, generating a plurality of word bounding boxes that enclose one or more connected components in the text image, wherein each word bounding box is associated with a respective word of the text image, and generating, for each respective word bounding box in the text image, a vector that describes a shape of the respective word; combining text images of the plurality of text images that at least partially overlap to form a single text document including combining the first text image of the plurality of text images and the second text image of the plurality of text images by matching one or more shape descriptors from a first set of vectors generated for each respective word in the first text image and one or more shape descriptors from a second set of vectors generated for each respective word in the second text image; and providing the combined image as a scannable document. 21. The computer storage medium of claim 15 , wherein combining the plurality of text images further comprises: blending the plurality of text images that form the single text document; de-skewing the single text document; and performing optical character recognition on the single text document. | 0.767661 |
7,899,810 | 9 | 11 | 9. A hardware computer storage device with computer executable instructions for accessing a database, comprising executable instructions to: present a user at a client computer with a set of business objects, wherein the business objects include familiar terms corresponding to information about the structure of the database; receive a plurality of selected business objects; generate a SQL query from the selected business objects, wherein the SQL query includes a SELECT clause and a FROM clause, wherein the FROM clause includes a list of tables associated with selected business objects; receive a selection of a context from several contexts applicable to the SQL query; wherein the selected context includes a list of joins between tables that give meaning to the selected business objects; receive a condition used to restrict the scope of values returned from the database; translate the condition into a WHERE clause in the SQL query; and transmit the SQL query to the database. | 9. A hardware computer storage device with computer executable instructions for accessing a database, comprising executable instructions to: present a user at a client computer with a set of business objects, wherein the business objects include familiar terms corresponding to information about the structure of the database; receive a plurality of selected business objects; generate a SQL query from the selected business objects, wherein the SQL query includes a SELECT clause and a FROM clause, wherein the FROM clause includes a list of tables associated with selected business objects; receive a selection of a context from several contexts applicable to the SQL query; wherein the selected context includes a list of joins between tables that give meaning to the selected business objects; receive a condition used to restrict the scope of values returned from the database; translate the condition into a WHERE clause in the SQL query; and transmit the SQL query to the database. 11. The hardware computer storage device of claim 9 further comprising executable instructions to: define a set of linked tables with the list of tables and the list of joins, wherein a join is a relational synchronization between tables; add the set of linked tables to the FROM clause if the set of linked tables is linked by one path; add the set of linked tables along a particular path defined by the selected context to the FROM clause if the set of linked tables are linked by multiple paths, wherein the context is a set of joins including all of the tables in the set of linked tables; and add the set of linked tables arranged along all joins in the list of joins to the FROM clause if the set of linked tables is linked by multiple paths but no context exists. | 0.5 |
7,725,472 | 6 | 7 | 6. A method as claimed in claim 5 , wherein said monitored data includes a plurality of user profiles, and wherein said central computer groups contents of said augmented central database based on said plurality of user profiles so as to tailor said information retrieval results for said at least one user based on ones of said plurality of user profiles most closely matching a user profile of said at least one user. | 6. A method as claimed in claim 5 , wherein said monitored data includes a plurality of user profiles, and wherein said central computer groups contents of said augmented central database based on said plurality of user profiles so as to tailor said information retrieval results for said at least one user based on ones of said plurality of user profiles most closely matching a user profile of said at least one user. 7. A method as claimed in claim 6 , wherein said information retrieval results include an identity of at least one other user with whom said at least one user then can communicate to obtain further information. | 0.5 |
9,355,088 | 12 | 17 | 12. A system for feature completion for machine learning, comprising: one or more computer-storage media configured to store a first set of data items, wherein each data item includes a text stream of words; one or more computer-storage media configured to store a dictionary; and one or more computing devices configured to A) access the dictionary, wherein the dictionary includes a list of words that define a concept usable as an input feature for training a machine-learning model to score data items with a probability of being a positive example or a negative example of a particular class of data item; B) utilize a feature that is already trained to determine a probability that a word at a given word position corresponds semantically to the concept defined by the words in the dictionary; and C) train the machine-learning model with the dictionary as an input feature, wherein the training includes 1) for the given word position in a text stream within a data item, utilize the provided feature to calculate a first probability that the word at the given word position corresponds semantically to the concept defined by the words in the dictionary, 2) examine a context of the given word position, wherein the context includes a number of words preceding the given word position and a number of words following the given word position, and wherein the context does not include the word at the given word position, 3) calculate a second probability that the word at the given word position corresponds semantically to the concept defined by the words in the dictionary, based on a function of the words in the context of the given word position, wherein calculate the second probability comprises one or more of: i) determine whether any words from a given list appear at a center of a window of text around the given word position in which center words in the window of text have been removed, ii) determine a presence or absence of a verb in the window, iii) determine a presence or absence of a noun followed by an adjective, or iv) determine a number of occurrences of a given word in the window, and 4) modify the function to adjust the calculated second probability, based on the calculated first probability. | 12. A system for feature completion for machine learning, comprising: one or more computer-storage media configured to store a first set of data items, wherein each data item includes a text stream of words; one or more computer-storage media configured to store a dictionary; and one or more computing devices configured to A) access the dictionary, wherein the dictionary includes a list of words that define a concept usable as an input feature for training a machine-learning model to score data items with a probability of being a positive example or a negative example of a particular class of data item; B) utilize a feature that is already trained to determine a probability that a word at a given word position corresponds semantically to the concept defined by the words in the dictionary; and C) train the machine-learning model with the dictionary as an input feature, wherein the training includes 1) for the given word position in a text stream within a data item, utilize the provided feature to calculate a first probability that the word at the given word position corresponds semantically to the concept defined by the words in the dictionary, 2) examine a context of the given word position, wherein the context includes a number of words preceding the given word position and a number of words following the given word position, and wherein the context does not include the word at the given word position, 3) calculate a second probability that the word at the given word position corresponds semantically to the concept defined by the words in the dictionary, based on a function of the words in the context of the given word position, wherein calculate the second probability comprises one or more of: i) determine whether any words from a given list appear at a center of a window of text around the given word position in which center words in the window of text have been removed, ii) determine a presence or absence of a verb in the window, iii) determine a presence or absence of a noun followed by an adjective, or iv) determine a number of occurrences of a given word in the window, and 4) modify the function to adjust the calculated second probability, based on the calculated first probability. 17. The system of claim 12 , wherein the feature is a regular expression operating over strings to predict semantically matching positions in text within a string at each considered position. | 0.749344 |
9,053,500 | 16 | 18 | 16. A system for providing data to a web browser, the system comprising: a computer-accessible memory configured to store a plurality of objects; a receiver configured to receive a request for a set of one or more of the plurality of objects; a data generator configured to generate data based on the set of objects; wherein when generating the data, the data generator is further configured to: determine if a pre-specified locale is mandatory; if the pre-specified locale is mandatory, retrieve and format at least one member of the set of objects according to a pre-specified format, and if the pre-specified locale is not mandatory, retrieve and format at least one member of the set of objects according to a user-specified format; and a transmitter configured to transmit the data to the web browser. | 16. A system for providing data to a web browser, the system comprising: a computer-accessible memory configured to store a plurality of objects; a receiver configured to receive a request for a set of one or more of the plurality of objects; a data generator configured to generate data based on the set of objects; wherein when generating the data, the data generator is further configured to: determine if a pre-specified locale is mandatory; if the pre-specified locale is mandatory, retrieve and format at least one member of the set of objects according to a pre-specified format, and if the pre-specified locale is not mandatory, retrieve and format at least one member of the set of objects according to a user-specified format; and a transmitter configured to transmit the data to the web browser. 18. The system of claim 16 , wherein the plurality of objects are related to a course. | 0.671756 |
9,043,746 | 16 | 20 | 16. A computer program product for applying formal verification methodology to an event processing application, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program embodied therewith, the computer readable program comprising: computer readable program configured to represent an event processing application as an event processing network, being a graph with event processing agents as nodes; computer readable program configured to generate a finite state machine, based on the event processing network, wherein the finite state machine is an over-approximation of the event processing application; computer readable program configured to express stateful rules and policies that are associated with the event processing application using temporal logic, to yield a temporal representation of the event processing application; computer readable program configured to combine the temporal representation and the finite state machine into a model; computer readable program configured to generate a statement associated with at least one user-selected verification-related property of the event processing application, wherein the statement is generated using the temporal representation; and computer readable program configured to apply the statement to the model, to yield an indication for: (i) a correctness of the statement or (ii) a counter example, respectively, wherein the at least one verification-related property of the event processing application is a mutual exclusivity of two of the event processing agents within the graph, and wherein the statement indicates that the two or more of the event processing agents are mutual exclusive such that for any given input, one of the two event processing agents produces a different output from another one of the two event processing agents, at a same point of time, and wherein the counter example is compilable into a sequence of events that contradicts the statement. | 16. A computer program product for applying formal verification methodology to an event processing application, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program embodied therewith, the computer readable program comprising: computer readable program configured to represent an event processing application as an event processing network, being a graph with event processing agents as nodes; computer readable program configured to generate a finite state machine, based on the event processing network, wherein the finite state machine is an over-approximation of the event processing application; computer readable program configured to express stateful rules and policies that are associated with the event processing application using temporal logic, to yield a temporal representation of the event processing application; computer readable program configured to combine the temporal representation and the finite state machine into a model; computer readable program configured to generate a statement associated with at least one user-selected verification-related property of the event processing application, wherein the statement is generated using the temporal representation; and computer readable program configured to apply the statement to the model, to yield an indication for: (i) a correctness of the statement or (ii) a counter example, respectively, wherein the at least one verification-related property of the event processing application is a mutual exclusivity of two of the event processing agents within the graph, and wherein the statement indicates that the two or more of the event processing agents are mutual exclusive such that for any given input, one of the two event processing agents produces a different output from another one of the two event processing agents, at a same point of time, and wherein the counter example is compilable into a sequence of events that contradicts the statement. 20. The computer program product according to claim 16 , wherein the at least one verification-related property of the event processing application is reachability of a specified event processing agent within the event processing network, and wherein the statement indicates that the specified event processing agent is unreachable over the graph, and wherein the respective counter example is compilable into a sequence of events that traces a path over the event processing network to the specified event processing agent. | 0.509363 |
8,176,091 | 1 | 10 | 1. A method for detecting a local phenomenon, the method comprises: creating, by a hardware chart generator, a first local popularity chart, wherein the creating of the first local popularity chart comprises enumerating, for each geographic area of a group of sampled geographic areas, identical query strings of queries that are included in a group of queries; creating, by the hardware chart generator, a first global popularity chart, wherein the creating of the first global popularity chart comprises enumerating identical query strings of the queries that are included in the group of queries and are associated with any one of the geographical areas of the group of sampled geographic areas; and selecting, by a hardware processor, at least one query string in response to a scoring of the query string at the first local popularity chart that indicates that the at least one query string is locally popular and to a scoring of the query string at the first global popularity chart that indicates that the at least one query string is not globally popular; wherein the group of queries comprises queries which were queried during a first period of time. | 1. A method for detecting a local phenomenon, the method comprises: creating, by a hardware chart generator, a first local popularity chart, wherein the creating of the first local popularity chart comprises enumerating, for each geographic area of a group of sampled geographic areas, identical query strings of queries that are included in a group of queries; creating, by the hardware chart generator, a first global popularity chart, wherein the creating of the first global popularity chart comprises enumerating identical query strings of the queries that are included in the group of queries and are associated with any one of the geographical areas of the group of sampled geographic areas; and selecting, by a hardware processor, at least one query string in response to a scoring of the query string at the first local popularity chart that indicates that the at least one query string is locally popular and to a scoring of the query string at the first global popularity chart that indicates that the at least one query string is not globally popular; wherein the group of queries comprises queries which were queried during a first period of time. 10. The method according to claim 1 , further comprising ranking query strings of a popularity chart in response to a result of the enumeration for each query string, wherein the popularity chart is one of the first local popularity chart and the first global popularity chart. | 0.731589 |
9,870,424 | 18 | 19 | 18. The method of claim 17 , said ranking being further based in part on said reputation rating. | 18. The method of claim 17 , said ranking being further based in part on said reputation rating. 19. The method of claim 18 , said first set of persons comprising both natural persons and organizational entities. | 0.5 |
7,996,763 | 1 | 4 | 1. A system for assessing complexity levels of data representations, comprising: an evaluator module configured to obtain a document having information associated with a data representation being used to model a concept, the evaluator module further configured to analyze structural components of the data representation to compute a complexity score for the data representation, wherein the evaluator module prompts a user to provide individual element values for individual element objects contained in the data representation, individual attribute values for individual attribute objects contained in the data representation, and nesting values for nesting levels contained in the data representation, the evaluator module inputting the element values, the attribute values, and the nesting values received from the user in a table of values; and a storage medium having the table of values used to quantify the complexity level for each of the structural components of the data representation, the structural components comprising element objects and attribute objects, wherein the table of values includes the element values for the element objects, wherein the element objects comprise a first element object having a first element value in the table and a second element object having a second element value in the table that is different than the first element value, and the attribute values for the attribute objects that are used to compute the complexity score of the data representation, the table of values further comprising the nesting values to be assigned to nesting levels within the document, wherein the evaluator module aggregates the complexity levels of the structural components to determine the complexity score for the data representation, the determined complexity score of the data representation being impacted by the attribute values of the attribute objects of the data representation, wherein, to determine complexity levels of the structural components of the data representation, a customizable nesting value of a nesting level for each element object within the data representation is multiplied against an element value for the element object and the customizable nesting value of the nesting level for each attribute object within the data representation is multiplied against an attribute value for the attribute object. | 1. A system for assessing complexity levels of data representations, comprising: an evaluator module configured to obtain a document having information associated with a data representation being used to model a concept, the evaluator module further configured to analyze structural components of the data representation to compute a complexity score for the data representation, wherein the evaluator module prompts a user to provide individual element values for individual element objects contained in the data representation, individual attribute values for individual attribute objects contained in the data representation, and nesting values for nesting levels contained in the data representation, the evaluator module inputting the element values, the attribute values, and the nesting values received from the user in a table of values; and a storage medium having the table of values used to quantify the complexity level for each of the structural components of the data representation, the structural components comprising element objects and attribute objects, wherein the table of values includes the element values for the element objects, wherein the element objects comprise a first element object having a first element value in the table and a second element object having a second element value in the table that is different than the first element value, and the attribute values for the attribute objects that are used to compute the complexity score of the data representation, the table of values further comprising the nesting values to be assigned to nesting levels within the document, wherein the evaluator module aggregates the complexity levels of the structural components to determine the complexity score for the data representation, the determined complexity score of the data representation being impacted by the attribute values of the attribute objects of the data representation, wherein, to determine complexity levels of the structural components of the data representation, a customizable nesting value of a nesting level for each element object within the data representation is multiplied against an element value for the element object and the customizable nesting value of the nesting level for each attribute object within the data representation is multiplied against an attribute value for the attribute object. 4. The system of claim 1 , wherein the data representation comprises an extensible markup language representation. | 0.78327 |
8,718,383 | 5 | 6 | 5. The computer-implemented method of claim 1 wherein the database of image index files comprises a plurality of clusters, each cluster comprising a plurality of image index files representative of digital images. | 5. The computer-implemented method of claim 1 wherein the database of image index files comprises a plurality of clusters, each cluster comprising a plurality of image index files representative of digital images. 6. The computer-implemented method of claim 5 wherein one of the plurality of clusters is a pornographic cluster. | 0.5 |
10,042,844 | 1 | 12 | 1. A method for conducting an expert conversation, the method comprising: constructing a knowledge database comprising a dialogue repository comprising a plurality of dialogues, each dialogue representing a framework for creating at least one expert conversation and comprising a plurality of nodes and a plurality of edges extending between pairs of nodes, by identifying a subject for each node and associating an identifying text string with each node, the identifying text string comprising the identified subject for each node; grouping the nodes by common subject; into a plurality of node groups, each node group associated with a given subject; identifying containment hierarchies among the subjects, each containment hierarchy comprising a subset relationship between a given pair of subjects; organizing the node groups in the knowledge database in accordance with the containment hierarchies; and using the dialogue repository in combination with a runtime dialogue system in communication with the knowledge database and executing on a computing system that is in communication with an expert and a user to use the knowledge database to conduct a live expert conversation between the expert and the user using the plurality of nodes in the knowledge database as turning points in the live expert conversation to prompt the exchange of information between the expert and the user, to use the exchanged information to identify appropriate edges at each node and to extend the expert conversation across the identified appropriate edges through the plurality of nodes. | 1. A method for conducting an expert conversation, the method comprising: constructing a knowledge database comprising a dialogue repository comprising a plurality of dialogues, each dialogue representing a framework for creating at least one expert conversation and comprising a plurality of nodes and a plurality of edges extending between pairs of nodes, by identifying a subject for each node and associating an identifying text string with each node, the identifying text string comprising the identified subject for each node; grouping the nodes by common subject; into a plurality of node groups, each node group associated with a given subject; identifying containment hierarchies among the subjects, each containment hierarchy comprising a subset relationship between a given pair of subjects; organizing the node groups in the knowledge database in accordance with the containment hierarchies; and using the dialogue repository in combination with a runtime dialogue system in communication with the knowledge database and executing on a computing system that is in communication with an expert and a user to use the knowledge database to conduct a live expert conversation between the expert and the user using the plurality of nodes in the knowledge database as turning points in the live expert conversation to prompt the exchange of information between the expert and the user, to use the exchanged information to identify appropriate edges at each node and to extend the expert conversation across the identified appropriate edges through the plurality of nodes. 12. The method of claim 1 , further comprising using a graphical user interface to display to the user a current active state of the expert conversation and a full sequence of all questions, answers and data submissions that yielded the current active step. | 0.650815 |
9,600,474 | 15 | 20 | 15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: displaying a graphical user interface for a language translation application on a user device, the graphical user interface comprising a first graphical representation identifying a source language, a second graphical representation identifying a target language, and a third graphical representation indicating the user device operating in a listening mode that is arranged adjacent to both the first graphical representation identifying the source language and the second graphical representation identifying the target language; animating, in response to a request to initiate listening for an utterance in the source language, the third graphical representation indicating the listening mode while the language translation application prepares to listen for the source language; highlighting, in response to the language translation application completing preparations to listen for the source language, the third graphical representation indicating the listening mode while also highlighting the first graphical representation identifying the source language to create a visual correspondence between the first graphical representation identifying the source language and the third graphical representation indicating the listening mode indicating that the language translation application is prepared to receive voice input in the source language; receiving an utterance spoken in the source language for translation into the target language while the third graphical representation indicating the listening mode and the first graphical representation identifying the source language are highlighted to create a visual correspondence between the first graphical representation identifying the source language and the third graphical representation indicating the listening mode; replacing, in response to the language translation application preparing an output of a translation of the utterance into the target language, the third graphical representation indicating the listening mode on the graphical user interface with a fourth graphical representation indicating a translation transcription mode on the graphical user interface; and highlighting, in response to the language translation application completing preparations to output the translation of the transcription into the target language, the fourth graphical representation indicating the translation transcription mode while also highlighting the second graphical representation identifying the target language to create a visual correspondence between the second graphical representation identifying the target language and the fourth graphical representation indicating the translation transcription mode indicating that the language translation application is outputting a translation of the utterance in the target language. | 15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: displaying a graphical user interface for a language translation application on a user device, the graphical user interface comprising a first graphical representation identifying a source language, a second graphical representation identifying a target language, and a third graphical representation indicating the user device operating in a listening mode that is arranged adjacent to both the first graphical representation identifying the source language and the second graphical representation identifying the target language; animating, in response to a request to initiate listening for an utterance in the source language, the third graphical representation indicating the listening mode while the language translation application prepares to listen for the source language; highlighting, in response to the language translation application completing preparations to listen for the source language, the third graphical representation indicating the listening mode while also highlighting the first graphical representation identifying the source language to create a visual correspondence between the first graphical representation identifying the source language and the third graphical representation indicating the listening mode indicating that the language translation application is prepared to receive voice input in the source language; receiving an utterance spoken in the source language for translation into the target language while the third graphical representation indicating the listening mode and the first graphical representation identifying the source language are highlighted to create a visual correspondence between the first graphical representation identifying the source language and the third graphical representation indicating the listening mode; replacing, in response to the language translation application preparing an output of a translation of the utterance into the target language, the third graphical representation indicating the listening mode on the graphical user interface with a fourth graphical representation indicating a translation transcription mode on the graphical user interface; and highlighting, in response to the language translation application completing preparations to output the translation of the transcription into the target language, the fourth graphical representation indicating the translation transcription mode while also highlighting the second graphical representation identifying the target language to create a visual correspondence between the second graphical representation identifying the target language and the fourth graphical representation indicating the translation transcription mode indicating that the language translation application is outputting a translation of the utterance in the target language. 20. The computer-readable medium of claim 15 , wherein the third graphical representation indicating the listening mode comprises a microphone icon. | 0.77439 |
7,650,286 | 110 | 123 | 110. A system for using a computer to identify a matching resume for a job description, comprising: means for receiving the job description that includes at least one job requirement, each said at least one job requirement comprising a required skill or experience-related phrase and a required term of experience for the required skill or experience-related phrase; means for storing the job description; means for receiving at least one resume; means for parsing each said at least one resume to: locate at least one skill or experience-related phrase in the resume; determine an experience range for each said at least one skill or experience-related phrase by examining a use of each said at least one skill or experience-related phrase in the resume; and compute a term of experience for each said at least one skill or experience-related phrase based on the experience range, wherein the term of experience for each said at least one skill or experience-related phrase is a summation of the term of experience for each occurrence of the phrase associated with a different experience range, wherein said at least one skill or experience-related phrase includes the required skill or experience-related phrase for at least one of said at least one job requirement, wherein each resume summarizes a candidate's career and qualifications, and wherein each resume conveys personal and business-related characteristics that the candidate believes to be relevant to a prospective employer; means for storing each said at least one resume; means for computing, for each said at least one resume, a term of experience for the required skill or experience-related phrase for each said at least one job requirement; and means for determining whether each said at least one resume is the matching resume that satisfies the job description. | 110. A system for using a computer to identify a matching resume for a job description, comprising: means for receiving the job description that includes at least one job requirement, each said at least one job requirement comprising a required skill or experience-related phrase and a required term of experience for the required skill or experience-related phrase; means for storing the job description; means for receiving at least one resume; means for parsing each said at least one resume to: locate at least one skill or experience-related phrase in the resume; determine an experience range for each said at least one skill or experience-related phrase by examining a use of each said at least one skill or experience-related phrase in the resume; and compute a term of experience for each said at least one skill or experience-related phrase based on the experience range, wherein the term of experience for each said at least one skill or experience-related phrase is a summation of the term of experience for each occurrence of the phrase associated with a different experience range, wherein said at least one skill or experience-related phrase includes the required skill or experience-related phrase for at least one of said at least one job requirement, wherein each resume summarizes a candidate's career and qualifications, and wherein each resume conveys personal and business-related characteristics that the candidate believes to be relevant to a prospective employer; means for storing each said at least one resume; means for computing, for each said at least one resume, a term of experience for the required skill or experience-related phrase for each said at least one job requirement; and means for determining whether each said at least one resume is the matching resume that satisfies the job description. 123. The system of claim 110 , wherein each said at least one job requirement further comprises a required time range for the required skill or experience-related phrase, and wherein the matching resume satisfies the job description when the experience range of the skill or experience-related phrase overlaps with the required time range. | 0.526536 |
7,962,443 | 22 | 23 | 22. The design and data replacement system of claim 15 , wherein the first plurality of fields includes a first field including a datum including a first value, wherein the second plurality of fields includes a second field corresponding to the first field, wherein the second field is associated with a domain membership function, and wherein (B) comprises determining whether the first value satisfies the domain membership function. | 22. The design and data replacement system of claim 15 , wherein the first plurality of fields includes a first field including a datum including a first value, wherein the second plurality of fields includes a second field corresponding to the first field, wherein the second field is associated with a domain membership function, and wherein (B) comprises determining whether the first value satisfies the domain membership function. 23. The design and data replacement system of claim 22 , wherein the domain membership function defines at least one of a range of values, a semantic meaning, and a phonetic feature, and wherein (B) comprises at least one of determining whether the first value is within the range of values, determining whether the first value has the semantic meaning, and determining whether the first value has the phonetic feature. | 0.5 |
7,882,148 | 10 | 15 | 10. The computer system according to claim 1 , further comprising an attribute calculator for calculating a value of the activation attribute. | 10. The computer system according to claim 1 , further comprising an attribute calculator for calculating a value of the activation attribute. 15. The computer system according to claim 10 , wherein the calculator is arranged to calculate the activation attribute value of the at least one context entity on the basis of the number of entities related to the at least one context entity. | 0.536122 |
8,612,232 | 8 | 11 | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, result in the processor performing operations comprising: partitioning, via a processor, a speech recognizer output into independent clauses; identifying, independent of domain, a dialog act for each of the independent clauses; identifying, dependent on domain, an object within each of the independent clauses; and recursively generating, for each independent clause in the independent clauses, a semantic representation using the dialog act and the object of each independent clause. | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, result in the processor performing operations comprising: partitioning, via a processor, a speech recognizer output into independent clauses; identifying, independent of domain, a dialog act for each of the independent clauses; identifying, dependent on domain, an object within each of the independent clauses; and recursively generating, for each independent clause in the independent clauses, a semantic representation using the dialog act and the object of each independent clause. 11. The system of claim 8 , wherein while recursively generating the semantic representation, additional objects are extracted from each of the independent clauses. | 0.753012 |
10,061,851 | 9 | 11 | 9. A non-transitory computer readable medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising: receiving, by the one or more processors, a search query from a searching user; identifying, by the one or more processors and using a resource index, a plurality of search results that are responsive to the search query, each of the search results in the plurality of search results being representative of a web resource; determining, by the one or more processors, whether there are users responsive to the search query using an interaction system that retrieves, from one or more data sources that are distinct from the resource index, contact information that is included in a user profile of the searching user, wherein determining whether there are users responsive to the search query includes cross-referencing the search query to the contact information that is included in the user profile of the searching user; in response to determining that there are no users responsive to the search query, providing one or more search results of the plurality of search results to a computing device associated with the searching user; in response to determining that there are users responsive to the search query: providing, by the one or more processors, a sub-set of the users, each user in the sub-set being connected to the searching user through one or more computer-implemented services, the sub-set comprising at least one user; determining that contact data of the at least one user is available, wherein the contact data comprises publically available contact data, and wherein determining that contact data is available comprises determining that a portion of the contact data is accessible to the searching user based on privacy settings provided by the user, the portion of the contact data being included in the contact data in response to determining that a portion of the contact data is accessible to the searching user, and in response to determining that contact data of the at least one user is available: providing an electronic document comprising instructions that, when executed by a computing device, cause the computing device to display a search results page, wherein the search results page comprises a first portion including a group of search results each representative of a web resource responsive to the search query and a second portion including a profile card associated with the at least one user, the profile card comprising one or more graphical representations associated with an interaction channel, each interaction channel being associated with respective contact data of the contact data, and each graphical representation receiving user input and initiating execution of a respective interaction between the searching user and the at least one user from the search results page, an interaction interface that executes the respective interaction being displayed concurrently with the plurality of search results in the search results page, wherein the interaction interface is provided by an interaction hovercard displayed with the search results page in response to initiating execution of an interaction from the search results page; and transmitting the electronic document to the computing device associated with the searching user. | 9. A non-transitory computer readable medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising: receiving, by the one or more processors, a search query from a searching user; identifying, by the one or more processors and using a resource index, a plurality of search results that are responsive to the search query, each of the search results in the plurality of search results being representative of a web resource; determining, by the one or more processors, whether there are users responsive to the search query using an interaction system that retrieves, from one or more data sources that are distinct from the resource index, contact information that is included in a user profile of the searching user, wherein determining whether there are users responsive to the search query includes cross-referencing the search query to the contact information that is included in the user profile of the searching user; in response to determining that there are no users responsive to the search query, providing one or more search results of the plurality of search results to a computing device associated with the searching user; in response to determining that there are users responsive to the search query: providing, by the one or more processors, a sub-set of the users, each user in the sub-set being connected to the searching user through one or more computer-implemented services, the sub-set comprising at least one user; determining that contact data of the at least one user is available, wherein the contact data comprises publically available contact data, and wherein determining that contact data is available comprises determining that a portion of the contact data is accessible to the searching user based on privacy settings provided by the user, the portion of the contact data being included in the contact data in response to determining that a portion of the contact data is accessible to the searching user, and in response to determining that contact data of the at least one user is available: providing an electronic document comprising instructions that, when executed by a computing device, cause the computing device to display a search results page, wherein the search results page comprises a first portion including a group of search results each representative of a web resource responsive to the search query and a second portion including a profile card associated with the at least one user, the profile card comprising one or more graphical representations associated with an interaction channel, each interaction channel being associated with respective contact data of the contact data, and each graphical representation receiving user input and initiating execution of a respective interaction between the searching user and the at least one user from the search results page, an interaction interface that executes the respective interaction being displayed concurrently with the plurality of search results in the search results page, wherein the interaction interface is provided by an interaction hovercard displayed with the search results page in response to initiating execution of an interaction from the search results page; and transmitting the electronic document to the computing device associated with the searching user. 11. The non-transitory computer readable medium of claim 9 , wherein the one or more data sources comprise at least one of a contact data repository associated with a computer-implemented contact management service, a social data repository associated with a computer-implemented social networking service, an electronic mail address repository associated with a computer-implemented electronic mail service, and a public data repository. | 0.5 |
9,317,614 | 1 | 6 | 1. A method comprising, by one or more computing devices: accessing a first set of queries of an online social network received from one or more users of the online social network, each query being a particular type of query; retrieving, for each query of the first set of queries, a first number of objects that match at least a portion of the query from one or more data stores, each data store storing one or more objects associated with the online social network, wherein each object is associated with a pre-determined static-score calculated by a static-scoring algorithm, the static-score for each object being based at least in part on the type of the respective query, and wherein retrieving the first number of objects is based on the static-scores of the objects; calculating, for each query, a final-score for each retrieved object based on a final-scoring algorithm; and determining one or more revised static-scores for one or more of the retrieved objects based on a comparison of the final-scores calculated based on the final-scoring algorithm and the static-scores of the retrieved objects calculated based on the static-scoring algorithm, wherein the static-scores are revised, for each retrieved object, in order to reduce the difference between a static-rank of the retrieve object based on its static-score and a final-rank of the retrieved object based on its final-score. | 1. A method comprising, by one or more computing devices: accessing a first set of queries of an online social network received from one or more users of the online social network, each query being a particular type of query; retrieving, for each query of the first set of queries, a first number of objects that match at least a portion of the query from one or more data stores, each data store storing one or more objects associated with the online social network, wherein each object is associated with a pre-determined static-score calculated by a static-scoring algorithm, the static-score for each object being based at least in part on the type of the respective query, and wherein retrieving the first number of objects is based on the static-scores of the objects; calculating, for each query, a final-score for each retrieved object based on a final-scoring algorithm; and determining one or more revised static-scores for one or more of the retrieved objects based on a comparison of the final-scores calculated based on the final-scoring algorithm and the static-scores of the retrieved objects calculated based on the static-scoring algorithm, wherein the static-scores are revised, for each retrieved object, in order to reduce the difference between a static-rank of the retrieve object based on its static-score and a final-rank of the retrieved object based on its final-score. 6. The method of claim 1 , further comprising: accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising: a plurality of user nodes corresponding to a plurality of users of the online social network, respectively; and a plurality of concept nodes corresponding to a plurality of concepts associated with the online social network, respectively; wherein each query in the first set of queries corresponds to a particular user node, and each retrieved object corresponds to a user node or concept node of the plurality of nodes. | 0.5 |
7,630,977 | 15 | 16 | 15. The apparatus method as set forth in claim 11 , wherein the selecting of categorization labels includes: determining derived probability values for derived categories, each derived category corresponding to an ordered combination of categories from different categorization dimensions, the derived probability value for each derived category being determined based on the probability value of one of the categories of the ordered combination of categories weighted by the probability value of the other one of the categories of the ordered combination; and selecting an optimized derived category based on the derived probability values and selecting a categorization label respective to each categorization dimension that corresponds to the optimized derived category. | 15. The apparatus method as set forth in claim 11 , wherein the selecting of categorization labels includes: determining derived probability values for derived categories, each derived category corresponding to an ordered combination of categories from different categorization dimensions, the derived probability value for each derived category being determined based on the probability value of one of the categories of the ordered combination of categories weighted by the probability value of the other one of the categories of the ordered combination; and selecting an optimized derived category based on the derived probability values and selecting a categorization label respective to each categorization dimension that corresponds to the optimized derived category. 16. The apparatus as set forth in claim 15 , wherein the derived categories include fewer than all ordered pairwise combinations of categories from the first and second categorization dimensions. | 0.574236 |
7,802,182 | 7 | 9 | 7. A method for assisting editing of a web portal, the method comprising: providing portal configuration information that contains functional characteristics for the web portal; providing a set of temporary files that provide one or more presentation characteristics for the web portal; generating a preview document, wherein the preview document is a web page, and wherein the preview document utilizes the portal configuration information for the functional characteristics of the portal, and the temporary files for the presentation characteristics of the web portal, and wherein the preview document includes an instruction set that when processed by an application at a client renders the preview document in a web browser; detecting, at the web browser, a cursor positioned over one of said one or more sections of the web portal, wherein the instruction set is read and executed by the application to present, in a graphical overlay at the web browser, an identity of the one or more style properties affecting the one of said one or more sections while the cursor is positioned over the one of said one or more sections, wherein the one or more style properties affecting the section is derived from a structured style sheet, and wherein the identity of the one or more style properties affecting the section includes an indication of whether the one or more style properties is inherited; presenting the graphical overlay at the web browser to show the one or more style properties affecting the one of said one or more sections that has the cursor positioned over; receiving a modification of the set of temporary files, wherein the modification changes the one or more one or more style properties affecting the presentation characteristic of the web portal, wherein the web portal includes one or more sections, each section affected by the one or more style properties; and wherein a request is sent to accept modifications to the set of temporary files, and wherein accepting the modifications initiates a copy process to update the portal configuration information to include the set of temporary files as modified. | 7. A method for assisting editing of a web portal, the method comprising: providing portal configuration information that contains functional characteristics for the web portal; providing a set of temporary files that provide one or more presentation characteristics for the web portal; generating a preview document, wherein the preview document is a web page, and wherein the preview document utilizes the portal configuration information for the functional characteristics of the portal, and the temporary files for the presentation characteristics of the web portal, and wherein the preview document includes an instruction set that when processed by an application at a client renders the preview document in a web browser; detecting, at the web browser, a cursor positioned over one of said one or more sections of the web portal, wherein the instruction set is read and executed by the application to present, in a graphical overlay at the web browser, an identity of the one or more style properties affecting the one of said one or more sections while the cursor is positioned over the one of said one or more sections, wherein the one or more style properties affecting the section is derived from a structured style sheet, and wherein the identity of the one or more style properties affecting the section includes an indication of whether the one or more style properties is inherited; presenting the graphical overlay at the web browser to show the one or more style properties affecting the one of said one or more sections that has the cursor positioned over; receiving a modification of the set of temporary files, wherein the modification changes the one or more one or more style properties affecting the presentation characteristic of the web portal, wherein the web portal includes one or more sections, each section affected by the one or more style properties; and wherein a request is sent to accept modifications to the set of temporary files, and wherein accepting the modifications initiates a copy process to update the portal configuration information to include the set of temporary files as modified. 9. The method of claim 7 , wherein the instructions comprise instructions written in a scripting programming language. | 0.691099 |
9,201,854 | 11 | 22 | 11. A non-transitory computer readable storage medium having a computer-executable container, the container comprising: a container for encapsulating operative components in a predetermined electronic file format to define an interactive document, the container including a compressed portion for storing predetermined portions of selected operative components; the operative components comprising: one or more content components of the interactive document for representing document contents including text, graphics, controls, sounds; an interaction orchestration component operative to display, from among an array of orchestration subcomponents, at least some of the orchestration subcomponents as a user document interaction interface within the interactive document, each orchestration subcomponent being configured to provide variability in a type, a quantity, and a source of the content components; a control component for controlling, as a function of user characteristics including at least one of an identity, a title, or a role, user access to predetermined content components of the interactive document and user access regarding which, if any, of predetermined interaction orchestration component subcomponents within the interactive document are accessible to a user; and instance data within the interactive document, the instance data comprising predetermined information obtained during one or more of the following: interaction between a user and operations of the interaction orchestration component; data retrieval from an enterprise database controlled by the interaction orchestration component; data retrieved from an external database as a function of a predetermined data retrieval component; and data retrieved from an asynchronous information source. | 11. A non-transitory computer readable storage medium having a computer-executable container, the container comprising: a container for encapsulating operative components in a predetermined electronic file format to define an interactive document, the container including a compressed portion for storing predetermined portions of selected operative components; the operative components comprising: one or more content components of the interactive document for representing document contents including text, graphics, controls, sounds; an interaction orchestration component operative to display, from among an array of orchestration subcomponents, at least some of the orchestration subcomponents as a user document interaction interface within the interactive document, each orchestration subcomponent being configured to provide variability in a type, a quantity, and a source of the content components; a control component for controlling, as a function of user characteristics including at least one of an identity, a title, or a role, user access to predetermined content components of the interactive document and user access regarding which, if any, of predetermined interaction orchestration component subcomponents within the interactive document are accessible to a user; and instance data within the interactive document, the instance data comprising predetermined information obtained during one or more of the following: interaction between a user and operations of the interaction orchestration component; data retrieval from an enterprise database controlled by the interaction orchestration component; data retrieved from an external database as a function of a predetermined data retrieval component; and data retrieved from an asynchronous information source. 22. The non-transitory computer readable storage medium of claim 11 , wherein the orchestration subcomponents comprise one or more of the following: an interview subcomponent configured to conduct an interview within the user document interaction interface via an interview pane to implement user design of a structure the interactive document via selection of appearance format options and content options; a guide fill subcomponent configured to provide a menu-based user selection of content for at least some data fields; and an interaction history subcomponent configured to inform the user regarding prior user interactions with the interactive document. | 0.5 |
8,719,247 | 1 | 8 | 1. A method for augmenting web pages with search related content, the method comprising: (a) identifying, by code executing on a client, text associated with a visual element of a web page being displayed on the client; (b) determining, by a server, one or more keywords corresponding to the text received from the client; (c) transmitting, by the server to the client, a search mechanism for augmenting the one or more keywords; (d) detecting, by the client for the currently displayed web page, a mouse-over of a keyword of the one or more keywords; and (e) displaying, by the client responsive to the detection, an overlay comprising the search mechanism with search terms corresponding to the keyword. | 1. A method for augmenting web pages with search related content, the method comprising: (a) identifying, by code executing on a client, text associated with a visual element of a web page being displayed on the client; (b) determining, by a server, one or more keywords corresponding to the text received from the client; (c) transmitting, by the server to the client, a search mechanism for augmenting the one or more keywords; (d) detecting, by the client for the currently displayed web page, a mouse-over of a keyword of the one or more keywords; and (e) displaying, by the client responsive to the detection, an overlay comprising the search mechanism with search terms corresponding to the keyword. 8. The method of claim 1 , wherein step (d) further comprises transmitting, by the server, to the client the search mechanism with one or more display modifiers. | 0.689189 |
9,619,565 | 2 | 3 | 2. The method of claim 1 , further comprising deriving relevancy scores for at least a subset of the identified second set of search result documents, and selecting the respective document based on having a high relevancy score. | 2. The method of claim 1 , further comprising deriving relevancy scores for at least a subset of the identified second set of search result documents, and selecting the respective document based on having a high relevancy score. 3. The method of claim 2 , wherein the relevancy scores are based, at least in part on weights assigned to the query terms. | 0.5 |
10,037,491 | 6 | 7 | 6. The system of claim 1 , wherein to classify the piece of comment data includes to use a negative model-based comment classifier in the event that the context sentiment type is determined to be negative sentiment-entailing. | 6. The system of claim 1 , wherein to classify the piece of comment data includes to use a negative model-based comment classifier in the event that the context sentiment type is determined to be negative sentiment-entailing. 7. The system of claim 6 , wherein the negative model-based comment classifier is trained using training data comprising sample comment data known to be associated with negative sentiment-entailing contexts. | 0.5 |
7,801,896 | 29 | 39 | 29. A tangible computer readable medium having stored thereon, computer-executable instructions that, upon execution by a computing device, cause the computing device to perform operations comprising: defining a displayed interface for interacting with objects having associated resource locators; receiving an input and sending a search communication based at least in part on the input to a network element for objects from a set of indexed objects; receiving from the network element at least respective resource locators of objects corresponding to the input; displaying a hierarchal object comprising at least three levels of a taxonomic hierarchy each containing at least one of the respective resource locators of the objects received from the network element corresponding to the input, and at least one level having at least two of the objects, the objects being taxonomically organized based on a content associated with a respective object; and presenting within the taxonomic hierarchy a set of separate objects, separate from the objects received from the network element corresponding to the input, wherein the levels of the taxonomic hierarchy contain at least one separate object corresponding to the input, the set of separate objects providing a basis for a third party subsidy. | 29. A tangible computer readable medium having stored thereon, computer-executable instructions that, upon execution by a computing device, cause the computing device to perform operations comprising: defining a displayed interface for interacting with objects having associated resource locators; receiving an input and sending a search communication based at least in part on the input to a network element for objects from a set of indexed objects; receiving from the network element at least respective resource locators of objects corresponding to the input; displaying a hierarchal object comprising at least three levels of a taxonomic hierarchy each containing at least one of the respective resource locators of the objects received from the network element corresponding to the input, and at least one level having at least two of the objects, the objects being taxonomically organized based on a content associated with a respective object; and presenting within the taxonomic hierarchy a set of separate objects, separate from the objects received from the network element corresponding to the input, wherein the levels of the taxonomic hierarchy contain at least one separate object corresponding to the input, the set of separate objects providing a basis for a third party subsidy. 39. The tangible computer readable medium of claim 29 , wherein the hierarchal object comprises a state independent information object. | 0.803779 |
9,792,204 | 17 | 18 | 17. The system of claim 12 , the control processor further configured to execute program instructions that cause the control processor to translate coverage criteria translation by using a criteria conversion table. | 17. The system of claim 12 , the control processor further configured to execute program instructions that cause the control processor to translate coverage criteria translation by using a criteria conversion table. 18. The system of claim 17 , the control processor further configured to execute program instructions that cause the control processor to obtain from the model-based development tool the criteria conversion table. | 0.5 |
8,909,573 | 11 | 12 | 11. The computer system of claim 8 , wherein scoring the alteration candidate further comprises: computing one or more query-dependent feature scores that are based on dependencies to multiple query terms from each of one or more of the alteration terms; and using the one or more query-dependent feature scores to compute the candidate score for the candidate. | 11. The computer system of claim 8 , wherein scoring the alteration candidate further comprises: computing one or more query-dependent feature scores that are based on dependencies to multiple query terms from each of one or more of the alteration terms; and using the one or more query-dependent feature scores to compute the candidate score for the candidate. 12. The computer system of claim 11 , wherein the one or more query-dependant feature scores comprises a plurality of feature scores based on a plurality of translation models. | 0.553299 |
8,943,159 | 22 | 24 | 22. A system, comprising: at least one network-based server comprising hardware; at least one network interface; a router subsystem, which serves as an interface to the Internet to manage communications between online Internet Protocol client devices and the network-based server; and non-transitory memory coupled to the at least one computing device that stores instructions that when executed by the at least one computing device cause, at least in part, the system to perform operations comprising: creating a user account at least partly in response to receiving account registration information from a user; providing an application software program for installation on a mobile computing device associated with the user; receiving from a first visitor to a web document of the user a communication request to communicate with the user via a communication interface displayed in association with the web document of the user; and at least partly in response to receiving a presence indication at the computing system that the application software program is online, transmitting, by the computing system, to the application software program installed on the mobile computing device associated with the user a text message entered by the first visitor into a text entry field, without the first visitor providing, and without revealing to the first visitor, a mobile communication device phone address of the user. | 22. A system, comprising: at least one network-based server comprising hardware; at least one network interface; a router subsystem, which serves as an interface to the Internet to manage communications between online Internet Protocol client devices and the network-based server; and non-transitory memory coupled to the at least one computing device that stores instructions that when executed by the at least one computing device cause, at least in part, the system to perform operations comprising: creating a user account at least partly in response to receiving account registration information from a user; providing an application software program for installation on a mobile computing device associated with the user; receiving from a first visitor to a web document of the user a communication request to communicate with the user via a communication interface displayed in association with the web document of the user; and at least partly in response to receiving a presence indication at the computing system that the application software program is online, transmitting, by the computing system, to the application software program installed on the mobile computing device associated with the user a text message entered by the first visitor into a text entry field, without the first visitor providing, and without revealing to the first visitor, a mobile communication device phone address of the user. 24. The system as defined in claim 22 , the operations further comprising: enabling at least one visitor to the user web document to leave a voice message for the user via the communication interface; and providing the user with access to the voice message via the application software program installed on the mobile computing device associated with the user. | 0.527559 |
9,911,412 | 1 | 16 | 1. A method of recognizing natural language input comprising: receiving natural language input at a natural language input interface of a computing device comprising a natural language input recognizer; obtaining, by the natural language input recognizer, evidence from an evidence source; generating, by the natural language input recognizer, an evidence graph based, at least in part, on the evidence obtained, wherein the evidence graph comprises a set of evidence nodes, wherein the set of evidence nodes comprises a set of one or more intent evidence nodes and a set of one or more phrase evidence nodes, and wherein at least one phrase evidence node is connected to at least one intent evidence node; generating a set of recognition hypotheses based, at least in part, on the evidence graph; and selecting a recognition hypothesis of the set of recognition hypotheses as a recognition result for the natural language input for triggering a response. | 1. A method of recognizing natural language input comprising: receiving natural language input at a natural language input interface of a computing device comprising a natural language input recognizer; obtaining, by the natural language input recognizer, evidence from an evidence source; generating, by the natural language input recognizer, an evidence graph based, at least in part, on the evidence obtained, wherein the evidence graph comprises a set of evidence nodes, wherein the set of evidence nodes comprises a set of one or more intent evidence nodes and a set of one or more phrase evidence nodes, and wherein at least one phrase evidence node is connected to at least one intent evidence node; generating a set of recognition hypotheses based, at least in part, on the evidence graph; and selecting a recognition hypothesis of the set of recognition hypotheses as a recognition result for the natural language input for triggering a response. 16. The method of claim 1 , wherein obtaining the evidence from the evidence source comprises querying, by the natural language input recognizer, the evidence source and receiving, by the natural language input recognizer, a response comprising the evidence from the evidence source. | 0.711813 |
9,397,830 | 7 | 10 | 7. The method of claim 1 , further comprising: generating conditional decrypt criteria; and inserting the conditional decrypt criteria into a preamble, said preamble located in an encrypted block of the plurality of encrypted blocks. | 7. The method of claim 1 , further comprising: generating conditional decrypt criteria; and inserting the conditional decrypt criteria into a preamble, said preamble located in an encrypted block of the plurality of encrypted blocks. 10. The method of claim 7 , wherein generating conditional decrypt criteria includes generating a GPS in-radius condition. | 0.551471 |
7,877,343 | 13 | 14 | 13. The method of claim 11 , further comprising the step of automatically learning to identify extracted relationships between objects as being either trustworthy or not trustworthy, by labeling relationships extracted from a relatively small set of training data as trustworthy or not. | 13. The method of claim 11 , further comprising the step of automatically learning to identify extracted relationships between objects as being either trustworthy or not trustworthy, by labeling relationships extracted from a relatively small set of training data as trustworthy or not. 14. The method of claim 13 , based upon an ability to rank relationships that was learned with the small set of training data, further comprising the step of automatically producing a ranking model that can characterize each relationship extracted from the corpus of text in regard to a quality of the relationship. | 0.5 |
9,959,318 | 20 | 31 | 20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to: receive, from a client system of a first user of an online social network, an indication of the first user accessing a query field associated with a currently accessed page of the online social network, the online social network being associated with a plurality of entities, wherein the currently accessed page is a unique profile page of a particular entity of the plurality of entities; identify the particular entity of the plurality of entities corresponding to the profile page; generate one or more structured queries based on the particular entity corresponding to the profile page, each structured query comprising a reference to the particular entity corresponding to the profile page and one or more additional query tokens; and send, to the client system of the first user, responsive to the user accessing the query field, instructions for displaying one or more suggested queries on the page, wherein the one or more suggested queries correspond to one or more of the structured queries, respectively, and wherein each suggested query that is displayed is selectable by the first user to retrieve search results corresponding to the selected query. | 20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to: receive, from a client system of a first user of an online social network, an indication of the first user accessing a query field associated with a currently accessed page of the online social network, the online social network being associated with a plurality of entities, wherein the currently accessed page is a unique profile page of a particular entity of the plurality of entities; identify the particular entity of the plurality of entities corresponding to the profile page; generate one or more structured queries based on the particular entity corresponding to the profile page, each structured query comprising a reference to the particular entity corresponding to the profile page and one or more additional query tokens; and send, to the client system of the first user, responsive to the user accessing the query field, instructions for displaying one or more suggested queries on the page, wherein the one or more suggested queries correspond to one or more of the structured queries, respectively, and wherein each suggested query that is displayed is selectable by the first user to retrieve search results corresponding to the selected query. 31. The system of claim 20 , wherein the processors are further operable when executing the instructions to: receive, from the client system of the first user, an indication of the first user selecting one of the structured queries; and generate one or more search results corresponding to the selected structured query. | 0.657388 |
7,853,587 | 10 | 11 | 10. The system of claim 1 , wherein the at least one filter includes one or more of a query filter, a punctuation filter, a title filter, and a similarity filter. | 10. The system of claim 1 , wherein the at least one filter includes one or more of a query filter, a punctuation filter, a title filter, and a similarity filter. 11. The system of claim 10 , wherein the query filter is configured to discard snippets that only include query terms. | 0.78853 |
8,224,641 | 20 | 21 | 20. A non-transitory computer readable medium on which is stored machine readable instructions that when executed by a processor implement a method of identifying one or more languages for a document, the languages being selected from a set of candidate languages, the machine readable instructions comprising code to: for each language (M) in the set of candidate languages, define a set of non overlapping languages (N(M)), the set N(M) consisting of one or more languages (L), wherein each language L in the set N(M) does not overlap with the language M; obtain n-gram data for a target document; for each language M in the set of candidate languages, use the n-gram data to determine a final score S F (M) based on relative probabilities of a first hypothesis that the target document is entirely in the language M and a second hypothesis that one portion of the target document is in the language M while another portion of the target document is in a language L selected from the set N(M); identify one or more of the candidate languages as being languages of the document based on the final scores S F (M) for different languages M; and store information indicating the one or more languages of the document. | 20. A non-transitory computer readable medium on which is stored machine readable instructions that when executed by a processor implement a method of identifying one or more languages for a document, the languages being selected from a set of candidate languages, the machine readable instructions comprising code to: for each language (M) in the set of candidate languages, define a set of non overlapping languages (N(M)), the set N(M) consisting of one or more languages (L), wherein each language L in the set N(M) does not overlap with the language M; obtain n-gram data for a target document; for each language M in the set of candidate languages, use the n-gram data to determine a final score S F (M) based on relative probabilities of a first hypothesis that the target document is entirely in the language M and a second hypothesis that one portion of the target document is in the language M while another portion of the target document is in a language L selected from the set N(M); identify one or more of the candidate languages as being languages of the document based on the final scores S F (M) for different languages M; and store information indicating the one or more languages of the document. 21. The non-transitory computer readable medium of claim 20 , wherein each language L in the set N(M) for the language M has no characters in common with the language M. | 0.916087 |
9,760,953 | 1 | 16 | 1. A computer-implemented method, comprising: a modular rule engine of a computerized tax return preparation application comprising instructions executed by a processor of a computer receiving runtime data of the electronic tax return, wherein respective fields for respective questions presented by the tax return preparation application are populated with respective data of the runtime data, determining which questions of the tax return preparation application remain unanswered after receiving the runtime data based at least in part upon the received runtime data and a data structure generated by transforming a first data structure of a pre-determined question-and-answer flow into a second data structure different from the first data structure, identifying unanswered questions within the second data structure that are free of pre-determined semantic dependency based at least in part upon an answer to at least one tax return preparation application question within the second data structure, wherein the unanswered questions are identified without reference to the first data structure, and selecting at least one identified unanswered question of the identified unanswered questions within the different, transformed data structure; and generating a non-binding suggestion based at least in part upon the selected unanswered question; and a modular interface controller of the computerized tax return preparation application receiving the non-binding suggestion as an input, and generating an interview screen that is presented to a user of the tax return preparation application through a display of the computer based at least in part upon the non-binding suggestion, the modular rule engine and the modular interface controller being loosely coupled to each other such that the non-binding suggestion generated by the modular rule engine does not control how the modular interface controller determines content of the interview screen. | 1. A computer-implemented method, comprising: a modular rule engine of a computerized tax return preparation application comprising instructions executed by a processor of a computer receiving runtime data of the electronic tax return, wherein respective fields for respective questions presented by the tax return preparation application are populated with respective data of the runtime data, determining which questions of the tax return preparation application remain unanswered after receiving the runtime data based at least in part upon the received runtime data and a data structure generated by transforming a first data structure of a pre-determined question-and-answer flow into a second data structure different from the first data structure, identifying unanswered questions within the second data structure that are free of pre-determined semantic dependency based at least in part upon an answer to at least one tax return preparation application question within the second data structure, wherein the unanswered questions are identified without reference to the first data structure, and selecting at least one identified unanswered question of the identified unanswered questions within the different, transformed data structure; and generating a non-binding suggestion based at least in part upon the selected unanswered question; and a modular interface controller of the computerized tax return preparation application receiving the non-binding suggestion as an input, and generating an interview screen that is presented to a user of the tax return preparation application through a display of the computer based at least in part upon the non-binding suggestion, the modular rule engine and the modular interface controller being loosely coupled to each other such that the non-binding suggestion generated by the modular rule engine does not control how the modular interface controller determines content of the interview screen. 16. The method of claim 1 , an answer to a question comprising a box or field of an interview screen generated by the tax return preparation application that is checked or selected by the user. | 0.867263 |
7,983,913 | 1 | 10 | 1. A system for recognizing location information input by a user, the location information including an intersection of streets, the system comprising: a grammar having a street grammar component that maps various different pronunciations of street names to semantic tags; a recognition system configured to receive the location information input, access the grammar, and generate a street name recognition hypothesis with associated semantic tags; an intersection data store storing a plurality of valid street intersections, each street intersection having street names of intersecting streets; a tokenization component configured to receive the street name recognition hypothesis and the associated semantic tags and to generate, for each of the associated semantic tags, a tokenized query having phonemes that are labeled with a digits position; a search component configured to search the intersection data store based on the tokenized queries and output at least one recognized intersection result identifying a street intersection recognized from the location information input by the user; and wherein the phonemes are labeled with a “100” for a 100's place, with a “10” for a 10's place, with a “1” for a 1's place, and with a “0” for an ordinal suffix. | 1. A system for recognizing location information input by a user, the location information including an intersection of streets, the system comprising: a grammar having a street grammar component that maps various different pronunciations of street names to semantic tags; a recognition system configured to receive the location information input, access the grammar, and generate a street name recognition hypothesis with associated semantic tags; an intersection data store storing a plurality of valid street intersections, each street intersection having street names of intersecting streets; a tokenization component configured to receive the street name recognition hypothesis and the associated semantic tags and to generate, for each of the associated semantic tags, a tokenized query having phonemes that are labeled with a digits position; a search component configured to search the intersection data store based on the tokenized queries and output at least one recognized intersection result identifying a street intersection recognized from the location information input by the user; and wherein the phonemes are labeled with a “100” for a 100's place, with a “10” for a 10's place, with a “1” for a 1's place, and with a “0” for an ordinal suffix. 10. The system of claim 1 wherein the search component comprises: a model configured to calculate a vector of scores corresponding to the query and determine a similarity of the query to the street names in the valid intersections in the intersection data store based on the vector of scores for the query and a vector of scores for each of the street names. | 0.5 |
7,725,883 | 5 | 6 | 5. A computer implemented method comprising the steps of: translating with a computing device at least one line of source code representing a function to byte-codes representing the function; performing a first analysis of the byte-codes using the computing device to select a subsequence of the byte-codes based on at least one property of at least one variable referenced by the subsequence of byte-codes, the at least one property including a type of the at least one variable; performing a second analysis of the subsequence using the computing device to analyze a usage pattern of the at least one variable used by the subsequence, the second analysis examining at least one dynamic run-time property of the at least one variable used in the subsequence to determine whether the usage pattern of the at least one variable indicates that the at least one variable is suitable for processing by a compiler; shortening the subsequence using the computing device based on the second analysis to exclude at least one byte-code referencing a variable identified as unsuitable for processing by the compiler; generating processor instructions in the compiler for the shortened subsequence, the generating using the computing device; and generating alternate byte-codes in an accelerated interpreter executing on the computing device for at least a portion of the byte-codes not contained in the shortened subsequence. | 5. A computer implemented method comprising the steps of: translating with a computing device at least one line of source code representing a function to byte-codes representing the function; performing a first analysis of the byte-codes using the computing device to select a subsequence of the byte-codes based on at least one property of at least one variable referenced by the subsequence of byte-codes, the at least one property including a type of the at least one variable; performing a second analysis of the subsequence using the computing device to analyze a usage pattern of the at least one variable used by the subsequence, the second analysis examining at least one dynamic run-time property of the at least one variable used in the subsequence to determine whether the usage pattern of the at least one variable indicates that the at least one variable is suitable for processing by a compiler; shortening the subsequence using the computing device based on the second analysis to exclude at least one byte-code referencing a variable identified as unsuitable for processing by the compiler; generating processor instructions in the compiler for the shortened subsequence, the generating using the computing device; and generating alternate byte-codes in an accelerated interpreter executing on the computing device for at least a portion of the byte-codes not contained in the shortened subsequence. 6. The method of claim 5 wherein the run-time properties also include a variable value. | 0.5 |
6,128,611 | 20 | 22 | 20. The computerized method of claim 14 further comprising the data object providing a business object with business logic for the application program. | 20. The computerized method of claim 14 further comprising the data object providing a business object with business logic for the application program. 22. The computerized method of claim 20 further comprising the data object isolating the business object from specifics of the database. | 0.620112 |
9,576,244 | 7 | 9 | 7. A system for executing four-valued logic in a semantic network, the system comprising: a computing device comprising a central processing unit, a runtime stack and heap, a top down / bottom up parser, and a system clock; a logic system defined in memory of said computing device, said logic system having a NOT logical connective denoted as “ ” an AND logical connective denoted as “ ” and an OR logical connective denoted as “v,” wherein false values are represented with an “F” symbol, true values are represented by a “T” symbol, undefined values are represented by a “U” symbol, and defined values are represented by a “D” symbol, such that for a property P false values are in a set { P}, true values are in a set {P}, undefined values are in a set {}, and defined values are in a set {P, P}, wherein said logic system is proven complete and w-consistent by a set of statements comprising: F is T, T is F, U is D, D is U; F F is F, F T is F, F U is F, F D is F; T A F is F, T T is T, T A U is U, T D is D; U F is F, U T is U, U U is U, U D is F; D F is F, D T is D, D U is F, D D is D; F F is F, F T is T, F U is U, F D is D; T F is T, T T is T, T U is T, T D is T; U F is U, U T is T, U U is U, U D is T; and D F is D, D T is T, D U is T, D D is D; a non-transitory computer readable medium storing machine readable instructions for causing said computing device to perform the steps of generating a semantic network representing digitally stored information, said semantic network comprising a plurality of object nodes and a plurality of relationships between said plurality of object nodes, by: providing a first vector and a second vector in digital memory for each of said plurality of object nodes, each of said first vector and said second vector being a dynamically allocated array having a plurality of index positions each with a size of one bit; linearly encoding semantic information for an object node by storing two bits that together encode a false value, true value, undefined value, or defined value, a first bit of said two bits being stored at an index position within the first vector associated with the object node, and a second bit of said two bits being stored at the same index position within the second vector associated with the object node; linearly encoding syntactic information associated with said plurality of relationships in said digital memory; and testing of conditionals or quantifying variables in said semantic network during successive recursive steps in a predicate calculus using said logic system, the false values, true values, undefined values, and defined values in the semantic information associated with said plurality of object nodes, and the syntactic information associated with said plurality of relationships, wherein linear encoding of said semantic information and said syntactic information optimizes short term memory, maximizes long term storage, and optimizes communication and memory between different knowledge sources or processes. | 7. A system for executing four-valued logic in a semantic network, the system comprising: a computing device comprising a central processing unit, a runtime stack and heap, a top down / bottom up parser, and a system clock; a logic system defined in memory of said computing device, said logic system having a NOT logical connective denoted as “ ” an AND logical connective denoted as “ ” and an OR logical connective denoted as “v,” wherein false values are represented with an “F” symbol, true values are represented by a “T” symbol, undefined values are represented by a “U” symbol, and defined values are represented by a “D” symbol, such that for a property P false values are in a set { P}, true values are in a set {P}, undefined values are in a set {}, and defined values are in a set {P, P}, wherein said logic system is proven complete and w-consistent by a set of statements comprising: F is T, T is F, U is D, D is U; F F is F, F T is F, F U is F, F D is F; T A F is F, T T is T, T A U is U, T D is D; U F is F, U T is U, U U is U, U D is F; D F is F, D T is D, D U is F, D D is D; F F is F, F T is T, F U is U, F D is D; T F is T, T T is T, T U is T, T D is T; U F is U, U T is T, U U is U, U D is T; and D F is D, D T is T, D U is T, D D is D; a non-transitory computer readable medium storing machine readable instructions for causing said computing device to perform the steps of generating a semantic network representing digitally stored information, said semantic network comprising a plurality of object nodes and a plurality of relationships between said plurality of object nodes, by: providing a first vector and a second vector in digital memory for each of said plurality of object nodes, each of said first vector and said second vector being a dynamically allocated array having a plurality of index positions each with a size of one bit; linearly encoding semantic information for an object node by storing two bits that together encode a false value, true value, undefined value, or defined value, a first bit of said two bits being stored at an index position within the first vector associated with the object node, and a second bit of said two bits being stored at the same index position within the second vector associated with the object node; linearly encoding syntactic information associated with said plurality of relationships in said digital memory; and testing of conditionals or quantifying variables in said semantic network during successive recursive steps in a predicate calculus using said logic system, the false values, true values, undefined values, and defined values in the semantic information associated with said plurality of object nodes, and the syntactic information associated with said plurality of relationships, wherein linear encoding of said semantic information and said syntactic information optimizes short term memory, maximizes long term storage, and optimizes communication and memory between different knowledge sources or processes. 9. The system of claim 7 , wherein said top down / bottom up parser is configured to perform a plurality of syntactic parses of a grammar. | 0.844595 |
8,204,213 | 1 | 9 | 1. A processor-implemented method of performing a similarity measure of a plurality of privacy-protected data, comprising: selecting, in a processor, a first value and a first context related to one or more attributes of the first value; dividing, in the processor, the first value into a first plurality of substrings in an order preserving way; processing, in the processor, each substring of the first plurality of substrings through an obfuscation function to produce a first plurality of order preserved obfuscated substrings; selecting, in the processor, a second value and a second context related to one or more attributes of the second value; dividing, in the processor, the second value into a second plurality of substrings in the order preserving way; processing, in the processor, each substring of the second plurality of substrings through the obfuscation function to produce a second plurality of order preserved obfuscated substrings; comparing, in the processor, the first and second plurality of order preserved obfuscated substrings, and determining a value similarity measure for a comparison of the first and second values based on the comparison of the first and second plurality of order preserved obfuscated substrings; comparing, in the processor, the first context and the second context, and determining a context similarity measure for the first context and the second context based on the comparison of the first and second contexts, wherein the context similarity measure indicates a validity of the comparison between the first and second values; and determining a closeness degree between the first and second values from the context similarity measure and the value similarity measure. | 1. A processor-implemented method of performing a similarity measure of a plurality of privacy-protected data, comprising: selecting, in a processor, a first value and a first context related to one or more attributes of the first value; dividing, in the processor, the first value into a first plurality of substrings in an order preserving way; processing, in the processor, each substring of the first plurality of substrings through an obfuscation function to produce a first plurality of order preserved obfuscated substrings; selecting, in the processor, a second value and a second context related to one or more attributes of the second value; dividing, in the processor, the second value into a second plurality of substrings in the order preserving way; processing, in the processor, each substring of the second plurality of substrings through the obfuscation function to produce a second plurality of order preserved obfuscated substrings; comparing, in the processor, the first and second plurality of order preserved obfuscated substrings, and determining a value similarity measure for a comparison of the first and second values based on the comparison of the first and second plurality of order preserved obfuscated substrings; comparing, in the processor, the first context and the second context, and determining a context similarity measure for the first context and the second context based on the comparison of the first and second contexts, wherein the context similarity measure indicates a validity of the comparison between the first and second values; and determining a closeness degree between the first and second values from the context similarity measure and the value similarity measure. 9. The method of claim 1 , further comprising indicating whether the first and second contexts are similar. | 0.861039 |
8,442,834 | 13 | 14 | 13. The system of claim 8 , the computer-readable storage medium having additional instructions stored which result in the operations further comprising: computing an alias comprising a best representative anchor text from a plurality of weighted anchor texts. | 13. The system of claim 8 , the computer-readable storage medium having additional instructions stored which result in the operations further comprising: computing an alias comprising a best representative anchor text from a plurality of weighted anchor texts. 14. The system of claim 13 , wherein the best representative anchor text has a weight associated with a highest ratio of salient words to total words from the plurality of weighted anchor texts. | 0.5 |
7,779,043 | 1 | 2 | 1. A system for automatically building objects and automatically defining a relationship between objects based upon context during runtime of an application using the objects, the system comprising: one or more computer storage media having stored thereon: a reception component that, when executed by a processor, receives a customized composition strategy given in a context associated with a target object, wherein the received customized composition strategy is independently built and used, without requiring changes to a consuming application and without requiring changes to other strategies of a plurality of customized composition strategies; an implementation component that automatically implements the customized composition strategy to create the target object based at least in part upon the context associated with the target object, wherein: the context associated with the target object is based on a current context of the consuming application separate from the reception and implementation components that uses the target object, the consuming application being at runtime such that the current context corresponds to a runtime context of the consuming application; and a framework associated with implementing the customized composition strategy allows for an addition of new customized composition strategies and defines a use for such strategies, and such that creation of the target object is performed during runtime of the consuming application; an ordering component that facilitates execution of the customized composition strategy in an order that is determined by the context associated with the target object, such that the customized composition strategy is ordered for execution in a different order with respect to the other strategies of the plurality of customized composition strategies when the consuming application has different contexts at runtime; and a context component that determines the context associated with the target object, wherein the context associated with the target object includes context of the application associated with the target object, existing objects associated with the target object, and relationships between the existing objects, wherein the context is a set of components that are relevant to the application and the target object at runtime of the consuming application, and at least one of the existing objects is a remote object. | 1. A system for automatically building objects and automatically defining a relationship between objects based upon context during runtime of an application using the objects, the system comprising: one or more computer storage media having stored thereon: a reception component that, when executed by a processor, receives a customized composition strategy given in a context associated with a target object, wherein the received customized composition strategy is independently built and used, without requiring changes to a consuming application and without requiring changes to other strategies of a plurality of customized composition strategies; an implementation component that automatically implements the customized composition strategy to create the target object based at least in part upon the context associated with the target object, wherein: the context associated with the target object is based on a current context of the consuming application separate from the reception and implementation components that uses the target object, the consuming application being at runtime such that the current context corresponds to a runtime context of the consuming application; and a framework associated with implementing the customized composition strategy allows for an addition of new customized composition strategies and defines a use for such strategies, and such that creation of the target object is performed during runtime of the consuming application; an ordering component that facilitates execution of the customized composition strategy in an order that is determined by the context associated with the target object, such that the customized composition strategy is ordered for execution in a different order with respect to the other strategies of the plurality of customized composition strategies when the consuming application has different contexts at runtime; and a context component that determines the context associated with the target object, wherein the context associated with the target object includes context of the application associated with the target object, existing objects associated with the target object, and relationships between the existing objects, wherein the context is a set of components that are relevant to the application and the target object at runtime of the consuming application, and at least one of the existing objects is a remote object. 2. The system of claim 1 , wherein the reception component receives the plurality of customized composition strategies. | 0.5 |
8,548,257 | 9 | 14 | 9. A computer-implemented method for evaluating image data, the method comprising: accessing an image that includes a candidate face; scaling the candidate face in accordance with a predetermined standard size to generate a scaled candidate face; generating a sharpness measure and a skin tone measure based on the scaled candidate face; evaluating the sharpness measure and the skin tone measure to determine a confidence score; and accepting the candidate face when the confidence score compares in a predetermined manner to a confidence threshold. | 9. A computer-implemented method for evaluating image data, the method comprising: accessing an image that includes a candidate face; scaling the candidate face in accordance with a predetermined standard size to generate a scaled candidate face; generating a sharpness measure and a skin tone measure based on the scaled candidate face; evaluating the sharpness measure and the skin tone measure to determine a confidence score; and accepting the candidate face when the confidence score compares in a predetermined manner to a confidence threshold. 14. The computer-implemented method of claim 9 , further comprising: assigning a weighting factor to at least one of the sharpness measure and the skin tone measure. | 0.848066 |
8,949,340 | 50 | 67 | 50. A non-transitory computer readable storage medium storing a computer program product, comprising: code for causing display of at least one user page for receiving user input that is capable of being used to define a user profile associated with a user; code for receiving a selection of content, utilizing the at least one user page; code for delivering different portions of the content to the user utilizing a plurality of delivery modes including at least three of: a SMS delivery mode, a MMS delivery mode, an IVR delivery mode, a SMTP delivery mode, a GSM delivery mode, an Internet delivery mode, a GPRS delivery mode, and a portable device-related delivery mode facilitated by application code; code for delivering a first portion of the content to the user utilizing a first delivery mode including at least one of: the SMS delivery mode, the MMS delivery mode, the IVR delivery mode, the SMTP delivery mode, the GSM delivery mode, the Internet delivery mode, the GPRS delivery mode, and a portable device-related delivery mode facilitated by the application code; code for delivering a second portion of the content to the user utilizing a second delivery mode that is different from the first delivery mode and includes at least one of: the SMS delivery mode, the MMS delivery mode, the IVR delivery mode, the SMTP delivery mode, the GSM delivery mode, the Internet delivery mode, the GPRS delivery mode, and the portable device-related delivery mode facilitated by application code; code for receiving a first command associated with a first content; code for receiving a second command associated with a second content; code for, in response to the receipt of the first command associated with the first content, delivering the first content; code for, in response to the receipt of the second command associated with the second content, delivering the second content; and code for delivering at least a portion of the content to the user via an application which is configured for installation on a portable device to: receive at least part of the content; format the at least part of the content involving at least one of a font, a color, or a placement associated with the at least part of the content; and store a plurality of words that are reused in association with the at least part of the content. | 50. A non-transitory computer readable storage medium storing a computer program product, comprising: code for causing display of at least one user page for receiving user input that is capable of being used to define a user profile associated with a user; code for receiving a selection of content, utilizing the at least one user page; code for delivering different portions of the content to the user utilizing a plurality of delivery modes including at least three of: a SMS delivery mode, a MMS delivery mode, an IVR delivery mode, a SMTP delivery mode, a GSM delivery mode, an Internet delivery mode, a GPRS delivery mode, and a portable device-related delivery mode facilitated by application code; code for delivering a first portion of the content to the user utilizing a first delivery mode including at least one of: the SMS delivery mode, the MMS delivery mode, the IVR delivery mode, the SMTP delivery mode, the GSM delivery mode, the Internet delivery mode, the GPRS delivery mode, and a portable device-related delivery mode facilitated by the application code; code for delivering a second portion of the content to the user utilizing a second delivery mode that is different from the first delivery mode and includes at least one of: the SMS delivery mode, the MMS delivery mode, the IVR delivery mode, the SMTP delivery mode, the GSM delivery mode, the Internet delivery mode, the GPRS delivery mode, and the portable device-related delivery mode facilitated by application code; code for receiving a first command associated with a first content; code for receiving a second command associated with a second content; code for, in response to the receipt of the first command associated with the first content, delivering the first content; code for, in response to the receipt of the second command associated with the second content, delivering the second content; and code for delivering at least a portion of the content to the user via an application which is configured for installation on a portable device to: receive at least part of the content; format the at least part of the content involving at least one of a font, a color, or a placement associated with the at least part of the content; and store a plurality of words that are reused in association with the at least part of the content. 67. The non-transitory computer readable storage medium of claim 50 , wherein the computer program product is operable such that the first portion of the content is capable of being the same as the second portion of the content. | 0.737327 |
7,861,161 | 1 | 5 | 1. A prompt object on a computer-readable medium used in creating a report to be executed in a reporting system, wherein the report may specify a prompt object as a property of the report, the prompt object comprising: a question to be asked of a user; a prompt type; and at least one validation property; wherein the prompt object is used in creating a report to be executed in a reporting system, wherein the report may specify a prompt object as a property of the report, and wherein the prompt object is an object separate from the report such that the prompt object may be used more than once in a single report or may be used in more than one report. | 1. A prompt object on a computer-readable medium used in creating a report to be executed in a reporting system, wherein the report may specify a prompt object as a property of the report, the prompt object comprising: a question to be asked of a user; a prompt type; and at least one validation property; wherein the prompt object is used in creating a report to be executed in a reporting system, wherein the report may specify a prompt object as a property of the report, and wherein the prompt object is an object separate from the report such that the prompt object may be used more than once in a single report or may be used in more than one report. 5. The prompt object of claim 1 further comprising a reuse value that indicates whether an answer provided from a previous instance of that prompt object, a default value or a new value is to be used for an answer to the question in the prompt object. | 0.5 |
7,711,573 | 76 | 89 | 76. A method for using a computer to improve a precision ratio when searching a resume database, comprising: receiving a resume in a memory device resident in the computer; parsing the resume to: locate at least one skill or experience-related phrase in the resume; determine an experience range for each said at least one skill or experience-related phrase by examining a use of each said at least one skill or experience-related phrase in the resume; and compute, by the computer, a term of experience for each said at least one skill or experience-related phrase based on the experience range, wherein the term of experience for each said at least one skill or experience-related phrase is a summation of the term of experience for each occurrence of the phrase associated with a different experience range; storing the resume in the resume database; creating a parsed resume based on the resume, the parsed resume including each said at least one skill or experience-related phrase located in the resume, the term of experience computed for each said at least one skill or experience-related phrase, and a relationship between the term of experience and each said at least one skill or experience-related phrase; storing the parsed resume in the resume database; sending a database query to the resume database, the database query including a job description that includes at least one job requirement, each said at least one job requirement including a required skill or experience-related phrase, and a required term of experience; and receiving a result set in response to the database query, wherein the result set includes the resume when the parsed resume satisfies the job description. | 76. A method for using a computer to improve a precision ratio when searching a resume database, comprising: receiving a resume in a memory device resident in the computer; parsing the resume to: locate at least one skill or experience-related phrase in the resume; determine an experience range for each said at least one skill or experience-related phrase by examining a use of each said at least one skill or experience-related phrase in the resume; and compute, by the computer, a term of experience for each said at least one skill or experience-related phrase based on the experience range, wherein the term of experience for each said at least one skill or experience-related phrase is a summation of the term of experience for each occurrence of the phrase associated with a different experience range; storing the resume in the resume database; creating a parsed resume based on the resume, the parsed resume including each said at least one skill or experience-related phrase located in the resume, the term of experience computed for each said at least one skill or experience-related phrase, and a relationship between the term of experience and each said at least one skill or experience-related phrase; storing the parsed resume in the resume database; sending a database query to the resume database, the database query including a job description that includes at least one job requirement, each said at least one job requirement including a required skill or experience-related phrase, and a required term of experience; and receiving a result set in response to the database query, wherein the result set includes the resume when the parsed resume satisfies the job description. 89. The method of claim 76 , wherein the storing of the resume further comprises: storing the resume as a private resume, wherein the resume database is accessible by at least one recruitment team, each said at least one recruitment team including at least one recruitment team member, and the private resume is accessible by only one recruitment team of said at least one recruitment team. | 0.590336 |
8,909,683 | 3 | 4 | 3. The method of claim 1 , wherein the querying further comprises: conducting a search of the resources serving as query objects. | 3. The method of claim 1 , wherein the querying further comprises: conducting a search of the resources serving as query objects. 4. The method of claim 3 , further comprising: adapting the search of a respective queried resource to the type of content represented by the respective queried resource. | 0.5 |
9,509,655 | 4 | 5 | 4. The method of claim 1 , wherein the processor receives at least a part of the content that has been posted in the social network website by the first user. | 4. The method of claim 1 , wherein the processor receives at least a part of the content that has been posted in the social network website by the first user. 5. The method of claim 4 , wherein the processor receives all of the content that has been posted in the social network website by the first user. | 0.5 |
9,772,981 | 2 | 10 | 2. The program product of claim 1 wherein the semantic units are words of a human language. | 2. The program product of claim 1 wherein the semantic units are words of a human language. 10. The program product of claim 2 further comprising logic that further compresses the processed data by syllable. | 0.69086 |
8,423,347 | 11 | 12 | 11. One or more computer storage media according to claim 9 , wherein said step of managing the natural language entry includes: displaying the natural language entry in a list of one or more natural language entries within the interface, the list contains entries associated with the plurality of the types of PIM data which include task PIM data, contact PIM data and calendar PIM data. | 11. One or more computer storage media according to claim 9 , wherein said step of managing the natural language entry includes: displaying the natural language entry in a list of one or more natural language entries within the interface, the list contains entries associated with the plurality of the types of PIM data which include task PIM data, contact PIM data and calendar PIM data. 12. One or more computer storage media according to claim 11 , wherein said step of managing includes: receiving a request to edit the natural language entry in the list of one or more natural language entries, the user data in the natural language entry is first user data; displaying the edited natural language entry in the user interface response to the request to edit, the edited natural language entry including second user data; identifying the second user data in the edited natural language entry within the user interface; and storing the second user data by the PIM application. | 0.5 |
7,533,122 | 19 | 20 | 19. The method of claim 13 wherein the correspondence test comprises comparing an identifier of the element with an identifier of an object property of the class of the further entity group and an identifier of a range of the object property. | 19. The method of claim 13 wherein the correspondence test comprises comparing an identifier of the element with an identifier of an object property of the class of the further entity group and an identifier of a range of the object property. 20. The method of claim 19 wherein comparing the identifier of the element with the identifier of the object property and the identifier of the range comprises testing if the identifier of the element is similar to the identifier of the object property and the identifier of the range according to a third similarity test. | 0.5 |
9,386,046 | 1 | 5 | 1. A method for improving a statistical message classifier, the method comprising: receiving a message over a network communication interface; identifying by a processor executing instructions out of a memory a feature in the message that is associated with a junk count; testing the message with a machine classifier by the processor performing a calculation according to a logarithmic function including the junk count, wherein the machine classifier outputs a value for the statistical message classifier for storage in the memory; updating the statistical message classifier stored in the memory according to the logarithmic calculation made by the machine classifier, wherein the stored statistical message classifier corresponds to a probability that the feature in the message is spam; identifying that the message is spam based on the probability that the feature in the message is spam; and quarantining the message. | 1. A method for improving a statistical message classifier, the method comprising: receiving a message over a network communication interface; identifying by a processor executing instructions out of a memory a feature in the message that is associated with a junk count; testing the message with a machine classifier by the processor performing a calculation according to a logarithmic function including the junk count, wherein the machine classifier outputs a value for the statistical message classifier for storage in the memory; updating the statistical message classifier stored in the memory according to the logarithmic calculation made by the machine classifier, wherein the stored statistical message classifier corresponds to a probability that the feature in the message is spam; identifying that the message is spam based on the probability that the feature in the message is spam; and quarantining the message. 5. The method for improving a message classifier as recited in claim 1 , wherein the machine classifier includes an image analyzer. | 0.723629 |
9,864,508 | 1 | 7 | 1. An electronic device, comprising: one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: receiving an indication of a first input that includes movement of a contact detected on a touch-sensitive surface of a device, wherein: the movement of the contact comprises a first stroke, and the first stroke has a spatial component and a temporal component; determining a first probability that the first stroke corresponds to a first character based on the spatial component of the first stroke; determining a second probability that the first stroke corresponds to the first character based on the temporal component of the first stroke; determining an aggregate probability that the first stroke corresponds to the first character based on the first probability and the second probability; detecting an end of the first stroke; and after detecting the end of the first stroke: detecting at least a portion of a second stroke; and in response to detecting the portion of the second stroke and while the second stroke is still being detected, determining whether the first stroke and the second stroke correspond to a single character based on temporal information about the first stroke and the second stroke. | 1. An electronic device, comprising: one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: receiving an indication of a first input that includes movement of a contact detected on a touch-sensitive surface of a device, wherein: the movement of the contact comprises a first stroke, and the first stroke has a spatial component and a temporal component; determining a first probability that the first stroke corresponds to a first character based on the spatial component of the first stroke; determining a second probability that the first stroke corresponds to the first character based on the temporal component of the first stroke; determining an aggregate probability that the first stroke corresponds to the first character based on the first probability and the second probability; detecting an end of the first stroke; and after detecting the end of the first stroke: detecting at least a portion of a second stroke; and in response to detecting the portion of the second stroke and while the second stroke is still being detected, determining whether the first stroke and the second stroke correspond to a single character based on temporal information about the first stroke and the second stroke. 7. The electronic device of claim 1 , wherein the one or more programs further include instructions for: determining a plurality of aggregate probabilities for a plurality of characters, a first aggregate probability comprising an aggregate probability that the first stroke corresponds to a first character of the plurality of characters and a second aggregate probability comprising an aggregate probability that the first stroke corresponds to a second character of the plurality of characters; and selecting, from the plurality of characters, a character having a highest aggregate probability as an input. | 0.717593 |
6,081,665 | 62 | 67 | 62. The RTVMM of claim 1 wherein each object has a "lock" field initialized to a "null" value, the implementing step comprising the steps: causing a "hashlock object" for each object needing either a lock or a hash value to be allocated memory space and initialized, the "hashlock object" having a "hash value" field; causing the address of the "hashlock object" to be written into the "lock" field of the object; causing the hash value of an object to be retrieved by reading the "hash value" field of the associated "hashlock object". | 62. The RTVMM of claim 1 wherein each object has a "lock" field initialized to a "null" value, the implementing step comprising the steps: causing a "hashlock object" for each object needing either a lock or a hash value to be allocated memory space and initialized, the "hashlock object" having a "hash value" field; causing the address of the "hashlock object" to be written into the "lock" field of the object; causing the hash value of an object to be retrieved by reading the "hash value" field of the associated "hashlock object". 67. The RTVMM of claim 62 wherein a thread's access to a monitor object has been terminated and a "hash value" field of a "hashlock object" associated with the monitor object is 0, the implementing step comprising the steps: causing a "lock" field in the monitor object to be set to a "null" value; causing the placement of the "hashlock object" on a list of available "hashlock objects" to be used in satisfying new requests for "hashlock objects". | 0.728208 |
9,330,157 | 15 | 21 | 15. A system comprising: one or more processors; one or more non-transitory computer readable storage media coupled to the one or more processors and comprising logic configured to: access an ontology map comprising link mappings of one or more link types defined by a first ontology to one or more link types defined by a second ontology; wherein the ontology map comprises a mapping from a first object type defined by the first ontology to a second object type defined by the second ontology and a mapping from a third object type defined by the first ontology to a fourth object type defined by the second ontology; wherein the first ontology defines a first link type as including a first direction of relationship between the first object type and the third object type, and the second ontology defines a second link type as including a second direction of relationship between the second object type and the fourth object type; wherein the link mappings comprise an asymmetric mapping from the first link type of the first ontology to the second link type of the second ontology that specifies that the first direction of the first link type is opposite to the second direction of the second link type; receive a set of one or more database changes that were made using the first ontology and comprising a change involving a first link of the first link type; and based at least in part on the asymmetric mapping, incorporate the set of one or more database changes into a set of data that is organized according to the second ontology, at least in part by using the asymmetric mapping to determine a direction of a second link of the second link type. | 15. A system comprising: one or more processors; one or more non-transitory computer readable storage media coupled to the one or more processors and comprising logic configured to: access an ontology map comprising link mappings of one or more link types defined by a first ontology to one or more link types defined by a second ontology; wherein the ontology map comprises a mapping from a first object type defined by the first ontology to a second object type defined by the second ontology and a mapping from a third object type defined by the first ontology to a fourth object type defined by the second ontology; wherein the first ontology defines a first link type as including a first direction of relationship between the first object type and the third object type, and the second ontology defines a second link type as including a second direction of relationship between the second object type and the fourth object type; wherein the link mappings comprise an asymmetric mapping from the first link type of the first ontology to the second link type of the second ontology that specifies that the first direction of the first link type is opposite to the second direction of the second link type; receive a set of one or more database changes that were made using the first ontology and comprising a change involving a first link of the first link type; and based at least in part on the asymmetric mapping, incorporate the set of one or more database changes into a set of data that is organized according to the second ontology, at least in part by using the asymmetric mapping to determine a direction of a second link of the second link type. 21. The system of claim 15 , wherein the logic is configured to, for each data type of the first ontology that is not defined in the second ontology, verify that the data type can be mapped to a corresponding data type of the second ontology before the logic incorporates the set of one or more database changes into the set of data. | 0.660204 |
10,127,289 | 1 | 9 | 1. A system comprising: a data store configured to store computer-executable instructions and a plurality of records, wherein each record of the plurality of records is associated with a respective entity and comprises one or more fields; a computing device including a processor in communication with the data store, the processor configured to execute the computer-executable instructions to at least: identify, based at least in part on a first field of the one or more fields, a first group of the plurality of records; determine that a distribution of sizes of groups including the first group satisfies a distribution rule; generate one or more record pairs from the first group, each of the one or more record pairs comprising a respective first record and second record, wherein at least one field of the first record differs from a corresponding field in the second record; determine, for each of the one or more record pairs, a respective match score, the respective match scores comprising probabilities that the respective first record and second record of the respective record pair are associated with a respective same entity; identify a plurality of clusters of record pairs, wherein each pair in each cluster has a record in common with at least one other pair in the cluster, and wherein each pair in each cluster has a respective match score above a threshold; determine, for each of the plurality of clusters, that a diameter of the cluster satisfies a diameter criterion; determine, for each of the plurality of clusters, that an entropy of the cluster satisfies an entropy criterion; determine, based at least in part on the distribution of sizes of groups, the respective match scores, the diameter criterion, and the entropy criterion, that each of the plurality of clusters corresponds to a respective entity; determine, for each of the plurality of clusters, a geographical location associated with the cluster, the geographic location corresponding to the respective entity; generate, based at least in part on the geographical location associated with each cluster and a number of record pairs in each cluster, a heat map for display on a client computing device, wherein the heat map enables identification of suitable locations for providing coverage of the geographical locations associated with the clusters, wherein the heat map overlays information regarding the number of record pairs in each cluster on the geographic location associated with the cluster, and wherein the heat map displays information regarding the at least one field of individual records in each cluster as a color, symbol, shading, or other representation; and cause the client computing device to display the heat map. | 1. A system comprising: a data store configured to store computer-executable instructions and a plurality of records, wherein each record of the plurality of records is associated with a respective entity and comprises one or more fields; a computing device including a processor in communication with the data store, the processor configured to execute the computer-executable instructions to at least: identify, based at least in part on a first field of the one or more fields, a first group of the plurality of records; determine that a distribution of sizes of groups including the first group satisfies a distribution rule; generate one or more record pairs from the first group, each of the one or more record pairs comprising a respective first record and second record, wherein at least one field of the first record differs from a corresponding field in the second record; determine, for each of the one or more record pairs, a respective match score, the respective match scores comprising probabilities that the respective first record and second record of the respective record pair are associated with a respective same entity; identify a plurality of clusters of record pairs, wherein each pair in each cluster has a record in common with at least one other pair in the cluster, and wherein each pair in each cluster has a respective match score above a threshold; determine, for each of the plurality of clusters, that a diameter of the cluster satisfies a diameter criterion; determine, for each of the plurality of clusters, that an entropy of the cluster satisfies an entropy criterion; determine, based at least in part on the distribution of sizes of groups, the respective match scores, the diameter criterion, and the entropy criterion, that each of the plurality of clusters corresponds to a respective entity; determine, for each of the plurality of clusters, a geographical location associated with the cluster, the geographic location corresponding to the respective entity; generate, based at least in part on the geographical location associated with each cluster and a number of record pairs in each cluster, a heat map for display on a client computing device, wherein the heat map enables identification of suitable locations for providing coverage of the geographical locations associated with the clusters, wherein the heat map overlays information regarding the number of record pairs in each cluster on the geographic location associated with the cluster, and wherein the heat map displays information regarding the at least one field of individual records in each cluster as a color, symbol, shading, or other representation; and cause the client computing device to display the heat map. 9. The system of claim 1 , wherein the processor is further configured to execute the computer-executable instructions to identify the first group of the plurality of records by at least: accessing a first record, a second record, and a third record of the plurality of records; accessing a blocking model including information indicative of at least a first field to be compared between candidate pairs of records and a second field to be compared between candidate pairs of records; comparing a value of the first field of the first record with a value of the first field of the second record to determine first matching fields; in response to determining the first matching fields, grouping the first record and the second record into the first group; comparing a value of the first field of the second record with a value of the first field of the third record to determine that the fields do not match; comparing the value of the second field of the second record with a value of the second field of the third record to determine second matching fields; in response to determining the second matching fields, adding the third record to the first group. | 0.56041 |
8,984,398 | 1 | 8 | 1. A method comprising: extracting, by a computing platform comprising one or more processors, a group of two or more sentences of an electronic document; segmenting individual sentences of said of said two or more sentences into a first phrase and at least a second phrase, said first phrase comprising at least one word not contained within said at least a second phrase; determining two or more paths between phrases of said individual sentences, individual paths of said two or more paths comprising no more than one phrase from individual ones of said individual sentences; at least partially in response to receiving a search query, determining respective scores for said individual paths based at least in part on a utility metric and a ranking of said two or more sentences with respect to said search query; generating an abstract of said electronic document, said abstract comprising individual ones of said phrases associated with a first path of said two or more paths, said first path being associated with a highest of said respective scores, wherein a first phrase of said phrases associated with said first path is different from a second phrase of said phrases associated with said first path; and transmitting one or more search results comprising at least said abstract to a user at least partially in response to receiving said search query from said user. | 1. A method comprising: extracting, by a computing platform comprising one or more processors, a group of two or more sentences of an electronic document; segmenting individual sentences of said of said two or more sentences into a first phrase and at least a second phrase, said first phrase comprising at least one word not contained within said at least a second phrase; determining two or more paths between phrases of said individual sentences, individual paths of said two or more paths comprising no more than one phrase from individual ones of said individual sentences; at least partially in response to receiving a search query, determining respective scores for said individual paths based at least in part on a utility metric and a ranking of said two or more sentences with respect to said search query; generating an abstract of said electronic document, said abstract comprising individual ones of said phrases associated with a first path of said two or more paths, said first path being associated with a highest of said respective scores, wherein a first phrase of said phrases associated with said first path is different from a second phrase of said phrases associated with said first path; and transmitting one or more search results comprising at least said abstract to a user at least partially in response to receiving said search query from said user. 8. The method of claim 1 , further comprising: extracting said set of two or more sentences from said electronic document; determining an intent of a given query; determining a query-dependent relevance of said two or more sentences with respect to a given query; determining a degree to which said two or more sentences summarize said electronic document; determining a relevance of said two or more sentences based at least in part upon said intent of a given query, said query-dependent relevance, or said degree to which said two or more sentences summarize said electronic; and ranking said two or more sentences into said ranked order based at least in part on said determined relevance. | 0.5 |
8,078,450 | 1 | 7 | 1. A method for a computer to analyze a sentence in a source language, comprising: performing a lexical analysis of the sentence in the source language; performing a lexical-morphological analysis of each element of the sentence and building a lexical-morphological structure for the whole sentence; performing a rough syntactic analysis on the lexical-morphological structure comprising: generating all possible constituents for each element of the lexical-morphological structure; generalizing the constituents to form a set of generalized constituents; and generating a graph of the generalized constituents to describe all possible syntactic structures of the whole sentence, comprising: for each generalized constituent having a lexical meaning and grammatical value which corresponds to a connection in the lexical-morphological structure: initializing a surface model for the generalized constituent; attempting to attach other constituents in surface slots of the syntforms of the surface model right and left neighboring constituents; and establishing non-tree links on the graph of the generalized constituents; performing a precise syntactic analysis to produce one or more syntactic trees for the sentence from the graph of the generalized constituents, the precise syntactic analysis including: generating a graph of precise constituents, the graph of precise constituents being an intermediate representation between the graph of the generalized constituents and the one or more syntactic trees; generating one or more syntactic structure variants from the graph of the precise constituents; rating the precise constituents based on a plurality of rating scores independently obtained and calculated, including rating scores of one or more lexical meanings for each element of the sentence, rating scores of one or more syntactic constructions for each element of the sentence, rating scores of a degree of correspondence of the precise constituents to their semantic descriptions, and rating scores of a linear order of constituents in the sentence; using the rating of the precise constituents to generate hypotheses about the overall syntactic structure of the sentence; and selecting one or more hypotheses about the overall syntactic structure of the sentence with a highest rating score from the hypotheses generated; selecting a best syntactic structure for the sentence from the one or more syntactic trees; and generating a language-independent semantic structure for the sentence in the source language based at least in part upon the best syntactic structure for the sentence. | 1. A method for a computer to analyze a sentence in a source language, comprising: performing a lexical analysis of the sentence in the source language; performing a lexical-morphological analysis of each element of the sentence and building a lexical-morphological structure for the whole sentence; performing a rough syntactic analysis on the lexical-morphological structure comprising: generating all possible constituents for each element of the lexical-morphological structure; generalizing the constituents to form a set of generalized constituents; and generating a graph of the generalized constituents to describe all possible syntactic structures of the whole sentence, comprising: for each generalized constituent having a lexical meaning and grammatical value which corresponds to a connection in the lexical-morphological structure: initializing a surface model for the generalized constituent; attempting to attach other constituents in surface slots of the syntforms of the surface model right and left neighboring constituents; and establishing non-tree links on the graph of the generalized constituents; performing a precise syntactic analysis to produce one or more syntactic trees for the sentence from the graph of the generalized constituents, the precise syntactic analysis including: generating a graph of precise constituents, the graph of precise constituents being an intermediate representation between the graph of the generalized constituents and the one or more syntactic trees; generating one or more syntactic structure variants from the graph of the precise constituents; rating the precise constituents based on a plurality of rating scores independently obtained and calculated, including rating scores of one or more lexical meanings for each element of the sentence, rating scores of one or more syntactic constructions for each element of the sentence, rating scores of a degree of correspondence of the precise constituents to their semantic descriptions, and rating scores of a linear order of constituents in the sentence; using the rating of the precise constituents to generate hypotheses about the overall syntactic structure of the sentence; and selecting one or more hypotheses about the overall syntactic structure of the sentence with a highest rating score from the hypotheses generated; selecting a best syntactic structure for the sentence from the one or more syntactic trees; and generating a language-independent semantic structure for the sentence in the source language based at least in part upon the best syntactic structure for the sentence. 7. The method of claim 1 , wherein building the graph of the generalized constituents further comprises performing ellipsis restoration. | 0.870968 |
7,562,342 | 2 | 20 | 2. The method of claim 1 , further comprising: if the set of incremental changes is made to the doclet model, transforming the set of incremental changes in the doclet model to a semantic model; and persisting the source model, the doclet model, the semantic model, and links between the doclet model and the semantic model to the state location. | 2. The method of claim 1 , further comprising: if the set of incremental changes is made to the doclet model, transforming the set of incremental changes in the doclet model to a semantic model; and persisting the source model, the doclet model, the semantic model, and links between the doclet model and the semantic model to the state location. 20. The method of claim 2 , wherein the transforming step comprises: creating a model content handler for a given namespace of the at least one annotation; retrieving a list of modified doclet objects from the annotation change recorder; and processing a list of modified doclet objects retrieved from the annotation change recorder in the model content handler. | 0.5 |
9,134,935 | 1 | 9 | 1. A method for securely transporting in a networked environment a document to be printed, the method comprising: providing a policy server; wherein a user defines a set of access rules for the document through the policy server; wherein the policy server stores the access rules and a decryption key for the document; wherein the access rules apply to any of: the entire document or individual pages of the document; providing a print server; providing document encryption means for encrypting the document; wherein the encryption means attaches the policy server's name, IP address, or URL address to the document; sending the encrypted document to a receiving user's computer; wherein the receiving user's computer stores the document locally; providing notification means for notifying a receiving user of the existence of the document on the receiving user's computer, and responsive to the receiving user requesting, at a later time than when said document was locally stored, the document be printed, the receiving user's computer retrieving the document from local storage, contacting the policy server, and requesting therefrom the set of access rules and the decryption key for the one document, wherein the policy server references the document, an identifier of the receiving user, and a computer ID of the user's computer to retrieve the decryption key and access rules for the document and wherein the policy server tracks which computers can print the document and which printer that the user's computer is connected to can print the document. | 1. A method for securely transporting in a networked environment a document to be printed, the method comprising: providing a policy server; wherein a user defines a set of access rules for the document through the policy server; wherein the policy server stores the access rules and a decryption key for the document; wherein the access rules apply to any of: the entire document or individual pages of the document; providing a print server; providing document encryption means for encrypting the document; wherein the encryption means attaches the policy server's name, IP address, or URL address to the document; sending the encrypted document to a receiving user's computer; wherein the receiving user's computer stores the document locally; providing notification means for notifying a receiving user of the existence of the document on the receiving user's computer, and responsive to the receiving user requesting, at a later time than when said document was locally stored, the document be printed, the receiving user's computer retrieving the document from local storage, contacting the policy server, and requesting therefrom the set of access rules and the decryption key for the one document, wherein the policy server references the document, an identifier of the receiving user, and a computer ID of the user's computer to retrieve the decryption key and access rules for the document and wherein the policy server tracks which computers can print the document and which printer that the user's computer is connected to can print the document. 9. The method of claim 1 , wherein the access rules define any of: the expiration date and the maximum number of prints. | 0.661017 |
8,275,602 | 18 | 19 | 18. The system for providing text-based dialogue of claim 17 , further comprising an audio converter that receives input speech from the speech synthesizer and converts spoken language input speech to the entered text-based communication data in the dialogue language of the communicant upon which the speech synthesizer is used as the input device. | 18. The system for providing text-based dialogue of claim 17 , further comprising an audio converter that receives input speech from the speech synthesizer and converts spoken language input speech to the entered text-based communication data in the dialogue language of the communicant upon which the speech synthesizer is used as the input device. 19. The system for providing text-based dialogue of claim 18 , wherein the translation control processor translates the received input speech from the speech synthesizer to entered text-based communication data in the dialogue language of the second communicant. | 0.5 |
7,505,463 | 30 | 43 | 30. A computer accessible medium, comprising program instructions configured to implement: receiving a plurality of packet flow rules from multiple network services, wherein each packet flow rule comprises a packet filter and an action list including one or more prioritized actions, wherein each network service has a priority, and wherein the packet flow rules from each network service comprise a priority expressed either by longest prefix, or ordered precedence; generating a unified rule set according to the received packet flow rules, wherein said generating comprises: identifying conflicts between rule pairs, wherein each rule pair includes a higher priority rule and a lower priority rule; and resolving the identified conflicts according to a priority relationship between the higher priority rule and the lower priority rule. | 30. A computer accessible medium, comprising program instructions configured to implement: receiving a plurality of packet flow rules from multiple network services, wherein each packet flow rule comprises a packet filter and an action list including one or more prioritized actions, wherein each network service has a priority, and wherein the packet flow rules from each network service comprise a priority expressed either by longest prefix, or ordered precedence; generating a unified rule set according to the received packet flow rules, wherein said generating comprises: identifying conflicts between rule pairs, wherein each rule pair includes a higher priority rule and a lower priority rule; and resolving the identified conflicts according to a priority relationship between the higher priority rule and the lower priority rule. 43. The computer accessible medium of claim 30 , wherein the program instructions are further configured to implement: receiving a new packet flow rule from a network service; inserting the new packet flow rule into the unified rule set according to the priority of the new packet flow rule; identifying one or more conflicts between the new packet flow rule and existing rules of the unified rule set; and resolving the identified conflicts according to a priority relation between the conflicting rules. | 0.620871 |
7,873,642 | 10 | 11 | 10. The computer program product of claim 9 , wherein the fourth instructions for modifying the confidence score automatically for a classifier include instructions for boosting the confidence score using a boosting factor determined based on a correspondence between the confidence score and confidence scores of ancestor classifiers in the hierarchical classification structure. | 10. The computer program product of claim 9 , wherein the fourth instructions for modifying the confidence score automatically for a classifier include instructions for boosting the confidence score using a boosting factor determined based on a correspondence between the confidence score and confidence scores of ancestor classifiers in the hierarchical classification structure. 11. The computer program product of claim 10 , wherein the boosting factor is determined as a function of a difference between the confidence score of the classifier and confidence scores of each ancestor classifier in the hierarchical classification structure. | 0.5 |
8,065,346 | 10 | 11 | 10. A computer readable medium being of non-transitory tangible media containing executable program instructions executed by a processor, comprising: a namespace and storage management application, executing on a computer associated with a management console, the namespace and storage management application initiating performance of commands directed to managed objects including facilitating configuration and management of pathnames in a logical namespace, and configured to spawn a graphical user interface thread for use by a GUI toolkit, the GUI toolkit configured to produce reusable GUI components that allow a user to interface with the application on a computer console to manage various said pathnames exported by heterogeneous namespace services and protocol implementations within the logical namespace, and to input commands as to selected objects on one or more associated servers, said GUI toolkit supporting reusable templates that facilitate reuse of the GUI components within one of the management application and other applications, said templates having optimized operational flow arrangements. | 10. A computer readable medium being of non-transitory tangible media containing executable program instructions executed by a processor, comprising: a namespace and storage management application, executing on a computer associated with a management console, the namespace and storage management application initiating performance of commands directed to managed objects including facilitating configuration and management of pathnames in a logical namespace, and configured to spawn a graphical user interface thread for use by a GUI toolkit, the GUI toolkit configured to produce reusable GUI components that allow a user to interface with the application on a computer console to manage various said pathnames exported by heterogeneous namespace services and protocol implementations within the logical namespace, and to input commands as to selected objects on one or more associated servers, said GUI toolkit supporting reusable templates that facilitate reuse of the GUI components within one of the management application and other applications, said templates having optimized operational flow arrangements. 11. The computer readable medium being of non-transitory tangible media as defined in claim 10 further comprising computer executable instructions including one or more program instructions for displaying selected managed objects on a display panel and in a view configuration format chosen from a view configuration portion of a view panel. | 0.610731 |
8,843,554 | 1 | 3 | 1. A method comprising: by a client computing device, identifying one or more objects or references to the objects embedded in a structured document displayed to a first user, wherein: the structured document is a markup-language document displayed as a webpage; and the objects originate from one or more sources external to a social-networking system; by the client computing device, accessing a social graph of the social-networking system to: determine if one or more second users having an association with the first user have accessed or are accessing any of the identified objects; and retrieve, from the social-networking system, one or more social-network data elements comprising social-network profile information provided by one or more of the second users to the social-networking system; and by the client computing device, modifying, for at least one of the objects, the structured document displayed as a webpage to the first user to indicate that the object embedded in the structured document and originating from the sources external to the social-networking system has been accessed or is being accessed by one or more of the second users, wherein modifying the structured document comprises displaying, proximal to the object, one or more of the social-network data elements. | 1. A method comprising: by a client computing device, identifying one or more objects or references to the objects embedded in a structured document displayed to a first user, wherein: the structured document is a markup-language document displayed as a webpage; and the objects originate from one or more sources external to a social-networking system; by the client computing device, accessing a social graph of the social-networking system to: determine if one or more second users having an association with the first user have accessed or are accessing any of the identified objects; and retrieve, from the social-networking system, one or more social-network data elements comprising social-network profile information provided by one or more of the second users to the social-networking system; and by the client computing device, modifying, for at least one of the objects, the structured document displayed as a webpage to the first user to indicate that the object embedded in the structured document and originating from the sources external to the social-networking system has been accessed or is being accessed by one or more of the second users, wherein modifying the structured document comprises displaying, proximal to the object, one or more of the social-network data elements. 3. The method of claim 1 , wherein modifying the structured document comprises one or more of highlighting, coloring, or bolding one or more of the objects. | 0.795812 |
9,069,847 | 27 | 28 | 27. The article of claim 25 wherein the initially processing generates a reverse index which includes one list of the features and the initial documents which include respective ones of the features. | 27. The article of claim 25 wherein the initially processing generates a reverse index which includes one list of the features and the initial documents which include respective ones of the features. 28. The article of claim 27 wherein the subsequently processing generates another reverse index which includes another list of the features and the initial and subsequent documents which include respective ones of the features. | 0.5 |
9,769,107 | 11 | 15 | 11. A system comprising: one or more computing devices; and at least one non-transitory storage device storing instructions operable to cause the one or more computing devices to perform operations comprising: receiving, from a first user device, activity information on an activity performed by a user of the first user device; receiving, from the first user device, a location where the first user device has stayed for at least a threshold amount of time; automatically determining, based on the activity information, a type of the activity; creating a social group based on the location and the type of the activity, including determining a theme of the social group based on the type of the activity; determining that a first condition that a second user device is located at the location or will visit the location is satisfied; determining that a second condition that the second user device seeks information related to the location or related to the theme of the social group is satisfied; and in response to determining that the first and second conditions are satisfied, providing a recommendation to join the social group to the second user device. | 11. A system comprising: one or more computing devices; and at least one non-transitory storage device storing instructions operable to cause the one or more computing devices to perform operations comprising: receiving, from a first user device, activity information on an activity performed by a user of the first user device; receiving, from the first user device, a location where the first user device has stayed for at least a threshold amount of time; automatically determining, based on the activity information, a type of the activity; creating a social group based on the location and the type of the activity, including determining a theme of the social group based on the type of the activity; determining that a first condition that a second user device is located at the location or will visit the location is satisfied; determining that a second condition that the second user device seeks information related to the location or related to the theme of the social group is satisfied; and in response to determining that the first and second conditions are satisfied, providing a recommendation to join the social group to the second user device. 15. The system of claim 11 , wherein determining the theme of the social group comprises: determining a meaning of the location based on a pattern of the first device visiting the location and one or more rules corresponding to patterns of human behavior; and determining the theme based on the meaning and the activity information. | 0.6826 |
9,304,991 | 10 | 11 | 10. A computer program product for identifying one or more of a plurality of enterprise-level business processes of an enterprise and a plurality of monitoring templates, said computer program product comprising a tangible computer readable recordable storage medium having computer readable program code embodied therewith, said computer readable program code comprising: computer readable program code configured to obtain, using at least one processing device, at least one of said plurality of enterprise-level business processes and said plurality of monitoring templates, wherein at least one of said obtained enterprise-level business processes and said obtained monitoring template has an associated monitoring intent comprising one or more monitoring keywords, wherein said monitoring intent links one or more business goals of said enterprise to a given enterprise-level business process such that said monitoring intent can be searched to identify at least one existing enterprise-level business process that is related to a new enterprise-level business process being created; computer readable program code configured to obtain, using at least one processing device, a user-specified monitoring intent from said user, said user-specified monitoring intent comprising one or more search keywords; computer readable program code configured to assign. using at least one processing device, a score to at least one of said obtained enterprise-level business process and said monitoring template, wherein said score is based on a matching of a semantic context of said associated monitoring intent and one or more of said monitoring keywords from said associated monitoring intent with a semantic context of said user-specified monitoring intent and said search keywords of said user-specified monitoring intent; and computer readable program code configured to identify, using at least one processing device, said one or more of said plurality of enterprise-level business processes and said plurality of monitoring templates based on said assigned score. | 10. A computer program product for identifying one or more of a plurality of enterprise-level business processes of an enterprise and a plurality of monitoring templates, said computer program product comprising a tangible computer readable recordable storage medium having computer readable program code embodied therewith, said computer readable program code comprising: computer readable program code configured to obtain, using at least one processing device, at least one of said plurality of enterprise-level business processes and said plurality of monitoring templates, wherein at least one of said obtained enterprise-level business processes and said obtained monitoring template has an associated monitoring intent comprising one or more monitoring keywords, wherein said monitoring intent links one or more business goals of said enterprise to a given enterprise-level business process such that said monitoring intent can be searched to identify at least one existing enterprise-level business process that is related to a new enterprise-level business process being created; computer readable program code configured to obtain, using at least one processing device, a user-specified monitoring intent from said user, said user-specified monitoring intent comprising one or more search keywords; computer readable program code configured to assign. using at least one processing device, a score to at least one of said obtained enterprise-level business process and said monitoring template, wherein said score is based on a matching of a semantic context of said associated monitoring intent and one or more of said monitoring keywords from said associated monitoring intent with a semantic context of said user-specified monitoring intent and said search keywords of said user-specified monitoring intent; and computer readable program code configured to identify, using at least one processing device, said one or more of said plurality of enterprise-level business processes and said plurality of monitoring templates based on said assigned score. 11. The computer program product of claim 10 , wherein said computer readable program code is further configured to generate a ranked list of said one or more of said plurality of enterprise-level business processes and said plurality of monitoring templates based on said score. | 0.683673 |
5,557,720 | 1 | 2 | 1. A method for determining whether an editing step of a document tree results in a weakly valid document structure, the weakly valid document structure being a document structure that is extendable into a valid document structure that satisfies a grammar, the method comprising the steps of: producing the document tree having a plurality of nodes labelled with symbols of the grammar; examining selective nodes of the document tree to determine whether the selective nodes are weakly valid to extend into the valid document structure that satisfies the grammar; and performing the editing step to obtain the weakly valid document structure if the selective nodes are determined to be weakly valid. | 1. A method for determining whether an editing step of a document tree results in a weakly valid document structure, the weakly valid document structure being a document structure that is extendable into a valid document structure that satisfies a grammar, the method comprising the steps of: producing the document tree having a plurality of nodes labelled with symbols of the grammar; examining selective nodes of the document tree to determine whether the selective nodes are weakly valid to extend into the valid document structure that satisfies the grammar; and performing the editing step to obtain the weakly valid document structure if the selective nodes are determined to be weakly valid. 2. The method according to claim 1, further comprising determining whether a plurality of editing steps result in the weakly valid document structure. | 0.736842 |
9,171,079 | 10 | 11 | 10. A method comprising, by one or more computer systems: building a profile for an end user based on collectively learned preferences of the end user, the profile comprising a set of keywords and a weight assigned to each keyword in the set of keywords; receiving a translated query for sensor data associated with a specific sensor among a plurality of sensor data from a plurality of sensors, the plurality of sensor data being indexed according to a multi-dimensional array, one or more first ones of the dimensions comprising time and one or more second ones of the dimensions comprising one or more pre-determined sensor-data attributes, the translated query having been translated from an original query for particular sensor data, the translated query comprising an unique resource locator specifying the specific sensor of the plurality of sensors, the translated query comprising one or more values for one or more of the dimensions of the multi-dimensional array; generating one or more multi-dimensional-array filters based on the translated query; determining that the translated query is not accurate; modifying the translated query based on the profile for the end user to provide a more relevant response to the translated query; applying the one or more multi-dimensional-array filters to the plurality of sensor data as indexed to identify the sensor data associated with the specific sensor among a plurality of sensor data for a response to the modified translated query; accessing a cache of popular queries and their associated results; determining whether the received translated query matches one of the queries in the cache of popular queries; and in response to a determination that the received translated query matches one of the queries in the cache of popular queries, communicating the results associated with the matched query in the cache of popular queries to the query originator. | 10. A method comprising, by one or more computer systems: building a profile for an end user based on collectively learned preferences of the end user, the profile comprising a set of keywords and a weight assigned to each keyword in the set of keywords; receiving a translated query for sensor data associated with a specific sensor among a plurality of sensor data from a plurality of sensors, the plurality of sensor data being indexed according to a multi-dimensional array, one or more first ones of the dimensions comprising time and one or more second ones of the dimensions comprising one or more pre-determined sensor-data attributes, the translated query having been translated from an original query for particular sensor data, the translated query comprising an unique resource locator specifying the specific sensor of the plurality of sensors, the translated query comprising one or more values for one or more of the dimensions of the multi-dimensional array; generating one or more multi-dimensional-array filters based on the translated query; determining that the translated query is not accurate; modifying the translated query based on the profile for the end user to provide a more relevant response to the translated query; applying the one or more multi-dimensional-array filters to the plurality of sensor data as indexed to identify the sensor data associated with the specific sensor among a plurality of sensor data for a response to the modified translated query; accessing a cache of popular queries and their associated results; determining whether the received translated query matches one of the queries in the cache of popular queries; and in response to a determination that the received translated query matches one of the queries in the cache of popular queries, communicating the results associated with the matched query in the cache of popular queries to the query originator. 11. The method of claim 10 , wherein one or more of the multi-dimensional-array filters omits any sensor data below a ranking specified by the translated query. | 0.626168 |
9,383,977 | 1 | 2 | 1. A computer implemented method of generating a compiler description from an architecture description, comprising: extracting, by a compiler description generator, information from an architecture description describing an architecture of an application specific instruction set processor (ASIP); receiving, by the compiler description generator via a source different than the architecture description, definitions for a plurality of abstract elements of a compiler that have no direct representative in the architecture description, the abstract elements comprising a non-terminal representing a data path in common with a plurality of compiler instructions; extracting, by the compiler description generator, a mapping of compiler rules to instructions included in the architecture description; and automatically generating, by the compiler description generator, a compiler description of the compiler for the architecture of the ASIP based on the extracted information, the received definitions for the plurality of abstract elements, and the extracted mapping, wherein a compiler generator generates the compiler based on the compiler description. | 1. A computer implemented method of generating a compiler description from an architecture description, comprising: extracting, by a compiler description generator, information from an architecture description describing an architecture of an application specific instruction set processor (ASIP); receiving, by the compiler description generator via a source different than the architecture description, definitions for a plurality of abstract elements of a compiler that have no direct representative in the architecture description, the abstract elements comprising a non-terminal representing a data path in common with a plurality of compiler instructions; extracting, by the compiler description generator, a mapping of compiler rules to instructions included in the architecture description; and automatically generating, by the compiler description generator, a compiler description of the compiler for the architecture of the ASIP based on the extracted information, the received definitions for the plurality of abstract elements, and the extracted mapping, wherein a compiler generator generates the compiler based on the compiler description. 2. The method of claim 1 , wherein the source is a graphical user interface, the method further comprising: providing the graphical user interface for display to a user; and modifying the extracted information based on additional information provided by the user through the graphical user interface. | 0.62406 |
9,183,464 | 16 | 17 | 16. The face annotation system as recited in claim 15 , wherein the FRF module performs a selection of proper multiple MKL classifiers units and a fusion of multiple face identification results, wherein the proper multiple MKL classifier units are selected out of different personalized MKL classifier units belonging to all contacts of the current owner that are able to identify particular query face images within the collaborative face recognition framework. | 16. The face annotation system as recited in claim 15 , wherein the FRF module performs a selection of proper multiple MKL classifiers units and a fusion of multiple face identification results, wherein the proper multiple MKL classifier units are selected out of different personalized MKL classifier units belonging to all contacts of the current owner that are able to identify particular query face images within the collaborative face recognition framework. 17. The face annotation system as recited in claim 16 , wherein the FRF module performs the selection of proper multiple MKL classifiers units through a specific layer of constructed database in the pyramid database unit by using a temporal-group context from personal collections of the current owner. | 0.5 |
8,863,115 | 8 | 10 | 8. A computer program product for executing program code, the computer program product comprising a computer-readable storage medium including computer program code that comprises: a host language processor configured to execute program code in a host language by interpreting a line of program code in the host language as an operation in the host language; a domain specific language inset processor configured to execute program code in a domain specific language by performing operations including: selecting a domain specific language specification for domain specific language, the domain specific language specification including instructions written in the host language for executing the program code in the domain specific language by relating tokens that include strings of characters from the domain specific language to corresponding tokens that include strings of characters from the host language and relating at least one grammatical rule for operations on tokens from the domain specific language to at least one corresponding grammatical rule for operations on tokens from the host language, the domain specific language being different from the host language, and using the domain specific language specification to process the inset computer code; and a lexical analyzer configured to receive a source code file that contains includes computer code in the host language integrated with inset computer code in the domain specific language, the lexical analyzer being further configured to pass program code in the host language to the host language processor and pass inset computer code in the domain specific language to the domain specific language inset processor. | 8. A computer program product for executing program code, the computer program product comprising a computer-readable storage medium including computer program code that comprises: a host language processor configured to execute program code in a host language by interpreting a line of program code in the host language as an operation in the host language; a domain specific language inset processor configured to execute program code in a domain specific language by performing operations including: selecting a domain specific language specification for domain specific language, the domain specific language specification including instructions written in the host language for executing the program code in the domain specific language by relating tokens that include strings of characters from the domain specific language to corresponding tokens that include strings of characters from the host language and relating at least one grammatical rule for operations on tokens from the domain specific language to at least one corresponding grammatical rule for operations on tokens from the host language, the domain specific language being different from the host language, and using the domain specific language specification to process the inset computer code; and a lexical analyzer configured to receive a source code file that contains includes computer code in the host language integrated with inset computer code in the domain specific language, the lexical analyzer being further configured to pass program code in the host language to the host language processor and pass inset computer code in the domain specific language to the domain specific language inset processor. 10. The computer program product of claim 8 , wherein the domain specific language inset processor is configured to execute program code in a domain specific language by: passing the inset computer code to a domain specific language inset processor for execution thereby; and passing a binding context to the domain specific language inset processor for the execution of the inset computer code, the binding context describing a memory state of a computing system when the inset computer code is read, and the binding context including values of variables in the host language corresponding to executing the computer code in the host language. | 0.5 |
8,731,925 | 1 | 4 | 1. A computer system for enabling use of a single voice recognition engine for both command recognition and user speech enrollment, said computer system comprising: a user interface to receive speech input, the speech input comprising at least a portion of a phrase desired to be added to a voice-enrolled grammar; at least one processor; and a computer-readable medium encoded with at least one computer program for performing enrollment and recognition by applying speech input to a turn-based speech recognition engine in one turn that, when executed by the at least one processor, controls the computer system to: process the speech input during a speech recognition turn beginning at a first layer of an ordered stack of grammars, wherein the stack comprises a higher layer, the higher layer comprising an application grammar, a lower layer, the lower layer comprising the enrollment grammar; and a layer between the higher layer and the lower layer comprising a confusable grammar layer, and each layer in the stack includes an exit criterion; wherein the processing in one turn is progressively performed from the higher layer in the stack toward the lower layer in the stack, until a given layer in the stack is reached at which the exit criterion is met; in response to determining that the exit criterion for the given layer is satisfied, end the speech recognition turn, return a speech recognition result based upon the given layer, and ignore any lower layers of the ordered stack, wherein the processing comprises conditionally adding the at least a portion of the phrase to the voice-enrolled grammar based on the processing completing for the lower layer of the stack without satisfying an exit criterion for any layer of the stack for which processing was performed. | 1. A computer system for enabling use of a single voice recognition engine for both command recognition and user speech enrollment, said computer system comprising: a user interface to receive speech input, the speech input comprising at least a portion of a phrase desired to be added to a voice-enrolled grammar; at least one processor; and a computer-readable medium encoded with at least one computer program for performing enrollment and recognition by applying speech input to a turn-based speech recognition engine in one turn that, when executed by the at least one processor, controls the computer system to: process the speech input during a speech recognition turn beginning at a first layer of an ordered stack of grammars, wherein the stack comprises a higher layer, the higher layer comprising an application grammar, a lower layer, the lower layer comprising the enrollment grammar; and a layer between the higher layer and the lower layer comprising a confusable grammar layer, and each layer in the stack includes an exit criterion; wherein the processing in one turn is progressively performed from the higher layer in the stack toward the lower layer in the stack, until a given layer in the stack is reached at which the exit criterion is met; in response to determining that the exit criterion for the given layer is satisfied, end the speech recognition turn, return a speech recognition result based upon the given layer, and ignore any lower layers of the ordered stack, wherein the processing comprises conditionally adding the at least a portion of the phrase to the voice-enrolled grammar based on the processing completing for the lower layer of the stack without satisfying an exit criterion for any layer of the stack for which processing was performed. 4. The system of claim 1 , wherein the exit criterion for each layer is based upon comparing a recognition matching score against at least one of a confidence threshold, a clash threshold, a consistency threshold, and a quality threshold. | 0.585366 |
9,659,010 | 11 | 13 | 11. The computer program product of claim 8 , wherein program instructions to generate the second GUI display comprise: program instructions to generate alternative GUI displays with different languages, using substituted language strings from the second language bundle. | 11. The computer program product of claim 8 , wherein program instructions to generate the second GUI display comprise: program instructions to generate alternative GUI displays with different languages, using substituted language strings from the second language bundle. 13. The computer program product of claim 11 , wherein the alternative GUI displays are recreated on a non-visible area by reconstructing controls and setting the controls' attributes to build clones of the first GUI display, and wherein the non-visible area is a side, off-screen display. | 0.5 |
8,311,946 | 22 | 37 | 22. A computer-implemented method for purchasing information from a server, comprising: delivering, by a document server, to a user of said client logic device user-requested pages of a specific document in a first user-viewable version; protecting, by a security server, said first user-viewable version to permit said user viewing the actual contents of said pages of said specific document and selecting by said user, but not printing, copying, or saving by the user; calculating, by a transaction server, a charge to permit a requested standard operation to be performed on a user-selected portion of said specific document; and delivering, by said document server, to said user a second version of the actual contents of said specific document, said second version consisting of the user-selected portion of said specific document, said delivering step being performed in coordination with said security server upon authorization of payment of the calculated charge, said second version comprising a version on which the standard operation is performed. | 22. A computer-implemented method for purchasing information from a server, comprising: delivering, by a document server, to a user of said client logic device user-requested pages of a specific document in a first user-viewable version; protecting, by a security server, said first user-viewable version to permit said user viewing the actual contents of said pages of said specific document and selecting by said user, but not printing, copying, or saving by the user; calculating, by a transaction server, a charge to permit a requested standard operation to be performed on a user-selected portion of said specific document; and delivering, by said document server, to said user a second version of the actual contents of said specific document, said second version consisting of the user-selected portion of said specific document, said delivering step being performed in coordination with said security server upon authorization of payment of the calculated charge, said second version comprising a version on which the standard operation is performed. 37. The method of claim 22 , wherein delivering user-requested pages of said specific document further comprises: delivering user-requested text and images in the form of low resolution images of pages of text and images suitable for viewing and selecting. | 0.592357 |
8,078,543 | 15 | 16 | 15. A method, implemented at least in party by a computer system, of facilitating a closing of a real estate transaction, comprising: receiving real estate transaction information for the real estate transaction; wherein the real estate transaction information comprises information identifying a first party to the transaction; wherein the first party comprises a party obtaining a real estate loan from a lender at closing; wherein the real estate transaction information comprises information relating to a plurality of terms of the loan; storing the real estate transaction information in a memory in a virtual file; receiving a first user input that includes a search criterion; searching a plurality of the virtual files for the search criterion; outputting information of one or more virtual files satisfying the search criterion; receiving a second user input that comprises an update to one of the one or more virtual files; updating information in the one virtual file based on the second user input; preliminarily compiling one or more electronic documents with at least some of the real estate transaction information; presenting the one or more preliminarily compiled electronic documents to the first party; receiving an electronic signature indicating approval of at least one of the preliminarily compiled electronic documents; receiving a digital image of at least one ancillary document; and outputting electronic closing documents for the real estate transaction that comprise: said at least one ancillary document; and said preliminary compiled at least one electronic document with an electronic signature. | 15. A method, implemented at least in party by a computer system, of facilitating a closing of a real estate transaction, comprising: receiving real estate transaction information for the real estate transaction; wherein the real estate transaction information comprises information identifying a first party to the transaction; wherein the first party comprises a party obtaining a real estate loan from a lender at closing; wherein the real estate transaction information comprises information relating to a plurality of terms of the loan; storing the real estate transaction information in a memory in a virtual file; receiving a first user input that includes a search criterion; searching a plurality of the virtual files for the search criterion; outputting information of one or more virtual files satisfying the search criterion; receiving a second user input that comprises an update to one of the one or more virtual files; updating information in the one virtual file based on the second user input; preliminarily compiling one or more electronic documents with at least some of the real estate transaction information; presenting the one or more preliminarily compiled electronic documents to the first party; receiving an electronic signature indicating approval of at least one of the preliminarily compiled electronic documents; receiving a digital image of at least one ancillary document; and outputting electronic closing documents for the real estate transaction that comprise: said at least one ancillary document; and said preliminary compiled at least one electronic document with an electronic signature. 16. The method of claim 15 , wherein said preliminary compiled at least one electronic document comprises a negotiable financial instrument. | 0.5 |
8,978,989 | 2 | 12 | 2. The method according to claim 1 , further comprising fusing the input image and each of the calculated functions areas, the free cells, and the derived cells to form a readable matrix code. | 2. The method according to claim 1 , further comprising fusing the input image and each of the calculated functions areas, the free cells, and the derived cells to form a readable matrix code. 12. The method according to claim 2 , wherein said fusing comprises calculating pixels values for a group of pixels corresponding to a cell from the free cells or from the derived cells, such that a sub-group of the pixels is assigned with values which are visually similar according to a local visual similarity criterion to pixels from the input image which are associated with the cell, and the remaining pixels which are associated with the cell receive values which when read and processed by a reader device with the pixels in the sub-group, the cell is considered valid and is decoded to provide the decode input value associated with the cell. | 0.5 |
9,247,061 | 13 | 14 | 13. The non-transitory computer readable medium as defined in claim 12 , further comprising: instructions to send the two or more automatically generated answers for supervisor approval; and instructions to compute feedback performance on the two or more automatically generated answers. | 13. The non-transitory computer readable medium as defined in claim 12 , further comprising: instructions to send the two or more automatically generated answers for supervisor approval; and instructions to compute feedback performance on the two or more automatically generated answers. 14. The non-transitory computer readable medium as defined in claim 13 , wherein the analysis of the two or more automatically generated answers and the agent routing comprises: instructions to compute an answer success rate metric; instructions to determine a real-time trend comparison; instructions to analyze an agent usage measure; instructions to determine a classification goal match; instructions to determine a pronoun goal match; instructions to normalize the two or more automatically generated answers based on the analysis; and instructions to reorder the two or more automatically generated answers based on the normalization of the two or more automatically generated answers. | 0.5 |
9,087,130 | 3 | 4 | 3. The method of claim 2 , wherein the revised snippet is provided by: selecting a snippet piece to append to the snippet, determining that the snippet piece is to be appended to the snippet, and appending the snippet piece to the snippet. | 3. The method of claim 2 , wherein the revised snippet is provided by: selecting a snippet piece to append to the snippet, determining that the snippet piece is to be appended to the snippet, and appending the snippet piece to the snippet. 4. The method of claim 3 , wherein determining that the snippet piece is to be appended to the snippet is performed based on a similarity score that reflects a similarity between the snippet and the snippet piece. | 0.5 |
8,649,566 | 16 | 19 | 16. A printing system for detecting motion quality error of printed documents comprising: a print engine configured to print a document having text lines comprising a plurality of characters; a scanning device configured to scan the printed document and to generate a scanned image having the text lines and the characters; and a processor configured to: determine the orientation of the text lines in the scanned image with respect to a process direction of the printing system; detect positions in the process direction of the printing system of one of the text lines and the characters in the scanned image; determine position errors in the process direction in the printed document based on the detected process direction positions of one of the text lines and the characters in the scanned image and the determined orientation of the text lines; determine at least one motion quality error of the printing system in the process direction based on the determined process direction position errors; and initiate an activity associated with the printing system in response to a motion quality error having been determined. | 16. A printing system for detecting motion quality error of printed documents comprising: a print engine configured to print a document having text lines comprising a plurality of characters; a scanning device configured to scan the printed document and to generate a scanned image having the text lines and the characters; and a processor configured to: determine the orientation of the text lines in the scanned image with respect to a process direction of the printing system; detect positions in the process direction of the printing system of one of the text lines and the characters in the scanned image; determine position errors in the process direction in the printed document based on the detected process direction positions of one of the text lines and the characters in the scanned image and the determined orientation of the text lines; determine at least one motion quality error of the printing system in the process direction based on the determined process direction position errors; and initiate an activity associated with the printing system in response to a motion quality error having been determined. 19. The system according to claim 16 , wherein the processor is configured to segment the scanned image into individual text columns, if there are multiple text columns in the printed document. | 0.791577 |
8,719,026 | 11 | 20 | 11. A system for providing a natural language voice user interface, comprising: one or more physical processors programmed to execute one or more computer program instructions which, when executed, cause the one or more physical processors to: receive a natural language utterance from an input device associated with a navigation device, wherein the natural language utterance relates to navigation; determine a current location of the navigation device; select, from among a plurality of sets of location-specific grammar information, a set of location-specific grammar information based on proximity between the current location and a location associated with the set of location-specific grammar information; determine an amount of available resources for processing the natural language utterance; determine a size threshold for a recognition grammar based on the amount of available resources; generate the recognition grammar with the set of location-specific grammar information based on the size threshold such that a size of the recognition grammar does not exceed the size threshold; determine one or more interpretations of the natural language utterance based on the recognition grammar; determine, based on the one or more interpretations, a destination; and determine a route from the current location to the destination. | 11. A system for providing a natural language voice user interface, comprising: one or more physical processors programmed to execute one or more computer program instructions which, when executed, cause the one or more physical processors to: receive a natural language utterance from an input device associated with a navigation device, wherein the natural language utterance relates to navigation; determine a current location of the navigation device; select, from among a plurality of sets of location-specific grammar information, a set of location-specific grammar information based on proximity between the current location and a location associated with the set of location-specific grammar information; determine an amount of available resources for processing the natural language utterance; determine a size threshold for a recognition grammar based on the amount of available resources; generate the recognition grammar with the set of location-specific grammar information based on the size threshold such that a size of the recognition grammar does not exceed the size threshold; determine one or more interpretations of the natural language utterance based on the recognition grammar; determine, based on the one or more interpretations, a destination; and determine a route from the current location to the destination. 20. The system of claim 11 , wherein the one or more physical processors are further caused to: dynamically recalculate the route in response to a managed dialogue resolving the destination; and generate directions from the current location to the resolved destination to dynamically recalculate the route. | 0.720803 |
8,019,710 | 1 | 26 | 1. A system for guiding the progressive development and documentation of user thinking and knowledge about an inquiry based project according to exemplary approaches used by experts, comprising: An interface; A process manager system executable on at least one processor and operable to execute activities comprising: receiving user specification of an initial stage of understanding regarding an arbitrary problem or inquiry based project according to at least one of a plurality of entry or starting points; Providing at least one of an interactive workspace or a suggestion to a user, or both, to facilitate the further development of the understanding regarding an arbitrary problem or inquiry project towards a completion stage; Providing an integrated archetype based model of user understanding regarding the arbitrary problem or inquiry based project, in display or output or both. | 1. A system for guiding the progressive development and documentation of user thinking and knowledge about an inquiry based project according to exemplary approaches used by experts, comprising: An interface; A process manager system executable on at least one processor and operable to execute activities comprising: receiving user specification of an initial stage of understanding regarding an arbitrary problem or inquiry based project according to at least one of a plurality of entry or starting points; Providing at least one of an interactive workspace or a suggestion to a user, or both, to facilitate the further development of the understanding regarding an arbitrary problem or inquiry project towards a completion stage; Providing an integrated archetype based model of user understanding regarding the arbitrary problem or inquiry based project, in display or output or both. 26. The system of claim 1 further comprising that a user comprises an individual, multiple individuals, one or more teams or groups, or an electronic system or resource, or a combination thereof. | 0.893906 |
8,543,574 | 2 | 3 | 2. The method of claim 1 , comprising: updating the active set and the non-active set. | 2. The method of claim 1 , comprising: updating the active set and the non-active set. 3. The method of claim 2 , comprising: updating the geometric constraints to apply to the updated active set. | 0.5 |
8,676,581 | 9 | 10 | 9. An interactive entertainment system, comprising: a depth-sensing camera; a microphone array comprising a plurality of microphones; and a computing device comprising a processor and memory comprising instructions stored thereon that are executable by the processor to: receive speech recognition data as an output from a speech recognition stage of an audio processing pipeline, the speech recognition data comprising a recognized speech segment and confidence data comprising a recognition confidence value that represents a confidence in a certainty of a match of the recognized speech segment to a speech pattern; receive acoustic locational data as an output from a digital audio processing stage of the audio processing pipeline, the acoustic locational data related to a location of origin of the recognized speech segment as determined via signals from the microphone array; receive image data comprising visual locational information related to a location of each person located in a field of view of the depth-sensing camera; compare the acoustic locational data to the visual locational data to determine whether the recognized speech segment originated from a person in the field of view of an image sensor; and adjust the confidence data based upon whether the recognized speech segment is determined to have originated from a person in the field of view of the depth-sensing camera. | 9. An interactive entertainment system, comprising: a depth-sensing camera; a microphone array comprising a plurality of microphones; and a computing device comprising a processor and memory comprising instructions stored thereon that are executable by the processor to: receive speech recognition data as an output from a speech recognition stage of an audio processing pipeline, the speech recognition data comprising a recognized speech segment and confidence data comprising a recognition confidence value that represents a confidence in a certainty of a match of the recognized speech segment to a speech pattern; receive acoustic locational data as an output from a digital audio processing stage of the audio processing pipeline, the acoustic locational data related to a location of origin of the recognized speech segment as determined via signals from the microphone array; receive image data comprising visual locational information related to a location of each person located in a field of view of the depth-sensing camera; compare the acoustic locational data to the visual locational data to determine whether the recognized speech segment originated from a person in the field of view of an image sensor; and adjust the confidence data based upon whether the recognized speech segment is determined to have originated from a person in the field of view of the depth-sensing camera. 10. The interactive entertainment system of claim 9 , wherein the instructions are executable to adjust the confidence data by adjusting the recognition confidence value such that the recognition confidence value has a lower value after adjusting if the recognized speech segment is determined not to have originated from a person in the field of view of the depth-sensing camera than if the recognized speech segment is determined to have originated from a person in the field of view of the depth-sensing camera. | 0.5 |
8,396,710 | 11 | 19 | 11. A computer-readable medium having computer program logic recorded thereon, execution of which, by a computing device, causes the computing device to perform operations comprising: initiating a connection with a remote system upon detection, by a speech recognition operation of a local system, of a keyword in a speech input; storing a portion of the speech input into a local memory at the local system; transmitting the stored portion of the speech input from the local system to the remote system; and updating or modifying a set of recognizable keywords stored by the local system based on updates or modifications received from the remote system responsive to analysis of the stored portion of the speech input performed by a speech recognition operation of the remote system. | 11. A computer-readable medium having computer program logic recorded thereon, execution of which, by a computing device, causes the computing device to perform operations comprising: initiating a connection with a remote system upon detection, by a speech recognition operation of a local system, of a keyword in a speech input; storing a portion of the speech input into a local memory at the local system; transmitting the stored portion of the speech input from the local system to the remote system; and updating or modifying a set of recognizable keywords stored by the local system based on updates or modifications received from the remote system responsive to analysis of the stored portion of the speech input performed by a speech recognition operation of the remote system. 19. The computer-readable medium of claim 11 , wherein analysis of the stored portion of the speech input by the remote system comprises analysis of language usage or acoustic properties of a voice. | 0.622137 |
9,602,738 | 7 | 15 | 7. A video surveillance system comprising: at least a first video camera configured to capture at least a first video sequence including a plurality of video images; a processing system configured to automatically generate video image descriptive data based on the video images, and, based on the automatically generated video image descriptive data, to automatically detect events that involve at least one agent in the video sequence; a storage system configured to receive and store records of the automatically detected events and to associate each automatically detected event with a time at which the automatically detected event occurred and a geographical location where the automatically detected event occurred; a text generator configured to automatically generate a textual description of at least a first event of the automatically detected events, the textual description enhanced to include text that reflects the geographical location; a file generator configured to generate a file including the first video sequence and including embedded text that reflects the textual description and that is inserted in the video sequence based on the time; and a display system, wherein for each automatically detected event, and based on the textual description for the event, the display system is configured to display information for the event, the information including the text that reflects the geographical location, and to overlay the information on a map of a geographical area that includes the geographical location, such that the information for the event including the text that reflects the geographical location is visually associated with a particular location on the map. | 7. A video surveillance system comprising: at least a first video camera configured to capture at least a first video sequence including a plurality of video images; a processing system configured to automatically generate video image descriptive data based on the video images, and, based on the automatically generated video image descriptive data, to automatically detect events that involve at least one agent in the video sequence; a storage system configured to receive and store records of the automatically detected events and to associate each automatically detected event with a time at which the automatically detected event occurred and a geographical location where the automatically detected event occurred; a text generator configured to automatically generate a textual description of at least a first event of the automatically detected events, the textual description enhanced to include text that reflects the geographical location; a file generator configured to generate a file including the first video sequence and including embedded text that reflects the textual description and that is inserted in the video sequence based on the time; and a display system, wherein for each automatically detected event, and based on the textual description for the event, the display system is configured to display information for the event, the information including the text that reflects the geographical location, and to overlay the information on a map of a geographical area that includes the geographical location, such that the information for the event including the text that reflects the geographical location is visually associated with a particular location on the map. 15. The video surveillance method of claim 7 , further comprising: for at least the first event, automatically displaying on the map, separately from the textual description for the first event, an indication of a route taken, the route corresponding to the first event. | 0.583333 |
7,877,399 | 1 | 2 | 1. A method for comparing a source document with a target document, each document is capable of being parsed into a DOM (Document Object Model) tree, said method comprising the steps of: parsing the source document into a source DOM tree; parsing the target document into a target DOM tree; creating a source leaf path table from the source DOM tree; creating a target leaf path table from the target DOM tree, each of the tables containing leaf paths which comprise nodes; generating a comparison of the source document with the target document by identifying entries, within the target leaf path table, that exactly match entries in the source leaf path table, for each match found, labeling as exactly matched corresponding source and target leaf paths, and for only those leaf paths that have not been labeled as exactly matched, identifying whether or not schema matches exist between those leaf paths present in the source leaf path table and those leaf paths present in the target leaf path table; and outputting to a user the comparison of the documents. | 1. A method for comparing a source document with a target document, each document is capable of being parsed into a DOM (Document Object Model) tree, said method comprising the steps of: parsing the source document into a source DOM tree; parsing the target document into a target DOM tree; creating a source leaf path table from the source DOM tree; creating a target leaf path table from the target DOM tree, each of the tables containing leaf paths which comprise nodes; generating a comparison of the source document with the target document by identifying entries, within the target leaf path table, that exactly match entries in the source leaf path table, for each match found, labeling as exactly matched corresponding source and target leaf paths, and for only those leaf paths that have not been labeled as exactly matched, identifying whether or not schema matches exist between those leaf paths present in the source leaf path table and those leaf paths present in the target leaf path table; and outputting to a user the comparison of the documents. 2. The method of claim 1 , wherein said identifying comprises: creating, for each entry in the source leaf path table, a candidate target leaf path list of all entries in the target leaf path table having the same depth as a source leaf path table entry selected to be matched, and searching the candidate target leaf path list for leaf paths that exactly match the selected source leaf path entry. | 0.521635 |
9,396,267 | 1 | 4 | 1. A method for displaying a related content view, comprising: responsive to receiving a query through a search interface: obtaining a set of search results corresponding to the query; and displaying at least a portion of the set of search results within a main search engine results view of the search interface; obtaining a set of related content corresponding to at least one of the query or a search result within the set of search results, the set of related content comprising at least one of a link to an application, an image, a video, a coupon, a map direction or a map; and responsive to receiving a semantic zoom command associated with the main search engine results view, transitioning the search interface from the main search engine results view to a related content view comprising a first portion of the set of related content. | 1. A method for displaying a related content view, comprising: responsive to receiving a query through a search interface: obtaining a set of search results corresponding to the query; and displaying at least a portion of the set of search results within a main search engine results view of the search interface; obtaining a set of related content corresponding to at least one of the query or a search result within the set of search results, the set of related content comprising at least one of a link to an application, an image, a video, a coupon, a map direction or a map; and responsive to receiving a semantic zoom command associated with the main search engine results view, transitioning the search interface from the main search engine results view to a related content view comprising a first portion of the set of related content. 4. The method of claim 1 , the obtaining a set of related content comprising: obtaining the video. | 0.829268 |
9,436,678 | 1 | 7 | 1. A system comprising: a computer-readable memory storing executable instructions; and one or more processors in communication with the computer-readable memory, wherein the one or more processors are programmed by the executable instructions to at least: receive text corresponding to a request of a user; process the text in a first natural language understanding (“NLU”) module to generate a first interpretation of the text, and in a second NLU module to generate a second interpretation of the text, wherein the first NLU module is associated with a first domain, and the second NLU module is associated with a second domain, wherein the first interpretation is associated with a first score indicative of a confidence in the first interpretation, and wherein the second interpretation is associated with a second score indicative of a confidence in the second interpretation; select the first interpretation based at least partly on the first score and the second score; and generate a response based at least partly on the first interpretation. | 1. A system comprising: a computer-readable memory storing executable instructions; and one or more processors in communication with the computer-readable memory, wherein the one or more processors are programmed by the executable instructions to at least: receive text corresponding to a request of a user; process the text in a first natural language understanding (“NLU”) module to generate a first interpretation of the text, and in a second NLU module to generate a second interpretation of the text, wherein the first NLU module is associated with a first domain, and the second NLU module is associated with a second domain, wherein the first interpretation is associated with a first score indicative of a confidence in the first interpretation, and wherein the second interpretation is associated with a second score indicative of a confidence in the second interpretation; select the first interpretation based at least partly on the first score and the second score; and generate a response based at least partly on the first interpretation. 7. The system of claim 1 , wherein the executable instructions further program the one or more processors to rank the first interpretation and the second interpretation using the first score and the second score, wherein the first interpretation is ranked higher than the second interpretation, and wherein selecting the first interpretation comprises selecting a highest-ranked interpretation of the text. | 0.801175 |
4,697,209 | 82 | 83 | 82. The method recited in claim 72 wherein said first event is the elapse of a predetermined length of time after the occurence of the previous first event. | 82. The method recited in claim 72 wherein said first event is the elapse of a predetermined length of time after the occurence of the previous first event. 83. The method recited in claim 82 wherein said predetermined length of time is approximately 5 to 10 minutes. | 0.5 |
9,530,050 | 1 | 4 | 1. A method of annotating an unindexed document, comprising: receiving, by a computing device from a portable capture device, a first digital image depicting at least a first portion of the unindexed document, wherein the unindexed document is unknown to an index of stored documents; receiving, by the computing device, an annotation associated with the unindexed document from a first user of the portable capture device; extracting, by the computing device, features from the first digital image; storing, by the computing device, the first digital image, the extracted features, and the annotation as an annotated digital image; recognizing, by the computing device, a second user from the features of the first digital image, wherein the first digital image depicts at least the first portion of the unindexed document and the unindexed document is associated with the annotation from the first user; responsive to recognizing the second user from the features of the first digital image depicting at least the first portion of the unindexed document, creating a new tie between the first user and the second user in a network of users who have captured documents with similar features; and responsive to creating the new tie, making the annotated digital image available to the second user and sharing an identity of the second user with the first user; determining a first group of users, including the first user, who have operated on the unindexed document from users who have ties with the second user in the network; determining a second group of users who have not operated on the unindexed document from the users who have ties with the second user in the network; and weakening, by the computing device, the ties between the second user and the second group of users of the network based on the first group being larger than the second group. | 1. A method of annotating an unindexed document, comprising: receiving, by a computing device from a portable capture device, a first digital image depicting at least a first portion of the unindexed document, wherein the unindexed document is unknown to an index of stored documents; receiving, by the computing device, an annotation associated with the unindexed document from a first user of the portable capture device; extracting, by the computing device, features from the first digital image; storing, by the computing device, the first digital image, the extracted features, and the annotation as an annotated digital image; recognizing, by the computing device, a second user from the features of the first digital image, wherein the first digital image depicts at least the first portion of the unindexed document and the unindexed document is associated with the annotation from the first user; responsive to recognizing the second user from the features of the first digital image depicting at least the first portion of the unindexed document, creating a new tie between the first user and the second user in a network of users who have captured documents with similar features; and responsive to creating the new tie, making the annotated digital image available to the second user and sharing an identity of the second user with the first user; determining a first group of users, including the first user, who have operated on the unindexed document from users who have ties with the second user in the network; determining a second group of users who have not operated on the unindexed document from the users who have ties with the second user in the network; and weakening, by the computing device, the ties between the second user and the second group of users of the network based on the first group being larger than the second group. 4. The method of claim 1 , wherein the annotation is an interestingness score. | 0.936482 |
9,740,692 | 1 | 2 | 1. A method for creating a flexible structure description, the method comprising: receiving an image of a document of a particular document type that contains a table; receiving an entry describing an item in the table; searching for title elements based upon the entry; detecting data fields and anchor elements for the entry; generating, using a processor, a flexible structure description for the particular document type that includes a set of search elements for each data field in the image of the document and the title elements; matching the flexible structure description against the image; and extracting data from the image based upon the matching of the flexible structure description against the image. | 1. A method for creating a flexible structure description, the method comprising: receiving an image of a document of a particular document type that contains a table; receiving an entry describing an item in the table; searching for title elements based upon the entry; detecting data fields and anchor elements for the entry; generating, using a processor, a flexible structure description for the particular document type that includes a set of search elements for each data field in the image of the document and the title elements; matching the flexible structure description against the image; and extracting data from the image based upon the matching of the flexible structure description against the image. 2. The method of claim 1 , further comprising adjusting, using the processor, the flexible structure description based on user corrections of detected data fields, title elements, and/or anchor elements. | 0.690549 |
8,583,165 | 10 | 12 | 10. A mobile device that is communicatively coupled to a network, the mobile device comprising: at least one non-volatile memory having stored therein one or both of firmware and software; at least one processor operably coupled to the non-volatile memory, wherein the at least one processor, during operation, at least: displays to a user of the mobile device, a list of cartoons that are stored in at least one of a plurality of queues for the user, the listed cartoons having been identified for storage in the at least one of the plurality of queues according to metadata information of each cartoon and profile information for the user of the mobile device, wherein the metadata information comprises a category identifier; accepts from the user, a selection of a listed cartoon for viewing; receives at least one portion of the selected cartoon wherein the cartoon comprises a plurality of panels, wherein each panel comprises a graphics, a text, and an ordered set of audio clips; displays the panels of the at least one portion of a cartoon sequentially one panel at a time; accepts user input associated with the at least one portion of a cartoon; and selectively advances to a subsequent panel or reverts to a previous panel of the at least one portion of a cartoon, in response to the user input. | 10. A mobile device that is communicatively coupled to a network, the mobile device comprising: at least one non-volatile memory having stored therein one or both of firmware and software; at least one processor operably coupled to the non-volatile memory, wherein the at least one processor, during operation, at least: displays to a user of the mobile device, a list of cartoons that are stored in at least one of a plurality of queues for the user, the listed cartoons having been identified for storage in the at least one of the plurality of queues according to metadata information of each cartoon and profile information for the user of the mobile device, wherein the metadata information comprises a category identifier; accepts from the user, a selection of a listed cartoon for viewing; receives at least one portion of the selected cartoon wherein the cartoon comprises a plurality of panels, wherein each panel comprises a graphics, a text, and an ordered set of audio clips; displays the panels of the at least one portion of a cartoon sequentially one panel at a time; accepts user input associated with the at least one portion of a cartoon; and selectively advances to a subsequent panel or reverts to a previous panel of the at least one portion of a cartoon, in response to the user input. 12. The mobile device of claim 10 , further comprising: the at least one processor operably coupled to the non-volatile memory, wherein the at least one processor, during operation, further at least: for each panel of the plurality of panels of the cartoon, plays the ordered set of audio clips in a specified order, sequentially, one audio clip at a time. | 0.571084 |
8,467,713 | 7 | 8 | 7. The method of claim 1 , wherein the summary document includes a description of the partial list of people, animals, or creatures discussed in the story. | 7. The method of claim 1 , wherein the summary document includes a description of the partial list of people, animals, or creatures discussed in the story. 8. The method of claim 7 , wherein the partial list of people, animals, or creatures discussed in the story are organized by the relationships between them in the story. | 0.5 |
9,460,232 | 4 | 5 | 4. The method of claim 3 , wherein assigning weight values to nodes other than the set of leaf nodes further comprises: determining whether an expression represented by the node evaluates as false; and in response to determining the expression represented by the node evaluates as false, scoring each child node of the node as zero. | 4. The method of claim 3 , wherein assigning weight values to nodes other than the set of leaf nodes further comprises: determining whether an expression represented by the node evaluates as false; and in response to determining the expression represented by the node evaluates as false, scoring each child node of the node as zero. 5. The method of claim 4 , wherein determining the target object comprises selecting an object from the plurality of objects with a highest score. | 0.5 |
9,048,854 | 8 | 9 | 8. The method of claim 1 , further comprising: generating a first table and a second table based on plurality of single byte service calls to a four byte conversion routine, each of the service calls including a character set pair, the character set pair including a first character type and a second character type for a same character; utilizing the first table to determine if a conversion is supported based on the character set pair; adding a converted value for the character set pair to the second table if the conversion is supported; the first conversion service includes a first routine for converting characters; and the first routine uses the second table to determine a conversion value for the character. | 8. The method of claim 1 , further comprising: generating a first table and a second table based on plurality of single byte service calls to a four byte conversion routine, each of the service calls including a character set pair, the character set pair including a first character type and a second character type for a same character; utilizing the first table to determine if a conversion is supported based on the character set pair; adding a converted value for the character set pair to the second table if the conversion is supported; the first conversion service includes a first routine for converting characters; and the first routine uses the second table to determine a conversion value for the character. 9. The method of claim 8 , wherein each of the converted character set pairs is assigned a handle. | 0.5 |
7,571,184 | 1 | 6 | 1. A method for dynamically adjusting system features based on a schema, the method comprising: determining that a new resident schema associated with a function of a silicon IP design system is in a current view, the new resident schema being different than a previous resident schema associated with the current view and being associated with a silicon IP described in a hardware description language, wherein the new resident schema comprises an indication of inputs, outputs, functionality, and interface protocols of a silicon IP; analyzing components of the new resident schema by parsing and classifying schema components based on contents of an IP schema knowledge base comprising specifications for one or more silicon IPs each described in a hardware description language; parsing the current view based on the new resident schema to extract data from the current view to identify all elements and types to be changed in response to the new resident schema; and generating a new view by mapping the extracted data to the new resident schema, the new view comprising viewable data associated with the function of the design system by initializing and configuring the new view based on the new resident schema, calling regeneration and integrity checking functions for the new view, and instantiating the new view. | 1. A method for dynamically adjusting system features based on a schema, the method comprising: determining that a new resident schema associated with a function of a silicon IP design system is in a current view, the new resident schema being different than a previous resident schema associated with the current view and being associated with a silicon IP described in a hardware description language, wherein the new resident schema comprises an indication of inputs, outputs, functionality, and interface protocols of a silicon IP; analyzing components of the new resident schema by parsing and classifying schema components based on contents of an IP schema knowledge base comprising specifications for one or more silicon IPs each described in a hardware description language; parsing the current view based on the new resident schema to extract data from the current view to identify all elements and types to be changed in response to the new resident schema; and generating a new view by mapping the extracted data to the new resident schema, the new view comprising viewable data associated with the function of the design system by initializing and configuring the new view based on the new resident schema, calling regeneration and integrity checking functions for the new view, and instantiating the new view. 6. The method of claim 1 , wherein the function of the silicon IP design system is one or more of a submit IP function, an IP search function, an IP qualify function, an IP quality standard function, or a vendor evaluation function. | 0.5 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.