patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
8,316,037 | 7 | 11 | 7. A computer-implemented method comprising: receiving, by a data processing apparatus, a search query in a search session associated with a user device; providing, by a data processing apparatus, search results responsive to the search query to the user device, each of the search results specifying a resource to which the search result is linked; receiving, by a data processing apparatus, search results interaction data from the user device, the search results interaction data specifying one or more additional search queries that were submitted from the user device subsequent to presentation of the search results, the additional search queries being requests for search results pages that include search results responsive to the additional search queries; and determining, by a data processing apparatus and based at least in part on a number of the one or more additional search queries that were submitted subsequent to presentation of the search results meeting a threshold number, that the search results interaction data indicate user dissatisfaction with the search results that were provided in response to the search query; in response to determining that the search results interaction data indicate user dissatisfaction with the search results, identifying, by a data processing apparatus, a related query for the one or more of the additional search queries that were submitted from the user device; and providing the identified related query to the user device for presentation on a next presented search results page. | 7. A computer-implemented method comprising: receiving, by a data processing apparatus, a search query in a search session associated with a user device; providing, by a data processing apparatus, search results responsive to the search query to the user device, each of the search results specifying a resource to which the search result is linked; receiving, by a data processing apparatus, search results interaction data from the user device, the search results interaction data specifying one or more additional search queries that were submitted from the user device subsequent to presentation of the search results, the additional search queries being requests for search results pages that include search results responsive to the additional search queries; and determining, by a data processing apparatus and based at least in part on a number of the one or more additional search queries that were submitted subsequent to presentation of the search results meeting a threshold number, that the search results interaction data indicate user dissatisfaction with the search results that were provided in response to the search query; in response to determining that the search results interaction data indicate user dissatisfaction with the search results, identifying, by a data processing apparatus, a related query for the one or more of the additional search queries that were submitted from the user device; and providing the identified related query to the user device for presentation on a next presented search results page. 11. The method of claim 7 , further comprising: providing a request for information about the query to the user device; and receiving information about the query from the user device, the information being received in response to the request. | 0.821797 |
8,122,057 | 12 | 15 | 12. A computer-readable storage medium storing instructions, which when executed on at least one processor, causes the at least one processor to perform a method comprising: obtaining data from a plurality of computers; applying text patterns to the obtained data and placing the data in a data file; transforming the data in the data file into a uniform and semantically structured data structure format that is compatible with a plurality of interfaces; and generating grammatical sentences based on the text patterns, wherein the grammatical sentences are compatible with the a specific canonical interface and are generated by transforming the uniform and semantically structured text patterns into an interface specific format. | 12. A computer-readable storage medium storing instructions, which when executed on at least one processor, causes the at least one processor to perform a method comprising: obtaining data from a plurality of computers; applying text patterns to the obtained data and placing the data in a data file; transforming the data in the data file into a uniform and semantically structured data structure format that is compatible with a plurality of interfaces; and generating grammatical sentences based on the text patterns, wherein the grammatical sentences are compatible with the a specific canonical interface and are generated by transforming the uniform and semantically structured text patterns into an interface specific format. 15. The computer-readable storage medium of claim 12 , wherein the method performed by the at least one processor further comprises: applying a lexical entry transformation table to transform the obtained data to a normalized and tagged format. | 0.525292 |
8,959,427 | 4 | 5 | 4. The method according to claim 3 , wherein the HTML website is generated by compiling a template script in the one or more computing devices, wherein the template script can be compiled to both, a server-side scripting language and a client-side scripting language. | 4. The method according to claim 3 , wherein the HTML website is generated by compiling a template script in the one or more computing devices, wherein the template script can be compiled to both, a server-side scripting language and a client-side scripting language. 5. The method according to claim 4 , wherein the template script is Closure Template script or Soy Template script. | 0.5 |
9,535,897 | 5 | 6 | 5. The computer-implemented method of claim 1 , wherein the recurrent neural network is configured to associate each of a plurality of candidate tokens with a respective probability. | 5. The computer-implemented method of claim 1 , wherein the recurrent neural network is configured to associate each of a plurality of candidate tokens with a respective probability. 6. The computer-implemented method of claim 5 , wherein the recommendation to the user is provided as a list identifying items associated with the plurality of candidate tokens for the next token. | 0.5 |
9,229,973 | 1 | 3 | 1. A method for associating documents and queries, comprising: receiving a first query submitted by a user; retrieving by said first query at least one reference to a document; displaying said at least one reference to a document; tracing at least one action of said user in relation to said at least one reference to a document; storing each of a) said first query as submitted by said user, and b) a relation between said first query and said retrieved at least one reference to a document based on said traced action; using at least in part a second query from any user to identify at least one stored query; and displaying to said any user said at least one reference to a document based on said relation to said at least one identified query; wherein a stored query comprises at least two query terms, and at least one query term comprises an expression containing more than one word. | 1. A method for associating documents and queries, comprising: receiving a first query submitted by a user; retrieving by said first query at least one reference to a document; displaying said at least one reference to a document; tracing at least one action of said user in relation to said at least one reference to a document; storing each of a) said first query as submitted by said user, and b) a relation between said first query and said retrieved at least one reference to a document based on said traced action; using at least in part a second query from any user to identify at least one stored query; and displaying to said any user said at least one reference to a document based on said relation to said at least one identified query; wherein a stored query comprises at least two query terms, and at least one query term comprises an expression containing more than one word. 3. A method according to claim 1 , comprising: determining a ranking of at least one of the following items: a) said stored relation between said stored query and at least one stored reference to a document; b) said at least one reference to a document; c) said first stored query; and d) said used second query said ranking determination of said at least one of said items being based on at least one of the said traced actions by said user. | 0.626058 |
8,775,398 | 11 | 18 | 11. A computer-implemented method comprising: using one or more processors to perform operations of: receiving a search request; determining search results based on the search request, the search results comprising a first set of items in a first format and a second set of items in a second format, a number of items in the first set and the number of items in the second set reflecting a target ratio; and determining an order of presentation of the search results in a list of search results based on the target ratio, the order of presentation comprising a respective position of each of the search result within the list of search results, the determining comprising selecting a next item for positioning in the list of search results based on a desired exposure percentage associated with the first set of items in the first format. | 11. A computer-implemented method comprising: using one or more processors to perform operations of: receiving a search request; determining search results based on the search request, the search results comprising a first set of items in a first format and a second set of items in a second format, a number of items in the first set and the number of items in the second set reflecting a target ratio; and determining an order of presentation of the search results in a list of search results based on the target ratio, the order of presentation comprising a respective position of each of the search result within the list of search results, the determining comprising selecting a next item for positioning in the list of search results based on a desired exposure percentage associated with the first set of items in the first format. 18. The method of claim 11 , wherein the search request is related to searching for information on the World Wide Web. | 0.936147 |
8,489,538 | 11 | 12 | 11. The method of claim 1 , further comprising applying targeted document identification on the plurality of documents. | 11. The method of claim 1 , further comprising applying targeted document identification on the plurality of documents. 12. The method of claim 11 , wherein applying further comprises identifying a candidate key document based on one or more search terms. | 0.543919 |
7,747,655 | 1 | 12 | 1. A computer system for generating a representation of time-based media, the system comprising: a feature extraction module for: extracting, using a feature extraction technique, features from the time-based media, the feature extraction technique specified by a document format specification file; and generating a media representation of the time-based media that represents the extracted features, the media representation including a waveform representing the time based media including the extracted features, a corresponding timeline and a plurality of user-selectable identifiers indicating locations on the timeline corresponding to the extracted features; a formatting module communicatively coupled to the feature extraction module, the formatting module for: formatting the media representation according to layout parameters specified by the document format specification file; and a printer communicatively coupled to the formatting module, the printer for: printing the formatted media representation, wherein each of the plurality of user-selectable identifiers in the printed, formatted media representation can be selected to access a corresponding part of the time-based media. | 1. A computer system for generating a representation of time-based media, the system comprising: a feature extraction module for: extracting, using a feature extraction technique, features from the time-based media, the feature extraction technique specified by a document format specification file; and generating a media representation of the time-based media that represents the extracted features, the media representation including a waveform representing the time based media including the extracted features, a corresponding timeline and a plurality of user-selectable identifiers indicating locations on the timeline corresponding to the extracted features; a formatting module communicatively coupled to the feature extraction module, the formatting module for: formatting the media representation according to layout parameters specified by the document format specification file; and a printer communicatively coupled to the formatting module, the printer for: printing the formatted media representation, wherein each of the plurality of user-selectable identifiers in the printed, formatted media representation can be selected to access a corresponding part of the time-based media. 12. The system of claim 1 , wherein the timeline includes markers along its length that correspond to segments of media content, at least one of the markers having text information describing a corresponding segment of media content. | 0.551923 |
7,512,532 | 1 | 2 | 1. A translation server connected to a user terminal via a network, comprising: an input information controller for receiving a translation instruction sent from the terminal, the first translation instruction including location information representing a location of an object document to be translated, source language information representing a source language of the object document and target language information representing a translation target language of the object document, and obtaining the object document to be translated from a Web server on the basis of the location information; an information separator for separating the object document sent from the input information controller into a translation object part and a non-translation object part; a translator for translating the translation object part sent from the information separator according to the source language information and the target language information to obtain a translation result; an information converter for producing a retranslation instruction part, the retranslation instruction part causing the terminal to display (1) at least one language information input column configured to receive source language information and/or target language information input by the user for retranslation, (2) the location information, previously inputted by a user of the terminal, representing the location of the object document to be translated, and (3) a retranslation instruction input part, and, upon operation of the retranslation instruction input part by the user of the terminal, the retranslation instruction part causing the terminal to send to the translation server a second translation instruction including source language information and target language information from the language information input column and the location information of the object document to be translated, said location information being previously inputted by said user of the terminal in the first translation instruction; and an information synthesizer for assembling the translation result sent from the translator, the retranslation instruction part produced by the information converter and the non-translation object part sent from the information separator and sending a synthesized result to the terminal. | 1. A translation server connected to a user terminal via a network, comprising: an input information controller for receiving a translation instruction sent from the terminal, the first translation instruction including location information representing a location of an object document to be translated, source language information representing a source language of the object document and target language information representing a translation target language of the object document, and obtaining the object document to be translated from a Web server on the basis of the location information; an information separator for separating the object document sent from the input information controller into a translation object part and a non-translation object part; a translator for translating the translation object part sent from the information separator according to the source language information and the target language information to obtain a translation result; an information converter for producing a retranslation instruction part, the retranslation instruction part causing the terminal to display (1) at least one language information input column configured to receive source language information and/or target language information input by the user for retranslation, (2) the location information, previously inputted by a user of the terminal, representing the location of the object document to be translated, and (3) a retranslation instruction input part, and, upon operation of the retranslation instruction input part by the user of the terminal, the retranslation instruction part causing the terminal to send to the translation server a second translation instruction including source language information and target language information from the language information input column and the location information of the object document to be translated, said location information being previously inputted by said user of the terminal in the first translation instruction; and an information synthesizer for assembling the translation result sent from the translator, the retranslation instruction part produced by the information converter and the non-translation object part sent from the information separator and sending a synthesized result to the terminal. 2. The translation server claimed in claim 1 , wherein the at least one language information input column includes a source language information list box for selecting one of a plurality of source language information and a separate target language information list box for selecting one of a plurality of target language information, and the information converter sets or resets both of the source language information and the target language information of the translation instruction to initial values as specified in said first translation instruction for the source language information list box and the target language information list box, respectively. | 0.669007 |
8,666,824 | 10 | 12 | 10. An audio device storing computer executable instructions which when executed perform a method for automatically acquiring a digital copy of audio content that is being received and played on a device, the method comprising: receiving, at the audio device, user preferences for purchasing digital copies of songs, the user preferences including a minimum bitrate for the digital copies; receiving, at the audio device, a transmission comprising a satellite radio channel that carries audio content including a plurality of songs, as well as metadata of each of the plurality of songs; outputting the audio content of the satellite radio channel; while a first song of the audio content is being output, receiving user input that requests that a digital copy of the first song be acquired; analyzing the metadata of the first song to determine one or more characteristics of the first song; using the determined one or more characteristics to search plurality of audio content providers over the internet to locate a digital copy of the first song that is available to be purchased at each of the plurality of audio content providers; receiving from each of the plurality of audio content providers a price and a bitrate of a digital copy of the first song that is available to be purchased at the audio content provider; using the user preferences stored on the device to automatically determine which of the digital copies is to be purchased including selecting digital copies having a bitrate that at least equals the minimum bitrate specified by the user preferences, and selecting a least expensive digital copy from among the digital copies that have a bitrate that at least equals the minimum bitrate; and upon purchasing the automatically determined digital copy, downloading, to the device, the automatically determined digital copy from the corresponding audio content provider. | 10. An audio device storing computer executable instructions which when executed perform a method for automatically acquiring a digital copy of audio content that is being received and played on a device, the method comprising: receiving, at the audio device, user preferences for purchasing digital copies of songs, the user preferences including a minimum bitrate for the digital copies; receiving, at the audio device, a transmission comprising a satellite radio channel that carries audio content including a plurality of songs, as well as metadata of each of the plurality of songs; outputting the audio content of the satellite radio channel; while a first song of the audio content is being output, receiving user input that requests that a digital copy of the first song be acquired; analyzing the metadata of the first song to determine one or more characteristics of the first song; using the determined one or more characteristics to search plurality of audio content providers over the internet to locate a digital copy of the first song that is available to be purchased at each of the plurality of audio content providers; receiving from each of the plurality of audio content providers a price and a bitrate of a digital copy of the first song that is available to be purchased at the audio content provider; using the user preferences stored on the device to automatically determine which of the digital copies is to be purchased including selecting digital copies having a bitrate that at least equals the minimum bitrate specified by the user preferences, and selecting a least expensive digital copy from among the digital copies that have a bitrate that at least equals the minimum bitrate; and upon purchasing the automatically determined digital copy, downloading, to the device, the automatically determined digital copy from the corresponding audio content provider. 12. The audio device of claim 10 , wherein the method performed by the execution of the computer executable instructions stored on the audio device further comprises: while a second song is being played over the radio channel on the device, receiving user input that requests that a digital copy of the second song be acquired; in response to the user input, determining that the user has rights to a digital copy of the second song; and in response to the determination that the user has rights to a digital copy of the second song, refraining from searching for or obtaining a digital copy of the second song. | 0.515848 |
4,215,680 | 3 | 4 | 3. The chair of claim 2, further including means for repeatedly giving mechanical stimuli to the nape of a person seated in said chair. | 3. The chair of claim 2, further including means for repeatedly giving mechanical stimuli to the nape of a person seated in said chair. 4. The chair of claim 3, further including means for repeatedly giving mechanical stimuli to the back and/or waist of a person seated in said chair. | 0.5 |
9,552,281 | 12 | 15 | 12. A system, comprising: an interface to a data store storing at least one script file; and a processor, communicating with the data store via the interface, the processor being configured to— access, via a test environment, a plurality of script files, in a plurality of scripting languages, coded to perform a set of test operations, wherein the plurality of script files are accessed concurrently; invoke a set of object-oriented handlers based on the set of test operations contained in the plurality of script files, wherein invoking the set of object-oriented handlers comprises: loading each scripting language of the plurality of scripting languages; interfacing an object-oriented handler of the set of object-oriented handlers into each scripting language of the plurality of scripting languages, wherein interfacing the object-oriented handler of the set of object-oriented handlers into each scripting language of the plurality of scripting languages comprises creating a variable in the scripting language and loading a class from the object-oriented handler; bringing each object-oriented handler of the set of object-oriented handlers in scope; establishing a handler object context for each object-oriented handler of the set of object-oriented handlers; and loading classes required by one or more of the set of object-oriented handlers; initiate the set of test operations using the set of object-oriented handlers; determine that the set of test operations are complete; and bring each object-oriented handler of the set of object-oriented handlers out of scope by suspending each object-oriented handler in response to determining that the set of test operations are complete. | 12. A system, comprising: an interface to a data store storing at least one script file; and a processor, communicating with the data store via the interface, the processor being configured to— access, via a test environment, a plurality of script files, in a plurality of scripting languages, coded to perform a set of test operations, wherein the plurality of script files are accessed concurrently; invoke a set of object-oriented handlers based on the set of test operations contained in the plurality of script files, wherein invoking the set of object-oriented handlers comprises: loading each scripting language of the plurality of scripting languages; interfacing an object-oriented handler of the set of object-oriented handlers into each scripting language of the plurality of scripting languages, wherein interfacing the object-oriented handler of the set of object-oriented handlers into each scripting language of the plurality of scripting languages comprises creating a variable in the scripting language and loading a class from the object-oriented handler; bringing each object-oriented handler of the set of object-oriented handlers in scope; establishing a handler object context for each object-oriented handler of the set of object-oriented handlers; and loading classes required by one or more of the set of object-oriented handlers; initiate the set of test operations using the set of object-oriented handlers; determine that the set of test operations are complete; and bring each object-oriented handler of the set of object-oriented handlers out of scope by suspending each object-oriented handler in response to determining that the set of test operations are complete. 15. The system of claim 12 , wherein the set of test operations comprises a set of automated tests of a domain name registry. | 0.630178 |
9,268,753 | 16 | 24 | 16. One or more non-transitory computer readable media comprising instructions which, when executed by one or more processors, causes performance of steps comprising: storing a first version of a particular document in storage accessible to a server-side machine; generating, by the server-side machine, an accessibility-enabled version of the particular document based on the first version of the particular document; wherein the accessibility-enabled version of the particular document has one or more accessibility features, which are not present in the first version of the particular document, that facilitate use of a particular assistive technology; storing the accessibility-enabled version in the storage accessible to the server-side machine; receiving a request, from a client-side machine, for the particular document; determining, by the server-side machine, whether to respond to the request with the first version of the particular document or the accessibility-enabled version of the particular document; responsive to determining to respond to the request with the first version of the particular document, the server-side machine sending the first version of the particular document to the client-side machine; and responsive to determining to respond to the request with the accessibility-enabled version of the particular document, the server-side machine sending the accessibility enabled version of the particular document to the client-side machine. | 16. One or more non-transitory computer readable media comprising instructions which, when executed by one or more processors, causes performance of steps comprising: storing a first version of a particular document in storage accessible to a server-side machine; generating, by the server-side machine, an accessibility-enabled version of the particular document based on the first version of the particular document; wherein the accessibility-enabled version of the particular document has one or more accessibility features, which are not present in the first version of the particular document, that facilitate use of a particular assistive technology; storing the accessibility-enabled version in the storage accessible to the server-side machine; receiving a request, from a client-side machine, for the particular document; determining, by the server-side machine, whether to respond to the request with the first version of the particular document or the accessibility-enabled version of the particular document; responsive to determining to respond to the request with the first version of the particular document, the server-side machine sending the first version of the particular document to the client-side machine; and responsive to determining to respond to the request with the accessibility-enabled version of the particular document, the server-side machine sending the accessibility enabled version of the particular document to the client-side machine. 24. The one or more non-transitory computer readable media of claim 16 , wherein: the one or more accessibility features allow a user to navigate between two or more elements, in the accessibility-enabled version of the particular document, using a keyboard; and the two or more elements could not be navigated using the keyboard in the first version of the particular document. | 0.863439 |
8,768,911 | 15 | 18 | 15. A computerized method of presenting web pages comprising: a) at a first server computer, operating software to: i) crawl original web pages stored on remote web servers to identify a quoting web page containing a quotation of a quoted text portion, ii) identify a quoted web page for the quoted text portion based on a context in which the quotation was found in the quoting web page, the quoted web page being stored on one of the remote web servers, and iii) store in a database: ( 1 ) a first identifier that identifies the quoting web page, ( 2 ) a second identifier that identifies the quoted web page, ( 3 ) a third identifier that identifies the quoted text portion, and iv) repeats i), ii), and iii) to identify and store information about a plurality of quoting web pages, a plurality of quoted text portions, and a plurality of quoting web pages; and b) at a second server computer, operating software to: i) receive from a browser operating on a user computer a particular second identifier for a particular quoted web page; ii) query the database to identify multiple quoted text portions and multiple quoting web pages for the particular quoted web page; iii) generating a revised web page based on: ( 1 ) the particular quoted web page stored on one of the remote web servers, ( 2 ) the multiple quoted text portions identified by the database query, and ( 3 ) and the multiple quoting web pages identified by the database query, wherein the revised web page highlights the multiple quoted text portions in the particular quoted web page and links to the multiple quoting web pages that quoted the multiple quoted text portions; iv) transmitting the revised web page to the browser software for display on the user computer. | 15. A computerized method of presenting web pages comprising: a) at a first server computer, operating software to: i) crawl original web pages stored on remote web servers to identify a quoting web page containing a quotation of a quoted text portion, ii) identify a quoted web page for the quoted text portion based on a context in which the quotation was found in the quoting web page, the quoted web page being stored on one of the remote web servers, and iii) store in a database: ( 1 ) a first identifier that identifies the quoting web page, ( 2 ) a second identifier that identifies the quoted web page, ( 3 ) a third identifier that identifies the quoted text portion, and iv) repeats i), ii), and iii) to identify and store information about a plurality of quoting web pages, a plurality of quoted text portions, and a plurality of quoting web pages; and b) at a second server computer, operating software to: i) receive from a browser operating on a user computer a particular second identifier for a particular quoted web page; ii) query the database to identify multiple quoted text portions and multiple quoting web pages for the particular quoted web page; iii) generating a revised web page based on: ( 1 ) the particular quoted web page stored on one of the remote web servers, ( 2 ) the multiple quoted text portions identified by the database query, and ( 3 ) and the multiple quoting web pages identified by the database query, wherein the revised web page highlights the multiple quoted text portions in the particular quoted web page and links to the multiple quoting web pages that quoted the multiple quoted text portions; iv) transmitting the revised web page to the browser software for display on the user computer. 18. The computerized method of claim 15 , wherein the first identifier for the quoting web page and the second identifier for quoted web page are both URLs identifying locations on the Internet. | 0.781532 |
8,935,609 | 3 | 4 | 3. The method of claim 1 , further comprising: dividing the image into a plurality of sub-images. | 3. The method of claim 1 , further comprising: dividing the image into a plurality of sub-images. 4. The method of claim 3 , further comprising: altering one of the plurality of sub-images by distorting, greyscaling, re-encoding, resizing, noising, discretizing, resampling or scrambling. | 0.694534 |
9,645,997 | 1 | 5 | 1. An apparatus comprising: a network interface configured to send messages; one or more processors configured to identify media content that has been at least partially played at a media playback device within a recent period of time; a display mechanism configured to display, within a message composition interface, an arrangement of phrases selected based on the identified media content; an input mechanism configured to receive selection input that selects a particular phrase from the arrangement; wherein the one or more processors are further configured to insert the particular phrase into a message being composed within the message composition interface responsive to the input mechanism receiving the selection input; wherein the network interface is further configured to receive, from a server system, metadata describing the identified media content; wherein the one or more processors are further configured to select at least one of the phrases for inclusion in the arrangement from the metadata describing the identified media content, including at least one of: a title, actor or actress name, writer name, air date or time, channel, clip, or image. | 1. An apparatus comprising: a network interface configured to send messages; one or more processors configured to identify media content that has been at least partially played at a media playback device within a recent period of time; a display mechanism configured to display, within a message composition interface, an arrangement of phrases selected based on the identified media content; an input mechanism configured to receive selection input that selects a particular phrase from the arrangement; wherein the one or more processors are further configured to insert the particular phrase into a message being composed within the message composition interface responsive to the input mechanism receiving the selection input; wherein the network interface is further configured to receive, from a server system, metadata describing the identified media content; wherein the one or more processors are further configured to select at least one of the phrases for inclusion in the arrangement from the metadata describing the identified media content, including at least one of: a title, actor or actress name, writer name, air date or time, channel, clip, or image. 5. The apparatus of claim 1 , further comprising: wherein the network interface is further configured to receive, from a server system, data associating at least some of the phrases with the identified media content; wherein the network interface is further configured to send the message through the server system. | 0.719751 |
5,530,794 | 1 | 8 | 1. A method for properly displaying paragraphs of text that use a foreign paragraph delimiter, the foreign paragraph delimiter being different than a native paragraph delimiter of documents created on a word processing system, said method comprising the steps of: (a) producing a character position array in which each character of a document that is open on the word processing system is assigned a position, said character position array being divided into a plurality of pieces, each piece comprising a string of characters that are stored adjacent to one another in a file and which have identical format properties; (b) producing an array of data records including entries that correspond to each piece of the character position array, each entry including a file number and a file position within a file at which the string of characters comprising the piece are stored; (c) producing a file control block for each file storing text used in the document when the file is initially opened by the word processing system; (d) inserting delimiter identification data in the file control block of each file, said delimiter identification data indicating a type of paragraph delimiter used by the text stored in the file; (e) each time that a character of the document is displayed, referring to the character position array and to the array of data records to determine a specific file in which the character is stored, the delimiter identification data in the file control block for said specific file indicating the type of paragraph delimiter that is used for a paragraph containing the character; and (f) if the paragraph containing the character uses a foreign paragraph delimiter, translating the foreign paragraph delimiter to the native paragraph delimiter in a display buffer, so that the paragraph containing the character is properly displayed to the user. | 1. A method for properly displaying paragraphs of text that use a foreign paragraph delimiter, the foreign paragraph delimiter being different than a native paragraph delimiter of documents created on a word processing system, said method comprising the steps of: (a) producing a character position array in which each character of a document that is open on the word processing system is assigned a position, said character position array being divided into a plurality of pieces, each piece comprising a string of characters that are stored adjacent to one another in a file and which have identical format properties; (b) producing an array of data records including entries that correspond to each piece of the character position array, each entry including a file number and a file position within a file at which the string of characters comprising the piece are stored; (c) producing a file control block for each file storing text used in the document when the file is initially opened by the word processing system; (d) inserting delimiter identification data in the file control block of each file, said delimiter identification data indicating a type of paragraph delimiter used by the text stored in the file; (e) each time that a character of the document is displayed, referring to the character position array and to the array of data records to determine a specific file in which the character is stored, the delimiter identification data in the file control block for said specific file indicating the type of paragraph delimiter that is used for a paragraph containing the character; and (f) if the paragraph containing the character uses a foreign paragraph delimiter, translating the foreign paragraph delimiter to the native paragraph delimiter in a display buffer, so that the paragraph containing the character is properly displayed to the user. 8. The method of claim 1, further comprising the steps of using the delimiter identification data to identify any two-byte paragraph delimiter sequence that is used in the text; and precluding an insertion point from being selected between the two-bytes comprising said two-byte paragraph delimiter sequence, during editing of the text. | 0.684211 |
9,177,069 | 13 | 15 | 13. The method of claim 1 where determining one or more similar geographic features to the target geographic feature includes determining a quality of the excess queries shared by the target geographic feature and the one or more similar geographic features. | 13. The method of claim 1 where determining one or more similar geographic features to the target geographic feature includes determining a quality of the excess queries shared by the target geographic feature and the one or more similar geographic features. 15. The method of claim 13 where the quality is measured using semantic clustering of terms by meaning. | 0.615672 |
10,042,911 | 11 | 15 | 11. A computer program product for discovering entity types for a set of records, said computer program product comprising: a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to input a set of records, each record comprising attributes with associated attribute values; computer readable program code configured to group the records into candidate entity types in view of at least one of: the attribute values of the records, at least one domain ontology and at least one dimension hierarchy, wherein the grouping comprises constructing a lattice space of attribute combinations and wherein the candidate entity types are based upon one or more of the attribute combinations; computer readable program code configured to calculate an interestingness measure of each candidate entity type being associated with one or more of the attribute combinations, wherein the interestingness measure comprises a measure of relevance of a candidate entity type and wherein the calculating comprises estimating interestingness of the one or more attribute combinations associated with the candidate entity type based on a correlation between attribute values of records and attributing the interestingness of the one or more attribute combination associated with the candidate entity type to the candidate entity type; the correlation being identified by calculating a correlation score between a pair of attributes of an attribute combination of the candidate entity type, wherein the correlation score is based upon functional dependency between the pair of attributes and an intended usage of the candidate entity type; computer readable program code configured to rank the candidate entity types based upon the interestingness measure attributed to each candidate entity types; computer readable program code configured to validate, by ranked order, at least one of the candidate entity type based on the calculated interestingness measures; and computer readable program code configured to group, using the validated candidate entity types, attributes of entities within the set of records into entity types identified by the validated candidate entity types. | 11. A computer program product for discovering entity types for a set of records, said computer program product comprising: a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to input a set of records, each record comprising attributes with associated attribute values; computer readable program code configured to group the records into candidate entity types in view of at least one of: the attribute values of the records, at least one domain ontology and at least one dimension hierarchy, wherein the grouping comprises constructing a lattice space of attribute combinations and wherein the candidate entity types are based upon one or more of the attribute combinations; computer readable program code configured to calculate an interestingness measure of each candidate entity type being associated with one or more of the attribute combinations, wherein the interestingness measure comprises a measure of relevance of a candidate entity type and wherein the calculating comprises estimating interestingness of the one or more attribute combinations associated with the candidate entity type based on a correlation between attribute values of records and attributing the interestingness of the one or more attribute combination associated with the candidate entity type to the candidate entity type; the correlation being identified by calculating a correlation score between a pair of attributes of an attribute combination of the candidate entity type, wherein the correlation score is based upon functional dependency between the pair of attributes and an intended usage of the candidate entity type; computer readable program code configured to rank the candidate entity types based upon the interestingness measure attributed to each candidate entity types; computer readable program code configured to validate, by ranked order, at least one of the candidate entity type based on the calculated interestingness measures; and computer readable program code configured to group, using the validated candidate entity types, attributes of entities within the set of records into entity types identified by the validated candidate entity types. 15. The computer program product according to claim 11 , wherein said computer readable program code is configured to establish relationships between a plurality of candidate entity types. | 0.626984 |
7,734,094 | 11 | 15 | 11. A computer-readable medium having computer-executable instructions for causing a computer to perform a method comprising: receive a handwritten input from a user; perform a recognition operation on the handwritten input to produce an initial recognition result; perform a comparison of the initial recognition result with at least one explicit sample previously provided by the user using a Kullback-Leibler distance measure operation; and identify at least part of the initial recognition result as a possible incorrect recognition result if the comparison reveals that the at least part of the initial recognition result is not consistent with the at least one explicit sample. | 11. A computer-readable medium having computer-executable instructions for causing a computer to perform a method comprising: receive a handwritten input from a user; perform a recognition operation on the handwritten input to produce an initial recognition result; perform a comparison of the initial recognition result with at least one explicit sample previously provided by the user using a Kullback-Leibler distance measure operation; and identify at least part of the initial recognition result as a possible incorrect recognition result if the comparison reveals that the at least part of the initial recognition result is not consistent with the at least one explicit sample. 15. The computer-readable medium of claim 11 , having computer-executable instructions for causing a computer to perform the method comprising: identify the possible incorrect recognition within at least part of the initial recognition result using a classifier confidence process. | 0.526936 |
8,805,832 | 1 | 2 | 1. A method for managing search terms in an electronic discovery system, the method comprising: receiving, at a computing device, a plurality of first inputs, wherein each of the first inputs define a search term associated with a case in the electronic discovery system; storing, in a case profile, the search terms as a search term set; applying, at a computing device, the search term set to a portion of a corpus of electronic data associated with the case to determine, in the portion of the corpus of electronic data, (1) an overall quantity of search term hits, (2) a quantity of search term hits for each search term in the search term set, (3) an overall quantity of search term hit counts per data type, and (4) a quantity of search term hits for each search term in the search term set per data type, wherein the data types include electronic mail data and electronic file data; predicting, at a computing device, for an entirety of the corpus of electronic data based on results of applying the search term set to the portion of electronic data, a volume of the corpus of electronic data required to be reviewed; receiving, at a computing device, one or more second inputs, wherein each of the second inputs modify the search term set based at least on the predicted volume of the corpus of electronic data required to be reviewed; storing, in the case profile, the modifications to the search term set including modification tracking data, wherein the modification tracking data includes type of search term modification, details of the search term modification, originator of the search term modification and date of the search term modification and wherein type of search term modification includes one of adding a search term to the search term set, deleting a search term from the search term set or altering a search term in the search term set; storing, in the case profile, application tracking data associated with applying the search term set to the portion of electronic data, wherein the application tracking data includes an electronic data identifier, the overall quantity of search term hits within the portion of the corpus of electronic data, the quantity of search term hits per each search term in the search term set within the portion of the corpus of electronic data, and a date for applying the search term set to the portion of the corpus of electronic data; and receiving, at a computing device, a third input, wherein the third input finalizes the search term set. | 1. A method for managing search terms in an electronic discovery system, the method comprising: receiving, at a computing device, a plurality of first inputs, wherein each of the first inputs define a search term associated with a case in the electronic discovery system; storing, in a case profile, the search terms as a search term set; applying, at a computing device, the search term set to a portion of a corpus of electronic data associated with the case to determine, in the portion of the corpus of electronic data, (1) an overall quantity of search term hits, (2) a quantity of search term hits for each search term in the search term set, (3) an overall quantity of search term hit counts per data type, and (4) a quantity of search term hits for each search term in the search term set per data type, wherein the data types include electronic mail data and electronic file data; predicting, at a computing device, for an entirety of the corpus of electronic data based on results of applying the search term set to the portion of electronic data, a volume of the corpus of electronic data required to be reviewed; receiving, at a computing device, one or more second inputs, wherein each of the second inputs modify the search term set based at least on the predicted volume of the corpus of electronic data required to be reviewed; storing, in the case profile, the modifications to the search term set including modification tracking data, wherein the modification tracking data includes type of search term modification, details of the search term modification, originator of the search term modification and date of the search term modification and wherein type of search term modification includes one of adding a search term to the search term set, deleting a search term from the search term set or altering a search term in the search term set; storing, in the case profile, application tracking data associated with applying the search term set to the portion of electronic data, wherein the application tracking data includes an electronic data identifier, the overall quantity of search term hits within the portion of the corpus of electronic data, the quantity of search term hits per each search term in the search term set within the portion of the corpus of electronic data, and a date for applying the search term set to the portion of the corpus of electronic data; and receiving, at a computing device, a third input, wherein the third input finalizes the search term set. 2. The method of claim 1 , wherein applying further comprises applying, at a computing device, the search term set to the portion of the corpus of electronic data associated with one or more custodians associated with the case. | 0.611301 |
8,380,507 | 21 | 26 | 21. A host device operative to provide speech content to an electronic device, comprising: communications circuitry operative to receive: a set of text strings for which speech content is requested; and a default language associated with the electronic device; and a processor operative to: identify a title text string from the received set of text strings, wherein the title text string is associated with a title text string language; identify an artist text string from the received set of text strings, wherein the artist text string is associated with an artist text string language; determine that at least two of the title text string language, album text string language, and default language are different; and select one of the title text string language, album text string language, and default language for generating speech content for the title text string and album text string. | 21. A host device operative to provide speech content to an electronic device, comprising: communications circuitry operative to receive: a set of text strings for which speech content is requested; and a default language associated with the electronic device; and a processor operative to: identify a title text string from the received set of text strings, wherein the title text string is associated with a title text string language; identify an artist text string from the received set of text strings, wherein the artist text string is associated with an artist text string language; determine that at least two of the title text string language, album text string language, and default language are different; and select one of the title text string language, album text string language, and default language for generating speech content for the title text string and album text string. 26. The host device of claim 21 , wherein the processor is further operative to: determine that the artist text string language is not speakable in the title text string language; determine that the artist text string language and the title text string language are speakable in the default language; and generate the speech content using the default language. | 0.528796 |
8,762,153 | 2 | 3 | 2. The method of claim 1 , wherein identifying of the first meta-data and the second meta-data comprises identifying multiple pieces of unique information when necessary to completely disambiguate the matches. | 2. The method of claim 1 , wherein identifying of the first meta-data and the second meta-data comprises identifying multiple pieces of unique information when necessary to completely disambiguate the matches. 3. The method of claim 2 , wherein a hierarchy establishes priority of multiple pieces of the first meta-data and the second meta-data for use in the spoken disambiguation statement. | 0.5 |
9,280,326 | 13 | 16 | 13. A computer implemented method for generating compiler code selector rules from an architecture description, the compiler code selector rules for use in a compiler that translates source code into machine instructions of a target processor, the method comprising: generating a plurality of semantic statements from semantic information included in a target processor architecture model of a target processor, the target processor architecture model described in a processor architecture description language, said semantic information describing an instruction set, wherein said target processor architecture model comprises semantic information and syntax information for the machine instructions, and description of non-terminals of the target processor; associating assembly syntax with semantic information; applying, to said semantic information, at least one semantic transformation from a library of pre-defined semantic transformations to generate a single semantic statement from a sequence of at least two of said plurality of semantic statements; accessing basic rules having tree patterns that map from source code operations to semantic patterns; permuting said basic rules based on said non-terminals to form set of permuted mapping rules; and matching semantic patterns of said permuted mapping rules to said semantic statements to form a description of said complier code selector rules comprising mappings from source code operations to associated assembly syntax; and mapping a sequence of two or more source code operations to a single machine instruction based on the accessed rules that matches from semantic statements to semantic patterns. | 13. A computer implemented method for generating compiler code selector rules from an architecture description, the compiler code selector rules for use in a compiler that translates source code into machine instructions of a target processor, the method comprising: generating a plurality of semantic statements from semantic information included in a target processor architecture model of a target processor, the target processor architecture model described in a processor architecture description language, said semantic information describing an instruction set, wherein said target processor architecture model comprises semantic information and syntax information for the machine instructions, and description of non-terminals of the target processor; associating assembly syntax with semantic information; applying, to said semantic information, at least one semantic transformation from a library of pre-defined semantic transformations to generate a single semantic statement from a sequence of at least two of said plurality of semantic statements; accessing basic rules having tree patterns that map from source code operations to semantic patterns; permuting said basic rules based on said non-terminals to form set of permuted mapping rules; and matching semantic patterns of said permuted mapping rules to said semantic statements to form a description of said complier code selector rules comprising mappings from source code operations to associated assembly syntax; and mapping a sequence of two or more source code operations to a single machine instruction based on the accessed rules that matches from semantic statements to semantic patterns. 16. The method of claim 13 , wherein said non-terminals represent locations in which to store intermediate results. | 0.783019 |
10,007,680 | 8 | 14 | 8. A system, comprising: a processor; memory including instructions that, upon being executed by the processor, cause the system to: receive a search request specifying query content, the query content characterized by query descriptors at a plurality of scales; for each content piece of at least one portion of a content collection: identifying a subset of content descriptors of the content piece at each of the plurality of scales, the content descriptors characterizing and describing one or more regions of the content piece, each of the subset of the content descriptors at a respective scale of the plurality of scales corresponding to at least one portion of the query descriptors at the respective scale; determining a size of the query content to generate respective first proportion thresholds with respect to the size of the query content; determine whether a respective first proportion of the subset of the content descriptors at each respective scale is greater than the generated respective first proportion threshold corresponding to the respective scale, the respective first proportion threshold comprising a region size threshold corresponding to the respective scale; and select the content piece for inclusion in a matching content subset of the content collection when at least one of the one or more regions of the subset of content descriptors includes a proportionate size greater than the respective first proportion threshold; and provide the matching content subset in response to the search request. | 8. A system, comprising: a processor; memory including instructions that, upon being executed by the processor, cause the system to: receive a search request specifying query content, the query content characterized by query descriptors at a plurality of scales; for each content piece of at least one portion of a content collection: identifying a subset of content descriptors of the content piece at each of the plurality of scales, the content descriptors characterizing and describing one or more regions of the content piece, each of the subset of the content descriptors at a respective scale of the plurality of scales corresponding to at least one portion of the query descriptors at the respective scale; determining a size of the query content to generate respective first proportion thresholds with respect to the size of the query content; determine whether a respective first proportion of the subset of the content descriptors at each respective scale is greater than the generated respective first proportion threshold corresponding to the respective scale, the respective first proportion threshold comprising a region size threshold corresponding to the respective scale; and select the content piece for inclusion in a matching content subset of the content collection when at least one of the one or more regions of the subset of content descriptors includes a proportionate size greater than the respective first proportion threshold; and provide the matching content subset in response to the search request. 14. The system of claim 8 , wherein the respective first proportion threshold corresponding to each respective scale correspond to a same value. | 0.820449 |
7,659,891 | 17 | 18 | 17. A method according to claim 1 wherein said processor has locally available memory and access to a communications link to a remote memory resource, and wherein pursuant to identification of said first electronic document said processor establishes whether or not said first electronic document exists in said locally available memory and if it does not said processor communicates via said communications link with said remote memory resource to cause one of said first electronic document, and a copy of said first electronic document, to be transferred to said locally available memory. | 17. A method according to claim 1 wherein said processor has locally available memory and access to a communications link to a remote memory resource, and wherein pursuant to identification of said first electronic document said processor establishes whether or not said first electronic document exists in said locally available memory and if it does not said processor communicates via said communications link with said remote memory resource to cause one of said first electronic document, and a copy of said first electronic document, to be transferred to said locally available memory. 18. A method according to claim 17 wherein said communications link comprises at least one of: a LAN; a WAN; a MAN; the internet. | 0.5 |
8,458,163 | 12 | 16 | 12. A computer system comprising: memory; one or more processors; and at least one program stored in the memory and executed by the one or more processors, the at least one program including instructions for: storing, for each website of a multiplicity of websites, a corresponding current crawl rate limit; comparing a maximum crawl rate for a respective website over a defined period of time with the current crawl rate limit for crawling the respective website to determine if the current crawl rate limit is a limiting factor in crawling the respective website; performing a website crawling management function in accordance with the determination of whether the current crawl rate limit is the limiting factor in crawling the respective website; and providing a crawl rate control mechanism to a respective owner of the respective website, wherein the crawl rate control mechanism enables selection of a new crawl rate limit corresponding to the respective website by the respective owner. | 12. A computer system comprising: memory; one or more processors; and at least one program stored in the memory and executed by the one or more processors, the at least one program including instructions for: storing, for each website of a multiplicity of websites, a corresponding current crawl rate limit; comparing a maximum crawl rate for a respective website over a defined period of time with the current crawl rate limit for crawling the respective website to determine if the current crawl rate limit is a limiting factor in crawling the respective website; performing a website crawling management function in accordance with the determination of whether the current crawl rate limit is the limiting factor in crawling the respective website; and providing a crawl rate control mechanism to a respective owner of the respective website, wherein the crawl rate control mechanism enables selection of a new crawl rate limit corresponding to the respective website by the respective owner. 16. The computer system of claim 12 , the instructions further comprising: instructions for decreasing the current crawl rate limit for crawling the respective website in response to a request to decrease the current crawl rate limit for crawling the respective website. | 0.693182 |
8,165,982 | 11 | 12 | 11. The system of claim 8 , wherein a rule component is conditionally associated with one or more tag definitions. | 11. The system of claim 8 , wherein a rule component is conditionally associated with one or more tag definitions. 12. The system of claim 11 , wherein the conditional association of the rule component with the one or more tag definitions is determined as a function of an administrator identifier. | 0.5 |
7,644,057 | 7 | 9 | 7. The computerized text classifier system of claim 1 , wherein the pre-processor selects a script from a plurality of scripts and executes the selected script to identify concepts. | 7. The computerized text classifier system of claim 1 , wherein the pre-processor selects a script from a plurality of scripts and executes the selected script to identify concepts. 9. The computerized text classifier system of claim 7 , wherein the statistical engine is further configured to receive real-time feedback to adapt the statistical information provided to one or more learning nodes of the set of learning nodes. | 0.5 |
7,863,510 | 16 | 17 | 16. The system of claim 15 , further comprising: a feature candidate extraction unit to extract feature candidates from the music title; and a feature selection unit to select a feature from the extracted feature candidates, wherein the theme vector generation unit generates the theme vector by assigning a feature value of the selected feature. | 16. The system of claim 15 , further comprising: a feature candidate extraction unit to extract feature candidates from the music title; and a feature selection unit to select a feature from the extracted feature candidates, wherein the theme vector generation unit generates the theme vector by assigning a feature value of the selected feature. 17. The system of claim 16 , wherein the feature candidate extraction unit analyzes a morpheme of the music title and extracts a unigram and co-occurrence of the music title. | 0.758333 |
9,679,079 | 9 | 16 | 9. A system comprising: at least one server, the at least one server having a non-transient computer information storage medium storing program instructions that when executed by a computer processor effect: receiving, from a client device, a first search query and a first search result request in respect of the first search query, the first search query including at least one first query search term; sending, to the client device, first search results of a first search conducted using the first search query; causing the client device to generate a search engine result page (SERP) comprising the first search results, the SERP further comprising (i) a search field with the at least one first query search term contained therein, and (ii) a unique uniform resource locator (URL) comprising an indication of the at least one first query search term; responsive to determining that a user of the client device has deleted the at least one first query search term from the search field, and is entering a second search query comprising at least one second query search term in the search field of the SERP containing the first search results: receiving, from the client device, elements of the second search query, the elements of the second search query including (i) at least the at least one first query search term obtained from the URL of the SERP without the at least one server retrieving the at least one first query search term from stored data of the server, and (ii) the at least one second query search term; and prior to the at least one server having received a second search result request from the client device in respect of the second search query, sending, to the client device, at least one of (i) at least one search query suggestion based on, at least in part, the elements of the second search query, and (ii) second search results of a second search conducted using the at least one search query suggestion. | 9. A system comprising: at least one server, the at least one server having a non-transient computer information storage medium storing program instructions that when executed by a computer processor effect: receiving, from a client device, a first search query and a first search result request in respect of the first search query, the first search query including at least one first query search term; sending, to the client device, first search results of a first search conducted using the first search query; causing the client device to generate a search engine result page (SERP) comprising the first search results, the SERP further comprising (i) a search field with the at least one first query search term contained therein, and (ii) a unique uniform resource locator (URL) comprising an indication of the at least one first query search term; responsive to determining that a user of the client device has deleted the at least one first query search term from the search field, and is entering a second search query comprising at least one second query search term in the search field of the SERP containing the first search results: receiving, from the client device, elements of the second search query, the elements of the second search query including (i) at least the at least one first query search term obtained from the URL of the SERP without the at least one server retrieving the at least one first query search term from stored data of the server, and (ii) the at least one second query search term; and prior to the at least one server having received a second search result request from the client device in respect of the second search query, sending, to the client device, at least one of (i) at least one search query suggestion based on, at least in part, the elements of the second search query, and (ii) second search results of a second search conducted using the at least one search query suggestion. 16. A system as recited in claim 9 , wherein the elements of the second search query include no second query search terms. | 0.912356 |
10,089,772 | 1 | 2 | 1. A method for context-aware digital play, the method comprising: accessing a virtual scene, the virtual scene comprising digital content; determining that the digital content of the virtual scene comprises a representation of at least one of a plurality of characters, each of the characters being associated with rules, wherein the rules associated with each of the characters are pre-set prior to accessing the virtual scene, do not change during the context-aware digital play, and are related to a known behavior of the character with which the rule is associated; accessing an indication of one or more context-based stimuli, the context-based stimuli being based on the virtual scene; determining whether one or more of the rules associated with the character are also associated with the one or more context-based stimuli that are associated with the accessed indication; and if one or more of the rules are determined to be associated with the context-based stimuli, applying the context-based stimuli to the virtual scene by updating the digital content of the virtual scene based on the one or more rules and modifying the representation of the character based on the one or more rules. | 1. A method for context-aware digital play, the method comprising: accessing a virtual scene, the virtual scene comprising digital content; determining that the digital content of the virtual scene comprises a representation of at least one of a plurality of characters, each of the characters being associated with rules, wherein the rules associated with each of the characters are pre-set prior to accessing the virtual scene, do not change during the context-aware digital play, and are related to a known behavior of the character with which the rule is associated; accessing an indication of one or more context-based stimuli, the context-based stimuli being based on the virtual scene; determining whether one or more of the rules associated with the character are also associated with the one or more context-based stimuli that are associated with the accessed indication; and if one or more of the rules are determined to be associated with the context-based stimuli, applying the context-based stimuli to the virtual scene by updating the digital content of the virtual scene based on the one or more rules and modifying the representation of the character based on the one or more rules. 2. The method of claim 1 , wherein modifying the representation of the character based on the one or more rules comprises causing the character to perform an action defined by at least one of the one or more rules. | 0.922855 |
10,069,857 | 12 | 14 | 12. One or more non-transitory storage media storing instructions which, when executed by one or more computing devices, cause: extracting a set of accessed domain names from a set of events stored in a field-searchable data store; identifying a respective registration time for each accessed domain name in the set of accessed domain names, wherein the respective registration time is indicative of when the accessed domain name was registered with a registrar; identifying a subset of accessed domain names in the set of accessed domain names that have a respective registration time that meets a first criterion; determining, for each accessed domain name in the subset of accessed domain names, an associated access count corresponding to how many times the set of events indicates that the accessed domain name was accessed; performing an action for each accessed domain name in the subset of accessed domain names that has an associated access count that meets a second criterion according to one or more rules associated with the accessed domain name, wherein the one or more rules include causing an alert to be generated and transmitted that identifies the accessed domain name and that the accessed domain name was accessed. | 12. One or more non-transitory storage media storing instructions which, when executed by one or more computing devices, cause: extracting a set of accessed domain names from a set of events stored in a field-searchable data store; identifying a respective registration time for each accessed domain name in the set of accessed domain names, wherein the respective registration time is indicative of when the accessed domain name was registered with a registrar; identifying a subset of accessed domain names in the set of accessed domain names that have a respective registration time that meets a first criterion; determining, for each accessed domain name in the subset of accessed domain names, an associated access count corresponding to how many times the set of events indicates that the accessed domain name was accessed; performing an action for each accessed domain name in the subset of accessed domain names that has an associated access count that meets a second criterion according to one or more rules associated with the accessed domain name, wherein the one or more rules include causing an alert to be generated and transmitted that identifies the accessed domain name and that the accessed domain name was accessed. 14. The one or more non-transitory storage media of claim 12 , wherein the one or more rules include preventing a device from accessing the accessed domain name. | 0.5 |
8,458,195 | 1 | 2 | 1. A computer-implemented method for determining similar users, comprising: receiving information for a source user, at a computer system, the information including at least one topic and a user value for each topic, where: the user value includes a user authority value representing a user expertise related to that topic and a user interest value representing a degree of user association with that topic, and the user value represents how strongly the user is associated with that topic; generating similarity scores based on a user value for each topic for the source user and a user value for the same topic for each user in a set of users, where each user in the set of users is associated with a user value for each topic; selecting one or more similar users based on the generated similarity scores; outputting one or more of the selected users; and outputting the identity of one or more overlapping topics and a value indicating a degree of overlap for each overlapping topic. | 1. A computer-implemented method for determining similar users, comprising: receiving information for a source user, at a computer system, the information including at least one topic and a user value for each topic, where: the user value includes a user authority value representing a user expertise related to that topic and a user interest value representing a degree of user association with that topic, and the user value represents how strongly the user is associated with that topic; generating similarity scores based on a user value for each topic for the source user and a user value for the same topic for each user in a set of users, where each user in the set of users is associated with a user value for each topic; selecting one or more similar users based on the generated similarity scores; outputting one or more of the selected users; and outputting the identity of one or more overlapping topics and a value indicating a degree of overlap for each overlapping topic. 2. The method of claim 1 , wherein the step of generating includes computing a cosine similarity of user values for each topic. | 0.680905 |
8,374,873 | 9 | 10 | 9. A computer-implementable method for synthesizing audible speech, with varying prosody, from textual content, the method comprising: selecting multiple prosody models from a prosody model inventory based on keywords in a first text annotated with prosody information and parameters; training the multiple prosody models with the first text annotated with prosody information; choosing a subset of multiple prosody models from the prosody model inventory; associating prosody models in the subset of multiple prosody models with different segments of a second text; applying the associated prosody models to the different segments of the second text to produce prosody annotations for the second text; reconciling conflicting prosody annotations for a segment of the second text based on confidence levels and prosody model weights; and synthesizing audible speech from the second text and the reconciled prosody annotations. | 9. A computer-implementable method for synthesizing audible speech, with varying prosody, from textual content, the method comprising: selecting multiple prosody models from a prosody model inventory based on keywords in a first text annotated with prosody information and parameters; training the multiple prosody models with the first text annotated with prosody information; choosing a subset of multiple prosody models from the prosody model inventory; associating prosody models in the subset of multiple prosody models with different segments of a second text; applying the associated prosody models to the different segments of the second text to produce prosody annotations for the second text; reconciling conflicting prosody annotations for a segment of the second text based on confidence levels and prosody model weights; and synthesizing audible speech from the second text and the reconciled prosody annotations. 10. The method of claim 9 , wherein a model manager chooses the subset of multiple prosody models and the model manager applies the associated prosody models to the different segments of the second text. | 0.5 |
8,682,841 | 14 | 17 | 14. A computer based method for collecting and processing data over a communications network, comprising the steps of: configuring a plurality of plugins stored in processor based server, each plugin configured to retrieve unstructured data from a data source over the communications network and to convert the unstructured data by parsing the unstructured data into structured data comprising historical data, updated data and analytical graphical representation of said data; receiving each user's selection of one or more data items relating to a subject matter to be monitored from a client device associated with said each user over the communications network; associating a plugin to each data item selected by said plurality of users; associating the plugin to an associated data source; associating the plugin to each user who have selected a similar data item to be monitored; managing each plugin to retrieve the unstructured data from the associated data source to enable multiple users to share the structured data based on shared interest in similar subject matter; and storing said structured data received from said plurality of plugins in a database. | 14. A computer based method for collecting and processing data over a communications network, comprising the steps of: configuring a plurality of plugins stored in processor based server, each plugin configured to retrieve unstructured data from a data source over the communications network and to convert the unstructured data by parsing the unstructured data into structured data comprising historical data, updated data and analytical graphical representation of said data; receiving each user's selection of one or more data items relating to a subject matter to be monitored from a client device associated with said each user over the communications network; associating a plugin to each data item selected by said plurality of users; associating the plugin to an associated data source; associating the plugin to each user who have selected a similar data item to be monitored; managing each plugin to retrieve the unstructured data from the associated data source to enable multiple users to share the structured data based on shared interest in similar subject matter; and storing said structured data received from said plurality of plugins in a database. 17. The method of claim 14 , further comprising the step of ranking TV shows based on engagement correlated with blog comments. | 0.716518 |
9,336,310 | 10 | 14 | 10. An on-line comment management system, comprising: a hardware server; software executing on the hardware server, the software comprising: a content manager, operable on a computer server system that includes one or more processors, to provide content for review by users over a network; a ratings interface to receive, from the users, ratings on corresponding pieces of the content; and a ratings reviewer programmed to determine whether to review a particular rating from a particular user by performing a random selection that randomly selects particular ratings to review from among a plurality of ratings, wherein the determining comprises: selecting a number at random, adjusting the selected number up or down using results of prior reviews of ratings from the particular user, and determining, based on the adjusted number, whether to provide the first piece for review to determine whether the on-line content is legitimate or not, wherein a likelihood that the first rating is selected for review is influenced based at least on a measure of trust associated with the particular user, wherein the measure of trust is determined based at least on the results of prior reviews of ratings from the particular user, wherein the ratings reviewer is further programmed to maintain results, for each particular user, comprising a first bias for trusting a rating and a second bias for discarding a rating, and adjusting the first and second biases based on whether the review of the rating indicates that the rating was legitimate. | 10. An on-line comment management system, comprising: a hardware server; software executing on the hardware server, the software comprising: a content manager, operable on a computer server system that includes one or more processors, to provide content for review by users over a network; a ratings interface to receive, from the users, ratings on corresponding pieces of the content; and a ratings reviewer programmed to determine whether to review a particular rating from a particular user by performing a random selection that randomly selects particular ratings to review from among a plurality of ratings, wherein the determining comprises: selecting a number at random, adjusting the selected number up or down using results of prior reviews of ratings from the particular user, and determining, based on the adjusted number, whether to provide the first piece for review to determine whether the on-line content is legitimate or not, wherein a likelihood that the first rating is selected for review is influenced based at least on a measure of trust associated with the particular user, wherein the measure of trust is determined based at least on the results of prior reviews of ratings from the particular user, wherein the ratings reviewer is further programmed to maintain results, for each particular user, comprising a first bias for trusting a rating and a second bias for discarding a rating, and adjusting the first and second biases based on whether the review of the rating indicates that the rating was legitimate. 14. The system of claim 10 , wherein the ratings reviewer is further programmed to adjust, using a result of a review of a rating by a user, a review bias to be used in determining whether to review future ratings from the user, wherein the review bias is adjusted based on whether the review of the rating indicates that the rating was legitimate. | 0.5 |
9,767,263 | 13 | 15 | 13. A non-transitory computer-readable storage medium having stored thereon executable instructions that, when executed by one or more processors of a computer system, cause the computer system to at least: transmit a challenge-response problem, the challenge-response problem being a security check to determine if a requestor is an automated-agent or a human-user, wherein the security check to cause a challenge presented by the security check to be humanly perceivable in a user interface, the challenge being based at least in part on psycholinguistics, evolutionary psychology, color psychology, or a combination thereof; receive data indicating a response to the challenge-response problem, the data indicating a correct response to the challenge-response problem; determine that the correct response to the challenge-response problem identifies the requestor as an automated-agent; and perform one or more operations as a result of the response to the challenge-response problem that identifies the requestor as an automated-agent. | 13. A non-transitory computer-readable storage medium having stored thereon executable instructions that, when executed by one or more processors of a computer system, cause the computer system to at least: transmit a challenge-response problem, the challenge-response problem being a security check to determine if a requestor is an automated-agent or a human-user, wherein the security check to cause a challenge presented by the security check to be humanly perceivable in a user interface, the challenge being based at least in part on psycholinguistics, evolutionary psychology, color psychology, or a combination thereof; receive data indicating a response to the challenge-response problem, the data indicating a correct response to the challenge-response problem; determine that the correct response to the challenge-response problem identifies the requestor as an automated-agent; and perform one or more operations as a result of the response to the challenge-response problem that identifies the requestor as an automated-agent. 15. The non-transitory computer-readable storage medium of claim 13 , wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computer system to provide the challenge-response problem for display on a graphical user interface (GUI) of a user device. | 0.670576 |
7,707,593 | 1 | 4 | 1. At least one application program interface (API) embodied as one or more computer executable instructions stored on a computer-readable storage medium, which when executed by at least one processing system in conjunction with at least one application program that issues at least one call on a host-environment object on behalf of content, enables the content to interact with a selected hosting environment, the at least one API comprising: at least one interaction interface in the content for indicating at least one desired interaction with any one of a plurality of hosting environments, including a browser environment and a window environment, the interaction interface being expressed in at least one of either one or more programmatic language statements, one or more declarative language statements, one or more extensible application markup oriented language (XAML) statements, or any other computer language statements; and at least one interaction expression in the at least one interaction interface for identifying the at least one desired interaction to the at least one application program without providing implementation instructions associated with any one of the plurality of hosting environments; wherein the at least one application program comprises logic for identifying a selected hosting environment by examining a settings module associated with the at least one application program for referencing the host-environment object that is associated with the selected hosting environment for issuing the at least one call on, and for referencing an object interface that allows the at least one call on the host-environment object to be made on either a browser-environment object or a window-environment object that becomes available when the selected hosting environment is selected. | 1. At least one application program interface (API) embodied as one or more computer executable instructions stored on a computer-readable storage medium, which when executed by at least one processing system in conjunction with at least one application program that issues at least one call on a host-environment object on behalf of content, enables the content to interact with a selected hosting environment, the at least one API comprising: at least one interaction interface in the content for indicating at least one desired interaction with any one of a plurality of hosting environments, including a browser environment and a window environment, the interaction interface being expressed in at least one of either one or more programmatic language statements, one or more declarative language statements, one or more extensible application markup oriented language (XAML) statements, or any other computer language statements; and at least one interaction expression in the at least one interaction interface for identifying the at least one desired interaction to the at least one application program without providing implementation instructions associated with any one of the plurality of hosting environments; wherein the at least one application program comprises logic for identifying a selected hosting environment by examining a settings module associated with the at least one application program for referencing the host-environment object that is associated with the selected hosting environment for issuing the at least one call on, and for referencing an object interface that allows the at least one call on the host-environment object to be made on either a browser-environment object or a window-environment object that becomes available when the selected hosting environment is selected. 4. The API as set forth in claim 1 wherein the host-environment object comprises at least one component for setting one or more properties in the selected hosting environment. | 0.663462 |
8,751,232 | 12 | 13 | 12. A speech recognition system, comprising: a processor; and a tuning engine comprising instructions that are executable by the processor to tune a speech module with respect to a particular type of utterance in response to the processor determining that a frequency of occurrence of the particular type of utterance satisfies a threshold. | 12. A speech recognition system, comprising: a processor; and a tuning engine comprising instructions that are executable by the processor to tune a speech module with respect to a particular type of utterance in response to the processor determining that a frequency of occurrence of the particular type of utterance satisfies a threshold. 13. The speech recognition system of claim 12 , further comprising a targeting engine including instructions that are executable by the processor to: determine the frequency of occurrence of the particular type of utterance; and determine that the frequency of occurrence of the particular type of utterance satisfies the threshold. | 0.5 |
8,627,260 | 9 | 11 | 9. The method of claim 6 wherein the optimizing the word-level representation includes re-writing an expression to simplify an equation. | 9. The method of claim 6 wherein the optimizing the word-level representation includes re-writing an expression to simplify an equation. 11. The method of claim 9 wherein the re-writing includes merging an internal equivalence point. | 0.705521 |
9,613,132 | 1 | 14 | 1. A method of displaying by a client application running on at least one digital electronic device in communication with a search engine a plurality of user-selectable refinements to a first search query including at least one first search term, the method comprising: (a) sending by the client application to the search engine the first search query; (b) receiving by the client application from the search engine first search results in respect of the first search query and first suggested search query refinements having been determined by the search engine based at least in part on an analysis of groups of related search queries being related to the first search query, each of the first suggested search query refinements corresponding to a refined search query including the at least one first search term and at least one additional search term, the analysis of groups of related search queries including: filtering the related search queries to only those identified as having provided search results which provided a user with information sought by the user; grouping the filtered related search queries into the groups based on subsequent user behaviors of the users; and determining a suggested search query refinement for each of at least some of the groups, the suggested search query refinement corresponding to a refined search query including the at least one first search term and the at least one additional search term which has been derived from one of meaningful related search queries, the one of the meaningful related search queries having been determined as being the most popular in its respective group, the at least one additional search term having being determined as being the most unique as compared with previously identified suggested search query refinements; (c) displaying by the client application at least one first search result and, apart from a search bar, the first suggested search query refinements, the first suggested search query refinements being selectable by a user via at least one first graphical object; (d) receiving by the client application from a user via the at least one first graphical object a first selection of one of the first suggested search query refinements, the first selection corresponding to a first refined search query including the at least one first search term and at least one first additional search term; (e) sending by the client application to the search engine a request to obtain the first refined search results; (f) receiving by the client application from the search engine first refined search results in respect of the first refined search query; and (g) displaying by the client application at least one first refined search result and a visual representation of a refinement relationship between the first search query and the first refined search query. | 1. A method of displaying by a client application running on at least one digital electronic device in communication with a search engine a plurality of user-selectable refinements to a first search query including at least one first search term, the method comprising: (a) sending by the client application to the search engine the first search query; (b) receiving by the client application from the search engine first search results in respect of the first search query and first suggested search query refinements having been determined by the search engine based at least in part on an analysis of groups of related search queries being related to the first search query, each of the first suggested search query refinements corresponding to a refined search query including the at least one first search term and at least one additional search term, the analysis of groups of related search queries including: filtering the related search queries to only those identified as having provided search results which provided a user with information sought by the user; grouping the filtered related search queries into the groups based on subsequent user behaviors of the users; and determining a suggested search query refinement for each of at least some of the groups, the suggested search query refinement corresponding to a refined search query including the at least one first search term and the at least one additional search term which has been derived from one of meaningful related search queries, the one of the meaningful related search queries having been determined as being the most popular in its respective group, the at least one additional search term having being determined as being the most unique as compared with previously identified suggested search query refinements; (c) displaying by the client application at least one first search result and, apart from a search bar, the first suggested search query refinements, the first suggested search query refinements being selectable by a user via at least one first graphical object; (d) receiving by the client application from a user via the at least one first graphical object a first selection of one of the first suggested search query refinements, the first selection corresponding to a first refined search query including the at least one first search term and at least one first additional search term; (e) sending by the client application to the search engine a request to obtain the first refined search results; (f) receiving by the client application from the search engine first refined search results in respect of the first refined search query; and (g) displaying by the client application at least one first refined search result and a visual representation of a refinement relationship between the first search query and the first refined search query. 14. The method of claim 1 , wherein: (a) is sending by the client application to the search engine the first search query, the first search query having been entered by a user in the search bar; and (g) includes displaying by the client application the first refined search query in the search bar. | 0.905397 |
9,342,233 | 1 | 25 | 1. One or more computer-readable media maintaining instructions executable by one or more processors to perform operations comprising: presenting a portion of text of a digital work on a display of an electronic device; receiving a selection of a term of one or more words from the text of the digital work; accessing, based at least in part on the metadata associated with the digital work, at least one dictionary of a plurality of dictionaries to obtain at least one definition corresponding to the term; identifying at least two other occurrences of the term in another digital work maintained on the electronic device; determining, based in part on the two other occurrences, two or more groups of similar occurrences of the term; and displaying on the display: the at least one definition for the term obtained from the at least one dictionary; and two or more excerpts of text, each excerpt of text of the two or more excerpts of text including an occurrence of the term from a different group of the two or more groups. | 1. One or more computer-readable media maintaining instructions executable by one or more processors to perform operations comprising: presenting a portion of text of a digital work on a display of an electronic device; receiving a selection of a term of one or more words from the text of the digital work; accessing, based at least in part on the metadata associated with the digital work, at least one dictionary of a plurality of dictionaries to obtain at least one definition corresponding to the term; identifying at least two other occurrences of the term in another digital work maintained on the electronic device; determining, based in part on the two other occurrences, two or more groups of similar occurrences of the term; and displaying on the display: the at least one definition for the term obtained from the at least one dictionary; and two or more excerpts of text, each excerpt of text of the two or more excerpts of text including an occurrence of the term from a different group of the two or more groups. 25. The one or more computer-readable media as recited in claim 1 , wherein the operations further comprise determining that the digital work is a digital audio work or a digital video work. | 0.786996 |
8,180,787 | 1 | 3 | 1. A computer-implemented method of providing access to data having a particular schema, comprising: providing a data abstraction model which models the data having the particular schema and exposes the data to users in a manner that allows the users to compose abstract queries on the basis of the data abstraction model without knowledge of the particular schema; wherein the data abstraction model comprises a plurality of logical field definitions, the plurality of logical field definitions being maintained separately from physical queries, each of the logical field definitions comprising: (i) a logical field name; (ii) at least one location attribute identifying a location of physical data corresponding to the logical field name; and (iii) a reference to an access method for accessing the physical data in response to receiving the abstract query containing the logical field name, wherein at least one of the logical field names is different from a physical field name of the corresponding physical data as defined by the schema; and configuring one or more computer processors to perform an operation comprising: receiving an abstract query that is expressed according to a syntax of a predefined query language, comprising: (i) a user-specified result specification specifying one or more logical field definitions for which results are to be returned; and (ii) at least one user-specified selection criterion specifying conditions to filter the physical data corresponding to the one or more logical field definitions specified by the result specification; and accessing the data abstraction model in response to receiving the abstract query, wherein accessing comprises: invoking an access method of one of the one or more logical field definitions to access the physical data. | 1. A computer-implemented method of providing access to data having a particular schema, comprising: providing a data abstraction model which models the data having the particular schema and exposes the data to users in a manner that allows the users to compose abstract queries on the basis of the data abstraction model without knowledge of the particular schema; wherein the data abstraction model comprises a plurality of logical field definitions, the plurality of logical field definitions being maintained separately from physical queries, each of the logical field definitions comprising: (i) a logical field name; (ii) at least one location attribute identifying a location of physical data corresponding to the logical field name; and (iii) a reference to an access method for accessing the physical data in response to receiving the abstract query containing the logical field name, wherein at least one of the logical field names is different from a physical field name of the corresponding physical data as defined by the schema; and configuring one or more computer processors to perform an operation comprising: receiving an abstract query that is expressed according to a syntax of a predefined query language, comprising: (i) a user-specified result specification specifying one or more logical field definitions for which results are to be returned; and (ii) at least one user-specified selection criterion specifying conditions to filter the physical data corresponding to the one or more logical field definitions specified by the result specification; and accessing the data abstraction model in response to receiving the abstract query, wherein accessing comprises: invoking an access method of one of the one or more logical field definitions to access the physical data. 3. The method of claim 1 , further comprising: transforming the abstract query into a physical query consistent with the particular schema; the transforming being done on the basis of those logical field definitions of the data abstraction model that correspond to field names contained in the abstract query. | 0.528963 |
9,767,263 | 11 | 12 | 11. The system of claim 6 , wherein the one or more services are further configured to provide a second challenge-response problem after determining the challenge-response problem was successfully completed, wherein the second challenge-response problem includes exact logic as the challenge-response problem presented in a different manner. | 11. The system of claim 6 , wherein the one or more services are further configured to provide a second challenge-response problem after determining the challenge-response problem was successfully completed, wherein the second challenge-response problem includes exact logic as the challenge-response problem presented in a different manner. 12. The system of claim 11 , wherein the one or more services further characterize the requestor as an automated-agent when the second challenge-response problem was successfully completed in a same manner as the challenge-response problem. | 0.5 |
5,547,199 | 11 | 12 | 11. A method of playing a game of claim 10 wherein the step of: if a predetermined plurality of rewards and/or scoring means is acquired by player, ending the game or subsequent player repeats steps of a player commencing his (or her) turn to the last step; comprises of: if a predetermined plurality of rewards and/or scoring means is acquired by player ending the game or a subsequent player displays a number of picture means and goes through step of explaining relationships to the last step. | 11. A method of playing a game of claim 10 wherein the step of: if a predetermined plurality of rewards and/or scoring means is acquired by player, ending the game or subsequent player repeats steps of a player commencing his (or her) turn to the last step; comprises of: if a predetermined plurality of rewards and/or scoring means is acquired by player ending the game or a subsequent player displays a number of picture means and goes through step of explaining relationships to the last step. 12. A method of playing a game of claim 11 further comprising a step of: if all the players have completed the step of explaining without a predetermined plurality of rewards and/or scoring means acquired by a player, repeating the first step to the last step; directly after step of: if a player has acquired a predetermined number of rewards and/or scoring means, ending the game or a subsequent player displays a number of picture means and goes through step of explaining relationships to the last step. | 0.5 |
7,640,267 | 1 | 41 | 1. A method of semantically representing a target entity using a semantic object, the method comprising: identifying a set of meta-tags having associated metadata entries to represent attributes associated with the target entity in the semantic object, the semantic object being stored on a computer-readable storage medium; wherein at least one meta-tag of the set of meta-tags is defined using an ontology; storing in a metadata entry in the semantic object on the computer-readable storage medium an attribute including an access policy that specifies how the semantic object is shared over a network; sharing, over a network, the semantic object with a user via a computational device in accordance with the access policy of the semantic object; displaying the semantic object on a display screen of the computational device; creating a second semantic object to represent information resource or tacit information, the second semantic object comprising meta-tags which identify semantic information and rules regarding at least one of: how the second semantic object (i) interacts with, (ii) is manipulated by, and (iii) is displayed to human beings and automated processes; seeking to detect the information resource containing information that is represented by the second semantic object; linking the second semantic object to the information resource to represent the information resource using the second semantic object; wherein the second semantic object is configured to have a link to or from any number of other semantic objects. | 1. A method of semantically representing a target entity using a semantic object, the method comprising: identifying a set of meta-tags having associated metadata entries to represent attributes associated with the target entity in the semantic object, the semantic object being stored on a computer-readable storage medium; wherein at least one meta-tag of the set of meta-tags is defined using an ontology; storing in a metadata entry in the semantic object on the computer-readable storage medium an attribute including an access policy that specifies how the semantic object is shared over a network; sharing, over a network, the semantic object with a user via a computational device in accordance with the access policy of the semantic object; displaying the semantic object on a display screen of the computational device; creating a second semantic object to represent information resource or tacit information, the second semantic object comprising meta-tags which identify semantic information and rules regarding at least one of: how the second semantic object (i) interacts with, (ii) is manipulated by, and (iii) is displayed to human beings and automated processes; seeking to detect the information resource containing information that is represented by the second semantic object; linking the second semantic object to the information resource to represent the information resource using the second semantic object; wherein the second semantic object is configured to have a link to or from any number of other semantic objects. 41. The method of claim 1 , wherein, the metadata entry is automatically identified by the computational device. | 0.832836 |
7,661,124 | 23 | 24 | 23. At a computer system in a Web Services environment, a computer program product for implementing a method of assisting a user in generating a more secure policy document by providing a rule-based tool that automatically selects security conditions for the user's general security criteria such that the user does not have exposure to all security details, the computer program product comprising one or more computer readable storage media having stored thereon computer executable instructions that, when executed by a processor, can cause the messaging system to perform: at a generation phase of the secure policy document: present a set of Web Service security options to a user at a user interface, which abstracts the user from any specific code that will be generated for a secure policy document that satisfies one or more of the set of Web Service security options, the set of Web Service security options including at least an option for communicating using a secure conversation and an option for communicating without using a secure conversation; receive user input selecting a general security criteria from the set of Web Service security options presented, the general security criteria being the option for communicating using a secure conversation; based on the received user input selecting the option for communicating using a secure conversation, access one or more security rules from a repository of extensible security metadata, the one or more security rules corresponding to the general security criteria and relating to client authentication tokens; present a set of Web Service client authentication token options to the user at the user interface, which abstracts the user from any specific code that will be generated for the secure policy document that satisfies one or more of the set of Web Service client authentication tokens to the user at the user interface; receive user input selecting one option from the set of Web Service client authentication token options; based on the received user input select one option from the set of Web Service client authentication token options, accessing one or more security rules from the repository of extensible security metadata, the one or more security rules corresponding to the Web Service client authentication token options and providing more specific rules for implementing the selected option from the set of Web Service client authentication token options; determining whether the secure policy document is a client policy document or a service policy document; and use the one or more security rules corresponding to the general security criteria and to the selected one option to generate the secure policy document in accordance with the general security criteria and the selected one option, wherein generating the secure policy document includes automatically selecting specific security conditions that enforce the general security criteria and selected one option input by the user, and wherein the security conditions that are more specific than the general security criteria and the selected one option input by the user are applied based whether the secure policy document is determined to be a client policy document or a service policy document, such that different one or more security rules are applied in creating the secure policy document when the secure policy document is a client policy document as compared to when the secure policy document is a service policy document. | 23. At a computer system in a Web Services environment, a computer program product for implementing a method of assisting a user in generating a more secure policy document by providing a rule-based tool that automatically selects security conditions for the user's general security criteria such that the user does not have exposure to all security details, the computer program product comprising one or more computer readable storage media having stored thereon computer executable instructions that, when executed by a processor, can cause the messaging system to perform: at a generation phase of the secure policy document: present a set of Web Service security options to a user at a user interface, which abstracts the user from any specific code that will be generated for a secure policy document that satisfies one or more of the set of Web Service security options, the set of Web Service security options including at least an option for communicating using a secure conversation and an option for communicating without using a secure conversation; receive user input selecting a general security criteria from the set of Web Service security options presented, the general security criteria being the option for communicating using a secure conversation; based on the received user input selecting the option for communicating using a secure conversation, access one or more security rules from a repository of extensible security metadata, the one or more security rules corresponding to the general security criteria and relating to client authentication tokens; present a set of Web Service client authentication token options to the user at the user interface, which abstracts the user from any specific code that will be generated for the secure policy document that satisfies one or more of the set of Web Service client authentication tokens to the user at the user interface; receive user input selecting one option from the set of Web Service client authentication token options; based on the received user input select one option from the set of Web Service client authentication token options, accessing one or more security rules from the repository of extensible security metadata, the one or more security rules corresponding to the Web Service client authentication token options and providing more specific rules for implementing the selected option from the set of Web Service client authentication token options; determining whether the secure policy document is a client policy document or a service policy document; and use the one or more security rules corresponding to the general security criteria and to the selected one option to generate the secure policy document in accordance with the general security criteria and the selected one option, wherein generating the secure policy document includes automatically selecting specific security conditions that enforce the general security criteria and selected one option input by the user, and wherein the security conditions that are more specific than the general security criteria and the selected one option input by the user are applied based whether the secure policy document is determined to be a client policy document or a service policy document, such that different one or more security rules are applied in creating the secure policy document when the secure policy document is a client policy document as compared to when the secure policy document is a service policy document. 24. The computer program product of claim 23 , wherein the one or more security rules are based on Web Service industry wisdom from input given by experts in the industry for security purposes. | 0.832174 |
4,817,129 | 5 | 6 | 5. The method of claim 1 wherein the step of searching the data base initially includes searching for the one filette that will contain the numeric string keyed by the caller. | 5. The method of claim 1 wherein the step of searching the data base initially includes searching for the one filette that will contain the numeric string keyed by the caller. 6. The method of claim 5 further including restricting the search to a single filette, during the numeral-by-numeral keying of the inquiry, as soon as even a partial numeric string has been received that can be found only in that filette. | 0.5 |
9,721,017 | 15 | 16 | 15. A method for search, retrieval, and display of information in an electronic communication network, the method comprising: transmitting, in response to a query input, a search query from a user agent comprising one or more hardware-based processors, one or more hardware-based memories storing computer-executable instructions, and one or more screens in the electronic communication network; receiving a first query response document comprising a set of two or more response snippets; displaying the query response document in a response document display on the one or more screens; selecting a sourced document by receiving a first selection input from within the response document display; in response to the first selection input, providing a first distinguishing context for a first document display of a client content version of the sourced document on the one or more screens; selecting the sourced document by receiving a second selection input from within the response document display; in response to the second selection input, providing a second distinguishing context for a second document display of the client content version of the sourced document on the one or more screens; in response to a first action set of single actions comprising the first selection input and zero or more single actions permitted according to the set of distinguishing inputs of the first distinguishing context of the first document display, distinguishing partially and displaying visibly a first matching document snippet of the client content version that is canonically similar to the first set of one or more response snippets in the first document display on the one or more screens; in response to a second action set of single actions comprising the second selection input and zero or more single actions permitted according to the set of distinguishing inputs of the second distinguishing context of the second document display, distinguishing partially and displaying visibly a first matching document snippet of the client content version that is canonically similar to the second set of one or more response snippets in the second document display on the one or more screens; displaying, in the first document display and in a manner that is not distinguishing according to the distinguishing manner of the first distinguishing context, the second matching document snippet; and displaying, in the second document display and in a manner that is not distinguishing according to the distinguishing manner of the second distinguishing context, the first matching document snippet. | 15. A method for search, retrieval, and display of information in an electronic communication network, the method comprising: transmitting, in response to a query input, a search query from a user agent comprising one or more hardware-based processors, one or more hardware-based memories storing computer-executable instructions, and one or more screens in the electronic communication network; receiving a first query response document comprising a set of two or more response snippets; displaying the query response document in a response document display on the one or more screens; selecting a sourced document by receiving a first selection input from within the response document display; in response to the first selection input, providing a first distinguishing context for a first document display of a client content version of the sourced document on the one or more screens; selecting the sourced document by receiving a second selection input from within the response document display; in response to the second selection input, providing a second distinguishing context for a second document display of the client content version of the sourced document on the one or more screens; in response to a first action set of single actions comprising the first selection input and zero or more single actions permitted according to the set of distinguishing inputs of the first distinguishing context of the first document display, distinguishing partially and displaying visibly a first matching document snippet of the client content version that is canonically similar to the first set of one or more response snippets in the first document display on the one or more screens; in response to a second action set of single actions comprising the second selection input and zero or more single actions permitted according to the set of distinguishing inputs of the second distinguishing context of the second document display, distinguishing partially and displaying visibly a first matching document snippet of the client content version that is canonically similar to the second set of one or more response snippets in the second document display on the one or more screens; displaying, in the first document display and in a manner that is not distinguishing according to the distinguishing manner of the first distinguishing context, the second matching document snippet; and displaying, in the second document display and in a manner that is not distinguishing according to the distinguishing manner of the second distinguishing context, the first matching document snippet. 16. The method of claim 15 , wherein the manner of partially distinguishing the first matching document snippet comprises changing the background color of at least some of the textual display of the first matching document snippet. | 0.5 |
8,103,671 | 15 | 18 | 15. The computer program product of claim 13 , wherein generating the set of features from the plurality of heterogeneous datasets comprises: determining whether a dataset is a labeled dataset or an unlabeled dataset; responsive to determining the dataset is a labeled dataset, generating a vector representation of a category of the dataset; generating a reduced vector representation by truncating the vector representation of the category of the dataset; determining a similarity value between the reduced vector representation and the input text data; and responsive to the similarity value exceeding a threshold value, including the reduced vector representation in the set of features. | 15. The computer program product of claim 13 , wherein generating the set of features from the plurality of heterogeneous datasets comprises: determining whether a dataset is a labeled dataset or an unlabeled dataset; responsive to determining the dataset is a labeled dataset, generating a vector representation of a category of the dataset; generating a reduced vector representation by truncating the vector representation of the category of the dataset; determining a similarity value between the reduced vector representation and the input text data; and responsive to the similarity value exceeding a threshold value, including the reduced vector representation in the set of features. 18. The computer program product of claim 15 , wherein determining the similarity value between the reduced vector representation and the input text data comprises: computing a cosine similarity between the reduced vector representation and the input text data. | 0.583067 |
8,548,846 | 1 | 5 | 1. A computer readable medium storing computer executable instructions that when executed on a processor of a computer performs a method for providing a billboard advertisement through an online service, the billboard advertisement composed by an advertising user, the method comprising: displaying, an interface to the advertising user at a computer, the interface including a sponsor selection mechanism for allowing selection of a billboard sponsor from a list of billboard sponsors, a target user selection mechanism for allowing selection by the advertising user of at least one target user, and a text input region for receiving an input message from the advertising user; processing, at a web server, information input to the displayed interface of the computer to create the billboard advertisement; composing, at the web server, the billboard advertisement including the input message and the at least one selected billboard sponsor; and rendering a web home page for the at least one target user to display the billboard advertisement, wherein the web home page is delivered to the at least one target user. | 1. A computer readable medium storing computer executable instructions that when executed on a processor of a computer performs a method for providing a billboard advertisement through an online service, the billboard advertisement composed by an advertising user, the method comprising: displaying, an interface to the advertising user at a computer, the interface including a sponsor selection mechanism for allowing selection of a billboard sponsor from a list of billboard sponsors, a target user selection mechanism for allowing selection by the advertising user of at least one target user, and a text input region for receiving an input message from the advertising user; processing, at a web server, information input to the displayed interface of the computer to create the billboard advertisement; composing, at the web server, the billboard advertisement including the input message and the at least one selected billboard sponsor; and rendering a web home page for the at least one target user to display the billboard advertisement, wherein the web home page is delivered to the at least one target user. 5. The method of claim 1 , further comprising providing a public list selection mechanism for selection of the at least one target user, the public list selection mechanism allowing advertising user selection of a common characteristic of the at least one target user such that the online service is able to select a set of target users sharing the common characteristic. | 0.5 |
9,679,019 | 1 | 2 | 1. A system comprising: at least one database; at least one processor implemented at least partially by hardware; and a memory including instructions that, when executed by the at least one processor, cause the at least one processor to: retrieve, from the at least one database, at least one independent claim of a patent as issued; retrieve, from the at least one database, at least one independent claim of the corresponding patent application as published; automatically compare the at least one issued independent claim of the patent to the at least one published independent claim of the patent application to identify at least one unique keyword present in the at least one issued independent claim but not present in the at least one published independent claim; cross-reference, using the at least one processor, the at least one identified unique keyword to a passage in the specification of the issued patent, wherein the at least one identified unique keyword is cross-referenced to the passage in the specification of the issued patent using input received from a user interface; identify a first prior art document and a second prior art document; calculate an overlap score for the first prior art document based on at least one occurrence of the at least one unique keyword in the first prior art document; calculate an overlap score for the second prior art document based on at least one occurrence of the at least one unique keyword in the second prior art document; calculate a ranking for the first prior art document by comparing the calculated overlap score of the first prior art document to the calculated overlap score of the second prior art document; and display, in the user interface, a graphical representation of the calculated overlap score of the first prior art document and a graphical representation of the calculated overlap score of the second prior art document based on the calculated ranking, and the passage in the specification of the issued patent. | 1. A system comprising: at least one database; at least one processor implemented at least partially by hardware; and a memory including instructions that, when executed by the at least one processor, cause the at least one processor to: retrieve, from the at least one database, at least one independent claim of a patent as issued; retrieve, from the at least one database, at least one independent claim of the corresponding patent application as published; automatically compare the at least one issued independent claim of the patent to the at least one published independent claim of the patent application to identify at least one unique keyword present in the at least one issued independent claim but not present in the at least one published independent claim; cross-reference, using the at least one processor, the at least one identified unique keyword to a passage in the specification of the issued patent, wherein the at least one identified unique keyword is cross-referenced to the passage in the specification of the issued patent using input received from a user interface; identify a first prior art document and a second prior art document; calculate an overlap score for the first prior art document based on at least one occurrence of the at least one unique keyword in the first prior art document; calculate an overlap score for the second prior art document based on at least one occurrence of the at least one unique keyword in the second prior art document; calculate a ranking for the first prior art document by comparing the calculated overlap score of the first prior art document to the calculated overlap score of the second prior art document; and display, in the user interface, a graphical representation of the calculated overlap score of the first prior art document and a graphical representation of the calculated overlap score of the second prior art document based on the calculated ranking, and the passage in the specification of the issued patent. 2. The system of claim 1 , further comprising instructions that, when executed by the at least one processor, cause the at least one processor to: identify at least one common keyword present in both of the at least one published independent claim and the at least one issued independent claim; and calculate the overlap score for the first prior art document based on at least one occurrence of the at least one common keyword in the first prior art document. | 0.573284 |
8,996,379 | 3 | 10 | 3. The method of claim 1 , wherein, adapting the speech recognition facility includes adapting recognition models based on usage data. | 3. The method of claim 1 , wherein, adapting the speech recognition facility includes adapting recognition models based on usage data. 10. The method of claim 3 , wherein adapting recognition models is specific to the software application or groups of software applications. | 0.5 |
9,152,702 | 17 | 18 | 17. The system of claim 16 , wherein the user drill-down model comprises a conjunctive drill-down model. | 17. The system of claim 16 , wherein the user drill-down model comprises a conjunctive drill-down model. 18. The system of claim 17 , wherein the conjunctive drill-down model comprises a model according to the function: U q M C ( F q ) = E [ X | q ] - E M C [ X | q , F q ] = ∑ d ∈ q : r q ( d ) > m p ( d - d q ) D q , d , F q . | 0.5 |
8,016,678 | 26 | 27 | 26. The system of claim 25 further comprising a second feedback means arranged such that direct feedback is provided on errors in demonstration of target education skills. | 26. The system of claim 25 further comprising a second feedback means arranged such that direct feedback is provided on errors in demonstration of target education skills. 27. The system of claim 26 where the feedback is varied including direct feedback, indirect feedback and both direct and indirect feedback. | 0.5 |
9,336,268 | 10 | 12 | 10. A method of analyzing feedback data of an electronic learning system comprising: receiving a plurality of feedback data from one or more client devices, the received feedback data corresponding to user feedback of one or more users relating to electronic learning content of the electronic learning system; determining an associated user and a sentiment score for each of the received plurality of feedback data; grouping the plurality of feedback data into one or more feedback aggregations associated with the one or more users; calculating a sentiment score for each of the one or more first feedback aggregations associated with the one or more users; receiving user records associated with each of the one or more users, the received user records relating to interactions of the one or more users with the electronic learning system occurring after receipt of the feedback data; storing the user records and associated sentiment scores for each of the one or more user within a data store of the electronic learning system; training a machine learning algorithm based on the stored user records and associated sentiment scores, for each of the one or more users within the data store of the electronic learning system; receiving additional feedback data from the one or more client devices, the additional feedback data including user feedback from a first user relating to electronic learning content; calculating a sentiment score for the first user, based on the received additional feedback data; using the stored user records and associated sentiment scores in the data store of the electronic learning system, determining a user record prediction for the first user using the trained machine learning algorithm, based on the calculated sentiment score for the first user; determining an output and one or more output devices, based on the determined user record prediction for the first user; and transmitting the determined output to the determined one or more output devices. | 10. A method of analyzing feedback data of an electronic learning system comprising: receiving a plurality of feedback data from one or more client devices, the received feedback data corresponding to user feedback of one or more users relating to electronic learning content of the electronic learning system; determining an associated user and a sentiment score for each of the received plurality of feedback data; grouping the plurality of feedback data into one or more feedback aggregations associated with the one or more users; calculating a sentiment score for each of the one or more first feedback aggregations associated with the one or more users; receiving user records associated with each of the one or more users, the received user records relating to interactions of the one or more users with the electronic learning system occurring after receipt of the feedback data; storing the user records and associated sentiment scores for each of the one or more user within a data store of the electronic learning system; training a machine learning algorithm based on the stored user records and associated sentiment scores, for each of the one or more users within the data store of the electronic learning system; receiving additional feedback data from the one or more client devices, the additional feedback data including user feedback from a first user relating to electronic learning content; calculating a sentiment score for the first user, based on the received additional feedback data; using the stored user records and associated sentiment scores in the data store of the electronic learning system, determining a user record prediction for the first user using the trained machine learning algorithm, based on the calculated sentiment score for the first user; determining an output and one or more output devices, based on the determined user record prediction for the first user; and transmitting the determined output to the determined one or more output devices. 12. The method of claim 10 , wherein the received plurality of feedback data comprises multimodal user input data relating to the electronic learning content, and wherein determining the sentiment score for the each of the received plurality of feedback data comprises at least two of: using a language processing engine to determine a sentiment score for text feedback data relating to the electronic learning content; using a voice analyzer to determine a sentiment score for voice feedback data relating to the electronic learning content; using a gesture analyzer to determine a sentiment score for movement feedback data relating to the electronic learning content; and using an eye movement analyzer to determine a sentiment score for eye movement feedback data relating to the electronic learning content. | 0.5 |
8,386,912 | 10 | 22 | 10. The method of claim 1 further comprising determining a predefined set of preferences; and storing the versions of the documents in accordance with the determined preferences. | 10. The method of claim 1 further comprising determining a predefined set of preferences; and storing the versions of the documents in accordance with the determined preferences. 22. The method of claim 10 wherein the set of preferences includes a preference for compiling a document. | 0.778481 |
8,104,017 | 52 | 71 | 52. A non-transitory computer readable medium for use on a computing device, the medium storing instructions executable using the computing device, the instructions for: identifying a plurality of entities having relationships therebetween; accessing a first entity from the plurality of entities, the first entity including a graphical model that has a graphical affordance; accessing a second entity from the plurality of entities, the second entity including at least one of a generated code or an intermediate representation that corresponds to the graphical model; and mapping the first entity to the second entity, using a computer, to facilitate graphical identification of a bi-directional mapping between a first part, of the first entity, that includes the graphical affordance depicted in the graphical model, and a second part, of the second entity, that includes a segment, of the at least one of the generated code or the intermediate representation, associated with the graphical affordance. | 52. A non-transitory computer readable medium for use on a computing device, the medium storing instructions executable using the computing device, the instructions for: identifying a plurality of entities having relationships therebetween; accessing a first entity from the plurality of entities, the first entity including a graphical model that has a graphical affordance; accessing a second entity from the plurality of entities, the second entity including at least one of a generated code or an intermediate representation that corresponds to the graphical model; and mapping the first entity to the second entity, using a computer, to facilitate graphical identification of a bi-directional mapping between a first part, of the first entity, that includes the graphical affordance depicted in the graphical model, and a second part, of the second entity, that includes a segment, of the at least one of the generated code or the intermediate representation, associated with the graphical affordance. 71. The computer readable medium of claim 52 , where: the first part is related to a plurality of parts related to the second entity, or the second part is related to a plurality of parts related to the first entity. | 0.602941 |
6,063,133 | 2 | 4 | 2. A method for compiling source code to p-code or machine-language instructions, wherein the source code contains high-level source code with embedded SQL statements, said method comprising the steps of: reading the source code one line at a time to generate a read line of source code; determining whether said read line of source code is high level source code or an SQL statement; and compiling said read line of source code to p-code or machine-language instructions, wherein if said read line of source code is an SQL statement, said compilation of said read line of source code occurs in a one-pass parsing mechanism. | 2. A method for compiling source code to p-code or machine-language instructions, wherein the source code contains high-level source code with embedded SQL statements, said method comprising the steps of: reading the source code one line at a time to generate a read line of source code; determining whether said read line of source code is high level source code or an SQL statement; and compiling said read line of source code to p-code or machine-language instructions, wherein if said read line of source code is an SQL statement, said compilation of said read line of source code occurs in a one-pass parsing mechanism. 4. A method for compiling source code to p-code or machine-language instructions according to claim 2, wherein if said read line of source code is an SQL statement, said compilation of said read line of source code processes and maintains the scope of variables. | 0.5 |
8,996,922 | 11 | 19 | 11. A computer-readable storage medium including computer executable instructions configured to cause a system to perform operations for determining whether a set of constraints is satisfiable, the operations comprising: identifying a set of constraints associated with a software module; modeling a string associated with a string constraint of the set of constraints as a parameterized array; and determining a satisfiability of the set of constraints based on a representation of the string constraint as a quantified expression and based on elimination of a quantifier associated with the quantified expression such that the string constraint is represented as a numeric constraint, the representation of the string constraint as a quantified expression being based on the parameterized array associated with the string. | 11. A computer-readable storage medium including computer executable instructions configured to cause a system to perform operations for determining whether a set of constraints is satisfiable, the operations comprising: identifying a set of constraints associated with a software module; modeling a string associated with a string constraint of the set of constraints as a parameterized array; and determining a satisfiability of the set of constraints based on a representation of the string constraint as a quantified expression and based on elimination of a quantifier associated with the quantified expression such that the string constraint is represented as a numeric constraint, the representation of the string constraint as a quantified expression being based on the parameterized array associated with the string. 19. The computer-readable storage medium of claim 11 , wherein the operations further comprise: eliminating the quantifier through recursively unrolling the quantified expression to generate an incremented expression of the string constraint; and determining whether the set of constraints is satisfiable based on the incremented expression. | 0.5 |
8,751,484 | 10 | 13 | 10. A computer system, comprising: memory; one or more processors; one or more programs stored in the memory and configured for execution by the one or more processors, the one or more programs including: instructions for receiving a search request from a user of the computer, the search request including a plurality of search keywords; and in response to the search request: instructions for identifying multiple resource identifiers in accordance with a first set of predefined criteria for selecting a respective document that satisfies user-specified search keywords from a user, each resource identifier corresponding to a document at a respective data source; instructions for retrieving a document from the respective document source for at least one of the resource identifiers; instructions for identifying within the retrieved document a chunk by applying a second set of user-specified criteria to one or more candidate chunks within the retrieved document; and instructions for providing the identified chunk and a link to the identified chunk within the document for display to the user, wherein the first set of predefined criteria requires that at least a first subset of the search keywords be found within an identified respective document, and the second set of predefined criteria requires that at least a second subset of the search keywords be found within an identified chunk. | 10. A computer system, comprising: memory; one or more processors; one or more programs stored in the memory and configured for execution by the one or more processors, the one or more programs including: instructions for receiving a search request from a user of the computer, the search request including a plurality of search keywords; and in response to the search request: instructions for identifying multiple resource identifiers in accordance with a first set of predefined criteria for selecting a respective document that satisfies user-specified search keywords from a user, each resource identifier corresponding to a document at a respective data source; instructions for retrieving a document from the respective document source for at least one of the resource identifiers; instructions for identifying within the retrieved document a chunk by applying a second set of user-specified criteria to one or more candidate chunks within the retrieved document; and instructions for providing the identified chunk and a link to the identified chunk within the document for display to the user, wherein the first set of predefined criteria requires that at least a first subset of the search keywords be found within an identified respective document, and the second set of predefined criteria requires that at least a second subset of the search keywords be found within an identified chunk. 13. The computer system of claim 10 , further comprising: instructions for identifying multiple chunks within the retrieved document, wherein each chunk satisfies the search keywords; and instructions for displaying the multiple chunks and a link to each of the multiple chunks within the document. | 0.737676 |
9,491,207 | 1 | 11 | 1. A method comprising: maintaining a profile for the user at a social networking system including a processor, the profile including one or more information items associated with data describing characteristics of the user and a set of unknown information items not associated with data; obtaining a plurality of questions associated with one or more unknown information items from the set of unknown information items at the social networking system; determining, for each of the plurality of questions associated with the one or more unknown information items, a response probability based at least in part on one or a combination of a format and content of the question, the response probability indicating a likelihood of the social networking system receiving a response to the question when presented; determining a data acquisition value for each of the one or more unknown information items in the set of unknown information items, the data acquisition value of an unknown information item based at least in part on a value to the social networking system of associating data with the unknown information item and the determined response probability; selecting an unknown information item from the one or more unknown 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 question associated with the selected unknown information item for presentation to the user based at least in part on the response probabilities of one or more questions associated with the selected unknown information item. | 1. A method comprising: maintaining a profile for the user at a social networking system including a processor, the profile including one or more information items associated with data describing characteristics of the user and a set of unknown information items not associated with data; obtaining a plurality of questions associated with one or more unknown information items from the set of unknown information items at the social networking system; determining, for each of the plurality of questions associated with the one or more unknown information items, a response probability based at least in part on one or a combination of a format and content of the question, the response probability indicating a likelihood of the social networking system receiving a response to the question when presented; determining a data acquisition value for each of the one or more unknown information items in the set of unknown information items, the data acquisition value of an unknown information item based at least in part on a value to the social networking system of associating data with the unknown information item and the determined response probability; selecting an unknown information item from the one or more unknown 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 question associated with the selected unknown information item for presentation to the user based at least in part on the response probabilities of one or more questions associated with the selected unknown information item. 11. The method of claim 1 , further comprising: receiving a response to the selected question from the user; and selecting an additional question based at least in part on the received response. | 0.894565 |
8,051,061 | 1 | 10 | 1. A method for query suggestion performed by a processor executing computer-executable instructions stored on a memory device, the method comprising: for an input query in source language, identifying a query in target language from a query log of a search engine, the query in target language and the input query in source language having a cross-lingual similarity, the identifying the query in target language from the query log comprising: providing a plurality of candidate queries in target language; evaluating the plurality of candidate queries in target language at least partly by deducing a monolingual similarity between the input query in source language and a translation of a respective candidate query from target language to source language; and ranking the plurality of candidate queries in target language using a cross-lingual query similarity score, the cross-lingual query similarity score being based on a plurality of features and a weight of each feature in calculating the cross-lingual query similarity score; and suggesting the query in target language as a cross-lingual query at least partly based on click-through information of documents selected by users for the query in target language. | 1. A method for query suggestion performed by a processor executing computer-executable instructions stored on a memory device, the method comprising: for an input query in source language, identifying a query in target language from a query log of a search engine, the query in target language and the input query in source language having a cross-lingual similarity, the identifying the query in target language from the query log comprising: providing a plurality of candidate queries in target language; evaluating the plurality of candidate queries in target language at least partly by deducing a monolingual similarity between the input query in source language and a translation of a respective candidate query from target language to source language; and ranking the plurality of candidate queries in target language using a cross-lingual query similarity score, the cross-lingual query similarity score being based on a plurality of features and a weight of each feature in calculating the cross-lingual query similarity score; and suggesting the query in target language as a cross-lingual query at least partly based on click-through information of documents selected by users for the query in target language. 10. The method as recited in claim 1 , wherein the providing the plurality of candidate queries in target language comprises: ranking queries in the query log using bidirectional translation probability derived from a parallel corpora of the source language and the target language; and selecting a set of top queries based on ranking result. | 0.668605 |
7,788,274 | 6 | 7 | 6. The method of claim 1 , wherein receiving the association data record further comprises generating an output signal. | 6. The method of claim 1 , wherein receiving the association data record further comprises generating an output signal. 7. The method of claim 6 , wherein the output signal comprises the article identifier. | 0.565657 |
9,870,358 | 1 | 5 | 1. A method for distributing electronic content related to paper documents, the method comprising: receiving at a server, an image of at least a portion of a page of a paper document, the image captured by a device of a user reading the paper document, the device communicatively coupled to the server; determining a page layout of the page of the paper document based on the image, the page layout including a spatial arrangement of elements of the paper document with respect to the page; correlating the page layout of the page of the paper document with page layouts of a plurality of electronic documents by an image based comparison, each electronic document comprising markup language page elements that collectively reconstruct the electronic document while preserving page layouts of a corresponding paper document, the correlating further comprising: using linear discriminant analysis to determine low-dimensional structures of the received image and of the plurality of electronic documents; and establishing a correlation factor between the received image and each of the plurality of electronic documents, the correlation factor based upon the low-dimensional structures; identifying, based on the correlation, one of the electronic documents best matching the page of the paper document; retrieving additional electronic content related to the identified document; and sending the additional electronic content to a connected device of the user for display to the user. | 1. A method for distributing electronic content related to paper documents, the method comprising: receiving at a server, an image of at least a portion of a page of a paper document, the image captured by a device of a user reading the paper document, the device communicatively coupled to the server; determining a page layout of the page of the paper document based on the image, the page layout including a spatial arrangement of elements of the paper document with respect to the page; correlating the page layout of the page of the paper document with page layouts of a plurality of electronic documents by an image based comparison, each electronic document comprising markup language page elements that collectively reconstruct the electronic document while preserving page layouts of a corresponding paper document, the correlating further comprising: using linear discriminant analysis to determine low-dimensional structures of the received image and of the plurality of electronic documents; and establishing a correlation factor between the received image and each of the plurality of electronic documents, the correlation factor based upon the low-dimensional structures; identifying, based on the correlation, one of the electronic documents best matching the page of the paper document; retrieving additional electronic content related to the identified document; and sending the additional electronic content to a connected device of the user for display to the user. 5. The method of claim 1 , wherein receiving the image comprises: receiving an identifier of the user; and authenticating the user based on the received identifier. | 0.853047 |
9,711,117 | 8 | 12 | 8. A non-transitory computer readable medium having a computer readable program code embodied therein, the computer readable program code adapted to be executed to implement a method for recognising music symbols based on handwritten music notations on a computing device, the computing device comprising a processor and at least one system non-transitory computer readable medium for recognizing handwriting input under control of the processor, the method comprising: segmenting the handwritten music notations into a plurality of ink segments; determining at least one music symbol candidate for graphical objects representing groupings of the ink segments based on spatial relationships therebetween, the at least one music symbol candidate having an associated symbol cost; forming one or more graphs including the at least one music symbol candidate and one or more grammar rules applied to the at least one music symbol candidate, each grammar rule applied to at least two music symbol candidates having an associated spatial cost based on the spatial relationships between the graphical objects of the at least two music symbol candidates; and selecting at least one graph of the one or more graphs as representing the handwritten music notations based on the symbol costs and the spatial costs associated with the one or more graphs. | 8. A non-transitory computer readable medium having a computer readable program code embodied therein, the computer readable program code adapted to be executed to implement a method for recognising music symbols based on handwritten music notations on a computing device, the computing device comprising a processor and at least one system non-transitory computer readable medium for recognizing handwriting input under control of the processor, the method comprising: segmenting the handwritten music notations into a plurality of ink segments; determining at least one music symbol candidate for graphical objects representing groupings of the ink segments based on spatial relationships therebetween, the at least one music symbol candidate having an associated symbol cost; forming one or more graphs including the at least one music symbol candidate and one or more grammar rules applied to the at least one music symbol candidate, each grammar rule applied to at least two music symbol candidates having an associated spatial cost based on the spatial relationships between the graphical objects of the at least two music symbol candidates; and selecting at least one graph of the one or more graphs as representing the handwritten music notations based on the symbol costs and the spatial costs associated with the one or more graphs. 12. The non-transitory computer readable medium according to claim 8 , wherein the forming one or more graphs comprises: forming each graph to comprise descendant nodes, each descendant node being either a terminal node corresponding to a music symbol candidate or a non-terminal node corresponding to a grammar rule applied to at least one other descendant node. | 0.5 |
7,784,036 | 13 | 17 | 13. A system comprising: a preprocessor to extract macroinstructions that are hard-coded into parser code of a command line interface (CLI) parser, wherein the macroinstructions define parse nodes utilized by the CLI parser to analyze whether one or more CLI commands input to a CLI prompt have a proper CLI syntax; means for generating a parse graph from the macroinstructions, wherein the parse graph includes a representation of the parse nodes defined by the macroinstructions; means for hiding selected information contained within the parse nodes to create condensed parse nodes, wherein the hiding prevents further processing of the selected information; means for simplifying selected complex patterns in the parse graph to create simplified parse graph patterns; means for creating branches on an AND/OR command tree from the parse nodes, the condensed parse nodes, and the simplified parse graph patterns; and means for creating an exportable representation of the AND/OR command tree. | 13. A system comprising: a preprocessor to extract macroinstructions that are hard-coded into parser code of a command line interface (CLI) parser, wherein the macroinstructions define parse nodes utilized by the CLI parser to analyze whether one or more CLI commands input to a CLI prompt have a proper CLI syntax; means for generating a parse graph from the macroinstructions, wherein the parse graph includes a representation of the parse nodes defined by the macroinstructions; means for hiding selected information contained within the parse nodes to create condensed parse nodes, wherein the hiding prevents further processing of the selected information; means for simplifying selected complex patterns in the parse graph to create simplified parse graph patterns; means for creating branches on an AND/OR command tree from the parse nodes, the condensed parse nodes, and the simplified parse graph patterns; and means for creating an exportable representation of the AND/OR command tree. 17. The system of claim 13 further comprising means for collecting the parse nodes that terminate in a common end of line. | 0.675532 |
7,983,913 | 6 | 7 | 6. The system of claim 1 wherein the intersection data store stores a pronunciation for each of the street names in the street intersections tokenized in tokens representative of a set of sub-word units defining words in the street names. | 6. The system of claim 1 wherein the intersection data store stores a pronunciation for each of the street names in the street intersections tokenized in tokens representative of a set of sub-word units defining words in the street names. 7. The system of claim 6 wherein the tokens further define a position dependence of each sub-word unit that define at least some of the words in the street names. | 0.5 |
9,251,468 | 8 | 10 | 8. The computer-implemented method of claim 1 , wherein identifying the one or more of the set of users connected to the selected user comprises: selecting a first set of users connected to the selected user for inferring a first user profile attribute, the first set of users selected based on a first criteria associated with the first user profile attribute; and selecting a second set of users connected to the selected user for inferring a second user profile attribute, the second set of users selected based on a second criteria associated with the second user profile attribute. | 8. The computer-implemented method of claim 1 , wherein identifying the one or more of the set of users connected to the selected user comprises: selecting a first set of users connected to the selected user for inferring a first user profile attribute, the first set of users selected based on a first criteria associated with the first user profile attribute; and selecting a second set of users connected to the selected user for inferring a second user profile attribute, the second set of users selected based on a second criteria associated with the second user profile attribute. 10. The computer-implemented method of claim 8 , wherein the first set of users connected to the selected user excludes users indicated as family members of the user if the first user profile attribute being inferred is age of the user. | 0.535433 |
9,262,397 | 9 | 14 | 9. A computer-implemented error correction method, comprising acts of: receiving a sequence of multiple words intended to form a fluent language expression; detecting an erroneous subsequence of two or more words in the sequence of multiple words defined by a sliding window covering subsequences of two or more words of the sequence of multiple words; generating potential candidate strings of words related to the erroneous subsequence of words from a corpus of alternative arrangements of same or similar words, or subsequences of words in a same context, each of the candidate strings having a variable number of words compared a number of words of the erroneous subsequence; selecting candidate strings from one or more of the potential candidate strings for correction of dysfluency of the language expression by the erroneous subsequence of words and presenting potential corrections to a user; and utilizing a processor that executes instructions stored in memory to perform at least one of the acts of detecting, generating, or selecting. | 9. A computer-implemented error correction method, comprising acts of: receiving a sequence of multiple words intended to form a fluent language expression; detecting an erroneous subsequence of two or more words in the sequence of multiple words defined by a sliding window covering subsequences of two or more words of the sequence of multiple words; generating potential candidate strings of words related to the erroneous subsequence of words from a corpus of alternative arrangements of same or similar words, or subsequences of words in a same context, each of the candidate strings having a variable number of words compared a number of words of the erroneous subsequence; selecting candidate strings from one or more of the potential candidate strings for correction of dysfluency of the language expression by the erroneous subsequence of words and presenting potential corrections to a user; and utilizing a processor that executes instructions stored in memory to perform at least one of the acts of detecting, generating, or selecting. 14. The method of claim 9 , further comprising selecting and presenting only a top number of candidate strings based on a ranking component that ranks the candidate strings. | 0.635021 |
7,562,342 | 22 | 23 | 22. The method of claim 21 , wherein the processing step for processing a list of added objects comprises: notifying the model content handler of the list of modified doclet objects; determining if each of the list of modified doclet objects can be processed; if a modified doclet object can be processed, processing each of the list of modified doclet objects; and if a modified doclet object cannot be processed, creating a deferred linker for the modified doclet object. | 22. The method of claim 21 , wherein the processing step for processing a list of added objects comprises: notifying the model content handler of the list of modified doclet objects; determining if each of the list of modified doclet objects can be processed; if a modified doclet object can be processed, processing each of the list of modified doclet objects; and if a modified doclet object cannot be processed, creating a deferred linker for the modified doclet object. 23. The method of claim 22 , wherein the processing step for processing a list of removed objects comprises: notifying the model content handler of the list of removed objects; and repeating the determining step, the processing step and the creating step to process the list of removed objects. | 0.544892 |
8,996,437 | 5 | 6 | 5. The method of claim 1 , wherein the expected answer is a hypothesis answer or a mean answer of a totality of answers received from the experts with respect to a sent question, the method further comprising: determining that an answer received from a sixth expert has a degree of correlation to the expected answer that is outside of an acceptable variance; and labeling the sixth expert an outlier expert; or decreasing a value metric score of the sixth expert. | 5. The method of claim 1 , wherein the expected answer is a hypothesis answer or a mean answer of a totality of answers received from the experts with respect to a sent question, the method further comprising: determining that an answer received from a sixth expert has a degree of correlation to the expected answer that is outside of an acceptable variance; and labeling the sixth expert an outlier expert; or decreasing a value metric score of the sixth expert. 6. The method of claim 5 , wherein the updating the plurality of survey questions by removing questions satisfied by response answers from the selected set of experts comprises: determining that a question has been satisfied with a satisfactory answer upon receiving a total number of responses that meets a threshold number of responses; or determining that a question has been satisfied with a satisfactory answer if an answer to a question is within a threshold variance of correlation to the expected answer. | 0.5 |
4,516,260 | 23 | 25 | 23. An electronic learning aid for training an operator in spelling, said learning aid comprising: memory means for storing digital data including digitized speech data from which one or more words of human speech and the correct spellings thereof may be respectively derived, speech synthesizer means operably associated with said memory means and including means for converting said digitized speech data into audible human speech, means for receiving inputs from an operator of said learning aid, means for providing said digitized speech data from said memory means to said speech synthesizer means, means for randomly selecting a particular word to be spelled by an operator of said learning aid, said particular word being derived from digitized speech data stored in said memory means and converted to audible human speech by said speech synthesizer means, means for comparing an input entered at said operator input means with said correct spelling stored as digital data in said memory means and for generating a result signal indicative of the results of said comparison, and means for generating a response to said operator in accordance with said result signal. | 23. An electronic learning aid for training an operator in spelling, said learning aid comprising: memory means for storing digital data including digitized speech data from which one or more words of human speech and the correct spellings thereof may be respectively derived, speech synthesizer means operably associated with said memory means and including means for converting said digitized speech data into audible human speech, means for receiving inputs from an operator of said learning aid, means for providing said digitized speech data from said memory means to said speech synthesizer means, means for randomly selecting a particular word to be spelled by an operator of said learning aid, said particular word being derived from digitized speech data stored in said memory means and converted to audible human speech by said speech synthesizer means, means for comparing an input entered at said operator input means with said correct spelling stored as digital data in said memory means and for generating a result signal indicative of the results of said comparison, and means for generating a response to said operator in accordance with said result signal. 25. An electronic learning aid according to claim 23, wherein said memory means comprises non-volatile digital semiconductor memory means. | 0.747253 |
8,949,079 | 5 | 7 | 5. The system of claim 1 wherein the data miner is operable to infer a patient state as a function of the combined pieces of information. | 5. The system of claim 1 wherein the data miner is operable to infer a patient state as a function of the combined pieces of information. 7. The system of claim 5 wherein the inference is a function of a statistical model of a pattern of evolution of a disease across a patient population and the relationship between a patient's disease and observed variables. | 0.5 |
7,592,874 | 13 | 21 | 13. A method for phase/frequency detection, comprising: deriving a counter word based on a number of clock edges of an oscillator signal and a predetermined range value; deriving an integrator word by integrating a channel word; executing a modulo operation with the integrator word as a function of the range value; deriving a phase error word by forming a difference between the counter word and the integrator word; and executing a modulo operation with the phase error word as a function of the range value. | 13. A method for phase/frequency detection, comprising: deriving a counter word based on a number of clock edges of an oscillator signal and a predetermined range value; deriving an integrator word by integrating a channel word; executing a modulo operation with the integrator word as a function of the range value; deriving a phase error word by forming a difference between the counter word and the integrator word; and executing a modulo operation with the phase error word as a function of the range value. 21. The method of claim 13 , wherein the counter value is increased based on rising and falling clock edges of the oscillator signal. | 0.802083 |
8,874,555 | 10 | 14 | 10. A system comprising: one or more computers, programmed to perform operations comprising: calculating one or more time trend statistics for a plurality of quality of result statistics for a first document as a search result for a first query, each of the quality of result statistics corresponding to a different time period, the one or more time trend statistics estimating changes in the quality of result statistics over time, wherein each of the one or more time trend statistics include a quality of result difference between a first quality of result statistic for a first document as a search result for a first query during a first time period and a second quality of result statistic for the first document as a search result the first query during a second time period; generating a first modified quality of result statistic by modifying a first quality of result statistic for the first document as a search result for the first query by a factor, where the factor is based on the one or more time trend statistics; and providing the first modified quality of result statistic as an input to a document ranking process for the first document and the first query. | 10. A system comprising: one or more computers, programmed to perform operations comprising: calculating one or more time trend statistics for a plurality of quality of result statistics for a first document as a search result for a first query, each of the quality of result statistics corresponding to a different time period, the one or more time trend statistics estimating changes in the quality of result statistics over time, wherein each of the one or more time trend statistics include a quality of result difference between a first quality of result statistic for a first document as a search result for a first query during a first time period and a second quality of result statistic for the first document as a search result the first query during a second time period; generating a first modified quality of result statistic by modifying a first quality of result statistic for the first document as a search result for the first query by a factor, where the factor is based on the one or more time trend statistics; and providing the first modified quality of result statistic as an input to a document ranking process for the first document and the first query. 14. The system of claim 10 , further programmed to perform operations comprising determining that a first past version of the first document during the first time period is different from a second past version of the first document during the second time period before modifying the first quality of result statistic. | 0.751956 |
9,436,918 | 1 | 3 | 1. A computer-implemented process for predicting a text span forming either a single word or a series of two or more words that a user intended to select, comprising: using a computer to perform the following process actions: receiving a document comprising a string of characters; receiving a location pointer indicating a particular location in the document; inputting the document and the location pointer to a plurality of different candidate text span generation methods; receiving a ranked list of one or more scored candidate text spans from each of the different candidate text span generation methods; using a machine-learned ensemble model to re-score each of the scored candidate text spans received from each of the different candidate text span generation methods, the ensemble model being trained using a machine learning method and features from a dataset of true intended user text span selections; and receiving a ranked list of re-scored candidate text spans from the ensemble model. | 1. A computer-implemented process for predicting a text span forming either a single word or a series of two or more words that a user intended to select, comprising: using a computer to perform the following process actions: receiving a document comprising a string of characters; receiving a location pointer indicating a particular location in the document; inputting the document and the location pointer to a plurality of different candidate text span generation methods; receiving a ranked list of one or more scored candidate text spans from each of the different candidate text span generation methods; using a machine-learned ensemble model to re-score each of the scored candidate text spans received from each of the different candidate text span generation methods, the ensemble model being trained using a machine learning method and features from a dataset of true intended user text span selections; and receiving a ranked list of re-scored candidate text spans from the ensemble model. 3. The process of claim 1 , further comprising the actions of: identifying the candidate text span in the ranked list of re-scored candidate text spans having the highest score; and displaying said identified candidate text span to the user as a prediction of the text span that they intended to select. | 0.542296 |
8,019,710 | 1 | 12 | 1. A system for guiding the progressive development and documentation of user thinking and knowledge about an inquiry based project according to exemplary approaches used by experts, comprising: An interface; A process manager system executable on at least one processor and operable to execute activities comprising: receiving user specification of an initial stage of understanding regarding an arbitrary problem or inquiry based project according to at least one of a plurality of entry or starting points; Providing at least one of an interactive workspace or a suggestion to a user, or both, to facilitate the further development of the understanding regarding an arbitrary problem or inquiry project towards a completion stage; Providing an integrated archetype based model of user understanding regarding the arbitrary problem or inquiry based project, in display or output or both. | 1. A system for guiding the progressive development and documentation of user thinking and knowledge about an inquiry based project according to exemplary approaches used by experts, comprising: An interface; A process manager system executable on at least one processor and operable to execute activities comprising: receiving user specification of an initial stage of understanding regarding an arbitrary problem or inquiry based project according to at least one of a plurality of entry or starting points; Providing at least one of an interactive workspace or a suggestion to a user, or both, to facilitate the further development of the understanding regarding an arbitrary problem or inquiry project towards a completion stage; Providing an integrated archetype based model of user understanding regarding the arbitrary problem or inquiry based project, in display or output or both. 12. The system of claim 1 further comprising that at least one workspace comprises at least a subset of related system capabilities and a representation of at least a subset of at least one user specification, stage of understanding, or model, or a combination thereof. | 0.853645 |
10,157,174 | 10 | 11 | 10. A computer program product for utilizing a dialectical model for providing an answer to a user query, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processing circuit to cause a device to perform a method comprising: receiving, by a system, a natural language query from a user; applying, by the system, natural language processing (NLP) to the query to generate a first set of NLP structures; generating, by the system, a contrary set of NLP structures which represent an opposite polarity query to the user query; evaluating, by the system, the first set of NLP structures to identify a first set of evidence for candidate answers; evaluating, by the system, the contrary set of NLP structures to identify a second set of evidence for candidate answers; evaluating, by the system, a first set of hypotheses from the first set of NLP structures based on the first set of evidence for candidate answers, and a contrary set of hypotheses from the contrary set of NLP structures based on the second set of evidence for candidate answers, to determine a set of answers to the user query; converting, by the system, the set of answers to natural language; and providing the converted set of answers to the user. | 10. A computer program product for utilizing a dialectical model for providing an answer to a user query, the computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processing circuit to cause a device to perform a method comprising: receiving, by a system, a natural language query from a user; applying, by the system, natural language processing (NLP) to the query to generate a first set of NLP structures; generating, by the system, a contrary set of NLP structures which represent an opposite polarity query to the user query; evaluating, by the system, the first set of NLP structures to identify a first set of evidence for candidate answers; evaluating, by the system, the contrary set of NLP structures to identify a second set of evidence for candidate answers; evaluating, by the system, a first set of hypotheses from the first set of NLP structures based on the first set of evidence for candidate answers, and a contrary set of hypotheses from the contrary set of NLP structures based on the second set of evidence for candidate answers, to determine a set of answers to the user query; converting, by the system, the set of answers to natural language; and providing the converted set of answers to the user. 11. The computer program product of claim 10 wherein the contrary set of NLP structures is generated by negating the first set of NLP structures. | 0.796919 |
9,639,579 | 1 | 5 | 1. A method comprising: receiving, by one or more processors, a search query; receiving, by the one or more processors, additional information; identifying, by the one or more processors, a plurality of repositories, where each repository includes a different type of data of a plurality of types of data; applying, by the one or more processors and based on the search query and the additional information, a model to each repository of the plurality of repositories; receiving, by the one or more processors, a score for each repository, wherein receiving the score for each repository is based on applying the model to each repository based on the search query and the additional information; searching, by the one or more processors and based on the score for each repository, at least one of the plurality of repositories, based on the search query; and providing, by the one or more processors, information from more than one of the plurality of repositories, providing the information comprising: providing first information from a first repository of the more than one of the plurality of repositories, the first information being associated with search results of a first type; and providing second information from a second repository of the more than one of the plurality of repositories, the second information being associated with a link to search results of a second type. | 1. A method comprising: receiving, by one or more processors, a search query; receiving, by the one or more processors, additional information; identifying, by the one or more processors, a plurality of repositories, where each repository includes a different type of data of a plurality of types of data; applying, by the one or more processors and based on the search query and the additional information, a model to each repository of the plurality of repositories; receiving, by the one or more processors, a score for each repository, wherein receiving the score for each repository is based on applying the model to each repository based on the search query and the additional information; searching, by the one or more processors and based on the score for each repository, at least one of the plurality of repositories, based on the search query; and providing, by the one or more processors, information from more than one of the plurality of repositories, providing the information comprising: providing first information from a first repository of the more than one of the plurality of repositories, the first information being associated with search results of a first type; and providing second information from a second repository of the more than one of the plurality of repositories, the second information being associated with a link to search results of a second type. 5. The method of claim 1 , further comprising: generating the model based on information associated with log data, the information associated with the log data being formed in triples. | 0.752022 |
8,370,319 | 15 | 18 | 15. A computer-implemented method, comprising: under the control of one or more computer systems configured with executable instructions, obtaining data associated with a search query, the data comprising: an indication of the number of times the users submitted the search query; and indications of search-result items and corresponding number of first-clicks, the search-result items being items presented to the users in response to the users submitting the search query, the number of first-clicks being the number of times the users selected the corresponding search-result item first in time before other items; and determining a first-click probability value for each of the search-result items based at least in part on a relationship between the number of first-clicks for the search-result item and a total number of first-clicks received across all of the search-result items; using the first-click probability values of the search-result items to create a distribution of first-clicks across the search result items, wherein the distribution is indicative of how the first-clicks are spread across the search-result items; determining a specificity score for the search query based at least in part on the distribution of first-clicks across the search result items; responsive to the users submitting the search query, tailoring search results presented to the users based at least in part on the specificity score, wherein the more evenly distributed the distribution of first-clicks, the lower the specificity score and the more likely the search query is submitted by users with the intention of general searching, and wherein the more skewed the distribution of first-clicks, the higher the specificity score and the more likely the search query is submitted by users with the intention of specific searching. | 15. A computer-implemented method, comprising: under the control of one or more computer systems configured with executable instructions, obtaining data associated with a search query, the data comprising: an indication of the number of times the users submitted the search query; and indications of search-result items and corresponding number of first-clicks, the search-result items being items presented to the users in response to the users submitting the search query, the number of first-clicks being the number of times the users selected the corresponding search-result item first in time before other items; and determining a first-click probability value for each of the search-result items based at least in part on a relationship between the number of first-clicks for the search-result item and a total number of first-clicks received across all of the search-result items; using the first-click probability values of the search-result items to create a distribution of first-clicks across the search result items, wherein the distribution is indicative of how the first-clicks are spread across the search-result items; determining a specificity score for the search query based at least in part on the distribution of first-clicks across the search result items; responsive to the users submitting the search query, tailoring search results presented to the users based at least in part on the specificity score, wherein the more evenly distributed the distribution of first-clicks, the lower the specificity score and the more likely the search query is submitted by users with the intention of general searching, and wherein the more skewed the distribution of first-clicks, the higher the specificity score and the more likely the search query is submitted by users with the intention of specific searching. 18. The computer-implemented method of claim 15 , wherein tailoring search results comprises: if the specificity score is above a threshold, directing users to a webpage associated with the search-result item that has the highest first-click probability value. | 0.601227 |
7,664,778 | 19 | 20 | 19. The method of claim 1 , further comprising: filtering the statements based on one or more user-specified criteria; and storing the filtered statements and the performance information for each filtered statement as a third persistent database object. | 19. The method of claim 1 , further comprising: filtering the statements based on one or more user-specified criteria; and storing the filtered statements and the performance information for each filtered statement as a third persistent database object. 20. The method of claim 19 , wherein the user-specified criteria comprise one selected from the group consisting of: a representative set of statements for a given application, all statements for a given application, and incremental capture. | 0.5 |
9,292,516 | 16 | 18 | 16. A method for use in playing back multimedia content, comprising: identifying a current geographic location parameter; identifying a current compass parameter; accessing a plurality of multimedia content having location parameter data; identifying a threshold distance; identifying a first multimedia content having a first location parameter and an orientation parameter; and playing back the first multimedia content when the current location parameter is geographically within the threshold distance of the first location parameter, and the current compass parameter matches the orientation parameter. | 16. A method for use in playing back multimedia content, comprising: identifying a current geographic location parameter; identifying a current compass parameter; accessing a plurality of multimedia content having location parameter data; identifying a threshold distance; identifying a first multimedia content having a first location parameter and an orientation parameter; and playing back the first multimedia content when the current location parameter is geographically within the threshold distance of the first location parameter, and the current compass parameter matches the orientation parameter. 18. The method of claim 16 , further comprising: determining a current date; extracting a first multimedia content date parameter; playing back the first multimedia content when the current data is within a date threshold of the first multimedia content date parameter. | 0.604412 |
9,684,644 | 15 | 17 | 15. A computer program product having a non-transitory computer readable storage medium and including computer executable code for managing annotations associated with a video, the code adapted to perform steps comprising: receiving from viewers of a video, a plurality of annotations for each of a plurality of intervals of the video, each interval having a start time and an end time, a content of each annotation of a plurality of the annotations including a plurality of words; forming a plurality of annotation groups by clustering the annotations based on the start times and the end times of the intervals; determining a first annotation group of the plurality of annotations groups having related annotations based at least in part on a comparison of the content of each annotation, the related annotations having at least one identical or similar word; forming a first annotated clip of the video based upon the intervals in the first annotation group; and forming a synoptic annotation for the first annotated clip of the video based on the related annotations in the first annotation group, the synoptic annotation comprising one or more words selected from the related annotations in the first annotation group, the one or more words summarizing the content of the related annotations in the first annotation group. | 15. A computer program product having a non-transitory computer readable storage medium and including computer executable code for managing annotations associated with a video, the code adapted to perform steps comprising: receiving from viewers of a video, a plurality of annotations for each of a plurality of intervals of the video, each interval having a start time and an end time, a content of each annotation of a plurality of the annotations including a plurality of words; forming a plurality of annotation groups by clustering the annotations based on the start times and the end times of the intervals; determining a first annotation group of the plurality of annotations groups having related annotations based at least in part on a comparison of the content of each annotation, the related annotations having at least one identical or similar word; forming a first annotated clip of the video based upon the intervals in the first annotation group; and forming a synoptic annotation for the first annotated clip of the video based on the related annotations in the first annotation group, the synoptic annotation comprising one or more words selected from the related annotations in the first annotation group, the one or more words summarizing the content of the related annotations in the first annotation group. 17. The computer program product of claim 15 , wherein forming the plurality of groups comprises: identifying a plurality of scenes in the video; and associating each group with one or more scenes. | 0.558296 |
8,898,159 | 1 | 7 | 1. A system for generating answers to questions, comprising: a computer device comprising at least one distinct software module, each distinct software module being embodied on a tangible computer-readable medium; a memory; and at least one processor coupled to the memory and operative for: receiving an input query; formulating a plurality of different subqueries to answer the input query, wherein each of the subqueries has an associated answer to the each subquery, and the answers to the subqueries are used to determine an answer to the input query; conducting a search in one or more data sources to identify at least one candidate answer to each of the subqueries; for each of the candidate answers for each of the subqueries, applying a candidate ranking function to determine a ranking for said each of the candidate answers; for each of the subqueries, selecting one of the candidate answers to the subquery based on the ranking of said one of the candidate answers; and applying a logical synthesis component to synthesize a candidate answer for the input query from the selected ones of the candidate answers to the subqueries. | 1. A system for generating answers to questions, comprising: a computer device comprising at least one distinct software module, each distinct software module being embodied on a tangible computer-readable medium; a memory; and at least one processor coupled to the memory and operative for: receiving an input query; formulating a plurality of different subqueries to answer the input query, wherein each of the subqueries has an associated answer to the each subquery, and the answers to the subqueries are used to determine an answer to the input query; conducting a search in one or more data sources to identify at least one candidate answer to each of the subqueries; for each of the candidate answers for each of the subqueries, applying a candidate ranking function to determine a ranking for said each of the candidate answers; for each of the subqueries, selecting one of the candidate answers to the subquery based on the ranking of said one of the candidate answers; and applying a logical synthesis component to synthesize a candidate answer for the input query from the selected ones of the candidate answers to the subqueries. 7. The system according to claim 1 , wherein the answers to the subqueries are numbers, and the candidate answer to the input query is determined by performing a mathematical operation on the numbers. | 0.625468 |
9,940,923 | 1 | 11 | 1. An apparatus for wireless communications, said apparatus comprising: a module configured to, when a mobile communications device has been set to a first mode in which said mobile communications device accepts text input instead of speech input, receive text that has been entered by a user of said mobile communications device and to convert the received text to a synthesized speech signal during a call in which a second communications device is configured to receive speech packets, wherein said mobile communications device is settable to a second mode in which said mobile communications device accepts speech input instead of text input; a vocoder configured to encode the synthesized speech signal to produce a plurality of corresponding speech packets; and a transceiver configured to transmit the plurality of corresponding speech packets over a wireless communications link to said second communications device, wherein said module includes a voice synthesizer configured to store characteristics of a voice of the user and to use said stored characteristics to produce the synthesized speech signal, wherein said apparatus is configured to transmit, via said transceiver, an audio notification informing said second communications device that speech from said mobile communications device following said audio notification will be converted from text, and wherein said apparatus is configured to transmit said audio notification prior to transmitting said plurality of corresponding speech packets. | 1. An apparatus for wireless communications, said apparatus comprising: a module configured to, when a mobile communications device has been set to a first mode in which said mobile communications device accepts text input instead of speech input, receive text that has been entered by a user of said mobile communications device and to convert the received text to a synthesized speech signal during a call in which a second communications device is configured to receive speech packets, wherein said mobile communications device is settable to a second mode in which said mobile communications device accepts speech input instead of text input; a vocoder configured to encode the synthesized speech signal to produce a plurality of corresponding speech packets; and a transceiver configured to transmit the plurality of corresponding speech packets over a wireless communications link to said second communications device, wherein said module includes a voice synthesizer configured to store characteristics of a voice of the user and to use said stored characteristics to produce the synthesized speech signal, wherein said apparatus is configured to transmit, via said transceiver, an audio notification informing said second communications device that speech from said mobile communications device following said audio notification will be converted from text, and wherein said apparatus is configured to transmit said audio notification prior to transmitting said plurality of corresponding speech packets. 11. The apparatus according to claim 1 , wherein said apparatus is arranged to receive said text via said transceiver. | 0.787004 |
7,921,296 | 7 | 9 | 7. A method to identify subject content, the method comprising: receiving a hash value associated with an information signal, the hash value comprising one or more reliable hash bits and one or more unreliable hash bits; interrogating a look up table with the one or more reliable bits to determine one or more matching stored hash values; for each of the one or more matching stored hash values, calculating, by a computer, a bit error rate, the bit error rate representing a relationship between the one or more bits of the hash value and the corresponding bits of a matching stored hash value from the one or more matching stored hash values; selecting a matching stored hash value from the one or more matching stored hash values, for which the bit error rate is minimal; and identifying the matching stored hash value, for which the bit error rate is minimal, as the matching stored hash value associated with the subject content. | 7. A method to identify subject content, the method comprising: receiving a hash value associated with an information signal, the hash value comprising one or more reliable hash bits and one or more unreliable hash bits; interrogating a look up table with the one or more reliable bits to determine one or more matching stored hash values; for each of the one or more matching stored hash values, calculating, by a computer, a bit error rate, the bit error rate representing a relationship between the one or more bits of the hash value and the corresponding bits of a matching stored hash value from the one or more matching stored hash values; selecting a matching stored hash value from the one or more matching stored hash values, for which the bit error rate is minimal; and identifying the matching stored hash value, for which the bit error rate is minimal, as the matching stored hash value associated with the subject content. 9. The method of claim 7 , wherein the subject content is video content. | 0.5 |
9,448,652 | 1 | 3 | 1. A method for controlling an application based on a handwriting input, the method comprising: displaying a first screen on a touch screen display of a terminal; receiving a message associated with an application, the message being received while displaying the first screen; displaying a notification indicating the message receipt on the touch screen display while displaying a portion of the first screen; if the notification is displayed on the touch screen display, activating a handwriting recognition module to recognize a handwriting input to be associated with the application; recognizing the handwriting input received on the touch screen display of the terminal; determining a symbol corresponding to the handwriting input; selecting the application capable of being associated with the symbol; associating the symbol with a function of the application; and processing the associated symbol through the application executed in a background state. | 1. A method for controlling an application based on a handwriting input, the method comprising: displaying a first screen on a touch screen display of a terminal; receiving a message associated with an application, the message being received while displaying the first screen; displaying a notification indicating the message receipt on the touch screen display while displaying a portion of the first screen; if the notification is displayed on the touch screen display, activating a handwriting recognition module to recognize a handwriting input to be associated with the application; recognizing the handwriting input received on the touch screen display of the terminal; determining a symbol corresponding to the handwriting input; selecting the application capable of being associated with the symbol; associating the symbol with a function of the application; and processing the associated symbol through the application executed in a background state. 3. The method of claim 1 , further comprising: determining a registered function associated with the application based on registration information of the application, the registered function configured to be activated using the symbol; and selecting the function of the application from the registered function. | 0.639211 |
9,684,641 | 10 | 12 | 10. The method as recited in claim 6 , wherein presenting the portion of the first version and presenting the portion of the second version further comprises presenting the portion of the second version on a display adjacent to the portion of the first version. | 10. The method as recited in claim 6 , wherein presenting the portion of the first version and presenting the portion of the second version further comprises presenting the portion of the second version on a display adjacent to the portion of the first version. 12. The method as recited in claim 10 , wherein presenting the portion of the second version on the display adjacent to the portion of the first version further comprises presenting a single instance of an image included in the first version and the second version. | 0.744208 |
8,924,198 | 10 | 12 | 10. A non-transitory computer readable medium configured to store instructions for searching a datastore of data objects, the instructions when executed by at least one processor cause the at least one processor to perform steps comprising: receiving a search query; identifying, from the datastore of data objects, a first data object that matches the search query; and generating a first sentence that includes a subject, verb and object, the object of the first sentence representing the first data object, the subject of the first sentence representing a second data object from the datastore that is related to the first data object; generating a second sentence that includes a subject, verb and object, the object of the second sentence representing the second data object, the subject of the second sentence representing a third data object from the datastore that is related to the second data object; outputting information corresponding to a user interface based on the first sentence and the second sentence, the first sentence and the second sentence organized in the user interface as a hierarchy of sentences that includes a plurality of levels, wherein the first sentence is in a subordinate level of the hierarchy and the second sentence is in a superior level of the hierarchy. | 10. A non-transitory computer readable medium configured to store instructions for searching a datastore of data objects, the instructions when executed by at least one processor cause the at least one processor to perform steps comprising: receiving a search query; identifying, from the datastore of data objects, a first data object that matches the search query; and generating a first sentence that includes a subject, verb and object, the object of the first sentence representing the first data object, the subject of the first sentence representing a second data object from the datastore that is related to the first data object; generating a second sentence that includes a subject, verb and object, the object of the second sentence representing the second data object, the subject of the second sentence representing a third data object from the datastore that is related to the second data object; outputting information corresponding to a user interface based on the first sentence and the second sentence, the first sentence and the second sentence organized in the user interface as a hierarchy of sentences that includes a plurality of levels, wherein the first sentence is in a subordinate level of the hierarchy and the second sentence is in a superior level of the hierarchy. 12. The computer readable medium of claim 10 , wherein generating the second sentence comprises generating the second sentence to include a verb that indicates a relationship between the second and third data objects. | 0.530303 |
7,664,638 | 6 | 9 | 6. The method of claim 1 , further comprising the act of: determining at least one task name from the text of the at least two voice commands. | 6. The method of claim 1 , further comprising the act of: determining at least one task name from the text of the at least two voice commands. 9. The method of claim 6 , wherein the at least one task name comprises two task names, a first task name associated with a first of the voice commands and a second task name associated with a second of the voice commands, wherein the first and second voice commands occur adjacent to each other in time, wherein the first and second task name are different, and wherein the second voice command is assumed to end a first task corresponding to the first task name and start a second task corresponding to the second task name. | 0.689858 |
8,706,742 | 4 | 15 | 4. The system according to claim 3 wherein said document discriminator comprises a metadata-based relevant-irrelevant document discriminator characterized in that said at least one metadata value correlates with relevance of said electronic documents to the issue. | 4. The system according to claim 3 wherein said document discriminator comprises a metadata-based relevant-irrelevant document discriminator characterized in that said at least one metadata value correlates with relevance of said electronic documents to the issue. 15. The system according to claim 4 wherein said relevance rater comprises an electronic document analyzer receiving N electronic documents pertaining to a case encompassing a set of issues including at least one issue and establishing relevance of at least the N documents to at least one individual issue in the set of issues, the analyzer comprising: binary relevance determining apparatus for generating binary relevance data characterizing relevance of said documents to at least one issue in said set of issues, said binary relevance data being generated by applying a cut-off point to multi-value relevance data; and cut-off point selection cost effectiveness analysis apparatus for estimating the relative cost effectiveness of a multiplicity of possible cut-off points. | 0.630579 |
8,538,704 | 1 | 12 | 1. A method, implemented by a computing device, in a healthcare information technology system for providing inferred genetic findings for a person, the method comprising: receiving a request issued by a user for genetic test results for a subject gene for a person; incident to receiving the request, accessing a first data store to discover whether there exists the genetic test results for the person; and when the genetic test results of the person are undiscovered, automatically inferring, at the computing device, one or more genetic findings, wherein the process of inferring comprises: (a) accessing an inference table that associates genes with a plurality of modes of inheritance; (b) identifying a mode of inheritance associated with the subject gene by querying the inference table with the subject gene; (c) determining a traversal pattern of the subject gene within a family of the person as a function of the identified mode of inheritance; (d) employing the traversal pattern to target at least one member of the family of the person that potentially carries the subject gene; (e) accessing a second data store to discover whether there exists genetic test results for the at least one targeted member of the person's family; and (f) when the genetic test results of the at least one targeted member of the person's family are discovered, calculating a probability that the person exhibits a mutated form of the subject gene using the genetic test results of the at least one targeted member of the person's family. | 1. A method, implemented by a computing device, in a healthcare information technology system for providing inferred genetic findings for a person, the method comprising: receiving a request issued by a user for genetic test results for a subject gene for a person; incident to receiving the request, accessing a first data store to discover whether there exists the genetic test results for the person; and when the genetic test results of the person are undiscovered, automatically inferring, at the computing device, one or more genetic findings, wherein the process of inferring comprises: (a) accessing an inference table that associates genes with a plurality of modes of inheritance; (b) identifying a mode of inheritance associated with the subject gene by querying the inference table with the subject gene; (c) determining a traversal pattern of the subject gene within a family of the person as a function of the identified mode of inheritance; (d) employing the traversal pattern to target at least one member of the family of the person that potentially carries the subject gene; (e) accessing a second data store to discover whether there exists genetic test results for the at least one targeted member of the person's family; and (f) when the genetic test results of the at least one targeted member of the person's family are discovered, calculating a probability that the person exhibits a mutated form of the subject gene using the genetic test results of the at least one targeted member of the person's family. 12. The method of claim 1 , further comprising communicating to the user the calculated probability that the person exhibits a mutated form of the subject gene. | 0.839357 |
9,665,559 | 14 | 15 | 14. A method of checking a plurality of electronic text document files containing descriptions of products and/or services on a computing system comprising: defining a plurality of separate target audiences for the electronic text document files using the computing system; wherein said plurality of separate target audiences are associated with a plurality of separate sets of associated filter words; receiving a plurality of electronic text document files designated to be communicated to said plurality of separate target audiences including a plurality of identified intended recipients; wherein at least two of said plurality of intended recipients are from different ones of said plurality of separate target audiences; providing a plurality of separate electronic filters, each one of said plurality of electronic filters containing a set of filter words which are designated as offensive and/or inappropriate for communication with a corresponding designated target audience for a corresponding product and/or service; wherein said plurality of separate electronic filters are associated with said plurality of separate target audiences and a plurality of products and/or services; checking said plurality of electronic document files for inappropriate content concerning each of the plurality of products and/or services with the computing system as needed based on a corresponding electronic filter prior to initially distributing said plurality of electronic text document files to any designated identified intended recipients; wherein said plurality of electronic filters can be invoked selectively and on a document by document basis and such that a first content in a first electronic text document file is processed only with a first electronic filter, and a second content in a second electronic text document file is processed only with a second electronic filter; presenting selected ones of said electronic text documents concerning a product and/or service to a member of a designated target audience as an identified intended recipient based on checking said plurality of electronic filters. | 14. A method of checking a plurality of electronic text document files containing descriptions of products and/or services on a computing system comprising: defining a plurality of separate target audiences for the electronic text document files using the computing system; wherein said plurality of separate target audiences are associated with a plurality of separate sets of associated filter words; receiving a plurality of electronic text document files designated to be communicated to said plurality of separate target audiences including a plurality of identified intended recipients; wherein at least two of said plurality of intended recipients are from different ones of said plurality of separate target audiences; providing a plurality of separate electronic filters, each one of said plurality of electronic filters containing a set of filter words which are designated as offensive and/or inappropriate for communication with a corresponding designated target audience for a corresponding product and/or service; wherein said plurality of separate electronic filters are associated with said plurality of separate target audiences and a plurality of products and/or services; checking said plurality of electronic document files for inappropriate content concerning each of the plurality of products and/or services with the computing system as needed based on a corresponding electronic filter prior to initially distributing said plurality of electronic text document files to any designated identified intended recipients; wherein said plurality of electronic filters can be invoked selectively and on a document by document basis and such that a first content in a first electronic text document file is processed only with a first electronic filter, and a second content in a second electronic text document file is processed only with a second electronic filter; presenting selected ones of said electronic text documents concerning a product and/or service to a member of a designated target audience as an identified intended recipient based on checking said plurality of electronic filters. 15. The method of claim 14 wherein said plurality of electronic text document files are processed as a batch of files. | 0.662857 |
9,659,109 | 14 | 17 | 14. A system for providing predictive search query recommendations for a search query, the system comprising: one or more processing modules; and one or more non-transitory memory storage modules storing computing instructions configured to run on the one or more processing modules and perform: receiving the search query from a user; determining the predictive search query recommendations for the search query using a tree data structure, wherein at least one top layer of the tree data structure comprise at least one trie query node, and wherein bottom layers of the tree data structure comprise ternary tree query nodes; and sending the predictive search query recommendations to the user, wherein: the at least one top layer of the tree data structure having the at least one trie query node are at least three layers at a top of the tree data structure; the tree data structure comprises query nodes and solution nodes; the query nodes comprise the at least one trie query node and the ternary tree query nodes; each of the solution nodes is a leaf node of the tree data structure, is a child of a ternary tree query node within the ternary tree query nodes, and comprises a predictive query solution and a score; each of the ternary tree query nodes comprises a subtree score that is equal to a highest score of any of the solution nodes in a subtree that is rooted at the ternary tree query node; and determining the predictive search query recommendations comprises: determining an ending-character query node from among the query nodes based on the search query; and if the ending-character query node is one of the ternary tree query nodes: determining a subset of the solution nodes having scores that are in a group of highest scores in any of the solution nodes that are in an ending-character subtree that is rooted at the ending-character query node; and using the predictive query solutions of the solution nodes in the subset of the solution nodes as the predictive search query recommendations. | 14. A system for providing predictive search query recommendations for a search query, the system comprising: one or more processing modules; and one or more non-transitory memory storage modules storing computing instructions configured to run on the one or more processing modules and perform: receiving the search query from a user; determining the predictive search query recommendations for the search query using a tree data structure, wherein at least one top layer of the tree data structure comprise at least one trie query node, and wherein bottom layers of the tree data structure comprise ternary tree query nodes; and sending the predictive search query recommendations to the user, wherein: the at least one top layer of the tree data structure having the at least one trie query node are at least three layers at a top of the tree data structure; the tree data structure comprises query nodes and solution nodes; the query nodes comprise the at least one trie query node and the ternary tree query nodes; each of the solution nodes is a leaf node of the tree data structure, is a child of a ternary tree query node within the ternary tree query nodes, and comprises a predictive query solution and a score; each of the ternary tree query nodes comprises a subtree score that is equal to a highest score of any of the solution nodes in a subtree that is rooted at the ternary tree query node; and determining the predictive search query recommendations comprises: determining an ending-character query node from among the query nodes based on the search query; and if the ending-character query node is one of the ternary tree query nodes: determining a subset of the solution nodes having scores that are in a group of highest scores in any of the solution nodes that are in an ending-character subtree that is rooted at the ending-character query node; and using the predictive query solutions of the solution nodes in the subset of the solution nodes as the predictive search query recommendations. 17. The system of claim 14 , wherein the computing instructions are further configured such that: determining the subset of the solution nodes comprises: determining a highest solution node from among the solution nodes in the ending-character subtree, wherein the score of the highest solution node is higher than any other of the scores of the solution nodes in the ending-character subtree. | 0.630639 |
10,147,122 | 8 | 10 | 8. The method of claim 1 , wherein the specific product is included in a category of products. | 8. The method of claim 1 , wherein the specific product is included in a category of products. 10. The method of claim 8 , further comprising receiving, by the first computer system and from the second computer system, a signal, the signal having information that identifies the products included in the category. | 0.7833 |
9,514,130 | 12 | 19 | 12. The non-transitory computer-readable medium of claim 11 , further comprising instructions that cause the processor to: receive a second speech input from a second speaker; determine, by the speech translation system, a second recognized speech result based on the second speech input; extract information from the second recognized speech input from the second speaker; enter the extracted information into an electronic form; and display the electronic form. | 12. The non-transitory computer-readable medium of claim 11 , further comprising instructions that cause the processor to: receive a second speech input from a second speaker; determine, by the speech translation system, a second recognized speech result based on the second speech input; extract information from the second recognized speech input from the second speaker; enter the extracted information into an electronic form; and display the electronic form. 19. The non-transitory computer-readable medium of claim 12 , further comprising instructions that cause the processor to: solicit feedback from at least one of the first speaker and the second speaker prior to entering the extracted information into the electronic form. | 0.834352 |
8,600,736 | 5 | 6 | 5. A method according to claim 1 , wherein in a first comparison in the step of comparing a value, the value corresponds to one of: a literal meaning, a grammatical use and an attribute, and wherein in a second comparison in the step of comparing a value, the value is either of the two remaining values. | 5. A method according to claim 1 , wherein in a first comparison in the step of comparing a value, the value corresponds to one of: a literal meaning, a grammatical use and an attribute, and wherein in a second comparison in the step of comparing a value, the value is either of the two remaining values. 6. A method according to claim 5 , wherein in a third comparison in the step of comparing a value, the value is the remaining value. | 0.5 |
8,700,383 | 1 | 2 | 1. A computer system for sampling a translation to determine an overall quality thereof, the computer system comprising a processor and memory, wherein: the memory stores a source document corresponding to a first language, a target document comprising a translation of the source document in a second language, distinct from the first language, and executables comprising a metric module, an error reporting module, and an output module; the computer system is programmed to, by executing the metric module, identify a sample comprising substantially less than an entirety of the translation, a source portion selected from the source document, and a corresponding target portion selected from the target document; the computer system is programmed to, by executing the error reporting module, present to a human reviewer a list of preset error categories when the sample is being evaluated by the human reviewer; and the computer system is programmed to, by executing the output module, generalize error data associated with the sample into an overall quality characterization of the entirety of the translation. | 1. A computer system for sampling a translation to determine an overall quality thereof, the computer system comprising a processor and memory, wherein: the memory stores a source document corresponding to a first language, a target document comprising a translation of the source document in a second language, distinct from the first language, and executables comprising a metric module, an error reporting module, and an output module; the computer system is programmed to, by executing the metric module, identify a sample comprising substantially less than an entirety of the translation, a source portion selected from the source document, and a corresponding target portion selected from the target document; the computer system is programmed to, by executing the error reporting module, present to a human reviewer a list of preset error categories when the sample is being evaluated by the human reviewer; and the computer system is programmed to, by executing the output module, generalize error data associated with the sample into an overall quality characterization of the entirety of the translation. 2. The system of claim 1 , wherein a number of words contained within one of the source portion and target portion is determined by the computer system executing the metric module. | 0.60177 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.