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
9,652,799
13
15
13. Apparatus comprising: at least one processor; and at least one storage medium storing processor-executable instructions that, when executed by the at least one processor, perform a method comprising: receiving, from a user, a text input expressing a question asking for recommendation of a product having a requested characteristic; generating, in response to the question, an answer that identifies a product having the requested characteristic for recommendation to the user; analyzing, using natural language analysis, a plurality of product reviews comprising natural language text evaluations of the product, including analyzing the natural language in at least one passage of text in at least one product review of the plurality of product reviews to determine whether the natural language in the at least one passage of text has a meaning indicating that the product has the requested characteristic, at least in part by converting the question to one or more hypotheses and determining whether the natural language in the at least one passage of text has a meaning that entails at least one of the one or more hypotheses; in response to determining via the natural language analysis that the natural language in the at least one passage of text has a meaning indicating that the product has the requested characteristic, identifying the at least one passage of text in the at least one product review as providing supporting evidence for the product in answer to the question; and presenting to the user, in response to the text input, the answer and the at least one passage in the at least one product review identified as providing supporting evidence for the answer.
13. Apparatus comprising: at least one processor; and at least one storage medium storing processor-executable instructions that, when executed by the at least one processor, perform a method comprising: receiving, from a user, a text input expressing a question asking for recommendation of a product having a requested characteristic; generating, in response to the question, an answer that identifies a product having the requested characteristic for recommendation to the user; analyzing, using natural language analysis, a plurality of product reviews comprising natural language text evaluations of the product, including analyzing the natural language in at least one passage of text in at least one product review of the plurality of product reviews to determine whether the natural language in the at least one passage of text has a meaning indicating that the product has the requested characteristic, at least in part by converting the question to one or more hypotheses and determining whether the natural language in the at least one passage of text has a meaning that entails at least one of the one or more hypotheses; in response to determining via the natural language analysis that the natural language in the at least one passage of text has a meaning indicating that the product has the requested characteristic, identifying the at least one passage of text in the at least one product review as providing supporting evidence for the product in answer to the question; and presenting to the user, in response to the text input, the answer and the at least one passage in the at least one product review identified as providing supporting evidence for the answer. 15. The apparatus of claim 13 , wherein the at least one product review comprises an evaluation of the product made based on use of the product by an author of the at least one product review.
0.775701
9,910,931
4
5
4. The method of claim 3 , further comprising: receiving a third free text entry on the user interface; and ascertaining whether the third free text entry fulfills criteria for a value.
4. The method of claim 3 , further comprising: receiving a third free text entry on the user interface; and ascertaining whether the third free text entry fulfills criteria for a value. 5. The method of claim 4 , wherein the navigation key entry is received before the ascertaining step.
0.5
7,979,267
1
6
1. A method for specifying a subset of data, comprising: receiving a first input at a user interface of a computing device for a first field of a natural language expression, the first input indicates a first data value for the first field; accessing options for a second field of the natural language expression that are determined based on the first data value and data stored in data group; displaying the second field and the options for the second field; receiving a second input at the user interface for the second field of the natural language expression, the second input indicates a second data value for the second field from the options for the second field; accessing options for a third field of the natural language expression that are determined based on the second data value and data stored in the data group; displaying the third field and the options for the third field; receiving a third input at the user interface for the third field of the natural language expression, the third input indicates a third data value for the third field, the second data value indicates a relationship between the first data value and the third data value that exists in the data group, a result of receiving the third input is an updated version of the natural language expression that includes the first data value, the second data value and the third data value as natural language; and accessing and reporting a subset of the data group that corresponds to the natural language expression that includes the first data value, the second data value and the third data value as natural language.
1. A method for specifying a subset of data, comprising: receiving a first input at a user interface of a computing device for a first field of a natural language expression, the first input indicates a first data value for the first field; accessing options for a second field of the natural language expression that are determined based on the first data value and data stored in data group; displaying the second field and the options for the second field; receiving a second input at the user interface for the second field of the natural language expression, the second input indicates a second data value for the second field from the options for the second field; accessing options for a third field of the natural language expression that are determined based on the second data value and data stored in the data group; displaying the third field and the options for the third field; receiving a third input at the user interface for the third field of the natural language expression, the third input indicates a third data value for the third field, the second data value indicates a relationship between the first data value and the third data value that exists in the data group, a result of receiving the third input is an updated version of the natural language expression that includes the first data value, the second data value and the third data value as natural language; and accessing and reporting a subset of the data group that corresponds to the natural language expression that includes the first data value, the second data value and the third data value as natural language. 6. The method of claim 1 , wherein: the receiving the second input at the user interface for the second field of the natural language expression includes receiving a choice from a menu of the options for the second field.
0.798358
8,290,822
30
35
30. A computer-implemented method for efficiently displaying selectable attribute values for a product based on a provided criterion, comprising: storing in at least one memory storage device: a set of product records that identify products potentially selectable by a user, wherein the product records comprise product attributes that represent one or more features of the product, wherein the product attributes comprise one or more attribute values; and one or more product configuration rules used to define permissible or impermissible product configurations and attributes of the products; analyzing with at least one processor at least one product configuration rule to determine whether at least one product attribute of at least one product record is used in evaluating the at least one product configuration rule; creating with the at least one processor an attribute binary decision diagram (BDD) structure representative of the at least one product attribute of the least one product record when the at least one processor determines that the at least one product attribute is used in evaluating the at least one product configuration rule; evaluating with the at least one processor the attribute BDD structure; and preparing with the at least one processor a customized set of product records for transmission to the user, wherein the customized set of product records contains product attribute values selectable by the user.
30. A computer-implemented method for efficiently displaying selectable attribute values for a product based on a provided criterion, comprising: storing in at least one memory storage device: a set of product records that identify products potentially selectable by a user, wherein the product records comprise product attributes that represent one or more features of the product, wherein the product attributes comprise one or more attribute values; and one or more product configuration rules used to define permissible or impermissible product configurations and attributes of the products; analyzing with at least one processor at least one product configuration rule to determine whether at least one product attribute of at least one product record is used in evaluating the at least one product configuration rule; creating with the at least one processor an attribute binary decision diagram (BDD) structure representative of the at least one product attribute of the least one product record when the at least one processor determines that the at least one product attribute is used in evaluating the at least one product configuration rule; evaluating with the at least one processor the attribute BDD structure; and preparing with the at least one processor a customized set of product records for transmission to the user, wherein the customized set of product records contains product attribute values selectable by the user. 35. The computer-implemented method of claim 30 , wherein at least one product record of the set of products records is structured according to a meta-language syntax, wherein the meta-language syntax comprises at least one element of data content and at least one element identifier that describes the type of content of the at least one element of data content.
0.841761
8,504,365
6
9
6. A system comprising: a processor; a computer-readable storage medium having instructions stored for controlling the processor to perform operations comprising: receiving a plurality of stored speech samples of a same word for verifying a user; comparing each of the plurality of stored speech samples to each other, to yield a variance over time; receiving speech from the user, distinct from the plurality of stored speech samples, to be verified; receiving a parameter that identifies a certainty level associated with the variance, from a plurality of certainty levels, to be applied when verifying the speech as authentic; based on the certainty level, verifying the speech as authentic, to yield a verification; and transmitting access data based on the verification.
6. A system comprising: a processor; a computer-readable storage medium having instructions stored for controlling the processor to perform operations comprising: receiving a plurality of stored speech samples of a same word for verifying a user; comparing each of the plurality of stored speech samples to each other, to yield a variance over time; receiving speech from the user, distinct from the plurality of stored speech samples, to be verified; receiving a parameter that identifies a certainty level associated with the variance, from a plurality of certainty levels, to be applied when verifying the speech as authentic; based on the certainty level, verifying the speech as authentic, to yield a verification; and transmitting access data based on the verification. 9. The system of claim 6 , wherein each certainty level of the plurality of certainty levels is associated with a different task.
0.545775
7,610,192
1
10
1. A computer implemented method for assigning codes from a standard lexicon to a free text document describing physical or tangible objects, the method comprising the steps of: (a) automatically segmenting said free text document into a plurality of sentences; (b) using a computer processor to retrieve a plurality of propositions by matching said sentences in a semantic mapping table created by domain experts through semantically annotating sentences from a corpus of related documents in a knowledge domain to propositions, (c) using a computer processor to retrieve a plurality of codes in a standard lexicon by matching said propositions to said codes created by a third party, in a code mapping table created by domain experts by annotating said propositions to said codes; wherein one or more of said matching codes from said standard lexicon represents at least a portion of the semantic content of said free text document.
1. A computer implemented method for assigning codes from a standard lexicon to a free text document describing physical or tangible objects, the method comprising the steps of: (a) automatically segmenting said free text document into a plurality of sentences; (b) using a computer processor to retrieve a plurality of propositions by matching said sentences in a semantic mapping table created by domain experts through semantically annotating sentences from a corpus of related documents in a knowledge domain to propositions, (c) using a computer processor to retrieve a plurality of codes in a standard lexicon by matching said propositions to said codes created by a third party, in a code mapping table created by domain experts by annotating said propositions to said codes; wherein one or more of said matching codes from said standard lexicon represents at least a portion of the semantic content of said free text document. 10. The method according to claim 1 , wherein sentences with a match quality other than ‘good’ as determined by a domain expert are displayed.
0.661905
9,146,912
24
26
24. A method of performing XBRL extension taxonomy concept replacement comprising: analyzing, by a computer processor, an XBRL document having XBRL tags to identify an XBRL extension taxonomy concept of an XBRL extension taxonomy that is superfluous compared to an XBRL base taxonomy concept of an XBRL base taxonomy based on a figure of merit; and replacing, by a computer processor, the identified XBRL extension taxonomy concept in the XBRL document with the compared XBRL base taxonomy concept, wherein the figure of merit indicates a degree of similarity among at least three degrees of similarity along a continuum from a low degree to a high degree of similarity between the identified XBRL extension taxonomy concept and the compared XBRL base taxonomy concept.
24. A method of performing XBRL extension taxonomy concept replacement comprising: analyzing, by a computer processor, an XBRL document having XBRL tags to identify an XBRL extension taxonomy concept of an XBRL extension taxonomy that is superfluous compared to an XBRL base taxonomy concept of an XBRL base taxonomy based on a figure of merit; and replacing, by a computer processor, the identified XBRL extension taxonomy concept in the XBRL document with the compared XBRL base taxonomy concept, wherein the figure of merit indicates a degree of similarity among at least three degrees of similarity along a continuum from a low degree to a high degree of similarity between the identified XBRL extension taxonomy concept and the compared XBRL base taxonomy concept. 26. The method of claim 24 , wherein the figure of merit includes a similarity of a name of the identified XBRL extension taxonomy concept and a corresponding name of the compared XBRL base taxonomy concept based at least in part on whether a word included in the name of the identified XBRL extension taxonomy concept is an antonym of a corresponding word included in the corresponding name of the compared XBRL base taxonomy concept and whether a balance type of the identified XBRL extension taxonomy concept is opposite of a balance type of the compared XBRL base taxonomy concept.
0.5
7,613,997
1
5
1. A computing system that has access to a hierarchically-structured document having a plurality of elements that may each be associated with one or more namespaces, the computing system comprising: one or more computer-readable storage media having computer-executable instruction for implementing a method for establishing a plurality of abbreviated namespace identifiers for a hierarchically-structured document, wherein the method comprises: an act of associating each of a plurality of associated abbreviated namespace identifiers with a hierarchical namespace; an act of accessing a hierarchically-structured document; an act of determining that at least one group identifier is associated with the hierarchically-structured document, the group identifier representing that when any of the abbreviated namespace identifiers are found associated with an element in the hierarchically-structured document, that the associated namespace is also associated with that element; and at least one of: an act of associating each of the plurality of associated abbreviated namespace identifiers with the hierarchical namespace before the act of accessing the hierarchically-structured document, and an act of reading a pre-processor directive that indicates that the at least one group identifier is associated with the hierarchically-structured document.
1. A computing system that has access to a hierarchically-structured document having a plurality of elements that may each be associated with one or more namespaces, the computing system comprising: one or more computer-readable storage media having computer-executable instruction for implementing a method for establishing a plurality of abbreviated namespace identifiers for a hierarchically-structured document, wherein the method comprises: an act of associating each of a plurality of associated abbreviated namespace identifiers with a hierarchical namespace; an act of accessing a hierarchically-structured document; an act of determining that at least one group identifier is associated with the hierarchically-structured document, the group identifier representing that when any of the abbreviated namespace identifiers are found associated with an element in the hierarchically-structured document, that the associated namespace is also associated with that element; and at least one of: an act of associating each of the plurality of associated abbreviated namespace identifiers with the hierarchical namespace before the act of accessing the hierarchically-structured document, and an act of reading a pre-processor directive that indicates that the at least one group identifier is associated with the hierarchically-structured document. 5. A computing system in accordance with claim 1 , wherein the act of determining that at least one group identifier is associated with the hierarchically-structured document comprises the following: an act of reading a pre-processor directive that indicates that the at least one group identifier is associated with the hierarchically-structured document.
0.540052
7,668,868
10
12
10. The storage device of claim 7 , wherein: the manifest includes one or more interactive controls, the interactive controls being selectable by a user to perform one or more actions defined by behavior specified for the corresponding embedded files.
10. The storage device of claim 7 , wherein: the manifest includes one or more interactive controls, the interactive controls being selectable by a user to perform one or more actions defined by behavior specified for the corresponding embedded files. 12. The storage device of claim 10 , wherein: one or more of the interactive controls include representations of one or more of the embedded files.
0.584746
8,612,939
11
12
11. A non-transitory computer readable medium having a set of computer-executable instructions stored thereon for implementing a system for tracing an execution of multiple software products, the system comprising: a collecting tool for collecting and internally listing in a list a plurality of trace files arising from executing multiple software; determining means for splitting the plurality of trace files in the list into a plurality of groups having different trace file formats, said determining means, for each one of the plurality of groups, selecting in dependence on the trace file format of the one of the plurality of groups, an associated parser; said associated parser being configured to read the trace files of the one of the plurality of groups and extract trace data of the trace files; a translation device for translating the extracted trace data into a new dataset; and a Graphical User Interface configured to show at least a subset of said new dataset.
11. A non-transitory computer readable medium having a set of computer-executable instructions stored thereon for implementing a system for tracing an execution of multiple software products, the system comprising: a collecting tool for collecting and internally listing in a list a plurality of trace files arising from executing multiple software; determining means for splitting the plurality of trace files in the list into a plurality of groups having different trace file formats, said determining means, for each one of the plurality of groups, selecting in dependence on the trace file format of the one of the plurality of groups, an associated parser; said associated parser being configured to read the trace files of the one of the plurality of groups and extract trace data of the trace files; a translation device for translating the extracted trace data into a new dataset; and a Graphical User Interface configured to show at least a subset of said new dataset. 12. The non-transitory computer readable medium according to claim 11 , wherein said collecting tool comprises a prefixed logic designed for selecting specific trace files.
0.705479
8,666,992
1
10
1. A method of querying a remote service without revealing a private document to the remote service, comprising: at a main computer, receiving from a client a signature generated from a user's private document, without receiving the document; querying an intermediate database with the signature of the private document to generate an intermediate result set comprising intermediate database documents, based on a computation of similarity of the signatures of the intermediate database documents to the signature of the private document; computing a relevance factor for each document of the intermediate result set; computing a reconstruction error based on the relevance factors of all the documents in the intermediate result set and determining a confidence in the intermediate result set based on the reconstruction error; querying the remote service with a query which is based on the intermediate result set, whereby the user's private document and the signature of the private document are not revealed to the remote service; receiving a final result set from the remote service based on the query; and weighting the final result set based on the relevance factors.
1. A method of querying a remote service without revealing a private document to the remote service, comprising: at a main computer, receiving from a client a signature generated from a user's private document, without receiving the document; querying an intermediate database with the signature of the private document to generate an intermediate result set comprising intermediate database documents, based on a computation of similarity of the signatures of the intermediate database documents to the signature of the private document; computing a relevance factor for each document of the intermediate result set; computing a reconstruction error based on the relevance factors of all the documents in the intermediate result set and determining a confidence in the intermediate result set based on the reconstruction error; querying the remote service with a query which is based on the intermediate result set, whereby the user's private document and the signature of the private document are not revealed to the remote service; receiving a final result set from the remote service based on the query; and weighting the final result set based on the relevance factors. 10. The method of claim 1 , further comprising the client computing the private document signature.
0.888764
9,880,815
1
5
1. A structured query language (SQL) Visualizer, comprising: a processor of a computer system, wherein the processor is arranged to cause the computer system to transform a textual SQL statement into a graphical diagram which represents said textual SQL statement; said SQL Visualizer being arranged: a) to cause the computer system to transform a textual SQL procedure into a graphical diagram which represents said textual SQL procedure such that the structure of the SQL procedure is visually represented in said graphical diagram; and b) to transform a textual data manipulation language (DML) statement into a graphical diagram which represents the logic of said textual DML statement; wherein said textual DML statement includes an insert, update or delete, statement; wherein said graphical diagram which represents the logic of said textual DML statement includes at least an insert, update or delete icon; and wherein the SQL Visualizer further comprises a user interface, wherein said user interface comprises a dictionary selection control which allows a user to select a database used in said textual SQL statement, and to thereby provide a definition for said database for use in transforming said textual SQL statement into said graphical diagram which represents said textual SQL statement.
1. A structured query language (SQL) Visualizer, comprising: a processor of a computer system, wherein the processor is arranged to cause the computer system to transform a textual SQL statement into a graphical diagram which represents said textual SQL statement; said SQL Visualizer being arranged: a) to cause the computer system to transform a textual SQL procedure into a graphical diagram which represents said textual SQL procedure such that the structure of the SQL procedure is visually represented in said graphical diagram; and b) to transform a textual data manipulation language (DML) statement into a graphical diagram which represents the logic of said textual DML statement; wherein said textual DML statement includes an insert, update or delete, statement; wherein said graphical diagram which represents the logic of said textual DML statement includes at least an insert, update or delete icon; and wherein the SQL Visualizer further comprises a user interface, wherein said user interface comprises a dictionary selection control which allows a user to select a database used in said textual SQL statement, and to thereby provide a definition for said database for use in transforming said textual SQL statement into said graphical diagram which represents said textual SQL statement. 5. A SQL Visualizer as claimed in claim 1 , wherein said graphical diagram which represents said textual SQL procedure is a graphical SQL Procedure.
0.810742
9,031,243
1
23
1. A non-transitory computer-readable storage medium having embodied thereon a program, the program being executable by a processor to perform a method for multi-stage audio signal analysis, the method comprising: performing a first-stage processing operation on an audio signal, the first stage processing operation including a windowed signal analysis to calculate from the audio signal statistical descriptor features that are stored in a raw feature vector; performing a second stage statistical processing operation on the raw feature vector to derive a reduced feature vector; performing a third stage processing operation on the reduced feature vector to derive at least one sound object label that refers to the original audio signal; and mapping the at least one sound object label into a stream of control events sent to a sound-object-driven, multimedia-aware software application, wherein the sound-object-driven multimedia-aware software application is responsive to the stream of control events to configure processing for the audio signal, and wherein any of the processing operations of the first through third stages are configurable.
1. A non-transitory computer-readable storage medium having embodied thereon a program, the program being executable by a processor to perform a method for multi-stage audio signal analysis, the method comprising: performing a first-stage processing operation on an audio signal, the first stage processing operation including a windowed signal analysis to calculate from the audio signal statistical descriptor features that are stored in a raw feature vector; performing a second stage statistical processing operation on the raw feature vector to derive a reduced feature vector; performing a third stage processing operation on the reduced feature vector to derive at least one sound object label that refers to the original audio signal; and mapping the at least one sound object label into a stream of control events sent to a sound-object-driven, multimedia-aware software application, wherein the sound-object-driven multimedia-aware software application is responsive to the stream of control events to configure processing for the audio signal, and wherein any of the processing operations of the first through third stages are configurable. 23. The non-transitory computer readable storage medium of claim 1 , wherein the method is executable to identify a medically-relevant characteristic of the audio signal.
0.813187
7,516,124
1
9
1. A computer-implemented method for processing query data comprising: receiving, from a client over a network a portion of a query, wherein the portion of the query is not formerly issued by the user that initiated the query; before any predicted queries are provided to the client and in response to receiving the portion of the query determining, based on the portion of the query, a set of one or more predicted queries that correspond to the portion of the query; selecting, based upon selection criteria, a particular predicted query from the set of one or more predicted queries; processing the particular predicted query to obtain search results; and providing both the set of one or more predicted queries and the search results to the client over the network; wherein determining the set of one or more predicted queries includes: determining a plurality of potential predicted queries; for each query of the plurality of potential predicted queries: searching a first database to determine a first value that indicates how often said each query was issued during a first period of time; searching a second database to determine a second value that indicates how often said each query was issued during a second period of time that occurred temporally before or after the first period of time; scaling the first value by a scale factor to generate a scaled value: generating a resulting value based on the scaled value and the second value; and associating the resulting value with said each query: and using the resulting value of each query of the plurality of potential predicted queries to determine the set of one or more queries from the plurality of potential predicted queries.
1. A computer-implemented method for processing query data comprising: receiving, from a client over a network a portion of a query, wherein the portion of the query is not formerly issued by the user that initiated the query; before any predicted queries are provided to the client and in response to receiving the portion of the query determining, based on the portion of the query, a set of one or more predicted queries that correspond to the portion of the query; selecting, based upon selection criteria, a particular predicted query from the set of one or more predicted queries; processing the particular predicted query to obtain search results; and providing both the set of one or more predicted queries and the search results to the client over the network; wherein determining the set of one or more predicted queries includes: determining a plurality of potential predicted queries; for each query of the plurality of potential predicted queries: searching a first database to determine a first value that indicates how often said each query was issued during a first period of time; searching a second database to determine a second value that indicates how often said each query was issued during a second period of time that occurred temporally before or after the first period of time; scaling the first value by a scale factor to generate a scaled value: generating a resulting value based on the scaled value and the second value; and associating the resulting value with said each query: and using the resulting value of each query of the plurality of potential predicted queries to determine the set of one or more queries from the plurality of potential predicted queries. 9. The computer-implemented method as in claim 1 , further comprising providing to the client additional data, including advertisements, that relates to the search results.
0.869102
8,145,649
6
10
6. A system, comprising at least one processor and memory, for determining relevance of an electronic advertisement to a target content, said system comprising: a server system configured for: extracting a set of terms from said electronic advertisement and said target content; calculating a first content match feature using said set of terms, the first content match feature comprising a translation evaluation feature indicating a degree to which n-grams of the electronic advertisement and the target content match; calculating a second content match feature using said set of terms, the second content match feature comprising a translation probability feature indicating a probability that one or more terms of the electronic advertisement are related to one or more terms of the target content, wherein the one or more terms of the electronic advertisement do not match the one or more terms of the target content; and processing said first content match feature and said second content match feature with a machine learning model to output a relevance score indicating the relevance of the electronic advertisement to the target content, the machine learning model comprising individual weights for the first and second content match features, the machine learning model being trained using said first and second content match features and machine learning techniques.
6. A system, comprising at least one processor and memory, for determining relevance of an electronic advertisement to a target content, said system comprising: a server system configured for: extracting a set of terms from said electronic advertisement and said target content; calculating a first content match feature using said set of terms, the first content match feature comprising a translation evaluation feature indicating a degree to which n-grams of the electronic advertisement and the target content match; calculating a second content match feature using said set of terms, the second content match feature comprising a translation probability feature indicating a probability that one or more terms of the electronic advertisement are related to one or more terms of the target content, wherein the one or more terms of the electronic advertisement do not match the one or more terms of the target content; and processing said first content match feature and said second content match feature with a machine learning model to output a relevance score indicating the relevance of the electronic advertisement to the target content, the machine learning model comprising individual weights for the first and second content match features, the machine learning model being trained using said first and second content match features and machine learning techniques. 10. The system of claim 6 , wherein said electronic advertisement and target content comprise different vocabularies, said first and second content match features providing a translation between said electronic advertisement and target content vocabularies.
0.5
9,256,297
1
2
1. A method of enabling input on a handheld electronic device that comprises a plurality of keys, at least some of the keys having characters assigned thereto, the method comprising: monitoring for a number of key inputs in a key first input sequence, each key input corresponding to at least one selection of one of the plurality of keys; responsive to a first one of the key inputs, initiating a text entry session on the handheld electronic device, wherein the text entry session comprises disambiguating the first key input sequence upon each actuation of the number of key inputs; detecting an input in the handheld electronic device as a delimiter input and, responsive thereto, terminating the text entry session, wherein terminating the text entry session comprises terminating the disambiguation of the first key input sequence; detecting a post-termination key input indicating an entry of a linguistic character and, responsive thereto, appending the post-termination key input to the first key input sequence without an intervening delimiter to form a second key input sequence, the second key input sequence concatenating the first key input sequence and the post-termination key input; and responsive to detecting the post-terminating key input indicating the entry of the linguistic character, resuming the text entry session, wherein resuming the text entry session comprises disambiguating the second key input sequence that includes both the first key input sequence and the post-termination key input.
1. A method of enabling input on a handheld electronic device that comprises a plurality of keys, at least some of the keys having characters assigned thereto, the method comprising: monitoring for a number of key inputs in a key first input sequence, each key input corresponding to at least one selection of one of the plurality of keys; responsive to a first one of the key inputs, initiating a text entry session on the handheld electronic device, wherein the text entry session comprises disambiguating the first key input sequence upon each actuation of the number of key inputs; detecting an input in the handheld electronic device as a delimiter input and, responsive thereto, terminating the text entry session, wherein terminating the text entry session comprises terminating the disambiguation of the first key input sequence; detecting a post-termination key input indicating an entry of a linguistic character and, responsive thereto, appending the post-termination key input to the first key input sequence without an intervening delimiter to form a second key input sequence, the second key input sequence concatenating the first key input sequence and the post-termination key input; and responsive to detecting the post-terminating key input indicating the entry of the linguistic character, resuming the text entry session, wherein resuming the text entry session comprises disambiguating the second key input sequence that includes both the first key input sequence and the post-termination key input. 2. The method of claim 1 , wherein the handheld electronic device further comprises a memory that has a plurality of language objects stored therein, the method further comprising: responsive to the resuming of the text entry session, locating a language object that corresponds to the number of key inputs plus the post-termination key input.
0.5
7,529,744
1
8
1. A method executed on a computer system comprising: Receiving one or more initial search terms describing one or more objects in a server management system; Automatically determining one or more suggested search terms in response to the receiving the one or more initial search terms; Displaying the one or more suggested search terms to the user; Receiving a user selection of a subset of the one or more suggested search terms; Searching for object definitions which match the one or more search terms; Determining one or more matching objects corresponding to the object definitions which match the one or more search terms; and Reporting the one or more matching objects, wherein reporting the one or more matching objects comprises reporting that a first matching object is defined in at least a first management context and a second management context, wherein the first management context relates to management of a first category of resources, and wherein the second management context relates to management of a second category of resources.
1. A method executed on a computer system comprising: Receiving one or more initial search terms describing one or more objects in a server management system; Automatically determining one or more suggested search terms in response to the receiving the one or more initial search terms; Displaying the one or more suggested search terms to the user; Receiving a user selection of a subset of the one or more suggested search terms; Searching for object definitions which match the one or more search terms; Determining one or more matching objects corresponding to the object definitions which match the one or more search terms; and Reporting the one or more matching objects, wherein reporting the one or more matching objects comprises reporting that a first matching object is defined in at least a first management context and a second management context, wherein the first management context relates to management of a first category of resources, and wherein the second management context relates to management of a second category of resources. 8. The method of claim 1 , wherein the receiving the one or more search terms comprises: receiving the one or more search terms using a search interface; and sending the one or more search terms from the search interface to one or more search engines, wherein the one or more search engines are external to the search interface.
0.702359
8,688,697
18
19
18. The system of claim 17 wherein the generated display data is transmitted to a graphical user interface.
18. The system of claim 17 wherein the generated display data is transmitted to a graphical user interface. 19. The method of claim 18 , wherein the list of keywords is generated in response to receiving a description of a product or service entered into the graphical user interface.
0.5
10,122,670
3
4
3. The method as recited in claim 2 , wherein identifying the previous social networking activities of the recipient further comprises one or more of identifying one or more electronic message interactions performed by the recipient, identifying one or more locations associated with the recipient, identifying one or more social network transactions performed by the recipient, identifying one or more connections of the recipient, identifying recipient-provided profile information, or identifying one or more translation ratings provided by the recipient.
3. The method as recited in claim 2 , wherein identifying the previous social networking activities of the recipient further comprises one or more of identifying one or more electronic message interactions performed by the recipient, identifying one or more locations associated with the recipient, identifying one or more social network transactions performed by the recipient, identifying one or more connections of the recipient, identifying recipient-provided profile information, or identifying one or more translation ratings provided by the recipient. 4. The method as recited in claim 3 , wherein identifying one or more electronic message interactions performed by the recipient comprises identifying one or more electronic messages commented on by the recipient, electronic messages liked by the recipient, comments made by the recipient, or electronic messages shared by the recipient.
0.803613
7,774,195
15
16
15. The localization platform of claim 12 wherein the localization components comprise: a data service component accessible by the matcher component; and a plurality of localization data stores, accessible by the data service component, storing the data localized to one or more distinct markets, the data service component searching the plurality of localization data stores to return localized data based on a query from the matcher component.
15. The localization platform of claim 12 wherein the localization components comprise: a data service component accessible by the matcher component; and a plurality of localization data stores, accessible by the data service component, storing the data localized to one or more distinct markets, the data service component searching the plurality of localization data stores to return localized data based on a query from the matcher component. 16. The localization platform of claim 15 wherein the localization components comprise: at least one machine translation system, accessible by the matcher component, accessing the data service component to translate the data to be localized.
0.5
7,567,961
1
2
1. A method comprising: providing a classification scheme including two or more classes, with each class associated with one or more classified document headnotes; summarizing a legal opinion to define at least one particular document headnote; automatically generating a ranked list of two or more classes of the classification scheme, with each listed class associated with one or more classified document headnotes which are similar to the one particular document headnote; and classifying the one particular document headnote based on the ranked list of classes: wherein automatically generating a list of one or more of the classes comprises: defining one or more natural-language queries based on the particular document summary; performing one or more searches of the classified document summaries based on one or more of the queries, with one or more of the searches yielding two or more found document summaries; ranking the one or more found document summaries based on relative similarity to the particular document summary to define one or more ranked document summaries; and generating the list based on one or more of the ranked document summaries.
1. A method comprising: providing a classification scheme including two or more classes, with each class associated with one or more classified document headnotes; summarizing a legal opinion to define at least one particular document headnote; automatically generating a ranked list of two or more classes of the classification scheme, with each listed class associated with one or more classified document headnotes which are similar to the one particular document headnote; and classifying the one particular document headnote based on the ranked list of classes: wherein automatically generating a list of one or more of the classes comprises: defining one or more natural-language queries based on the particular document summary; performing one or more searches of the classified document summaries based on one or more of the queries, with one or more of the searches yielding two or more found document summaries; ranking the one or more found document summaries based on relative similarity to the particular document summary to define one or more ranked document summaries; and generating the list based on one or more of the ranked document summaries. 2. The method of claim 1 , wherein summarizing a particular document comprises manually summarizing the particular document.
0.93667
8,060,492
23
32
23. A Non-transitory computer-readable storage medium encoded with computer-executable instructions that when executed by a computing device, perform a method comprising: receiving a request over a network from a user for generation of at least one URL based context query, wherein the request comprises at least one query generation criteria; searching, via the network, for clusters of related data objects within a multidimensional dataspace having at least one spatial axis, at least one temporal axis, and at least one social axis using the at least one query generation criteria, wherein at least one cluster of data objects relating to the at least one query generation criteria is identified; checking permissions, via the network, relating to each data object in the at least one cluster of related data objects to determine if the user is permitted to access the data object, wherein if the user does not have permission to view the data object, the data object is removed from the cluster; generating, via the network, a URL having a context query comprising at least one context criteria, wherein the at least one context criteria is derived from the properties of the at least one cluster of data objects; and transmitting the URL having a context query to the end user.
23. A Non-transitory computer-readable storage medium encoded with computer-executable instructions that when executed by a computing device, perform a method comprising: receiving a request over a network from a user for generation of at least one URL based context query, wherein the request comprises at least one query generation criteria; searching, via the network, for clusters of related data objects within a multidimensional dataspace having at least one spatial axis, at least one temporal axis, and at least one social axis using the at least one query generation criteria, wherein at least one cluster of data objects relating to the at least one query generation criteria is identified; checking permissions, via the network, relating to each data object in the at least one cluster of related data objects to determine if the user is permitted to access the data object, wherein if the user does not have permission to view the data object, the data object is removed from the cluster; generating, via the network, a URL having a context query comprising at least one context criteria, wherein the at least one context criteria is derived from the properties of the at least one cluster of data objects; and transmitting the URL having a context query to the end user. 32. The computer-readable storage medium of claim 23 wherein if the requesting user is not authorized to view at least one object in the at least one cluster of related data objects, the clustering threshold is reevaluated for the at least one cluster of related data objects.
0.783699
8,392,441
23
24
23. A computer-implemented method, comprising: receiving a query submitted by a user to a search engine, wherein the query includes a first compound term; and in response to receiving the query, performing the following operations: generating one or more splits of the first compound term, wherein each split divides the compound term into two or more subterms, wherein at least one subterm is a term in a dictionary that associates terms with scores derived from a respective frequency of use of the subterm; assigning a score to one or more subterms of each split that are in the dictionary, wherein the score for a subterm is the score stored in the dictionary for the subterm; determining an overall score for each split from the scores for the subterms of the split; selecting a first split from the one or more splits according to the overall score for each split; and augmenting the query with a first synonym phrase, wherein the first synonym phrase is a synonym of a first subterm of the first split.
23. A computer-implemented method, comprising: receiving a query submitted by a user to a search engine, wherein the query includes a first compound term; and in response to receiving the query, performing the following operations: generating one or more splits of the first compound term, wherein each split divides the compound term into two or more subterms, wherein at least one subterm is a term in a dictionary that associates terms with scores derived from a respective frequency of use of the subterm; assigning a score to one or more subterms of each split that are in the dictionary, wherein the score for a subterm is the score stored in the dictionary for the subterm; determining an overall score for each split from the scores for the subterms of the split; selecting a first split from the one or more splits according to the overall score for each split; and augmenting the query with a first synonym phrase, wherein the first synonym phrase is a synonym of a first subterm of the first split. 24. The method of claim 23 , wherein selecting the first split according to the overall scores comprises selecting the split with a highest overall score.
0.694444
9,361,355
1
26
1. A method, including: receiving data records, the received data records each including one or more values in one or more fields; and processing the received data records to identify at least one matched data cluster to associate with each received data record, the processing including: for at least one selected data record from the received data records, generating a query from the one or more values included in the selected data record and performing at least a first comparison, a second comparison, and a third comparison using the generated query; identifying, in the first comparison, one or more candidate data records from the received data records using the query and an approximate distance measure; determining, in the second comparison performed after the first comparison, whether or not the selected data record satisfies a growth criterion for at least one candidate data cluster of one or more existing data clusters containing the candidate records, wherein the growth criterion is different from any cluster membership criterion for any candidate data cluster and uses the query and a first threshold associated with a boundary around a respective predetermined member of a candidate data cluster; determining, in the third comparison performed after the second comparison, whether or not the selected data record satisfies a cluster membership criterion for at least one candidate data cluster of one or more existing data clusters containing the candidate records using the query and a second threshold associated with a detailed distance measure more accurate than the approximate distance measure; and selecting the matched data cluster from among one or more candidate data clusters if the selected data record satisfies both the cluster membership criterion and the growth criterion for the matched data cluster, or initializing the matched data cluster with the selected data record if the selected data record does not satisfy the growth criterion for any of the existing data clusters or if the selected data record does satisfy the growth criterion for at least one of the existing data clusters but does not satisfy a cluster membership criterion for any of the existing data clusters.
1. A method, including: receiving data records, the received data records each including one or more values in one or more fields; and processing the received data records to identify at least one matched data cluster to associate with each received data record, the processing including: for at least one selected data record from the received data records, generating a query from the one or more values included in the selected data record and performing at least a first comparison, a second comparison, and a third comparison using the generated query; identifying, in the first comparison, one or more candidate data records from the received data records using the query and an approximate distance measure; determining, in the second comparison performed after the first comparison, whether or not the selected data record satisfies a growth criterion for at least one candidate data cluster of one or more existing data clusters containing the candidate records, wherein the growth criterion is different from any cluster membership criterion for any candidate data cluster and uses the query and a first threshold associated with a boundary around a respective predetermined member of a candidate data cluster; determining, in the third comparison performed after the second comparison, whether or not the selected data record satisfies a cluster membership criterion for at least one candidate data cluster of one or more existing data clusters containing the candidate records using the query and a second threshold associated with a detailed distance measure more accurate than the approximate distance measure; and selecting the matched data cluster from among one or more candidate data clusters if the selected data record satisfies both the cluster membership criterion and the growth criterion for the matched data cluster, or initializing the matched data cluster with the selected data record if the selected data record does not satisfy the growth criterion for any of the existing data clusters or if the selected data record does satisfy the growth criterion for at least one of the existing data clusters but does not satisfy a cluster membership criterion for any of the existing data clusters. 26. The method of claim 1 , wherein the processing further includes: for a plurality of tokens that each include at least one value or fragment of a value in a field or a combination of fields of the received data records, storing, within entries in a search store each associated with at least one respective token of the plurality of tokens, location information identifying at least some of the received data records that correspond to said at least one respective token.
0.658501
8,401,912
7
11
7. A method, comprising: accepting, using a computer, interaction from a first user to access a website and to interact with at least a first character on said website; subsequent to said accepting interaction from the first user, registering, using the computer, a second character by said first user on said website by receiving entry of a unique code that is associated with the second character and is entered into the computer, where the unique code as entered is uniquely identified with the second character, and wherein the unique code when entered causes information indicative of the second character to be obtained from a database of characteristics and associated with the second character during registration, and grants the first user access to a portion of the website for interacting with said second character, wherein said interacting customizes said second character; and subsequent to said grant of access to the portion of the website for interacting with the second character, transferring the second character from the first user to a second user, where said transfer comprises deactivating the unique code to prevent using the unique code to access the second character by entering the unique code, creating and providing a new unique code to the second user, wherein the new unique code is subsequently received from the second user and used to register and associate the character as customized by the first user with the second user, and granting the first user continued access to said first character on said website.
7. A method, comprising: accepting, using a computer, interaction from a first user to access a website and to interact with at least a first character on said website; subsequent to said accepting interaction from the first user, registering, using the computer, a second character by said first user on said website by receiving entry of a unique code that is associated with the second character and is entered into the computer, where the unique code as entered is uniquely identified with the second character, and wherein the unique code when entered causes information indicative of the second character to be obtained from a database of characteristics and associated with the second character during registration, and grants the first user access to a portion of the website for interacting with said second character, wherein said interacting customizes said second character; and subsequent to said grant of access to the portion of the website for interacting with the second character, transferring the second character from the first user to a second user, where said transfer comprises deactivating the unique code to prevent using the unique code to access the second character by entering the unique code, creating and providing a new unique code to the second user, wherein the new unique code is subsequently received from the second user and used to register and associate the character as customized by the first user with the second user, and granting the first user continued access to said first character on said website. 11. A method as in claim 7 , wherein said interacting comprises training the character to increase values associated with said second character, said values each associated with an attribute of said second character.
0.714286
9,672,268
1
6
1. A computer implemented method of obtaining a dataset answering a main query from a relational database using a database query language, the method operable on a computer system comprising a set of one or more processors, the method comprising the steps of: providing a data stack corresponding to a first subquery that forms part of the main query, wherein the main query comprises a main logical test, and the first and each further subquery that forms part of the main query comprises one or more logical sub tests, wherein the data stack acts as a container for events having codes passing the first subquery; displaying, on a user interface, actions corresponding to the first data stack, the actions further comprising specifying logical sub tests used to fill the first data stack; adding a first dataset obtained from the database to the first data stack; providing a first real result table containing the first dataset obtained from the database using the first data stack, the first dataset answering the first subquery that forms part of the main query; providing one or more further data stacks corresponding to one or more further subqueries that form part of the main query, wherein each of the one or more data stacks acts as a container for events having codes passing the one or more further subqueries; displaying, on a user interface, actions corresponding to the one or more further data stacks, the actions further comprising specifying logical sub tests used to fill the one or more further data stacks; adding a respective further dataset obtained from the database to each of the one or more further data stacks; providing one or more further real result tables, each of the one or more further real result tables containing a respective further dataset obtained from the database, each of the one or more further datasets answering a respective further subquery that forms part of the main query; and obtaining a dataset from the first real result table and the one or more further real result tables answering the main query, wherein the dataset is displayed on the user interface.
1. A computer implemented method of obtaining a dataset answering a main query from a relational database using a database query language, the method operable on a computer system comprising a set of one or more processors, the method comprising the steps of: providing a data stack corresponding to a first subquery that forms part of the main query, wherein the main query comprises a main logical test, and the first and each further subquery that forms part of the main query comprises one or more logical sub tests, wherein the data stack acts as a container for events having codes passing the first subquery; displaying, on a user interface, actions corresponding to the first data stack, the actions further comprising specifying logical sub tests used to fill the first data stack; adding a first dataset obtained from the database to the first data stack; providing a first real result table containing the first dataset obtained from the database using the first data stack, the first dataset answering the first subquery that forms part of the main query; providing one or more further data stacks corresponding to one or more further subqueries that form part of the main query, wherein each of the one or more data stacks acts as a container for events having codes passing the one or more further subqueries; displaying, on a user interface, actions corresponding to the one or more further data stacks, the actions further comprising specifying logical sub tests used to fill the one or more further data stacks; adding a respective further dataset obtained from the database to each of the one or more further data stacks; providing one or more further real result tables, each of the one or more further real result tables containing a respective further dataset obtained from the database, each of the one or more further datasets answering a respective further subquery that forms part of the main query; and obtaining a dataset from the first real result table and the one or more further real result tables answering the main query, wherein the dataset is displayed on the user interface. 6. The method of claim 1 , wherein the real result tables are stored in a dedicated result table database separate from the main relational database.
0.914368
9,547,480
8
9
8. The method of claim 1 , wherein generating the one or more application model build artifacts based on the one or more of the respective application model subsets comprises: generating semantic application model build artifacts for each of the application model subsets; and generating a documentation model build artifact for the application model.
8. The method of claim 1 , wherein generating the one or more application model build artifacts based on the one or more of the respective application model subsets comprises: generating semantic application model build artifacts for each of the application model subsets; and generating a documentation model build artifact for the application model. 9. The method of claim 8 , wherein the semantic application model build artifacts comprise at least one Web Service Definition Language (WSDL) file.
0.790368
7,778,944
3
5
3. The method of claim 2 , wherein partitioning of the plurality of linear rules further comprises partitioning each of the plurality of the linear rules into a respective one of the plurality of types of rules.
3. The method of claim 2 , wherein partitioning of the plurality of linear rules further comprises partitioning each of the plurality of the linear rules into a respective one of the plurality of types of rules. 5. The method of claim 3 , wherein the partitioned plurality of linear rules comprises weighted rewrite rules.
0.640523
8,255,221
10
17
10. A computer readable storage medium storing instructions that, when executed by a computer, causes the computer to perform a method for generating a web podcast interview, the method comprising the steps of: responsive to a user providing an interview sequence comprising questions and answers, generating an interview worksheet including the interview sequence; selecting a primary interviewer voice among a plurality of predefined interviewer voices, configuring the primary interviewer voice to ask at least one question in the interview sequence and affecting a text from the interview sequence to the primary interviewer voice; updating the interview worksheet with the primary interviewer voice text; selecting a secondary interviewer voice among a plurality of predefined interviewer voices, configuring the secondary interviewer voice to answer at least one question in the interview sequence and affecting a text from the interview sequence to the secondary interviewer voice; updating the interview worksheet with the secondary interviewer voice text;concatenating by the interview worksheet the interview sequence, primary voice text and secondary voice text to a text file; converting by a text-to-speech module the text file into an audio file; and generating a questions/answers sequence in a podcast compliant format, wherein the questions and answers are of different voices; wherein one or more of the steps of the method are performed using a computer.
10. A computer readable storage medium storing instructions that, when executed by a computer, causes the computer to perform a method for generating a web podcast interview, the method comprising the steps of: responsive to a user providing an interview sequence comprising questions and answers, generating an interview worksheet including the interview sequence; selecting a primary interviewer voice among a plurality of predefined interviewer voices, configuring the primary interviewer voice to ask at least one question in the interview sequence and affecting a text from the interview sequence to the primary interviewer voice; updating the interview worksheet with the primary interviewer voice text; selecting a secondary interviewer voice among a plurality of predefined interviewer voices, configuring the secondary interviewer voice to answer at least one question in the interview sequence and affecting a text from the interview sequence to the secondary interviewer voice; updating the interview worksheet with the secondary interviewer voice text;concatenating by the interview worksheet the interview sequence, primary voice text and secondary voice text to a text file; converting by a text-to-speech module the text file into an audio file; and generating a questions/answers sequence in a podcast compliant format, wherein the questions and answers are of different voices; wherein one or more of the steps of the method are performed using a computer. 17. The computer readable storage medium of claim 10 wherein prior to the step of converting further comprising the step of updating the interview worksheet with directives of a business context and directives of a market strategy.
0.5
8,612,926
9
11
9. A method for computer software development and storage, comprising: facilitating the viewing of and commenting on requirement specifications for software designs by developers using a requirements design subsystem thereby identifying requirements for new or improved software to be developed; conducting a software design competition using the software design requirements generated with the requirements design subsystem; conducting a development competition for development of software implementing a winning submission to the software design competition, the software comprising a functional software module that is reusable as a building block of an application; and storing in a software catalog software that is a winning submission in the development competition, the software catalog comprising a repository for storing reusable software modules developed by conducting the competitions using the competition development subsystem and for providing a directory of information to potential purchasers and licensees about the reusable modules in the repository.
9. A method for computer software development and storage, comprising: facilitating the viewing of and commenting on requirement specifications for software designs by developers using a requirements design subsystem thereby identifying requirements for new or improved software to be developed; conducting a software design competition using the software design requirements generated with the requirements design subsystem; conducting a development competition for development of software implementing a winning submission to the software design competition, the software comprising a functional software module that is reusable as a building block of an application; and storing in a software catalog software that is a winning submission in the development competition, the software catalog comprising a repository for storing reusable software modules developed by conducting the competitions using the competition development subsystem and for providing a directory of information to potential purchasers and licensees about the reusable modules in the repository. 11. The method of claim 9 , further comprising facilitating suggestions by the developers for modifications to the software in the repository.
0.567073
4,633,430
6
7
6. The document processing means of claim 3, wherein said supervisory control means further comprises: stack means for storing information identifying state of execution of said document operation and supervisory operation routines, said processor means being responsive to execution of said routines for writing said information identifying state of execution of said routines into said stack means and reading said information identifying state of execution of said routines from said stack means.
6. The document processing means of claim 3, wherein said supervisory control means further comprises: stack means for storing information identifying state of execution of said document operation and supervisory operation routines, said processor means being responsive to execution of said routines for writing said information identifying state of execution of said routines into said stack means and reading said information identifying state of execution of said routines from said stack means. 7. The document processing means of claim 6, wherein said stack means further comprises: supervisory stack means for storing type of routine information and said operation vector of said current document operation routine and the operation vectors of interrupted said document operation routines, and document operation stack means for storing certain of said document operation routines.
0.5
9,652,496
17
22
17. A system comprising: one or more first computers and one or more first storage devices storing instructions that are operable, when executed by the one or more first computers, to cause the one or more first computers to implement a join operator node that is operable to compute, according to a predicate expression in a query, a join result of pairs of first tuples of a first table and second tuples of a second table that have matching values, including matching first values of a first attribute of the first table, and matching second values of a second attribute of the second table, wherein the second table is partitioned by the second attribute of the second table; one or more second computers and one or more second storage devices storing instructions that are operable, when executed by the one or more second computers, to cause the one or more second computers to implement a table scanner node that is operable to obtain the first tuples of the first table from storage and provides the obtained first tuples to a partition selector node; one or more third computers and one or more third storage devices storing instructions that are operable, when executed by the one or more third computers, to cause the one or more third computers to implement a partition selector node that is operable to determine, according to a partition selection function for the second table, one or more partitions of the second table that may include second tuples having respective second values that match first values of the first tuples for the first attribute, and provide respective identifiers for the one or more partitions of the second table to a dynamic scanner node; one or more fourth computers and one or more fourth storage devices storing instructions that are operable, when executed by the one or more fourth computers, to cause the one or more fourth computers to implement a dynamic scanner node that is operable to receive, from the partition selector node, respective identifiers of the one or more partitions of the second table, obtain, using the respective identifiers of the one or more partitions of the second table, the second tuples of the one or more partitions from storage, and provide the obtained second tuples to the join operator node for use in computing the join result; and one or more fifth computers and one or more fifth storage devices storing instructions that are operable, when executed by the one or more fifth computers, to cause the one or more fifth computers to implement a master node that is operable to generate, using a representation of a query plan for the query, a modified query plan for the query that comprises a plurality of operators that, when executed by one or more computing nodes, cause the one or more computing nodes to compute a result for the query, wherein the modified query plan includes a join operator that represents the join operator node, a table scanner operator that represents the table scanner node, a partition selector operator that represents the partition selector node, and a dynamic scan operator that represents the dynamic scanner node; and wherein the master node is operable to generate the modified query plan by performing operations comprising: determining that the dynamic scan operator is defined in a subtree on an outer side of the join operator; and in response to determining that the dynamic scan operator is defined a subtree on the outer side of the join operator, pushing the partition selector operator to the subtree on the outer side of the join operator.
17. A system comprising: one or more first computers and one or more first storage devices storing instructions that are operable, when executed by the one or more first computers, to cause the one or more first computers to implement a join operator node that is operable to compute, according to a predicate expression in a query, a join result of pairs of first tuples of a first table and second tuples of a second table that have matching values, including matching first values of a first attribute of the first table, and matching second values of a second attribute of the second table, wherein the second table is partitioned by the second attribute of the second table; one or more second computers and one or more second storage devices storing instructions that are operable, when executed by the one or more second computers, to cause the one or more second computers to implement a table scanner node that is operable to obtain the first tuples of the first table from storage and provides the obtained first tuples to a partition selector node; one or more third computers and one or more third storage devices storing instructions that are operable, when executed by the one or more third computers, to cause the one or more third computers to implement a partition selector node that is operable to determine, according to a partition selection function for the second table, one or more partitions of the second table that may include second tuples having respective second values that match first values of the first tuples for the first attribute, and provide respective identifiers for the one or more partitions of the second table to a dynamic scanner node; one or more fourth computers and one or more fourth storage devices storing instructions that are operable, when executed by the one or more fourth computers, to cause the one or more fourth computers to implement a dynamic scanner node that is operable to receive, from the partition selector node, respective identifiers of the one or more partitions of the second table, obtain, using the respective identifiers of the one or more partitions of the second table, the second tuples of the one or more partitions from storage, and provide the obtained second tuples to the join operator node for use in computing the join result; and one or more fifth computers and one or more fifth storage devices storing instructions that are operable, when executed by the one or more fifth computers, to cause the one or more fifth computers to implement a master node that is operable to generate, using a representation of a query plan for the query, a modified query plan for the query that comprises a plurality of operators that, when executed by one or more computing nodes, cause the one or more computing nodes to compute a result for the query, wherein the modified query plan includes a join operator that represents the join operator node, a table scanner operator that represents the table scanner node, a partition selector operator that represents the partition selector node, and a dynamic scan operator that represents the dynamic scanner node; and wherein the master node is operable to generate the modified query plan by performing operations comprising: determining that the dynamic scan operator is defined in a subtree on an outer side of the join operator; and in response to determining that the dynamic scan operator is defined a subtree on the outer side of the join operator, pushing the partition selector operator to the subtree on the outer side of the join operator. 22. The system of claim 17 , wherein: the table scanner node is operable to obtain all of the first tuples from the first table; and the dynamic scanner node is operable to obtain the second tuples of the one or more partitions of the second table without obtaining tuples from one or more additional partitions of the second table, the one or more partitions being different partitions in the second table than the one or more additional partitions.
0.5
9,817,920
7
12
7. A system comprising: one or more devices to: identify one or more particular terms, of a plurality of terms, in a search query; form, based on identifying the one or more particular terms, another search query; obtain first context data that includes a first set of documents returned for the search query and second context data that includes a second set of documents returned for the other search query; compare information associated with the first set of documents returned for the search query and information associated with the second set of documents returned for the other search query; determine, based on the comparing, that the first context data and the second context data are different; and store, based on the determining, information indicating that the search query and the other search query are associated with different context data.
7. A system comprising: one or more devices to: identify one or more particular terms, of a plurality of terms, in a search query; form, based on identifying the one or more particular terms, another search query; obtain first context data that includes a first set of documents returned for the search query and second context data that includes a second set of documents returned for the other search query; compare information associated with the first set of documents returned for the search query and information associated with the second set of documents returned for the other search query; determine, based on the comparing, that the first context data and the second context data are different; and store, based on the determining, information indicating that the search query and the other search query are associated with different context data. 12. The system of claim 7 , where the one or more devices, when forming the other search query, are further to: remove at least one of the one or more particular terms to form the other search query.
0.754926
10,061,831
1
4
1. A computer-implemented method comprising: receiving, from an application program, a new value for a field of a root database object, the root database object being an object in a database partitioned based on values of the field, each database object being a row in a table and the database objects being organized in a hierarchy, wherein the database supports triggers but lacks support for reference partitioning; updating the value of the field for the root object, thereby causing a table row associated with the root object to change partitions in the database; locating a first database object that is a child of the root object in the hierarchy; applying an inheritance function associated with a class of the child object to determine a value of the field for the first database object; responsive to the determined value differing from a current value of the field for the first database object, changing the current value to the determined value and moving a table row for the first database object to a partition associated with the determined value; and repeating the locating, applying, and changing for all children of the root object.
1. A computer-implemented method comprising: receiving, from an application program, a new value for a field of a root database object, the root database object being an object in a database partitioned based on values of the field, each database object being a row in a table and the database objects being organized in a hierarchy, wherein the database supports triggers but lacks support for reference partitioning; updating the value of the field for the root object, thereby causing a table row associated with the root object to change partitions in the database; locating a first database object that is a child of the root object in the hierarchy; applying an inheritance function associated with a class of the child object to determine a value of the field for the first database object; responsive to the determined value differing from a current value of the field for the first database object, changing the current value to the determined value and moving a table row for the first database object to a partition associated with the determined value; and repeating the locating, applying, and changing for all children of the root object. 4. The computer-implemented method of claim 1 , wherein the field represents a combination of at least two columns.
0.945342
8,182,267
1
15
1. A teaching system for testing and improving behavioral conduct of human subjects who are developmentally disadvantaged, comprising: a plurality of palm-sized, data logging devices, each of said data logging devices being configured to be carried by a respective professional trained to test and teach the human subject and being structured for guiding the professional through a protocol of testing and behavior improving steps and for logging responses emitted from the human subjects, in response to various triggers and stimuli; a computer system operatively coupled with said plurality of palm-sized data logging devices to receive and provide information from and to said plurality of data logging devices, wherein: (a) each of said data logging devices comprise a built-in facility that enables said data logging device to log results related to one or more of an activity, skill, social event, appropriate behavior, or inappropriate behavior of the human subject being tested and treated; (b) each of said data logging devices comprise a facility which enables uploading and/or downloading of data to a central data and control repository of said computer system, which categorizes and maintains results in accordance with various criteria; (c) a processor associated with the computer system which is structured to analyze the data and to develop standardized responses to said results, and to update said standardized responses based on progressive downloading of said data to said central data and control repository; and (d) wherein the logging devices comprise a facility that enables time stamping events within a behavioral stream and recording the number of correct or incorrect behavioral responses and recording response times or reaction times.
1. A teaching system for testing and improving behavioral conduct of human subjects who are developmentally disadvantaged, comprising: a plurality of palm-sized, data logging devices, each of said data logging devices being configured to be carried by a respective professional trained to test and teach the human subject and being structured for guiding the professional through a protocol of testing and behavior improving steps and for logging responses emitted from the human subjects, in response to various triggers and stimuli; a computer system operatively coupled with said plurality of palm-sized data logging devices to receive and provide information from and to said plurality of data logging devices, wherein: (a) each of said data logging devices comprise a built-in facility that enables said data logging device to log results related to one or more of an activity, skill, social event, appropriate behavior, or inappropriate behavior of the human subject being tested and treated; (b) each of said data logging devices comprise a facility which enables uploading and/or downloading of data to a central data and control repository of said computer system, which categorizes and maintains results in accordance with various criteria; (c) a processor associated with the computer system which is structured to analyze the data and to develop standardized responses to said results, and to update said standardized responses based on progressive downloading of said data to said central data and control repository; and (d) wherein the logging devices comprise a facility that enables time stamping events within a behavioral stream and recording the number of correct or incorrect behavioral responses and recording response times or reaction times. 15. The system of claim 1 , wherein said non-verbal responses include recording information about tone, volume, strength, and response rate of verbal behavior.
0.81682
9,251,172
1
2
1. A computer system for providing digital assets in response to searches for digital assets, comprising: a database configured to: store multiple keywords, wherein the keywords are organized in a hierarchical structure and have an ancestor, descendant, or sibling relation to at least one other keyword in the hierarchical structure; and store multiple digital assets, wherein at least some of the digital assets have associated with them one or more keywords; and a server computer configured to: receive a request for one or more digital assets from a client computer, wherein the request includes a search term; conform the search term to a keyword in the hierarchical structure; identify a first set of digital assets responsive to the conformed search term from the multiple digital assets stored in the database, wherein the first set of digital assets has associated therewith a keyword that directly matches the conformed search term; determine one or more first suggested keywords from the keywords organized in the hierarchical structure, wherein the determination of the one or more first suggested keywords is based on an ancestor, descendant, or sibling relation in the hierarchical structure between the first suggested keywords and the conformed search term that exists prior to receiving the request for one or more digital assets; provide the first set of digital assets and the one or more first suggested keywords to the client computer; generate a refinement term based on a selection of a keyword from the one or more first suggested keywords or a selection of a digital asset from the first set of digital assets received from the client computer, the refinement term having a concept or subject in common with the selected keyword in the hierarchical structure; identify a second set of digital assets, wherein each digital asset in the second set of digital assets has associated therewith a keyword from the hierarchical structure of keywords equivalent to or synonymous with the refinement term; determine one or more second suggested keywords from the keywords organized in the hierarchical structure based on the one or more first suggested keywords and the refinement term; and provide the second set of digital assets and the one or more second suggested keywords to the client computer.
1. A computer system for providing digital assets in response to searches for digital assets, comprising: a database configured to: store multiple keywords, wherein the keywords are organized in a hierarchical structure and have an ancestor, descendant, or sibling relation to at least one other keyword in the hierarchical structure; and store multiple digital assets, wherein at least some of the digital assets have associated with them one or more keywords; and a server computer configured to: receive a request for one or more digital assets from a client computer, wherein the request includes a search term; conform the search term to a keyword in the hierarchical structure; identify a first set of digital assets responsive to the conformed search term from the multiple digital assets stored in the database, wherein the first set of digital assets has associated therewith a keyword that directly matches the conformed search term; determine one or more first suggested keywords from the keywords organized in the hierarchical structure, wherein the determination of the one or more first suggested keywords is based on an ancestor, descendant, or sibling relation in the hierarchical structure between the first suggested keywords and the conformed search term that exists prior to receiving the request for one or more digital assets; provide the first set of digital assets and the one or more first suggested keywords to the client computer; generate a refinement term based on a selection of a keyword from the one or more first suggested keywords or a selection of a digital asset from the first set of digital assets received from the client computer, the refinement term having a concept or subject in common with the selected keyword in the hierarchical structure; identify a second set of digital assets, wherein each digital asset in the second set of digital assets has associated therewith a keyword from the hierarchical structure of keywords equivalent to or synonymous with the refinement term; determine one or more second suggested keywords from the keywords organized in the hierarchical structure based on the one or more first suggested keywords and the refinement term; and provide the second set of digital assets and the one or more second suggested keywords to the client computer. 2. The computer system of claim 1 , wherein: at least some of the first suggested keywords are weighted according to their nearness to the conformed search term in the hierarchical structure; at least some of the first suggested keywords have a concept or subject in common with the keyword in the hierarchical structure; and at least some of the first suggested keywords are popular keywords.
0.5
8,302,011
37
38
37. A computer-implemented method for facilitating a display of markup document content retrieved from a host server on a computer network, the computer network including a client system and a server system, the method comprising: tracking interaction of a user with the markup document; storing user activity tracking information for the user with respect to the markup document; in response to receiving a request corresponding to an action by a user of the client system, the request corresponding to a URL associated with the markup document such that the markup document is accessible from a location specified by the URL: retrieving content associated with the markup document associated with the URL, wherein at least a portion of the content was previously displayed to the user on the client system; determining if difference information is available, the difference information indicating a difference between a previous version and a current version of the markup document, the previous version having been presented to the user; accessing user activity tracking information to determine portions of the markup document that were previously displayed to the user; based on the difference information and the user activity tracking information, determining portions of the current version of the markup document that have not previously been displayed to the user; providing the markup document for display to the user at a client system, the content of the markup document including one or more intra page bookmarks indicating portions of content that were not previously displayed to the user; enabling the user to use the intra page bookmarks to view the portions of the markup document that were not previously displayed; enabling the user to manually insert intra page bookmarks in the markup document allowing the user to start at a desired location after closing the markup document; and enabling the user to selectively choose to display the intra page bookmarks.
37. A computer-implemented method for facilitating a display of markup document content retrieved from a host server on a computer network, the computer network including a client system and a server system, the method comprising: tracking interaction of a user with the markup document; storing user activity tracking information for the user with respect to the markup document; in response to receiving a request corresponding to an action by a user of the client system, the request corresponding to a URL associated with the markup document such that the markup document is accessible from a location specified by the URL: retrieving content associated with the markup document associated with the URL, wherein at least a portion of the content was previously displayed to the user on the client system; determining if difference information is available, the difference information indicating a difference between a previous version and a current version of the markup document, the previous version having been presented to the user; accessing user activity tracking information to determine portions of the markup document that were previously displayed to the user; based on the difference information and the user activity tracking information, determining portions of the current version of the markup document that have not previously been displayed to the user; providing the markup document for display to the user at a client system, the content of the markup document including one or more intra page bookmarks indicating portions of content that were not previously displayed to the user; enabling the user to use the intra page bookmarks to view the portions of the markup document that were not previously displayed; enabling the user to manually insert intra page bookmarks in the markup document allowing the user to start at a desired location after closing the markup document; and enabling the user to selectively choose to display the intra page bookmarks. 38. The method of claim 37 , further comprising displaying the markup document content to the user starting from a location within the markup document where the content associated with the markup document was last displayed to the user.
0.561338
9,240,969
8
14
8. A computer program product comprising a non-transitory computer usable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to: determine one or more topics associated with a message based at least in part on message data included in the message; determine knowledge data describing the one or more topics associated with the message; determine social activity data describing one or more user activities associated with a group of one or more social users based at least in part on the knowledge data, the one or more user activities describing the one or more topics; generate a selectable tag based at least in part on the social activity data describing the one or more user activities, a selection of the selectable tag causing a display of the social activity data associated with the message; and generate graphical user interface data for displaying the social activity data associated with the message in response to the selectable tag being selected.
8. A computer program product comprising a non-transitory computer usable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to: determine one or more topics associated with a message based at least in part on message data included in the message; determine knowledge data describing the one or more topics associated with the message; determine social activity data describing one or more user activities associated with a group of one or more social users based at least in part on the knowledge data, the one or more user activities describing the one or more topics; generate a selectable tag based at least in part on the social activity data describing the one or more user activities, a selection of the selectable tag causing a display of the social activity data associated with the message; and generate graphical user interface data for displaying the social activity data associated with the message in response to the selectable tag being selected. 14. The computer program product of claim 8 , wherein the social activity data includes a post provided by a social network service.
0.844706
8,468,494
1
4
1. A method of editing textual displays of a web-based software application having multiple web pages and multiple text items, the method comprising: executing the web-based software application, the software application including a set of executable instructions for displaying web pages on a graphical user interface and allowing interaction therewith by a user, the software application including at least one secondary file providing resource bundles having a single key and text strings corresponding to text items, the executable instructions having an identifier for locating the single key and for calling the text strings for display on the web page; reading code for each text item which may be edited; receiving a selection of a text item to be edited by through a web page on which the text item is displayed; creating an edited text item based on edits to the text item on the web page; saving the edited text item to the secondary file, wherein the single key of the secondary file identifies text items that are displayed a plurality of times on the web page; and dynamically displaying the edited text item in place of the text item on the web page using the single key for a plurality of users across a distributed network without reloading or refreshing the web page by the users.
1. A method of editing textual displays of a web-based software application having multiple web pages and multiple text items, the method comprising: executing the web-based software application, the software application including a set of executable instructions for displaying web pages on a graphical user interface and allowing interaction therewith by a user, the software application including at least one secondary file providing resource bundles having a single key and text strings corresponding to text items, the executable instructions having an identifier for locating the single key and for calling the text strings for display on the web page; reading code for each text item which may be edited; receiving a selection of a text item to be edited by through a web page on which the text item is displayed; creating an edited text item based on edits to the text item on the web page; saving the edited text item to the secondary file, wherein the single key of the secondary file identifies text items that are displayed a plurality of times on the web page; and dynamically displaying the edited text item in place of the text item on the web page using the single key for a plurality of users across a distributed network without reloading or refreshing the web page by the users. 4. The method of claim 1 further comprising: providing multiple locations on the web pages for a single text item; providing a single identifier for the single text item in multiple locations; and dynamically displaying edited text item in each of the multiple locations displayed.
0.604225
8,935,783
2
4
2. The client computer system of claim 1 , wherein the at least one processor is further configured to: send the text fingerprint to a server computer system; and receive from the server computer system a target label determined for the target electronic document, the target label indicative of a category of documents that the target electronic document belongs to, wherein determining the target label comprises: retrieving a reference fingerprint from a database of reference fingerprints, the reference fingerprint determined for a reference electronic document belonging to the category, the reference fingerprint selected according to a length of the reference fingerprint so that the length of the reference fingerprint is between the upper and lower bounds; and determining whether the target electronic document belongs to the category according to a result of comparing the text fingerprint to the reference fingerprint.
2. The client computer system of claim 1 , wherein the at least one processor is further configured to: send the text fingerprint to a server computer system; and receive from the server computer system a target label determined for the target electronic document, the target label indicative of a category of documents that the target electronic document belongs to, wherein determining the target label comprises: retrieving a reference fingerprint from a database of reference fingerprints, the reference fingerprint determined for a reference electronic document belonging to the category, the reference fingerprint selected according to a length of the reference fingerprint so that the length of the reference fingerprint is between the upper and lower bounds; and determining whether the target electronic document belongs to the category according to a result of comparing the text fingerprint to the reference fingerprint. 4. The client computer system of claim 2 , wherein the category of documents is a fraudulent document category.
0.5
9,864,802
17
20
17. A non-transitory computer-readable medium encoded with executable instructions that, when executed, cause one or more data processing systems to: receive metadata for a plurality of searchable objects, the metadata including at least one of an object type definition and object properties; define search filter rules based on user properties and data conditions; perform a search according to a rule-based configuration, the rule-based configuration including filters for object properties and filter ordering rules, the filter ordering rules specifying the order in which the filters are applied; and display search results according to the rule-based configuration.
17. A non-transitory computer-readable medium encoded with executable instructions that, when executed, cause one or more data processing systems to: receive metadata for a plurality of searchable objects, the metadata including at least one of an object type definition and object properties; define search filter rules based on user properties and data conditions; perform a search according to a rule-based configuration, the rule-based configuration including filters for object properties and filter ordering rules, the filter ordering rules specifying the order in which the filters are applied; and display search results according to the rule-based configuration. 20. The computer-readable medium of claim 17 , wherein the search filter rules are also based on specific users, user roles, or user groups.
0.669811
7,991,756
10
11
10. The computer readable storage medium of claim 9 , wherein the text index stores a plurality of entries, and wherein each entry of the text index includes: a document ID corresponding to a document stored on a file system, and one or more text fields storing a list of one more terms present in the document; and wherein the metadata index stores a plurality of entries, and wherein each entry in the metadata index includes: a metadata ID corresponding to a document, and one or more metadata fields storing metadata associated with the document.
10. The computer readable storage medium of claim 9 , wherein the text index stores a plurality of entries, and wherein each entry of the text index includes: a document ID corresponding to a document stored on a file system, and one or more text fields storing a list of one more terms present in the document; and wherein the metadata index stores a plurality of entries, and wherein each entry in the metadata index includes: a metadata ID corresponding to a document, and one or more metadata fields storing metadata associated with the document. 11. The computer readable storage medium of claim 10 , wherein at least one metadata field stores a path name representing a location in a file system where the document is stored.
0.5
8,762,906
21
22
21. The system of claim 20 , wherein the at least one processor that is to reference the power data file is further to: specify implementation of the multiple power domains.
21. The system of claim 20 , wherein the at least one processor that is to reference the power data file is further to: specify implementation of the multiple power domains. 22. The system of claim 21 , wherein the at least one processor that is to reference the power data file is further to: specify or causing to specify the connectivity information between one or more pins and a global net.
0.5
10,078,763
8
9
8. The method of claim 7 , further comprising the step of: servicing the rule cache misses based on the plurality of metadata processing policies in a software miss handler.
8. The method of claim 7 , further comprising the step of: servicing the rule cache misses based on the plurality of metadata processing policies in a software miss handler. 9. The method of claim 8 , wherein the plurality of metadata processing policies includes at least one of the following: a non-executable data and non-writable (NXD+NWC) policy using the metadata tags to distinguish code from data in memory and to protect against code injection attacks; a memory safety policy defending all spatial and temporal violations in heap-allocated memory; a control-flow integrity policy restricting indirect control transfers to only allowed edges in a control flow graph to prevent return-oriented-programming-style attacks; and a fine-grained taint tracking policy to identify whether each word is tainted from a plurality of sources.
0.5
7,962,324
1
3
1. A method for globalizing handling of service management items, comprising the steps of: obtaining a service management item in a language convenient to a first of two or more actors; translating the service management item into a language-neutral format to obtain a language-neutral service management item; applying one or more annotators to the service management item, wherein the one or more annotators comprise one or more personalized annotators; translating the language-neutral service management item into a language convenient to a second of two or more actors acting on the service management item; and routing the translated service management item to the second of two or more actors, wherein one or more of said steps are performed by a hardware device.
1. A method for globalizing handling of service management items, comprising the steps of: obtaining a service management item in a language convenient to a first of two or more actors; translating the service management item into a language-neutral format to obtain a language-neutral service management item; applying one or more annotators to the service management item, wherein the one or more annotators comprise one or more personalized annotators; translating the language-neutral service management item into a language convenient to a second of two or more actors acting on the service management item; and routing the translated service management item to the second of two or more actors, wherein one or more of said steps are performed by a hardware device. 3. The method of claim 1 , wherein the step of obtaining a service management item in a language convenient to a first of two or more actors comprises obtaining a service management item in a same language as used by an individual providing the service management item.
0.505515
7,665,061
1
10
1. In a computing system that includes an integrated development environment configured to receive user input for developing computing programs, a method for utilizing one or more code builders within the integrated development environment to generate customized code in response to the user input, the method comprising: providing an integrated development environment including a plurality of code builders configured to generate code for a coded program in any of multiple code languages and in one or more markup languages by applying user input to corresponding code document object models, wherein the integrated development environment further includes: a toolbox including a plurality of previously defined code builders; a programming frame, wherein the programming frame includes a plurality of alternate display views for displaying program code comprising both source code and markup language code, the alternate display views including at least a visual design view, a markup language view, a code view, and a combined view, the code view displaying source code and having a plurality of lines for source code at which source code generated by the code builders can be placed, and the combined view displaying source code mixed with markup language, and wherein displaying the markup language view comprises running a separation algorithm on the existing program, wherein running the separation algorithm includes creating a WebForms document that contains an in-memory representation of the existing program in the form of a text buffer, the WebForms document containing the separation algorithm which is run and extracts source code and markup from the existing program and maintains each separately; and an information view identifying properties associated with source code in the code view; wherein each of the toolbox, programming frame, and information view are displayed simultaneously, in a common window of the integrated development environment; receiving user input selecting one of the plurality of previously defined code builders included in the toolbox; in the code view, receiving user input selecting one of the plurality of lines for source code to identify a desired location in the code view for insertion of source code generated by the selected code builder; automatically, and in response to receiving user input selecting one of the plurality of lines as the desired location for insertion of source code generated by the selected previously defined code builder within the coded program, and before inserting customized source code at the selected one of the plurality of lines, displaying a code builder interface that overlays the common window and which prompts a user for customized input that will be used to determine at least in part the code that is generated by the code builder; receiving the customized input from the user; applying the customized input to the corresponding document object model to dynamically generate customized source code after receipt of the user input selecting one of the plurality of lines for insertion of the source code; and inserting the customized source code at the desired location within the code view of the integrated development environment.
1. In a computing system that includes an integrated development environment configured to receive user input for developing computing programs, a method for utilizing one or more code builders within the integrated development environment to generate customized code in response to the user input, the method comprising: providing an integrated development environment including a plurality of code builders configured to generate code for a coded program in any of multiple code languages and in one or more markup languages by applying user input to corresponding code document object models, wherein the integrated development environment further includes: a toolbox including a plurality of previously defined code builders; a programming frame, wherein the programming frame includes a plurality of alternate display views for displaying program code comprising both source code and markup language code, the alternate display views including at least a visual design view, a markup language view, a code view, and a combined view, the code view displaying source code and having a plurality of lines for source code at which source code generated by the code builders can be placed, and the combined view displaying source code mixed with markup language, and wherein displaying the markup language view comprises running a separation algorithm on the existing program, wherein running the separation algorithm includes creating a WebForms document that contains an in-memory representation of the existing program in the form of a text buffer, the WebForms document containing the separation algorithm which is run and extracts source code and markup from the existing program and maintains each separately; and an information view identifying properties associated with source code in the code view; wherein each of the toolbox, programming frame, and information view are displayed simultaneously, in a common window of the integrated development environment; receiving user input selecting one of the plurality of previously defined code builders included in the toolbox; in the code view, receiving user input selecting one of the plurality of lines for source code to identify a desired location in the code view for insertion of source code generated by the selected code builder; automatically, and in response to receiving user input selecting one of the plurality of lines as the desired location for insertion of source code generated by the selected previously defined code builder within the coded program, and before inserting customized source code at the selected one of the plurality of lines, displaying a code builder interface that overlays the common window and which prompts a user for customized input that will be used to determine at least in part the code that is generated by the code builder; receiving the customized input from the user; applying the customized input to the corresponding document object model to dynamically generate customized source code after receipt of the user input selecting one of the plurality of lines for insertion of the source code; and inserting the customized source code at the desired location within the code view of the integrated development environment. 10. A method as recited in claim 1 , wherein the customized code is inserted into an existing program.
0.907441
8,099,407
18
33
18. A computer-readable storage medium containing computer executable program code, comprising: program code for monitoring at least one application for the occurrences of events wherein at least one event is associated with a media file; program code for capturing the at least one event upon the occurrence of the event by queuing event data associated with the event at a position in a queue; program code for indexing and storing at least some of the events and the media file associated with the event at a time after the occurrence of the event, wherein the time is based on performance data indicating a readiness to process the event and a position in the queue; program code for receiving a search query; program code for locating at least one relevant media file from the indexed and stored events relevant to the search query; and program code for outputting a result set comprising the at least one relevant media file.
18. A computer-readable storage medium containing computer executable program code, comprising: program code for monitoring at least one application for the occurrences of events wherein at least one event is associated with a media file; program code for capturing the at least one event upon the occurrence of the event by queuing event data associated with the event at a position in a queue; program code for indexing and storing at least some of the events and the media file associated with the event at a time after the occurrence of the event, wherein the time is based on performance data indicating a readiness to process the event and a position in the queue; program code for receiving a search query; program code for locating at least one relevant media file from the indexed and stored events relevant to the search query; and program code for outputting a result set comprising the at least one relevant media file. 33. The computer-readable storage medium of claim 18 , wherein capturing the event associated with the media file comprises identifying the event based at least in part on a display area associated with an application and identifying at least some of event data by analyzing the display area.
0.5
8,725,505
7
11
7. A computer implemented method of recognizing speech, the method comprising: identifying a valid verb; identifying a set of valid objects that corresponds to the valid verb; identifying a valid speech recognition command that includes a pairing of the valid verb with one of the valid objects; receiving an utterance from a user; determining that the utterance includes the valid verb in combination with an invalid object, the invalid object being determined to be invalid based at least in part upon a comparison of the invalid object to the set of valid objects; and providing, using a computer processor in response to the determination, inductive feedback that induces the user to select from at least two options for proceeding, comprising: prompting the user to submit an additional utterance that includes the valid verb in combination with the invalid object but is preceded by a valid command word other than the valid verb, to convert the valid verb and the invalid object into a textual representation to be inserted as dictation; and prompting the user to select one of the valid objects that corresponds to the valid verb, to use with the valid verb, by rendering a list of at least some of the valid objects; if the user submits the additional utterance, inserting the textual representation of the valid verb and the invalid object into a displayed collection of text generated based on other utterances received from the user; and if the user selects one of the valid objects from the list, executing the action defined by the valid verb and selected valid object.
7. A computer implemented method of recognizing speech, the method comprising: identifying a valid verb; identifying a set of valid objects that corresponds to the valid verb; identifying a valid speech recognition command that includes a pairing of the valid verb with one of the valid objects; receiving an utterance from a user; determining that the utterance includes the valid verb in combination with an invalid object, the invalid object being determined to be invalid based at least in part upon a comparison of the invalid object to the set of valid objects; and providing, using a computer processor in response to the determination, inductive feedback that induces the user to select from at least two options for proceeding, comprising: prompting the user to submit an additional utterance that includes the valid verb in combination with the invalid object but is preceded by a valid command word other than the valid verb, to convert the valid verb and the invalid object into a textual representation to be inserted as dictation; and prompting the user to select one of the valid objects that corresponds to the valid verb, to use with the valid verb, by rendering a list of at least some of the valid objects; if the user submits the additional utterance, inserting the textual representation of the valid verb and the invalid object into a displayed collection of text generated based on other utterances received from the user; and if the user selects one of the valid objects from the list, executing the action defined by the valid verb and selected valid object. 11. The method of claim 7 , wherein providing the inductive feedback comprises providing the inductive feedback immediately in response to the determination that the utterance includes the valid verb in combination with an invalid object.
0.772031
9,195,771
5
11
5. A system comprising: a. a plurality of client computers; b. a network; c. a server computer; and d. one or more databases; wherein: A. the server computer, and each client computer from the plurality of client computers: I. comprises a processor and a memory; II. is coupled to the network; and III. is adapted to communicate via the network; B. the one or more databases store: I. a list of data sources, wherein each data source from the list of data sources is associated with an external URL from which that data source's articles can be obtained; II. a list of subject matter channels; III. a list of name keywords, wherein each name keyword from the list of name keywords is associated with a set of subject matter channels from the list of subject matter channels; IV. an archive consisting of articles obtained from external URLs associated with data sources from the list of data sources; and V. user information comprising data defining one or more user controlled content feeds, wherein the data defining the one or more user controlled content feeds indicates, for each of the one or more user controlled content feeds: a user who created that user controlled content feed; one or more data sources from the list of data sources to use when populating that user controlled content feed; and one or more name keywords from the list of name keywords to use when populating that user controlled content feed; C. the memory of the server computer stores data adapted to configure the server computer to perform a plurality of acts comprising: I. in response to receiving a data source definition interface request from an administrator via an administrator client computer, sending, to the administrator client computer, data source definition interface data adapted to configure the administrator client computer to present a data source definition interface, the data source definition interface being operable by the administrator to define the list of data sources by specifying, for a new or existing data source, one or more characteristics selected from a set of data source characteristics comprising: a set of subject matter channels from the list of subject matter channels associated with the new or existing data source; and an external URL from which the new or existing data source's articles can be obtained; wherein tools operable by the administrator to specify each characteristic from the set of data source characteristics are encoded in the data source definition interface data; II. in response to receiving a subject matter channel definition interface request from the administrator via the administrator client computer, sending, to the administrator client computer, subject matter channel definition interface data adapted to configure the administrator client computer to present a subject matter channel definition interface operable by the administrator to define the list of subject matter channels; III. in response to receiving a name keyword definition interface request from the administrator via the administrator client computer, sending, to the administrator client computer, name keyword definition interface data adapted to configure the administrator client computer to present a name keyword definition interface, the name keyword definition interface being operable by the administrator to define the list of name keywords by specifying, for a new or existing name keyword, one or more characteristics selected from a set of name keyword characteristics comprising a set of subject matter channels from the list of subject matter channels associated with the new or existing name keyword; wherein tools operable by the administrator to specify each characteristic from the set of name keyword characteristics are encoded in the name keyword definition interface data; IV. determining whether to add a potential article obtained from an external URL associated with a data source from the list of data sources to the archive based on whether the potential article matches at least one subject matter channel from the list of subject matter channels; V. in response to receiving a content feed request from a user via a user client computer, sending, to the user client computer, graphical content feed data adapted to configure the user client computer to present a graphical content feed, the graphical content feed populated with articles selected from the archive; VI. in response to receiving a user controlled content feed source definition request from the user, modifying a user controlled content feed indicated as being created by the user by data stored in the one or more databases by modifying which data sources are included in the one or more data sources indicated by data stored in the one or more databases as being data sources to use when populating the user controlled content feed; and VII. in response to receiving a user controlled content feed name keyword definition request from the user, modifying the user controlled content feed indicated as being created by the user by data stored in the one or more databases by modifying which name keywords are included in the one or more name keywords indicated by data stored in the one or more databases as being name keywords to use when populating the user controlled content feed.
5. A system comprising: a. a plurality of client computers; b. a network; c. a server computer; and d. one or more databases; wherein: A. the server computer, and each client computer from the plurality of client computers: I. comprises a processor and a memory; II. is coupled to the network; and III. is adapted to communicate via the network; B. the one or more databases store: I. a list of data sources, wherein each data source from the list of data sources is associated with an external URL from which that data source's articles can be obtained; II. a list of subject matter channels; III. a list of name keywords, wherein each name keyword from the list of name keywords is associated with a set of subject matter channels from the list of subject matter channels; IV. an archive consisting of articles obtained from external URLs associated with data sources from the list of data sources; and V. user information comprising data defining one or more user controlled content feeds, wherein the data defining the one or more user controlled content feeds indicates, for each of the one or more user controlled content feeds: a user who created that user controlled content feed; one or more data sources from the list of data sources to use when populating that user controlled content feed; and one or more name keywords from the list of name keywords to use when populating that user controlled content feed; C. the memory of the server computer stores data adapted to configure the server computer to perform a plurality of acts comprising: I. in response to receiving a data source definition interface request from an administrator via an administrator client computer, sending, to the administrator client computer, data source definition interface data adapted to configure the administrator client computer to present a data source definition interface, the data source definition interface being operable by the administrator to define the list of data sources by specifying, for a new or existing data source, one or more characteristics selected from a set of data source characteristics comprising: a set of subject matter channels from the list of subject matter channels associated with the new or existing data source; and an external URL from which the new or existing data source's articles can be obtained; wherein tools operable by the administrator to specify each characteristic from the set of data source characteristics are encoded in the data source definition interface data; II. in response to receiving a subject matter channel definition interface request from the administrator via the administrator client computer, sending, to the administrator client computer, subject matter channel definition interface data adapted to configure the administrator client computer to present a subject matter channel definition interface operable by the administrator to define the list of subject matter channels; III. in response to receiving a name keyword definition interface request from the administrator via the administrator client computer, sending, to the administrator client computer, name keyword definition interface data adapted to configure the administrator client computer to present a name keyword definition interface, the name keyword definition interface being operable by the administrator to define the list of name keywords by specifying, for a new or existing name keyword, one or more characteristics selected from a set of name keyword characteristics comprising a set of subject matter channels from the list of subject matter channels associated with the new or existing name keyword; wherein tools operable by the administrator to specify each characteristic from the set of name keyword characteristics are encoded in the name keyword definition interface data; IV. determining whether to add a potential article obtained from an external URL associated with a data source from the list of data sources to the archive based on whether the potential article matches at least one subject matter channel from the list of subject matter channels; V. in response to receiving a content feed request from a user via a user client computer, sending, to the user client computer, graphical content feed data adapted to configure the user client computer to present a graphical content feed, the graphical content feed populated with articles selected from the archive; VI. in response to receiving a user controlled content feed source definition request from the user, modifying a user controlled content feed indicated as being created by the user by data stored in the one or more databases by modifying which data sources are included in the one or more data sources indicated by data stored in the one or more databases as being data sources to use when populating the user controlled content feed; and VII. in response to receiving a user controlled content feed name keyword definition request from the user, modifying the user controlled content feed indicated as being created by the user by data stored in the one or more databases by modifying which name keywords are included in the one or more name keywords indicated by data stored in the one or more databases as being name keywords to use when populating the user controlled content feed. 11. The system of claim 5 , determining whether to add the potential article to the archive based on whether the potential article matches at least one subject matter channel from the list of subject matter channels comprises determining whether the potential article: a. the potential article contains at least a threshold number of words and phrases associated with a name keyword from the list of name keywords; b. the potential article does not contain any exclude words or phrases associated with the name keyword from the list of name keywords; c. that potential article includes any must include words or phrases associated with the name keyword; and d. the name keyword and the data source associated with the external URL from which the potential article was obtained were assigned to at least one subject matter channel in common.
0.5
6,088,707
40
41
40. The method of claim 34, wherein the notification criteria further includes a numeric expression, wherein analyzing the retrieved data includes operating on a data value in the retrieved data with the numeric expression.
40. The method of claim 34, wherein the notification criteria further includes a numeric expression, wherein analyzing the retrieved data includes operating on a data value in the retrieved data with the numeric expression. 41. The method of claim 40, further comprising analyzing reference data associated with a previous copy of the document, including operating on a data value from the reference data with the numeric expression, wherein analyzing the retrieved data further includes comparing results of the operations on the data values from the retrieved and reference data to determine if the current copy of the document has been updated.
0.5
9,824,085
13
14
13. A computing system comprising: one or more processors; and one or more computer readable media maintaining instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: determining one or more locations amongst multiple different locations in a file system, the one or more locations storing one or more files that are associated with a domain of a user; generating, based at least in part on linguistic characteristics of the one or more files that are associated with the domain of the user, a personal language model for the user; receiving a Latin character string via an input method editor interface; determining, based at least in part on the personal language model, a first non-Latin character string that is associated with the Latin character string; determining, based at least in part on a general language model, a second non-Latin character string that is associated with the Latin character string; determining a first conversion probability for the first non-Latin character string; determining a second conversion probability for the second non-Latin character string; and determining that the second conversion probability is higher than the first conversion probability; and providing the second non-Latin character string based at least in part on the determining that the second conversion probability is higher than the first conversion probability.
13. A computing system comprising: one or more processors; and one or more computer readable media maintaining instructions that, when executed by the one or more processors, cause the one or more processors to perform acts comprising: determining one or more locations amongst multiple different locations in a file system, the one or more locations storing one or more files that are associated with a domain of a user; generating, based at least in part on linguistic characteristics of the one or more files that are associated with the domain of the user, a personal language model for the user; receiving a Latin character string via an input method editor interface; determining, based at least in part on the personal language model, a first non-Latin character string that is associated with the Latin character string; determining, based at least in part on a general language model, a second non-Latin character string that is associated with the Latin character string; determining a first conversion probability for the first non-Latin character string; determining a second conversion probability for the second non-Latin character string; and determining that the second conversion probability is higher than the first conversion probability; and providing the second non-Latin character string based at least in part on the determining that the second conversion probability is higher than the first conversion probability. 14. The computing system as recited in claim 13 , wherein the one or more locations are identified by the user via a location selection interface as locations that contain content specific to the domain of the user, and the domain of the user is associated with at least one of a profession of the user or interests of the user.
0.5
9,373,029
1
11
1. A computer-implemented method for utilizing invisible junction features for performing an action, the method comprising: receiving, with one or more processors, an input image; detecting, with the one or more processors, a location for each of the invisible junction features in a skeleton by applying a distance transformation to a binary image of the input image; determining, with the one or more processors, a region surrounding each of the invisible junction features based on the skeleton, the region including pixels from one or more characters of the input image and the location for each of the invisible junction features being a center of the region; recognizing, with the one or more processors, an electronic document corresponding to the input image using the location for each of the invisible junction features and the region surrounding each of the invisible junction features; and performing, with the one or more processors, the action related to the electronic document in response to recognizing the electronic document.
1. A computer-implemented method for utilizing invisible junction features for performing an action, the method comprising: receiving, with one or more processors, an input image; detecting, with the one or more processors, a location for each of the invisible junction features in a skeleton by applying a distance transformation to a binary image of the input image; determining, with the one or more processors, a region surrounding each of the invisible junction features based on the skeleton, the region including pixels from one or more characters of the input image and the location for each of the invisible junction features being a center of the region; recognizing, with the one or more processors, an electronic document corresponding to the input image using the location for each of the invisible junction features and the region surrounding each of the invisible junction features; and performing, with the one or more processors, the action related to the electronic document in response to recognizing the electronic document. 11. The method of claim 1 , wherein performing the action comprises printing the electronic document.
0.880896
7,532,759
1
4
1. A method of selecting a sub-set of image elements of a digital image based on a visual attribute of the image elements, the method including the steps of: using a database for providing a set of lexical classifiers that characterize said visual attribute; using a processor for selecting a lexical classifier from said set of lexical classifiers as a reference lexical classifier; determining a lexical classifier for each of said image elements; comparing the lexical classifier associated with each of said image elements with the reference lexical classifier; and selecting an image element as part of said sub-set of image elements if the lexical classifier of said image element corresponds to the reference lexical classifier.
1. A method of selecting a sub-set of image elements of a digital image based on a visual attribute of the image elements, the method including the steps of: using a database for providing a set of lexical classifiers that characterize said visual attribute; using a processor for selecting a lexical classifier from said set of lexical classifiers as a reference lexical classifier; determining a lexical classifier for each of said image elements; comparing the lexical classifier associated with each of said image elements with the reference lexical classifier; and selecting an image element as part of said sub-set of image elements if the lexical classifier of said image element corresponds to the reference lexical classifier. 4. The method of claim 1 , wherein the image element is an image vector.
0.900277
8,515,739
1
2
1. A method performed by a specifically programmed computer system for tracking statistical sentiment associated with an entity over time, the method comprising: (a) inputting a first plurality of texts associated with the entity from a first time period; (b) determining, using the specifically programmed computer system, a first entity statistical sentiment for the first plurality of texts based on terms in the sentiment lexicon which are associated with text corresponding to the entity in the first plurality of texts; (c) ranking the entity in comparison to other entities based on the first entity statistical sentiment and statistical sentiment of the other entities for the first time period to obtain an first entity score for the first time period; (d) repeating steps (a) through (c) for at least a second time period different from the first time period to obtain a second entity score for the second time period; and (e) smoothing the second entity score based on the first entity score.
1. A method performed by a specifically programmed computer system for tracking statistical sentiment associated with an entity over time, the method comprising: (a) inputting a first plurality of texts associated with the entity from a first time period; (b) determining, using the specifically programmed computer system, a first entity statistical sentiment for the first plurality of texts based on terms in the sentiment lexicon which are associated with text corresponding to the entity in the first plurality of texts; (c) ranking the entity in comparison to other entities based on the first entity statistical sentiment and statistical sentiment of the other entities for the first time period to obtain an first entity score for the first time period; (d) repeating steps (a) through (c) for at least a second time period different from the first time period to obtain a second entity score for the second time period; and (e) smoothing the second entity score based on the first entity score. 2. The method of claim 1 , wherein step (e) further includes smoothing the second entity score based on a frequency of occurrence of the text corresponding to the entity in the first plurality of texts.
0.5
7,809,561
4
5
4. The method for verification of speaker authentication according to claim 2 , wherein said parameter is a parameter dependent on said speaker template.
4. The method for verification of speaker authentication according to claim 2 , wherein said parameter is a parameter dependent on said speaker template. 5. The method for verification of speaker authentication according to claim 4 , wherein said parameter dependent on said speaker template is said discriminating threshold.
0.5
7,979,417
15
17
15. A computer-program product, comprising: a computer readable storage medium storing one or more programs to be executed by a computer system, the one or more programs comprising: instructions to generate a link tag in a document, the link tag including a location value and one or more information pairs that are distinct from the location value, wherein a respective information pair has a respective parameter and a corresponding parameter value; and instructions to embed the link tag in the document; wherein the value in the embedded link tag specifies a method of processing content by a web crawler so as to modify information, associated with the content, that is being added to one or more databases used by a search engine, wherein the content to be processed is specified by the location value of the embedded link tag and the method of processing is in accordance with the respective parameter value in one or more of the one or more information pairs of the embedded link tag.
15. A computer-program product, comprising: a computer readable storage medium storing one or more programs to be executed by a computer system, the one or more programs comprising: instructions to generate a link tag in a document, the link tag including a location value and one or more information pairs that are distinct from the location value, wherein a respective information pair has a respective parameter and a corresponding parameter value; and instructions to embed the link tag in the document; wherein the value in the embedded link tag specifies a method of processing content by a web crawler so as to modify information, associated with the content, that is being added to one or more databases used by a search engine, wherein the content to be processed is specified by the location value of the embedded link tag and the method of processing is in accordance with the respective parameter value in one or more of the one or more information pairs of the embedded link tag. 17. The computer-program product of claim 15 , wherein the method of processing content includes adjusting a weight specified by a respective information pair of the embedded link tag.
0.820313
9,679,251
25
26
25. The at least one server according to claim 17 , wherein the at least one hardware processor further: extends a selected measure from among the at least one measure based on a constraint stochastic independence process by: determining that the relationship of constraints κ is admissible and compatible with the selected measure; processing the selected measure subject to the relationship constraints κ to extend the selected measure by computing, for the selected measure, an average of probabilities of allowable sets in the sets of evidences U while taking relationship constraints κ into consideration, the allowable sets specified as stochastically independent by having cardinality equivalent to cardinality of the sets of evidences U and satisfying the relationship constraints κ ; and applying the extended selected measure to map new values to the sets of evidences E.
25. The at least one server according to claim 17 , wherein the at least one hardware processor further: extends a selected measure from among the at least one measure based on a constraint stochastic independence process by: determining that the relationship of constraints κ is admissible and compatible with the selected measure; processing the selected measure subject to the relationship constraints κ to extend the selected measure by computing, for the selected measure, an average of probabilities of allowable sets in the sets of evidences U while taking relationship constraints κ into consideration, the allowable sets specified as stochastically independent by having cardinality equivalent to cardinality of the sets of evidences U and satisfying the relationship constraints κ ; and applying the extended selected measure to map new values to the sets of evidences E. 26. The at least one server according to claim 25 , wherein the extended measure is free of any relationship constraints κ .
0.5
7,953,590
2
3
2. The method as recited in claim 1 , further comprising in response to speech from the first channel in the first language, outputting the speech from the first channel in the second language.
2. The method as recited in claim 1 , further comprising in response to speech from the first channel in the first language, outputting the speech from the first channel in the second language. 3. The method as recited in claim 2 , further comprising in response to speech from the second channel in the second language, outputting the speech from the second channel in the first language.
0.5
7,855,799
1
4
1. A method for defining rules for printing an electronic document implemented at least in part on a computing system, comprising: identifying a plurality of page sizes of pages in an electronic document; displaying a list of the plurality of page sizes comprised in the electronic document; receiving an input selecting a first of the plurality of page sizes; displaying a list of media types that may be associated with the selected first of the plurality of page sizes; receiving an input selecting a first of the listed media types; storing an association between the selected first of the plurality of page sizes and the selected first of the listed media types; receiving an input selecting a second of the plurality of page sizes; receiving an input selecting a second of the listed media types; storing an association between the selected second of the plurality of page sizes and the selected second of the listed media types; and creating instructions for printing the electronic document, said instructions comprising instructions for printing pages of the electronic document having the first of the plurality of page sizes on the selected first of the listed media types and for printing pages of the electronic document having the second of the plurality of page sizes on the selected second of the listed media types.
1. A method for defining rules for printing an electronic document implemented at least in part on a computing system, comprising: identifying a plurality of page sizes of pages in an electronic document; displaying a list of the plurality of page sizes comprised in the electronic document; receiving an input selecting a first of the plurality of page sizes; displaying a list of media types that may be associated with the selected first of the plurality of page sizes; receiving an input selecting a first of the listed media types; storing an association between the selected first of the plurality of page sizes and the selected first of the listed media types; receiving an input selecting a second of the plurality of page sizes; receiving an input selecting a second of the listed media types; storing an association between the selected second of the plurality of page sizes and the selected second of the listed media types; and creating instructions for printing the electronic document, said instructions comprising instructions for printing pages of the electronic document having the first of the plurality of page sizes on the selected first of the listed media types and for printing pages of the electronic document having the second of the plurality of page sizes on the selected second of the listed media types. 4. The method of claim 1 , further comprising: receiving an input selecting a specific page comprised in the electronic document, said specific page having the first of the plurality of page sizes; receiving an input requesting to identify an insertion sheet for the specific page; receiving an input identifying a media type to be inserted adjacent to the specific page; storing an association between the specific page and the media type to be inserted adjacent to the specific page.
0.762022
9,177,549
14
18
14. A system comprising: one or more processors; memory; and machine-readable instructions stored in the memory, that upon execution by the one or more processors cause the system to carry out functions including: implementing an output hidden Markov model (HMM) based speech features generator, wherein the output HMM based speech features generator comprises a first configuration of output HMM state models, each of the output HMM state models having a set of generator-model functions, and wherein the implemented output HMM based speech features generator is trained using speech signals of an output speaker speaking an output language; implementing an auxiliary HMM based speech features generator, wherein the auxiliary HMM based speech features generator comprises a second configuration of auxiliary HMM state models, each of the auxiliary HMM state models having a set of generator-model functions, and wherein the implemented auxiliary HMM based speech features generator is trained using speech signals of an auxiliary speaker speaking an input language; implementing a chimaera HMM based speech features generator that is the same as the output HMM based speech features generator, but wherein (i) the set of generator-model functions of each given output HMM state model of the chimaera HMM based speech features generator is replaced with a particular set of generator-model functions from among the auxiliary HMM state models of the second configuration that most closely matches the set of generator-model functions of the given output HMM, (ii) fundamental frequency (F0) statistics of the chimaera HMM based speech features generator are speech-adapted using an F0 transform that speech-adapts F0 statistics of the output HMM based speech features generator to match F0 statistics of the auxiliary HMM based speech features generator, and (iii) duration statistics of the chimaera HMM based speech features generator are speech-adapted using a duration transform that speech-adapts duration statistics of the output HMM based speech features generator to match duration statistics of the auxiliary HMM based speech features generator.
14. A system comprising: one or more processors; memory; and machine-readable instructions stored in the memory, that upon execution by the one or more processors cause the system to carry out functions including: implementing an output hidden Markov model (HMM) based speech features generator, wherein the output HMM based speech features generator comprises a first configuration of output HMM state models, each of the output HMM state models having a set of generator-model functions, and wherein the implemented output HMM based speech features generator is trained using speech signals of an output speaker speaking an output language; implementing an auxiliary HMM based speech features generator, wherein the auxiliary HMM based speech features generator comprises a second configuration of auxiliary HMM state models, each of the auxiliary HMM state models having a set of generator-model functions, and wherein the implemented auxiliary HMM based speech features generator is trained using speech signals of an auxiliary speaker speaking an input language; implementing a chimaera HMM based speech features generator that is the same as the output HMM based speech features generator, but wherein (i) the set of generator-model functions of each given output HMM state model of the chimaera HMM based speech features generator is replaced with a particular set of generator-model functions from among the auxiliary HMM state models of the second configuration that most closely matches the set of generator-model functions of the given output HMM, (ii) fundamental frequency (F0) statistics of the chimaera HMM based speech features generator are speech-adapted using an F0 transform that speech-adapts F0 statistics of the output HMM based speech features generator to match F0 statistics of the auxiliary HMM based speech features generator, and (iii) duration statistics of the chimaera HMM based speech features generator are speech-adapted using a duration transform that speech-adapts duration statistics of the output HMM based speech features generator to match duration statistics of the auxiliary HMM based speech features generator. 18. The system of claim 14 , wherein the input language and the output language are different.
0.969201
6,055,495
10
12
10. A method of speech segmentation comprising: processing speech data so as to detect pauses; forming speech block boundaries at a selected subset of the pauses, selection being based on a preselected target speech block length, said selection accomplished by dividing the total duration of the speech data in a file by the target speech block length to derive a desired pause number n, and detecting the n most significant pauses in that file and forming speech block boundaries at these n pauses in the speech data.
10. A method of speech segmentation comprising: processing speech data so as to detect pauses; forming speech block boundaries at a selected subset of the pauses, selection being based on a preselected target speech block length, said selection accomplished by dividing the total duration of the speech data in a file by the target speech block length to derive a desired pause number n, and detecting the n most significant pauses in that file and forming speech block boundaries at these n pauses in the speech data. 12. A method according to claim 10 wherein the significance of a pause is inversely proportional to the energy of the pause.
0.5
9,990,924
1
2
1. A speech interaction method, comprising: acquiring, by a speech interaction apparatus, speech data of a user; presetting, by the speech interaction apparatus, a user attribute, wherein the user attribute comprises at least a gender attribute and an age attribute; presetting, by the speech interaction apparatus, multiple vocabularies corresponding to the gender attribute and multiple vocabularies corresponding to the age attribute; performing, by the speech interaction apparatus, user attribute recognition on the speech data to obtain a first user attribute recognition result, wherein the user attribute is used to represent a user identity; performing, by the speech interaction apparatus, content recognition on the speech data to obtain a content recognition result of the speech data; and performing, by the speech interaction apparatus, a corresponding operation according to at least the first user attribute recognition result and the content recognition result, so as to respond to the speech data, wherein the performing a corresponding operation according to at least the first user attribute recognition result and the content recognition result comprises: determining, by the speech interaction apparatus, vocabulary content corresponding to the first user attribute recognition result by searching, in a preset correspondence between the gender attribute and a vocabulary and a preset correspondence between the age attribute and a vocabulary, for a vocabulary corresponding to the first user attribute recognition result, and using a found vocabulary as the vocabulary content corresponding to the first user attribute recognition result.
1. A speech interaction method, comprising: acquiring, by a speech interaction apparatus, speech data of a user; presetting, by the speech interaction apparatus, a user attribute, wherein the user attribute comprises at least a gender attribute and an age attribute; presetting, by the speech interaction apparatus, multiple vocabularies corresponding to the gender attribute and multiple vocabularies corresponding to the age attribute; performing, by the speech interaction apparatus, user attribute recognition on the speech data to obtain a first user attribute recognition result, wherein the user attribute is used to represent a user identity; performing, by the speech interaction apparatus, content recognition on the speech data to obtain a content recognition result of the speech data; and performing, by the speech interaction apparatus, a corresponding operation according to at least the first user attribute recognition result and the content recognition result, so as to respond to the speech data, wherein the performing a corresponding operation according to at least the first user attribute recognition result and the content recognition result comprises: determining, by the speech interaction apparatus, vocabulary content corresponding to the first user attribute recognition result by searching, in a preset correspondence between the gender attribute and a vocabulary and a preset correspondence between the age attribute and a vocabulary, for a vocabulary corresponding to the first user attribute recognition result, and using a found vocabulary as the vocabulary content corresponding to the first user attribute recognition result. 2. The method according to claim 1 , further comprising: collecting, by the speech interaction apparatus, a user image; and when it is detected that a number of people in the user image is a preset value, performing, by the speech interaction apparatus, the step of performing user attribute recognition on the speech data.
0.841356
6,107,945
4
7
4. A character detection circuit for determining a character value for a signal having a frequency, said character detection circuit comprising: a delay element having an input for receiving sample values derived from the signal and an output adapted for providing a sample value received on said input after a predetermined period of time; and a subtractor having a first input coupled to said output of said delay element, a second input coupled to said input of said delay element, and an output adapted for providing a difference between a value provided to said first input and a value provided to said second input.
4. A character detection circuit for determining a character value for a signal having a frequency, said character detection circuit comprising: a delay element having an input for receiving sample values derived from the signal and an output adapted for providing a sample value received on said input after a predetermined period of time; and a subtractor having a first input coupled to said output of said delay element, a second input coupled to said input of said delay element, and an output adapted for providing a difference between a value provided to said first input and a value provided to said second input. 7. The character detection circuit of claim 4, wherein said delay element includes: a shift register having an input forming the input of said delay element and a first output for providing a value received on the input of said shift register after a first predetermined period of time, wherein said shift register further includes a second output for providing a value received on the input of said shift register after a second predetermined period of time, said delay element further including: a multiplexer having a first input coupled to the first output of said shift register, a second input coupled to the second output of said shift register, a select input, and an output for providing said sample value received on said input of said delay element after a predetermined period of time in response to a signal on the select input.
0.5
10,032,230
9
13
9. The method of claim 1 wherein determining the at least one weighted discrepancy parameter includes determining a first plurality of business rules that are relevant to the transaction and determining a fraud metric for each of the first plurality of business rules based on the set of transactions, and determining the at least one action parameter includes selecting one of the first plurality of business rules based on the fraud metric of each rule and defining the at least one action parameter based on the business rule selected.
9. The method of claim 1 wherein determining the at least one weighted discrepancy parameter includes determining a first plurality of business rules that are relevant to the transaction and determining a fraud metric for each of the first plurality of business rules based on the set of transactions, and determining the at least one action parameter includes selecting one of the first plurality of business rules based on the fraud metric of each rule and defining the at least one action parameter based on the business rule selected. 13. The method of claim 9 wherein determining the at least one weighted discrepancy parameter includes determining a fare category violated based on the application of a business rule to the set of transactions.
0.660772
8,484,035
1
6
1. A method of altering a selected real-time social signaling characteristic of an input audio voice signal, which method comprises processing in real-time said input audio voice signal in to modify one or more measurable parameters of said input audio voice signal to produce a modified output audio voice signal in which said selected real-time social signaling characteristic is modified, wherein said input audio voice signal is not generated by a speech synthesizer.
1. A method of altering a selected real-time social signaling characteristic of an input audio voice signal, which method comprises processing in real-time said input audio voice signal in to modify one or more measurable parameters of said input audio voice signal to produce a modified output audio voice signal in which said selected real-time social signaling characteristic is modified, wherein said input audio voice signal is not generated by a speech synthesizer. 6. The method of claim 1 , wherein the input audio voice signal is a live signal.
0.791237
9,264,784
1
3
1. A method comprising: obtaining, by a recommendation engine device, program historical data associated with users that each receive one or more programs via one or more channels of a program delivery network that provides a program service to which the users belong; obtaining, by the recommendation engine device, social network data associated with the users from social network sites to which the users belong, wherein the social network data includes a social graph, communication data pertaining to communications between the users via a communication network that provides a communication service to which the users belong, wherein the communication service includes a mobile phone service and a messaging service, and the communication data includes mobile phone calls, and user profile information pertaining to the users; calculating based on the social network data, the communication data, and the user profile information, by the recommendation engine device, a social similarity value that indicates a social similarity between one of the users and other users; calculating based on the program historical data, by the recommendation engine device, a channel-interest similarity value that indicates a common interest between the one of the users and the other users in relation to the one or more channels used by the users to receive the one or more programs; calculating based on the social similarity value and the channel-interest similarity value, by the recommendation engine device, a similarity index value that indicates a similarity between the one of the users and the other users; calculating based on the program historical data, by the recommendation engine device, a program regularity value, for each program, that indicates a regularity of consumption of each program over a time period; calculating based on the program regularity value, by the recommendation engine device, a program weight value, for each program, that indicates a priority value; calculating based on the program historical data, by the recommendation engine device, a stay-time, for each channel, that indicates a time period each of the users remained on each channel; calculating based on each program weight value, each stay-time, and each similarity index value, by the recommendation engine device, a channel weight for each channel; and selecting based on each channel weight, by the recommendation engine device, one or more channels to recommend to at least one of the users.
1. A method comprising: obtaining, by a recommendation engine device, program historical data associated with users that each receive one or more programs via one or more channels of a program delivery network that provides a program service to which the users belong; obtaining, by the recommendation engine device, social network data associated with the users from social network sites to which the users belong, wherein the social network data includes a social graph, communication data pertaining to communications between the users via a communication network that provides a communication service to which the users belong, wherein the communication service includes a mobile phone service and a messaging service, and the communication data includes mobile phone calls, and user profile information pertaining to the users; calculating based on the social network data, the communication data, and the user profile information, by the recommendation engine device, a social similarity value that indicates a social similarity between one of the users and other users; calculating based on the program historical data, by the recommendation engine device, a channel-interest similarity value that indicates a common interest between the one of the users and the other users in relation to the one or more channels used by the users to receive the one or more programs; calculating based on the social similarity value and the channel-interest similarity value, by the recommendation engine device, a similarity index value that indicates a similarity between the one of the users and the other users; calculating based on the program historical data, by the recommendation engine device, a program regularity value, for each program, that indicates a regularity of consumption of each program over a time period; calculating based on the program regularity value, by the recommendation engine device, a program weight value, for each program, that indicates a priority value; calculating based on the program historical data, by the recommendation engine device, a stay-time, for each channel, that indicates a time period each of the users remained on each channel; calculating based on each program weight value, each stay-time, and each similarity index value, by the recommendation engine device, a channel weight for each channel; and selecting based on each channel weight, by the recommendation engine device, one or more channels to recommend to at least one of the users. 3. The method of claim 1 , wherein the calculating of the channel-interest similarity value is based on an expression: S 2 ⁡ ( U 1 ⁢ U 2 ) = sizeof ⁡ ( C 1 ) ⁢ ∑ i ∈ c 1 ⁢ ( Δ 1 , i - Δ 1 _ ) ⁢ ( Δ 2 , i - Δ 2 _ ) ∑ i ∈ c 1 ⁢ ( Δ 1 , i - Δ 1 _ ) 2 ⁢ ∑ i ∈ c 1 ⁢ ( Δ 2 , i - Δ 2 _ ) 2 , wherein C 1 is a common program historical data between the one of the users and one of the other users, U 1 is the one of the users, U 2 is one of the other users, Δ 1,i is a time U 1 stays with program i, Δ 2,i is a time U 2 stays with program i, Δ 1 is an average time U 1 stays with all of the programs, Δ 2 is an average time U 2 stays with all of the programs, and S 2 is the channel-interest similarity value, and wherein the common program historical data includes channels digested and times digested.
0.5
7,926,031
3
4
3. The Non-Transitory machine-readable medium as claimed in claim 1 , wherein the statements are defined using a semantic web format.
3. The Non-Transitory machine-readable medium as claimed in claim 1 , wherein the statements are defined using a semantic web format. 4. The Non-Transitory machine-readable medium as claimed in claim 3 , wherein the semantic web format comprises one of Resource Description Framework Schema (RDFS) and Web Otology Language (OWL).
0.5
9,269,009
5
11
5. A computer-implemented method, comprising: under the control of one or more computer systems configured with executable instructions, acquiring, using a first camera of a computing device, at least one first image; acquiring, using a second camera of the computing device, information corresponding to an environment of the computing device, wherein the second camera faces a different direction than the first camera; determine one or more conditions of the environment using the information acquired by the second camera of the computing device; determining at least one parameter associated with the one or more conditions; performing at least one preprocessing operation associated with the at least one first image, wherein the at least one preprocessing operation includes binarizing at least a portion of each of the at least one first image based upon the one or more conditions; and causing the at least one first image to be processed using an optical character recognition (OCR) engine in electronic communication with at least one of the one or more computer systems, wherein (i) the at least one parameter is used when performing the preprocessing operation or (ii) the at least one parameter is used by the OCR engine.
5. A computer-implemented method, comprising: under the control of one or more computer systems configured with executable instructions, acquiring, using a first camera of a computing device, at least one first image; acquiring, using a second camera of the computing device, information corresponding to an environment of the computing device, wherein the second camera faces a different direction than the first camera; determine one or more conditions of the environment using the information acquired by the second camera of the computing device; determining at least one parameter associated with the one or more conditions; performing at least one preprocessing operation associated with the at least one first image, wherein the at least one preprocessing operation includes binarizing at least a portion of each of the at least one first image based upon the one or more conditions; and causing the at least one first image to be processed using an optical character recognition (OCR) engine in electronic communication with at least one of the one or more computer systems, wherein (i) the at least one parameter is used when performing the preprocessing operation or (ii) the at least one parameter is used by the OCR engine. 11. The computer-implemented method of claim 5 , wherein the information corresponding to the environment captured by the second camera is a representation of a face and the at least one parameter indicates a facial expression.
0.826718
8,126,866
14
17
14. A method performed by a computer system, the method comprising: determining that a first document includes one or more links that lead to scumware; determining that a second document includes scumware; storing, in a storage device associated with the computer system, first data indicating that the first document includes one or more links that lead to scumware; storing, in the storage device, second data indicating that the second document includes scumware; providing, by a processor of the computer system and for display at a client device, a link to the first document, a link to the second document, a first indication that is based on the first data and indicates that the first document includes one or more links that lead to scumware, a second indication that is based on the second data and indicates that the second document includes scumware, where the first indication is different than the second indication, and a browser toolbar, where the browser toolbar includes one or more visual indicators that provide scumware-related information; receiving, by a processor of the computer system, a request from the toolbar for scumware-related information associated with the first document when the client device accesses the first document; and providing, by a processor of the computer system and in response to receiving the request, the first data to the client device, where the toolbar displays, based on the first data, a visual indicator of a shortest number of links from the first document to another document associated with scumware, where the number is more than one.
14. A method performed by a computer system, the method comprising: determining that a first document includes one or more links that lead to scumware; determining that a second document includes scumware; storing, in a storage device associated with the computer system, first data indicating that the first document includes one or more links that lead to scumware; storing, in the storage device, second data indicating that the second document includes scumware; providing, by a processor of the computer system and for display at a client device, a link to the first document, a link to the second document, a first indication that is based on the first data and indicates that the first document includes one or more links that lead to scumware, a second indication that is based on the second data and indicates that the second document includes scumware, where the first indication is different than the second indication, and a browser toolbar, where the browser toolbar includes one or more visual indicators that provide scumware-related information; receiving, by a processor of the computer system, a request from the toolbar for scumware-related information associated with the first document when the client device accesses the first document; and providing, by a processor of the computer system and in response to receiving the request, the first data to the client device, where the toolbar displays, based on the first data, a visual indicator of a shortest number of links from the first document to another document associated with scumware, where the number is more than one. 17. The method of claim 14 , where the scumware-related information includes information relating to at least one of a virus, a worm, a Trojan horse, spyware, adware, or malware.
0.86072
8,881,074
1
4
1. A computer tool for rewriting hardware design language, HDL, code, wherein: said tool is arranged for receiving an original version of a HDL code expressing a hardware design of a digital circuit and comprising means for generating a representation of the syntax of said received original version of the HDL code, said representation containing a plurality of nodes, said tool further comprising: means for determining modifications to said representation of said syntax whereby at least one node is added to or removed from said representation, and computation means for generating a modified HDL code by computing a set of textual changes according to said modifications to said representation of said syntax, and applying said textual changes to said original version of said received HDL code.
1. A computer tool for rewriting hardware design language, HDL, code, wherein: said tool is arranged for receiving an original version of a HDL code expressing a hardware design of a digital circuit and comprising means for generating a representation of the syntax of said received original version of the HDL code, said representation containing a plurality of nodes, said tool further comprising: means for determining modifications to said representation of said syntax whereby at least one node is added to or removed from said representation, and computation means for generating a modified HDL code by computing a set of textual changes according to said modifications to said representation of said syntax, and applying said textual changes to said original version of said received HDL code. 4. The tool for rewriting HDL code according to claim 1 , wherein said means for generating a representation comprises a mechanism for recovering a syntax error.
0.831237
9,400,958
12
16
12. A system for causing display of information, comprising: at least one data store for storing data; one or more processors that, when operating in accordance with executable instructions of a computer-readable medium, are at least operable to: determine, based at least in part on the data, a policy violation; identify a plurality of semantic objects that cause the policy violation, the identified plurality of semantic objects including semantic objects of different semantic object types, the identified plurality of semantic objects representing data related to a business policy in an organization; compute a probability of occurrence of the policy violation in each semantic object of the identified plurality of semantic objects, the probability of occurrence of the policy violation comprising data that represents a relationship between a first state of a first semantic object of the identified plurality of semantic objects and a second state of a second semantic object of the identified plurality of semantic objects; generate a first graphical representation of the identified plurality of semantic objects based on the probability of occurrence of the policy violation; cause display of the first graphical representation of the identified plurality of semantic objects that cause the policy violation in an arrangement indicative of the relationship between at least the first semantic object and the second semantic object of the identified plurality of semantic objects; identify a semantic object as an origin of the policy violation in the plurality of semantic objects in the first graphical representation, the semantic object comprising a set of one or more workflows; identify at least one workflow from the set of one or more workflows related to the semantic object that cause the policy violation; cause the display of the identified one or more workflows related to the policy violation in a display interface of the first graphical representation; and cause the identified one or more workflows to be processed in accordance with an order of the arrangement of the identified plurality of semantic objects.
12. A system for causing display of information, comprising: at least one data store for storing data; one or more processors that, when operating in accordance with executable instructions of a computer-readable medium, are at least operable to: determine, based at least in part on the data, a policy violation; identify a plurality of semantic objects that cause the policy violation, the identified plurality of semantic objects including semantic objects of different semantic object types, the identified plurality of semantic objects representing data related to a business policy in an organization; compute a probability of occurrence of the policy violation in each semantic object of the identified plurality of semantic objects, the probability of occurrence of the policy violation comprising data that represents a relationship between a first state of a first semantic object of the identified plurality of semantic objects and a second state of a second semantic object of the identified plurality of semantic objects; generate a first graphical representation of the identified plurality of semantic objects based on the probability of occurrence of the policy violation; cause display of the first graphical representation of the identified plurality of semantic objects that cause the policy violation in an arrangement indicative of the relationship between at least the first semantic object and the second semantic object of the identified plurality of semantic objects; identify a semantic object as an origin of the policy violation in the plurality of semantic objects in the first graphical representation, the semantic object comprising a set of one or more workflows; identify at least one workflow from the set of one or more workflows related to the semantic object that cause the policy violation; cause the display of the identified one or more workflows related to the policy violation in a display interface of the first graphical representation; and cause the identified one or more workflows to be processed in accordance with an order of the arrangement of the identified plurality of semantic objects. 16. The system of claim 12 , wherein the one or more processors are further operable to: receive a selection of at least one of the identified plurality of semantic objects in the first graphical representation that cause the policy violation; and cause a display of a second graphical representation, the second graphical representation indicative of one or more second relationships between the selected semantic object and one or more pairs of semantic objects.
0.5
9,514,408
4
5
4. The method of claim 1 , further comprising: modifying existing fact templates or creating additional new fact templates upon a determination that facts found in the predetermined knowledge sources cannot be accommodated by existing fact templates.
4. The method of claim 1 , further comprising: modifying existing fact templates or creating additional new fact templates upon a determination that facts found in the predetermined knowledge sources cannot be accommodated by existing fact templates. 5. The method of claim 4 , wherein the ontology is modified to accept new fact types.
0.5
9,665,994
15
28
15. A method performed by a first computing system, the method comprising: receiving, from a second computing system, a message identifying a symptom of a first vehicle; and sending a repair tip to the second computing system, wherein the repair tip comprises: a first phrase describing a first procedure performed on a second vehicle that exhibited the symptom, wherein the first procedure performed on the second vehicle yielded a result insufficient to determine that a component of the second vehicle associated with the symptom is defective; and a second phrase describing a second procedure performed on a given vehicle, wherein the given vehicle is either (i) the second vehicle or (ii) a third vehicle that also exhibited the symptom, wherein the second procedure performed on the given vehicle yielded a result sufficient to determine that a component of the given vehicle associated with the symptom is defective, and wherein the component of the given vehicle is equivalent to the component of the second vehicle.
15. A method performed by a first computing system, the method comprising: receiving, from a second computing system, a message identifying a symptom of a first vehicle; and sending a repair tip to the second computing system, wherein the repair tip comprises: a first phrase describing a first procedure performed on a second vehicle that exhibited the symptom, wherein the first procedure performed on the second vehicle yielded a result insufficient to determine that a component of the second vehicle associated with the symptom is defective; and a second phrase describing a second procedure performed on a given vehicle, wherein the given vehicle is either (i) the second vehicle or (ii) a third vehicle that also exhibited the symptom, wherein the second procedure performed on the given vehicle yielded a result sufficient to determine that a component of the given vehicle associated with the symptom is defective, and wherein the component of the given vehicle is equivalent to the component of the second vehicle. 28. The method of claim 15 , wherein the message identifies at least one of a make, a model, or a year of manufacture of the first vehicle, the method further comprising: identifying a first plurality of phrases stored by the first computing system that are each associated with the at least one of the make, the model, or the year of manufacture of the first vehicle and the symptom of the first vehicle, wherein the first plurality of phrases includes the first phrase; and determining that the first phrase corresponds to at least a predetermined amount of repair records stored by the first computing system, wherein sending the repair tip to the second computing system comprises sending the first phrase based on determining that the first phrase corresponds to at least the predetermined amount of repair records stored by the first computing system.
0.581543
10,121,064
1
14
1. A behavioral classification system, comprising: a microprocessor; and memory containing a classification application; wherein the classification application directs the microprocessor to: identify at least a primary subject interacting with a secondary subject within a sequence of frames of image data comprising depth information; determine poses for at least the primary subject and the secondary subject within a plurality of frames from the sequence of frames of image data; extract a set of parameters describing the poses and movement of at least the primary and secondary subjects from the plurality of frames from the sequence of frames of image data; and detect a social behavior performed by at least the primary subject and involving at least the secondary subject, wherein the primary subject occludes at least a portion of the secondary subject, using a classifier trained to discriminate between a plurality of social behaviors based upon the set of parameters describing poses and movement of a plurality of subjects extracted from a plurality of frames of image data comprising depth information.
1. A behavioral classification system, comprising: a microprocessor; and memory containing a classification application; wherein the classification application directs the microprocessor to: identify at least a primary subject interacting with a secondary subject within a sequence of frames of image data comprising depth information; determine poses for at least the primary subject and the secondary subject within a plurality of frames from the sequence of frames of image data; extract a set of parameters describing the poses and movement of at least the primary and secondary subjects from the plurality of frames from the sequence of frames of image data; and detect a social behavior performed by at least the primary subject and involving at least the secondary subject, wherein the primary subject occludes at least a portion of the secondary subject, using a classifier trained to discriminate between a plurality of social behaviors based upon the set of parameters describing poses and movement of a plurality of subjects extracted from a plurality of frames of image data comprising depth information. 14. The behavioral classification system of claim 1 , wherein the classification application directs the microprocessor to identify at least a primary subject interacting with a secondary subject within a sequence of frames of image data comprising depth information by: performing background subtraction using a plurality of frames of image data; and performing segmentation of at least a primary subject and a secondary subject.
0.680535
5,559,898
29
31
29. The method of claim 28, wherein the vector elements in the input vector and the template vector have numerical values, and the sort is by numerical value.
29. The method of claim 28, wherein the vector elements in the input vector and the template vector have numerical values, and the sort is by numerical value. 31. The method of claim 29, wherein the numerical values indicate greyscale levels.
0.881089
7,873,183
6
7
6. The watermark embedding method according to claim 1 , wherein said document is an electronic document.
6. The watermark embedding method according to claim 1 , wherein said document is an electronic document. 7. The watermark embedding method according to claim 6 , wherein said document is a document in printer description language format, and wherein said watermark embedding method further comprises: before said step of obtaining the layout information, performing printer language analysis on the document in printer description language format, and separating a printer command and content of the electronic document itself for further processing; after said step of hiding the secret message sequence, reassembling the printer command and the content of the document embedded with the secret message sequence to generate a reassembled printer language document for printing.
0.5
9,000,887
13
16
13. An apparatus for communicating control information, comprising: a processing system configured to: determine a first movement of a first device wearable by a user based on a first set of data received from the first device by way of an antenna, wherein the first set of data relates to the first movement of the first device, wherein the first determined movement is used to create a first set of possibly performed gestures; determine a second movement of a second device wearable by the user based on a second set of data received from the second device by way of the antenna, wherein the second set of data relates to the second movement of the second device, wherein the first and second movements occur simultaneously, wherein the second determined movement is used to create a second set of possibly performed gestures, and wherein the second wearable device is separate from and not integrated with the first wearable device; and infer, from the first and second sets of possibly performed gestures, that the first movement is representative of an intended command and the second movement is not representative of the intended command; and a transmitter configured to transmit information based on the inference and wherein inferring that the first movement is representative of the intended command and the second movement is not representative of the intended command is based on the first and second sets of possibly performed gestures indicating that the first and second movements are in substantially the same direction.
13. An apparatus for communicating control information, comprising: a processing system configured to: determine a first movement of a first device wearable by a user based on a first set of data received from the first device by way of an antenna, wherein the first set of data relates to the first movement of the first device, wherein the first determined movement is used to create a first set of possibly performed gestures; determine a second movement of a second device wearable by the user based on a second set of data received from the second device by way of the antenna, wherein the second set of data relates to the second movement of the second device, wherein the first and second movements occur simultaneously, wherein the second determined movement is used to create a second set of possibly performed gestures, and wherein the second wearable device is separate from and not integrated with the first wearable device; and infer, from the first and second sets of possibly performed gestures, that the first movement is representative of an intended command and the second movement is not representative of the intended command; and a transmitter configured to transmit information based on the inference and wherein inferring that the first movement is representative of the intended command and the second movement is not representative of the intended command is based on the first and second sets of possibly performed gestures indicating that the first and second movements are in substantially the same direction. 16. The apparatus of claim 13 , wherein the processing system is further configured to determine the second movement as being gesture-related.
0.742754
9,463,386
8
10
8. The method of claim 1 , wherein the state machine module includes one or both of a client-located state machine client module or a server-located state machine server module.
8. The method of claim 1 , wherein the state machine module includes one or both of a client-located state machine client module or a server-located state machine server module. 10. The method of claim 8 , wherein executing the game engine module includes using one or more server-located processors, and wherein instantiating the state machine instance results from instantiating the server-located state machine server module.
0.5
8,370,119
7
11
7. The process of claim 1 , further comprising the process actions of: for each of the selected pages, identifying uniform resource locator (URL) tokens found on the selected page, wherein a URL token comprises a combination of a substring of a URL and its position in the overall URL string, adding the identified URL tokens to a URL tokens vocabulary list; and modeling the website design patterns based on the occurrences of URL tokens in pages of the website that are listed in the URL tokens vocabulary list.
7. The process of claim 1 , further comprising the process actions of: for each of the selected pages, identifying uniform resource locator (URL) tokens found on the selected page, wherein a URL token comprises a combination of a substring of a URL and its position in the overall URL string, adding the identified URL tokens to a URL tokens vocabulary list; and modeling the website design patterns based on the occurrences of URL tokens in pages of the website that are listed in the URL tokens vocabulary list. 11. The process of claim 7 , wherein the process action of modeling the website design patterns based on the occurrences of URL tokens, comprises an action of modeling the website design patterns using a Special Word with Background (SWB) modeling technique.
0.583871
9,442,918
2
3
2. The method of claim 1 , further comprising: determining a set of relevancy scores for the subset of perspective data associated with the common feature; establishing a set of relevant perspective data from the subset of perspective data, the set of relevant perspective data having relevancy scores outside of a relevancy threshold; and associating the set of relevant perspective data with the second item.
2. The method of claim 1 , further comprising: determining a set of relevancy scores for the subset of perspective data associated with the common feature; establishing a set of relevant perspective data from the subset of perspective data, the set of relevant perspective data having relevancy scores outside of a relevancy threshold; and associating the set of relevant perspective data with the second item. 3. The method of claim 2 , wherein: determining the set of relevancy scores for the subset of perspective data further includes: parsing, using a natural language processing technique configured to analyze semantic and syntactic content, the subset of perspective data; calculating, based on syntactic content, semantic content, and metadata for the subset of perspective data, the set of relevancy scores; and assigning the set of relevancy scores to the subset of perspective data.
0.5
9,639,617
16
17
16. The system as claimed in claim 11 wherein the control unit is configured to: execute a database module, a rank module, a category identification module, and a periodic update module from time to time.
16. The system as claimed in claim 11 wherein the control unit is configured to: execute a database module, a rank module, a category identification module, and a periodic update module from time to time. 17. The system as claimed in claim 16 wherein the control unit is configured to compare the two of the plurality of search query to each other to identify a distinct search query.
0.5
7,647,219
6
7
6. The apparatus of claim 4 , wherein the transition-graph test model further comprises: a user-customizable transition interface that returns a test event associated with a transition object; a user-customizable transition interface that performs a transition for a transition object; and a user-customizable transition interface that prints details of a transition object.
6. The apparatus of claim 4 , wherein the transition-graph test model further comprises: a user-customizable transition interface that returns a test event associated with a transition object; a user-customizable transition interface that performs a transition for a transition object; and a user-customizable transition interface that prints details of a transition object. 7. The apparatus of claim 6 , wherein the transition graph test model further comprises: a user-customizable parsing interface that checks if there is a recognized and valid transition in an argument list at a specified index and if there is one, advances the index to an end of a transition description, and returns the transition object and otherwise keeps the index in place and returns null.
0.5
8,352,412
1
8
1. A system for transforming domain specific unstructured data into structured data, said system comprising: a digital processing apparatus executing programs of machine-readable instructions: an intake platform operating through said digital processing apparatus, said intake platform comprising: an intake acquisition module acquiring structured data, semi-structured data, and associated metadata related to a domain and problem of interest, said intake acquisition module developing baseline data related to said domain and problem of interest from said structured data, semi-structured data, and associated metadata; an intake pre-processing module receiving structured and unstructured content related to said domain and problem of interest; an intake language module providing word equivalents to words within said structured and unstructured content according to said domain and problem of interest; an intake application descriptors module providing definitions of key descriptors within said domain and problem of interest; and an intake adjudication module processing said structured and unstructured content using said baseline data, said word equivalents, and said key descriptors to develop a workflow for classifying said structured and unstructured content for said domain and problem of interest; and a control platform comprising: a control data acquisition module identifying data acquisition and data analysis errors relating to said receiving of said structured and unstructured content and said classifying of said structured and unstructured content; a control data consistency collator analyzing states of said data within said workflow to identify state errors; a control auditor monitoring sources of said structured and unstructured content and monitoring said data within said workflow to identify source and processing errors; a control event definition and policy repository maintaining policies for resolving said data acquisition and data analysis errors, said state errors, and said source and processing errors; and an error resolver resolving said data acquisition and data analysis errors, said state errors, and said source and processing errors according to said policies; and an output operating through said digital processing apparatus, said intake output outputting results of said workflow, said results of said workflow comprising said structured and unstructured content classified into structured data enabled to be used in data analytics.
1. A system for transforming domain specific unstructured data into structured data, said system comprising: a digital processing apparatus executing programs of machine-readable instructions: an intake platform operating through said digital processing apparatus, said intake platform comprising: an intake acquisition module acquiring structured data, semi-structured data, and associated metadata related to a domain and problem of interest, said intake acquisition module developing baseline data related to said domain and problem of interest from said structured data, semi-structured data, and associated metadata; an intake pre-processing module receiving structured and unstructured content related to said domain and problem of interest; an intake language module providing word equivalents to words within said structured and unstructured content according to said domain and problem of interest; an intake application descriptors module providing definitions of key descriptors within said domain and problem of interest; and an intake adjudication module processing said structured and unstructured content using said baseline data, said word equivalents, and said key descriptors to develop a workflow for classifying said structured and unstructured content for said domain and problem of interest; and a control platform comprising: a control data acquisition module identifying data acquisition and data analysis errors relating to said receiving of said structured and unstructured content and said classifying of said structured and unstructured content; a control data consistency collator analyzing states of said data within said workflow to identify state errors; a control auditor monitoring sources of said structured and unstructured content and monitoring said data within said workflow to identify source and processing errors; a control event definition and policy repository maintaining policies for resolving said data acquisition and data analysis errors, said state errors, and said source and processing errors; and an error resolver resolving said data acquisition and data analysis errors, said state errors, and said source and processing errors according to said policies; and an output operating through said digital processing apparatus, said intake output outputting results of said workflow, said results of said workflow comprising said structured and unstructured content classified into structured data enabled to be used in data analytics. 8. The system of claim 1 , wherein said error resolver further comprises a component feedback component that executes advice of said control auditor based on issues having no solutions.
0.850806
9,858,264
12
13
12. A non-transitory computer readable medium encoded with instructions that, when executed by one or more processors, causes a text-to-imagery conversion process to be invoked, the process comprising: receiving a text sentence comprising a plurality of words, wherein the text sentence includes a verb phrase, and wherein the text sentence is associated with a plurality of semantic roles; querying an image database for a single image that captures each of the plurality of semantic roles; responsive to determining that no single image in the image database captures each of the plurality of semantic roles, breaking the text sentence into multiple sentence fragments, a particular one of which is associated with one or more fragmented semantic roles; and querying the image database for an image that captures each of the one or more fragmented semantic roles.
12. A non-transitory computer readable medium encoded with instructions that, when executed by one or more processors, causes a text-to-imagery conversion process to be invoked, the process comprising: receiving a text sentence comprising a plurality of words, wherein the text sentence includes a verb phrase, and wherein the text sentence is associated with a plurality of semantic roles; querying an image database for a single image that captures each of the plurality of semantic roles; responsive to determining that no single image in the image database captures each of the plurality of semantic roles, breaking the text sentence into multiple sentence fragments, a particular one of which is associated with one or more fragmented semantic roles; and querying the image database for an image that captures each of the one or more fragmented semantic roles. 13. The non-transitory computer readable medium of claim 12 , wherein: the verb phrase comprises a verb and an adjunct; the verb is present in a first fragmented semantic role; and the adjunct is present in a second fragmented semantic role.
0.751546
8,874,614
3
4
3. A method comprising: creating a definition for a first field class; creating a definition for a second field class, wherein the second field class includes an ontological context rule, and wherein the ontological context rule uses the first field class; and generating object-oriented code that includes a definition for a business class that includes a second field and a first field, wherein the first field is within the reachable ontological context of the second field, wherein the first field is related to the first field definition, and wherein the second field is related to the second field definition.
3. A method comprising: creating a definition for a first field class; creating a definition for a second field class, wherein the second field class includes an ontological context rule, and wherein the ontological context rule uses the first field class; and generating object-oriented code that includes a definition for a business class that includes a second field and a first field, wherein the first field is within the reachable ontological context of the second field, wherein the first field is related to the first field definition, and wherein the second field is related to the second field definition. 4. The method of claim 3 further comprising: receiving a pattern language code segment.
0.5
7,668,791
5
6
5. The method of claim 4 , wherein applying the excluding rules comprises applying a first set of rules for syntactic phrases that have a role of subjects and applying a second set of rules for syntactic phrases that have a role of objects.
5. The method of claim 4 , wherein applying the excluding rules comprises applying a first set of rules for syntactic phrases that have a role of subjects and applying a second set of rules for syntactic phrases that have a role of objects. 6. The method of claim 5 , wherein applying the first set of rules comprises excluding noun phrases having an opinion or biased modifier of subjects or objects.
0.723183
9,607,046
6
8
6. The method of claim 5 , wherein: respective query intents comprise at least one query slot; and modifying the query state comprises: associating respective query slots of the selected query intent with at least one query term.
6. The method of claim 5 , wherein: respective query intents comprise at least one query slot; and modifying the query state comprises: associating respective query slots of the selected query intent with at least one query term. 8. The method of claim 6 , wherein the instructions are further configured to: upon identifying at least one unfilled query slot, request a query term for respective unfilled query slots; and upon receiving from the user a query term for an unfilled query slot, associate the query term with the unfilled query slot.
0.5
8,589,778
6
7
6. The system of claim 5 , further comprising a context augmenting module configured to search the messages for common references, and to augment the context of the common references by linking related content.
6. The system of claim 5 , further comprising a context augmenting module configured to search the messages for common references, and to augment the context of the common references by linking related content. 7. The system of claim 6 , wherein the context augmenting module is further configured to hyperlink the related content.
0.5
9,690,872
10
11
10. The method of claim 1 , further comprising generating one or more search results corresponding to the first structured query, wherein each search result corresponds to an object associated with the online social network that is connected to at least one of the referenced objects in the first structured query.
10. The method of claim 1 , further comprising generating one or more search results corresponding to the first structured query, wherein each search result corresponds to an object associated with the online social network that is connected to at least one of the referenced objects in the first structured query. 11. The method of claim 10 , wherein each search result comprises one or more snippets, each snippet comprising contextual information about the object corresponding to the search result.
0.825234
7,672,007
31
32
31. The hardware component of an automated digitizing system configured to route information identified by content instructions in a document file on a computer to a potential plurality of application programs according to customizable transmission format instructions, said transmission format instructions being customized to requirements of each application program receiving said information.
31. The hardware component of an automated digitizing system configured to route information identified by content instructions in a document file on a computer to a potential plurality of application programs according to customizable transmission format instructions, said transmission format instructions being customized to requirements of each application program receiving said information. 32. The hardware component of an automated digitizing system as claimed in claim 31 , in which at least one of said application programs is a digital archiving program.
0.708333
7,730,394
9
10
9. A word processor system for providing a word processor document comprising: a presentation surface store for storing a word processor presentation surface for presenting content of a word processor document in a format of the word processor document and receiving changes to the document format of the word processor document independent of changes to the contents of the word processor document; a content store that is created after opening the word processor document for storing first data including the content of the word processor document, the first data including one or more nodes of document data including portions of the content and receiving changes to the content of the word processor document independent of changes to the document format of the word processor document, wherein the content store is stored separately from the presentation surface store; wherein the content store is loaded with XML data that is stored within the word processor document; and wherein a schema file stored with the document data represents a structure of the document data; and a binding for binding the one or more nodes of first data in the content store to an area of the document and attempting to rebind the one or more nodes when it is determined that the binding refers to a nonexistent location in the content store; wherein the binding allows changes to a location of the contents of the word processor document stored with the presentation surface to be made on the presentation surface without changing a location and the structure of the XML data within the data store.
9. A word processor system for providing a word processor document comprising: a presentation surface store for storing a word processor presentation surface for presenting content of a word processor document in a format of the word processor document and receiving changes to the document format of the word processor document independent of changes to the contents of the word processor document; a content store that is created after opening the word processor document for storing first data including the content of the word processor document, the first data including one or more nodes of document data including portions of the content and receiving changes to the content of the word processor document independent of changes to the document format of the word processor document, wherein the content store is stored separately from the presentation surface store; wherein the content store is loaded with XML data that is stored within the word processor document; and wherein a schema file stored with the document data represents a structure of the document data; and a binding for binding the one or more nodes of first data in the content store to an area of the document and attempting to rebind the one or more nodes when it is determined that the binding refers to a nonexistent location in the content store; wherein the binding allows changes to a location of the contents of the word processor document stored with the presentation surface to be made on the presentation surface without changing a location and the structure of the XML data within the data store. 10. The word processor of claim 9 further comprising a second store for storing second data.
0.689189
9,789,605
3
6
3. The method of claim 1 , wherein the modifying of the policy further comprises using a learning model.
3. The method of claim 1 , wherein the modifying of the policy further comprises using a learning model. 6. The method of claim 3 , wherein the learning model includes updating parameters based on a gradient of error determined at least in part by a difference between the first robot action and a second robot action specified by a combination of the corrective command and the policy.
0.5
7,957,954
1
6
1. A computer program product, comprising a computer readable storage device having a computer readable program code stored therein, said computer readable program code containing instructions configured to be executed by a processor of a data processing system to implement a method for providing national language support for an application, said method comprising: generating a multi-language property file by processing each individual property file of a plurality of individual property files, wherein each individual property file comprises a file name comprising a label appended to a class and further comprises file content comprising a key value and a translated text pertaining to the label, wherein the key value is a member of the class, wherein said processing each individual property file comprises generating a translation and recording the generated translation in the multi-language property file, wherein the generated translation comprises the translated text and a key comprising the label appended to the key value, wherein the label is null, consists of a language identifier, or consists of the language identifier and a locale identifier, and wherein the translated text of each said translation is formatted in a character set that is displayable in a natural font of a language represented by the translated text; ascertaining, from an operating system of the data processing system, a language identifier and a locale identifier, wherein execution of a language independent application is configured to be performed in a locale identified by the ascertained locale identifier and to display text in accordance with a first key value and in a language identified by the ascertained language identifier; executing the application in the locale identified by the ascertained locale identifier; during said executing the application, selecting from the multi-language property file a translation whose label comprises a key value that matches the first key value and whose label further comprises the ascertained language identifier and the ascertained locale identifier of the executing application or whose label comprises the ascertained language identifier but not the ascertained locale identifier of the executing application or whose label is null; during said executing the application, displaying the translated text of the selected translation in the language identified by the ascertained language identifier.
1. A computer program product, comprising a computer readable storage device having a computer readable program code stored therein, said computer readable program code containing instructions configured to be executed by a processor of a data processing system to implement a method for providing national language support for an application, said method comprising: generating a multi-language property file by processing each individual property file of a plurality of individual property files, wherein each individual property file comprises a file name comprising a label appended to a class and further comprises file content comprising a key value and a translated text pertaining to the label, wherein the key value is a member of the class, wherein said processing each individual property file comprises generating a translation and recording the generated translation in the multi-language property file, wherein the generated translation comprises the translated text and a key comprising the label appended to the key value, wherein the label is null, consists of a language identifier, or consists of the language identifier and a locale identifier, and wherein the translated text of each said translation is formatted in a character set that is displayable in a natural font of a language represented by the translated text; ascertaining, from an operating system of the data processing system, a language identifier and a locale identifier, wherein execution of a language independent application is configured to be performed in a locale identified by the ascertained locale identifier and to display text in accordance with a first key value and in a language identified by the ascertained language identifier; executing the application in the locale identified by the ascertained locale identifier; during said executing the application, selecting from the multi-language property file a translation whose label comprises a key value that matches the first key value and whose label further comprises the ascertained language identifier and the ascertained locale identifier of the executing application or whose label comprises the ascertained language identifier but not the ascertained locale identifier of the executing application or whose label is null; during said executing the application, displaying the translated text of the selected translation in the language identified by the ascertained language identifier. 6. The computer program product of claim 1 , wherein the method determines that no translation in the multi-language property file includes a label that comprises the ascertained language identifier or the ascertained locale, and wherein the label of the selected translation is null.
0.623342
8,611,507
15
17
15. A computer-readable storage medium that is not a transient signal, the computer-readable storage medium comprising executable instructions, which when executed by a processor, cause the processor to effectuate operations comprising: receiving a telephonic communication comprising speech; transcribing the telephonic communication to generate a transcript; detecting an instruction generated by a telephone within the telephonic communication; determining that the telephone is associated with an authorized user; and responsive to detecting the instruction and determining that the telephone is associated with the authorized user, supplementing the transcript with additional information.
15. A computer-readable storage medium that is not a transient signal, the computer-readable storage medium comprising executable instructions, which when executed by a processor, cause the processor to effectuate operations comprising: receiving a telephonic communication comprising speech; transcribing the telephonic communication to generate a transcript; detecting an instruction generated by a telephone within the telephonic communication; determining that the telephone is associated with an authorized user; and responsive to detecting the instruction and determining that the telephone is associated with the authorized user, supplementing the transcript with additional information. 17. The computer-readable storage medium of claim 15 , wherein the operation of supplementing the transcript with the additional information comprises supplementing a portion of the transcript associated with a predetermined amount of time with the additional information.
0.5
8,370,319
12
13
12. The computer-implemented method of claim 8 , further comprising: if the specificity score is below the threshold and users likely submit the search query with the intention of general searching, presenting the users with search-result items from a plurality of categories that may be relevant to the search query.
12. The computer-implemented method of claim 8 , further comprising: if the specificity score is below the threshold and users likely submit the search query with the intention of general searching, presenting the users with search-result items from a plurality of categories that may be relevant to the search query. 13. The computer-implemented method of claim 12 , wherein a category label is associated with each the search-result items.
0.5
8,145,618
21
27
21. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving a search criteria; identifying one or more documents responsive to the search criteria; determining a text match score for each document based on degree of match between the responsive document and the search criteria; determining a document-categories score for each of a plurality of categories based on a degree of match between each document and each of the categories; determining a search criteria-categories score for each of the one or more categories based on a degree of match between the search criteria and each of the one or more categories, wherein the search criteria-categories score for a particular category indicates the degree of match between the search criteria and the category; determining a category match score for each document by combining the document-categories score of each of the one or more categories and the respective search criteria-categories score; determining an overall score for each document based on the text match score of each document and the respective category match score; and determining, based on the overall score for each document, a ranked order for the one or more documents.
21. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving a search criteria; identifying one or more documents responsive to the search criteria; determining a text match score for each document based on degree of match between the responsive document and the search criteria; determining a document-categories score for each of a plurality of categories based on a degree of match between each document and each of the categories; determining a search criteria-categories score for each of the one or more categories based on a degree of match between the search criteria and each of the one or more categories, wherein the search criteria-categories score for a particular category indicates the degree of match between the search criteria and the category; determining a category match score for each document by combining the document-categories score of each of the one or more categories and the respective search criteria-categories score; determining an overall score for each document based on the text match score of each document and the respective category match score; and determining, based on the overall score for each document, a ranked order for the one or more documents. 27. The computer storage medium of claim 21 , further comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: associating words and word phrases with the plurality of categories; and assigning association strengths to the word and word phrase associations.
0.56599
9,256,783
23
25
23. A computer-implemented method of preparing at least a portion of an electronic tax return by use of a computerized tax preparation application executed by a mobile communication device, the computer-implemented method comprising: a first computing device of the mobile communication device receiving an image of a document containing tax data therein; the first computing device transmitting the image to a remotely located second computing device; the remotely located second computing device identifying connected pixels within the received image; the remotely located second computing device extracting one or more features from the image based at least in part upon connected pixels; the remotely located second computing device identifying a tax form corresponding to the document from a plurality of different tax forms based at least in part on respective confidence levels associated with a comparison of the extracted one or more features to a textual database and a geometric database; the remotely located second computing device transferring tax data determined from the image to the mobile communication device; and the first computing device of the mobile communication device executing the computerized tax preparation application and automatically populating respective fields of the electronic tax return with respective tax data received from the remotely located second computing device to automatically prepare at least a portion of the electronic tax return.
23. A computer-implemented method of preparing at least a portion of an electronic tax return by use of a computerized tax preparation application executed by a mobile communication device, the computer-implemented method comprising: a first computing device of the mobile communication device receiving an image of a document containing tax data therein; the first computing device transmitting the image to a remotely located second computing device; the remotely located second computing device identifying connected pixels within the received image; the remotely located second computing device extracting one or more features from the image based at least in part upon connected pixels; the remotely located second computing device identifying a tax form corresponding to the document from a plurality of different tax forms based at least in part on respective confidence levels associated with a comparison of the extracted one or more features to a textual database and a geometric database; the remotely located second computing device transferring tax data determined from the image to the mobile communication device; and the first computing device of the mobile communication device executing the computerized tax preparation application and automatically populating respective fields of the electronic tax return with respective tax data received from the remotely located second computing device to automatically prepare at least a portion of the electronic tax return. 25. The method of claim 23 , wherein the imaged document contains tax data from a plurality of tax forms.
0.665605
4,051,459
25
26
25. A combination as in claim 24, further comprising logic means responsive to the output of said decoder for selectively inhibiting typing at said electrical typewriter keyboard.
25. A combination as in claim 24, further comprising logic means responsive to the output of said decoder for selectively inhibiting typing at said electrical typewriter keyboard. 26. A combination as in claim 25, further comprising disjunctive logic means for providing a status signal to said processor responsive to depression of a key at said typewriter keyboard.
0.5
9,390,377
1
3
1. An apparatus for feature extraction, the apparatus comprising: a memory; and at least one processor device, coupled to the memory, operative to: a) receive at least one query to predict at least one future value of a given value series; b) generate a statistical model built on covariates to produce at least two predictions of the future value fulfilling at least the properties of 1) each being as statistically probable as possible given the statistical model wherein to be as statistically probable as possible an absolute distance of each of the predictions to a true value is less than a predetermined distance parameter with greater than a predetermined probability and 2) being mutually divert in terms of a numerical distance measure; and c) query a user to select one of the predictions.
1. An apparatus for feature extraction, the apparatus comprising: a memory; and at least one processor device, coupled to the memory, operative to: a) receive at least one query to predict at least one future value of a given value series; b) generate a statistical model built on covariates to produce at least two predictions of the future value fulfilling at least the properties of 1) each being as statistically probable as possible given the statistical model wherein to be as statistically probable as possible an absolute distance of each of the predictions to a true value is less than a predetermined distance parameter with greater than a predetermined probability and 2) being mutually divert in terms of a numerical distance measure; and c) query a user to select one of the predictions. 3. The apparatus of claim 1 , wherein the at least one processor device is further operative to: present the predictions to the user; and query the user to select which of the predictions the user believes is most probable.
0.680516
8,812,303
1
11
1. A computer-implemented method, comprising: under the control of one or more computer systems configured with executable instructions, segmenting information; determining a language type for the segmented information; searching a language dictionary for synonyms of the contents of each information segment in at least one language type; and storing the synonyms and contents of each information segment.
1. A computer-implemented method, comprising: under the control of one or more computer systems configured with executable instructions, segmenting information; determining a language type for the segmented information; searching a language dictionary for synonyms of the contents of each information segment in at least one language type; and storing the synonyms and contents of each information segment. 11. The computer-implemented method of claim 1 , further comprising: determining whether to perform a one way or a two way test for synonyms for the segmented information.
0.642259