patent_num
int64
3.93M
10.2M
claim_num1
int64
1
519
claim_num2
int64
2
520
sentence1
stringlengths
40
15.9k
sentence2
stringlengths
88
20k
label
float64
0.5
0.99
7,761,843
29
43
29. A tangible computer-readable medium having computer-executable instructions for implementing a method of creating computer code for a target programming language, the computer executable instructions comprising instructions for: defining a programming command as a predefined command sentence comprising at least one constant word and at least one enterable word, wherein the predefined command sentence comprises a structure other than a syntax of the target programming language and wherein the computer executable instructions for defining the programming command comprise instructions for: inserting a word into the programming command; deleting a word from the programming command; modifying a definition of a word of the programming command; and writing a translation procedure for the programming command; receiving data relating to an input value for the enterable word; and converting the predefined command sentence and the input value for the enterable word into a completed programming command.
29. A tangible computer-readable medium having computer-executable instructions for implementing a method of creating computer code for a target programming language, the computer executable instructions comprising instructions for: defining a programming command as a predefined command sentence comprising at least one constant word and at least one enterable word, wherein the predefined command sentence comprises a structure other than a syntax of the target programming language and wherein the computer executable instructions for defining the programming command comprise instructions for: inserting a word into the programming command; deleting a word from the programming command; modifying a definition of a word of the programming command; and writing a translation procedure for the programming command; receiving data relating to an input value for the enterable word; and converting the predefined command sentence and the input value for the enterable word into a completed programming command. 43. The tangible computer-readable medium having computer-executable instructions of claim 29 wherein the enterable word comprises a variable list word comprising two or more options with at least one option comprising an enterable word, and wherein the input value comprises an option selected from the variable list word, the computer executable instructions further comprising instructions for: providing an entry component corresponding to the enterable word of the selected option; and receiving data relating to an input value for the entry component corresponding to the enterable word of the selected option.
0.5
6,021,412
16
20
16. A method in a computer system for using a list of concept words to select and add a graphic image to a presentation document from among a plurality of graphic images said graphic image being associated with at least one concept in said list, the method including the steps of: (a) enabling a user to enter additional words into the presentation document; and (b) evaluating each additional word upon its entry to determine if it occurs in the list of concept words; and if a word that was entered occurs in the list of concept words: (i) identifying a graphic image associated with the word that occurs in said list, and (ii) adding the graphic image that was identified to the document.
16. A method in a computer system for using a list of concept words to select and add a graphic image to a presentation document from among a plurality of graphic images said graphic image being associated with at least one concept in said list, the method including the steps of: (a) enabling a user to enter additional words into the presentation document; and (b) evaluating each additional word upon its entry to determine if it occurs in the list of concept words; and if a word that was entered occurs in the list of concept words: (i) identifying a graphic image associated with the word that occurs in said list, and (ii) adding the graphic image that was identified to the document. 20. The method of claim 16, wherein the graphic image that was identified is an audio sequence.
0.907227
7,761,478
18
24
18. A computerized system for managing a semantic business model, the system comprising: at least one computing device including: a system configured to transform each business area model of a plurality of business area models for a business entity into a set of intermediate models, wherein each business area model is a business model for a particular area of the business entity, and wherein each intermediate model stores data for at least one corresponding business area model in a meta-modeling language that is the same for each intermediate model, and wherein the system configured to transform includes: a system configured to extract a set of business area sub-models from each business area model of the plurality of business area models; and a system configured to merge the sets of business area sub-models into the set of intermediate models; and a system configured to generate the semantic business model by merging the set of intermediate models, wherein system configured to merge includes: a system configured to automatically identify objects in the intermediate models and relationships for the objects, wherein the relationships for the objects are determined by parsing an attribute for a corresponding object into terms by performing at least one of the following: determining word boundaries in the attribute, expanding abbreviations in the attribute, or determining the context information for each term in the attribute, such that there is a relationship if there is a correlation between terms; and a system configured to add the objects and relationship information for the objects identified from the set of intermediate models to the semantic business model.
18. A computerized system for managing a semantic business model, the system comprising: at least one computing device including: a system configured to transform each business area model of a plurality of business area models for a business entity into a set of intermediate models, wherein each business area model is a business model for a particular area of the business entity, and wherein each intermediate model stores data for at least one corresponding business area model in a meta-modeling language that is the same for each intermediate model, and wherein the system configured to transform includes: a system configured to extract a set of business area sub-models from each business area model of the plurality of business area models; and a system configured to merge the sets of business area sub-models into the set of intermediate models; and a system configured to generate the semantic business model by merging the set of intermediate models, wherein system configured to merge includes: a system configured to automatically identify objects in the intermediate models and relationships for the objects, wherein the relationships for the objects are determined by parsing an attribute for a corresponding object into terms by performing at least one of the following: determining word boundaries in the attribute, expanding abbreviations in the attribute, or determining the context information for each term in the attribute, such that there is a relationship if there is a correlation between terms; and a system configured to add the objects and relationship information for the objects identified from the set of intermediate models to the semantic business model. 24. The system of claim 18 , the at least one computing device further including a system configured to provide the semantic business model for use by an analysis system.
0.579208
9,864,508
23
32
23. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with one or more processors and memory, cause the device to: receive an indication of a first input that includes movement of a contact detected on a touch-sensitive surface of a device, wherein: the movement of the contact comprises a first stroke, and the first stroke has a spatial component and a temporal component; determine a first probability that the first stroke corresponds to a first character based on the spatial component of the first stroke; determine a second probability that the first stroke corresponds to the first character based on the temporal component of the first stroke; determine an aggregate probability that the first stroke corresponds to the first character based on the first probability and the second probability; detect an end of the first stroke; and after detecting the end of the first stroke: detect at least a portion of a second stroke; and in response to detecting the portion of the second stroke and while the second stroke is still being detected, determine whether the first stroke and the second stroke correspond to a single character based on temporal information about the first stroke and the second stroke.
23. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with one or more processors and memory, cause the device to: receive an indication of a first input that includes movement of a contact detected on a touch-sensitive surface of a device, wherein: the movement of the contact comprises a first stroke, and the first stroke has a spatial component and a temporal component; determine a first probability that the first stroke corresponds to a first character based on the spatial component of the first stroke; determine a second probability that the first stroke corresponds to the first character based on the temporal component of the first stroke; determine an aggregate probability that the first stroke corresponds to the first character based on the first probability and the second probability; detect an end of the first stroke; and after detecting the end of the first stroke: detect at least a portion of a second stroke; and in response to detecting the portion of the second stroke and while the second stroke is still being detected, determine whether the first stroke and the second stroke correspond to a single character based on temporal information about the first stroke and the second stroke. 32. The non-transitory computer readable storage medium of claim 23 , wherein the temporal information about the first stroke and the second stroke comprises a proximity in time between the first stroke and the second stroke.
0.899911
10,008,208
9
14
9. A computer system for performing automated access control using speaker recognition performed via an automated user-machine interaction, the computer system comprising: a processor; and a memory with computer code instructions stored thereon, the processor and the memory, with the computer code instructions being configured to execute an automated user-machine interaction application and cause the system to: in response to a user's contacting a computing system, prompt the user, via an automated user-machine interaction application, to speak a single phrase including a personal identifier and a common phrase component, the personal identifier and common phrase component being distinct, and the common phrase component being the same amongst a plurality of users; decompose a received spoken phrase, the received spoken phrase being the single phrase, and the decomposing including locating the personal identifier within the spoken phrase and locating the common phrase component within the spoken phrase; identify the user based on results of the decomposing, the identifying comprising comparing the personal identifier located against previously stored identifying information; verify the user based on results of the decomposing, the verifying comprising comparing the common phrase component located against one or more previously stored voice prints associated with at least a subgroup of all users; and provide the user, if identified and verified, with access to the computing system.
9. A computer system for performing automated access control using speaker recognition performed via an automated user-machine interaction, the computer system comprising: a processor; and a memory with computer code instructions stored thereon, the processor and the memory, with the computer code instructions being configured to execute an automated user-machine interaction application and cause the system to: in response to a user's contacting a computing system, prompt the user, via an automated user-machine interaction application, to speak a single phrase including a personal identifier and a common phrase component, the personal identifier and common phrase component being distinct, and the common phrase component being the same amongst a plurality of users; decompose a received spoken phrase, the received spoken phrase being the single phrase, and the decomposing including locating the personal identifier within the spoken phrase and locating the common phrase component within the spoken phrase; identify the user based on results of the decomposing, the identifying comprising comparing the personal identifier located against previously stored identifying information; verify the user based on results of the decomposing, the verifying comprising comparing the common phrase component located against one or more previously stored voice prints associated with at least a subgroup of all users; and provide the user, if identified and verified, with access to the computing system. 14. The computer system of claim 9 wherein, in identifying the user, the processor and the memory, with the computer code instructions, are further configured to cause the system to: determine multiple candidate users associated with the personal identifier; and employ voice biometrics to identify the user among the multiple candidate users.
0.680037
9,774,641
19
20
19. A method comprising: presenting a plurality of prompts requesting information items associated with data describing characteristics of a user of a social networking system including a processor; logging, in a database maintained by the social networking system, a plurality of responses from the user to the plurality of prompts; maintaining a profile for the user in a user profile database maintained by the social networking system, the profile including one or more information items associated with data describing characteristics of the user identifying one or more information items from the that have not been updated within a threshold amount of time from a current time from the maintained profile; obtaining a plurality of prompts associated with the one or more identified information items; determining, for each of the plurality of prompts associated with the one or more identified information items from the identified information items, a response probability based at least in part on one or a combination of a format and content of the prompt, the response probability indicating a likelihood of the social networking system receiving a response to a prompt when presented; determining a data acquisition value for each of a plurality of the identified information items, the data acquisition value of an identified information item based at least in part on a value to the social networking system of associating data with the identified information item and the determined response probability; selecting a particular information item from the one or more identified information items by the social networking system based at least in part on the data acquisition values; and selecting, by the social networking system, a prompt associated with the particular identified information item for presentation to the user based at least in part on the response probabilities of one or more prompts associated with the particular identified information item.
19. A method comprising: presenting a plurality of prompts requesting information items associated with data describing characteristics of a user of a social networking system including a processor; logging, in a database maintained by the social networking system, a plurality of responses from the user to the plurality of prompts; maintaining a profile for the user in a user profile database maintained by the social networking system, the profile including one or more information items associated with data describing characteristics of the user identifying one or more information items from the that have not been updated within a threshold amount of time from a current time from the maintained profile; obtaining a plurality of prompts associated with the one or more identified information items; determining, for each of the plurality of prompts associated with the one or more identified information items from the identified information items, a response probability based at least in part on one or a combination of a format and content of the prompt, the response probability indicating a likelihood of the social networking system receiving a response to a prompt when presented; determining a data acquisition value for each of a plurality of the identified information items, the data acquisition value of an identified information item based at least in part on a value to the social networking system of associating data with the identified information item and the determined response probability; selecting a particular information item from the one or more identified information items by the social networking system based at least in part on the data acquisition values; and selecting, by the social networking system, a prompt associated with the particular identified information item for presentation to the user based at least in part on the response probabilities of one or more prompts associated with the particular identified information item. 20. The method of claim 19 , wherein identifying one or more information items that have not been updated within a threshold amount of time from a current time from the maintained profile comprises: identifying one or more information items associated with data received by the social networking system at least the threshold amount of time from the current time.
0.5
8,144,921
1
5
1. A computer-implemented method for retrieving an electronic document using invisible junction features, the method comprising: receiving an image of an input electronic document; extracting, with a processor, an invisible junction feature descriptor from the image; and retrieving, with the processor, information for an output electronic document using the invisible junction feature descriptor and a geometric constraint.
1. A computer-implemented method for retrieving an electronic document using invisible junction features, the method comprising: receiving an image of an input electronic document; extracting, with a processor, an invisible junction feature descriptor from the image; and retrieving, with the processor, information for an output electronic document using the invisible junction feature descriptor and a geometric constraint. 5. The method of claim 1 , wherein retrieving information for the output electronic document comprises querying a database using the invisible junction feature descriptor and the geometric constraint.
0.84252
9,070,247
1
5
1. A system for use with a separate electronic game table, the system comprising: a video and audio display; an interface suitable configured with instructions to receive data representing standard game states and standard game output from the separate electronic game table; a circumstances inventory (CI) engine that includes a game states queue and a player attributes queue, and wherein the CI engine is programmed with instructions to: collect current standard game states via the interface for the game states queue, and receive player information for the player attributes queue from a player tracking platform, wherein the player tracking platform is physically separate from the system; an artificial intelligence (AI) engine in communication with the CI engine, and wherein the AI engine is configured with instructions to: create associations between received standard game states and possible emotions for a virtual assistant, create associations between player attributes and possible emotions for the virtual assistant, save the associations, and select an emotion for the virtual assistant based on the associations; a game output converter configured with instructions to translate the data received from the interface representing the standard game states and standard game output and received player information into animated behavior information and animated speech information for input to a virtual assistant projector, wherein the interface, the virtual assistant projector and the game output converter are separate from and passive with respect to a main game engine of the separate electronic game table; and wherein the virtual assistant projector is configured with possible emotions for the virtual assistant and with instructions to animate the virtual assistant on the video and audio display based on the animated behavior information, the animated speech information and the selected emotion.
1. A system for use with a separate electronic game table, the system comprising: a video and audio display; an interface suitable configured with instructions to receive data representing standard game states and standard game output from the separate electronic game table; a circumstances inventory (CI) engine that includes a game states queue and a player attributes queue, and wherein the CI engine is programmed with instructions to: collect current standard game states via the interface for the game states queue, and receive player information for the player attributes queue from a player tracking platform, wherein the player tracking platform is physically separate from the system; an artificial intelligence (AI) engine in communication with the CI engine, and wherein the AI engine is configured with instructions to: create associations between received standard game states and possible emotions for a virtual assistant, create associations between player attributes and possible emotions for the virtual assistant, save the associations, and select an emotion for the virtual assistant based on the associations; a game output converter configured with instructions to translate the data received from the interface representing the standard game states and standard game output and received player information into animated behavior information and animated speech information for input to a virtual assistant projector, wherein the interface, the virtual assistant projector and the game output converter are separate from and passive with respect to a main game engine of the separate electronic game table; and wherein the virtual assistant projector is configured with possible emotions for the virtual assistant and with instructions to animate the virtual assistant on the video and audio display based on the animated behavior information, the animated speech information and the selected emotion. 5. The system of claim 1 , wherein the interface comprises at least an XML socket connection.
0.87859
7,673,230
12
14
12. In a distributed system having a server and a client, wherein the client includes a display device and a keyboard device having at least one key, a method comprising: (a) providing an image map at the client from the server wherein the image map includes a plurality of hyperlinks, each hyperlink being associated with a particular portion of the image map; (b) displaying the image map on the display device; (c) in response to actuating a selected key of the keyboard device, sequentially determining a next hyperlink associated with a particular portion of the image map, wherein the determination of the next hyperlink is executed on the client; and (d) displaying a visual indication of the presence of the next hyperlink in the image map without providing any visual indication of the presence of other hyperlinks in the image map.
12. In a distributed system having a server and a client, wherein the client includes a display device and a keyboard device having at least one key, a method comprising: (a) providing an image map at the client from the server wherein the image map includes a plurality of hyperlinks, each hyperlink being associated with a particular portion of the image map; (b) displaying the image map on the display device; (c) in response to actuating a selected key of the keyboard device, sequentially determining a next hyperlink associated with a particular portion of the image map, wherein the determination of the next hyperlink is executed on the client; and (d) displaying a visual indication of the presence of the next hyperlink in the image map without providing any visual indication of the presence of other hyperlinks in the image map. 14. The method of claim 12 , wherein the visual indication is a focus shape.
0.886228
8,965,145
1
2
1. A dispatcher apparatus having: one or more processors; a segmenter stored on a memory and executable by the one or more processors, the segmenter for receiving an image query including an image and segmenting the image into one or more content-type specific queries; a distributor stored on the memory and executable by the one or more processors, the distributor coupled to the segmenter for submitting the one or more content-type specific queries to one or more coupled corresponding content-type index tables for recognition; and an integrator stored on the memory and executable by the one or more processors, the integrator for receiving recognition results from the one or more corresponding content-type index tables, integrating the recognition results into an integrated result based on a level of agreement between the recognition results and transmitting the integrated result.
1. A dispatcher apparatus having: one or more processors; a segmenter stored on a memory and executable by the one or more processors, the segmenter for receiving an image query including an image and segmenting the image into one or more content-type specific queries; a distributor stored on the memory and executable by the one or more processors, the distributor coupled to the segmenter for submitting the one or more content-type specific queries to one or more coupled corresponding content-type index tables for recognition; and an integrator stored on the memory and executable by the one or more processors, the integrator for receiving recognition results from the one or more corresponding content-type index tables, integrating the recognition results into an integrated result based on a level of agreement between the recognition results and transmitting the integrated result. 2. The dispatcher apparatus of claim 1 , wherein the one or more content-types are selected from a group of black text on white background, black and white natural images, color natural images, black and white diagrams, color diagrams, headings, and color text.
0.662791
7,860,853
11
12
11. The method of claim 10 , wherein the first signature generator is configured to generate less signatures from the same document than the second signature generator.
11. The method of claim 10 , wherein the first signature generator is configured to generate less signatures from the same document than the second signature generator. 12. The method of claim 11 , wherein the first and second signature generators are both configured with a same tolerance level, and wherein the tolerance level relates to an expectation that the method is able to identify document variations.
0.5
8,577,883
1
2
1. A computer-implementable method for incremental specification of identities in a computer network, the method comprising: creating first, second, and third set identifiers of sets representing one or more distinct entities, the sets comprising one or more distinct elements, wherein the first and second set identifiers represent subsets of the set represented by the third identifier; annotating the first set identifier with first properties using statement tuples having logical delimited groupings and that collectively comprise the first properties and individually reference the first set identifier, wherein the first properties characterize entities in the set identified by the first set identifier; annotating the second set identifier with second properties using statement tuples having logical delimited groupings and that collectively comprise the second properties and individually reference the second set identifier, wherein the second properties characterize entities of the set identified by the second set identifier, such that the first properties and the second properties have third properties in common; detecting redundant data for factoring the first and second set identifiers by introducing a fourth set identifier annotated with the third properties using statement tuples having logical delimited groupings and that collectively comprise the third properties and individually reference the fourth set identifier, wherein the third properties characterize elements of the set identified by the fourth set identifier; storing data representing the statement tuples, wherein the data is distributed across distinct physical storage devices; querying the statement tuples in at least one ephemeral context comprising additional tuples as query assumptions and access control; applying knowledge rules within the ephemeral context to derive derived tuples, the knowledge rules comprising additional tuples; and applying representation rules within the ephemeral context to derive logical tuples from data in other representations, the representation rules mapping between logical and physical representations of datasources.
1. A computer-implementable method for incremental specification of identities in a computer network, the method comprising: creating first, second, and third set identifiers of sets representing one or more distinct entities, the sets comprising one or more distinct elements, wherein the first and second set identifiers represent subsets of the set represented by the third identifier; annotating the first set identifier with first properties using statement tuples having logical delimited groupings and that collectively comprise the first properties and individually reference the first set identifier, wherein the first properties characterize entities in the set identified by the first set identifier; annotating the second set identifier with second properties using statement tuples having logical delimited groupings and that collectively comprise the second properties and individually reference the second set identifier, wherein the second properties characterize entities of the set identified by the second set identifier, such that the first properties and the second properties have third properties in common; detecting redundant data for factoring the first and second set identifiers by introducing a fourth set identifier annotated with the third properties using statement tuples having logical delimited groupings and that collectively comprise the third properties and individually reference the fourth set identifier, wherein the third properties characterize elements of the set identified by the fourth set identifier; storing data representing the statement tuples, wherein the data is distributed across distinct physical storage devices; querying the statement tuples in at least one ephemeral context comprising additional tuples as query assumptions and access control; applying knowledge rules within the ephemeral context to derive derived tuples, the knowledge rules comprising additional tuples; and applying representation rules within the ephemeral context to derive logical tuples from data in other representations, the representation rules mapping between logical and physical representations of datasources. 2. The method of claim 1 , the method further comprising: generating a first reference to the first set identifier, generating a second reference to the fourth set identifier, and creating a targeted unrefinement comprising an unrefiner that relates a first audience to the first reference and a second audience to the second reference.
0.5
9,911,355
1
5
1. A computer-implemented method, comprising: receiving, by a processor, a plurality of words comprised in a rapid serial visual presentation; determining, by a processor, a cognitive load of the plurality of words by using at least one metric, the cognitive load being determined on any of a word level and a word sequence level; calculating, by the processor, a variable presentation rate for the plurality of words based on the cognitive load, the variable presentation rate capable of being varied on any of the word level and the word sequence level; and controlling, by the processor, a displaying of the plurality of words on a display device in accordance with the calculated variable presentation rate based on a threshold by temporarily reducing the variable presentation rate responsive to the cognitive load being above the threshold.
1. A computer-implemented method, comprising: receiving, by a processor, a plurality of words comprised in a rapid serial visual presentation; determining, by a processor, a cognitive load of the plurality of words by using at least one metric, the cognitive load being determined on any of a word level and a word sequence level; calculating, by the processor, a variable presentation rate for the plurality of words based on the cognitive load, the variable presentation rate capable of being varied on any of the word level and the word sequence level; and controlling, by the processor, a displaying of the plurality of words on a display device in accordance with the calculated variable presentation rate based on a threshold by temporarily reducing the variable presentation rate responsive to the cognitive load being above the threshold. 5. The computer-implemented method of claim 1 , wherein the at least one metric comprises an eye-based metric for identifying at least one of an increased rate of eye blinks and an increased pupil dilation in relation to a predetermined eye blink range and a predetermined pupil dilation range.
0.609043
9,836,678
5
6
5. A barcoded quality indicator operative to provide a machine-readable indication of exceedance of at least one threshold by at least one product quality affecting parameter, said barcoded quality indicator including: a first machine-readable visible state prior to actuation thereof; a second machine-readable visible state, different from said first machine-readable visible state, following actuation thereof and prior to exceedance of said at least one threshold by said at least one product quality affecting parameter; and at least one third machine-readable visible state, different from said first machine-readable visible state and different from said second machine-readable visible state, following actuation thereof and following exceedance of said at least one threshold by said at least one product quality affecting parameter.
5. A barcoded quality indicator operative to provide a machine-readable indication of exceedance of at least one threshold by at least one product quality affecting parameter, said barcoded quality indicator including: a first machine-readable visible state prior to actuation thereof; a second machine-readable visible state, different from said first machine-readable visible state, following actuation thereof and prior to exceedance of said at least one threshold by said at least one product quality affecting parameter; and at least one third machine-readable visible state, different from said first machine-readable visible state and different from said second machine-readable visible state, following actuation thereof and following exceedance of said at least one threshold by said at least one product quality affecting parameter. 6. A barcoded quality indicator according to claim 5 and wherein said barcoded quality indicator is readable by a barcode indicator reader at all times, after first becoming readable, including times prior to, during and immediately following exceedance of said at least one threshold by said at least one product quality affecting parameter.
0.5
9,946,770
8
14
8. A system for searching key words, comprising: one or more hardware processors; and non-transitory storage medium accessible to the one or more hardware processors; the non-transitory storage medium is configured to store instructions, wherein the instructions, when executed by the one or more hardware processors, are configured to cause the system to: receive a key word typed in a search box and to send a search request based on the key word; receive a first set of directly associated words of the key word from a keyword database and a summary extracted from search results queried using the first set of directly associated words; receive a second set of indirectly associated words of the key word; display, as a list, the first set of directly associated words and the second set of indirectly associated words along with but below the first set of directly associated words in the search box; upon displaying the list, trigger a time measurement to acquire a user dwell time on the displayed first set of associated words; monitor and determine that the user dwell time on the displayed directly associated words has reached a predetermined threshold user dwell time; and display, upon determining that the user dwell time has reached the predetermined threshold user dwell time, the summary extracted from the search results along with the displayed first set of associated words.
8. A system for searching key words, comprising: one or more hardware processors; and non-transitory storage medium accessible to the one or more hardware processors; the non-transitory storage medium is configured to store instructions, wherein the instructions, when executed by the one or more hardware processors, are configured to cause the system to: receive a key word typed in a search box and to send a search request based on the key word; receive a first set of directly associated words of the key word from a keyword database and a summary extracted from search results queried using the first set of directly associated words; receive a second set of indirectly associated words of the key word; display, as a list, the first set of directly associated words and the second set of indirectly associated words along with but below the first set of directly associated words in the search box; upon displaying the list, trigger a time measurement to acquire a user dwell time on the displayed first set of associated words; monitor and determine that the user dwell time on the displayed directly associated words has reached a predetermined threshold user dwell time; and display, upon determining that the user dwell time has reached the predetermined threshold user dwell time, the summary extracted from the search results along with the displayed first set of associated words. 14. The system of claim 8 , wherein instructions, when executed by the one or more hardware processors to cause the system to acquire the summary extracted from the search results, are configured to cause the system to: obtain a setting information based on the direction associated words; and extract the summary from the search results relevant to both the directly associated words and the setting information.
0.5
9,961,388
17
31
17. A method of a networked device comprising: applying an automatic content recognition algorithm to determine a content identifier of an audio-visual data; associating the content identifier with an advertisement data based on a semantic correlation between a meta-data of the advertisement provided by a content provider and the content identifier, wherein the advertisement data is generated through an advertising exchange server based on the content identifier of the audio-visual data and a public internet protocol address associated with an application requesting the advertisement data; accessing a pairing server when processing an identification data associated with a sandbox reachable service of the networked device that shares a public address with a client device, wherein the pairing server performs a discovery lookup of any device that has announced sharing of the public address associated with the client device, and wherein the sandbox reachable service announces itself to the pairing server prior to establishment of a communication session between a sandboxed application executing on the client device and the sandbox reachable service; appending a header of a hypertext transfer protocol to permit the networked device to communicate with the sandboxed application as a permitted origin domain through a CORS algorithm, wherein the header is either one of a origin header when the CORS algorithm is applied and a referrer header in an alternate algorithm, and wherein the client device: processes an identification data associated with the sandbox reachable service sharing the public address with the client device, determines a private address pair of the sandbox reachable service based on the identification data, and establishes the communication session between the sandboxed application and the sandbox reachable service using a cross-site scripting technique of a security sandbox, wherein the sandboxed application queries a MAC address of the sandbox reachable service in a common private network, wherein the sandbox reachable service optionally verifies that the sandboxed application is in the common private network, wherein the sandbox reachable service communicates a MAC address of the sandboxed application to the sandboxed application when the common private network is shared, wherein the sandboxed application stores the MAC address of the sandboxed application and a unique identifier derived from the MAC address of the sandboxed application, and wherein the sandboxed application communicates the MAC address and the unique identifier to the pairing server; and automatically regenerating a script embedded in at least one of the client device, a supply-side platform, and a data provider integrated with the supply side platform when the common private network is shared by the sandboxed application and sandbox reachable service based on the MAC address of the sandboxed application and the unique identifier communicated to the pairing server.
17. A method of a networked device comprising: applying an automatic content recognition algorithm to determine a content identifier of an audio-visual data; associating the content identifier with an advertisement data based on a semantic correlation between a meta-data of the advertisement provided by a content provider and the content identifier, wherein the advertisement data is generated through an advertising exchange server based on the content identifier of the audio-visual data and a public internet protocol address associated with an application requesting the advertisement data; accessing a pairing server when processing an identification data associated with a sandbox reachable service of the networked device that shares a public address with a client device, wherein the pairing server performs a discovery lookup of any device that has announced sharing of the public address associated with the client device, and wherein the sandbox reachable service announces itself to the pairing server prior to establishment of a communication session between a sandboxed application executing on the client device and the sandbox reachable service; appending a header of a hypertext transfer protocol to permit the networked device to communicate with the sandboxed application as a permitted origin domain through a CORS algorithm, wherein the header is either one of a origin header when the CORS algorithm is applied and a referrer header in an alternate algorithm, and wherein the client device: processes an identification data associated with the sandbox reachable service sharing the public address with the client device, determines a private address pair of the sandbox reachable service based on the identification data, and establishes the communication session between the sandboxed application and the sandbox reachable service using a cross-site scripting technique of a security sandbox, wherein the sandboxed application queries a MAC address of the sandbox reachable service in a common private network, wherein the sandbox reachable service optionally verifies that the sandboxed application is in the common private network, wherein the sandbox reachable service communicates a MAC address of the sandboxed application to the sandboxed application when the common private network is shared, wherein the sandboxed application stores the MAC address of the sandboxed application and a unique identifier derived from the MAC address of the sandboxed application, and wherein the sandboxed application communicates the MAC address and the unique identifier to the pairing server; and automatically regenerating a script embedded in at least one of the client device, a supply-side platform, and a data provider integrated with the supply side platform when the common private network is shared by the sandboxed application and sandbox reachable service based on the MAC address of the sandboxed application and the unique identifier communicated to the pairing server. 31. The method of claim 17 : wherein a cookie associated with the security sandbox is used to store a remote access token on a storage of the client device, wherein the remote access token identifies at least one of a set of communicable private IP addresses and hardware addresses associated with sandbox reachable services that previously operated on a common shared network with the client device, and wherein the client device is capable of communicating with the sandbox reachable services that previously operated on the common shared network through the remote access token.
0.93628
8,370,735
13
14
13. The system of claim 1 , the buffer component configured to: identify an obstruction within the first element; remove the obstruction from the first element to create a modified first element; and allocate a first buffer size for the first buffer based upon a size of the modified first element.
13. The system of claim 1 , the buffer component configured to: identify an obstruction within the first element; remove the obstruction from the first element to create a modified first element; and allocate a first buffer size for the first buffer based upon a size of the modified first element. 14. The system of claim 13 , the obstruction comprising at least one of an unnecessary character or an invalid character.
0.5
7,805,710
34
39
34. The computer system combination of claim 33 wherein said compatibility detection of cache translations and subject code to be translated is determined by a cache key comparison between a cache key associated with the first portion of the subject code and with the second portion of the subject code.
34. The computer system combination of claim 33 wherein said compatibility detection of cache translations and subject code to be translated is determined by a cache key comparison between a cache key associated with the first portion of the subject code and with the second portion of the subject code. 39. The computer system combination of claim 34 wherein the compatibility detection is determined by comparing a cache key data structure corresponding to the subject code to be translated to a plurality of second data structures, each second data structure corresponding to a different set of cached target code instructions.
0.661123
9,520,143
12
17
12. A foreign language learning method using a function of reading an input sentence in voice through a Text To Speech (TTS) engine, the foreign language learning method correcting pronunciation through sentence input, comprising the steps of: (a) receiving a first sentence from a user via a sentence input unit; (b) detecting, by a linked letter detection unit, at least one letter corresponding to at least one linking rule by searching letters that form the first sentence received via the sentence input unit; (c) removing, by a linked letter removal unit, the letter corresponding to the linking rule detected by the linked letter detection unit, and generating, by the linked letter removal unit, a second sentence by inserting a linking code into a part from which the letter has been removed; (d) generating, by a partial waveform generation unit, one or more partial waveforms using the TTS engine with respect to a portion from a start point of the second sentence generated by the linked letter removal unit before a part into which the linking code has been inserted, a portion from the part into which the linking code has been inserted before a part into which a subsequent linking code has been inserted, and a portion from the part into which the subsequent linking code has been inserted to an end point of the second sentence; (d) converting, by an input waveform generation unit, a voice corresponding to the first sentence received through the sentence input unit into an input waveform when the voice is received from a user; and (e) calculating, by a matching degree calculation unit, a matching degree by comparing the input waveform generated by the input waveform generation unit with the one or more partial waveforms generated by the partial waveform generation unit, and calculating, by the matching degree calculation unit, a partial matching degree of a part having a highest matching degree in each of the partial waveforms by detecting the part having the highest matching degree while moving from a beginning of the input waveform to an end thereof in an order in which the one or more partial waveforms are disposed, wherein: step (b) comprises the steps of: (b1) detecting, by a word detection unit, an identical word by determining whether or not a word including the letter corresponding to the linking rule is identical with a word previously stored in a data storage unit when the letter corresponding to the linking rule is detected by the linked letter detection unit; and (b2) inserting, by a word waveform insertion unit, a word waveform corresponding to the previously stored word into a part corresponding to the word detected by the word detection unit; the word waveform comprises one or more phonemic waveforms that corresponds to phonemes for respective letters that form the word; the linked letter removal unit removes a phonemic waveform of the part corresponding to the letter that belongs to the letters of the word corresponding to the word waveform and that has been removed by the linked letter removal unit; the partial waveform generation unit generates the one or more partial waveforms using the TTS engine with respect to a portion from the start point of the second sentence generated by the linked letter removal unit to a letter prior to the part into which the word waveform has been inserted, a portion from a letter posterior to the part into which the word waveform has been inserted to a letter prior to a part into which a subsequent word waveform has been inserted, and a portion from a letter posterior to the part into which the word waveform has been inserted to the end point of the second sentence; and the matching degree calculation unit calculates a matching degree by comparing the input waveform generated by the input waveform generation unit with one or more word waveforms generated by the linked letter removal unit and then calculating a word matching degree of a part having a highest matching degree in each of the word waveforms by detecting the part having the highest matching degree while moving from the beginning of the input waveform to the end thereof in the order in which the one or more word waveforms are disposed.
12. A foreign language learning method using a function of reading an input sentence in voice through a Text To Speech (TTS) engine, the foreign language learning method correcting pronunciation through sentence input, comprising the steps of: (a) receiving a first sentence from a user via a sentence input unit; (b) detecting, by a linked letter detection unit, at least one letter corresponding to at least one linking rule by searching letters that form the first sentence received via the sentence input unit; (c) removing, by a linked letter removal unit, the letter corresponding to the linking rule detected by the linked letter detection unit, and generating, by the linked letter removal unit, a second sentence by inserting a linking code into a part from which the letter has been removed; (d) generating, by a partial waveform generation unit, one or more partial waveforms using the TTS engine with respect to a portion from a start point of the second sentence generated by the linked letter removal unit before a part into which the linking code has been inserted, a portion from the part into which the linking code has been inserted before a part into which a subsequent linking code has been inserted, and a portion from the part into which the subsequent linking code has been inserted to an end point of the second sentence; (d) converting, by an input waveform generation unit, a voice corresponding to the first sentence received through the sentence input unit into an input waveform when the voice is received from a user; and (e) calculating, by a matching degree calculation unit, a matching degree by comparing the input waveform generated by the input waveform generation unit with the one or more partial waveforms generated by the partial waveform generation unit, and calculating, by the matching degree calculation unit, a partial matching degree of a part having a highest matching degree in each of the partial waveforms by detecting the part having the highest matching degree while moving from a beginning of the input waveform to an end thereof in an order in which the one or more partial waveforms are disposed, wherein: step (b) comprises the steps of: (b1) detecting, by a word detection unit, an identical word by determining whether or not a word including the letter corresponding to the linking rule is identical with a word previously stored in a data storage unit when the letter corresponding to the linking rule is detected by the linked letter detection unit; and (b2) inserting, by a word waveform insertion unit, a word waveform corresponding to the previously stored word into a part corresponding to the word detected by the word detection unit; the word waveform comprises one or more phonemic waveforms that corresponds to phonemes for respective letters that form the word; the linked letter removal unit removes a phonemic waveform of the part corresponding to the letter that belongs to the letters of the word corresponding to the word waveform and that has been removed by the linked letter removal unit; the partial waveform generation unit generates the one or more partial waveforms using the TTS engine with respect to a portion from the start point of the second sentence generated by the linked letter removal unit to a letter prior to the part into which the word waveform has been inserted, a portion from a letter posterior to the part into which the word waveform has been inserted to a letter prior to a part into which a subsequent word waveform has been inserted, and a portion from a letter posterior to the part into which the word waveform has been inserted to the end point of the second sentence; and the matching degree calculation unit calculates a matching degree by comparing the input waveform generated by the input waveform generation unit with one or more word waveforms generated by the linked letter removal unit and then calculating a word matching degree of a part having a highest matching degree in each of the word waveforms by detecting the part having the highest matching degree while moving from the beginning of the input waveform to the end thereof in the order in which the one or more word waveforms are disposed. 17. The foreign language learning method of claim 12 , wherein the matching degree calculation unit calculates a matching percentage for each word by comparing the input waveform with the word waveform on a word basis, calculates a matching percentage for each part by comparing the input waveform with the partial waveform on a partial waveform basis, calculates a matching percentage for each sentence by summing all the matching percentages for each word and all the matching percentages for each part and then dividing each of the sums by a total number of matching percentages for each word and matching percentages for each part, and sends the calculated matching percentage for each word, the calculated matching percentage for each part, and the calculated matching percentage for each sentence to an output unit.
0.574611
8,799,257
9
13
9. A system comprising: one or more computer devices to: receive a search query from a client, the search query including a plurality of terms entered by a user of the client, the plurality of terms including: a first term related to a topic of a web page, a second term related to a first keyword of a plurality of keywords, a third term related to a second keyword of the plurality of keywords, the plurality of keywords corresponding to a plurality of features of the web page, the plurality of features including: a color of a background of the web page, a feature relating to an image in the web page, and a feature relating to an audible feature of the web page, the first keyword relating to a first feature of the plurality of features, the second keyword relating to a second feature of the plurality of features, and a fourth term to be searched in relation to one of the first feature or the second feature, an index associating the plurality of keywords with information identifying the web page, convert a format of the second term to a format of the first keyword in the index when the format of the second term does not match the format of the first keyword; identify documents based on the search query and using the index, the identified documents including the web page, and provide a search results document to the client, the search results document identifying one or more documents of the identified documents, the one or more documents including the web page.
9. A system comprising: one or more computer devices to: receive a search query from a client, the search query including a plurality of terms entered by a user of the client, the plurality of terms including: a first term related to a topic of a web page, a second term related to a first keyword of a plurality of keywords, a third term related to a second keyword of the plurality of keywords, the plurality of keywords corresponding to a plurality of features of the web page, the plurality of features including: a color of a background of the web page, a feature relating to an image in the web page, and a feature relating to an audible feature of the web page, the first keyword relating to a first feature of the plurality of features, the second keyword relating to a second feature of the plurality of features, and a fourth term to be searched in relation to one of the first feature or the second feature, an index associating the plurality of keywords with information identifying the web page, convert a format of the second term to a format of the first keyword in the index when the format of the second term does not match the format of the first keyword; identify documents based on the search query and using the index, the identified documents including the web page, and provide a search results document to the client, the search results document identifying one or more documents of the identified documents, the one or more documents including the web page. 13. The system of claim 9 , where the one or more computer devices are further to: generate a keyword based on the audible feature of the web page, the audible feature corresponding to: an indication of whether a sound is generated when the web page is rendered for display, an indication of whether music is generated when the web page is rendered for display, a name of music that is generated when the web page is rendered for display, or a name of an artist that is associated with music that is generated when the web page is rendered for display; and associate, in the index, the keyword with the information identifying the web page, where the plurality of terms further includes: a term identifying the keyword, and a term to be searched in relation to the audible feature.
0.526092
7,536,713
1
5
1. A method for classifying and retrieving information comprising: reviewing a document by a content producer device; determining a category attribute value, a context attribute value, and a keyword attribute value of said document wherein said category attribute value, said context attribute value, and said keyword attribute value describe said document, wherein said category attribute value comprises a general classification category, said context attribute value comprises a classification type, and said keyword attribute value comprises a classification detail; generating a knowledge attribute data using a computer programmed to reduce said category attribute value, said context attribute value, and said keyword attribute value to a single data value, wherein said knowledge attribute data is represented as a pseudo-unique numeric value generated using a hash function; creating a knowledge object comprising an attribute specification that contains a document representation of said document and said knowledge attribute data, wherein allowing selective distribution based on subscriber-based forwarding, where a client device requests to have only knowledge objects matching said document to be forwarded; storing said knowledge object in a search engine database on a server; receiving a search query comprising a category search parameter, a context search parameter, and a keyword search parameter from a content consumer device wherein said category search parameter comprises a general classification category search parameter, said context search parameter comprises a classification type search parameter, and said keyword search parameter comprises a classification detail search parameter; generating a search attribute data by reducing said search query comprising said category search parameter, said context search parameter, and said keyword search parameter to a single data value, wherein said search attribute data is represented as a pseudo-unique numeric value generated using a hash function; retrieving said knowledge attribute data from said search engine database; comparing said search attribute data with said knowledge attribute data; and, when said comparing results in a match, presenting said knowledge object to said content consumer device.
1. A method for classifying and retrieving information comprising: reviewing a document by a content producer device; determining a category attribute value, a context attribute value, and a keyword attribute value of said document wherein said category attribute value, said context attribute value, and said keyword attribute value describe said document, wherein said category attribute value comprises a general classification category, said context attribute value comprises a classification type, and said keyword attribute value comprises a classification detail; generating a knowledge attribute data using a computer programmed to reduce said category attribute value, said context attribute value, and said keyword attribute value to a single data value, wherein said knowledge attribute data is represented as a pseudo-unique numeric value generated using a hash function; creating a knowledge object comprising an attribute specification that contains a document representation of said document and said knowledge attribute data, wherein allowing selective distribution based on subscriber-based forwarding, where a client device requests to have only knowledge objects matching said document to be forwarded; storing said knowledge object in a search engine database on a server; receiving a search query comprising a category search parameter, a context search parameter, and a keyword search parameter from a content consumer device wherein said category search parameter comprises a general classification category search parameter, said context search parameter comprises a classification type search parameter, and said keyword search parameter comprises a classification detail search parameter; generating a search attribute data by reducing said search query comprising said category search parameter, said context search parameter, and said keyword search parameter to a single data value, wherein said search attribute data is represented as a pseudo-unique numeric value generated using a hash function; retrieving said knowledge attribute data from said search engine database; comparing said search attribute data with said knowledge attribute data; and, when said comparing results in a match, presenting said knowledge object to said content consumer device. 5. The method of claim 1 , wherein said context attribute value is an arbitrary sub-classification of the category attribute value and said context attribute value is represented as a reference to an attribute specification document.
0.687668
9,678,940
1
7
1. A method for communication facilitation in a location within a virtual world, the method comprising: providing in a computer a virtual world including multiple different locations in which different avatars interact through an exchange of messages; identifying jargon including acronyms for an organizational relationship characteristic of a particular one of the different locations in one of the messages the jargon being terminology common to an organizational culture specific to the particular one of the locations in the virtual world, but foreign to others of the participants not belonging to the organizational culture specific to the particular one of the locations in the virtual world; and, responding to a selection of a word in the one of the messages by determining if the selected word is jargon and if so, looking up a glossary entry for the jargon of the selected word, emphasizing the jargon of the selected word from other text in the one of the messages upon finding the glossary entry for the jargon of the selected word in the dictionary of jargon and rendering the glossary entry in the one of the messages in connection with the emphasized jargon.
1. A method for communication facilitation in a location within a virtual world, the method comprising: providing in a computer a virtual world including multiple different locations in which different avatars interact through an exchange of messages; identifying jargon including acronyms for an organizational relationship characteristic of a particular one of the different locations in one of the messages the jargon being terminology common to an organizational culture specific to the particular one of the locations in the virtual world, but foreign to others of the participants not belonging to the organizational culture specific to the particular one of the locations in the virtual world; and, responding to a selection of a word in the one of the messages by determining if the selected word is jargon and if so, looking up a glossary entry for the jargon of the selected word, emphasizing the jargon of the selected word from other text in the one of the messages upon finding the glossary entry for the jargon of the selected word in the dictionary of jargon and rendering the glossary entry in the one of the messages in connection with the emphasized jargon. 7. The method of claim 1 , wherein the message exchanged between participants is an instant message.
0.795918
8,619,090
18
23
18. A device comprising: one or more processors to: receive text that includes data values, parse the text to identify data types associated with the data values, generate, based on the data values and the data types, a graphical representation of the text that includes data cells corresponding to the data values, provide the graphical representation for display, receive one or more selections of one or more data cells in the graphical representation, store the one or more selections as a selection history, the selection history storing a plurality of selections, and the plurality of selections including the one or more selections and one or more other selections received prior to receiving the one or more selections, provide the selection history for display, receive a selection of a particular selection, of the one or more selections, from the selection history, identify one or more data cells associated with the particular selection in the graphical representation, receive an instruction to import the particular selection to a technical computing environment, highlight, based on the instruction, only the one or more data cells, associated with the particular selection, in the graphical representation, the one or more data cells being associated with the data types, generate a data container associated with the technical computing environment, based on the particular selection and the identified data types associated with the one or more data cells of the particular selection, and provide the data container to the technical computing environment.
18. A device comprising: one or more processors to: receive text that includes data values, parse the text to identify data types associated with the data values, generate, based on the data values and the data types, a graphical representation of the text that includes data cells corresponding to the data values, provide the graphical representation for display, receive one or more selections of one or more data cells in the graphical representation, store the one or more selections as a selection history, the selection history storing a plurality of selections, and the plurality of selections including the one or more selections and one or more other selections received prior to receiving the one or more selections, provide the selection history for display, receive a selection of a particular selection, of the one or more selections, from the selection history, identify one or more data cells associated with the particular selection in the graphical representation, receive an instruction to import the particular selection to a technical computing environment, highlight, based on the instruction, only the one or more data cells, associated with the particular selection, in the graphical representation, the one or more data cells being associated with the data types, generate a data container associated with the technical computing environment, based on the particular selection and the identified data types associated with the one or more data cells of the particular selection, and provide the data container to the technical computing environment. 23. The device of claim 18 , where the one or more processors are further to: generate a user interface that explains how a data value is parsed in a corresponding data cell of the graphical representation and that overlays the parsed data value over the data value, and provide the user interface for display.
0.622871
8,229,728
1
8
1. A method for generating one or more translation models for a statistical machine translation system, comprising the steps of: selecting a plurality of parallel sentences having one or more phrases using at least one of word occurrence frequency information and a minimum BLEU score criterion, each of said parallel sentences having a source language sentence and a target language sentence; manually aligning, via an alignment tool, words and phrases between said source language sentences and said target language sentences of said parallel sentences; extracting alignment patterns from said manually aligned sentences; estimating word alignments from said alignment patterns; estimating one or more word alignment models to generate one or more final word alignments; extracting source-target phrases using the final word alignments; and estimating the one or more translation models from the extracted source-target phrases.
1. A method for generating one or more translation models for a statistical machine translation system, comprising the steps of: selecting a plurality of parallel sentences having one or more phrases using at least one of word occurrence frequency information and a minimum BLEU score criterion, each of said parallel sentences having a source language sentence and a target language sentence; manually aligning, via an alignment tool, words and phrases between said source language sentences and said target language sentences of said parallel sentences; extracting alignment patterns from said manually aligned sentences; estimating word alignments from said alignment patterns; estimating one or more word alignment models to generate one or more final word alignments; extracting source-target phrases using the final word alignments; and estimating the one or more translation models from the extracted source-target phrases. 8. The method of claim 1 wherein extracted alignment patterns are used to automatically generate word alignments.
0.909455
10,013,492
17
22
17. A device comprising: one or more processors; memory accessible by the one or more processors; and operational logic stored in the memory and executable on the one or more processors to perform actions comprising: causing, via a user interface, display of a portion of an electronic content item; detecting a user interaction with the electronic content item; determining a rate of abandonment of content items associated with an ambient light intensity that is equal to or below a threshold value; determining, based at least partly on the indication, that a current ambient light intensity received by the device is at or below the threshold value; causing, via the user interface, display of a customized questionnaire to solicit a response to at least one question based at least in part on the electronic content item, the at least one question being associated with an abandonment of the electronic content item; receiving the response; transmitting the response for incorporation to a user-driven index; and causing, via the user interface, display of a recommendation for at least one activity associated with the response.
17. A device comprising: one or more processors; memory accessible by the one or more processors; and operational logic stored in the memory and executable on the one or more processors to perform actions comprising: causing, via a user interface, display of a portion of an electronic content item; detecting a user interaction with the electronic content item; determining a rate of abandonment of content items associated with an ambient light intensity that is equal to or below a threshold value; determining, based at least partly on the indication, that a current ambient light intensity received by the device is at or below the threshold value; causing, via the user interface, display of a customized questionnaire to solicit a response to at least one question based at least in part on the electronic content item, the at least one question being associated with an abandonment of the electronic content item; receiving the response; transmitting the response for incorporation to a user-driven index; and causing, via the user interface, display of a recommendation for at least one activity associated with the response. 22. The device of claim 17 , wherein the at least one question solicits a recommendation for similar items based at least in part on the electronic content item.
0.870994
8,799,767
7
8
7. The method of claim 6 , further comprising: generating, by the computing device, another script file by applying a different transformation to the medical status data, the different transformation specified by another XSLT document; and executing, by the computing device, the other script file.
7. The method of claim 6 , further comprising: generating, by the computing device, another script file by applying a different transformation to the medical status data, the different transformation specified by another XSLT document; and executing, by the computing device, the other script file. 8. The method of claim 7 , wherein executing the other script file comprises: generating different data; and providing the different data to another of the receiver systems.
0.5
9,110,880
7
11
7. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: selecting a candidate portion of a language model to evaluate for pruning; obtaining an entropy score representing information loss that would result from pruning the candidate portion of the language model; obtaining an acoustic score representing acoustic confusability of one or more words modeled by the candidate portion of the language model; evaluating whether to prune the candidate portion of the language model using the entropy score and the acoustic score; and generating a pruned language model based on pruning the candidate portion from the language model; and generating, by a speech recognizer using the pruned language model, a transcription of an utterance.
7. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: selecting a candidate portion of a language model to evaluate for pruning; obtaining an entropy score representing information loss that would result from pruning the candidate portion of the language model; obtaining an acoustic score representing acoustic confusability of one or more words modeled by the candidate portion of the language model; evaluating whether to prune the candidate portion of the language model using the entropy score and the acoustic score; and generating a pruned language model based on pruning the candidate portion from the language model; and generating, by a speech recognizer using the pruned language model, a transcription of an utterance. 11. The system of claim 7 , wherein evaluating includes: obtaining a pruning threshold; adjusting the pruning threshold based on the acoustic score; comparing the entropy score to the adjusted pruning threshold; and determining whether to prune the candidate portion based on the comparison.
0.5
9,582,294
1
4
1. An apparatus for automatically internationalizing grammatical output for presentation to a user of a program based on the user's locale, the apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to at least: modify an Abstract Syntax Tree (AST) in response to compilation by a compiler of a predefined AST transformation; compile a portion of source code, wherein the portion of source code is configured for generating grammatical output to the user of a program following compilation of the predefined AST transformation, wherein the portion of source code comprises a predefined token; reference a modified node of the AST during compilation of the portion of source code in response to compiling the predefined token; generate a programming method in response to referencing the modified node of the AST during compilation of the portion of source code; incorporate the programming method into a file produced by the compiler, wherein the programming method is configured to call an instance of a message bundle file, and wherein the message bundle file is configured to define an entry key value in a natural language, wherein the natural language is based on a locale of the user.
1. An apparatus for automatically internationalizing grammatical output for presentation to a user of a program based on the user's locale, the apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to at least: modify an Abstract Syntax Tree (AST) in response to compilation by a compiler of a predefined AST transformation; compile a portion of source code, wherein the portion of source code is configured for generating grammatical output to the user of a program following compilation of the predefined AST transformation, wherein the portion of source code comprises a predefined token; reference a modified node of the AST during compilation of the portion of source code in response to compiling the predefined token; generate a programming method in response to referencing the modified node of the AST during compilation of the portion of source code; incorporate the programming method into a file produced by the compiler, wherein the programming method is configured to call an instance of a message bundle file, and wherein the message bundle file is configured to define an entry key value in a natural language, wherein the natural language is based on a locale of the user. 4. The apparatus of claim 1 , wherein the AST transformation is written using Groovy programming language.
0.847262
8,060,502
16
17
16. A non-transitory computer readable medium having stored thereon non-transitory sequences of instruction, the sequences of instruction including instruction which, in response to execution by a computer based system for generating data quality indicators for relationships, causes the computer based system to perform the operations to generate the data quality indicators for relationships in a database, wherein relationships are established between a customer and a business, comprising: comparing, by the computer based system, for each relationship in a set of relationships, data associated with the respective relationship and corresponding data obtained from an industry database to generate a match confidence code for each relationship in the set of relationships, wherein the set of relationships includes multiple relationships obtained from a database; determining, by the computer based system, a link confidence code for the customer, wherein the link confidence code comprises an indication of the quality of the linking between the customer and the set of relationships based on the generated match confidence code for each relationship in the set of relationships and internal information associated with each relationship in the set of relationships, wherein the link confidence code is distinct from the match confidence code; and providing, by the computer based system, at least one of the link confidence code for the customer and the link confidence code for each relationship in the set of relationships linked to the customer.
16. A non-transitory computer readable medium having stored thereon non-transitory sequences of instruction, the sequences of instruction including instruction which, in response to execution by a computer based system for generating data quality indicators for relationships, causes the computer based system to perform the operations to generate the data quality indicators for relationships in a database, wherein relationships are established between a customer and a business, comprising: comparing, by the computer based system, for each relationship in a set of relationships, data associated with the respective relationship and corresponding data obtained from an industry database to generate a match confidence code for each relationship in the set of relationships, wherein the set of relationships includes multiple relationships obtained from a database; determining, by the computer based system, a link confidence code for the customer, wherein the link confidence code comprises an indication of the quality of the linking between the customer and the set of relationships based on the generated match confidence code for each relationship in the set of relationships and internal information associated with each relationship in the set of relationships, wherein the link confidence code is distinct from the match confidence code; and providing, by the computer based system, at least one of the link confidence code for the customer and the link confidence code for each relationship in the set of relationships linked to the customer. 17. The computer readable medium of claim 16 , wherein the comparing comprises: matching, by the computer based system, each of a plurality of data elements associated with the respective relationship to corresponding data elements obtained from the industry database to generate an elemental match score for each of the plurality of data elements; assembling, by the computer based system, the elemental match scores for the respective relationship into a set of match scores the respective relationship; appending, by the computer based system, an authentication code obtained from the industry database to the set of match scores for the respective relationship; and applying, by the computer based system, a rule to generate the match confidence code for the respective relationship based on the match scores for the respective relationship and the authentication code.
0.5
8,782,045
1
5
1. A computer-implemented method, comprising: storing, by one or more data processing apparatuses, data identifying a plurality of geographic entities, wherein each entity of the plurality of geographic entities is associated with a location and a quantification of an attribute, the attribute comprising at least one of a population or an experiment-specific metric; using a first clustering algorithm to cluster, with the one or more data processing apparatuses, the plurality of entities into a first set of clusters according to the location of each of the plurality of geographic entities; determining, with the one or more data processing apparatuses, an accuracy probability for each geographic entity of the plurality of geographic entities clustered into the first set of clusters, wherein the accuracy probability for a particular geographic entity of the plurality of geographic entities is determined according to a distance from the particular geographic entity to a second geographic entity of the plurality of geographic entities, wherein the second geographic entity is placed in a different cluster of the first set of clusters than the particular geographic entity and has a location that is the closest to the location of the particular geographic entity as compared to the other geographic entities of the plurality of geographic entities placed in a different cluster than the particular geographic entity; and determining, with the one or more data processing apparatuses, a first cluster measurement for the first set of clusters, wherein the first cluster measurement is derived from a quantification of the attribute for each of the geographic entities weighted by the accuracy probability for the geographic entity.
1. A computer-implemented method, comprising: storing, by one or more data processing apparatuses, data identifying a plurality of geographic entities, wherein each entity of the plurality of geographic entities is associated with a location and a quantification of an attribute, the attribute comprising at least one of a population or an experiment-specific metric; using a first clustering algorithm to cluster, with the one or more data processing apparatuses, the plurality of entities into a first set of clusters according to the location of each of the plurality of geographic entities; determining, with the one or more data processing apparatuses, an accuracy probability for each geographic entity of the plurality of geographic entities clustered into the first set of clusters, wherein the accuracy probability for a particular geographic entity of the plurality of geographic entities is determined according to a distance from the particular geographic entity to a second geographic entity of the plurality of geographic entities, wherein the second geographic entity is placed in a different cluster of the first set of clusters than the particular geographic entity and has a location that is the closest to the location of the particular geographic entity as compared to the other geographic entities of the plurality of geographic entities placed in a different cluster than the particular geographic entity; and determining, with the one or more data processing apparatuses, a first cluster measurement for the first set of clusters, wherein the first cluster measurement is derived from a quantification of the attribute for each of the geographic entities weighted by the accuracy probability for the geographic entity. 5. The method of claim 1 , wherein determining the first cluster measurement comprises: determining an individual measurement for each cluster in the first set of clusters, wherein the individual measurement for a cluster is derived by multiplying the quantification of the attribute of each of the geographic entities in the cluster by the accuracy probability for the entity, resulting in individual products for each of the geographic entities in the cluster, summing the individual products, resulting in a sum, and dividing the sum by a sum of the quantification of the attribute of each of the geographic entities in the cluster; and deriving the first cluster measurement from a number of clusters in the first set of clusters that have an individual measurement that exceeds a threshold.
0.5
9,245,049
1
7
1. A method for preparing an ontology for searching, the method comprising: compressing an ontology such that one individual in each set of semantically equivalent individuals in a same concept remains in a compressed ontology; determining semantically equivalent relations among the one individual and individuals in different concepts in the compressed ontology; determining semantically restricted relations among the one individual and other individuals in the different concepts in the compressed ontology; determining semantically equivalent concepts among the same and different concepts in the compressed ontology; determining semantically restricted relations among the same and different concepts in the compressed ontology; and constructing a semantically restricted relation graph based at least on the semantically restricted relations among the one individual and the other individuals and the semantically restricted relations among the same and different concepts, wherein a query is answered using the semantically restricted relation graph.
1. A method for preparing an ontology for searching, the method comprising: compressing an ontology such that one individual in each set of semantically equivalent individuals in a same concept remains in a compressed ontology; determining semantically equivalent relations among the one individual and individuals in different concepts in the compressed ontology; determining semantically restricted relations among the one individual and other individuals in the different concepts in the compressed ontology; determining semantically equivalent concepts among the same and different concepts in the compressed ontology; determining semantically restricted relations among the same and different concepts in the compressed ontology; and constructing a semantically restricted relation graph based at least on the semantically restricted relations among the one individual and the other individuals and the semantically restricted relations among the same and different concepts, wherein a query is answered using the semantically restricted relation graph. 7. The method of claim 1 , wherein determining the semantically restricted relations among the same and different concepts comprises beginning with concepts in a lowest level of the ontology to concepts in a top level in the ontology.
0.5
8,671,011
17
19
17. A method of adaptively updating at least one taxonomy that specifies at least one business service category and a list of keywords that represent a proposed best practices list of keywords for the at least one business service category for use in a search engine and/or online directory, the method comprising acts of: generating, using at least one processor, a plurality of online marketing campaigns for a plurality of businesses, using the proposed best practices list of keywords, so that each of the plurality of online marketing campaigns includes at least one keyword from the proposed best practices list and at least some of the plurality of online marketing campaigns include at least one new keyword; specifying a listing type for each of a plurality of keywords in the at least one taxonomy in the proposed best practices list of keywords, wherein the plurality of keywords includes a first keyword and a second keyword, wherein the listing type for the first keyword specifies that the first keyword is a search engine keyword to be purchased, wherein the listing type for the second keyword specifies that the second keyword is an online directory category in which to purchase a listing; adapting, using at least one processor, the at least one taxonomy based on a collective performance of the plurality of online marketing campaigns, wherein the performance of online marketing campaigns for at least one hundred businesses is evaluated in determining whether to adapt the taxonomy, and the adapting includes adding and/or removing at least one keyword from the at least one taxonomy; after generating the plurality of online marketing campaigns for the plurality of businesses, evaluating a performance of the at least one new keyword in the at least some of the plurality of online marketing campaigns that include the at least one new keyword; determining whether the at least one new keyword satisfies at least one performance criterion; updating the at least one taxonomy to add the at least one new keyword to the best practices list of keywords for the at least one business service category, so that at least one online marketing campaign may be based upon the at least one new keyword, when it is determined that the at least one new keyword satisfies the at least one performance criterion.
17. A method of adaptively updating at least one taxonomy that specifies at least one business service category and a list of keywords that represent a proposed best practices list of keywords for the at least one business service category for use in a search engine and/or online directory, the method comprising acts of: generating, using at least one processor, a plurality of online marketing campaigns for a plurality of businesses, using the proposed best practices list of keywords, so that each of the plurality of online marketing campaigns includes at least one keyword from the proposed best practices list and at least some of the plurality of online marketing campaigns include at least one new keyword; specifying a listing type for each of a plurality of keywords in the at least one taxonomy in the proposed best practices list of keywords, wherein the plurality of keywords includes a first keyword and a second keyword, wherein the listing type for the first keyword specifies that the first keyword is a search engine keyword to be purchased, wherein the listing type for the second keyword specifies that the second keyword is an online directory category in which to purchase a listing; adapting, using at least one processor, the at least one taxonomy based on a collective performance of the plurality of online marketing campaigns, wherein the performance of online marketing campaigns for at least one hundred businesses is evaluated in determining whether to adapt the taxonomy, and the adapting includes adding and/or removing at least one keyword from the at least one taxonomy; after generating the plurality of online marketing campaigns for the plurality of businesses, evaluating a performance of the at least one new keyword in the at least some of the plurality of online marketing campaigns that include the at least one new keyword; determining whether the at least one new keyword satisfies at least one performance criterion; updating the at least one taxonomy to add the at least one new keyword to the best practices list of keywords for the at least one business service category, so that at least one online marketing campaign may be based upon the at least one new keyword, when it is determined that the at least one new keyword satisfies the at least one performance criterion. 19. The method of claim 17 , wherein the plurality of marketing campaigns comprises at least one hundred marketing campaigns.
0.818841
7,873,223
45
51
45. A non-transitory computer-readable medium comprising program instructions for performing the steps of: receiving a specification of a class network having a class, wherein a membership function defines a likelihood that an object of a data network belongs to the class; receiving a specification of a link type that defines a relation between the class and the object; receiving a specification of a process step having a domain and an algorithm, wherein the domain designates the class, and wherein the process step is part of a process hierarchy; acquiring table data values; and performing process steps of the process hierarchy to generate the data network, wherein the data network is generated by generating the object of the data network and by selectively linking selected table data values to the object according to the class network and the process hierarchy.
45. A non-transitory computer-readable medium comprising program instructions for performing the steps of: receiving a specification of a class network having a class, wherein a membership function defines a likelihood that an object of a data network belongs to the class; receiving a specification of a link type that defines a relation between the class and the object; receiving a specification of a process step having a domain and an algorithm, wherein the domain designates the class, and wherein the process step is part of a process hierarchy; acquiring table data values; and performing process steps of the process hierarchy to generate the data network, wherein the data network is generated by generating the object of the data network and by selectively linking selected table data values to the object according to the class network and the process hierarchy. 51. The computer-readable medium of claim 45 , wherein the process step performs the algorithm on each object of the class, wherein a user inputs a second membership function at run time that defines whether each object of the data network belongs to a second class of the class network, and wherein the process step is performed by program instructions that are not re-compiled before the program instructions perform the algorithm on each object of the second class.
0.5
10,133,865
8
10
8. A system for detecting malware, the system comprising: an identification module, stored in memory, that identifies a plurality of programs represented in machine code; a derivation module, stored in memory, that derives a plurality of opcode n-grams from opcode sequences within the plurality of programs, each opcode n-gram within the plurality of opcode n-grams representing a sequence of opcodes extracted from a program within the plurality of programs; a training module, stored in memory, that trains an autoencoder by using the plurality of opcode n-grams as input; a discovery module, stored in memory, that discovers a set of features within the autoencoder after training the autoencoder, each feature within the set of features comprising a linear combination of opcode n-grams from the plurality of opcode n-grams; a classification module, stored in memory, that classifies a potentially malicious program as malicious by using the set of features discovered within the autoencoder to analyze the potentially malicious program by: initializing a neural network with the set of features discovered within the autoencoder; training the neural network with supervision using a training set labeled to indicate whether each sample within the training set is malicious; and classifying the potentially malicious program using the trained neural network; and at least one physical processor configured to execute the identification module, the derivation module, the training module, the discovery module, and the classification module.
8. A system for detecting malware, the system comprising: an identification module, stored in memory, that identifies a plurality of programs represented in machine code; a derivation module, stored in memory, that derives a plurality of opcode n-grams from opcode sequences within the plurality of programs, each opcode n-gram within the plurality of opcode n-grams representing a sequence of opcodes extracted from a program within the plurality of programs; a training module, stored in memory, that trains an autoencoder by using the plurality of opcode n-grams as input; a discovery module, stored in memory, that discovers a set of features within the autoencoder after training the autoencoder, each feature within the set of features comprising a linear combination of opcode n-grams from the plurality of opcode n-grams; a classification module, stored in memory, that classifies a potentially malicious program as malicious by using the set of features discovered within the autoencoder to analyze the potentially malicious program by: initializing a neural network with the set of features discovered within the autoencoder; training the neural network with supervision using a training set labeled to indicate whether each sample within the training set is malicious; and classifying the potentially malicious program using the trained neural network; and at least one physical processor configured to execute the identification module, the derivation module, the training module, the discovery module, and the classification module. 10. The system of claim 8 , wherein the classification module uses the set of features discovered within the autoencoder to analyze the potentially malicious program by: extracting the set of features discovered within the autoencoder from the potentially malicious program; providing the extracted set of features as input to a machine learning classifier previously trained according to the set of features discovered within the autoencoder.
0.5
9,860,061
8
13
8. A system for encrypting information using a computational tag, the system comprising: a mobile electronic device; and a computer-readable storage medium comprising one or more programming instructions that, when executed, cause the mobile electronic device to: detect a computational tag within a near field communication range of the mobile electronic device, identify a document to be encrypted by: in response to detecting the computational tag, causing a storage application on the mobile electronic device to open and one or more stored documents to be displayed, and receiving a selection of one of the stored documents, encrypt the document and generating an unencrypted key that may be used to decrypt the encrypted document, transmit the unencrypted key to the computational tag, receive, from the computational tag, an encrypted key, wherein the encrypted key comprises an encrypted version of the unencrypted key, and store the encrypted key in a memory of the mobile electronic device and not retaining the unencrypted key in the memory of the mobile electronic device.
8. A system for encrypting information using a computational tag, the system comprising: a mobile electronic device; and a computer-readable storage medium comprising one or more programming instructions that, when executed, cause the mobile electronic device to: detect a computational tag within a near field communication range of the mobile electronic device, identify a document to be encrypted by: in response to detecting the computational tag, causing a storage application on the mobile electronic device to open and one or more stored documents to be displayed, and receiving a selection of one of the stored documents, encrypt the document and generating an unencrypted key that may be used to decrypt the encrypted document, transmit the unencrypted key to the computational tag, receive, from the computational tag, an encrypted key, wherein the encrypted key comprises an encrypted version of the unencrypted key, and store the encrypted key in a memory of the mobile electronic device and not retaining the unencrypted key in the memory of the mobile electronic device. 13. The system of claim 8 , wherein the computer-readable storage medium further comprises one or more programming instructions that, when executed, cause the mobile electronic device to: receive a request to access the encrypted document; determine whether the request is accompanied by a valid decryption action; and if the request includes a valid decryption action, decrypt the encrypted document and present a decrypted version of the encrypted document to a user of the mobile electronic device, otherwise neither decrypt the encrypted document nor present the decrypted version of the encrypted document to the user.
0.5
9,015,803
33
48
33. An apparatus comprising: one or more non-transitory computer-readable storage devices comprising processor- executable instructions, the processor-executable instructions capable of causing one or more processors of a server computer system to perform the following method steps: establishing an account for each of a plurality of users, wherein each account is associated with storage space to store one or more documents; storing a first document in the server computer system in a first account, the first document capable of being modified by a plurality of authorized users; enabling access to the first document via a browser-controlled window executing on a client computer by one or more authorized users; associating a set of restrictions with the first document, the restrictions including an ability to modify the first document in one or more permitted ways by one of a first group of users, the first group of users being users whose identities are known to the server computer system; receiving a request to access the first document from a first user, wherein the first user is a member of the first group of users, wherein the request to access accompanies the first user's identification information and authorization information; verifying the identity of the first user; if the first user is authorized to access the first document, then permitting the first user to access the first document via a first browser-controlled window executing on a client computer; and if the first user is authorized to modify the first document, then: (a) applying one or more modifications to the first document, the one or more modifications having been received from the first user; (b) electronically notifying one or more of a second group of users that the first user modified the first document, the second group of users being users whose identities are known to the server computer system; and (c) enabling a second user to further modify the first document, wherein the second user is a member of the second group of users who are notified of the one or more modifications made by the first user to the first document, and wherein the second user is not the same as the first user.
33. An apparatus comprising: one or more non-transitory computer-readable storage devices comprising processor- executable instructions, the processor-executable instructions capable of causing one or more processors of a server computer system to perform the following method steps: establishing an account for each of a plurality of users, wherein each account is associated with storage space to store one or more documents; storing a first document in the server computer system in a first account, the first document capable of being modified by a plurality of authorized users; enabling access to the first document via a browser-controlled window executing on a client computer by one or more authorized users; associating a set of restrictions with the first document, the restrictions including an ability to modify the first document in one or more permitted ways by one of a first group of users, the first group of users being users whose identities are known to the server computer system; receiving a request to access the first document from a first user, wherein the first user is a member of the first group of users, wherein the request to access accompanies the first user's identification information and authorization information; verifying the identity of the first user; if the first user is authorized to access the first document, then permitting the first user to access the first document via a first browser-controlled window executing on a client computer; and if the first user is authorized to modify the first document, then: (a) applying one or more modifications to the first document, the one or more modifications having been received from the first user; (b) electronically notifying one or more of a second group of users that the first user modified the first document, the second group of users being users whose identities are known to the server computer system; and (c) enabling a second user to further modify the first document, wherein the second user is a member of the second group of users who are notified of the one or more modifications made by the first user to the first document, and wherein the second user is not the same as the first user. 48. The apparatus of claim 33 , wherein first document is a word-processor document, a spread sheet, or a presentation.
0.933668
7,974,912
32
34
32. A computer system that manages pay-per-click advertising, by determining an amount to be charged in response to a click of a hyperlink associated with a target keyword, comprising a memory, and processing hardware configured to: access from memory a particular amount a first advertiser is willing to be charged in response to a click of a hyperlink associated with said target keyword and associated with said first advertiser, access from memory a statistic of relevance to said first advertiser and a statistic of relevance to a second advertiser, said statistics being related to one or more of rate of user by users, number of times a hyperlink was viewed, data that related to an increase or decrease in the use of a keyword by users, demographics of users associated with a keyword, or demographics of advertisers associated with a keyword, and without human intervention, determine an amount charged to a second advertiser in response to a click of a hyperlink associated with said target keyword and said second advertiser, wherein said amount to be charged to said second advertiser is determined using said particular amount, and is also determined using said statistic of relevance to said first advertiser and said statistic of relevance to said second advertiser.
32. A computer system that manages pay-per-click advertising, by determining an amount to be charged in response to a click of a hyperlink associated with a target keyword, comprising a memory, and processing hardware configured to: access from memory a particular amount a first advertiser is willing to be charged in response to a click of a hyperlink associated with said target keyword and associated with said first advertiser, access from memory a statistic of relevance to said first advertiser and a statistic of relevance to a second advertiser, said statistics being related to one or more of rate of user by users, number of times a hyperlink was viewed, data that related to an increase or decrease in the use of a keyword by users, demographics of users associated with a keyword, or demographics of advertisers associated with a keyword, and without human intervention, determine an amount charged to a second advertiser in response to a click of a hyperlink associated with said target keyword and said second advertiser, wherein said amount to be charged to said second advertiser is determined using said particular amount, and is also determined using said statistic of relevance to said first advertiser and said statistic of relevance to said second advertiser. 34. The computer system of claim 32 wherein at least one said statistic is related to a number of times a link to an advertiser's web site is produced by the paid search engine over a period of time.
0.634191
8,244,769
1
4
1. An ontology processing device for processing an ontology, comprising: a data input device; a memory; a processor; and a computer program with instructions that, when said processor executes said instructions, is configured as a structuralizing device which corrects a structure of ontology in a prescribed form created from a set of instance data containing a combination of a subject, a property, and an object expressed with a character string; wherein the structuralizing device comprises a necessity degree judging device which judges whether each of the properties contained in the ontology is an essential property or unessential property for a concept that is defined within the ontology and related to each of the properties according to statistical features of the objects contained in the set of the instance data, and corrects the structure of the ontology regarding the corresponding properties according to results of the judgments, and wherein the necessity degree judging device changes the property that is judged as unessential to a property having an inverted definition range and an inverted value range.
1. An ontology processing device for processing an ontology, comprising: a data input device; a memory; a processor; and a computer program with instructions that, when said processor executes said instructions, is configured as a structuralizing device which corrects a structure of ontology in a prescribed form created from a set of instance data containing a combination of a subject, a property, and an object expressed with a character string; wherein the structuralizing device comprises a necessity degree judging device which judges whether each of the properties contained in the ontology is an essential property or unessential property for a concept that is defined within the ontology and related to each of the properties according to statistical features of the objects contained in the set of the instance data, and corrects the structure of the ontology regarding the corresponding properties according to results of the judgments, and wherein the necessity degree judging device changes the property that is judged as unessential to a property having an inverted definition range and an inverted value range. 4. The ontology processing device as claimed in claim 1 , wherein the necessity degree judging device records a combination of the property that is a target of judgment and respective elements within the ontology corresponding to the definition range and the value range of the property as the result of the judgment.
0.862054
9,165,116
15
19
15. A method for providing structured clinical information from patient records, the method comprising: mining, by a processor, unstructured free text in a physician's note of a patient record from a healthcare provider, the mining comprising extracting evidence of a first value of a first variable; creating, probabilistically by the processor, structured clinical data of values for respective multiple variables including the first value of the first variable, the structured clinical data for each of the multiple values created from multiple sources of mined evidence, the evidence of the first value being one of the multiple sources of mined evidence for the first variable; and providing the mining of the unstructured free text as a service to the healthcare provider; outputting at least one of the multiple values from the structured clinical data as a function of an input question regarding a patient.
15. A method for providing structured clinical information from patient records, the method comprising: mining, by a processor, unstructured free text in a physician's note of a patient record from a healthcare provider, the mining comprising extracting evidence of a first value of a first variable; creating, probabilistically by the processor, structured clinical data of values for respective multiple variables including the first value of the first variable, the structured clinical data for each of the multiple values created from multiple sources of mined evidence, the evidence of the first value being one of the multiple sources of mined evidence for the first variable; and providing the mining of the unstructured free text as a service to the healthcare provider; outputting at least one of the multiple values from the structured clinical data as a function of an input question regarding a patient. 19. The method of claim 15 wherein mining comprises mining as a function of institution-specific domain knowledge of the healthcare provider.
0.765
7,743,050
14
16
14. A system, comprising: a repository to store data corresponding to a plurality of prior searches, the data including information regarding users, information regarding query data provided by the users, and information regarding documents retrieved based, at least in part, on searches performed using the query data; and one or more devices to: select a candidate condition based, at least in part, on the data in the repository, estimate a weight for the candidate condition, form a new rule from the candidate condition and the weight, compare a likelihood of occurrence of the data in the repository given a model with the new rule and a likelihood of occurrence of the data in the repository given the model without the new rule, determine, based on the comparison, that a difference of the likelihood of occurrence of the data in the repository given the model with the new rule and the likelihood of occurrence of the data in the repository given the model without the new rule is greater than a cost, and add the new rule to the model upon determining that the difference of the likelihood of occurrence of the data in the repository given the new rule and the likelihood of occurrence of the data in the repository given the model without the new rule is greater than the cost.
14. A system, comprising: a repository to store data corresponding to a plurality of prior searches, the data including information regarding users, information regarding query data provided by the users, and information regarding documents retrieved based, at least in part, on searches performed using the query data; and one or more devices to: select a candidate condition based, at least in part, on the data in the repository, estimate a weight for the candidate condition, form a new rule from the candidate condition and the weight, compare a likelihood of occurrence of the data in the repository given a model with the new rule and a likelihood of occurrence of the data in the repository given the model without the new rule, determine, based on the comparison, that a difference of the likelihood of occurrence of the data in the repository given the model with the new rule and the likelihood of occurrence of the data in the repository given the model without the new rule is greater than a cost, and add the new rule to the model upon determining that the difference of the likelihood of occurrence of the data in the repository given the new rule and the likelihood of occurrence of the data in the repository given the model without the new rule is greater than the cost. 16. The system of claim 14 , where when estimating the weight for the candidate condition, the one or more devices are to estimate the weight as a weight that maximizes a log likelihood of occurrence of the data in the repository given the model with the new rule.
0.697248
9,792,520
7
8
7. The method of claim 1 , wherein the step of assigning each word image to a word cluster based on its feature vector, comprises: calculating a distance between each one of the multiple word images and every other one of the multiple word images, based on feature vectors associated with those word images; selecting, from among the multiple word images, two of the word images that are closest in distance to each other; and assigning the two of the word images to the word cluster.
7. The method of claim 1 , wherein the step of assigning each word image to a word cluster based on its feature vector, comprises: calculating a distance between each one of the multiple word images and every other one of the multiple word images, based on feature vectors associated with those word images; selecting, from among the multiple word images, two of the word images that are closest in distance to each other; and assigning the two of the word images to the word cluster. 8. The method of claim 7 , further comprising: selecting, from among the multiple word images other than the assigned word images, an additional one of the multiple word images that is closest to the representative word image; assigning the additional one of the word images to the word cluster; and repeating the foregoing steps until a predetermined number of the multiple word images have been assigned to the word cluster.
0.5
8,239,226
1
14
1. A method of combining properties and methods from a plurality of different database systems, the method comprising: executing a first broker service to interact with a first data source using a first protocol to generate a first business object, the first business object including a first property and a first method wherein the first property and the first method define the first business object, the first business object being in a declarative format; executing a second broker service to interact with a second data source using a second protocol to generate a second business object, the first protocol being different than the second protocol, the second business object including a second property and a second method wherein the second property and the second method define the second business object, the second business object being in the declarative format; executing an object broker process to generate a first combined business object that includes the first property, the first method, the second property and the second method, wherein the first property, the first method, the second property and the second method define the first combined business object, the object broker process using the first broker service and the second broker service; storing the first combined business object, the first combined business object being in the declarative format accessing the first combined business object through a form; adding additional data to the first combined business object through the form, and if the additional data cannot be stored in the first data source or the second data source, adding an add-on data source to the plurality of different database systems, the add-on data source including properties and methods, and storing the additional data in the add-on data source; executing an object broker process to generate a second combined business object that includes the first property, the first method, the second property, the second method, and at least one property or method from the add-on data source, wherein the first property, the first method, the second property, the second method and the at least one property or method from the add-on data source define the second combined business object, the object broker process using the first broker service and the second broker service; and storing the second combined business object, the second combined business object being in the declarative format.
1. A method of combining properties and methods from a plurality of different database systems, the method comprising: executing a first broker service to interact with a first data source using a first protocol to generate a first business object, the first business object including a first property and a first method wherein the first property and the first method define the first business object, the first business object being in a declarative format; executing a second broker service to interact with a second data source using a second protocol to generate a second business object, the first protocol being different than the second protocol, the second business object including a second property and a second method wherein the second property and the second method define the second business object, the second business object being in the declarative format; executing an object broker process to generate a first combined business object that includes the first property, the first method, the second property and the second method, wherein the first property, the first method, the second property and the second method define the first combined business object, the object broker process using the first broker service and the second broker service; storing the first combined business object, the first combined business object being in the declarative format accessing the first combined business object through a form; adding additional data to the first combined business object through the form, and if the additional data cannot be stored in the first data source or the second data source, adding an add-on data source to the plurality of different database systems, the add-on data source including properties and methods, and storing the additional data in the add-on data source; executing an object broker process to generate a second combined business object that includes the first property, the first method, the second property, the second method, and at least one property or method from the add-on data source, wherein the first property, the first method, the second property, the second method and the at least one property or method from the add-on data source define the second combined business object, the object broker process using the first broker service and the second broker service; and storing the second combined business object, the second combined business object being in the declarative format. 14. The method of claim 1 , including displaying a setup sequence associated with the combined business object by: displaying a plurality of thumbnail images in a first area of a display, each of the thumbnail images representing a step in the setup sequence; displaying a full image in a second area of the display, the full image representing one of the steps in the setup sequence; detecting a first event associated with a thumbnail image in the plurality of thumbnail images; and displaying a popup image in response to detecting the first event, the popup image being a larger version of the thumbnail image associated with the first event.
0.670072
8,229,949
1
8
1. A next search keyword presentation apparatus, comprising: an input unit for inputting a search keyword; a search control unit which sends the search keyword to a search system and receives a search result from the search system in the form of a plurality of documents; a display unit which displays the documents of the search result; a text body extraction unit which extracts a text body from the plurality of search result documents, wherein the text body extraction unit removes a portion from the plurality of search result documents deemed unrelated to the text body; an analysis unit which carries out a semantic attribute analysis of words contained within the text body; a storage unit which stores the search keyword as user history data uniquely provided for each user; a creation unit which creates document representative information based on the semantic attributes of each word and the history data; and a cluster representative keyword extraction unit which clusters document characteristic information and extracts cluster representative keywords; wherein the display unit displays the cluster representative keywords as the next search keyword candidate in response to inputting the search keyword.
1. A next search keyword presentation apparatus, comprising: an input unit for inputting a search keyword; a search control unit which sends the search keyword to a search system and receives a search result from the search system in the form of a plurality of documents; a display unit which displays the documents of the search result; a text body extraction unit which extracts a text body from the plurality of search result documents, wherein the text body extraction unit removes a portion from the plurality of search result documents deemed unrelated to the text body; an analysis unit which carries out a semantic attribute analysis of words contained within the text body; a storage unit which stores the search keyword as user history data uniquely provided for each user; a creation unit which creates document representative information based on the semantic attributes of each word and the history data; and a cluster representative keyword extraction unit which clusters document characteristic information and extracts cluster representative keywords; wherein the display unit displays the cluster representative keywords as the next search keyword candidate in response to inputting the search keyword. 8. The apparatus according to claim 1 , wherein the display unit displays the next search keyword candidates in a separate pop-up window when the user brings the cursor above search result document links.
0.658863
10,015,553
17
18
17. A non-transitory machine-readable storage medium, comprising executable instructions that, when executed by a processing system including a processor, facilitate performance of operations, the operations comprising: associating a telephone number with media content; storing the telephone number in a memory coupled to the processing system, resulting in a stored telephone number; presenting the media content at a display device, wherein the associating and the storing are performed prior to the presenting; determining that an image pattern displayed from a video component of the media content and presented at the display device represents a first telephone number, using image pattern recognition, wherein the determining further comprises: recognizing a telephone number format in the image pattern, and detecting that the image pattern conforms to a valid telephone number; converting the image pattern to detect the first telephone number, resulting in a detected first telephone number; comparing the detected first telephone number with the stored telephone number to determine whether the detected first telephone number matches the stored telephone number; responsive to the detected first telephone number having been detected, determining a second telephone number from an audio component of the media content using speech recognition; and responsive to determining a matching condition including a first match between the detected first telephone number and the stored telephone number and a second match between the detected first telephone number and the second telephone number, presenting an option to establish voice communication with a party associated with the media content.
17. A non-transitory machine-readable storage medium, comprising executable instructions that, when executed by a processing system including a processor, facilitate performance of operations, the operations comprising: associating a telephone number with media content; storing the telephone number in a memory coupled to the processing system, resulting in a stored telephone number; presenting the media content at a display device, wherein the associating and the storing are performed prior to the presenting; determining that an image pattern displayed from a video component of the media content and presented at the display device represents a first telephone number, using image pattern recognition, wherein the determining further comprises: recognizing a telephone number format in the image pattern, and detecting that the image pattern conforms to a valid telephone number; converting the image pattern to detect the first telephone number, resulting in a detected first telephone number; comparing the detected first telephone number with the stored telephone number to determine whether the detected first telephone number matches the stored telephone number; responsive to the detected first telephone number having been detected, determining a second telephone number from an audio component of the media content using speech recognition; and responsive to determining a matching condition including a first match between the detected first telephone number and the stored telephone number and a second match between the detected first telephone number and the second telephone number, presenting an option to establish voice communication with a party associated with the media content. 18. The non-transitory machine-readable storage medium of claim 17 , wherein the converting comprises converting the image pattern to a first text comprising the detected first telephone number, and wherein the operations further comprise: converting the audio component of the media content to a second text; detecting the second telephone number in the second text; and comparing the first text with the second text to determine whether the first telephone number matches the second telephone number.
0.5
9,665,765
1
16
1. A method comprising, by a computing device: accessing an image associated with an online social network, wherein the image portrays at least a first person; calculating, for each user in a first set of users of the online social network, a facial-recognition score with respect to the first person portrayed in the image, wherein the facial-recognition score is based at least in part on: a social-graph affinity associated with the user; and a facial-representation associated with the user, wherein the facial-representation associated with the user is compared with the image; and tagging the image with a particular user in the first set of users based on the calculated facial-recognition scores.
1. A method comprising, by a computing device: accessing an image associated with an online social network, wherein the image portrays at least a first person; calculating, for each user in a first set of users of the online social network, a facial-recognition score with respect to the first person portrayed in the image, wherein the facial-recognition score is based at least in part on: a social-graph affinity associated with the user; and a facial-representation associated with the user, wherein the facial-representation associated with the user is compared with the image; and tagging the image with a particular user in the first set of users based on the calculated facial-recognition scores. 16. The method of claim 1 , wherein the image is associated with a first set of images, and wherein the social-graph affinity for each user is based at least in part on a tag-history information of the other images in the first set of images.
0.725
8,626,691
8
12
8. A system, comprising: a processor; and memory storing code that when executed causes the processor to perform operations, the operations comprising: collecting Internet Protocol traffic information; merging the Internet Protocol traffic information having a common source address and a common destination address to generate unidirectional flows; merging the Internet Protocol traffic information having a source address and an opposing destination address to generate bidirectional flows; separating valid bidirectional flows from invalid bidirectional flows; retrieving a set of heuristic rules from memory for determining the server, wherein one heuristic rule differentiates the server from a client based on a difference in timestamps of the unidirectional flows; determining an output of each heuristic rule in the set of heuristic rules based on the valid bidirectional flows; combining all outputs produced by the set of heuristic rules; and generating a probability that the source address corresponds to the server based on combined outputs produced by the set of heuristic rules.
8. A system, comprising: a processor; and memory storing code that when executed causes the processor to perform operations, the operations comprising: collecting Internet Protocol traffic information; merging the Internet Protocol traffic information having a common source address and a common destination address to generate unidirectional flows; merging the Internet Protocol traffic information having a source address and an opposing destination address to generate bidirectional flows; separating valid bidirectional flows from invalid bidirectional flows; retrieving a set of heuristic rules from memory for determining the server, wherein one heuristic rule differentiates the server from a client based on a difference in timestamps of the unidirectional flows; determining an output of each heuristic rule in the set of heuristic rules based on the valid bidirectional flows; combining all outputs produced by the set of heuristic rules; and generating a probability that the source address corresponds to the server based on combined outputs produced by the set of heuristic rules. 12. The system according to claim 8 , wherein the operations further comprise retrieving an interval of time for collecting the Internet Protocol traffic information.
0.640693
8,463,606
12
13
12. A method for managing interactions in a contact center, comprising: monitoring and analyzing, by a processor, a communication with a customer; verifying, by the processor, an identity of the customer based on the analyzed communication; detecting, by the processor, a topic or an emotional state of the customer or a contact center agent based on the analyzed communication; and providing, by the processor, real-time advice to the contact center agent based on the detected topic or the emotional state in response to the identity of the customer being verified.
12. A method for managing interactions in a contact center, comprising: monitoring and analyzing, by a processor, a communication with a customer; verifying, by the processor, an identity of the customer based on the analyzed communication; detecting, by the processor, a topic or an emotional state of the customer or a contact center agent based on the analyzed communication; and providing, by the processor, real-time advice to the contact center agent based on the detected topic or the emotional state in response to the identity of the customer being verified. 13. The method of claim 12 , wherein analyzing the communication further comprises comparing, by the processor, a voice of the customer to a voice sample.
0.686992
10,158,596
8
9
8. The method of claim 1 further comprising: modifying an original character of a correctly-spelled domain name to generate one or more misspelled domain names that include the misspelled domain name; including the one or more misspelled domain names in the matching domain correction record.
8. The method of claim 1 further comprising: modifying an original character of a correctly-spelled domain name to generate one or more misspelled domain names that include the misspelled domain name; including the one or more misspelled domain names in the matching domain correction record. 9. The method of claim 8 wherein the modifying comprises removing the original character.
0.649606
9,171,326
11
12
11. The method of claim 1 , further comprising: determining the close friends of the user by analyzing interaction on social media between the user and one or more friends of the user.
11. The method of claim 1 , further comprising: determining the close friends of the user by analyzing interaction on social media between the user and one or more friends of the user. 12. The method of claim 11 , further comprising: selecting products corresponding to the interest profile; and transmitting a gift recommendation including the selected products to a second user.
0.5
8,572,115
23
30
23. A server for identifying negative words, comprising one or more processors, a memory coupled to the one or more processors, and a network interface, the one or more processors configured to: receive data encoding an advertisement item and a log comprising a plurality of previously submitted search criteria, wherein each search criterion comprises one or more terms, and wherein when the search criterion was evaluated, the advertisement item was presented in a corresponding search result webpage; evaluate the plurality of previously submitted search criteria to identify one or more negative keywords by: identifying, from the plurality of previously submitted search criteria, a subset of search criteria as being off-topic to the advertisement item, and deriving the one or more negative keywords from the subset of off-topic search criteria; generate one or more files including the one or more negative keywords, the one or more negative keywords prevent the advertisement item from being presented in a search result corresponding to a later submitted search criterion containing at least one of the identified negative keywords; and store the one or more files on computer-readable media.
23. A server for identifying negative words, comprising one or more processors, a memory coupled to the one or more processors, and a network interface, the one or more processors configured to: receive data encoding an advertisement item and a log comprising a plurality of previously submitted search criteria, wherein each search criterion comprises one or more terms, and wherein when the search criterion was evaluated, the advertisement item was presented in a corresponding search result webpage; evaluate the plurality of previously submitted search criteria to identify one or more negative keywords by: identifying, from the plurality of previously submitted search criteria, a subset of search criteria as being off-topic to the advertisement item, and deriving the one or more negative keywords from the subset of off-topic search criteria; generate one or more files including the one or more negative keywords, the one or more negative keywords prevent the advertisement item from being presented in a search result corresponding to a later submitted search criterion containing at least one of the identified negative keywords; and store the one or more files on computer-readable media. 30. The server of claim 23 , wherein the one or more processors are further configured to derive the one or more negative keywords from the subset of off-topic search criteria by: identifying subsets of words in each of the off-topic search criteria; associating each subset of words with an importance metric; and summing the associated importance metric for each occurrence of the subset of words in the off-topic search criteria.
0.5
9,547,998
1
43
1. A computer-implemented method for training a user, comprising: by a sensor, sensing at least one action performed by the user and data corresponding to the at least one action to yield sensed data, wherein: the sensor comprises a USB sensor device and the sensing comprises detecting that a user of an electronic device has connected a USB device to the electronic device, the sensor comprises a Wi-Fi sensor device and the sensing comprises detecting that the user has connected the electronic device to a Wi-Fi access point, the sensor comprises a Bluetooth headset usage detection sensor and the sensing comprises identifying Bluetooth headset use, the sensor comprises a camera coupled with a computer vision program, or the sensor comprises a physical location tracking sensor and the sensing comprises detecting a location of the user; by a computer system comprising a processor, executing computer-readable programming instructions that cause the system to: access a data storage device that stores a training needs model that comprises an estimate of at least one of a cost and a benefit of exposing the user to at least one available training action, apply, to the training needs model, the sensed data to identify a cybersecurity threat scenario for which the user is at risk, access a collection of available training actions and select, based on the sensed data and the cybersecurity threat scenario, at least one training action from the collection of available training actions, and cause the selected at least one cybersecurity training action to be delivered to the user.
1. A computer-implemented method for training a user, comprising: by a sensor, sensing at least one action performed by the user and data corresponding to the at least one action to yield sensed data, wherein: the sensor comprises a USB sensor device and the sensing comprises detecting that a user of an electronic device has connected a USB device to the electronic device, the sensor comprises a Wi-Fi sensor device and the sensing comprises detecting that the user has connected the electronic device to a Wi-Fi access point, the sensor comprises a Bluetooth headset usage detection sensor and the sensing comprises identifying Bluetooth headset use, the sensor comprises a camera coupled with a computer vision program, or the sensor comprises a physical location tracking sensor and the sensing comprises detecting a location of the user; by a computer system comprising a processor, executing computer-readable programming instructions that cause the system to: access a data storage device that stores a training needs model that comprises an estimate of at least one of a cost and a benefit of exposing the user to at least one available training action, apply, to the training needs model, the sensed data to identify a cybersecurity threat scenario for which the user is at risk, access a collection of available training actions and select, based on the sensed data and the cybersecurity threat scenario, at least one training action from the collection of available training actions, and cause the selected at least one cybersecurity training action to be delivered to the user. 43. The method of claim 1 , wherein the selected cybersecurity training action comprises at least one of safely using a computing device outside the office, safely using a USB-enabled device, learning safe password management practices, learning safe smart phone security practices, learning safe practices relating to protecting sensitive information, learning safe practices for carrying sensitive data out of a workplace, and learning safe practices relating to access to social networking sites.
0.694614
7,944,593
1
5
1. A method operable on a data processing system including a print server and a presentation device for color conversion on the presentation device, the method comprising: receiving, by the print server, a presentation datastream including presentation data and a first descriptor value identifying an input color space of the presentation data; processing, by operation of the print server, the presentation datastream to identify the first descriptor value; identifying, by operation of the print server, a second descriptor value for an output color space of the presentation device; identifying, by operation of the print server, a link color conversion Color Management Resource (CMR) using the first descriptor value from the presentation datastream and the second descriptor value, wherein the link color conversion CMR includes the first descriptor value, the second descriptor value, and a rule for converting the input color space to the output color space; and transmitting, from the print server to the presentation device, the link color conversion CMR and the presentation datastream for use by the presentation device to convert the presentation data for output at the presentation device.
1. A method operable on a data processing system including a print server and a presentation device for color conversion on the presentation device, the method comprising: receiving, by the print server, a presentation datastream including presentation data and a first descriptor value identifying an input color space of the presentation data; processing, by operation of the print server, the presentation datastream to identify the first descriptor value; identifying, by operation of the print server, a second descriptor value for an output color space of the presentation device; identifying, by operation of the print server, a link color conversion Color Management Resource (CMR) using the first descriptor value from the presentation datastream and the second descriptor value, wherein the link color conversion CMR includes the first descriptor value, the second descriptor value, and a rule for converting the input color space to the output color space; and transmitting, from the print server to the presentation device, the link color conversion CMR and the presentation datastream for use by the presentation device to convert the presentation data for output at the presentation device. 5. The method of claim 1 further comprising: converting, by operation of the presentation device, the presentation data from the input color space to the output color space using the rule for conversion; and outputting, by operation of the presentation device, the converted presentation data in the second color space on the presentation device.
0.538667
9,002,102
1
8
1. A method of generating training documents for training a classifying device comprising, with a processor: determining a number of sub-samples in a number of original documents; and creating a number of pseudo-documents from the sub-samples, the pseudo-documents comprising a portion of the number of sub-samples, in which each of the pseudo-documents are created by deleting a number of the sub-samples through a jackknife statistical method.
1. A method of generating training documents for training a classifying device comprising, with a processor: determining a number of sub-samples in a number of original documents; and creating a number of pseudo-documents from the sub-samples, the pseudo-documents comprising a portion of the number of sub-samples, in which each of the pseudo-documents are created by deleting a number of the sub-samples through a jackknife statistical method. 8. The method of claim 1 , in which creating a number of pseudo-documents comprises creating at least 10 pseudo-documents per original document.
0.612903
8,190,626
2
3
2. The computer-implemented method of claim 1 , wherein step (a) comprises: normalizing a first data entry to generate a first normalized data entry; generating variants of the first normalized data entry, to generate at least one first variant; scoring the at least one first variant to generate a first scored variant, wherein the first scored variant comprises the first variant and the first score; and anonymizing the first scored variant to generate the anonymized first entry.
2. The computer-implemented method of claim 1 , wherein step (a) comprises: normalizing a first data entry to generate a first normalized data entry; generating variants of the first normalized data entry, to generate at least one first variant; scoring the at least one first variant to generate a first scored variant, wherein the first scored variant comprises the first variant and the first score; and anonymizing the first scored variant to generate the anonymized first entry. 3. The computer-implemented method of claim 2 , wherein the step of generating variants comprise at least one of the following steps: generating variants based on transliteration; generating variants based on translation; generating variants based on segmentation of words; generating variants based on combination of words; generating variants based on common typographical errors; generating variants based on spelling variations; and generating variants based on known variations in name parts.
0.5
8,204,749
2
3
2. The method of claim 1 , wherein at least one prompt of the non-repetitive prompts comprises a greeting prompt, a re-prompt, a specification prompt, an acknowledgement prompt, and an informative prompt.
2. The method of claim 1 , wherein at least one prompt of the non-repetitive prompts comprises a greeting prompt, a re-prompt, a specification prompt, an acknowledgement prompt, and an informative prompt. 3. The method of claim 2 , wherein detecting the emotion of the user further is based on prosodic and lexical features extracted from the received utterance.
0.5
9,591,065
1
2
1. A method performed by a device associated with an apparatus, the method comprising: receiving a script from a processing device, the script containing simple object access protocol (SOAP) commands for execution, the script defining one or more variables that are used in execution of the script, at least some of the SOAP commands in the script including corresponding arguments; interpreting the script to execute functions contained in the script; parsing the SOAP commands from the script during execution of the functions; executing the SOAP commands; wherein the apparatus is configured by execution of the SOAP commands and the functions; and wherein the execution of the SOAP commands and the functions comprises passing a variable in the script as an argument to a first SOAP command, returning an output of the first SOAP command to the script, and executing a second SOAP command based on the output.
1. A method performed by a device associated with an apparatus, the method comprising: receiving a script from a processing device, the script containing simple object access protocol (SOAP) commands for execution, the script defining one or more variables that are used in execution of the script, at least some of the SOAP commands in the script including corresponding arguments; interpreting the script to execute functions contained in the script; parsing the SOAP commands from the script during execution of the functions; executing the SOAP commands; wherein the apparatus is configured by execution of the SOAP commands and the functions; and wherein the execution of the SOAP commands and the functions comprises passing a variable in the script as an argument to a first SOAP command, returning an output of the first SOAP command to the script, and executing a second SOAP command based on the output. 2. The method of claim 1 , further comprising: sending a command, at time intervals, to poll the processing device for the script.
0.772727
9,171,045
1
6
1. A method comprising: receiving a set of queries at a computing device, wherein each query is associated with a user who provided the query and each query has an associated time; dividing the received set of queries into a set of queries that are commercial queries and a set of queries that are non-commercial queries, by the computing device; generating a first set of query communities from the set of queries that are non-commercial queries and a second set of query communities from the set of queries that are commercial queries by the computing device, wherein each query community comprises a plurality of queries of the set of queries and each query in a query community is related to each other query in the query community, wherein a first query is related to a second query if the first query and the second query were provided by the same user with associated times that are within a time window more than a threshold number of times; determining a set of mappings of query communities from the first set of query communities to query communities from the second set of query communities by the computing device according to the users and times associated with the queries in the query communities; receiving a query from the first set of query communities at the computing device; and recommending one or more queries from the second set of query communities using the received query and the set of mappings.
1. A method comprising: receiving a set of queries at a computing device, wherein each query is associated with a user who provided the query and each query has an associated time; dividing the received set of queries into a set of queries that are commercial queries and a set of queries that are non-commercial queries, by the computing device; generating a first set of query communities from the set of queries that are non-commercial queries and a second set of query communities from the set of queries that are commercial queries by the computing device, wherein each query community comprises a plurality of queries of the set of queries and each query in a query community is related to each other query in the query community, wherein a first query is related to a second query if the first query and the second query were provided by the same user with associated times that are within a time window more than a threshold number of times; determining a set of mappings of query communities from the first set of query communities to query communities from the second set of query communities by the computing device according to the users and times associated with the queries in the query communities; receiving a query from the first set of query communities at the computing device; and recommending one or more queries from the second set of query communities using the received query and the set of mappings. 6. The method of claim 1 , wherein determining the set of mappings of query communities from the first set of query communities to query communities from the second set of query communities comprises, for each unique pair of query communities comprising a query community from the first set of query communities and a query community from the second set of query communities: determining, from the set of queries, a first amount of users who provided a query from the query community from the first set of query communities followed by a query from the query community from the second set of query communities; determining, from the set of queries, a second amount of users who provided a query from the query community from the second set of query communities followed by a query from the query community from the first set of query communities; and if the first amount is greater than a threshold amount, and the first amount is greater than the second amount, adding a mapping from the query community from the first set of query communities to the query community from the second set of query communities to the set of mappings.
0.54318
9,170,785
11
17
11. A system for generating a parameter value for an executable statement, comprising: a processor and a memory coupled to the processor, the memory configured to store program code executable by the processor; the program code configured, when executed by the processor, to identify, in a plurality of program statements, an input statement, wherein the input statement comprises input information; the program code configured, when executed by the processor, to identify, in the plurality of program statements, an output statement associated with the input statement; wherein: the output statement comprises a reference to a temporary data set, and another of the plurality of program statements also includes a parameter reference to the temporary data set; the program code configured, when executed by the processor, to modify the input information by performing symbolic substitution on at least a portion of the input information to produce modified input information; and the program code configured, when executed by the processor, to output according to the output statement the modified input information to the temporary data set.
11. A system for generating a parameter value for an executable statement, comprising: a processor and a memory coupled to the processor, the memory configured to store program code executable by the processor; the program code configured, when executed by the processor, to identify, in a plurality of program statements, an input statement, wherein the input statement comprises input information; the program code configured, when executed by the processor, to identify, in the plurality of program statements, an output statement associated with the input statement; wherein: the output statement comprises a reference to a temporary data set, and another of the plurality of program statements also includes a parameter reference to the temporary data set; the program code configured, when executed by the processor, to modify the input information by performing symbolic substitution on at least a portion of the input information to produce modified input information; and the program code configured, when executed by the processor, to output according to the output statement the modified input information to the temporary data set. 17. The system of claim 11 , wherein the program code is further configured, when executed by the processor, to identify in the plurality of program statements a symbolic variable and an associated value for the symbolic variable.
0.615385
9,755,996
1
5
1. A method, executed by one or more processors, the method comprising: receiving a message that is addressed to a user; determining a topic for, and a sender of, the message; determining, from information stored in a user profile, whether the topic and the sender are ignorable; determining, via one or more sensors, whether the user is currently operating a vehicle; automatically sending a message response in response to determining that the user is currently operating a vehicle and the topic and the sender are not ignorable; and on condition that the user is not currently operating a vehicle and the topic and the sender are not ignorable, conducting a user-directed response process comprising: conducting a text substitution process on the message to produce an abbreviated version of the message, analyzing the content of the message; formulating a plurality of message-dependent responses based on the content of the message, presenting the abbreviated version of the message and a list of response options to the user, determining a response option that is selected by the user, sending a response to the message that corresponds to the response option that is selected by the user, and wherein the list of response options includes the plurality of message-dependent formulated responses.
1. A method, executed by one or more processors, the method comprising: receiving a message that is addressed to a user; determining a topic for, and a sender of, the message; determining, from information stored in a user profile, whether the topic and the sender are ignorable; determining, via one or more sensors, whether the user is currently operating a vehicle; automatically sending a message response in response to determining that the user is currently operating a vehicle and the topic and the sender are not ignorable; and on condition that the user is not currently operating a vehicle and the topic and the sender are not ignorable, conducting a user-directed response process comprising: conducting a text substitution process on the message to produce an abbreviated version of the message, analyzing the content of the message; formulating a plurality of message-dependent responses based on the content of the message, presenting the abbreviated version of the message and a list of response options to the user, determining a response option that is selected by the user, sending a response to the message that corresponds to the response option that is selected by the user, and wherein the list of response options includes the plurality of message-dependent formulated responses. 5. The method of claim 1 , wherein the response to the message indicates that the user is currently operating a vehicle or other equipment.
0.737736
9,100,722
1
4
1. A method of selecting content items for presentation to a user, comprising: obtaining a list of candidate content items; obtaining metadata tags associated with the candidate content items; selecting at least one of the candidate content items for presentation to a user, based on previously stored user exposure scores for one or more metadata tags associated with the candidate content item, wherein the metadata tags refer to non-skipped portions of content items associated with the metadata tags and not to a skipped portion of the content items, the user exposure scores based on a number of occurrences of viewings of the non-skipped portions of the content items associated with the metadata tags, wherein the non-skipped portions of the content items are defined by demarcation points with respect to one or more skipped portions of the content items, each demarcation point being designated automatically in response to skipping within the content items based on user input during presentation of the content items, the designated demarcation points between the skipped portions and the non-skipped portions specifying a start point and an end point for the skipped portion.
1. A method of selecting content items for presentation to a user, comprising: obtaining a list of candidate content items; obtaining metadata tags associated with the candidate content items; selecting at least one of the candidate content items for presentation to a user, based on previously stored user exposure scores for one or more metadata tags associated with the candidate content item, wherein the metadata tags refer to non-skipped portions of content items associated with the metadata tags and not to a skipped portion of the content items, the user exposure scores based on a number of occurrences of viewings of the non-skipped portions of the content items associated with the metadata tags, wherein the non-skipped portions of the content items are defined by demarcation points with respect to one or more skipped portions of the content items, each demarcation point being designated automatically in response to skipping within the content items based on user input during presentation of the content items, the designated demarcation points between the skipped portions and the non-skipped portions specifying a start point and an end point for the skipped portion. 4. The method of claim 1 , wherein selecting at least one of the candidate content items for presentation to the user comprises: performing a Bayesian filtering analysis using the user exposure scores for metadata tags associated with the candidate content items.
0.63674
8,583,988
13
14
13. The apparatus of claim 12 , Wherein the I/O operation is a transport mode operation, and obtaining information includes obtaining a transport command word (TCW) at the channel subsystem, the TCW including a transport command control block (TCCB) address field including an address of a TCCB, the TCCB including a plurality of device command words (DCW) that each includes an I/O command.
13. The apparatus of claim 12 , Wherein the I/O operation is a transport mode operation, and obtaining information includes obtaining a transport command word (TCW) at the channel subsystem, the TCW including a transport command control block (TCCB) address field including an address of a TCCB, the TCCB including a plurality of device command words (DCW) that each includes an I/O command. 14. The apparatus of claim 13 , wherein the data transfer request is a request for information including the TCCB for transmission by the network interface to the control unit in a Transport Command Information Unit (IU), and the at least one data check word is generated using the initial value from the Data Check Word Seed field of a Transport Command ACW data length information from the TCW and the TCCB.
0.657454
7,711,573
490
499
490. The system of claim 466 , further comprising: means for receiving the job description; means for storing the job description in the resume database; and means for sending a portion of the a result set to a recruiter, wherein the result set includes at least one matching resume from the resume database, each said at least one matching resume satisfying the job description.
490. The system of claim 466 , further comprising: means for receiving the job description; means for storing the job description in the resume database; and means for sending a portion of the a result set to a recruiter, wherein the result set includes at least one matching resume from the resume database, each said at least one matching resume satisfying the job description. 499. The system of claim 490 , further comprising: means for identifying as a selected resume one of said at least one matching resume; and means for displaying the selected resume on a display screen having a left side and a right side, the left side showing a parsed representation of the selected resume, and the right side showing a marked-up representation of the selected resume.
0.5
7,535,844
2
8
2. The method of claim 1 , further comprising: checking the parallel data for an end-of-frame (EOF) character; the parsing the parallel data to include: determining if a character of the parallel data is outside a frame bounded by the SOF character and the EOF character; and if the character is determined to be outside the frame, defining the character as being part of the invalid data.
2. The method of claim 1 , further comprising: checking the parallel data for an end-of-frame (EOF) character; the parsing the parallel data to include: determining if a character of the parallel data is outside a frame bounded by the SOF character and the EOF character; and if the character is determined to be outside the frame, defining the character as being part of the invalid data. 8. The method of claim 2 , wherein: the receiving comprises receiving sequential words each having a byte width proportional to number of the lanes; the checking for the EOF character comprises: examining bytes in an initial word including the SOF character; and if the EOF character is not found in the initial word, the method further comprising repeating for subsequent words the receiving, de-multiplexing, parsing and packing at least until finding the EOF character.
0.5
9,275,164
4
9
4. The method of claim 1 , wherein providing the reordered search results for presentation comprises: determining that the domain has an indicator associated with the domain; and providing, for presentation, the indicator in proximity to a particular search result associated with the domain.
4. The method of claim 1 , wherein providing the reordered search results for presentation comprises: determining that the domain has an indicator associated with the domain; and providing, for presentation, the indicator in proximity to a particular search result associated with the domain. 9. The method of claim 4 , wherein the indicator is an icon.
0.874477
9,443,517
11
14
11. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: accessing a first neural network that was trained to recognize a given keyword or keyphrase using a set of hotword training data, wherein the hotword training data includes positive hotword training data that correspond to utterances of the keyword or keyphrase, and negative hotword training data that corresponds to utterances of words or phrases that are other than the keyword or keyphrase; selecting an audible computer-generated seed hotsound; mapping, to a feature space, (i) the positive hotword training data, (ii) the negative hotword training data, and (iii) the audible computer-generated seed hotsound; performing an optimization of a position of the audible computer-generated seed hotsound within the feature space to generate a modified audible computer-generated hotsound; generating a set of hotsound training data using the modified audible computer-generated hotsound; training a second neural network to recognize the modified audible computer-generated hotsound using the generated set of hotsound training data; using the trained second neural network to recognize the modified audible computer-generated hotsound; and in response to recognizing the modified audible computer-generated hotsound, triggering an action on a device.
11. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: accessing a first neural network that was trained to recognize a given keyword or keyphrase using a set of hotword training data, wherein the hotword training data includes positive hotword training data that correspond to utterances of the keyword or keyphrase, and negative hotword training data that corresponds to utterances of words or phrases that are other than the keyword or keyphrase; selecting an audible computer-generated seed hotsound; mapping, to a feature space, (i) the positive hotword training data, (ii) the negative hotword training data, and (iii) the audible computer-generated seed hotsound; performing an optimization of a position of the audible computer-generated seed hotsound within the feature space to generate a modified audible computer-generated hotsound; generating a set of hotsound training data using the modified audible computer-generated hotsound; training a second neural network to recognize the modified audible computer-generated hotsound using the generated set of hotsound training data; using the trained second neural network to recognize the modified audible computer-generated hotsound; and in response to recognizing the modified audible computer-generated hotsound, triggering an action on a device. 14. The system of claim 11 , wherein mapping the audible computer-generated seed hotsound to the feature space comprises providing the audible computer-generated seed hotsound as input to the first neural network and computing the corresponding activation in the feature space.
0.736692
7,889,794
1
2
1. A method of analyzing a digital video clip to determine candidate frames for subsequent key frame selection, comprising: a. performing a global motion estimate on the video clip that indicates translation of a scene or camera, or scaling of the scene; b. forming a plurality of video segments based on the global motion estimate and labeling each segment in accordance with a predetermined series of camera motion classes; c. extracting key frame candidates from the labeled segments and computing a confidence score for each candidate by using rules corresponding to each camera motion class and a rule corresponding to object motion; and d. wherein, the rules corresponding to camera motion include extracting a candidate frame for a pan segment with a confidence score related to a translation amount during the pan, and not extracting candidate frames for object motion based frames for fast pan and zoom segments, and the rule corresponding to object motion includes extracting a candidate frame for a fixed segment with a confidence score related to the segment length.
1. A method of analyzing a digital video clip to determine candidate frames for subsequent key frame selection, comprising: a. performing a global motion estimate on the video clip that indicates translation of a scene or camera, or scaling of the scene; b. forming a plurality of video segments based on the global motion estimate and labeling each segment in accordance with a predetermined series of camera motion classes; c. extracting key frame candidates from the labeled segments and computing a confidence score for each candidate by using rules corresponding to each camera motion class and a rule corresponding to object motion; and d. wherein, the rules corresponding to camera motion include extracting a candidate frame for a pan segment with a confidence score related to a translation amount during the pan, and not extracting candidate frames for object motion based frames for fast pan and zoom segments, and the rule corresponding to object motion includes extracting a candidate frame for a fixed segment with a confidence score related to the segment length. 2. The method of claim 1 wherein the predetermined camera motion classes include pan (left or right, and tilt up or down), zoom (in or out), fast pan or fixed.
0.5
8,027,867
1
17
1. A system for providing reader-supplied evaluation of a sample of an authored literary work for potential publication of the work comprising: a host computer comprising a processor and a storage device; a first interface module operably connected to the Internet, for receiving only a portion of the literary work from an author to be reviewed via the Internet; the storage device stores portion of the literary work along with other portions of other literary works for review; a second interface module that receives a request from a reader to review the portion of the literary work; a work presenter that presents the portion of literary work to the reader based on the reader's request; a security mechanism that limits the ability of users to misappropriate credit for the portion of literary work when the literary work were to be resubmitted by another author including a timestamp associated with a time of first receipt of the portion of the literary work from the author for resolving disputes regarding original authorship; a review receiving module that receives evaluation of the portion of the literary work from the reader and placing the review in the storage device associated with portion of the literary work; a criteria determination module, executed by the processor, having multiple levels of review of the authored literary work, further comprising: a reader-satisfaction module, executed by the processor, for determining whether a predetermined reader-satisfaction criteria is met during a first level review, the first level review being one of multiple levels of review; and a demographic module for determining whether the literary work has been reviewed by a predetermined number of reviewers from a plurality of reviewer demographics; and a publishing determination module that decides to publish the literary work when the predetermined reader-satisfaction criteria is met and when the literary work has been reviewed by a predetermined number of reviewers from a plurality of reviewer demographics.
1. A system for providing reader-supplied evaluation of a sample of an authored literary work for potential publication of the work comprising: a host computer comprising a processor and a storage device; a first interface module operably connected to the Internet, for receiving only a portion of the literary work from an author to be reviewed via the Internet; the storage device stores portion of the literary work along with other portions of other literary works for review; a second interface module that receives a request from a reader to review the portion of the literary work; a work presenter that presents the portion of literary work to the reader based on the reader's request; a security mechanism that limits the ability of users to misappropriate credit for the portion of literary work when the literary work were to be resubmitted by another author including a timestamp associated with a time of first receipt of the portion of the literary work from the author for resolving disputes regarding original authorship; a review receiving module that receives evaluation of the portion of the literary work from the reader and placing the review in the storage device associated with portion of the literary work; a criteria determination module, executed by the processor, having multiple levels of review of the authored literary work, further comprising: a reader-satisfaction module, executed by the processor, for determining whether a predetermined reader-satisfaction criteria is met during a first level review, the first level review being one of multiple levels of review; and a demographic module for determining whether the literary work has been reviewed by a predetermined number of reviewers from a plurality of reviewer demographics; and a publishing determination module that decides to publish the literary work when the predetermined reader-satisfaction criteria is met and when the literary work has been reviewed by a predetermined number of reviewers from a plurality of reviewer demographics. 17. The system of claim 1 wherein the security mechanism comprises providing only a portion of the work to limit access of the reader to the entirety of the literary work.
0.701049
9,244,706
1
8
1. A method executed at least in part in a computing device to generate automatic command shell command code based on a schema, the method comprising: receiving the schema that includes one or more of: element declarations, attribute declarations, simple type definitions and complex type definitions; reading the schema to create a model for classes that include an interface and a structure, wherein the classes validate constraints in the schema; optimizing the model to translate the schema to an application programming interface (API); and inserting a plug-in to the optimized model to generate a command for a command shell based on the optimized model by; disabling generation of a default code for the command, using the plug-in; and generating a plug-in code for the command, using the plug-in, wherein the command manipulates data that is structured based on the classes according to a class definition in a data store associated with the schema defined by the optimized model at runtime.
1. A method executed at least in part in a computing device to generate automatic command shell command code based on a schema, the method comprising: receiving the schema that includes one or more of: element declarations, attribute declarations, simple type definitions and complex type definitions; reading the schema to create a model for classes that include an interface and a structure, wherein the classes validate constraints in the schema; optimizing the model to translate the schema to an application programming interface (API); and inserting a plug-in to the optimized model to generate a command for a command shell based on the optimized model by; disabling generation of a default code for the command, using the plug-in; and generating a plug-in code for the command, using the plug-in, wherein the command manipulates data that is structured based on the classes according to a class definition in a data store associated with the schema defined by the optimized model at runtime. 8. The method of claim 1 , wherein the plug-in employs an object model exposed by a class generator to provide information about generated classes and interfaces.
0.5
8,411,824
19
21
19. A non-transitory computer readable medium tangibly embodying computer executable instructions, the instructions including instructions to: capture sound received by a user terminal, the sound including one or more words; send the sound to a translation server to convert the sound into text that includes at least one word of written language corresponding to the sound, convert the text into at least one content phrase representing a meaning conveyed by the at least one word, and determine a corresponding visual content equivalent of the sound; receive a graphical translator agent from the translation server, the graphical translator agent configured to display the corresponding visual content equivalent; and display the graphical translator agent on the user terminal.
19. A non-transitory computer readable medium tangibly embodying computer executable instructions, the instructions including instructions to: capture sound received by a user terminal, the sound including one or more words; send the sound to a translation server to convert the sound into text that includes at least one word of written language corresponding to the sound, convert the text into at least one content phrase representing a meaning conveyed by the at least one word, and determine a corresponding visual content equivalent of the sound; receive a graphical translator agent from the translation server, the graphical translator agent configured to display the corresponding visual content equivalent; and display the graphical translator agent on the user terminal. 21. The computer readable medium of claim 19 , further including instructions configured to display the graphical translator agent including a video control configured to selectively pause and rewind at least a subset of the corresponding visual content.
0.728632
9,639,578
22
23
22. A data system comprising: a computer comprising one or more processors; a key-value data repository in a data storage device that is coupled to the computer and comprising a first key-value family, a second key-value family, and a third key-value family; an improved search mechanism in the computer and configured to: receive a search parameter and determine a first search criterion and one or more second search criteria based upon the search parameter; based on the first search criterion and the second search criteria, to obtain one or more first values from the first-key value family; based on the one or more first values, to obtain one or more second values from the second key-value family; based on the one or more second values, to obtain one or more compressed values from the third key-value family; wherein the key-value data repository comprises a cluster of a plurality of computing nodes; wherein at least one key of the first key-value family is mastered by at least one node of the plurality nodes and at least one other key of the first key-value family is mastered by at least one other node of the plurality of nodes; wherein each and every node of the cluster of nodes is configured to obtain values for any key of the first key-value family; return one or more uncompressed portions of the one or more compressed values as search results.
22. A data system comprising: a computer comprising one or more processors; a key-value data repository in a data storage device that is coupled to the computer and comprising a first key-value family, a second key-value family, and a third key-value family; an improved search mechanism in the computer and configured to: receive a search parameter and determine a first search criterion and one or more second search criteria based upon the search parameter; based on the first search criterion and the second search criteria, to obtain one or more first values from the first-key value family; based on the one or more first values, to obtain one or more second values from the second key-value family; based on the one or more second values, to obtain one or more compressed values from the third key-value family; wherein the key-value data repository comprises a cluster of a plurality of computing nodes; wherein at least one key of the first key-value family is mastered by at least one node of the plurality nodes and at least one other key of the first key-value family is mastered by at least one other node of the plurality of nodes; wherein each and every node of the cluster of nodes is configured to obtain values for any key of the first key-value family; return one or more uncompressed portions of the one or more compressed values as search results. 23. The system of claim 22 , wherein the search mechanism is further configured to: uncompress the one or more compressed values to produce one or more uncompressed values; use the one or more second values to identify the one or more uncompressed portions from the one or more uncompressed values.
0.784993
8,631,498
1
2
1. A system for identifying potential malware domain names comprising: one or more processors communicatively coupled to a network, wherein the one or more processors are configured to: receive a request for network data, wherein the request for network data comprises a domain name; apply a lexical and linguistic analysis to the domain name, wherein the lexical and linguistic analysis comprises machine learning configured to establish at least one classifier for performing and fine-tuning potential malware domain name detection; and identify whether the domain name is a potential malware domain name based on the lexical and linguistic analysis.
1. A system for identifying potential malware domain names comprising: one or more processors communicatively coupled to a network, wherein the one or more processors are configured to: receive a request for network data, wherein the request for network data comprises a domain name; apply a lexical and linguistic analysis to the domain name, wherein the lexical and linguistic analysis comprises machine learning configured to establish at least one classifier for performing and fine-tuning potential malware domain name detection; and identify whether the domain name is a potential malware domain name based on the lexical and linguistic analysis. 2. The system of claim 1 , wherein the domain name comprises a Uniform Resource Locator (URL).
0.907843
8,886,630
1
18
1. At least one non-transitory, machine-accessible storage medium having instructions stored thereon, the instructions when executed on a machine, cause the machine to: receive first query data from a first computing device in a collaborative search session; receive second query data from a second computing device in the collaborative search session; cause a corpus of resources to be searched based at least in part on the first and second query data to identify a particular search result set; and cause at least a portion of the particular search result set to be presented on each of the first and second computing devices, wherein presentation of the portion on the first computing device is to be organized according to a first search context and presentation of the portion on the second computing device is to be organized according to a different, second search context.
1. At least one non-transitory, machine-accessible storage medium having instructions stored thereon, the instructions when executed on a machine, cause the machine to: receive first query data from a first computing device in a collaborative search session; receive second query data from a second computing device in the collaborative search session; cause a corpus of resources to be searched based at least in part on the first and second query data to identify a particular search result set; and cause at least a portion of the particular search result set to be presented on each of the first and second computing devices, wherein presentation of the portion on the first computing device is to be organized according to a first search context and presentation of the portion on the second computing device is to be organized according to a different, second search context. 18. The storage medium of claim 1 , wherein query data includes at least one of a search query, additional search query term, a filter to be applied to a set of search results, a request to sort a set of search results, inputs from a query branching by one of the devices participating in the collaborative search session, an interaction with a presentation of a set of search results, and feedback data relating to one or more results returned in a set of search results.
0.627172
9,058,339
9
14
9. A system for source control in a program, the program comprising a plurality of hierarchical nodes for execution of a plurality of processes, the hierarchical nodes comprising parent nodes and child nodes, said system comprising: a graphical user interface for selection of a process of the plurality of processes by a user, the selected process including less than all of the files in the program; a computer processor for identifying nodes in the selected process and identifying at least one node that shares a parent with a node in the selected process; a source control processor for locking the nodes in the selected process, the locking of the nodes in the selected process includes disallowing revisions to the nodes in the selected process, said source control processor locks the at least one node that shares a parent with a node in the selected process, the locking of the at least one node that shares a parent with a node in the selected process includes disallowing revisions to the at least one node that shares a parent with a node in the selected process, wherein said source control processor only locks the files in the selected process and the at least one node that shares a parent with a node in the selected process such that revisions are allowed to files not in the selected process and files that do not share a parent with a node in the selected process.
9. A system for source control in a program, the program comprising a plurality of hierarchical nodes for execution of a plurality of processes, the hierarchical nodes comprising parent nodes and child nodes, said system comprising: a graphical user interface for selection of a process of the plurality of processes by a user, the selected process including less than all of the files in the program; a computer processor for identifying nodes in the selected process and identifying at least one node that shares a parent with a node in the selected process; a source control processor for locking the nodes in the selected process, the locking of the nodes in the selected process includes disallowing revisions to the nodes in the selected process, said source control processor locks the at least one node that shares a parent with a node in the selected process, the locking of the at least one node that shares a parent with a node in the selected process includes disallowing revisions to the at least one node that shares a parent with a node in the selected process, wherein said source control processor only locks the files in the selected process and the at least one node that shares a parent with a node in the selected process such that revisions are allowed to files not in the selected process and files that do not share a parent with a node in the selected process. 14. The system according to claim 9 , wherein the revisions comprise at least one of write operations and delete operations.
0.838542
8,122,021
1
5
1. A method comprising: monitoring a web browser session by a user; identifying a search query submitted by said user; identifying a set of technical words in said search query; comparing said technical words to a technical lexicon, said technical lexicon comprising domain specific technical words and user expertise level corresponding to said specific technical words; determining a user expertise level based on said technical words in said technical lexicon; determining search results based on said search query; organizing said search results based on said user expertise level to determine a ranked list of search results; and presenting said ranked list of search results.
1. A method comprising: monitoring a web browser session by a user; identifying a search query submitted by said user; identifying a set of technical words in said search query; comparing said technical words to a technical lexicon, said technical lexicon comprising domain specific technical words and user expertise level corresponding to said specific technical words; determining a user expertise level based on said technical words in said technical lexicon; determining search results based on said search query; organizing said search results based on said user expertise level to determine a ranked list of search results; and presenting said ranked list of search results. 5. The method of claim 1 , said search results comprising a grouping.
0.845982
9,990,923
10
17
10. A system for automated execution of computer software using intelligent speech recognition techniques, the system comprising: a server computing device configured to capture a bitstream containing a digitized voice segment from a remote device as a speech file, the digitized voice segment corresponding to speech submitted by a user of the remote device during a voice call; parse the bitstream to locate the digitized voice segment; adjust compression of the bitstream containing the digitized voice segment to enhance audio quality of the bitstream; analyze the speech file to convert the speech file into text and extract a set of keywords from the converted text; determine one or more computer software applications accessible to the client computing device; and select at least one of the computer software applications that include functionality responsive to the keywords, comprising: generating, using a sequenced bag-of-words processing model, an input vector comprising a sequence of numeric values, each value associated with a keyword and weighted according to a relative position of the keyword in the set of keywords, matching, using a K-Nearest Neighbor processing model, the input vector against a predefined set of vectors to determine one or more vectors that are similar to the input vector, identifying a label corresponding to each matched vector, wherein the label is associated with computer software functionality, and selecting one or more computer software applications that are associated with a most common label of the identified labels; and a client computing device coupled to the server computing device, the client computing device configured to display the extracted keywords in a user interface of a display device; and execute the functionality of the selected computer software applications that is responsive to the keywords.
10. A system for automated execution of computer software using intelligent speech recognition techniques, the system comprising: a server computing device configured to capture a bitstream containing a digitized voice segment from a remote device as a speech file, the digitized voice segment corresponding to speech submitted by a user of the remote device during a voice call; parse the bitstream to locate the digitized voice segment; adjust compression of the bitstream containing the digitized voice segment to enhance audio quality of the bitstream; analyze the speech file to convert the speech file into text and extract a set of keywords from the converted text; determine one or more computer software applications accessible to the client computing device; and select at least one of the computer software applications that include functionality responsive to the keywords, comprising: generating, using a sequenced bag-of-words processing model, an input vector comprising a sequence of numeric values, each value associated with a keyword and weighted according to a relative position of the keyword in the set of keywords, matching, using a K-Nearest Neighbor processing model, the input vector against a predefined set of vectors to determine one or more vectors that are similar to the input vector, identifying a label corresponding to each matched vector, wherein the label is associated with computer software functionality, and selecting one or more computer software applications that are associated with a most common label of the identified labels; and a client computing device coupled to the server computing device, the client computing device configured to display the extracted keywords in a user interface of a display device; and execute the functionality of the selected computer software applications that is responsive to the keywords. 17. The system of claim 10 , wherein converting the digitized voice segment into text comprises executing a speech recognition engine on a digital file containing the digitized voice segment to generate the text.
0.680723
8,607,136
2
3
2. The method of claim 1 , further comprising: displaying the list of the available communities in a sidebar window which is communicatively coupled to the main window to allow a user to select the one or more communities from the list of the available communities.
2. The method of claim 1 , further comprising: displaying the list of the available communities in a sidebar window which is communicatively coupled to the main window to allow a user to select the one or more communities from the list of the available communities. 3. The method of claim 2 , further comprising enabling the user to associate the selected one or more tags with the selected one or more communities.
0.5
9,619,812
16
17
16. A non-transitory computer-readable medium whose contents, when executed by a computing system having a processor and a memory, cause the processor to perform a method of engaging an audience in a conversational advertisement, the method comprising: identifying, at a server computer, a conversational advertisement to present to an audience via a client device in response to a received indication to present an advertisement, wherein the conversational advertisement is selected from multiple conversational advertisements and wherein the identified conversational advertisement provides a verbal interface such that the identified conversational advertisement provides response, to verbal input provided to the verbal interface, that are based on an identified meaning of the verbal input to the verbal interface; orchestrating, through a first webpage, at least two initial interactions between the audience and the conversational advertisement, wherein one of the at least two initial interactions comprises: conveying, at the server computer, a first message of the conversational advertisement to the client device to be presented to the audience; and receiving, at the server computer, audio data from the client device representing a verbal response by the audience to the first message of the conversational advertisement, wherein the audio data is received through the member of the audience interacting with the first webpage; identifying, at the server computer, based on the spoken words from the audio data representing the verbal response of the audience to the first message, a particular point in a conversation with the member of the audience; and processing, at the server computer, the spoken words from the audio data representing the verbal response of the audience to the first message; determining, at the server computer, a response to convey to the audience via the client device, wherein the response to convey to the audience is determined based at least in part on the spoken words from the audio data representing the verbal response by the audience to the first message, and converting, at the server computer, the response to convey to the audience to response audio data to be played to the audience; wherein the response to convey to the member of the audience is presented on a second webpage different from the first webpage such that the response to convey to the member of the audience continues the conversational advertisement on the second webpage, picking up from the identified particular point in the conversation with the member of the audience such that the conversation with the member of the audience continues where the member of the audience left off from the at least two initial interaction with the conversational advertisement orchestrated through the first webpage.
16. A non-transitory computer-readable medium whose contents, when executed by a computing system having a processor and a memory, cause the processor to perform a method of engaging an audience in a conversational advertisement, the method comprising: identifying, at a server computer, a conversational advertisement to present to an audience via a client device in response to a received indication to present an advertisement, wherein the conversational advertisement is selected from multiple conversational advertisements and wherein the identified conversational advertisement provides a verbal interface such that the identified conversational advertisement provides response, to verbal input provided to the verbal interface, that are based on an identified meaning of the verbal input to the verbal interface; orchestrating, through a first webpage, at least two initial interactions between the audience and the conversational advertisement, wherein one of the at least two initial interactions comprises: conveying, at the server computer, a first message of the conversational advertisement to the client device to be presented to the audience; and receiving, at the server computer, audio data from the client device representing a verbal response by the audience to the first message of the conversational advertisement, wherein the audio data is received through the member of the audience interacting with the first webpage; identifying, at the server computer, based on the spoken words from the audio data representing the verbal response of the audience to the first message, a particular point in a conversation with the member of the audience; and processing, at the server computer, the spoken words from the audio data representing the verbal response of the audience to the first message; determining, at the server computer, a response to convey to the audience via the client device, wherein the response to convey to the audience is determined based at least in part on the spoken words from the audio data representing the verbal response by the audience to the first message, and converting, at the server computer, the response to convey to the audience to response audio data to be played to the audience; wherein the response to convey to the member of the audience is presented on a second webpage different from the first webpage such that the response to convey to the member of the audience continues the conversational advertisement on the second webpage, picking up from the identified particular point in the conversation with the member of the audience such that the conversation with the member of the audience continues where the member of the audience left off from the at least two initial interaction with the conversational advertisement orchestrated through the first webpage. 17. The non-transitory computer-readable medium of claim 16 , wherein the conversational advertisement includes an advertisement script, wherein processing, at the server computer, the spoken words from the audio data representing the verbal response by the audience to the first message includes comparing, at the server computer, the spoken words from the audio data representing the verbal response by the audience to the first message to at least a portion of the advertisement script, and wherein determining, at the server computer, the response to convey to the audience includes identifying, at the server computer, a script response that is included in the advertisement script.
0.5
9,015,097
1
6
1. A method comprising: retrieving, from a memory, a global structure and a plurality of candidate answers therein; computing a first probability of a candidate answer based on a local structure of the candidate answer within the global structure; computing a second probability of the candidate answer based on content of the candidate answer given content of a query; computing a third probability of the candidate answer based on context of the candidate answer given the content of the query; and providing a combined probability of the candidate answer as a function of the first probability, second probability, and third probability.
1. A method comprising: retrieving, from a memory, a global structure and a plurality of candidate answers therein; computing a first probability of a candidate answer based on a local structure of the candidate answer within the global structure; computing a second probability of the candidate answer based on content of the candidate answer given content of a query; computing a third probability of the candidate answer based on context of the candidate answer given the content of the query; and providing a combined probability of the candidate answer as a function of the first probability, second probability, and third probability. 6. The method of claim 1 , further comprising: determining a frequency of features in the global structure; and representing the frequency of features determined in an answer prior model.
0.77685
9,405,832
12
17
12. A non-transitory machine readable medium storing instructions which when executed by a processing system cause the processing system to perform a method of responding to a search query requesting relevant software applications from a database of software applications, the method comprising: receiving, at a server, the search query from an electronic device of a user, the search query including one or more terms; analyzing the one or more terms to assign a first search category to the search query, the first search category being selected from a plurality of potential categories, wherein the potential categories include a navigational category and a functional category; determining a search technique based on the first search category, the navigational category being searched based on text associated with the software applications in the database, and the functional category being searched based on a function of the software application in the database and wherein the search technique determines whether a first search is performed or a second search is performed; using the determined search technique to search, at the server, the database for one or more relevant software applications based on the search query; and sending, to the electronic device, a list of the one or more relevant software applications; wherein analyzing the one or more terms comprises identifying a set of previous search queries from other users including the term or an equivalent term; and identifying, for each search query in the set of previous search queries, an application selected or downloaded by a respective other user subsequent to receiving results from the previous search query; and analyzing a distribution over the selected or downloaded applications; and wherein analyzing the distribution includes: determining a statistical value of the distribution; and comparing the statistical value to a threshold, wherein the functional category is assigned to the search query when the statistical value exceeds the threshold.
12. A non-transitory machine readable medium storing instructions which when executed by a processing system cause the processing system to perform a method of responding to a search query requesting relevant software applications from a database of software applications, the method comprising: receiving, at a server, the search query from an electronic device of a user, the search query including one or more terms; analyzing the one or more terms to assign a first search category to the search query, the first search category being selected from a plurality of potential categories, wherein the potential categories include a navigational category and a functional category; determining a search technique based on the first search category, the navigational category being searched based on text associated with the software applications in the database, and the functional category being searched based on a function of the software application in the database and wherein the search technique determines whether a first search is performed or a second search is performed; using the determined search technique to search, at the server, the database for one or more relevant software applications based on the search query; and sending, to the electronic device, a list of the one or more relevant software applications; wherein analyzing the one or more terms comprises identifying a set of previous search queries from other users including the term or an equivalent term; and identifying, for each search query in the set of previous search queries, an application selected or downloaded by a respective other user subsequent to receiving results from the previous search query; and analyzing a distribution over the selected or downloaded applications; and wherein analyzing the distribution includes: determining a statistical value of the distribution; and comparing the statistical value to a threshold, wherein the functional category is assigned to the search query when the statistical value exceeds the threshold. 17. The non-transitory machine readable medium as in claim 12 wherein the term comprises a set of words.
0.826087
8,069,162
23
31
23. A computer program product for crawling, the computer program product being embodied in a computer readable storage medium and comprising computer instructions for: retrieving a first electronic document from a location that includes a specific file name, wherein a web crawler is preconfigured to find information relating to searching at the specific file name; determining that an explicit enumeration of at least one document containing local content exists, wherein the enumeration of the at least one document containing local content is associated with the first document; detecting a tag associated with the enumeration of the at least one document containing local content, wherein the tag specifies that a second document at a specified location is indexable, wherein the second document is one of the at least one document containing local content; retrieving the second document from the specified location; and indexing the second document for searching.
23. A computer program product for crawling, the computer program product being embodied in a computer readable storage medium and comprising computer instructions for: retrieving a first electronic document from a location that includes a specific file name, wherein a web crawler is preconfigured to find information relating to searching at the specific file name; determining that an explicit enumeration of at least one document containing local content exists, wherein the enumeration of the at least one document containing local content is associated with the first document; detecting a tag associated with the enumeration of the at least one document containing local content, wherein the tag specifies that a second document at a specified location is indexable, wherein the second document is one of the at least one document containing local content; retrieving the second document from the specified location; and indexing the second document for searching. 31. The computer program product of claim 23 , wherein no hyperlink referring to the second file exists.
0.776824
8,533,135
1
2
1. A model generating device comprising: an acquiring unit that observes information flowing through a network to which a plurality of information processing devices are connected that execute a plurality of events in a hierarchical structure, the acquiring unit acquiring event information including a time when execution of an event is started, a time when execution of the event is finished, and a type of the event; an assuming unit that assumes model candidates each showing a relationship between an event and another event triggered by the former event on the basis of the event information acquired by the acquiring unit, and makes a combination of the assumed model candidates; a searching unit that searches the model candidates assumed by the assuming unit for a candidate that matches an existing model; an updating unit that withdraws the model candidate searched for by the searching unit from the combination of the model candidates, and withdraws a candidate that is to be withdrawn from the combination of the model candidates in association with withdrawal of the model candidate found as a result of the search, thereby updating the combination of the model candidates; and a generating unit that generates a new model on the basis of the combination of the model candidates updated by the updating unit.
1. A model generating device comprising: an acquiring unit that observes information flowing through a network to which a plurality of information processing devices are connected that execute a plurality of events in a hierarchical structure, the acquiring unit acquiring event information including a time when execution of an event is started, a time when execution of the event is finished, and a type of the event; an assuming unit that assumes model candidates each showing a relationship between an event and another event triggered by the former event on the basis of the event information acquired by the acquiring unit, and makes a combination of the assumed model candidates; a searching unit that searches the model candidates assumed by the assuming unit for a candidate that matches an existing model; an updating unit that withdraws the model candidate searched for by the searching unit from the combination of the model candidates, and withdraws a candidate that is to be withdrawn from the combination of the model candidates in association with withdrawal of the model candidate found as a result of the search, thereby updating the combination of the model candidates; and a generating unit that generates a new model on the basis of the combination of the model candidates updated by the updating unit. 2. The model generating device according to claim 1 , wherein the updating unit calculates a possibility for the candidate, that is to be withdrawn from the combination of the model candidates in association with withdrawal of the model candidate found as a result of the search, to be established as a model, and if the calculated possibility is higher than a predetermined threshold, the updating unit does not withdraw the candidate to be withdrawn from the combination of the model candidates in association with withdrawal of the model candidate found as a result of the search, and the model candidate searched for by the searching unit from the combination of the model candidates assumed by the assuming unit.
0.5
8,554,777
1
3
1. A method comprising: defining, by a computing system, a user accessible meta-object referencing contextual content, wherein said user accessible meta-object comprises a functional operation referenced object, a service referenced object, or a content specific referenced object; defining, by said computing system, a schema based structured definition for said user accessible meta-object; defining, by said computing system from said schema based structured definition, a predefined user access content mapped hierarchical taxonomy and a configuration data map associated with said predefined user access content mapped hierarchical taxonomy; determining, by said computing system, that content is required for said computing system; creating, by a processor of said computing system, said content, wherein said content comprises user accessible contextual content associated with said predefined user access content mapped hierarchical taxonomy; associating, by said computing system, user accessible topics of relevant tangible content of said content with specified logical storage room representations, wherein each storage room of said specified logical storage room representations comprises contextual content storage address spaces; associating, by said computing system, reference coordinates with said predefined user access content mapped hierarchical taxonomy, wherein said reference coordinates are associated with said specified logical storage room representations; determining, by said computing system, a change associated with a relative point of view associated with each node of said predefined user access content mapped hierarchical taxonomy; updating, by said computing system, said configuration data map, wherein said updating said configuration data map comprises generating updated configuration data, wherein said updated configuration data comprises reference coordinate pointers pointing to the contextual content storage address spaces, and wherein the contextual content storage address spaces are comprised by a plurality of different storage mediums and a plurality of different physical storage locations; generating, by said computing system, a uniform resource identifier (URI) associated with said content enabling a direct internal access mapping to the contextual content storage address spaces associated with said reference coordinate pointers; determining, by said computing system, metering charges for usage of an account per paid subscription to the user accessible contextual content; applying, by said computing system, key performance indicators to transactional analysis usage patterns of said user accessible contextual content; generating, by said computing system, a report associated with said account, said transactional analysis usage patterns, and said usage; presenting, by said computing system, analysis of said report via a dashboard view; and storing, by said computing system, said report.
1. A method comprising: defining, by a computing system, a user accessible meta-object referencing contextual content, wherein said user accessible meta-object comprises a functional operation referenced object, a service referenced object, or a content specific referenced object; defining, by said computing system, a schema based structured definition for said user accessible meta-object; defining, by said computing system from said schema based structured definition, a predefined user access content mapped hierarchical taxonomy and a configuration data map associated with said predefined user access content mapped hierarchical taxonomy; determining, by said computing system, that content is required for said computing system; creating, by a processor of said computing system, said content, wherein said content comprises user accessible contextual content associated with said predefined user access content mapped hierarchical taxonomy; associating, by said computing system, user accessible topics of relevant tangible content of said content with specified logical storage room representations, wherein each storage room of said specified logical storage room representations comprises contextual content storage address spaces; associating, by said computing system, reference coordinates with said predefined user access content mapped hierarchical taxonomy, wherein said reference coordinates are associated with said specified logical storage room representations; determining, by said computing system, a change associated with a relative point of view associated with each node of said predefined user access content mapped hierarchical taxonomy; updating, by said computing system, said configuration data map, wherein said updating said configuration data map comprises generating updated configuration data, wherein said updated configuration data comprises reference coordinate pointers pointing to the contextual content storage address spaces, and wherein the contextual content storage address spaces are comprised by a plurality of different storage mediums and a plurality of different physical storage locations; generating, by said computing system, a uniform resource identifier (URI) associated with said content enabling a direct internal access mapping to the contextual content storage address spaces associated with said reference coordinate pointers; determining, by said computing system, metering charges for usage of an account per paid subscription to the user accessible contextual content; applying, by said computing system, key performance indicators to transactional analysis usage patterns of said user accessible contextual content; generating, by said computing system, a report associated with said account, said transactional analysis usage patterns, and said usage; presenting, by said computing system, analysis of said report via a dashboard view; and storing, by said computing system, said report. 3. The method of claim 1 , wherein said defining said schema based structured definition comprises: defining, by said computing system, elements associated with said schema based structured definition; and defining, by said computing system, attributes associated with said elements.
0.855465
9,165,032
1
2
1. An automated method to allocate resources of a highly parallel computing system for processing a database query, the method comprising: receiving the database query from an application at a client system; compiling the query and computing the number of executive server processes (ESPs) in each ESP layer of the query; generating an affinity value, wherein the affinity value specifies a subset of processors for a range of processor subset sizes; executing the query wherein placement of ESP layers of the query onto processors of the computing system is determined using the affinity value; and returning results of the execution to the application.
1. An automated method to allocate resources of a highly parallel computing system for processing a database query, the method comprising: receiving the database query from an application at a client system; compiling the query and computing the number of executive server processes (ESPs) in each ESP layer of the query; generating an affinity value, wherein the affinity value specifies a subset of processors for a range of processor subset sizes; executing the query wherein placement of ESP layers of the query onto processors of the computing system is determined using the affinity value; and returning results of the execution to the application. 2. The method of claim 1 , further comprising computing a maximum degree of parallelism for the query.
0.887912
7,987,181
7
12
7. A method comprising: a query traffic director device receiving a given query of queries formulated in a query language for evaluation, wherein said queries are directed to one or more datasets of a database, wherein in response to receiving the given query the query traffic director device: parsing said given query; identifying a particular one of said datasets targeted by said given query dependent upon parsing said given query; identifying two or more query server computers of the plurality of query server computers which are coupled for access to the particular one of said datasets, both of the two or more query servers evaluate the given query, wherein a first server of the two or more query server computers is configured with processing resources which provide greater processing performance when evaluating processing intensive computations than a second server of the two or more query server computers, and the second query server computer is configured with memory resources which provide greater performance when evaluating memory intensive computations than the first server; determine available resources to evaluate said given query of each of the identified two or more query server computers; estimate a computational complexity of evaluating said given query by a query server of the plurality of query servers, in response to receiving the given query, wherein estimating said computational complexity, is configured to use at least one characteristic selected from a group: operators used in the query, degree of iteration, and the size of the particular one of said datasets, and further includes determining a type of computation required to evaluate said given query, said type corresponding to at least one of a first type which is processing intensive, and a second type which is memory intensive; select the first server as a selected server to process the given query when the given query corresponds to the first type, and select the second server as the selected server to process the given query when the given query corresponds to the second type; and said query traffic director device conveying said given query to said selected server for evaluation and processing.
7. A method comprising: a query traffic director device receiving a given query of queries formulated in a query language for evaluation, wherein said queries are directed to one or more datasets of a database, wherein in response to receiving the given query the query traffic director device: parsing said given query; identifying a particular one of said datasets targeted by said given query dependent upon parsing said given query; identifying two or more query server computers of the plurality of query server computers which are coupled for access to the particular one of said datasets, both of the two or more query servers evaluate the given query, wherein a first server of the two or more query server computers is configured with processing resources which provide greater processing performance when evaluating processing intensive computations than a second server of the two or more query server computers, and the second query server computer is configured with memory resources which provide greater performance when evaluating memory intensive computations than the first server; determine available resources to evaluate said given query of each of the identified two or more query server computers; estimate a computational complexity of evaluating said given query by a query server of the plurality of query servers, in response to receiving the given query, wherein estimating said computational complexity, is configured to use at least one characteristic selected from a group: operators used in the query, degree of iteration, and the size of the particular one of said datasets, and further includes determining a type of computation required to evaluate said given query, said type corresponding to at least one of a first type which is processing intensive, and a second type which is memory intensive; select the first server as a selected server to process the given query when the given query corresponds to the first type, and select the second server as the selected server to process the given query when the given query corresponds to the second type; and said query traffic director device conveying said given query to said selected server for evaluation and processing. 12. The method as recited in claim 7 , wherein a given one of said query server computers is configured to query file system content including file data stored in one or more or a plurality of files.
0.770208
9,619,024
2
3
2. The virtual input device of claim 1 , further comprising a sending unit for sending the characters corresponding to the recognized gesture to an external device.
2. The virtual input device of claim 1 , further comprising a sending unit for sending the characters corresponding to the recognized gesture to an external device. 3. The virtual input device of claim 2 , wherein the sending unit sends the characters corresponding to the recognized gesture to the external device using a wireless communication method.
0.5
9,904,768
9
12
9. An apparatus comprising: at least one processor; and at least one memory storing processor-executable instructions that, when executed by the at least one processor, perform a method of analyzing a text documenting a patient encounter, the method comprising: analyzing the text to identify a set of one or more features of at least a portion of the text; correlating the set of one or more features to a set of alternative hypotheses for an abstract semantic concept representing an intended semantic meaning of the at least a portion of the text; computing, using at least one statistical model implemented using at least one processor and for each of at least some of the alternative hypotheses of the set, one or more measures of estimated likelihood that the respective alternative hypothesis accurately represents the intended semantic meaning of the at least a portion of the text; identifying hypotheses, including some or all of the at least some of the alternative hypotheses, to be presented to a user, wherein identifying the hypotheses comprises, for each of the at least some of the alternative hypotheses of the set: in response to determining that the one or more measures of estimated likelihood for the alternative hypothesis satisfy one or more criteria, identifying that the alternative hypothesis is to be presented to the user; and presenting the identified hypotheses, to the user documenting the patient encounter, as alternative hypotheses for a medical fact that could be extracted from the text.
9. An apparatus comprising: at least one processor; and at least one memory storing processor-executable instructions that, when executed by the at least one processor, perform a method of analyzing a text documenting a patient encounter, the method comprising: analyzing the text to identify a set of one or more features of at least a portion of the text; correlating the set of one or more features to a set of alternative hypotheses for an abstract semantic concept representing an intended semantic meaning of the at least a portion of the text; computing, using at least one statistical model implemented using at least one processor and for each of at least some of the alternative hypotheses of the set, one or more measures of estimated likelihood that the respective alternative hypothesis accurately represents the intended semantic meaning of the at least a portion of the text; identifying hypotheses, including some or all of the at least some of the alternative hypotheses, to be presented to a user, wherein identifying the hypotheses comprises, for each of the at least some of the alternative hypotheses of the set: in response to determining that the one or more measures of estimated likelihood for the alternative hypothesis satisfy one or more criteria, identifying that the alternative hypothesis is to be presented to the user; and presenting the identified hypotheses, to the user documenting the patient encounter, as alternative hypotheses for a medical fact that could be extracted from the text. 12. The apparatus of claim 9 , wherein the alternative hypotheses comprise a first hypothesis corresponding to a first concept and a second hypothesis corresponding to a second concept, wherein the first concept is a parent of the second concept.
0.665761
7,503,008
10
12
10. The method of claim 9 wherein the step of dispensing a note by use of the note symbol comprises activating the note symbol to dispense a note.
10. The method of claim 9 wherein the step of dispensing a note by use of the note symbol comprises activating the note symbol to dispense a note. 12. The method of claim 10 wherein the note dispenser has an options area and a note dispensing area.
0.5
8,005,680
7
8
7. The method according to claim 1 , further comprising the steps of: gathering speech material related to the activities of the user, performing speech recognition on said speech material, said speech recognition step comprising a step of adapting user dependant speech recognition language models, retrieving from said user dependant speech recognition language models information used for adapting a user profile, using said user profile for personalizing said service.
7. The method according to claim 1 , further comprising the steps of: gathering speech material related to the activities of the user, performing speech recognition on said speech material, said speech recognition step comprising a step of adapting user dependant speech recognition language models, retrieving from said user dependant speech recognition language models information used for adapting a user profile, using said user profile for personalizing said service. 8. The method according to claim 7 , comprising a step of making elements of said user profile and/or of said language models available in the Internet as Web services.
0.5
10,108,732
9
14
9. A method for updating a social graph comprising: accessing a social graph of a subject user, the social graph comprising a plurality of nodes, the plurality of nodes including a focal node representing the subject user, a remainder of the plurality of nodes each representing one or more objects having a relationship with the subject user; learning a social routine of the subject user using interactions between the subject user and the remainder of the plurality of nodes; calculating a relevance score for each node of the remainder of the plurality of nodes, the relevance score for a given node being an indicator of an amount or frequency of interaction between the subject user and the given node, wherein the relevance score is based at least in part on at least one of: a frequency with which the subject user accesses a social network account, a frequency with which the subject user uses a particular application, a frequency with which the subject user interacts with members of a social network service, and a frequency with which the subject user interacts with the one or more objects having a relationship with the subject user; determining a particular node lacks relevance to the subject user based on the particular node being associated with a particular relevance score having a value below a predefined threshold; and in response to the determining the particular node lacks relevance to the subject user based on the particular relevance score having a value below the predefined threshold, eliminating the relationship of the subject user with the particular node by removing the particular node from the social graph to produce a maintained social graph.
9. A method for updating a social graph comprising: accessing a social graph of a subject user, the social graph comprising a plurality of nodes, the plurality of nodes including a focal node representing the subject user, a remainder of the plurality of nodes each representing one or more objects having a relationship with the subject user; learning a social routine of the subject user using interactions between the subject user and the remainder of the plurality of nodes; calculating a relevance score for each node of the remainder of the plurality of nodes, the relevance score for a given node being an indicator of an amount or frequency of interaction between the subject user and the given node, wherein the relevance score is based at least in part on at least one of: a frequency with which the subject user accesses a social network account, a frequency with which the subject user uses a particular application, a frequency with which the subject user interacts with members of a social network service, and a frequency with which the subject user interacts with the one or more objects having a relationship with the subject user; determining a particular node lacks relevance to the subject user based on the particular node being associated with a particular relevance score having a value below a predefined threshold; and in response to the determining the particular node lacks relevance to the subject user based on the particular relevance score having a value below the predefined threshold, eliminating the relationship of the subject user with the particular node by removing the particular node from the social graph to produce a maintained social graph. 14. The method of claim 9 , wherein the particular node corresponds to an entire social network of the subject user maintained by a particular social network service.
0.717687
7,836,028
44
45
44. The method set forth in claim 43 wherein the method further comprises the step of: determining whether a primary key constraint has been violated by checking the versions in the multi-parent graph for a split of a record among the versions.
44. The method set forth in claim 43 wherein the method further comprises the step of: determining whether a primary key constraint has been violated by checking the versions in the multi-parent graph for a split of a record among the versions. 45. The method set forth in claim 44 wherein the method further comprises the step of: determining whether a unique key constraint has been violated by checking the versions in the multi-parent graph for a logical split of a record among the versions.
0.5
8,150,869
11
14
11. One or more computer-readable storage media devices comprising instructions that are executable and, responsive to executing the instructions, a computing device: navigates to a Web page being browsed or navigated to; identifies context information for a user of the computing device, the context information including information for at least one of the Web page browsed to or navigated to, previous Web pages accessed by the user, links selected by the user for Web page navigation, or a browsing pattern of the user; uses the context information to identify a set of keywords based at least in part on a current Web page being displayed and one or more of the previous Web pages H displayed for the user in a current Web browsing session, the context information being used to identify the set of keywords in response to a determination that the one or more previous Web pages are related to the current Web page being displayed; uses the set of keywords and at least one of previous searches by the user or current popular searches by other users to identify a set of query terms; displays one or more query terms of the identified set of query terms as part of a user interface of the computing device; and displays the current Web page concurrently with search results of a query based on the one or more query terms in the user interface of the computing device.
11. One or more computer-readable storage media devices comprising instructions that are executable and, responsive to executing the instructions, a computing device: navigates to a Web page being browsed or navigated to; identifies context information for a user of the computing device, the context information including information for at least one of the Web page browsed to or navigated to, previous Web pages accessed by the user, links selected by the user for Web page navigation, or a browsing pattern of the user; uses the context information to identify a set of keywords based at least in part on a current Web page being displayed and one or more of the previous Web pages H displayed for the user in a current Web browsing session, the context information being used to identify the set of keywords in response to a determination that the one or more previous Web pages are related to the current Web page being displayed; uses the set of keywords and at least one of previous searches by the user or current popular searches by other users to identify a set of query terms; displays one or more query terms of the identified set of query terms as part of a user interface of the computing device; and displays the current Web page concurrently with search results of a query based on the one or more query terms in the user interface of the computing device. 14. One or more computer-readable storage media devices as recited in claim 11 , further comprising additional instructions that are executable and, responsive to executing the additional instructions, the computing device uses a sibling method to identify one or more of the query terms that share some but not all of the set of keywords, and includes the one or more query terms in the set of query terms.
0.5
9,223,836
64
65
64. The method of claim 63 further comprising determining the relevancy ranking value for each document at the ranking module as a document relevance (DR) value based on a ratio comprising the term weight (TW) value in a numerator of the ratio and the term frequency (TF) value in a denominator of the ratio.
64. The method of claim 63 further comprising determining the relevancy ranking value for each document at the ranking module as a document relevance (DR) value based on a ratio comprising the term weight (TW) value in a numerator of the ratio and the term frequency (TF) value in a denominator of the ratio. 65. The method of claim 64 further comprising calculating the DR value at the ranking module according to an equation comprising: DR = TW 3 TF + 1.
0.5
9,967,380
26
30
26. A communication system comprising: a hard of hearing user's captioned device, the captioned device including a display screen and a processor, the processor of the captioned device configured to: establish communication with a hard of hearing user's phone device that is independent of the hard of hearing user's captioned device; receive a text communication originating at a relay, the text communication corresponding to a transcription of a hearing user's voice signal; and display a text caption corresponding to the text communication on the display of the hard of hearing user's captioned device; wherein the captioned device further comprises an input device configured to detect a selection of a caption button, wherein the processor is configured to establish a communication link to the relay responsive to selection of the caption button and to transmit the hearing user's voice signal to the relay after the communication link is established.
26. A communication system comprising: a hard of hearing user's captioned device, the captioned device including a display screen and a processor, the processor of the captioned device configured to: establish communication with a hard of hearing user's phone device that is independent of the hard of hearing user's captioned device; receive a text communication originating at a relay, the text communication corresponding to a transcription of a hearing user's voice signal; and display a text caption corresponding to the text communication on the display of the hard of hearing user's captioned device; wherein the captioned device further comprises an input device configured to detect a selection of a caption button, wherein the processor is configured to establish a communication link to the relay responsive to selection of the caption button and to transmit the hearing user's voice signal to the relay after the communication link is established. 30. The communication system of claim 26 wherein the captioned device comprises a communication connection configured to establish the communication with the hard of hearing user's phone device.
0.557078
7,930,295
12
15
12. The system of claim 11 , wherein said citation information comprises the number of times a publication was cited.
12. The system of claim 11 , wherein said citation information comprises the number of times a publication was cited. 15. The system of claim 12 , wherein said citation information further comprises an author name.
0.533981
7,739,602
10
18
10. A method for sharing digital resources through an Internet based network which has a plurality of registered users, wherein each of said users is either or both of a publisher to publish his information to others and a subscriber to subscribe shared information from others, said method comprising the steps of: a publisher creating one or more views of a resource; designating a subscriber as a member of said publisher's community; defining a period of time after which a publish offer lapses; creating groups within said publisher's community, each group being based on a predefined sharing relationship between said publisher and the community members of said each group; processing a non-subscriber user's request for sharing; establishing a limited sharing relationship between a subscriber user and a non-subscriber user; announcing availability of one or more views of said resource to one or more subscribers of said network; designating a subscriber who subscribes one or more views of said resource to one or more of said groups; using at least one publisher-agent on behalf of said publisher to serve as a gateway for all of said publisher's software applications to send out announcements and process all requests from subscribers and non-subscriber users; using at least one subscriber-agent on behalf of a community member of said publisher to serve as a gateway for all of said community member's software applications to process requests from said publisher and other subscribers; delivering different views of said resource to one or more of said groups based on different sharing relationships; whenever said resource is modified by said publisher, automatically updating any local copy of said resource accessible by any member of said publisher's community; wherein a subscriber of said resource can edit published information in a local copy of said resource, said edited published information being overwritten by any published by said publisher; and wherein each of said views has metadata describing sharing styles, as well as version, creation date and size, wherein each sharing style corresponds to a specific sharing relationship of the publisher.
10. A method for sharing digital resources through an Internet based network which has a plurality of registered users, wherein each of said users is either or both of a publisher to publish his information to others and a subscriber to subscribe shared information from others, said method comprising the steps of: a publisher creating one or more views of a resource; designating a subscriber as a member of said publisher's community; defining a period of time after which a publish offer lapses; creating groups within said publisher's community, each group being based on a predefined sharing relationship between said publisher and the community members of said each group; processing a non-subscriber user's request for sharing; establishing a limited sharing relationship between a subscriber user and a non-subscriber user; announcing availability of one or more views of said resource to one or more subscribers of said network; designating a subscriber who subscribes one or more views of said resource to one or more of said groups; using at least one publisher-agent on behalf of said publisher to serve as a gateway for all of said publisher's software applications to send out announcements and process all requests from subscribers and non-subscriber users; using at least one subscriber-agent on behalf of a community member of said publisher to serve as a gateway for all of said community member's software applications to process requests from said publisher and other subscribers; delivering different views of said resource to one or more of said groups based on different sharing relationships; whenever said resource is modified by said publisher, automatically updating any local copy of said resource accessible by any member of said publisher's community; wherein a subscriber of said resource can edit published information in a local copy of said resource, said edited published information being overwritten by any published by said publisher; and wherein each of said views has metadata describing sharing styles, as well as version, creation date and size, wherein each sharing style corresponds to a specific sharing relationship of the publisher. 18. The method of claim 10 , wherein said at least one publisher-agent automatically generates responses according to said publisher's preferences.
0.731752
9,792,357
1
5
1. A method comprising: receiving, by an electronic device, a search query for searching an attribute within a document; providing, for display within a graphical user interface, a plurality of search results matching the attribute in a plurality of snippets, wherein each snippet of the plurality of snippets displays a portion of content from the document, and wherein each portion of content comprises at least one result from the plurality of search results matching the attribute; receiving, based on a user interaction with the graphical user interface, a first user input with respect to a first snippet of the plurality of snippets, wherein the first snippet comprises a first portion of content from the document, and wherein the first portion of content comprises multiple result instances from the plurality of search results; based on receiving the first user input with respect to the first snippet: determining a proximity within the document between two adjacent result instances of the multiple result instances within the first snippet; and further determining a required display space within the graphical user interface for splitting the first snippet into one or more additional snippets, wherein a given size of a display space is based at least in part on a number of result instances comprised in a given snippet; determining that the proximity between the two adjacent result instances is outside a proximity threshold; determining that the required display space within the graphical user interface is within an acceptable range; based on determining that the proximity between the two adjacent result instances is outside the proximity threshold and further based on determining that the required display space within the graphical user interface is within an acceptable range, splitting the first snippet into one or more additional snippets; and providing, for display within the graphical user interface, the one or more additional snippets, wherein each of the one or more additional snippets comprises one or more result instances from among the multiple result instances within the first snippet.
1. A method comprising: receiving, by an electronic device, a search query for searching an attribute within a document; providing, for display within a graphical user interface, a plurality of search results matching the attribute in a plurality of snippets, wherein each snippet of the plurality of snippets displays a portion of content from the document, and wherein each portion of content comprises at least one result from the plurality of search results matching the attribute; receiving, based on a user interaction with the graphical user interface, a first user input with respect to a first snippet of the plurality of snippets, wherein the first snippet comprises a first portion of content from the document, and wherein the first portion of content comprises multiple result instances from the plurality of search results; based on receiving the first user input with respect to the first snippet: determining a proximity within the document between two adjacent result instances of the multiple result instances within the first snippet; and further determining a required display space within the graphical user interface for splitting the first snippet into one or more additional snippets, wherein a given size of a display space is based at least in part on a number of result instances comprised in a given snippet; determining that the proximity between the two adjacent result instances is outside a proximity threshold; determining that the required display space within the graphical user interface is within an acceptable range; based on determining that the proximity between the two adjacent result instances is outside the proximity threshold and further based on determining that the required display space within the graphical user interface is within an acceptable range, splitting the first snippet into one or more additional snippets; and providing, for display within the graphical user interface, the one or more additional snippets, wherein each of the one or more additional snippets comprises one or more result instances from among the multiple result instances within the first snippet. 5. The method as claimed in claim 1 , further comprising: receiving, based on a second user interaction with the graphical user interface, a second user input with respect to a first additional snippet of the one or more additional snippets; and based on the second user input, merging the first additional snippet with another snippet of the plurality of snippets.
0.657598
7,774,369
1
2
1. A computer system comprising: a first computer comprising a storage device storing: a configuration repository storing multiple entries of configuration information for a software application program, each entry designed for customizing the software application program for a specific situation and the software application program being designed to remotely request configuration information as needed, wherein each configuration information entry includes 1) a configuration component available to be requested for the software application program and 2) a configuration attribute and an associated attribute value that define terms for the software application program to apply to a business transaction of a business enterprise in the specific situation, wherein the configuration repository stores the multiple entries of configuration information in XML format, and a configuration directory storing at least a first configuration information entry selected for the specific situation from among the multiple entries, the first configuration information entry selected based on a user input during a process to customize the software application program for use in the specific situation by a particular business enterprise, the configuration directory being remote from the software application program and different from the configuration repository, and the configuration directory storing the at least one configuration information entry in a database table format in which access to the first configuration information entry is faster than in the XML format; a processing device, coupled to the storage device, for providing the first configuration information entry having the database table format from the configuration directory to the software application program in response to a request; and a second computer that operates the software application program and that is outer to the first computer, the software application program being configured to send, from the second computer over a communications link to the first computer, the request for the first configuration information entry for use by the software application program to process the business transaction of the business enterprise.
1. A computer system comprising: a first computer comprising a storage device storing: a configuration repository storing multiple entries of configuration information for a software application program, each entry designed for customizing the software application program for a specific situation and the software application program being designed to remotely request configuration information as needed, wherein each configuration information entry includes 1) a configuration component available to be requested for the software application program and 2) a configuration attribute and an associated attribute value that define terms for the software application program to apply to a business transaction of a business enterprise in the specific situation, wherein the configuration repository stores the multiple entries of configuration information in XML format, and a configuration directory storing at least a first configuration information entry selected for the specific situation from among the multiple entries, the first configuration information entry selected based on a user input during a process to customize the software application program for use in the specific situation by a particular business enterprise, the configuration directory being remote from the software application program and different from the configuration repository, and the configuration directory storing the at least one configuration information entry in a database table format in which access to the first configuration information entry is faster than in the XML format; a processing device, coupled to the storage device, for providing the first configuration information entry having the database table format from the configuration directory to the software application program in response to a request; and a second computer that operates the software application program and that is outer to the first computer, the software application program being configured to send, from the second computer over a communications link to the first computer, the request for the first configuration information entry for use by the software application program to process the business transaction of the business enterprise. 2. The system of claim 1 wherein the second computer comprises a server having one or more input devices and one or more output devices, and a port through which user devices are served.
0.852381
8,850,591
16
24
16. Logic encoded in non-transitory media for execution and when executed by a processor operable to: identify a root term from at least one of search results, one or more incident lists, or user-provided input; determine one or more other terms belonging to a group associated with the root term; select one or more of the terms from the group; convert the selected terms to regular expressions that are mapped to attributes according to an attribute map, wherein the attributes are associated with a concept; index a document using tags stored in a tag database, wherein if a predetermined number of the regular expressions occur in the document, the tags are associated with corresponding attributes by setting a field or position in an index in the tags where each corresponding attribute has a separate field in the tag indicating whether the attribute is present in the document, and wherein the tags include a pointer to a storage location where the document is stored; apply a concept based on the selected terms to a rule provided as part of a security policy that controls whether the document is permitted to be sent to a next destination as part of network traffic, wherein the rule is applied to the tags to determine if any of the selected terms occur in the document; and quarantine at least some of the network traffic based on the rule.
16. Logic encoded in non-transitory media for execution and when executed by a processor operable to: identify a root term from at least one of search results, one or more incident lists, or user-provided input; determine one or more other terms belonging to a group associated with the root term; select one or more of the terms from the group; convert the selected terms to regular expressions that are mapped to attributes according to an attribute map, wherein the attributes are associated with a concept; index a document using tags stored in a tag database, wherein if a predetermined number of the regular expressions occur in the document, the tags are associated with corresponding attributes by setting a field or position in an index in the tags where each corresponding attribute has a separate field in the tag indicating whether the attribute is present in the document, and wherein the tags include a pointer to a storage location where the document is stored; apply a concept based on the selected terms to a rule provided as part of a security policy that controls whether the document is permitted to be sent to a next destination as part of network traffic, wherein the rule is applied to the tags to determine if any of the selected terms occur in the document; and quarantine at least some of the network traffic based on the rule. 24. The logic of claim 16 , wherein determining the other terms belonging to the group includes factoring in a proximity parameter associated with one or more of the other terms, and wherein the proximity parameter can be used to identify a distance from expressions or terms and the root term.
0.5
8,495,484
1
6
1. A computer-implemented method of recommending a list of hyperlinks, comprising: maintaining a database of hyperlinks associated with activities in the past of a user, said activities including passive receipt of hyperlinks; receiving a selection of text, the selection being by the user from a current workspace in which the user is composing content; extracting from the user's current workspace a context of said selection of text; searching the database for hyperlinks based on at least the context of said selection of text, wherein maintaining the database includes: (i) throughout different workspaces of the user, capturing different activity content links, each activity content link comprising a respective hyperlink associated with a respective activity of the user, and (ii) for each activity content link, generating a metric based on said respective activity; from results of said searching, displaying to the user a list of one or more recommended hyperlinks based on said context and the metric of the respective activity associated with the hyperlink; and upon user command, substituting the selection of text in the content being composed by the user with one of the displayed recommended hyperlinks such that the one displayed recommended hyperlink is inserted into and populates the content being composed in place of the selection of text.
1. A computer-implemented method of recommending a list of hyperlinks, comprising: maintaining a database of hyperlinks associated with activities in the past of a user, said activities including passive receipt of hyperlinks; receiving a selection of text, the selection being by the user from a current workspace in which the user is composing content; extracting from the user's current workspace a context of said selection of text; searching the database for hyperlinks based on at least the context of said selection of text, wherein maintaining the database includes: (i) throughout different workspaces of the user, capturing different activity content links, each activity content link comprising a respective hyperlink associated with a respective activity of the user, and (ii) for each activity content link, generating a metric based on said respective activity; from results of said searching, displaying to the user a list of one or more recommended hyperlinks based on said context and the metric of the respective activity associated with the hyperlink; and upon user command, substituting the selection of text in the content being composed by the user with one of the displayed recommended hyperlinks such that the one displayed recommended hyperlink is inserted into and populates the content being composed in place of the selection of text. 6. The method as claimed in claim 1 wherein the user's current workspace is separate from the different workspaces of the user.
0.858259
9,852,124
1
3
1. An information handling system comprising: one or more processors; one or more data stores accessible by at least one of the processors; a display accessible by at least one of the processors; a memory coupled to at least one of the processors; and a set of computer program instructions stored in the memory and executed by at least one of the processors in order to perform actions of: analyzing a plurality of words included in a plurality of electronic documents, wherein the analysis identifies at least one of the plurality of words as being a portmanteau; identifying a plurality of morphemes included in the identified portmanteau and one or more candidate words that correspond to each of the identified morphemes, wherein each of the candidate words has a candidate word meaning; deriving a portmanteau meaning corresponding to the identified portmanteau from at least two of the candidate word meanings, wherein the deriving comprises: calculating a first string metric between a leading morpheme that corresponds to a first portion of the portmanteau and the candidate word corresponding to the leading morpheme; calculating a second string metric between a trailing morpheme that corresponds to a second portion of the portmanteau and the candidate word corresponding to the trailing morpheme; and analyzing a combined usage of the leading morpheme and the trailing morpheme by combining the first and second string metric, wherein the combined usage is based on the combination of the first and second string metric; and storing the identified portmanteau and the derived portmanteau meaning in a dictionary utilized by a question answering (QA) system, wherein the QA system utilizes the derived portmanteau meaning to understand and answer one or more questions corresponding to the identified portmanteau.
1. An information handling system comprising: one or more processors; one or more data stores accessible by at least one of the processors; a display accessible by at least one of the processors; a memory coupled to at least one of the processors; and a set of computer program instructions stored in the memory and executed by at least one of the processors in order to perform actions of: analyzing a plurality of words included in a plurality of electronic documents, wherein the analysis identifies at least one of the plurality of words as being a portmanteau; identifying a plurality of morphemes included in the identified portmanteau and one or more candidate words that correspond to each of the identified morphemes, wherein each of the candidate words has a candidate word meaning; deriving a portmanteau meaning corresponding to the identified portmanteau from at least two of the candidate word meanings, wherein the deriving comprises: calculating a first string metric between a leading morpheme that corresponds to a first portion of the portmanteau and the candidate word corresponding to the leading morpheme; calculating a second string metric between a trailing morpheme that corresponds to a second portion of the portmanteau and the candidate word corresponding to the trailing morpheme; and analyzing a combined usage of the leading morpheme and the trailing morpheme by combining the first and second string metric, wherein the combined usage is based on the combination of the first and second string metric; and storing the identified portmanteau and the derived portmanteau meaning in a dictionary utilized by a question answering (QA) system, wherein the QA system utilizes the derived portmanteau meaning to understand and answer one or more questions corresponding to the identified portmanteau. 3. The information handling system of claim 1 wherein the first and second string metric are each Levenshtein distance scores.
0.902928