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,090,157 | 1 | 8 | 1. A computer implemented eye detection system for detecting eyes in a digital image, the system comprising: a digital image capture device; and a processor, the processor including: a filter; a first eye candidate selector connected to the filter; a first profile validator connected to the eye candidate selector, the first profile validator including measurements of eye candidate pupil contours; a first eye candidate eliminator connected to the first profile validator and the first eye candidate selector; a second eye candidate selector connected to the first profile validator; a pair validator connected to the second eye candidate selector, the pair validator including a space measurer that determines if the first and second eye candidates are at an appropriate distance from each other; a second profile validator connected to the pair validator; and a second eye candidate eliminator connected to the second profile validator and the second eye candidate selector; wherein the first profile validator comprising a first profiler connected to the first eye candidate selector, and a first profile evaluator connected to the first profiler, the first eye candidate eliminator and the second eye candidate selector; wherein the second profile validator comprises a second profiler connected to the pair validator, and a second profile evaluator connected to the second profiler and the second eye candidate eliminator; wherein the first profiler comprises: a pupil region extractor connected to the first eye candidate selector; an adaptive thresholder connected to the pupil region extractor; a contours finder connected to the adaptive thresholder; a contour picker connected to the contours finder; a curve fitter connected to the contour picker; and a curve selector connected to the curve fitter and the first profile evaluator; and wherein the second profiler comprises: a pupil region extractor connected to the pair validator; an adaptive thresholder connected to the pupil region extractor; a contours finder connected to the adaptive thresholder; a contour picker connected to the contours finder; a curve fitter connected to the contour picker; and a curve selector connected to the curve fitter and the second profile evaluator. | 1. A computer implemented eye detection system for detecting eyes in a digital image, the system comprising: a digital image capture device; and a processor, the processor including: a filter; a first eye candidate selector connected to the filter; a first profile validator connected to the eye candidate selector, the first profile validator including measurements of eye candidate pupil contours; a first eye candidate eliminator connected to the first profile validator and the first eye candidate selector; a second eye candidate selector connected to the first profile validator; a pair validator connected to the second eye candidate selector, the pair validator including a space measurer that determines if the first and second eye candidates are at an appropriate distance from each other; a second profile validator connected to the pair validator; and a second eye candidate eliminator connected to the second profile validator and the second eye candidate selector; wherein the first profile validator comprising a first profiler connected to the first eye candidate selector, and a first profile evaluator connected to the first profiler, the first eye candidate eliminator and the second eye candidate selector; wherein the second profile validator comprises a second profiler connected to the pair validator, and a second profile evaluator connected to the second profiler and the second eye candidate eliminator; wherein the first profiler comprises: a pupil region extractor connected to the first eye candidate selector; an adaptive thresholder connected to the pupil region extractor; a contours finder connected to the adaptive thresholder; a contour picker connected to the contours finder; a curve fitter connected to the contour picker; and a curve selector connected to the curve fitter and the first profile evaluator; and wherein the second profiler comprises: a pupil region extractor connected to the pair validator; an adaptive thresholder connected to the pupil region extractor; a contours finder connected to the adaptive thresholder; a contour picker connected to the contours finder; a curve fitter connected to the contour picker; and a curve selector connected to the curve fitter and the second profile evaluator. 8. The system of claim 1 , wherein the pair validator comprises: a range indicator connected to the space measurer and the second profile validator. | 0.8816 |
10,154,144 | 1 | 5 | 1. An adjustable interactive voice response (IVR) system, comprising: one or more servers programmed to execute an IVR adjustment module programmed to: receive from a user a search term corresponding to a verbal phrase recognizable in the IVR system, the received search term provided by the user via a graphical user interface displayed on an electronic device accessed by the user, the graphical user interface configured to provide the user with access to files within the IVR system and allow the user to edit IVR system properties; transmit to the electronic device a listing of audio files and options files corresponding to the verbal phrase recognizable in the IVR system, wherein the listing corresponding to the verbal phrase recognizable in the IVR system is rendered on the graphical user interface; edit an IVR properties file in response to user input received via the graphical user interface; and modify an IVR system flow to correspond to the edited IVR properties file. | 1. An adjustable interactive voice response (IVR) system, comprising: one or more servers programmed to execute an IVR adjustment module programmed to: receive from a user a search term corresponding to a verbal phrase recognizable in the IVR system, the received search term provided by the user via a graphical user interface displayed on an electronic device accessed by the user, the graphical user interface configured to provide the user with access to files within the IVR system and allow the user to edit IVR system properties; transmit to the electronic device a listing of audio files and options files corresponding to the verbal phrase recognizable in the IVR system, wherein the listing corresponding to the verbal phrase recognizable in the IVR system is rendered on the graphical user interface; edit an IVR properties file in response to user input received via the graphical user interface; and modify an IVR system flow to correspond to the edited IVR properties file. 5. The system of claim 1 , wherein the graphical user interface is a web-based tool configured to implement the edited IVR properties file in a test environment. | 0.761834 |
9,911,413 | 2 | 3 | 2. A method for configuring a natural language (NL) understanding system, the NL understanding system including at least a linguistic classifier, the linguistic classifier being configurable with configuration data to distinguish a plurality of linguistic categories based on a linguistic input, the method comprising: configuring the linguistic classifier with first configuration data; processing a second plurality of user inputs to the system, wherein the processing includes, for each of the second plurality of user inputs, using the linguistic classifier configured with the first configuration data to determine a recognized linguistic category corresponding to said input, and causing determination of a corresponding response to the input based on the recognized linguistic category; storing second collected data, the second collected data comprising, for each of the second plurality of user inputs, a representation of the user input and the corresponding responses; receiving annotations for the second collected data, an annotation for each item of the second collected data indicating whether the corresponding response is consistent with the user input; determining second configuration data for the first linguistic classifier, the second configuration data being determined to distinguish the plurality of linguistic categories by computing the second configuration data to match the second annotated data; and configuring the linguistic classifier with the second configuration data. | 2. A method for configuring a natural language (NL) understanding system, the NL understanding system including at least a linguistic classifier, the linguistic classifier being configurable with configuration data to distinguish a plurality of linguistic categories based on a linguistic input, the method comprising: configuring the linguistic classifier with first configuration data; processing a second plurality of user inputs to the system, wherein the processing includes, for each of the second plurality of user inputs, using the linguistic classifier configured with the first configuration data to determine a recognized linguistic category corresponding to said input, and causing determination of a corresponding response to the input based on the recognized linguistic category; storing second collected data, the second collected data comprising, for each of the second plurality of user inputs, a representation of the user input and the corresponding responses; receiving annotations for the second collected data, an annotation for each item of the second collected data indicating whether the corresponding response is consistent with the user input; determining second configuration data for the first linguistic classifier, the second configuration data being determined to distinguish the plurality of linguistic categories by computing the second configuration data to match the second annotated data; and configuring the linguistic classifier with the second configuration data. 3. The method of claim 2 wherein the linguistic classifier comprises an intent classifier, and the linguistic categories comprise user intents. | 0.863289 |
9,241,223 | 31 | 32 | 31. The directional filter of claim 29 , where the instructions for determining the one or more directional indicator values include instructions for determining one or more first directional indicator values from at least two of the respective audible signal data components, the one or more first directional indicator values are representative of a degree of similarity between the respective audible signal data components. | 31. The directional filter of claim 29 , where the instructions for determining the one or more directional indicator values include instructions for determining one or more first directional indicator values from at least two of the respective audible signal data components, the one or more first directional indicator values are representative of a degree of similarity between the respective audible signal data components. 32. The directional filter of claim 31 , where the instructions for determining the one or more directional indicator values include instructions for determining one or more second directional indicator values from the at least two of the respective audible signal data components used to determine the first directional indicator value, the one or more second directional indicator values are representative of a level difference between the respective audible signal data components. | 0.5 |
8,312,032 | 3 | 4 | 3. The method of claim 1 , wherein the first language is one language of a predefined set of two languages and the second language is the other language of the predefined set of two languages. | 3. The method of claim 1 , wherein the first language is one language of a predefined set of two languages and the second language is the other language of the predefined set of two languages. 4. The method of claim 3 , wherein the predefined set of two languages is selected by a search requestor at the client device. | 0.5 |
8,838,015 | 1 | 5 | 1. A method, comprising: receiving data associated with a characteristic of a plurality of students from an educational delivery system; selecting automatically a control group of students from the plurality of students and an experimental group of students from the plurality of students based on the data such that a value of the characteristic associated with each student from the control group of students is substantially identical to a value of the characteristic associated with each student from the experimental group of students; delivering, from a delivery engine implemented in at least one of a memory or a processing device, a first educational material to the control group of students, the first educational material including a first content associated with a plurality of learning objectives, which is arranged to define at least a first learning path; and delivering a second educational material to the experimental group of students, the second educational material including a second content associated with the plurality of learning objectives, which is arranged to define at least a second learning path. | 1. A method, comprising: receiving data associated with a characteristic of a plurality of students from an educational delivery system; selecting automatically a control group of students from the plurality of students and an experimental group of students from the plurality of students based on the data such that a value of the characteristic associated with each student from the control group of students is substantially identical to a value of the characteristic associated with each student from the experimental group of students; delivering, from a delivery engine implemented in at least one of a memory or a processing device, a first educational material to the control group of students, the first educational material including a first content associated with a plurality of learning objectives, which is arranged to define at least a first learning path; and delivering a second educational material to the experimental group of students, the second educational material including a second content associated with the plurality of learning objectives, which is arranged to define at least a second learning path. 5. The method of claim 1 , wherein the delivering the first educational material is performed as a part of delivering a larger educational material to the plurality of students. | 0.847938 |
9,715,553 | 4 | 7 | 4. The method of claim 1 , further comprising: determining the predetermined distance based on a density of points of interest in an area including the current location. | 4. The method of claim 1 , further comprising: determining the predetermined distance based on a density of points of interest in an area including the current location. 7. The method of claim 4 , wherein the predetermined distance is a radial distance from the current location and is further determined based on a desired number of points of interest to be retrieved. | 0.5 |
8,769,454 | 1 | 7 | 1. A method for register-transfer level (RTL) design checking for exploring simulation mismatches, synthesis mismatches, or ambiguous language semantics associated with generating a derived design from RTL design code, the method comprising: providing the RTL design code, to at least one processor, to generate an internal representation for verification of an electronic circuit design; comparing, by a design match engine, the RTL design code with design violation patterns contained in a design violation pattern database, wherein the design violation patterns identify violations relating to the simulation mismatches, synthesis mismatches, or ambiguous language semantics associated with generating the derived design that are otherwise undetected during equivalence checking between the derived design and the RTL design code; assigning a rule object to a design pattern in the RTL design code, by the at least one processor, when the design match engine determines that the design pattern in the RTL design code matches one of the design violation patterns in the design violation pattern database; and generating, with the at least one processor, a violation report comprising the rule objects and their corresponding design violation patterns. | 1. A method for register-transfer level (RTL) design checking for exploring simulation mismatches, synthesis mismatches, or ambiguous language semantics associated with generating a derived design from RTL design code, the method comprising: providing the RTL design code, to at least one processor, to generate an internal representation for verification of an electronic circuit design; comparing, by a design match engine, the RTL design code with design violation patterns contained in a design violation pattern database, wherein the design violation patterns identify violations relating to the simulation mismatches, synthesis mismatches, or ambiguous language semantics associated with generating the derived design that are otherwise undetected during equivalence checking between the derived design and the RTL design code; assigning a rule object to a design pattern in the RTL design code, by the at least one processor, when the design match engine determines that the design pattern in the RTL design code matches one of the design violation patterns in the design violation pattern database; and generating, with the at least one processor, a violation report comprising the rule objects and their corresponding design violation patterns. 7. The method of claim 1 , wherein the method further comprises, selecting one of the rule objects in the violation report, and graphically displaying on a display at least a portion the design code in a module containing the RTL design code corresponding to the selected rule object and hi-lighting the RTL design code corresponding to the selected rule object. | 0.672101 |
9,104,707 | 16 | 17 | 16. A method for grouping semantically related data stored in a database management system, the method comprising: constructing a first association between a first value extracted from a set of items and a first column name selected from a set of textual values that are ontologically related to at least one value from the set of items, the set of items comprising a key and one or more values associated with the key; selecting the first value for association with a different column name based at least in part on a semantic fit quality for the first value; constructing a second association between the first value and a second column name selected by traversing a graph representative of ontological relationships between the second column name and one or more additional column names; and determining that a utilization quality for the first column name is less than a utilization quality corresponding to the second column name. | 16. A method for grouping semantically related data stored in a database management system, the method comprising: constructing a first association between a first value extracted from a set of items and a first column name selected from a set of textual values that are ontologically related to at least one value from the set of items, the set of items comprising a key and one or more values associated with the key; selecting the first value for association with a different column name based at least in part on a semantic fit quality for the first value; constructing a second association between the first value and a second column name selected by traversing a graph representative of ontological relationships between the second column name and one or more additional column names; and determining that a utilization quality for the first column name is less than a utilization quality corresponding to the second column name. 17. The method of claim 16 , wherein the traversing the graph comprises a directed random walk based at least in part on edge weightings. | 0.791159 |
9,971,834 | 8 | 13 | 8. A recommendation method for search input, comprising: A: acquiring a search keyword according to a user input; B: querying a search tree storage unit according to the search keyword to acquire address information of recommended word(s); wherein the search tree storage unit is configured to store Chinese characters in a tree data structure, wherein each node in the tree stores one Chinese character and the address information of the recommended word(s) containing the Chinese character; C: querying a recommended word database according to the address information of the recommended word(s) to acquire the recommended word(s) and then suggesting the recommended word(s) to the user, wherein the recommended word database is configured to store the recommended word(s); wherein the user input is Pinyin input or Chinese character(s) input; wherein when the user input is the Chinese character(s) input, the step A further comprises: A1: receiving Chinese character(s) input by the user and using the input Chinese character(s) directly as a search keyword; the step B further comprises: B1: querying the search tree storage unit to find address information of primary recommended word(s) with the input Chinese character(s) as a prefix at a node corresponding to the last character of the input Chinese character(s); wherein, after the step B1, the method also comprises: B2: judging whether the number of corresponding primary recommended word(s) is bigger than or equal to a preset threshold value according to the address information of the primary recommended word(s); and if yes, executing the step C; otherwise, querying the recommended word database based on the address information of the primary recommended word(s) to acquire the primary recommended word(s) and executing a step B3; B3: extending the primary recommended word(s) to acquire address information of the extended recommended word(s). | 8. A recommendation method for search input, comprising: A: acquiring a search keyword according to a user input; B: querying a search tree storage unit according to the search keyword to acquire address information of recommended word(s); wherein the search tree storage unit is configured to store Chinese characters in a tree data structure, wherein each node in the tree stores one Chinese character and the address information of the recommended word(s) containing the Chinese character; C: querying a recommended word database according to the address information of the recommended word(s) to acquire the recommended word(s) and then suggesting the recommended word(s) to the user, wherein the recommended word database is configured to store the recommended word(s); wherein the user input is Pinyin input or Chinese character(s) input; wherein when the user input is the Chinese character(s) input, the step A further comprises: A1: receiving Chinese character(s) input by the user and using the input Chinese character(s) directly as a search keyword; the step B further comprises: B1: querying the search tree storage unit to find address information of primary recommended word(s) with the input Chinese character(s) as a prefix at a node corresponding to the last character of the input Chinese character(s); wherein, after the step B1, the method also comprises: B2: judging whether the number of corresponding primary recommended word(s) is bigger than or equal to a preset threshold value according to the address information of the primary recommended word(s); and if yes, executing the step C; otherwise, querying the recommended word database based on the address information of the primary recommended word(s) to acquire the primary recommended word(s) and executing a step B3; B3: extending the primary recommended word(s) to acquire address information of the extended recommended word(s). 13. The method according to claim 8 , wherein a combination of Pinyin is used to correspond to Chinese phrases containing polyphone in the recommended word database. | 0.881466 |
9,037,531 | 16 | 17 | 16. The system of claim 14 , wherein the recommendation module is further configured to: identify the preferences of the particular user; and generate the user preference profile information identifying the preferences of the particular user. | 16. The system of claim 14 , wherein the recommendation module is further configured to: identify the preferences of the particular user; and generate the user preference profile information identifying the preferences of the particular user. 17. The system of claim 16 , wherein the preferences of the particular user are identified based on previous search result selections of the particular user. | 0.532738 |
9,947,311 | 15 | 19 | 15. A non-transitory computer-readable medium comprising instructions which, when executed by at least one processor, cause the at least one processor to perform a method comprising: receiving, from a user, a string of characters; determining components of the string of characters, wherein the components of the string of characters comprise one or more graphemes that are related in the string of characters; determining universal phonetic representations for the components of the string of characters; determining pronunciations for the universal phonetic representations; constructing a pronunciation of the string of characters based at least partially on the pronunciations of the universal phonetic representations; sending, to the user, a sound file representing the pronunciation of the string of characters; receiving a user sound file created by the user using a microphone, the user sound file representing a custom pronunciation associated with a subset of the universal phonetic representations corresponding to a portion of the pronunciation of the string of characters; constructing a new pronunciation of the string of characters based at least partially on the pronunciations for the universal phonetic representations and the custom pronunciation associated with the subset of the universal phonetic representations; and sending, to the user, a new sound file representing the new pronunciation of the string of characters, wherein the new sound file comprises a combination of a portion of the sound file representing the pronunciation of the string of characters and the user sound file. | 15. A non-transitory computer-readable medium comprising instructions which, when executed by at least one processor, cause the at least one processor to perform a method comprising: receiving, from a user, a string of characters; determining components of the string of characters, wherein the components of the string of characters comprise one or more graphemes that are related in the string of characters; determining universal phonetic representations for the components of the string of characters; determining pronunciations for the universal phonetic representations; constructing a pronunciation of the string of characters based at least partially on the pronunciations of the universal phonetic representations; sending, to the user, a sound file representing the pronunciation of the string of characters; receiving a user sound file created by the user using a microphone, the user sound file representing a custom pronunciation associated with a subset of the universal phonetic representations corresponding to a portion of the pronunciation of the string of characters; constructing a new pronunciation of the string of characters based at least partially on the pronunciations for the universal phonetic representations and the custom pronunciation associated with the subset of the universal phonetic representations; and sending, to the user, a new sound file representing the new pronunciation of the string of characters, wherein the new sound file comprises a combination of a portion of the sound file representing the pronunciation of the string of characters and the user sound file. 19. The non-transitory computer-readable medium of claim 15 , wherein the string of characters corresponds to a domain name. | 0.917443 |
8,484,377 | 13 | 16 | 13. A processing system for prepending nonce labels to DNS queries the system, comprising: at least one processor; and a nonce label analyzer module associated with the at least one processor, the nonce label analyzer module being configured: to determine whether a predetermined time duration has expired, to evaluate whether a log contains at least one nonce label prepended domain name resolution query for a full domain name that resulted in a non-referral response, if it is determined that the predetermined time duration has expired, to determine whether the log contains at least one nonce-less domain name resolution query for the full domain name that resulted in a response providing information sought by the query, if it is determined that the log contains the at least one nonce label prepended domain name resolution query resulting in the non-referral response, and to flag the full domain name as being exempt from nonce label prepending, if it is determined that the log contains the at least one nonce-less domain name resolution query resulting in a response providing information sought by the query. | 13. A processing system for prepending nonce labels to DNS queries the system, comprising: at least one processor; and a nonce label analyzer module associated with the at least one processor, the nonce label analyzer module being configured: to determine whether a predetermined time duration has expired, to evaluate whether a log contains at least one nonce label prepended domain name resolution query for a full domain name that resulted in a non-referral response, if it is determined that the predetermined time duration has expired, to determine whether the log contains at least one nonce-less domain name resolution query for the full domain name that resulted in a response providing information sought by the query, if it is determined that the log contains the at least one nonce label prepended domain name resolution query resulting in the non-referral response, and to flag the full domain name as being exempt from nonce label prepending, if it is determined that the log contains the at least one nonce-less domain name resolution query resulting in a response providing information sought by the query. 16. The processing system of claim 13 , wherein the full domain name is flagged as exempt from nonce label prepending via an entry in a configuration file. | 0.716117 |
8,413,069 | 11 | 13 | 11. A device for facilitating selection of textual characters, comprising: a user input, wherein a number of letters or character shapes are available for selection by a user; a memory, wherein said memory contains a table of characters; and a processor, wherein, in response to a selection of at least first and second character shapes, said processor executes instructions to perform a look up in said table in said memory to select a first set of characters, and wherein, in response to a selection of a subtraction mode by a user after the selection of the first character shape and prior to the selection of the second character shape, each character included in said first set of characters contains said first character shape and not said second character shape. | 11. A device for facilitating selection of textual characters, comprising: a user input, wherein a number of letters or character shapes are available for selection by a user; a memory, wherein said memory contains a table of characters; and a processor, wherein, in response to a selection of at least first and second character shapes, said processor executes instructions to perform a look up in said table in said memory to select a first set of characters, and wherein, in response to a selection of a subtraction mode by a user after the selection of the first character shape and prior to the selection of the second character shape, each character included in said first set of characters contains said first character shape and not said second character shape. 13. The device of claim 11 , further comprising: a communication interface, wherein a selected character may be transmitted to a recipient device. | 0.708 |
9,384,738 | 1 | 6 | 1. A computer-implemented method comprising: receiving, for each of multiple utterances of a hotword, a data set including at least (i) a speaker verification confidence score associated with the utterance, and (ii) environmental context data associated with the utterance; selecting from among the data sets, a subset of the data sets that are associated with a particular environmental context; selecting a particular data set from among the subset of data sets based on one or more selection criteria; selecting, as a speaker verification threshold for the particular environmental context, the speaker verification confidence score included in the particular data set; and providing, for output to a speaker verification system, the speaker verification threshold for use in performing speaker verification of utterances that are associated with the particular environmental context. | 1. A computer-implemented method comprising: receiving, for each of multiple utterances of a hotword, a data set including at least (i) a speaker verification confidence score associated with the utterance, and (ii) environmental context data associated with the utterance; selecting from among the data sets, a subset of the data sets that are associated with a particular environmental context; selecting a particular data set from among the subset of data sets based on one or more selection criteria; selecting, as a speaker verification threshold for the particular environmental context, the speaker verification confidence score included in the particular data set; and providing, for output to a speaker verification system, the speaker verification threshold for use in performing speaker verification of utterances that are associated with the particular environmental context. 6. The method of claim 1 , comprising: labeling the data sets with a post trigger accuracy indicator associated with the utterance. | 0.924102 |
8,566,787 | 15 | 18 | 15. The method of claim 14 , wherein the step of generating prescriptions further comprises the step of generating architectural prescriptions for removing architectural defects from software system. | 15. The method of claim 14 , wherein the step of generating prescriptions further comprises the step of generating architectural prescriptions for removing architectural defects from software system. 18. The method of claim 15 , wherein the step of generating architectural prescriptions for removing architectural defect comprises the steps of: i. selecting an architectural defect from a source code file; ii. determining whether the architectural defect is a back call defect; iii. applying break cycle strategy, if the architectural defect is not a back call defect; iv. determining whether called function belongs to a called module, if architectural defect is a back call defect; v. applying break dependency strategy, if the called function does not belongs to called module; vi. applying split module strategy, if the called function belongs to called module; and vii. generating and filtering all prescriptions for back call defect. | 0.5 |
7,966,311 | 9 | 11 | 9. A method for complex procedural query execution, the method comprising: a. executing an entire complex procedural query defined using a general-purpose functional programming language, detecting a soft failure, indicative that the execution of the query resulted in incomplete information, and noting any unresolved data which the query needs but does not have; b. identifying sub-queries to be executed separately; c. referring unresolved data needs to at least one database adaptor; d. storing resulting responses in a query cache for a future execution; and e. iteratively executing (a), (b), (c), and (d) using the resulting responses until no more soft failures occur, wherein the complex procedural query is severable such that at least a first portion of the complex procedural query can proceed even if a second portion of the complex procedural query fails. | 9. A method for complex procedural query execution, the method comprising: a. executing an entire complex procedural query defined using a general-purpose functional programming language, detecting a soft failure, indicative that the execution of the query resulted in incomplete information, and noting any unresolved data which the query needs but does not have; b. identifying sub-queries to be executed separately; c. referring unresolved data needs to at least one database adaptor; d. storing resulting responses in a query cache for a future execution; and e. iteratively executing (a), (b), (c), and (d) using the resulting responses until no more soft failures occur, wherein the complex procedural query is severable such that at least a first portion of the complex procedural query can proceed even if a second portion of the complex procedural query fails. 11. The method of claim 9 wherein the query language is maximally severable. | 0.871186 |
7,739,116 | 6 | 11 | 6. A method of causing a computer to combine a processing of a document having a plurality of pages with a processing of speech generated with reference to the document, comprising the steps of: receiving presentation text and its attributes from the document; storing the presentation text and the attributes on a page-by-page basis, wherein said attributes comprise a title, character size, character underlining, or boldface character; decomposing the presentation text into words; storing the words in a word attribute database; extracting the words and their attributes from the word attribute database; accessing a keyword database; extracting the keywords that are common in the document; assigns weight to the keywords depending on a number of times the keyword appeared as the voice in the presentation and their attributes; recognizing the speech in the presentation in consultation with a dictionary database by: acquiring correspondence between a lapse of time from a start of the presentation and a result of speech recognition every moment, storing a correspondence between the time and the result of speech recognition in a subtitle database; accessing a page-time database that records a time that the page is turned and a time when the next page is turned, and calculates the weight of the keywords in the page based on a duration during which the page in question is displayed in the presentation; specifying the page corresponding to the result of voice recognition on the basis of the time information; wherein the computer determines, among subtitles obtained by recognizing the speech, a specific subtitle obtained by recognizing speech generated with reference to a specific page of the document by: deriving a correspondence between the time and the result of speech recognition from the subtitle database, and displaying it on a subtitle candidate display region; and causing keywords stored in the keyword database, presentation text stored in the text attribute database, and a master subtitle stored in a master subtitle database to cooperate together for display; and generating speaker notes from subtitles stored in the subtitle database. | 6. A method of causing a computer to combine a processing of a document having a plurality of pages with a processing of speech generated with reference to the document, comprising the steps of: receiving presentation text and its attributes from the document; storing the presentation text and the attributes on a page-by-page basis, wherein said attributes comprise a title, character size, character underlining, or boldface character; decomposing the presentation text into words; storing the words in a word attribute database; extracting the words and their attributes from the word attribute database; accessing a keyword database; extracting the keywords that are common in the document; assigns weight to the keywords depending on a number of times the keyword appeared as the voice in the presentation and their attributes; recognizing the speech in the presentation in consultation with a dictionary database by: acquiring correspondence between a lapse of time from a start of the presentation and a result of speech recognition every moment, storing a correspondence between the time and the result of speech recognition in a subtitle database; accessing a page-time database that records a time that the page is turned and a time when the next page is turned, and calculates the weight of the keywords in the page based on a duration during which the page in question is displayed in the presentation; specifying the page corresponding to the result of voice recognition on the basis of the time information; wherein the computer determines, among subtitles obtained by recognizing the speech, a specific subtitle obtained by recognizing speech generated with reference to a specific page of the document by: deriving a correspondence between the time and the result of speech recognition from the subtitle database, and displaying it on a subtitle candidate display region; and causing keywords stored in the keyword database, presentation text stored in the text attribute database, and a master subtitle stored in a master subtitle database to cooperate together for display; and generating speaker notes from subtitles stored in the subtitle database. 11. The method according to claim 6 , further comprising the step of causing the computer to retrieve character strings, with a retrieval target range extended from the specific subtitle to text data contained in the specific page. | 0.5 |
8,713,054 | 65 | 86 | 65. A system to assist an information security classification process of an organization for security classification and marking of an electronic document, said system comprising at least one computer system, where said at least one computer system comprising at least one electronic storage medium, where said at least one electronic storage medium comprising at least one software engine, where said at least one software engine comprising: a. establish an electronic document security regimen comprising at least one criterion of an information security classification process, b. display a user classification dialogue for at least one informational portion of an electronic document, where said user classification dialogue comprising a menu of choices, where said menu of choices comprising at least one element for selection, and where said at least one element is associated with said at least one criterion of said electronic document security regimen, c. retrieve said at least one element, where said at least one element is selected, d. establish a classification mark from said at least one criterion associated with the retrieved said at least one element, and e. insert said classification mark into said electronic document. | 65. A system to assist an information security classification process of an organization for security classification and marking of an electronic document, said system comprising at least one computer system, where said at least one computer system comprising at least one electronic storage medium, where said at least one electronic storage medium comprising at least one software engine, where said at least one software engine comprising: a. establish an electronic document security regimen comprising at least one criterion of an information security classification process, b. display a user classification dialogue for at least one informational portion of an electronic document, where said user classification dialogue comprising a menu of choices, where said menu of choices comprising at least one element for selection, and where said at least one element is associated with said at least one criterion of said electronic document security regimen, c. retrieve said at least one element, where said at least one element is selected, d. establish a classification mark from said at least one criterion associated with the retrieved said at least one element, and e. insert said classification mark into said electronic document. 86. The system of claim 65 , wherein said electronic document security regimen further comprising at least one classification guidance document registered in said electronic document security regimen, and wherein said at least one software engine further comprising display said classification guidance document to a user of said computer system. | 0.659449 |
4,866,646 | 19 | 25 | 19. A handheld data input apparatus comprising: a pressure-sensitive tablet; a coordinate detector for receiving a signal output from said tablet and outputting coordinate data corresponding to a pressed position on a detection surface of said tablet; a character processing means for extracting predetermined character data from time-serial coordinate data output from said coordinate detector; a document memory for sequentially storing the character data extracted by said character processing means; selection means for selecting the character data stored in said document memory or coordinate data from said coordinate detector; an interface means for outputting the character data or the coordinate data selected by said selection means to a host apparatus connected to said handheld data input apparatus; and a casing integrally incorporating said tablet, said coordinate detector, said character processing means, said document memory, said selection means, and said interface means. | 19. A handheld data input apparatus comprising: a pressure-sensitive tablet; a coordinate detector for receiving a signal output from said tablet and outputting coordinate data corresponding to a pressed position on a detection surface of said tablet; a character processing means for extracting predetermined character data from time-serial coordinate data output from said coordinate detector; a document memory for sequentially storing the character data extracted by said character processing means; selection means for selecting the character data stored in said document memory or coordinate data from said coordinate detector; an interface means for outputting the character data or the coordinate data selected by said selection means to a host apparatus connected to said handheld data input apparatus; and a casing integrally incorporating said tablet, said coordinate detector, said character processing means, said document memory, said selection means, and said interface means. 25. An apparatus according to claim 19, wherein item-setting means for instructing at least insertion, deletion, correction being arranged on a given position of the detection surface of said tablet. | 0.723611 |
9,953,438 | 2 | 4 | 2. The method of claim 1 , wherein said annotation position is determined by a plurality of methods. | 2. The method of claim 1 , wherein said annotation position is determined by a plurality of methods. 4. The method of claim 2 , wherein different precisions of positioning of said annotations are associated with each of said plurality of methods, and wherein a computation of said annotation position is based on the most precise of said plurality of methods. | 0.652291 |
8,316,296 | 15 | 17 | 15. A computer readable storage medium comprising computer executable instructions that when executed via a processor perform a method, the method comprising: obtaining a set of phrases for presentation as a function of one or more characters entered into a character entry field, at least one phrase within the set of phrases comprising more than one term; pinning one or more terms, but fewer than all terms, of a presented phrase, from the set of phrases, the pinned terms inserted into the character entry field; and temporarily replacing one or more pinned terms in the character entry field, but fewer than all pinned terms, with a placeholder when a second set of phrases, obtained based at least in part upon the pinned terms, comprises fewer than a desired number of phrases. | 15. A computer readable storage medium comprising computer executable instructions that when executed via a processor perform a method, the method comprising: obtaining a set of phrases for presentation as a function of one or more characters entered into a character entry field, at least one phrase within the set of phrases comprising more than one term; pinning one or more terms, but fewer than all terms, of a presented phrase, from the set of phrases, the pinned terms inserted into the character entry field; and temporarily replacing one or more pinned terms in the character entry field, but fewer than all pinned terms, with a placeholder when a second set of phrases, obtained based at least in part upon the pinned terms, comprises fewer than a desired number of phrases. 17. The computer readable storage medium of claim 15 , the second set of phrases comprising phrases comprising at least one of the pinned terms. | 0.736264 |
9,031,828 | 6 | 7 | 6. The method of claim 1 , further comprising flagging a portion of the initial message to not be translated. | 6. The method of claim 1 , further comprising flagging a portion of the initial message to not be translated. 7. The method of claim 6 , wherein the portion flagged comprises a proper noun, a common noun, a diminutive, an abbreviation, or an acronym. | 0.5 |
6,016,499 | 28 | 40 | 28. The system of claim 24, further comprising a NetWare Core Protocol API, also known as the NCP API, wherein the driver is also capable of translating a relational database language statement into an executable NCP API sequence that includes a call to a callable element of the NCP API and produces an NCP API result, and the driver is also capable of translating the NCP API result into a relational database result. | 28. The system of claim 24, further comprising a NetWare Core Protocol API, also known as the NCP API, wherein the driver is also capable of translating a relational database language statement into an executable NCP API sequence that includes a call to a callable element of the NCP API and produces an NCP API result, and the driver is also capable of translating the NCP API result into a relational database result. 40. The system of claim 28, wherein the directory services repository includes a Novell Directory Services repository and the API includes a Novell Directory Services API. | 0.780206 |
9,128,723 | 8 | 10 | 8. A system for dynamic Document Object Model (DOM) aware code editing comprising: at least one processor; and at least one non-transitory computer-readable storage medium storing instructions thereon that, when executed by the at least one processor, cause the system to: store, in a DOM model, a plurality of elements in one or more HyperText Markup Language (HTML) files of a project; identify, prior to code execution and in the DOM model at least one modification to the DOM elements that results from the invocation of one or more JavaScript files for the project, wherein during JavaScript code editing, the at least one modification to the DOM is based on an interaction between the JavaScript code and the DOM elements; and access, prior to code execution, the DOM model to perform at least one of code completion or code refactoring. | 8. A system for dynamic Document Object Model (DOM) aware code editing comprising: at least one processor; and at least one non-transitory computer-readable storage medium storing instructions thereon that, when executed by the at least one processor, cause the system to: store, in a DOM model, a plurality of elements in one or more HyperText Markup Language (HTML) files of a project; identify, prior to code execution and in the DOM model at least one modification to the DOM elements that results from the invocation of one or more JavaScript files for the project, wherein during JavaScript code editing, the at least one modification to the DOM is based on an interaction between the JavaScript code and the DOM elements; and access, prior to code execution, the DOM model to perform at least one of code completion or code refactoring. 10. The system of claim 8 , wherein the at least one modification to the DOM elements is at least one of an addition or modification to an attribute of a DOM element, a function call, or an addition or removal of a DOM element, and wherein the at least one modification to the DOM elements comprises a line number where the at least one modification is made. | 0.5 |
7,831,580 | 11 | 15 | 11. A computer readable storage medium containing instructions in computer readable form for carrying out a process for promoting information and knowledge sharing among the users registered to a computer network, the process comprising: (a) receiving a first user's request; (b) causing a search of searching-a local knowledge object comprising local, accessible knowledge objects associated with the first user; (c) causing a search of a central knowledge object repository comprising and all contributed knowledge objects associated with other users; (d) returning to the first user a list of links for all matching local and contributed knowledge objects, said matching local and contributed knowledge objects being marked either local or published or listed; (e) allowing access to said matching local and contributed knowledge objects if the first user chooses a knowledge object marked local or published; (f) forwarding the first user's request to a second user and prompting the second user for authorization of access if the first user chooses a knowledge object marked listed from the list, the second user having control of access to the knowledge object marked listed object; (g) allowing access by the first user to the chosen listed knowledge object if the second user allows access; (h) notifying the first user if the second user declines access to the listed knowledge object. | 11. A computer readable storage medium containing instructions in computer readable form for carrying out a process for promoting information and knowledge sharing among the users registered to a computer network, the process comprising: (a) receiving a first user's request; (b) causing a search of searching-a local knowledge object comprising local, accessible knowledge objects associated with the first user; (c) causing a search of a central knowledge object repository comprising and all contributed knowledge objects associated with other users; (d) returning to the first user a list of links for all matching local and contributed knowledge objects, said matching local and contributed knowledge objects being marked either local or published or listed; (e) allowing access to said matching local and contributed knowledge objects if the first user chooses a knowledge object marked local or published; (f) forwarding the first user's request to a second user and prompting the second user for authorization of access if the first user chooses a knowledge object marked listed from the list, the second user having control of access to the knowledge object marked listed object; (g) allowing access by the first user to the chosen listed knowledge object if the second user allows access; (h) notifying the first user if the second user declines access to the listed knowledge object. 15. The computer readable storage medium of claim 11 , wherein the step (e) further comprises the step of: prompting the first user to enter a correct user identification. | 0.673664 |
8,707,161 | 11 | 14 | 11. A computer-implemented method comprising: receiving object code obtained by compiling C++ code, wherein the C++ code is generated from a server side script code specified using personal home page (PHP) syntax and implements functionality of the server side script code, the generated C++ code comprising: one or more C++ classes comprising code corresponding to the server side script code, one or more C++ header files storing information describing structures of the C++ classes, and code for memory allocation of objects instantiated from the C++ classes; receiving a request identifying a markup language document including the server side script code; and responsive to the request, executing instructions in the object code corresponding to the server side script code. | 11. A computer-implemented method comprising: receiving object code obtained by compiling C++ code, wherein the C++ code is generated from a server side script code specified using personal home page (PHP) syntax and implements functionality of the server side script code, the generated C++ code comprising: one or more C++ classes comprising code corresponding to the server side script code, one or more C++ header files storing information describing structures of the C++ classes, and code for memory allocation of objects instantiated from the C++ classes; receiving a request identifying a markup language document including the server side script code; and responsive to the request, executing instructions in the object code corresponding to the server side script code. 14. The computer-implemented method of claim 11 , wherein the generated C++ code comprises a global variables class comprising definitions of global variables, each global variable corresponding to a server side script global variable. | 0.690789 |
9,355,272 | 11 | 14 | 11. A method of operation of a computing system comprising: determining a sharing for representing a scenario surrounding sharing of a content; determine a user's past sharing selection for the sharing context, wherein the user's past sharing selection is for representing prior sharing of previous information similar to the content or associated with same instance of the sharing context; calculate a personalization degree for representing a match between a current personalization setting and the sharing context; generating with a control unit a sharing option for the sharing context based on a default set for the sharing context, the user's past sharing selection for the sharing context, and the personalization degree for the sharing context; and estimating a user's privacy preference based on the sharing option. | 11. A method of operation of a computing system comprising: determining a sharing for representing a scenario surrounding sharing of a content; determine a user's past sharing selection for the sharing context, wherein the user's past sharing selection is for representing prior sharing of previous information similar to the content or associated with same instance of the sharing context; calculate a personalization degree for representing a match between a current personalization setting and the sharing context; generating with a control unit a sharing option for the sharing context based on a default set for the sharing context, the user's past sharing selection for the sharing context, and the personalization degree for the sharing context; and estimating a user's privacy preference based on the sharing option. 14. The method as claimed in claim 11 wherein: determining the sharing context includes detecting a context change for the sharing context; and further comprising: changing the default set for the context change. | 0.832013 |
9,027,134 | 1 | 3 | 1. A method comprising: scanning data that is maintained on multiple social networks, wherein scanning comprises identifying, by one or more processors, data that is associated with a social entity; determining one or more characteristics of the identified data; generating, for each of the one or more characteristics, a reference to the identified data that indicates the characteristic; algorithmically comparing one or more generated references to one or more known references, wherein the one or more known references are references to characteristics of identified data that have been assigned a level of risk, and wherein the one or more generated references that are compared to the one or more known references are dynamically selected from a group of generated references; determining, based on the algorithmic comparisons, a risk score for a social entity; and determining, based on a statistical algorithm, a confidence score for the risk score, wherein the confidence score indicates the reliability of the determined risk score. | 1. A method comprising: scanning data that is maintained on multiple social networks, wherein scanning comprises identifying, by one or more processors, data that is associated with a social entity; determining one or more characteristics of the identified data; generating, for each of the one or more characteristics, a reference to the identified data that indicates the characteristic; algorithmically comparing one or more generated references to one or more known references, wherein the one or more known references are references to characteristics of identified data that have been assigned a level of risk, and wherein the one or more generated references that are compared to the one or more known references are dynamically selected from a group of generated references; determining, based on the algorithmic comparisons, a risk score for a social entity; and determining, based on a statistical algorithm, a confidence score for the risk score, wherein the confidence score indicates the reliability of the determined risk score. 3. The method of claim 1 , wherein the one or more known references against which a generated reference is compared correlate to the generated reference. | 0.944079 |
7,725,830 | 11 | 12 | 11. The system of claim 1 , wherein a candidate location is identified from the manual user indications. | 11. The system of claim 1 , wherein a candidate location is identified from the manual user indications. 12. The system of claim 11 , wherein the candidate location is one of a plurality of predefined regions to which the manual user indications are directed most during a latter half of the verbal narration. | 0.5 |
9,602,444 | 13 | 14 | 13. The method of claim 12 , further comprising: when the internal structure of the respective conversation indicates a strong connection between the respective user and the first user for a subset of the conversation, the counted occurrences of terms in the subset of the conversation are given greater weight than a predefined normal weight. | 13. The method of claim 12 , further comprising: when the internal structure of the respective conversation indicates a strong connection between the respective user and the first user for a subset of the conversation, the counted occurrences of terms in the subset of the conversation are given greater weight than a predefined normal weight. 14. The method of claim 13 , wherein: the respective user represents a contact of the first user; and the internal structure of the respective conversation indicates a strong connection between the contact and the first user for a subset of the conversation when the subset of the conversation includes one or more of: a contribution by the contact to a subset of the respective conversation that was created by the first user, a contribution by the first user to a subset of the respective conversation created by the contact, and a subset of the conversation that was concurrently edited by the first user and the contact. | 0.5 |
9,753,839 | 1 | 2 | 1. A method for evaluating one or more test scripts used testing aspects target system, comprising: receiving, via a communications interface, a test script and a plurality of requirements for the test script wherein the plurality of requirements facilitate evaluation of the test script and are in pre-determined format; developing a set of protocol evaluators based on the plurality of requirements, wherein the set of protocol evaluators comprises a business requirements evaluator, a validation language requirements evaluator, a template evaluator, a completeness evaluator, and a descriptiveness evaluator, wherein each protocol evaluator of the set of protocol evaluators contains one or more factors; storing the developed set of protocol evaluators in a computer readable memory; executing each protocol evaluator with a protocol evaluation engine, wherein: execution of the business requirements evaluator controls the protocol evaluator to determine whether the test script tests specified business requirements, execution of the language requirements evaluator controls the protocol evaluator to determine whether the test script is written in a specified language, execution of the template evaluator controls the protocol evaluator to determine whether the test script is prepared using a specified template, execution of the completeness evaluator controls the protocol evaluator to determine whether the test script meets completeness requirements, and execution of the descriptiveness evaluator controls the protocol evaluator to determine whether the test script meets descriptiveness requirements, wherein execution of each protocol evaluator with the protocol evaluation engine the further comprises assigning an initial score to the test script; for each protocol evaluator: comparing the one or more factors of the protocol evaluator with the test script to thereby determine whether the test script deviates with at least one of the one or more factors of the protocol evaluator, and in response assigning a deviation thereto; determining a deductible points for each deviation according to a pre-determined rule up to a maximum deductible points; subtracting the deductible points from the initial score for the test script to thereby obtain a final score; and generating a group score for a plurality of test scripts based on a pre-determined category and the final score of the plurality of test scripts for identifying a tester for the test script based on the group score. | 1. A method for evaluating one or more test scripts used testing aspects target system, comprising: receiving, via a communications interface, a test script and a plurality of requirements for the test script wherein the plurality of requirements facilitate evaluation of the test script and are in pre-determined format; developing a set of protocol evaluators based on the plurality of requirements, wherein the set of protocol evaluators comprises a business requirements evaluator, a validation language requirements evaluator, a template evaluator, a completeness evaluator, and a descriptiveness evaluator, wherein each protocol evaluator of the set of protocol evaluators contains one or more factors; storing the developed set of protocol evaluators in a computer readable memory; executing each protocol evaluator with a protocol evaluation engine, wherein: execution of the business requirements evaluator controls the protocol evaluator to determine whether the test script tests specified business requirements, execution of the language requirements evaluator controls the protocol evaluator to determine whether the test script is written in a specified language, execution of the template evaluator controls the protocol evaluator to determine whether the test script is prepared using a specified template, execution of the completeness evaluator controls the protocol evaluator to determine whether the test script meets completeness requirements, and execution of the descriptiveness evaluator controls the protocol evaluator to determine whether the test script meets descriptiveness requirements, wherein execution of each protocol evaluator with the protocol evaluation engine the further comprises assigning an initial score to the test script; for each protocol evaluator: comparing the one or more factors of the protocol evaluator with the test script to thereby determine whether the test script deviates with at least one of the one or more factors of the protocol evaluator, and in response assigning a deviation thereto; determining a deductible points for each deviation according to a pre-determined rule up to a maximum deductible points; subtracting the deductible points from the initial score for the test script to thereby obtain a final score; and generating a group score for a plurality of test scripts based on a pre-determined category and the final score of the plurality of test scripts for identifying a tester for the test script based on the group score. 2. The method of claim 1 , wherein for a predetermined subset of deviations, the corresponding deductible points comprises the initial score as the deductible points for the deviation such that upon subtracting the deductible points from the initial score, a zero point score is allocated as the final score and the evaluating is terminated. | 0.5 |
9,076,347 | 1 | 19 | 1. A system for identifying a mispronounced phrase spoken by a user of a non-native language, comprising: a curriculum program module comprising a plurality of tracks, each track corresponding to a selected set phrases; a speech recognition system that analyzes an utterance spoken by the user, the utterance corresponding to a phrase of the track, the speech recognition system returning a ranked list of two or more recognized phrases; a pronunciation analysis module that: compares each of the ranked list of two or more recognized phrases to a series of mispronunciations corresponding to the selected phrase; matches one of the ranked list of two or more recognized phrases to a mispronunciation; and identifies guidance to correct the matched mispronunciation based upon the match of the one of the ranked list of two or more recognized phrases to a mispronunciation; and a human-machine interface that enables the user to select a curriculum, track a phrase, prompts the user to speak the utterance; and displays to the user the guidance identified by the pronunciation analysis module. | 1. A system for identifying a mispronounced phrase spoken by a user of a non-native language, comprising: a curriculum program module comprising a plurality of tracks, each track corresponding to a selected set phrases; a speech recognition system that analyzes an utterance spoken by the user, the utterance corresponding to a phrase of the track, the speech recognition system returning a ranked list of two or more recognized phrases; a pronunciation analysis module that: compares each of the ranked list of two or more recognized phrases to a series of mispronunciations corresponding to the selected phrase; matches one of the ranked list of two or more recognized phrases to a mispronunciation; and identifies guidance to correct the matched mispronunciation based upon the match of the one of the ranked list of two or more recognized phrases to a mispronunciation; and a human-machine interface that enables the user to select a curriculum, track a phrase, prompts the user to speak the utterance; and displays to the user the guidance identified by the pronunciation analysis module. 19. The system of claim 1 , wherein the pronunciation analysis module further configured to filter one or more phrases from the ranked list of two or more recognized phrases based upon a confidence level threshold. | 0.746445 |
8,996,473 | 1 | 8 | 1. A computer-implemented method for evaluating a validity of an extended status and action management (SAM) schema, the method being executed using one or more processors and comprising: receiving, by the one or more processors, the extended SAM schema, the extended SAM schema being stored as a computer-readable document in memory and being an extension of a core SAM schema; providing, by the one or more processors, one or more goals, each goal representing an intention of the core SAM schema, the one or more goals being provided in a computer-readable document stored in memory and comprising one or more primary goals and one or more recovery goals that each express an intention of a process underlying the core SAM schema, each primary goal being an end goal that is preserved in the extended SAM schema and each recovery goal being an acceptable intermediate goal that is replaceable in the extended SAM schema; providing an extended finite state machine (FSM) based on the extended SAM schema, the extended FSM representing states of the extended SAM schema and transitions between states, the extended FSM being provided as a computer-readable document and being stored in memory, wherein processing further comprises processing the extended FSM; and processing, by the one or more processors, the one or more goals using a computer-executable model checking tool for evaluating the validity of the extended SAM schema, wherein the extended SAM schema is determined to be valid, if at least one of the one or more primary goals or at least one of the one or more recovery goals is achieved for each of the core SAM schema and the extended SAM schema. | 1. A computer-implemented method for evaluating a validity of an extended status and action management (SAM) schema, the method being executed using one or more processors and comprising: receiving, by the one or more processors, the extended SAM schema, the extended SAM schema being stored as a computer-readable document in memory and being an extension of a core SAM schema; providing, by the one or more processors, one or more goals, each goal representing an intention of the core SAM schema, the one or more goals being provided in a computer-readable document stored in memory and comprising one or more primary goals and one or more recovery goals that each express an intention of a process underlying the core SAM schema, each primary goal being an end goal that is preserved in the extended SAM schema and each recovery goal being an acceptable intermediate goal that is replaceable in the extended SAM schema; providing an extended finite state machine (FSM) based on the extended SAM schema, the extended FSM representing states of the extended SAM schema and transitions between states, the extended FSM being provided as a computer-readable document and being stored in memory, wherein processing further comprises processing the extended FSM; and processing, by the one or more processors, the one or more goals using a computer-executable model checking tool for evaluating the validity of the extended SAM schema, wherein the extended SAM schema is determined to be valid, if at least one of the one or more primary goals or at least one of the one or more recovery goals is achieved for each of the core SAM schema and the extended SAM schema. 8. The method of claim 1 , wherein each transition is associated with an action that can be performed to change a status vector. | 0.762963 |
5,576,755 | 26 | 34 | 26. A process for automatically verifying the integrity of a database of program schedule information for an electronic television program guide comprising: providing a database of television program listings data to a data processor, said database comprising data fields for program titles, program start times, and program run times for a plurality of television stations, selecting a station from said plurality of stations for verification of one or more of said data fields for said selected station; selecting a time range for said verification of said one or more data fields; automatically analyzing said data fields for said selected station in said database for at least one of schedule gaps and schedule overlaps, listing said schedule gaps and/or schedule overlaps, and editing said database to correct said gaps and/or overlaps. | 26. A process for automatically verifying the integrity of a database of program schedule information for an electronic television program guide comprising: providing a database of television program listings data to a data processor, said database comprising data fields for program titles, program start times, and program run times for a plurality of television stations, selecting a station from said plurality of stations for verification of one or more of said data fields for said selected station; selecting a time range for said verification of said one or more data fields; automatically analyzing said data fields for said selected station in said database for at least one of schedule gaps and schedule overlaps, listing said schedule gaps and/or schedule overlaps, and editing said database to correct said gaps and/or overlaps. 34. The process of claim 26 further comprising listing the start time and end of said schedule gaps and/or overlaps. | 0.89913 |
9,928,244 | 1 | 5 | 1. A method comprising: analyzing an electronic document to generate document identifying data; classifying the electronic document in one or more display categories by applying a classification rule to the document identifying data, wherein the classification of the electronic document represents a prioritization of the electronic document; displaying the classified electronic document in the one of the one or more display categories in which it was classified; receiving a user feedback regarding prioritization of the electronic document; and updating the classification rule based on the feedback from the user, wherein analyzing the electronic document further comprises analyzing the document using semantical analysis of the document comprising, associating one or more concepts with one or more display categories, extracting the one or more concepts from the electronic document, and pattern matching the one or more extracted concepts with the one or more concepts associated with the one or more display categories. | 1. A method comprising: analyzing an electronic document to generate document identifying data; classifying the electronic document in one or more display categories by applying a classification rule to the document identifying data, wherein the classification of the electronic document represents a prioritization of the electronic document; displaying the classified electronic document in the one of the one or more display categories in which it was classified; receiving a user feedback regarding prioritization of the electronic document; and updating the classification rule based on the feedback from the user, wherein analyzing the electronic document further comprises analyzing the document using semantical analysis of the document comprising, associating one or more concepts with one or more display categories, extracting the one or more concepts from the electronic document, and pattern matching the one or more extracted concepts with the one or more concepts associated with the one or more display categories. 5. The method of claim 1 , wherein the user feedback is an override of the classification based on the classification rule. | 0.845477 |
8,615,070 | 15 | 16 | 15. The computer system of claim 11 , wherein the computer is located at a web site, wherein the user machine is separated from the web site by a web network, and wherein the method further comprises: said computer detecting an attempt by the user machine to access the web site via the web network, wherein said prompting is in response to said detecting. | 15. The computer system of claim 11 , wherein the computer is located at a web site, wherein the user machine is separated from the web site by a web network, and wherein the method further comprises: said computer detecting an attempt by the user machine to access the web site via the web network, wherein said prompting is in response to said detecting. 16. The computer system of claim 15 , wherein the method further comprises: after said storing the flag, said computer ascertaining, from the stored flag, the selected language usage pattern preference; after said ascertaining, said computer modifying text content to be presented to the user, said modifying comprising applying grammatical rules to the ascertained language usage pattern preference; and said computer providing the modified text content to the user computer for presentation to the user. | 0.5 |
7,880,730 | 22 | 52 | 22. A text entry system, comprising: (a) a reduced user input device comprising an auto-correcting keyboard region comprising a plurality of character set members, wherein locations having known coordinates in the auto-correcting keyboard region are associated with corresponding character set members, each location having associated therewith a plurality of said character set members of said alphabet such that contact with one of said locations is ambiguous as to which character set member associated with the location is intended, wherein each time a user contacts the user input device within the auto-correcting keyboard region, a location associated with the user contact is determined and the determined contact location is added to a current input sequence of contact locations; (b) a memory containing a plurality of objects, wherein each object is a string of one or a plurality of character set members; (c) an output device with a text display area; and (d) a processor coupled to the user input device, memory, and output device, said processor comprising: (i) a distance value calculation component which, for each determined contact location in the input sequence of contacts, calculates a set of distance values between the contact locations and the known coordinate locations corresponding to one or a plurality of character set members within the auto-correcting keyboard region; (ii) an object evaluation component which, for each generated input sequence, identifies at least one candidate object in memory, and for each of the at least one identified candidate objects, evaluates each identified candidate object by calculating a matching metric based on the calculated distance values associated with the object, and ranks evaluated candidate objects based on the calculated matching metric values; and (iii) a selection component for identifying at least one candidate object according to an evaluated ranking, presenting the at least one identified object to the user, and enabling the user to select one of the at least one presented objects for output to the text display area on the output device. | 22. A text entry system, comprising: (a) a reduced user input device comprising an auto-correcting keyboard region comprising a plurality of character set members, wherein locations having known coordinates in the auto-correcting keyboard region are associated with corresponding character set members, each location having associated therewith a plurality of said character set members of said alphabet such that contact with one of said locations is ambiguous as to which character set member associated with the location is intended, wherein each time a user contacts the user input device within the auto-correcting keyboard region, a location associated with the user contact is determined and the determined contact location is added to a current input sequence of contact locations; (b) a memory containing a plurality of objects, wherein each object is a string of one or a plurality of character set members; (c) an output device with a text display area; and (d) a processor coupled to the user input device, memory, and output device, said processor comprising: (i) a distance value calculation component which, for each determined contact location in the input sequence of contacts, calculates a set of distance values between the contact locations and the known coordinate locations corresponding to one or a plurality of character set members within the auto-correcting keyboard region; (ii) an object evaluation component which, for each generated input sequence, identifies at least one candidate object in memory, and for each of the at least one identified candidate objects, evaluates each identified candidate object by calculating a matching metric based on the calculated distance values associated with the object, and ranks evaluated candidate objects based on the calculated matching metric values; and (iii) a selection component for identifying at least one candidate object according to an evaluated ranking, presenting the at least one identified object to the user, and enabling the user to select one of the at least one presented objects for output to the text display area on the output device. 52. The system of claim 22 , further comprising: means for dynamically changing character set member locations or sub-regions within the auto-correcting keyboard region. | 0.820975 |
8,954,463 | 4 | 7 | 4. The computer program product according to claim 3 , wherein said computer readable program code is further configured to determine n-grams of search queries from previous browsing sessions. | 4. The computer program product according to claim 3 , wherein said computer readable program code is further configured to determine n-grams of search queries from previous browsing sessions. 7. The computer program product according to claim 4 , wherein said computer readable program code is further configured to assign confidence scores to the n-grams. | 0.623853 |
10,057,317 | 9 | 10 | 9. In controlling video data transmitted from a source device, a sink device comprising: an interface unit configured to communicate with the source device by Wi-Fi Direct; a receiving unit configured to receive a voice signal from a remote controller that is wirelessly connected to the sink device; a display unit; and a controller configured to: output the video data received from the source device through the network interface unit to the display unit, recognize a text from a screen corresponding to the video data outputted to the display unit, save the recognized text to a memory to correspond to location information on the screen corresponding to the video data, convert the voice signal received through the voice signal receiving unit into a text using a speech-to-text (STT) function at the sink device, and if a specific text including at least one portion of the converted text exists in the recognized text, send a message corresponding to a user input of selecting the specific text from the screen corresponding to the video data to the source device through the network interface unit via a user input back channel (UIBC), wherein the UIBC is not configured to transmit the voice signal. | 9. In controlling video data transmitted from a source device, a sink device comprising: an interface unit configured to communicate with the source device by Wi-Fi Direct; a receiving unit configured to receive a voice signal from a remote controller that is wirelessly connected to the sink device; a display unit; and a controller configured to: output the video data received from the source device through the network interface unit to the display unit, recognize a text from a screen corresponding to the video data outputted to the display unit, save the recognized text to a memory to correspond to location information on the screen corresponding to the video data, convert the voice signal received through the voice signal receiving unit into a text using a speech-to-text (STT) function at the sink device, and if a specific text including at least one portion of the converted text exists in the recognized text, send a message corresponding to a user input of selecting the specific text from the screen corresponding to the video data to the source device through the network interface unit via a user input back channel (UIBC), wherein the UIBC is not configured to transmit the voice signal. 10. The sink device of claim 9 , wherein if a signal indicating a change of a screen of the source device is received from the source device through the network interface unit, the controller is further configured to capture the screen corresponding to the video data outputted to the display unit in response to the received signal and recognize the text from the captured screen. | 0.716518 |
7,610,228 | 23 | 32 | 23. A computer-based method for use in managing a service level associated with resources in a distributed information technology (IT) system based on financial terms, the method comprising the steps of: automatically constructing and maintaining, via a processor of a computer, an electronic contract that contains information pertaining to descriptions of one or more business transactions in IT terms, financial implications of one or more business transaction service levels, and reporting to be performed in one or more financial terms; automatically measuring, via the processor of the computer, the operation of at least one distributed element of the IT system in terms of one or more business metrics based on the electronic contract and based at least in part on input received from at least one agent nodule located in the at least one distributed element; automatically determining, via the processor of the computer, at least one financial optimization based at least part on the measured one or more business metrics of the at least one distributed element of the IT system and based at least in part on the electronic contract, the financial optimization being specified in the electronic contract at the time of construction such that, at the time the financial optimization is to be determined, the electronic contract is accessed to identify a particular financial metric of the financial optimization that is to be computed and to identify an operation for computing the particular financial metric, the one or more business metrics are converted to one or more financial equivalents wherein the one or more financial equivalents comprise a cost of a lost connection, a cost of down time, and a relationship between revenue and network latency; and automatically issuing, via the processor of the computer, at least one control command based on the at least one financial optimization, the command to be executed on the at least one distributed element by the at least one agent module located in the at least one distributed element. | 23. A computer-based method for use in managing a service level associated with resources in a distributed information technology (IT) system based on financial terms, the method comprising the steps of: automatically constructing and maintaining, via a processor of a computer, an electronic contract that contains information pertaining to descriptions of one or more business transactions in IT terms, financial implications of one or more business transaction service levels, and reporting to be performed in one or more financial terms; automatically measuring, via the processor of the computer, the operation of at least one distributed element of the IT system in terms of one or more business metrics based on the electronic contract and based at least in part on input received from at least one agent nodule located in the at least one distributed element; automatically determining, via the processor of the computer, at least one financial optimization based at least part on the measured one or more business metrics of the at least one distributed element of the IT system and based at least in part on the electronic contract, the financial optimization being specified in the electronic contract at the time of construction such that, at the time the financial optimization is to be determined, the electronic contract is accessed to identify a particular financial metric of the financial optimization that is to be computed and to identify an operation for computing the particular financial metric, the one or more business metrics are converted to one or more financial equivalents wherein the one or more financial equivalents comprise a cost of a lost connection, a cost of down time, and a relationship between revenue and network latency; and automatically issuing, via the processor of the computer, at least one control command based on the at least one financial optimization, the command to be executed on the at least one distributed element by the at least one agent module located in the at least one distributed element. 32. The method of claim 23 , wherein the one or more business metrics are aggregated so as to obscure details reported to a third party. | 0.733333 |
8,873,856 | 12 | 20 | 12. A system for determining a class associated with an image, the system comprising: at least one processor; a segmentation module configured to employ the at least one processor to generate at least one image segment based on a segmentation of the image; a segmentation score module configured to employ the at least one processor to determine a segmentation score for an image segment included in the at least one image segment based on a comparison of the image segment and a region of the image, the region of the image associated with the image segment; a confidence score module configured to employ the at least one processor to determine a confidence score for the image segment based on the segmentation score and a classification score, the classification score indicative of a similarity between the image segment and at least one class; a class determination module configured to employ the at least one processor to determine a class associated with the image based on the confidence score; and a class output module configured to employ the at least one processor to output the class associated with the image. | 12. A system for determining a class associated with an image, the system comprising: at least one processor; a segmentation module configured to employ the at least one processor to generate at least one image segment based on a segmentation of the image; a segmentation score module configured to employ the at least one processor to determine a segmentation score for an image segment included in the at least one image segment based on a comparison of the image segment and a region of the image, the region of the image associated with the image segment; a confidence score module configured to employ the at least one processor to determine a confidence score for the image segment based on the segmentation score and a classification score, the classification score indicative of a similarity between the image segment and at least one class; a class determination module configured to employ the at least one processor to determine a class associated with the image based on the confidence score; and a class output module configured to employ the at least one processor to output the class associated with the image. 20. The system of claim 12 , further comprising: an image acquisition module configured to employ the at least one processor to receive the image, wherein the segmentation module is further configured to employ the at least one processor to: binarize the image to form a binarized image; and segment the binarized image based on objects within the binarized image to form the image segment. | 0.810311 |
7,711,573 | 163 | 166 | 163. The computer program product of claim 162 , wherein the program code for storing the parsed resume further comprises: program code for storing each said at least one skill or experience-related phrase having an identical term of experience as an element defined by a markup language, the element comprising a start tag, content data, and an end tag, wherein the start tag and the end tag include the identical term of experience, and wherein the content data includes each said at least one skill or experience-related phrase having the identical term of experience. | 163. The computer program product of claim 162 , wherein the program code for storing the parsed resume further comprises: program code for storing each said at least one skill or experience-related phrase having an identical term of experience as an element defined by a markup language, the element comprising a start tag, content data, and an end tag, wherein the start tag and the end tag include the identical term of experience, and wherein the content data includes each said at least one skill or experience-related phrase having the identical term of experience. 166. The computer program product of claim 163 , wherein the storing of the element is to a file. | 0.881995 |
10,120,858 | 12 | 17 | 12. A method for analyzing queries, the method comprising: receiving a query from a user; determining, based on the user's natural language, a correct grammatical structure for the query; dissecting the query into a plurality of words; assigning, based on a predetermined ontology and the determined correct grammatical structure, an ontological threshold score to each of the words; discarding the words having an assigned ontological threshold score that is below a predetermined ontological threshold; for each word having an assigned ontological threshold score that is at or above the predetermined ontological threshold, determining a part of speech associated with the word, said part of speech determination being determined based on the content of the query and the correct grammatical structure; for each word having an assigned ontological threshold score that is at or above the predetermined ontological threshold, determining a concept associated with the word, said concept determination being determined based on the content of the query and the correct grammatical structure; displaying, to the user, each word having an assigned ontological threshold score that is at or above the predetermined threshold; for each word having an assigned ontological threshold score that is at or above the predetermined ontological threshold, displaying, adjacent to the word, and along a horizontal axis defined by the word, the determined part of speech associated with the word, and the determined concept associated with the word; and enabling the user to change: each word having an assigned ontological threshold score that is at or above the predetermined threshold; each concept; and each part of speech. | 12. A method for analyzing queries, the method comprising: receiving a query from a user; determining, based on the user's natural language, a correct grammatical structure for the query; dissecting the query into a plurality of words; assigning, based on a predetermined ontology and the determined correct grammatical structure, an ontological threshold score to each of the words; discarding the words having an assigned ontological threshold score that is below a predetermined ontological threshold; for each word having an assigned ontological threshold score that is at or above the predetermined ontological threshold, determining a part of speech associated with the word, said part of speech determination being determined based on the content of the query and the correct grammatical structure; for each word having an assigned ontological threshold score that is at or above the predetermined ontological threshold, determining a concept associated with the word, said concept determination being determined based on the content of the query and the correct grammatical structure; displaying, to the user, each word having an assigned ontological threshold score that is at or above the predetermined threshold; for each word having an assigned ontological threshold score that is at or above the predetermined ontological threshold, displaying, adjacent to the word, and along a horizontal axis defined by the word, the determined part of speech associated with the word, and the determined concept associated with the word; and enabling the user to change: each word having an assigned ontological threshold score that is at or above the predetermined threshold; each concept; and each part of speech. 17. The method of claim 12 , wherein the receiving occurs in response to: the user typing the query into a text entry field; and depressing an analyze query button. | 0.782493 |
7,512,601 | 1 | 7 | 1. A system embodied on a computer-readable storage medium that facilitates generating a relevant summary snippet for a retrieved search result, comprising: a matching component that compares rich summary information embedded within the retrieved document with at least one search term used in the query that invoked retrieval of the document, and selects a subset of the rich summary information that is relevant to the at least one search term, wherein the rich summary information contains multiple subsets of information, each subset of information has been tagged to indicate that the subset contains query-specific summary information and each tagged subset has been associated with matching criteria by the creator of the rich summary information, at least two of the tagged subsets of information are associated with different matching criteria, the matching criteria comprising at least one expression that matches the associated subset with one or more queries; and an assembler component that generates a query-specific summary of the document based at least on the relevant subset of rich summary information returned by the matching component. | 1. A system embodied on a computer-readable storage medium that facilitates generating a relevant summary snippet for a retrieved search result, comprising: a matching component that compares rich summary information embedded within the retrieved document with at least one search term used in the query that invoked retrieval of the document, and selects a subset of the rich summary information that is relevant to the at least one search term, wherein the rich summary information contains multiple subsets of information, each subset of information has been tagged to indicate that the subset contains query-specific summary information and each tagged subset has been associated with matching criteria by the creator of the rich summary information, at least two of the tagged subsets of information are associated with different matching criteria, the matching criteria comprising at least one expression that matches the associated subset with one or more queries; and an assembler component that generates a query-specific summary of the document based at least on the relevant subset of rich summary information returned by the matching component. 7. The system of claim 1 , the assembler component employs an algorithm that generates summary snippets based on at least one of text, text with replacement, a pointer to a location within the document, or a pointer to a location within an associated document. | 0.5 |
8,170,989 | 1 | 5 | 1. A method of consolidating information in a document management and exchange system, the method comprising: adding a descriptor to an original document for exchange between two or more participant systems along a communication path, wherein the descriptor comprises at least one document identifier representing a logical subject of the document; identifying in further documents received from the communication path at the two or more participant systems modifications with respect to the original document based on comparing a descriptor of the further documents and the descriptor of the original document, wherein the further documents represent modified versions of the original document exchanged between the two or more participant systems, and wherein at least one participant system receives a further document with modifications different than modifications in another further document received by at least one other participant system; and maintaining a master document for each of the participant systems containing the original document and the modifications in the further documents received by that participant system from the communication path during the exchange of the modified versions of the original document between the two or more participant systems, the master document for each participant system providing consolidated information relating to the logical subject and the modifications received by that participant system, and wherein the master documents for at least two of the participant systems are different and include different modifications based on the further documents received at those at least two participant systems. | 1. A method of consolidating information in a document management and exchange system, the method comprising: adding a descriptor to an original document for exchange between two or more participant systems along a communication path, wherein the descriptor comprises at least one document identifier representing a logical subject of the document; identifying in further documents received from the communication path at the two or more participant systems modifications with respect to the original document based on comparing a descriptor of the further documents and the descriptor of the original document, wherein the further documents represent modified versions of the original document exchanged between the two or more participant systems, and wherein at least one participant system receives a further document with modifications different than modifications in another further document received by at least one other participant system; and maintaining a master document for each of the participant systems containing the original document and the modifications in the further documents received by that participant system from the communication path during the exchange of the modified versions of the original document between the two or more participant systems, the master document for each participant system providing consolidated information relating to the logical subject and the modifications received by that participant system, and wherein the master documents for at least two of the participant systems are different and include different modifications based on the further documents received at those at least two participant systems. 5. The method according to claim 1 , wherein new information is added or merged into the master document. | 0.818966 |
7,921,100 | 1 | 2 | 1. A method for calculating a similarity score of a query set comprising a query set of tokens and a first database set comprising a first database set of tokens, wherein the first database set is one of a plurality of database sets in a data collection set stored on a non-transitory computer readable medium, comprising the steps of: for each specific token in the query set, determining the number of database sets that contain the specific token; for each specific token in the query set, calculating an inverse document frequency (idf) weight, based at least in part on the number of database sets that contain the specific token and on the total number of database sets in the data collection set; calculating a normalized length of the first database set; calculating a normalized length of the query set; and, calculating a similarity score based at least in part on the normalized length of the first database set, the normalized length of the query set, and the idf weight of each of the tokens in the query set. | 1. A method for calculating a similarity score of a query set comprising a query set of tokens and a first database set comprising a first database set of tokens, wherein the first database set is one of a plurality of database sets in a data collection set stored on a non-transitory computer readable medium, comprising the steps of: for each specific token in the query set, determining the number of database sets that contain the specific token; for each specific token in the query set, calculating an inverse document frequency (idf) weight, based at least in part on the number of database sets that contain the specific token and on the total number of database sets in the data collection set; calculating a normalized length of the first database set; calculating a normalized length of the query set; and, calculating a similarity score based at least in part on the normalized length of the first database set, the normalized length of the query set, and the idf weight of each of the tokens in the query set. 2. The method of claim 1 further comprising the step of performing an improved no random access method. | 0.878538 |
8,775,969 | 15 | 26 | 15. A mobile terminal, comprising a memory, a display, and a processing apparatus, wherein the memory is configured to store a plurality of contact labels, each of the contact labels comprising at least two characters, and each of the at least two characters being represented by at least one grapheme; the display is configured to perform a listing of a first sequence of graphemes on the display; the processing apparatus is configured to: receive a first input; and perform a selection of a first grapheme from the first sequence of graphemes in response to the first input, the first sequence of graphemes being associated with a first unit of characters relating to the plurality of contact labels; the display is further configured to: perform a first display of a first set of contact labels being searched within the plurality of contact labels, if each of the first set of contact labels comprising a grapheme matching the first grapheme; perform a listing of a second sequence of graphemes on the display, wherein the first sequence of graphemes is listed at a first position of the display, the second sequence of graphemes is listed at a second position of the display, and the first sequence of graphemes is hidden when the second sequence of graphemes is listed; the processing apparatus is further configured to: receive a second input; perform a selection of a second grapheme from the second sequence of graphemes in response to the second input, the second sequence of graphemes being associated with a second unit of characters relating to the plurality of contact labels; and the display is further configured to: perform an updated display of the first display, the updated display relating to a second set of contact labels being searched within the first set of contact labels, if each of the second set of contact labels comprising a grapheme matching the second grapheme. | 15. A mobile terminal, comprising a memory, a display, and a processing apparatus, wherein the memory is configured to store a plurality of contact labels, each of the contact labels comprising at least two characters, and each of the at least two characters being represented by at least one grapheme; the display is configured to perform a listing of a first sequence of graphemes on the display; the processing apparatus is configured to: receive a first input; and perform a selection of a first grapheme from the first sequence of graphemes in response to the first input, the first sequence of graphemes being associated with a first unit of characters relating to the plurality of contact labels; the display is further configured to: perform a first display of a first set of contact labels being searched within the plurality of contact labels, if each of the first set of contact labels comprising a grapheme matching the first grapheme; perform a listing of a second sequence of graphemes on the display, wherein the first sequence of graphemes is listed at a first position of the display, the second sequence of graphemes is listed at a second position of the display, and the first sequence of graphemes is hidden when the second sequence of graphemes is listed; the processing apparatus is further configured to: receive a second input; perform a selection of a second grapheme from the second sequence of graphemes in response to the second input, the second sequence of graphemes being associated with a second unit of characters relating to the plurality of contact labels; and the display is further configured to: perform an updated display of the first display, the updated display relating to a second set of contact labels being searched within the first set of contact labels, if each of the second set of contact labels comprising a grapheme matching the second grapheme. 26. The mobile terminal according to claim 15 , wherein the first sequence of graphemes comprises distinct graphemes; and the second sequence of graphemes comprises distinct graphemes. | 0.748634 |
7,937,260 | 1 | 5 | 1. A method for retrieving a reference identifier, the method comprising: generating, via a processing device, a plurality of selection identifiers from first user speech input received from a user, wherein the first user speech input comprises at least one non-alphanumeric character; comparing the plurality of selection identifiers with a set of reference identifiers to determine which reference identifiers in the set of reference identifiers match at least one of the plurality of selection identifiers; deriving a dynamic grammar by storing matching reference identifiers determined to match at least one of the plurality of selection identifiers together with data elements associated with the matching reference identifiers; generating at least one correlation identifier from second user input received from the user; comparing the at least one correlation identifier with the data elements to determine which data element matches the at least one correlation identifier; and retrieving the reference identifier associated with the data element determined to match the at least one correlation identifier. | 1. A method for retrieving a reference identifier, the method comprising: generating, via a processing device, a plurality of selection identifiers from first user speech input received from a user, wherein the first user speech input comprises at least one non-alphanumeric character; comparing the plurality of selection identifiers with a set of reference identifiers to determine which reference identifiers in the set of reference identifiers match at least one of the plurality of selection identifiers; deriving a dynamic grammar by storing matching reference identifiers determined to match at least one of the plurality of selection identifiers together with data elements associated with the matching reference identifiers; generating at least one correlation identifier from second user input received from the user; comparing the at least one correlation identifier with the data elements to determine which data element matches the at least one correlation identifier; and retrieving the reference identifier associated with the data element determined to match the at least one correlation identifier. 5. The method of claim 1 , wherein the plurality of selection identifiers represents an N-best hypothesis as a result of output from a speech recognition module. | 0.728956 |
8,543,982 | 14 | 19 | 14. A method for delivering financial services from a delivery system to a customer through a remote device, the method comprising: selecting a mini-app dialog component on the remote device to perform a financial service; collecting, using a presentation manager, financial information, including at least an amount selected by the customer, to perform the financial service by receiving the financial information from the customer in the mini-app dialog component; instantiating a transaction executor component for performing the financial service based upon the financial information entered by the customer in the mini-app dialog component; using a rule broker for answering at least one query posed by the mini-app dialog component regarding the financial information entered by the customer in the mini-app dialog component by determining a rule authority, from a plurality of rule authorities, to route the query based on a parameter passed in the query and routing, by the rule broker, the at least one query to the determined rule authority that supplies an answer to the query and defines context-specific behavior of the transaction executor component; wherein the answer is to resolve a specific inquiry regarding an unique identification contextualized for the customer using the dialog component for carrying out the financial transaction; wherein the rule authorities register themselves with the rule broker as possible answerers for particular queries; and displaying, using the presentation manager, on the remote device that the financial service has been performed; wherein registering to the rule broker by the rule authorities includes registering of rules provided by the respective authorities, the rules having associated parameters and constraints; wherein generating a query by the rule broker includes consulting a plurality of pre-established answers provided by a registry component internal to the rule broker; and responsive to not finding a matching answer, the rule broker applying the most suitable parameter constraints defined with one of the registered rules to formulate the query and direct it to the registered rule authority corresponding to the rule being used. | 14. A method for delivering financial services from a delivery system to a customer through a remote device, the method comprising: selecting a mini-app dialog component on the remote device to perform a financial service; collecting, using a presentation manager, financial information, including at least an amount selected by the customer, to perform the financial service by receiving the financial information from the customer in the mini-app dialog component; instantiating a transaction executor component for performing the financial service based upon the financial information entered by the customer in the mini-app dialog component; using a rule broker for answering at least one query posed by the mini-app dialog component regarding the financial information entered by the customer in the mini-app dialog component by determining a rule authority, from a plurality of rule authorities, to route the query based on a parameter passed in the query and routing, by the rule broker, the at least one query to the determined rule authority that supplies an answer to the query and defines context-specific behavior of the transaction executor component; wherein the answer is to resolve a specific inquiry regarding an unique identification contextualized for the customer using the dialog component for carrying out the financial transaction; wherein the rule authorities register themselves with the rule broker as possible answerers for particular queries; and displaying, using the presentation manager, on the remote device that the financial service has been performed; wherein registering to the rule broker by the rule authorities includes registering of rules provided by the respective authorities, the rules having associated parameters and constraints; wherein generating a query by the rule broker includes consulting a plurality of pre-established answers provided by a registry component internal to the rule broker; and responsive to not finding a matching answer, the rule broker applying the most suitable parameter constraints defined with one of the registered rules to formulate the query and direct it to the registered rule authority corresponding to the rule being used. 19. The method of claim 14 , further comprising the step of instantiating a session bubble for each session. | 0.878378 |
7,610,193 | 2 | 4 | 2. The computer program product encoded on the machine-readable storage device of claim 1 , further comprising instructions operable to cause a programmable processor to: identify one or more words in the document that are not ambiguous; and to automatically add the one or more words to the dictionary. | 2. The computer program product encoded on the machine-readable storage device of claim 1 , further comprising instructions operable to cause a programmable processor to: identify one or more words in the document that are not ambiguous; and to automatically add the one or more words to the dictionary. 4. The computer program product encoded on the machine-readable storage device of claim 2 , wherein the instruction to automatically add the one or more non-ambiguous words to the dictionary comprises instructions to add the one or more non-ambiguous words to a dictionary containing one or more words located in one or more documents that have been previously processed by the computer program. | 0.5 |
9,396,540 | 15 | 19 | 15. A computer program product, comprising a non-transitory computer-readable medium having a computer-readable program code embodied therein, the computer-readable program code adapted to be executed by one or more processors to implement a method for identifying anchors for fields using optical character recognition data, the method comprising: identifying a first collection of characters comprising a first set of characters at a first position relative to a first field in a first document and a second set of characters at a second position relative to the first field in the first document, wherein the first set of characters is associated with a first word and the second set of characters is associated with a second word; combining the first set of characters with the second set of characters to create a first anchor in the first document based on the first collection of characters, wherein the first anchor is at a third position relative to the first field in the first document, and wherein the first anchor is associated with a second field in the first document; identifying a second collection of characters comprising a third set of characters at a fourth position relative to a third field in a second document and a fourth set of characters at a fifth position relative to the third field in the second document, wherein the third set of characters is associated with a third word and the fourth set of characters is associated with a fourth word; determining a location of a second anchor in the second document by calculating a vector based on the first, second, third and fourth sets of characters; and identifying a fourth field in the second document that corresponds to the second field in the first document based on the location of the second anchor in the second document. | 15. A computer program product, comprising a non-transitory computer-readable medium having a computer-readable program code embodied therein, the computer-readable program code adapted to be executed by one or more processors to implement a method for identifying anchors for fields using optical character recognition data, the method comprising: identifying a first collection of characters comprising a first set of characters at a first position relative to a first field in a first document and a second set of characters at a second position relative to the first field in the first document, wherein the first set of characters is associated with a first word and the second set of characters is associated with a second word; combining the first set of characters with the second set of characters to create a first anchor in the first document based on the first collection of characters, wherein the first anchor is at a third position relative to the first field in the first document, and wherein the first anchor is associated with a second field in the first document; identifying a second collection of characters comprising a third set of characters at a fourth position relative to a third field in a second document and a fourth set of characters at a fifth position relative to the third field in the second document, wherein the third set of characters is associated with a third word and the fourth set of characters is associated with a fourth word; determining a location of a second anchor in the second document by calculating a vector based on the first, second, third and fourth sets of characters; and identifying a fourth field in the second document that corresponds to the second field in the first document based on the location of the second anchor in the second document. 19. The computer program product of claim 15 , wherein the second document is associated with a template in response to a comparison to classify documents similar to the first document. | 0.734195 |
7,519,822 | 26 | 27 | 26. A method of doing business by providing verification services for descriptive statements about electronic resources, said method comprising: hosting a digital signature, said digital signature based upon an aggregate hash value created by applying a commutative function to multiple independent hash values, each independent hash value based upon a subset of the descriptive statements, and at least one attribute representing the set of all descriptive statements represented by the aggregate hash value; and providing the digital signature in response to remote request that calls for verification of descriptive statements in the hash. | 26. A method of doing business by providing verification services for descriptive statements about electronic resources, said method comprising: hosting a digital signature, said digital signature based upon an aggregate hash value created by applying a commutative function to multiple independent hash values, each independent hash value based upon a subset of the descriptive statements, and at least one attribute representing the set of all descriptive statements represented by the aggregate hash value; and providing the digital signature in response to remote request that calls for verification of descriptive statements in the hash. 27. A method according to claim 26 , wherein: the number of statements in each subset is one; and the at least one attribute includes the number of descriptive statements represented by the aggregate hash value. | 0.771645 |
9,918,057 | 8 | 9 | 8. The method according to claim 1 , wherein the measure is determined based upon a Fourier transform of the texture. | 8. The method according to claim 1 , wherein the measure is determined based upon a Fourier transform of the texture. 9. The method according to claim 8 , wherein the function of the determined measure relates to a dominant frequency determined from the Fourier transform. | 0.5 |
9,348,877 | 1 | 5 | 1. A method of presenting search results, comprising: presenting three dimensional objects within one or more related clusters as an answer set in response to a first search query; interactively receiving, from a user, weighted relevance information associated with selective ones of the three dimensional objects or selective ones of the related clusters, and wherein the user classifies the selective ones of the three dimensional objects or the selective ones of the related clusters into groups identified by the user as being relevant and as being irrelevant, the relevant and irrelevant groups at least partially representing the weighted relevance information; and interactively issuing one or more second search queries based on the received relevance information to remove a number of the three dimensional objects from the answer set and to reduce a number of the related clusters from the answer set. | 1. A method of presenting search results, comprising: presenting three dimensional objects within one or more related clusters as an answer set in response to a first search query; interactively receiving, from a user, weighted relevance information associated with selective ones of the three dimensional objects or selective ones of the related clusters, and wherein the user classifies the selective ones of the three dimensional objects or the selective ones of the related clusters into groups identified by the user as being relevant and as being irrelevant, the relevant and irrelevant groups at least partially representing the weighted relevance information; and interactively issuing one or more second search queries based on the received relevance information to remove a number of the three dimensional objects from the answer set and to reduce a number of the related clusters from the answer set. 5. The method of claim 1 wherein the presenting further includes presenting the answer set in response to the first search query where the first search query is obtained by interactively traversing a hierarchy of available three dimensional models and selecting one of the available three dimension modes as the first search query. | 0.5 |
7,730,094 | 9 | 10 | 9. A computer comprising a processor controlling operation of the computer according to computer readable instructions stored in a memory, wherein, upon execution of the computer readable instructions by the processor, the computer performs a method for determining access rights to a range of objects by a range of users through scope information, comprising: receiving, from a first user, request to access a first resource; determining that a scope of a first access control metadata element encompasses the first resource, wherein the first access control metadata element includes: a first set of one or more XML statements that define the scope of the first access control metadata element by selecting a plurality of resources, the scope of the first access control metadata element encompassing the first resource and at least one other resource; a second set of one or more XML statements that define access rights for the plurality of resources within the scope of the first access control metadata element; and a third set of one or more XML statements that define a plurality of users to which the first access control metadata element applies; determining that a scope of a second access control metadata element encompasses the first resource, wherein the second access control metadata element includes: a first set of one or more XML access control-related statements that define the scope of the second access control metadata element by selecting one or more resources, the scope of the second access control metadata element encompassing the first resource; and a second set of one or more XML statements that define access rights for the plurality of resources within the scope of the second access control metadata element; and a third set of one or more XML statements that define a plurality of users to which the second access control metadata element applies; determining that the first user is among the plurality of users to which the first access control metadata element applies as defined by the third set of one or more XML statements of the first access control metadata element; determining that the first user is among the plurality of users to which the second access control metadata element applies as defined by the third set of one or more XML statements of the second access control metadata element; determining that a first access right defined in the first access control metadata element conflicts with a second access right defined in the second access control metadata element; in response to determining that the first access right conflicts with the second access right, determining whether the first access right supersedes the second access right; and in response to determining that the first access right supersedes the second access right, applying the first access right to the access request from the first user. | 9. A computer comprising a processor controlling operation of the computer according to computer readable instructions stored in a memory, wherein, upon execution of the computer readable instructions by the processor, the computer performs a method for determining access rights to a range of objects by a range of users through scope information, comprising: receiving, from a first user, request to access a first resource; determining that a scope of a first access control metadata element encompasses the first resource, wherein the first access control metadata element includes: a first set of one or more XML statements that define the scope of the first access control metadata element by selecting a plurality of resources, the scope of the first access control metadata element encompassing the first resource and at least one other resource; a second set of one or more XML statements that define access rights for the plurality of resources within the scope of the first access control metadata element; and a third set of one or more XML statements that define a plurality of users to which the first access control metadata element applies; determining that a scope of a second access control metadata element encompasses the first resource, wherein the second access control metadata element includes: a first set of one or more XML access control-related statements that define the scope of the second access control metadata element by selecting one or more resources, the scope of the second access control metadata element encompassing the first resource; and a second set of one or more XML statements that define access rights for the plurality of resources within the scope of the second access control metadata element; and a third set of one or more XML statements that define a plurality of users to which the second access control metadata element applies; determining that the first user is among the plurality of users to which the first access control metadata element applies as defined by the third set of one or more XML statements of the first access control metadata element; determining that the first user is among the plurality of users to which the second access control metadata element applies as defined by the third set of one or more XML statements of the second access control metadata element; determining that a first access right defined in the first access control metadata element conflicts with a second access right defined in the second access control metadata element; in response to determining that the first access right conflicts with the second access right, determining whether the first access right supersedes the second access right; and in response to determining that the first access right supersedes the second access right, applying the first access right to the access request from the first user. 10. The computer of claim 9 , wherein the first access right comprises granted access to the first resource. | 0.762115 |
7,598,942 | 81 | 82 | 81. The method of claim 80 , comprising representing the pose as a string of relative orientations between at least one second appendage and a back portion of a first appendage of the body, wherein the second appendage is connected to the first appendage. | 81. The method of claim 80 , comprising representing the pose as a string of relative orientations between at least one second appendage and a back portion of a first appendage of the body, wherein the second appendage is connected to the first appendage. 82. The method of claim 81 , comprising quantizing the string of relative orientations into at least one discrete state. | 0.5 |
7,827,052 | 10 | 11 | 10. The computer program product of claim 9 , further including instructions for, prior to solving a first iteration of the reputation function: excluding from the reputation function nodes having no outlinks; and excluding from the reputation function nodes having no positively valued outlinks. | 10. The computer program product of claim 9 , further including instructions for, prior to solving a first iteration of the reputation function: excluding from the reputation function nodes having no outlinks; and excluding from the reputation function nodes having no positively valued outlinks. 11. The computer program product of claim 10 , further including instructions for, prior to solving the first iteration of the reputation function but subsequent to excluding from the reputation function nodes having no outlinks and excluding from the reputation function nodes having no positively valued outlinks: normalizing respective outlinks for a node to sum to a predefined value. | 0.5 |
10,133,776 | 1 | 8 | 1. A method comprising: receiving a first query comprising an outer query that: includes one or more set operators; instantiates a particular data object using a first name; references a first instance of the particular data object using said first name; wherein at least a particular set operator of the one or more set operators includes a particular subquery that: instantiates the particular data object using a second name; references a second instance of the particular data object using said second name; based at least in part on the first query, transforming the first query to a second query that does not contain at least the particular subquery or the particular set operator; wherein the second query comprises an added predicate that is based at least in part on the particular subquery; wherein the added predicate references the first instance of the particular data object using said first name without referencing the second instance of the particular data object using said second name; and wherein the second query is semantically equivalent to the first query; generating an execution plan for executing the second query; causing execution of the second query instead of the first query based on the execution plan for executing the second query; wherein the method is performed by one or more computing devices. | 1. A method comprising: receiving a first query comprising an outer query that: includes one or more set operators; instantiates a particular data object using a first name; references a first instance of the particular data object using said first name; wherein at least a particular set operator of the one or more set operators includes a particular subquery that: instantiates the particular data object using a second name; references a second instance of the particular data object using said second name; based at least in part on the first query, transforming the first query to a second query that does not contain at least the particular subquery or the particular set operator; wherein the second query comprises an added predicate that is based at least in part on the particular subquery; wherein the added predicate references the first instance of the particular data object using said first name without referencing the second instance of the particular data object using said second name; and wherein the second query is semantically equivalent to the first query; generating an execution plan for executing the second query; causing execution of the second query instead of the first query based on the execution plan for executing the second query; wherein the method is performed by one or more computing devices. 8. The method of claim 1 , wherein the particular subquery contains at least one predicate in a WHERE clause of the particular subquery, wherein the added predicate is based at least in part on the at least one predicate in the WHERE clause of the particular subquery, and wherein the added predicate is in a WHERE clause of the outer query. | 0.758499 |
9,843,544 | 14 | 16 | 14. In an environment wherein a user may enter information as written text onto a web page, and the information may be sent with or without an attachment, a computer- implemented method for determining whether the information should be sent with an attachment, the method comprising: accepting written text entered onto the web page as the information; inspecting the written text to detect any words which are in a database of predetermined key terms; inspecting the written text to detect any phrases which are in the database of predetermined key terms; if a word which was detected in the written text is in a database of predetermined negative terms then disregarding the word which was detected; if a phrase which was detected in the written text is in the database of predetermined negative terms then disregarding the phrase which was detected; and if any word which was detected in the written text has not been disregarded, or if any phrase which was detected in the written text has not been disregarded, then providing a suggestion to a user that an attachment should be provided before the information is sent. | 14. In an environment wherein a user may enter information as written text onto a web page, and the information may be sent with or without an attachment, a computer- implemented method for determining whether the information should be sent with an attachment, the method comprising: accepting written text entered onto the web page as the information; inspecting the written text to detect any words which are in a database of predetermined key terms; inspecting the written text to detect any phrases which are in the database of predetermined key terms; if a word which was detected in the written text is in a database of predetermined negative terms then disregarding the word which was detected; if a phrase which was detected in the written text is in the database of predetermined negative terms then disregarding the phrase which was detected; and if any word which was detected in the written text has not been disregarded, or if any phrase which was detected in the written text has not been disregarded, then providing a suggestion to a user that an attachment should be provided before the information is sent. 16. The method of claim 14 wherein inspecting the written text to detect any words which are in the database of predetermined key terms comprises: accessing the database of predetermined key terms, the database comprising predetermined words; and inspecting the written text in the information for at least one of the predetermined words. | 0.508721 |
9,666,087 | 6 | 8 | 6. An education support method, comprising: storing, for each of a plurality of students, history information and group information, the history information indicating a transition of evaluation scores regarding a degree of achievement regarding at least one evaluation item for each of a plurality of group discussions, and the group information indicating a group in which each student is involved for each of the plurality of group discussions, the group being one of a plurality of groups; receiving a designation of a first student to be trained from among the plurality of students; identifying a second student from among the plurality of students based on the history information, the second student having specific history information indicating that the evaluation score has been improved more than a threshold; identifying a specific group, from among the plurality of groups, in which the second student was involved for the specific group discussion; extracting at least one third student, other than the second student, from among the students who are involved in the specific group; grouping the first student to be trained and the at least one third student for a next group discussion; and outputting an instruction to display a screen on respective terminal devices of the first student and the at least one third student, the screen displaying a plurality of opinions inputted by the first student and the at least one third student in the next group discussion. | 6. An education support method, comprising: storing, for each of a plurality of students, history information and group information, the history information indicating a transition of evaluation scores regarding a degree of achievement regarding at least one evaluation item for each of a plurality of group discussions, and the group information indicating a group in which each student is involved for each of the plurality of group discussions, the group being one of a plurality of groups; receiving a designation of a first student to be trained from among the plurality of students; identifying a second student from among the plurality of students based on the history information, the second student having specific history information indicating that the evaluation score has been improved more than a threshold; identifying a specific group, from among the plurality of groups, in which the second student was involved for the specific group discussion; extracting at least one third student, other than the second student, from among the students who are involved in the specific group; grouping the first student to be trained and the at least one third student for a next group discussion; and outputting an instruction to display a screen on respective terminal devices of the first student and the at least one third student, the screen displaying a plurality of opinions inputted by the first student and the at least one third student in the next group discussion. 8. The education support method according to claim 6 , wherein the storing of the history information and the group information further comprises storing, for each of the plurality of students, a plurality of evaluation items that are different from each other and a plurality of the evaluation scores corresponding to respective evaluation items, the identifying of the second student further comprises selecting an evaluation item, from among the plurality of evaluation items, and identifying the second student based on specific history information indicating that the evaluation score corresponding to the selected evaluation item has improved more than the threshold, and the identifying of the specific group discussion includes identifying the specific group discussion in which the evaluation score of the second student corresponding to the selected evaluation item has improved more than the threshold. | 0.5 |
7,937,265 | 1 | 2 | 1. A method comprising: receiving textual input in data processing apparatus; identifying, by operation of the data processing apparatus, a plurality of ngrams, each ngram being a sequence of words within the textual input; dividing, by operation of the data processing apparatus, each identified ngram into three portions: a beginning constant portion containing a first number of words at the beginning of the ngram, an ending constant portion containing a second number of words at the end of the ngram, and a middle portion containing the words of the ngram between the beginning constant portion and the ending constant portion; determining, by operation of the data processing apparatus, an anchor for each ngram, the anchor comprising the beginning constant portion and the ending constant portion of the ngram; and identifying, by operation of the data processing apparatus, a plurality of potential paraphrase pairs, wherein if the anchor of a first ngram is the same as the anchor of a second ngram in the plurality of ngrams, the middle portion of the first ngram and the middle portion of the second ngram is identified as being a potential paraphrase pair, wherein the middle portion of the first ngram is textually different from the middle portion of the second ngram. | 1. A method comprising: receiving textual input in data processing apparatus; identifying, by operation of the data processing apparatus, a plurality of ngrams, each ngram being a sequence of words within the textual input; dividing, by operation of the data processing apparatus, each identified ngram into three portions: a beginning constant portion containing a first number of words at the beginning of the ngram, an ending constant portion containing a second number of words at the end of the ngram, and a middle portion containing the words of the ngram between the beginning constant portion and the ending constant portion; determining, by operation of the data processing apparatus, an anchor for each ngram, the anchor comprising the beginning constant portion and the ending constant portion of the ngram; and identifying, by operation of the data processing apparatus, a plurality of potential paraphrase pairs, wherein if the anchor of a first ngram is the same as the anchor of a second ngram in the plurality of ngrams, the middle portion of the first ngram and the middle portion of the second ngram is identified as being a potential paraphrase pair, wherein the middle portion of the first ngram is textually different from the middle portion of the second ngram. 2. The method of claim 1 , wherein determining the anchor comprises including a named entity as part of the anchor. | 0.859756 |
9,135,518 | 13 | 15 | 13. A non-transitory computer readable medium including instructions that when performed by a processor perform a method comprising: selecting a subset of feature points within multiple local extrema, wherein each feature point has an associated blur level and scale octave; creating a vector for each of the feature points, wherein the vector is based on the normalized intensity values of a patch around the feature point, wherein the patch size is determined by the associated octave; dividing the patch into multiple overlapping patches, wherein each overlapping patch is represented by a vector; concatenating each overlapping patch vector by projecting the overlapping patches onto an eigen space; and creating a compact representation of feature points defining the digital image, wherein the compact representation is a multi-vector descriptor formed from the concatenated patch vectors. | 13. A non-transitory computer readable medium including instructions that when performed by a processor perform a method comprising: selecting a subset of feature points within multiple local extrema, wherein each feature point has an associated blur level and scale octave; creating a vector for each of the feature points, wherein the vector is based on the normalized intensity values of a patch around the feature point, wherein the patch size is determined by the associated octave; dividing the patch into multiple overlapping patches, wherein each overlapping patch is represented by a vector; concatenating each overlapping patch vector by projecting the overlapping patches onto an eigen space; and creating a compact representation of feature points defining the digital image, wherein the compact representation is a multi-vector descriptor formed from the concatenated patch vectors. 15. The method of claim 13 , wherein each descriptor is invariant to scale. | 0.926181 |
7,657,006 | 1 | 8 | 1. A method of translating a message, comprising: generating an electronic message in an understood language of an originating party; receiving instructions to translate contents of the electronic message to another language; prompting a receiving party to select the another language; converting the electronic message to the another language in accordance with the instructions; and delivering the converted electronic message to the receiving party. | 1. A method of translating a message, comprising: generating an electronic message in an understood language of an originating party; receiving instructions to translate contents of the electronic message to another language; prompting a receiving party to select the another language; converting the electronic message to the another language in accordance with the instructions; and delivering the converted electronic message to the receiving party. 8. The method of claim 1 , wherein instructions are received from the receiving party. | 0.839552 |
10,061,850 | 17 | 21 | 17. A system for providing search results to a first user of a client, the system comprising: one or more processors; memory coupled to the processor, the memory storing program modules executable by the processors, the program modules including: a receiving module configured to receive a first query for one or more items of interest and a navigational query for a first website, wherein the first query includes at least one search term, and wherein the navigational query includes a first identifier of the first web site, and the at least one search term is absent from the navigational query; an execution module configured to: obtain and store results responsive to the first query prior to receiving the navigation query, wherein the first query is a recent query of the navigation query, after obtaining and storing the results responsive to the recent query, in response to receiving the navigational query, obtain the at least one search term from the recent query, and execute an alternate query of the first web site to yield alternate search results responsive to the alternate query within a domain of the first website, the alternate query including the at least one search term and the navigational query; and a transmitting module configured to transmit to the first user the alternate search results, at least one top ranking navigational search result, and at least one remaining navigational search result for display, wherein the at least one top ranking navigational search result, the alternate search results, and the at least one remaining navigational search result are associated with a priority attribute that indicates a priority level for display, wherein a first priority attribute is associated with the at least one top ranking navigational search result and indicates that the at least one top ranking navigational search result is to be displayed above other search results displayed on a search result page, a second priority attribute is associated with the alternate query search result and indicates that the alternate query search result is to be displayed below the at least one top ranking navigational search result in the search result page, and a third priority attribute is associated with the at least one remaining navigational search result and indicates that the at least one remaining navigational search result is to be displayed below the alternate query search result in the search result page, the first priority attribute having a highest priority level and the third priority attribute having a lowest priority level. | 17. A system for providing search results to a first user of a client, the system comprising: one or more processors; memory coupled to the processor, the memory storing program modules executable by the processors, the program modules including: a receiving module configured to receive a first query for one or more items of interest and a navigational query for a first website, wherein the first query includes at least one search term, and wherein the navigational query includes a first identifier of the first web site, and the at least one search term is absent from the navigational query; an execution module configured to: obtain and store results responsive to the first query prior to receiving the navigation query, wherein the first query is a recent query of the navigation query, after obtaining and storing the results responsive to the recent query, in response to receiving the navigational query, obtain the at least one search term from the recent query, and execute an alternate query of the first web site to yield alternate search results responsive to the alternate query within a domain of the first website, the alternate query including the at least one search term and the navigational query; and a transmitting module configured to transmit to the first user the alternate search results, at least one top ranking navigational search result, and at least one remaining navigational search result for display, wherein the at least one top ranking navigational search result, the alternate search results, and the at least one remaining navigational search result are associated with a priority attribute that indicates a priority level for display, wherein a first priority attribute is associated with the at least one top ranking navigational search result and indicates that the at least one top ranking navigational search result is to be displayed above other search results displayed on a search result page, a second priority attribute is associated with the alternate query search result and indicates that the alternate query search result is to be displayed below the at least one top ranking navigational search result in the search result page, and a third priority attribute is associated with the at least one remaining navigational search result and indicates that the at least one remaining navigational search result is to be displayed below the alternate query search result in the search result page, the first priority attribute having a highest priority level and the third priority attribute having a lowest priority level. 21. The system of claim 17 , further comprising: a merging module configured to merge the search results for the alternate query and the navigational search results to form merged search results; wherein the transmitting module is further configured to transmit the merged search results to the client for display to the first user. | 0.710801 |
8,006,181 | 8 | 9 | 8. An apparatus for adding words to an online dictionary used for spellchecking, the apparatus comprising: means for performing spellchecking on an electronic document; means for identifying an unrecognized word in the electronic document; means for determining at least one related-word form of the unrecognized word; and means for concurrently adding the unrecognized word and at least one related-word form of the unrecognized word to the online dictionary in a single operation. | 8. An apparatus for adding words to an online dictionary used for spellchecking, the apparatus comprising: means for performing spellchecking on an electronic document; means for identifying an unrecognized word in the electronic document; means for determining at least one related-word form of the unrecognized word; and means for concurrently adding the unrecognized word and at least one related-word form of the unrecognized word to the online dictionary in a single operation. 9. The apparatus of claim 8 , further comprising means for identifying a part of speech for the unrecognized word and wherein the means for determining includes means for determining each related-word form based on the identified part of speech. | 0.663462 |
6,038,531 | 2 | 4 | 2. A similar word discrimination method for discriminating words that may be misrecognized because of their similarity, comprising the steps of: receiving voice data of input words; using a learning dynamic recurrent neural networks (DRNN) voice model to obtain a specified DRNN output showing a level of correctness in response to the voice data of input words; processing the DRNN output to establish a specified period in which the characteristic components of the input words are included in the DRNN output, when the DRNN output shows a level of correctness of a predetermined amount or greater; encoding the input word voice data into code data by using a code book; examining the characteristics of the code data of said input words during the specified period; and discriminating between the input words and words that are similar to the input words on the basis of the examination. | 2. A similar word discrimination method for discriminating words that may be misrecognized because of their similarity, comprising the steps of: receiving voice data of input words; using a learning dynamic recurrent neural networks (DRNN) voice model to obtain a specified DRNN output showing a level of correctness in response to the voice data of input words; processing the DRNN output to establish a specified period in which the characteristic components of the input words are included in the DRNN output, when the DRNN output shows a level of correctness of a predetermined amount or greater; encoding the input word voice data into code data by using a code book; examining the characteristics of the code data of said input words during the specified period; and discriminating between the input words and words that are similar to the input words on the basis of the examination. 4. The similar word discrimination method of claim 2, further comprising the step of: creating the code book from five vowel sounds. | 0.864476 |
9,208,509 | 1 | 12 | 1. A computer program embodied on a non-transitory computer readable medium, comprising computer code for: identifying by a social network text from content that is one of consumed and output by a user; determining by the social network a native language of the user indicated within a profile of the user within the social network; identifying by a vocabulary analysis module a total number of words within the identified text; measuring a size of a working vocabulary of the user by the vocabulary analysis module using the text upon determining that the identified text is in the determined native language of the user and upon determining that the total number of words within the identified text is greater than a predetermined number, where measuring the size of the working vocabulary includes: identifying a total number of distinct words within the identified text, and calculating the size of the working vocabulary as a ratio of the total number of distinct words to the total number of words within the identified text; storing by an advertisement database a plurality of advertisements, where for each of the plurality of advertisements, the advertisement is stored by the advertisement database in association with one of a plurality of vocabulary thresholds upon determining by the advertisement database that the advertisement has been previously selected by a threshold number of other users each having the working vocabulary matching the vocabulary threshold; and selecting by the advertisement database one of the plurality of advertisements for presentation to the user, where the advertisement is selected based on a determination that the advertisement is stored in association with a vocabulary threshold matching the size of the working vocabulary of the user. | 1. A computer program embodied on a non-transitory computer readable medium, comprising computer code for: identifying by a social network text from content that is one of consumed and output by a user; determining by the social network a native language of the user indicated within a profile of the user within the social network; identifying by a vocabulary analysis module a total number of words within the identified text; measuring a size of a working vocabulary of the user by the vocabulary analysis module using the text upon determining that the identified text is in the determined native language of the user and upon determining that the total number of words within the identified text is greater than a predetermined number, where measuring the size of the working vocabulary includes: identifying a total number of distinct words within the identified text, and calculating the size of the working vocabulary as a ratio of the total number of distinct words to the total number of words within the identified text; storing by an advertisement database a plurality of advertisements, where for each of the plurality of advertisements, the advertisement is stored by the advertisement database in association with one of a plurality of vocabulary thresholds upon determining by the advertisement database that the advertisement has been previously selected by a threshold number of other users each having the working vocabulary matching the vocabulary threshold; and selecting by the advertisement database one of the plurality of advertisements for presentation to the user, where the advertisement is selected based on a determination that the advertisement is stored in association with a vocabulary threshold matching the size of the working vocabulary of the user. 12. The computer program of claim 1 , wherein content is personalized for the user using preferences identified for other users having a working vocabulary size within a same predetermined range as the size of the working vocabulary of the user. | 0.5 |
8,669,941 | 17 | 21 | 17. A system for data input comprising: an input selection device divided into multiple non-overlapping zones, each non-overlapping zone including two or more individual alphabetic or alphanumeric input selection indicators, wherein at least one of the alphabetic or alphanumeric input selection indicators in each non-overlapping zone is a jumper selector, and wherein the number of non-overlapping zones is less than the number of individual alphabetic or alphanumeric input selection indicators of the input selection device; a jumper choosing device configured to receive a user indication of two or more jumper selectors, wherein each jumper selector selects a non-overlapping zone; and a collection device configured to determine two or more sets of alphabetic or alphanumeric characters, wherein each set of alphabetic or alphanumeric characters is associated with one of the received two or more jumper selectors; a sequencing component configured to enter the two or more sets of alphabetic or alphanumeric characters as a sequence; and a parsing component configured to receive the sequence of two or more sets of alphabetic or alphanumeric characters and identify, without further user input, one or more suggested words from a dictionary, wherein the identifying is based on the sequence of two or more sets of alphabetic or alphanumeric characters. | 17. A system for data input comprising: an input selection device divided into multiple non-overlapping zones, each non-overlapping zone including two or more individual alphabetic or alphanumeric input selection indicators, wherein at least one of the alphabetic or alphanumeric input selection indicators in each non-overlapping zone is a jumper selector, and wherein the number of non-overlapping zones is less than the number of individual alphabetic or alphanumeric input selection indicators of the input selection device; a jumper choosing device configured to receive a user indication of two or more jumper selectors, wherein each jumper selector selects a non-overlapping zone; and a collection device configured to determine two or more sets of alphabetic or alphanumeric characters, wherein each set of alphabetic or alphanumeric characters is associated with one of the received two or more jumper selectors; a sequencing component configured to enter the two or more sets of alphabetic or alphanumeric characters as a sequence; and a parsing component configured to receive the sequence of two or more sets of alphabetic or alphanumeric characters and identify, without further user input, one or more suggested words from a dictionary, wherein the identifying is based on the sequence of two or more sets of alphabetic or alphanumeric characters. 21. The system of claim 17 , wherein the alphabetic or alphanumeric input selection indicators associated with each possible non-overlapping zone are predetermined. | 0.734628 |
8,935,199 | 1 | 11 | 1. A method for linking textual and physical concepts, comprising: extracting candidate phrases from a knowledge base for a physical device having physical components, the candidate phrases including noun phrases; generating a set of candidate concepts based on the extracted noun phrases; providing for a user to generate mapped concepts for physical components of the physical device by selecting, for each concept to be mapped, one of the physical components shown in a graphical representation of the physical device and at least one of the candidate concepts which is to be linked to that physical component, providing for a user to generate mapped concepts for actions associated with the physical components by selecting, for each concept to be mapped, an action shown in a graphical representation of the physical device and at least one of the candidate concepts for an action which is to be linked to that action, which are then stored in a mapped concept database, and storing the user-generated mapped concepts; and indexing the knowledge base based on the stored mapped concepts for physical components, whereby at least some of textual expressions in the knowledge base are linked to a respective physical component through one of the mapped concepts. | 1. A method for linking textual and physical concepts, comprising: extracting candidate phrases from a knowledge base for a physical device having physical components, the candidate phrases including noun phrases; generating a set of candidate concepts based on the extracted noun phrases; providing for a user to generate mapped concepts for physical components of the physical device by selecting, for each concept to be mapped, one of the physical components shown in a graphical representation of the physical device and at least one of the candidate concepts which is to be linked to that physical component, providing for a user to generate mapped concepts for actions associated with the physical components by selecting, for each concept to be mapped, an action shown in a graphical representation of the physical device and at least one of the candidate concepts for an action which is to be linked to that action, which are then stored in a mapped concept database, and storing the user-generated mapped concepts; and indexing the knowledge base based on the stored mapped concepts for physical components, whereby at least some of textual expressions in the knowledge base are linked to a respective physical component through one of the mapped concepts. 11. The method of claim 1 , wherein the knowledge base comprises a troubleshooting knowledge base which includes a set of cases, each case including a problem with the device and at least one known solution for that problem and wherein the candidate phrases are extracted from at least one of the problems and the solutions. | 0.582474 |
9,075,601 | 11 | 17 | 11. A computer program product, comprising: a non-transitory computer readable storage medium having computer readable program code comprising a scripting engine embodied in the medium, the computer readable program code comprising: computer readable program code to expose internal data of a software application responsive to code injection of the scripting engine into a runtime environment associated with the software application, wherein the code injection allows execution of code based on a different programming language than the software application and the scripting engine comprises an interpreter written in a same programming language as the software application; and computer readable program code to load a script in accordance with the internal data that was exposed, wherein the script is based on a different programming language than the software application and is interpretable by the scripting engine for execution with existing code of the software application to alter operation thereof. | 11. A computer program product, comprising: a non-transitory computer readable storage medium having computer readable program code comprising a scripting engine embodied in the medium, the computer readable program code comprising: computer readable program code to expose internal data of a software application responsive to code injection of the scripting engine into a runtime environment associated with the software application, wherein the code injection allows execution of code based on a different programming language than the software application and the scripting engine comprises an interpreter written in a same programming language as the software application; and computer readable program code to load a script in accordance with the internal data that was exposed, wherein the script is based on a different programming language than the software application and is interpretable by the scripting engine for execution with existing code of the software application to alter operation thereof. 17. The computer program product of claim 11 , wherein the software application is a first software application, and further comprising: computer readable program code to discover a second software application having the scripting engine injected into a runtime environment thereof, wherein the script comprises computer readable program code to provide an output of the execution to the second software application. | 0.5 |
10,152,575 | 1 | 3 | 1. A method comprising: receiving a protocol associated with a particular medical condition, the protocol comprising a set of events to occur in treatment of the medical condition; selecting a subset of the events of the protocol to be adherence objects of an adherence path; determining a time frame predicate for each adherence object of the adherence path, the time frame predicate indicating a time frame during which an event related to the adherence object is to be performed; determining an object predicate for each adherence object of the adherence path, the object predicate indicating one or more codes of an electronic health record system associated with an event related to the adherence object, the electronic health record system storing medical information related to a medical entity, wherein a protocol specific adherence object is an adherence object of the adherence path of the protocol that was performed for treatment related to the protocol during the time frame indicated in the time frame predicate; receiving a medical condition identifier indicating a medical condition, a treatment time frame identifier indicating a time frame during which treatment is to be performed, and a medical entity identifier identifying the medical entity; retrieving patient information from medical records of patients of the medical entity, the patients having received treatment related to the medical condition during the treatment time frame, the patient information indicating events related to treatment, the events being at least a sub-subset of the subset of the events of the protocol; for each patient, using that patient's patient information; for each protocol specific adherence object that includes at least one code from the patient's patient information in the object predicate, generating a patient adherence object score, the patient adherence object score indicating whether the adherence object was performed; generating a medical entity adherence score for the medical entity based on the patient adherence object scores, the medical entity adherence score indicating that medical entity's compliance with the adherence path; and generating a report indicating the medical entity adherence score. | 1. A method comprising: receiving a protocol associated with a particular medical condition, the protocol comprising a set of events to occur in treatment of the medical condition; selecting a subset of the events of the protocol to be adherence objects of an adherence path; determining a time frame predicate for each adherence object of the adherence path, the time frame predicate indicating a time frame during which an event related to the adherence object is to be performed; determining an object predicate for each adherence object of the adherence path, the object predicate indicating one or more codes of an electronic health record system associated with an event related to the adherence object, the electronic health record system storing medical information related to a medical entity, wherein a protocol specific adherence object is an adherence object of the adherence path of the protocol that was performed for treatment related to the protocol during the time frame indicated in the time frame predicate; receiving a medical condition identifier indicating a medical condition, a treatment time frame identifier indicating a time frame during which treatment is to be performed, and a medical entity identifier identifying the medical entity; retrieving patient information from medical records of patients of the medical entity, the patients having received treatment related to the medical condition during the treatment time frame, the patient information indicating events related to treatment, the events being at least a sub-subset of the subset of the events of the protocol; for each patient, using that patient's patient information; for each protocol specific adherence object that includes at least one code from the patient's patient information in the object predicate, generating a patient adherence object score, the patient adherence object score indicating whether the adherence object was performed; generating a medical entity adherence score for the medical entity based on the patient adherence object scores, the medical entity adherence score indicating that medical entity's compliance with the adherence path; and generating a report indicating the medical entity adherence score. 3. The method of claim 1 , further comprising generating, for each patient, a patient adherence path score based on a number of adherence objects that were performed relative to that particular patient in comparison to all adherence objects of the adherence path, wherein the medical entity adherence score for the medical entity is based on an average of the patient adherence path scores. | 0.654867 |
9,411,781 | 1 | 3 | 1. A non-transitory computer-readable storage media having instructions, stored thereon, the instructions operable to cause a data processing apparatus to: display formatted content from a source document to a user; receive from the user an input selecting a portion of the displayed formatted content and identifying the selected portion as a logical record within the source document; generate from the selected portion one or more style definitions, each style definition defining a corresponding style in terms of one or more contiguous fields of the selected portion and in terms of one or more rules, each field being defined with a count of a specified number of occurrences of a respective unit of formatted content in the selected portion, each rule based on formatting values or content values or structure values that are associated with a respective unit of formatted content of at least one of the fields, each style definition matching the entire selected portion and configured to apply to multiple logical records of a target document, and wherein applying the style definition to the target document comprises (i) determining, for each field of the style definition, whether the specified number of occurrences of the field's respective content unit structure is present among the logical records of the target document and (ii) applying to the logical records of the target document formatting values or content values or structure values according to the rules of the style definition; present one or more samples that match a user-selected style definition, each sample having a boundary at a beginning and a boundary at an end of the sample; receive a user input to change a boundary of a first sample of the one or more samples presented to the user; use the changed boundary to redefine a style definition corresponding to the first sample; and use the changed boundary to generate a new style definition corresponding to the first sample. | 1. A non-transitory computer-readable storage media having instructions, stored thereon, the instructions operable to cause a data processing apparatus to: display formatted content from a source document to a user; receive from the user an input selecting a portion of the displayed formatted content and identifying the selected portion as a logical record within the source document; generate from the selected portion one or more style definitions, each style definition defining a corresponding style in terms of one or more contiguous fields of the selected portion and in terms of one or more rules, each field being defined with a count of a specified number of occurrences of a respective unit of formatted content in the selected portion, each rule based on formatting values or content values or structure values that are associated with a respective unit of formatted content of at least one of the fields, each style definition matching the entire selected portion and configured to apply to multiple logical records of a target document, and wherein applying the style definition to the target document comprises (i) determining, for each field of the style definition, whether the specified number of occurrences of the field's respective content unit structure is present among the logical records of the target document and (ii) applying to the logical records of the target document formatting values or content values or structure values according to the rules of the style definition; present one or more samples that match a user-selected style definition, each sample having a boundary at a beginning and a boundary at an end of the sample; receive a user input to change a boundary of a first sample of the one or more samples presented to the user; use the changed boundary to redefine a style definition corresponding to the first sample; and use the changed boundary to generate a new style definition corresponding to the first sample. 3. The non-transitory computer-readable storage media of claim 1 , further comprising instructions operable to cause the data processing apparatus to: define a style in terms of two or more contiguous fields, each field being defined in terms of a number of occurrences of a respective unit of formatted content. | 0.658643 |
9,547,641 | 7 | 8 | 7. The method of claim 1 , wherein the determined format of the generated target language narrative is the same as the determined format of the received source language text phrase. | 7. The method of claim 1 , wherein the determined format of the generated target language narrative is the same as the determined format of the received source language text phrase. 8. The method of claim 7 , wherein the determined format of both the received source language text phrase and the generated target language narrative includes at least a text color. | 0.5 |
8,165,982 | 16 | 17 | 16. A computer-readable medium, with instructions thereon which when processed cause a computer to: receive a rule definition, the rule definition including one or more rule components, each component including a reference to one or more values from which an inference is made when the rule is applied; receive input associating one or more rule components with one or more tag definitions that limit modifications by one or more rule administrators to the one or more associated rule components based on an administrator identity, the limiting of one or more rule component modifications with the one or more tag definitions including a tag definition specifying a subset of available rule component values from the one or more values defined in the rule definition, the tag definition including a verb that identifies how the tag modifies data of the available rule component values to form the subset of available rule component values; store the rule definition and the associations of tag definitions to the rule components in a data store; retrieve the rule definition and associated tag definitions from the data store as a function of a query including an identifier of a rule administrator; instantiate the rule definition in a rule editor user interface; modify user interface controls of rule components displayed in the rule editor user interface according to respective associated tag definitions to enforce the limits of the associated tag definitions on how rule components may be modified by the rule administrator. | 16. A computer-readable medium, with instructions thereon which when processed cause a computer to: receive a rule definition, the rule definition including one or more rule components, each component including a reference to one or more values from which an inference is made when the rule is applied; receive input associating one or more rule components with one or more tag definitions that limit modifications by one or more rule administrators to the one or more associated rule components based on an administrator identity, the limiting of one or more rule component modifications with the one or more tag definitions including a tag definition specifying a subset of available rule component values from the one or more values defined in the rule definition, the tag definition including a verb that identifies how the tag modifies data of the available rule component values to form the subset of available rule component values; store the rule definition and the associations of tag definitions to the rule components in a data store; retrieve the rule definition and associated tag definitions from the data store as a function of a query including an identifier of a rule administrator; instantiate the rule definition in a rule editor user interface; modify user interface controls of rule components displayed in the rule editor user interface according to respective associated tag definitions to enforce the limits of the associated tag definitions on how rule components may be modified by the rule administrator. 17. The computer-readable medium of claim 16 , wherein a rule component of the rule definition includes an association to at least one tag definition. | 0.748322 |
8,996,532 | 13 | 18 | 13. A computer-implemented method of determining a root cause of an incident comprising: analyzing one or more change records based on text analytics using a dictionary and rules for the analysis in order to generate an index of analyzed data that represents the one or more change records, wherein the change records each include a change and corresponding time frame for occurrence of the change, and wherein the text analytics includes dictionaries based on one of an Unstructured Information Management Architecture (UIMA), an off-the-shelf text analytics suite, and a custom text analytics suite; applying information from a request for the root cause of the incident to the index of analyzed data to determine one or more change records with changes serving as one or more candidate causes for the incident, wherein applying the information includes: correlating the request with the changes of the one or more change records based on a time associated with the request being within a specified time interval of the corresponding time frame of occurrence of the changes of the one or more change records; and identifying the one or more candidate causes in the one or more change records as causes for the incident based on the correlation. | 13. A computer-implemented method of determining a root cause of an incident comprising: analyzing one or more change records based on text analytics using a dictionary and rules for the analysis in order to generate an index of analyzed data that represents the one or more change records, wherein the change records each include a change and corresponding time frame for occurrence of the change, and wherein the text analytics includes dictionaries based on one of an Unstructured Information Management Architecture (UIMA), an off-the-shelf text analytics suite, and a custom text analytics suite; applying information from a request for the root cause of the incident to the index of analyzed data to determine one or more change records with changes serving as one or more candidate causes for the incident, wherein applying the information includes: correlating the request with the changes of the one or more change records based on a time associated with the request being within a specified time interval of the corresponding time frame of occurrence of the changes of the one or more change records; and identifying the one or more candidate causes in the one or more change records as causes for the incident based on the correlation. 18. The method of claim 13 , wherein the index of analyzed data includes one or more of annotations referencing the one or more change records, extensible markup language (XML) representations of the one or more change records, and metadata configured to provide additional change record information. | 0.5 |
8,645,552 | 1 | 2 | 1. A method, comprising: storing one or more types of contact information for a plurality of organizations in a database; determining an access level for a request that includes a telecommunications identifier associated with an organization of the plurality of organizations, wherein the access level identifies which of the one or more types of contact information are accessible to the request; responding to the request with one or more types of contact information for the organization that are determined as accessible to the request based on the access level and the telecommunications identifier of the request; and displaying the one or more types of contact information for the organization, including an item, and indicating that an action is available for the item. | 1. A method, comprising: storing one or more types of contact information for a plurality of organizations in a database; determining an access level for a request that includes a telecommunications identifier associated with an organization of the plurality of organizations, wherein the access level identifies which of the one or more types of contact information are accessible to the request; responding to the request with one or more types of contact information for the organization that are determined as accessible to the request based on the access level and the telecommunications identifier of the request; and displaying the one or more types of contact information for the organization, including an item, and indicating that an action is available for the item. 2. The method of claim 1 , wherein said responding to the request with one or more types of contact information comprises interfacing with a software application. | 0.745283 |
8,954,940 | 18 | 19 | 18. The computer system of claim 17 wherein the one or more processors are further configured to: identify one or more syntactical issues associated with the software code text based upon, at least in part, one or more of parsing the software code text and applying a syntax-dependent tool to the representative model of the software code text. | 18. The computer system of claim 17 wherein the one or more processors are further configured to: identify one or more syntactical issues associated with the software code text based upon, at least in part, one or more of parsing the software code text and applying a syntax-dependent tool to the representative model of the software code text. 19. The computer system of claim 18 wherein the one or more processors are further configured to: provide an indicator of an error associated with the one or more transformations of the software code text. | 0.5 |
9,674,132 | 3 | 8 | 3. The method of claim 1 , wherein it is detected that the user is replying to multiple recipients of the first message, or is replying in the second operation mode, wherein the notification indicates that the message being composed will be sent to multiple recipients of the first message, or will be sent to a recipient that is not the original sender of the first message, or will not be sent only to the sender of the first message. | 3. The method of claim 1 , wherein it is detected that the user is replying to multiple recipients of the first message, or is replying in the second operation mode, wherein the notification indicates that the message being composed will be sent to multiple recipients of the first message, or will be sent to a recipient that is not the original sender of the first message, or will not be sent only to the sender of the first message. 8. The method of claim 3 , further comprising: providing a user interface object, wherein the user interface object allows the user to change to reply to only the sender of the first message by acting on the user interface object, or to automatically remove the multiple recipients of the first message from the recipient list. | 0.5 |
8,122,346 | 15 | 16 | 15. The system of claim 8 , wherein the second process modifies the software-level object content, receives second query message that includes the metadata associated with the software-level object, and provides the modified software-level object content to the first process in a second response message. | 15. The system of claim 8 , wherein the second process modifies the software-level object content, receives second query message that includes the metadata associated with the software-level object, and provides the modified software-level object content to the first process in a second response message. 16. The system of claim 15 , wherein the first process merges the modified software-level content and the document-level object into the output document, such that the modified software-level object content replaces the placeholder object in the output document. | 0.5 |
8,861,856 | 18 | 20 | 18. A non-transitory computer readable storage medium encoded with instructions for performing a computer-implemented method for determining a logical structure of a document, the computer-implemented method comprising: acquiring an image of the document; generating at least one document hypothesis for the image of the document, wherein said generating includes referencing a plurality of document models, wherein each document model describes one or more possible logical structures in the image of the document; selecting programmatically as an acceptable document hypothesis the document hypothesis that has an acceptable correspondence with the image of the document; and forming a representation of the document based on the acceptable document hypothesis. | 18. A non-transitory computer readable storage medium encoded with instructions for performing a computer-implemented method for determining a logical structure of a document, the computer-implemented method comprising: acquiring an image of the document; generating at least one document hypothesis for the image of the document, wherein said generating includes referencing a plurality of document models, wherein each document model describes one or more possible logical structures in the image of the document; selecting programmatically as an acceptable document hypothesis the document hypothesis that has an acceptable correspondence with the image of the document; and forming a representation of the document based on the acceptable document hypothesis. 20. The non-transitory computer readable storage medium of claim 18 , wherein each document model includes information about blocks of said respective model, and wherein the instructions further comprise: after said acquiring the image of the document: identifying one or more blocks in the image of the document; generating at least one block hypothesis corresponding to at least one of said identified one or more blocks in the image of the document; and for each document hypothesis, selecting an acceptable block hypothesis for each block. | 0.5 |
8,706,723 | 20 | 21 | 20. A computer-implemented method comprising: receiving, from a user, a portion of a personal name, the portion comprising three or more characters of a first name, a nickname, a middle name or a last name; converting the portion to a normalized portion by reducing the three or more characters to their simplest equivalents; permuting the normalized portion to identify one or more permutations thereof having a Damerau-Levenshtein distance of one; searching a main index to identify one or more first keys matching the normalized portion or the one or more permutations; searching a phonetic index to identify one or more second keys matching the normalized portion or the one or more permutations; compiling a first plurality of suggested matches, the first plurality of suggested matches comprising the union of indexed items corresponding to the one or more first keys and indexed items corresponding to the one or more second keys; and presenting, to the user, at least a portion of the first plurality of suggested matches. | 20. A computer-implemented method comprising: receiving, from a user, a portion of a personal name, the portion comprising three or more characters of a first name, a nickname, a middle name or a last name; converting the portion to a normalized portion by reducing the three or more characters to their simplest equivalents; permuting the normalized portion to identify one or more permutations thereof having a Damerau-Levenshtein distance of one; searching a main index to identify one or more first keys matching the normalized portion or the one or more permutations; searching a phonetic index to identify one or more second keys matching the normalized portion or the one or more permutations; compiling a first plurality of suggested matches, the first plurality of suggested matches comprising the union of indexed items corresponding to the one or more first keys and indexed items corresponding to the one or more second keys; and presenting, to the user, at least a portion of the first plurality of suggested matches. 21. The method of claim 20 , further comprising receiving, from the user, a second portion of the personal name, the second portion being adjacent to and received after the first portion, the second portion comprising one or more characters, the first and second portions collectively forming a string of characters. | 0.5 |
8,332,383 | 1 | 14 | 1. A system to process a data search request, the system including: a query controller module to receive, via an interface of a computer system, the data search request, the data search request including a plurality of constraints corresponding to a query; a search engine to perform a search of a data source based on the data search request to find and count a number of data items; a reduced constraint builder module to formulate, within the computer system, a plurality of search definitions, in response to an identification of the number of data items in excess of a predetermined threshold minimum number of data items, wherein each search definition of a subset of the plurality of constraints is formulated to exclude at least one constraint; wherein the search engine is configured to perform a plurality of searches of the data source for each of the plurality of search definitions to generate a plurality of search results corresponding to each search definition, and to utilize the plurality of search results to calculate, within the computer system, a corresponding data item count for each search definition; and wherein the query controller module is configured to communicate, via the interface of the computer system, the count of data items for the each search definition, the plurality of search definitions, and the number of data items corresponding to the data search request to a client machine for simultaneous display. | 1. A system to process a data search request, the system including: a query controller module to receive, via an interface of a computer system, the data search request, the data search request including a plurality of constraints corresponding to a query; a search engine to perform a search of a data source based on the data search request to find and count a number of data items; a reduced constraint builder module to formulate, within the computer system, a plurality of search definitions, in response to an identification of the number of data items in excess of a predetermined threshold minimum number of data items, wherein each search definition of a subset of the plurality of constraints is formulated to exclude at least one constraint; wherein the search engine is configured to perform a plurality of searches of the data source for each of the plurality of search definitions to generate a plurality of search results corresponding to each search definition, and to utilize the plurality of search results to calculate, within the computer system, a corresponding data item count for each search definition; and wherein the query controller module is configured to communicate, via the interface of the computer system, the count of data items for the each search definition, the plurality of search definitions, and the number of data items corresponding to the data search request to a client machine for simultaneous display. 14. The system of claim 1 , including a query builder module that determines whether the search request includes a predetermined threshold maximum number of constraints, and wherein the reduced constraints builder module formulates the plurality of search definitions if the number of constraints does not exceed the predetermined threshold maximum number of constraints. | 0.5 |
8,050,929 | 4 | 5 | 4. The system of claim 3 , wherein the decision circuit is configured to dynamically select the set of predictions including generating ranked predictions by ordering the plurality of predictions according to descending probability. | 4. The system of claim 3 , wherein the decision circuit is configured to dynamically select the set of predictions including generating ranked predictions by ordering the plurality of predictions according to descending probability. 5. The system of claim 4 , wherein the decision circuit is configured to dynamically select the set of predictions by determining a sequential pair of predictions in the ranked predictions between which the difference in corresponding probabilities is greatest relative to any other sequential pair of predictions, wherein the sequential pair of predictions include a first prediction and a second prediction, the first prediction having a higher probability than the second prediction. | 0.5 |
8,447,610 | 5 | 6 | 5. Apparatus for use with a speech-enabled application, the apparatus comprising: a memory storing a plurality of processor-executable instructions; and at least one processor, operatively coupled to the memory, configured to execute the instructions to: receive from the speech-enabled application, input comprising a plurality of text strings; identify a first portion of a first text string of the plurality of text strings that differs from a corresponding first portion of a second text string of the plurality of text strings, and a second portion of the first text string that does not differ from a corresponding second portion of the second text string; assign contrastive stress to the identified first portion of the first text string, but not to the identified second portion of the first text string; generate speech synthesis output corresponding to the plurality of text strings, the speech synthesis output identifying a plurality of audio recordings to render the plurality of text strings as speech, at least one of the plurality of audio recordings being selected to render the first portion of the first text string as speech carrying contrastive stress, to contrast with the rendering of the second text string; and provide the speech synthesis output for the speech-enabled application. | 5. Apparatus for use with a speech-enabled application, the apparatus comprising: a memory storing a plurality of processor-executable instructions; and at least one processor, operatively coupled to the memory, configured to execute the instructions to: receive from the speech-enabled application, input comprising a plurality of text strings; identify a first portion of a first text string of the plurality of text strings that differs from a corresponding first portion of a second text string of the plurality of text strings, and a second portion of the first text string that does not differ from a corresponding second portion of the second text string; assign contrastive stress to the identified first portion of the first text string, but not to the identified second portion of the first text string; generate speech synthesis output corresponding to the plurality of text strings, the speech synthesis output identifying a plurality of audio recordings to render the plurality of text strings as speech, at least one of the plurality of audio recordings being selected to render the first portion of the first text string as speech carrying contrastive stress, to contrast with the rendering of the second text string; and provide the speech synthesis output for the speech-enabled application. 6. The apparatus of claim 5 , wherein the at least one processor is configured to execute the instructions to identify the first portion of the first text string that differs from the corresponding first portion of the second text string based at least in part on a normalized orthography of the first and second text strings. | 0.5 |
9,948,680 | 1 | 5 | 1. A method comprising: parsing, by a network appliance configuration converter, network security policies of an input configuration file of a first network appliance to intermediate representations, wherein the network security policies of the input configuration file are expressed in a first language and the intermediate representations are general data structures for describing the network security policies wherein each of the intermediate representations comprises a syntax tree; optimizing, by the network appliance configuration converter, the network security policies contained in the intermediate representations by: performing an audit of security policies within the intermediate representation, wherein the audit includes one or more of: checking those of the security policies, if any, including an Internet Protocol (IP) address that is specified as ANY; checking those of the security policies, if any, including a port specified as ANY; checking those of the security policies, if any, having a range of IP addresses exceeding a pre-determined threshold; checking those of the security policies, if any, having a range of ports exceeding a pre-determined threshold; checking those of the security policies, if any, that allow access to one or more of a pre-determined set of ports of an internal network; and checking those of the security policies, if any, that allow access to one or more services of the internal network from an external network or a demilitarized zone (DMZ); and Denying access to a network if a potential leakage found in the security policies of the intermediate representations during the auditing step; converting, if the auditing step is successful, by the network appliance configuration converter, the intermediate representations to security policies of an output configuration file expressed in a second language. | 1. A method comprising: parsing, by a network appliance configuration converter, network security policies of an input configuration file of a first network appliance to intermediate representations, wherein the network security policies of the input configuration file are expressed in a first language and the intermediate representations are general data structures for describing the network security policies wherein each of the intermediate representations comprises a syntax tree; optimizing, by the network appliance configuration converter, the network security policies contained in the intermediate representations by: performing an audit of security policies within the intermediate representation, wherein the audit includes one or more of: checking those of the security policies, if any, including an Internet Protocol (IP) address that is specified as ANY; checking those of the security policies, if any, including a port specified as ANY; checking those of the security policies, if any, having a range of IP addresses exceeding a pre-determined threshold; checking those of the security policies, if any, having a range of ports exceeding a pre-determined threshold; checking those of the security policies, if any, that allow access to one or more of a pre-determined set of ports of an internal network; and checking those of the security policies, if any, that allow access to one or more services of the internal network from an external network or a demilitarized zone (DMZ); and Denying access to a network if a potential leakage found in the security policies of the intermediate representations during the auditing step; converting, if the auditing step is successful, by the network appliance configuration converter, the intermediate representations to security policies of an output configuration file expressed in a second language. 5. The method of claim 1 , further comprising creating, by the network appliance configuration converter, a conversion rule for converting an original security policy of the first language to a security policy of the second language without generating a policy fragment. | 0.871673 |
9,530,417 | 1 | 10 | 1. A method of text independent speaker recognition, comprising: extracting feature vectors from initial frames of speech generated responsive to text-independent speech from a user; clustering the extracted feature vectors to generate a plurality of clusters; modelling each of the plurality of clusters as a Gaussian Mixture Model that collectively form a speaker profile for the user; setting a different-state transition probability and a same-state transition probability for each of the Gaussian Mixture Models, the same-state transition probability having a much greater value than the different-state transition probability; capturing additional frames of speech from additional text-independent speech from a speaker; extracting feature vectors from the additional frames; and determining likelihoods that each of the additional frames belongs to each of the Gaussian Mixture Models based on the same-state and different-state transition probabilities, wherein the determining likelihoods includes, for each additional frame of speech, determining a log likelihood (loglk) variable for each cluster to determine the probability that the additional frame of speech belongs to that particular cluster; and determining whether the speaker is an authorized user from the determined likelihoods. | 1. A method of text independent speaker recognition, comprising: extracting feature vectors from initial frames of speech generated responsive to text-independent speech from a user; clustering the extracted feature vectors to generate a plurality of clusters; modelling each of the plurality of clusters as a Gaussian Mixture Model that collectively form a speaker profile for the user; setting a different-state transition probability and a same-state transition probability for each of the Gaussian Mixture Models, the same-state transition probability having a much greater value than the different-state transition probability; capturing additional frames of speech from additional text-independent speech from a speaker; extracting feature vectors from the additional frames; and determining likelihoods that each of the additional frames belongs to each of the Gaussian Mixture Models based on the same-state and different-state transition probabilities, wherein the determining likelihoods includes, for each additional frame of speech, determining a log likelihood (loglk) variable for each cluster to determine the probability that the additional frame of speech belongs to that particular cluster; and determining whether the speaker is an authorized user from the determined likelihoods. 10. The method of claim 1 , wherein clustering the extracted feature vectors to generate a plurality of clusters that collectively represent a speaker profile comprises clustering the feature vectors using a K-means clustering algorithm. | 0.684 |
9,538,252 | 8 | 9 | 8. A method for transcribing dialog associated with moving image content, the method comprising: storing, in a provider computer system including at least one electronic processor and at least one data storage device, a master version of moving image content; providing access to a copy of the master version of the moving image content by multiple client devices associated with multiple transcribers, wherein each client device includes at least one electronic processor and at least one data storage device; receiving, in the provider computer system, a request to transcribe the dialog associated with the master version of the moving image content; transmitting an interface to at least one of the multiple client devices, wherein the interface is programmed with instructions for: (i) requesting the copy of the master version of the moving image content from the provider computer system, (ii) interactively playing the moving image content, (iii) receiving input data representative of a transcription of the dialog associated with the master version of the moving image content, and (iv) receiving input data indicative of at least one starting time-stamp and at least one ending time-stamp for at least one segment of multiple segments of the transcription; receiving, in the provider computer system, the transcription of the at least one segment of the multiple segments, and the input data indicative of the at least one starting time-stamp and the at least one ending time-stamp for the at least one segment of the multiple segments of the transcription of the dialog associated with the master version of the moving image content; and storing, in the provider computer system, the transcription together with the starting and ending time-stamps for each segment of the multiple segments as a copy of the master version of the moving image content being reclassified as transcribed and time-stamped. | 8. A method for transcribing dialog associated with moving image content, the method comprising: storing, in a provider computer system including at least one electronic processor and at least one data storage device, a master version of moving image content; providing access to a copy of the master version of the moving image content by multiple client devices associated with multiple transcribers, wherein each client device includes at least one electronic processor and at least one data storage device; receiving, in the provider computer system, a request to transcribe the dialog associated with the master version of the moving image content; transmitting an interface to at least one of the multiple client devices, wherein the interface is programmed with instructions for: (i) requesting the copy of the master version of the moving image content from the provider computer system, (ii) interactively playing the moving image content, (iii) receiving input data representative of a transcription of the dialog associated with the master version of the moving image content, and (iv) receiving input data indicative of at least one starting time-stamp and at least one ending time-stamp for at least one segment of multiple segments of the transcription; receiving, in the provider computer system, the transcription of the at least one segment of the multiple segments, and the input data indicative of the at least one starting time-stamp and the at least one ending time-stamp for the at least one segment of the multiple segments of the transcription of the dialog associated with the master version of the moving image content; and storing, in the provider computer system, the transcription together with the starting and ending time-stamps for each segment of the multiple segments as a copy of the master version of the moving image content being reclassified as transcribed and time-stamped. 9. The method of claim 8 , further comprising receiving, in the provider computer system from at least one of the multiple client devices, a request to time-stamp a transcription of the dialog associated with the master version of the moving image content. | 0.5 |
9,318,128 | 1 | 5 | 1. A method comprising: receiving, at a computing device, information indicating a plurality of actions that a given application is configured to perform, wherein the information indicating each respective action of the plurality of actions includes one or more parameters that are used to enable the given application to perform the respective action; receiving, at the computing device, for each respective action, one or more example instructions that, when recognized by the given application, causes the given application to perform the respective action, wherein the one or more example instructions comprise natural language; based on the one or more example instructions for each respective action, the plurality of actions, and the one or more parameters included for each respective action, the computing device determining a plurality of candidate instructions for each respective action that, when recognized by a voice interface of the given application, causes the given application to perform the respective action, wherein each candidate instruction of the plurality of candidate instructions comprises one or more grammars recognizable by the voice interface of the given application; receiving, at the computing device, a plurality of acceptance information comprising, for each candidate instruction, respective acceptance information indicative of whether the candidate instruction is applicable to the respective action, wherein the plurality of acceptance information indicates, for each respective action of at least one of the plurality of actions, that at least one of the plurality of candidate instructions determined for the respective action is rejected; based on the plurality of acceptance information, storing, at the computing device, for each candidate instruction, a respective identifier associated with the candidate instruction and indicative of whether the candidate instruction is rejected; the computing device comparing at least a portion of the respective acceptance information with a stored acceptance information log so as to determine a correlation between the respective acceptance information and the stored acceptance information log, wherein the stored acceptance information log comprises a plurality of predetermined acceptance information associated with a plurality of predetermined example instructions; and based on the correlation, the computing device referring to the stored identifiers to determine a set of instructions that are recognizable by the voice interface and that, when recognized by the voice interface, causes the given application to perform one or more of the plurality of actions, wherein determining the set of instructions comprises, for each respective action, (i) selecting, based on the stored identifiers, one or more of the plurality of candidate instructions for the respective action to be included in the set of instructions and (ii) selecting, based on the stored identifiers, the at least one rejected candidate instruction for the respective action to not be included in the set of instructions and to not be recognizable by the voice interface to cause the given application to perform the respective action. | 1. A method comprising: receiving, at a computing device, information indicating a plurality of actions that a given application is configured to perform, wherein the information indicating each respective action of the plurality of actions includes one or more parameters that are used to enable the given application to perform the respective action; receiving, at the computing device, for each respective action, one or more example instructions that, when recognized by the given application, causes the given application to perform the respective action, wherein the one or more example instructions comprise natural language; based on the one or more example instructions for each respective action, the plurality of actions, and the one or more parameters included for each respective action, the computing device determining a plurality of candidate instructions for each respective action that, when recognized by a voice interface of the given application, causes the given application to perform the respective action, wherein each candidate instruction of the plurality of candidate instructions comprises one or more grammars recognizable by the voice interface of the given application; receiving, at the computing device, a plurality of acceptance information comprising, for each candidate instruction, respective acceptance information indicative of whether the candidate instruction is applicable to the respective action, wherein the plurality of acceptance information indicates, for each respective action of at least one of the plurality of actions, that at least one of the plurality of candidate instructions determined for the respective action is rejected; based on the plurality of acceptance information, storing, at the computing device, for each candidate instruction, a respective identifier associated with the candidate instruction and indicative of whether the candidate instruction is rejected; the computing device comparing at least a portion of the respective acceptance information with a stored acceptance information log so as to determine a correlation between the respective acceptance information and the stored acceptance information log, wherein the stored acceptance information log comprises a plurality of predetermined acceptance information associated with a plurality of predetermined example instructions; and based on the correlation, the computing device referring to the stored identifiers to determine a set of instructions that are recognizable by the voice interface and that, when recognized by the voice interface, causes the given application to perform one or more of the plurality of actions, wherein determining the set of instructions comprises, for each respective action, (i) selecting, based on the stored identifiers, one or more of the plurality of candidate instructions for the respective action to be included in the set of instructions and (ii) selecting, based on the stored identifiers, the at least one rejected candidate instruction for the respective action to not be included in the set of instructions and to not be recognizable by the voice interface to cause the given application to perform the respective action. 5. The method of claim 1 , wherein the respective acceptance information includes one or more of: an acceptance of the candidate instruction, a rejection of the candidate instruction, a confidence score of the candidate instruction, and a rank of the candidate instruction with respect to at least one other candidate instruction of the plurality of candidate instructions. | 0.694262 |
5,398,304 | 35 | 36 | 35. A method as claimed in claim 34 wherein the step of executing knowledge sources includes the step of interrupting execution of a lower priority knowledge source and executing a higher priority knowledge source in accordance with the knowledge source priority scheme. | 35. A method as claimed in claim 34 wherein the step of executing knowledge sources includes the step of interrupting execution of a lower priority knowledge source and executing a higher priority knowledge source in accordance with the knowledge source priority scheme. 36. A method as claimed in claim 35 wherein the step of executing knowledge sources further includes the step of, after the step of interrupting, determining whether an interrupted knowledge source should be rescheduled for execution. | 0.5 |
9,934,136 | 15 | 16 | 15. A non-transitory computer readable medium comprising instructions that when executed by a processor cause the processor to: receive a test application in an executable format, the test application including a plurality of forms; simulate the execution of the test application with the processor; iterate through each one of the plurality of forms of the test application; detect a field in at least one form of the plurality of forms; inspect a field included in the at least one form for metadata in the test application; generate, based on the metadata, at least one test case corresponding to the field; store the test case in a first format; and store the test case in a second format that is different from the first format. | 15. A non-transitory computer readable medium comprising instructions that when executed by a processor cause the processor to: receive a test application in an executable format, the test application including a plurality of forms; simulate the execution of the test application with the processor; iterate through each one of the plurality of forms of the test application; detect a field in at least one form of the plurality of forms; inspect a field included in the at least one form for metadata in the test application; generate, based on the metadata, at least one test case corresponding to the field; store the test case in a first format; and store the test case in a second format that is different from the first format. 16. The non-transitory computer readable medium of claim 15 , wherein the instructions further cause the processor to convert the test case from the first format to a second format. | 0.754743 |
8,051,045 | 1 | 5 | 1. A method comprising: identifying a data record for deletion from a database and storage in a data archive, the data record comprising a plurality of data record attributes, each of the plurality of data record attributes comprising a value that comprises at least one term; creating an archive record that comprises a first subset of attribute values of the plurality of data record attributes and an index record that comprises a second subset of attribute values of the plurality of data record attributes; storing the archive record in a data archive that is stored separately from the database; adding a reference to a location of the archive record in the data archive to the new index record; adding the new index record to a dictionary-based archive index that is stored separately from the database, the dictionary-based archive index comprising a plurality of index records and a dictionary, the adding of the index record to the dictionary-based archive index comprising identifying every term of the second subset of attribute values of the plurality of data record attributes and adding each of the terms to the dictionary except for those terms that are already in the dictionary, wherein at least one index record of the plurality of index records in the dictionary-based archive index comprises one term from terms stored in the dictionary, references to locations of multiple archive records in the data archive that contain the one term, and information regarding locations of the one term within the referenced multiple archive records, the location information including indications, for each of the multiple of archive records referenced by the at least one index record, respective attributes of the each of the multiple archive records in which the one term is found; deleting the data record from the database; determining whether an attribute value of the plurality of attribute values is required for frequent user read access; and if the attribute value is not required for frequent user read access, deleting the attribute value from the dictionary-based archive index. | 1. A method comprising: identifying a data record for deletion from a database and storage in a data archive, the data record comprising a plurality of data record attributes, each of the plurality of data record attributes comprising a value that comprises at least one term; creating an archive record that comprises a first subset of attribute values of the plurality of data record attributes and an index record that comprises a second subset of attribute values of the plurality of data record attributes; storing the archive record in a data archive that is stored separately from the database; adding a reference to a location of the archive record in the data archive to the new index record; adding the new index record to a dictionary-based archive index that is stored separately from the database, the dictionary-based archive index comprising a plurality of index records and a dictionary, the adding of the index record to the dictionary-based archive index comprising identifying every term of the second subset of attribute values of the plurality of data record attributes and adding each of the terms to the dictionary except for those terms that are already in the dictionary, wherein at least one index record of the plurality of index records in the dictionary-based archive index comprises one term from terms stored in the dictionary, references to locations of multiple archive records in the data archive that contain the one term, and information regarding locations of the one term within the referenced multiple archive records, the location information including indications, for each of the multiple of archive records referenced by the at least one index record, respective attributes of the each of the multiple archive records in which the one term is found; deleting the data record from the database; determining whether an attribute value of the plurality of attribute values is required for frequent user read access; and if the attribute value is not required for frequent user read access, deleting the attribute value from the dictionary-based archive index. 5. The method of claim 1 , wherein the second subset of attribute values is fully included within the first subset of attribute values. | 0.896947 |
8,594,285 | 1 | 10 | 1. A method for analyzing an electronic communication between a customer and a contact center, wherein the electronic communication is a telephonic communication, the method comprising: receiving a single telephonic communication between a first communicant to the telephonic communication and a second communicant to the telephonic communication; separating the telephonic communication into at least first and second constituent voice data, the first constituent voice data being generated by the first communicant and the second constituent voice data being generated by the second communicant; analyzing one of the separated first and second constituent voice data by mining the separated one of the first and second constituent voice data and applying a predetermined linguistic-based psychological behavioral model to the one of the separated first and second constituent voice data; and, generating behavioral assessment data including a personality type corresponding to the analyzed one of the separated first and second constituent voice data based on the step of analyzing one of the first and second constituent voice data. | 1. A method for analyzing an electronic communication between a customer and a contact center, wherein the electronic communication is a telephonic communication, the method comprising: receiving a single telephonic communication between a first communicant to the telephonic communication and a second communicant to the telephonic communication; separating the telephonic communication into at least first and second constituent voice data, the first constituent voice data being generated by the first communicant and the second constituent voice data being generated by the second communicant; analyzing one of the separated first and second constituent voice data by mining the separated one of the first and second constituent voice data and applying a predetermined linguistic-based psychological behavioral model to the one of the separated first and second constituent voice data; and, generating behavioral assessment data including a personality type corresponding to the analyzed one of the separated first and second constituent voice data based on the step of analyzing one of the first and second constituent voice data. 10. The method of claim 1 , further comprising the step of automatically generating a responsive communication to the telephonic communication based on the event data. | 0.903802 |
10,157,231 | 1 | 2 | 1. A system for monitoring electronic interactions with unique items and identifying and analyzing significant attributes of the unique items, the system comprising: one or more computer readable storage devices configured to store a plurality of computer executable instructions; and one or more hardware computer processors in communication with the one or more computer readable storage devices and configured to execute the plurality of computer executable instructions in order to cause the system to: generate user activity data by at least electronically communicating, over a computer network, with a plurality of user devices to receive monitoring data related to user interactions with unique items displayed by user interfaces of the plurality of user devices, wherein the monitoring data comprises position data related to a position of a unique item displayed by a user interface at a time of the user interaction; generate one or more driver models configured to enable identification of which of a plurality of attributes of a selected unique item are driver attributes and to enable determination of values associated with the driver attributes, the plurality of attributes comprising at least a condition attribute and a feature attribute, wherein generating the one or more driver models comprises: using the position data to reduce any position bias present in the monitoring data; and using one or more of the following methods: linear regression, non-linear regression, model trees, nearest neighbor analysis; receive selected item data, the selected item data being related to the plurality of attributes of the selected unique item; and apply one or more of the generated driver models to the selected item data to generate values associated with driver attributes of the selected unique item for use in generating recommendations of alternative unique items. | 1. A system for monitoring electronic interactions with unique items and identifying and analyzing significant attributes of the unique items, the system comprising: one or more computer readable storage devices configured to store a plurality of computer executable instructions; and one or more hardware computer processors in communication with the one or more computer readable storage devices and configured to execute the plurality of computer executable instructions in order to cause the system to: generate user activity data by at least electronically communicating, over a computer network, with a plurality of user devices to receive monitoring data related to user interactions with unique items displayed by user interfaces of the plurality of user devices, wherein the monitoring data comprises position data related to a position of a unique item displayed by a user interface at a time of the user interaction; generate one or more driver models configured to enable identification of which of a plurality of attributes of a selected unique item are driver attributes and to enable determination of values associated with the driver attributes, the plurality of attributes comprising at least a condition attribute and a feature attribute, wherein generating the one or more driver models comprises: using the position data to reduce any position bias present in the monitoring data; and using one or more of the following methods: linear regression, non-linear regression, model trees, nearest neighbor analysis; receive selected item data, the selected item data being related to the plurality of attributes of the selected unique item; and apply one or more of the generated driver models to the selected item data to generate values associated with driver attributes of the selected unique item for use in generating recommendations of alternative unique items. 2. The system of claim 1 , wherein the selected unique item comprises one of the following types of items: used automobiles, existing homes, real estate, household goods, customized electronics, customized goods. | 0.839637 |
8,433,559 | 8 | 14 | 8. A system comprising: one or more processors; one or more data remembrance components; a specification that is stored in said one or more data remembrance components, said specification comprising: a data expression that defines a plurality of phrase sets; a code expression that defines a first container that specifies a combination that comprises a first one of said phrase sets, a second one of said phrase sets, and a second container that comprises a third one of said phrase sets and a fourth one of said phrase sets; and a map set and an equivalence set that maps a plurality of phrases to a first phrase based on misspellings and equivalent phrases, said phrase analyzer encountering one of said plurality of phrases in said input stream and, based on said map set, converting said one of said plurality of phrases to said first phrase when determining whether said input stream matches said first container; and a phrase analyzer that executes on said one or more processors, that receives said specification and an input stream, that compares words in said input stream to said first container, and that generates a report that identifies where, in said input stream, a match between said first container and said input stream is found, said first container comprising a switch that branches between a plurality of match labels, said phrase analyzer labeling a portion of said input stream that matches said first container as a first label if said portion matches said first phrase set, or being labeled as a second match if said context matches said second phrase set, wherein a container represents the various ways in which possible phrase sets may be combined as part of a text pattern to be matched such that the context moves forward after a match has been found between the container and a sequence of words in the input stream and a next container is processed after a location of the matching sequence of words. | 8. A system comprising: one or more processors; one or more data remembrance components; a specification that is stored in said one or more data remembrance components, said specification comprising: a data expression that defines a plurality of phrase sets; a code expression that defines a first container that specifies a combination that comprises a first one of said phrase sets, a second one of said phrase sets, and a second container that comprises a third one of said phrase sets and a fourth one of said phrase sets; and a map set and an equivalence set that maps a plurality of phrases to a first phrase based on misspellings and equivalent phrases, said phrase analyzer encountering one of said plurality of phrases in said input stream and, based on said map set, converting said one of said plurality of phrases to said first phrase when determining whether said input stream matches said first container; and a phrase analyzer that executes on said one or more processors, that receives said specification and an input stream, that compares words in said input stream to said first container, and that generates a report that identifies where, in said input stream, a match between said first container and said input stream is found, said first container comprising a switch that branches between a plurality of match labels, said phrase analyzer labeling a portion of said input stream that matches said first container as a first label if said portion matches said first phrase set, or being labeled as a second match if said context matches said second phrase set, wherein a container represents the various ways in which possible phrase sets may be combined as part of a text pattern to be matched such that the context moves forward after a match has been found between the container and a sequence of words in the input stream and a next container is processed after a location of the matching sequence of words. 14. The system of claim 8 , wherein said second container comprises a LIST container, wherein said phrase determines that input stream comprises a context that comprises an instance of said third one of said phrase sets and subsequently determines whether said context comprises instances of all other elements in said second container, said context matching said first container as long as said context comprises said first phrase set, said second phrase set, and an instance of at least one of the elements in said second container. | 0.510092 |
8,478,794 | 1 | 14 | 1. A user-interface method of selecting and presenting a collection of content items in which the presentation is ordered at least in part based on learned user preferences, the method comprising: providing access to a set of content items, each content item having at least one associated descriptive term to describe the content item; receiving incremental input entered by the user for incrementally identifying desired content items; in response to the incremental input entered by the user, presenting a subset of content items; receiving selection actions of content items of the subset from the user; analyzing the descriptive terms associated with the selected content items to learn the preferred descriptive terms of the user; expressing the learned preferred descriptive terms as a segmented measurement collection having at least one coarse grain segment, wherein the coarse grain segment has relatively coarse grain differentiation of measurements associated with preferred descriptive terms within the segment, wherein the coarse grain segment includes at least two measurement groups, each measurement group having a preselected range of measurement values that determine which measurements are in the measurement group so that any measurements in a particular measurement group are not differentiated from other measurements in the same group, and wherein the measurements in different measurement groups are differentiated from each other; and in response to receiving subsequent incremental input entered by the user, selecting and ordering a collection of content items by promoting the ranking of content items associated with the learned preferred descriptive terms of the user according to the differentiation provided by the segmented measurement collection; wherein at least one of the incremental input and the subsequent incremental input are entered by the user on an input constrained device. | 1. A user-interface method of selecting and presenting a collection of content items in which the presentation is ordered at least in part based on learned user preferences, the method comprising: providing access to a set of content items, each content item having at least one associated descriptive term to describe the content item; receiving incremental input entered by the user for incrementally identifying desired content items; in response to the incremental input entered by the user, presenting a subset of content items; receiving selection actions of content items of the subset from the user; analyzing the descriptive terms associated with the selected content items to learn the preferred descriptive terms of the user; expressing the learned preferred descriptive terms as a segmented measurement collection having at least one coarse grain segment, wherein the coarse grain segment has relatively coarse grain differentiation of measurements associated with preferred descriptive terms within the segment, wherein the coarse grain segment includes at least two measurement groups, each measurement group having a preselected range of measurement values that determine which measurements are in the measurement group so that any measurements in a particular measurement group are not differentiated from other measurements in the same group, and wherein the measurements in different measurement groups are differentiated from each other; and in response to receiving subsequent incremental input entered by the user, selecting and ordering a collection of content items by promoting the ranking of content items associated with the learned preferred descriptive terms of the user according to the differentiation provided by the segmented measurement collection; wherein at least one of the incremental input and the subsequent incremental input are entered by the user on an input constrained device. 14. The method of claim 1 , wherein the set of content items is contained on at least one of a cable television system, a video-on-demand system, an IPTV system, and a personal video recorder. | 0.900724 |
8,712,850 | 32 | 41 | 32. A computer-implemented method comprising: receiving, using one or more processors, a request for content, wherein the content is of a form of an advertisement; identifying an eligible advertisement from an inventory of advertisements; receiving a creative associated with the eligible advertisement wherein the creative includes a title, at least one line of additional text and optionally a reference portion; determining a portion of text from the at least one line of additional text to promote into the title including a portion beginning with text at a beginning of a first of the at least one line of additional text, wherein determining includes evaluating the at least one line of additional text to identify the portion; promoting, using the one or more processors, the portion of text into the title; adjusting a remainder of the creative based on the promoted portion; and providing the advertisement responsive to the request including providing the creative including the title with the promoted portion. | 32. A computer-implemented method comprising: receiving, using one or more processors, a request for content, wherein the content is of a form of an advertisement; identifying an eligible advertisement from an inventory of advertisements; receiving a creative associated with the eligible advertisement wherein the creative includes a title, at least one line of additional text and optionally a reference portion; determining a portion of text from the at least one line of additional text to promote into the title including a portion beginning with text at a beginning of a first of the at least one line of additional text, wherein determining includes evaluating the at least one line of additional text to identify the portion; promoting, using the one or more processors, the portion of text into the title; adjusting a remainder of the creative based on the promoted portion; and providing the advertisement responsive to the request including providing the creative including the title with the promoted portion. 41. The method of claim 32 wherein promoting the portion of text includes constructing a link for the title after promotion. | 0.8 |
9,864,781 | 2 | 3 | 2. The computing device of claim 1 , wherein the at least one search term is personal to the single user. | 2. The computing device of claim 1 , wherein the at least one search term is personal to the single user. 3. The computing device of claim 2 , wherein the at least one search term was entered but subsequently deleted prior to submission. | 0.5 |
8,548,257 | 19 | 23 | 19. A computer program product, encoded on a non-transitory computer-readable medium, operable to cause data processing apparatus to perform operations comprising: accessing an image that includes a candidate face; generating a sharpness measure based on image data corresponding to the candidate face; evaluating the sharpness measure to determine a confidence score representing a likelihood that the candidate face corresponds to a human face; and accepting the candidate face when the confidence score compares in a predetermined manner to a confidence threshold. | 19. A computer program product, encoded on a non-transitory computer-readable medium, operable to cause data processing apparatus to perform operations comprising: accessing an image that includes a candidate face; generating a sharpness measure based on image data corresponding to the candidate face; evaluating the sharpness measure to determine a confidence score representing a likelihood that the candidate face corresponds to a human face; and accepting the candidate face when the confidence score compares in a predetermined manner to a confidence threshold. 23. The computer program product of claim 19 , further operable to cause data processing apparatus to perform operations comprising: sampling pixels corresponding to the candidate face in accordance with a pattern; and generating a skin tone measure based on the sampled pixels. | 0.768333 |
9,588,964 | 15 | 18 | 15. One or more computer-readable hardware storage media comprising instructions stored thereon that, responsive to execution by a computing device, causes the computing device to perform operations comprising: generating, at least partially in hardware of the computing device, a vocabulary for use in natural language processing for a particular one of a plurality of domains by: building an N-gram tree to represent frequency of occurrence of words in search results involving the particular domain, the search results obtained using a spreading activation algorithm constrained to the particular domain; selecting a set of the words based on the represented frequency of occurrence in the N-gram tree; and assigning a sense to each of the words in the set that identifies a part-of-speech of a respective said word, the sense reflecting, for each of the words, how each of the words are used in the particular domain of the plurality of domains. | 15. One or more computer-readable hardware storage media comprising instructions stored thereon that, responsive to execution by a computing device, causes the computing device to perform operations comprising: generating, at least partially in hardware of the computing device, a vocabulary for use in natural language processing for a particular one of a plurality of domains by: building an N-gram tree to represent frequency of occurrence of words in search results involving the particular domain, the search results obtained using a spreading activation algorithm constrained to the particular domain; selecting a set of the words based on the represented frequency of occurrence in the N-gram tree; and assigning a sense to each of the words in the set that identifies a part-of-speech of a respective said word, the sense reflecting, for each of the words, how each of the words are used in the particular domain of the plurality of domains. 18. One or more computer-readable hardware storage media as described in claim 15 , wherein the part-of-speech is a noun, verb, adjective, or adverb. | 0.742215 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.