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
|
|---|---|---|---|---|---|
10,109,297 | 10 | 17 |
10. A system comprising: one or more processors; and memory communicatively coupled to the one or more processors and storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: causing a virtual assistant to carry out a conversation with a user; receiving user input during the conversation; determining one or more concepts for the user input by executing the instructions to: access features of a knowledge base stored in the memory, the features organized to trigger outputs according to units of vocabulary patterns arranged in the features, wherein the vocabulary patterns are stored in the memory with respective labels; substituting portions of the user input with sets of terms bearing corresponding labels that refer back to the respective labels of the knowledge base; matching the respective labels and the corresponding labels to identify a digital response to the speech input; causing the digital response to be presented to the user in real-time via the virtual assistant causing a task to be performed at least in part by the virtual assistant.
|
10. A system comprising: one or more processors; and memory communicatively coupled to the one or more processors and storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: causing a virtual assistant to carry out a conversation with a user; receiving user input during the conversation; determining one or more concepts for the user input by executing the instructions to: access features of a knowledge base stored in the memory, the features organized to trigger outputs according to units of vocabulary patterns arranged in the features, wherein the vocabulary patterns are stored in the memory with respective labels; substituting portions of the user input with sets of terms bearing corresponding labels that refer back to the respective labels of the knowledge base; matching the respective labels and the corresponding labels to identify a digital response to the speech input; causing the digital response to be presented to the user in real-time via the virtual assistant causing a task to be performed at least in part by the virtual assistant. 17. The system of claim 10 , wherein the at least one of the sets of terms comprises words stored in a separate input file having a name and an identifiable label.
| 0.656118 |
9,141,906 | 12 | 13 |
12. A method performed by one or more computers, the method comprising: receiving an input comprising a plurality of features of a resource, wherein each feature is a value of a respective attribute of the resource; processing each of the features using a respective embedding function to generate one or more numeric values; processing the numeric values to generate an alternative representation of the features of the resource, wherein processing the numeric values comprises applying one or more non-linear transformations to the numeric values; and processing the alternative representation of the input to generate a respective relevance score for each concept term in a pre-determined set of concept terms, wherein each of the respective relevance scores measures a predicted relevance of the corresponding concept term to the resource.
|
12. A method performed by one or more computers, the method comprising: receiving an input comprising a plurality of features of a resource, wherein each feature is a value of a respective attribute of the resource; processing each of the features using a respective embedding function to generate one or more numeric values; processing the numeric values to generate an alternative representation of the features of the resource, wherein processing the numeric values comprises applying one or more non-linear transformations to the numeric values; and processing the alternative representation of the input to generate a respective relevance score for each concept term in a pre-determined set of concept terms, wherein each of the respective relevance scores measures a predicted relevance of the corresponding concept term to the resource. 13. The method of claim 12 , wherein each of the embedding functions is specific to features of a respective feature type.
| 0.791096 |
8,468,122 | 3 | 6 |
3. The method of claim 1 further comprising facilitating initiation of the query at the user device.
|
3. The method of claim 1 further comprising facilitating initiation of the query at the user device. 6. The method of claim 3 further comprising facilitating presentation of a plurality of query candidates at the user device.
| 0.523077 |
8,140,563 | 15 | 16 |
15. A computer program product for processing a user query entered by a user via a web browser, said user query having a user query format and including search terms to search World Wide Web documents, said computer program product comprising: a computer readable media; first program instructions to translate the user query into a generic query with a generic query format different than said user query format; second program instructions to send to a first web service a request to identify a document language and a query format of said first web service, and in response, receive from said first web service a reply indicating that said first web service uses a first document language and a first query format, said first query format being different than said user query format and said generic query format; third program instructions to translate the generic query to a corresponding, first query with said first query format in said first document language; and fourth program instructions to send said first query to said first web service for searching World Wide Web documents; fifth program instructions to send to a second web service a request to identify a document language and a query format of said second web service, and in response, receiving from said second web service a reply indicating that said second web service uses a second document language and a second query format, said second query format being different than said first query format, said user query format and said generic query format, said second document language being different than said first document language; seventh program instructions to translate the generic query to a corresponding, second query with said second query format in said second document language; and eighth program instructions to send said second query to said second web service for searching World Wide Web documents; and wherein said first, second, third, fourth, fifth, sixth, seventh and eighth program instructions are recorded on said media.
|
15. A computer program product for processing a user query entered by a user via a web browser, said user query having a user query format and including search terms to search World Wide Web documents, said computer program product comprising: a computer readable media; first program instructions to translate the user query into a generic query with a generic query format different than said user query format; second program instructions to send to a first web service a request to identify a document language and a query format of said first web service, and in response, receive from said first web service a reply indicating that said first web service uses a first document language and a first query format, said first query format being different than said user query format and said generic query format; third program instructions to translate the generic query to a corresponding, first query with said first query format in said first document language; and fourth program instructions to send said first query to said first web service for searching World Wide Web documents; fifth program instructions to send to a second web service a request to identify a document language and a query format of said second web service, and in response, receiving from said second web service a reply indicating that said second web service uses a second document language and a second query format, said second query format being different than said first query format, said user query format and said generic query format, said second document language being different than said first document language; seventh program instructions to translate the generic query to a corresponding, second query with said second query format in said second document language; and eighth program instructions to send said second query to said second web service for searching World Wide Web documents; and wherein said first, second, third, fourth, fifth, sixth, seventh and eighth program instructions are recorded on said media. 16. A computer program product as set forth in claim 15 wherein said first document language is HTML and said second document language is XML.
| 0.5 |
6,138,270 | 57 | 88 |
57. A computer-readable memory medium comprising program instructions for detecting differences between first and second graphical programs, wherein the program instructions execute on a computer including a display, wherein the program instructions are executable to implement: determining differences between said first graphical program and said second graphical program, wherein said first graphical program and said second gaphical program each comprise graphical code; and displaying an indication of said differences on the display; wherein said differences are used to evaluate at least one of the first graphical program and the second graphical program.
|
57. A computer-readable memory medium comprising program instructions for detecting differences between first and second graphical programs, wherein the program instructions execute on a computer including a display, wherein the program instructions are executable to implement: determining differences between said first graphical program and said second graphical program, wherein said first graphical program and said second gaphical program each comprise graphical code; and displaying an indication of said differences on the display; wherein said differences are used to evaluate at least one of the first graphical program and the second graphical program. 88. The memory medium of claim 57, wherein said differences are useable in determining errors in at least one of the first graphical program and the second graphical program.
| 0.880822 |
7,765,200 | 25 | 29 |
25. A computer readable storage medium containing program instructions executable on a processing system for query problem determination; the program instructions comprising: receiving a database query; creating a query execution plan for problem determination of the database query, the query execution plan comprising a plurality of query plan operators; executing the query execution plan; displaying a progress indicator for each of the plurality of query plan operators during execution of the query execution plan in response to progress information; communicating progress information to a query progress analyzer for performing debugging operations; and performing debugging operations during execution of the query execution plan by a query progress analyzer, wherein performing the debugging operations comprises: skipping at least a portion of the query execution plan; pausing execution of the query execution plan at a designated point; inspecting the query execution plan including one or more of looking up variables in the query execution plan and stepping through the query execution plan to inspect different portions of the query execution for problem determination, while the query execution is paused; resuming execution of the query execution plan from the designated point; and providing updated progress information to update display of the progress indicator, wherein upon the query execution plan's invocation, a wrapper function intervenes and jumps into debugging logic which increments a counter for the current query plan operator, and executes any additional instructions corresponding to the query plan operator, wherein the additional instructions include graphically displaying the progress as an enhancement to a query explain tool, wherein the query explain tool would poll the current status of the actual cardinalities processed for each part of the query execution plan and utilizing the existing explain facility.
|
25. A computer readable storage medium containing program instructions executable on a processing system for query problem determination; the program instructions comprising: receiving a database query; creating a query execution plan for problem determination of the database query, the query execution plan comprising a plurality of query plan operators; executing the query execution plan; displaying a progress indicator for each of the plurality of query plan operators during execution of the query execution plan in response to progress information; communicating progress information to a query progress analyzer for performing debugging operations; and performing debugging operations during execution of the query execution plan by a query progress analyzer, wherein performing the debugging operations comprises: skipping at least a portion of the query execution plan; pausing execution of the query execution plan at a designated point; inspecting the query execution plan including one or more of looking up variables in the query execution plan and stepping through the query execution plan to inspect different portions of the query execution for problem determination, while the query execution is paused; resuming execution of the query execution plan from the designated point; and providing updated progress information to update display of the progress indicator, wherein upon the query execution plan's invocation, a wrapper function intervenes and jumps into debugging logic which increments a counter for the current query plan operator, and executes any additional instructions corresponding to the query plan operator, wherein the additional instructions include graphically displaying the progress as an enhancement to a query explain tool, wherein the query explain tool would poll the current status of the actual cardinalities processed for each part of the query execution plan and utilizing the existing explain facility. 29. The computer readable medium of claim 25 , wherein performing the debugging operations further comprises: modifying a portion of the query execution plan, skipping at least an unmodified portion of the query execution plan and inspecting the query execution plan by looking up variables in the query execution plan and by stepping through the query execution plan to inspect different portions of the query execution, while the query execution is paused.
| 0.5 |
8,135,757 | 22 | 23 |
22. The system of claim 19 , wherein the schema generator is further executed to: generate a common type schema in the second programming language providing elements and attributes describing the reusable code in the data structure, wherein the reference to the reusable code in the data structure schema identifies the common type schema and a location of the common type schema.
|
22. The system of claim 19 , wherein the schema generator is further executed to: generate a common type schema in the second programming language providing elements and attributes describing the reusable code in the data structure, wherein the reference to the reusable code in the data structure schema identifies the common type schema and a location of the common type schema. 23. The system of claim 22 , wherein the reusable code in the data structure is contained within a reusable code file in the first programming language that is capable of being referenced in multiple data structures in the first programming language, and wherein a schema generator generates the common type schema from the reusable code file.
| 0.5 |
9,836,192 | 1 | 9 |
1. A system to facilitate a graphical user interface in a computing environment, the system comprising a computing device configured to execute computer code in order to: interact with a graphical user interface (GUI) in a window, the GUI comprising at least one user interface (UI) object accessible using a mouse; receive a first command from a user to position a mouse cursor at a location in the window of the UI object in preparation for receiving a second command from the user to generate a marker representing the UI object, wherein the marker comprises a marker label; receive the second command from the user; display the marker label proximate the location of the UI object in the window; and receive a voice command from the user that identifies the marker label, and in response to the voice command, generate an input representing the user interfacing with the UI object.
|
1. A system to facilitate a graphical user interface in a computing environment, the system comprising a computing device configured to execute computer code in order to: interact with a graphical user interface (GUI) in a window, the GUI comprising at least one user interface (UI) object accessible using a mouse; receive a first command from a user to position a mouse cursor at a location in the window of the UI object in preparation for receiving a second command from the user to generate a marker representing the UI object, wherein the marker comprises a marker label; receive the second command from the user; display the marker label proximate the location of the UI object in the window; and receive a voice command from the user that identifies the marker label, and in response to the voice command, generate an input representing the user interfacing with the UI object. 9. The system as recited in claim 1 , wherein in response to the voice command the user interfacing with the UI object comprises emulating the user clicking a mouse cursor on the UI object.
| 0.723684 |
7,603,647 | 14 | 18 |
14. The computer-readable storage medium of claim 13 , wherein determining whether an identified process is a clock process includes searching for an IF statement and a corresponding ELSE or ELSEIF statement.
|
14. The computer-readable storage medium of claim 13 , wherein determining whether an identified process is a clock process includes searching for an IF statement and a corresponding ELSE or ELSEIF statement. 18. The computer-readable storage medium of claim 14 , further including identifying current and next state variables.
| 0.779026 |
9,361,355 | 97 | 98 |
97. The computing system of claim 96 , wherein the query includes the tokens identified from the selected data record, and tokens that were identified from other received data records and that have a variant relationship to the tokens identified from the selected data record.
|
97. The computing system of claim 96 , wherein the query includes the tokens identified from the selected data record, and tokens that were identified from other received data records and that have a variant relationship to the tokens identified from the selected data record. 98. The computing system of claim 97 , wherein the variant relationship is based at least in part on an edit distance.
| 0.5 |
7,647,415 | 63 | 65 |
63. A computer-accessible storage medium comprising program instructions, wherein the program instructions are configured to implement: a Web services stack on a system configured to communicate with other systems using either a binary encoding protocol or a markup language protocol using a single API (application programming interface) negotiating with another system to determine if the other system supports the binary encoding protocol, wherein the markup language protocol is based on XML (eXtensible Markup Language), and wherein communication according to the binary encoding protocol comprises mapping from an XML schema to a binary encoding schema and generating a binary encoding from the binary encoding schema; if the other system supports the binary encoding protocol, the Web services stack communicating with the other system according to the binary encoding protocol; and if the other system does not support the binary encoding protocol, the Web services stack communicating with the other system according to the markup language protocol.
|
63. A computer-accessible storage medium comprising program instructions, wherein the program instructions are configured to implement: a Web services stack on a system configured to communicate with other systems using either a binary encoding protocol or a markup language protocol using a single API (application programming interface) negotiating with another system to determine if the other system supports the binary encoding protocol, wherein the markup language protocol is based on XML (eXtensible Markup Language), and wherein communication according to the binary encoding protocol comprises mapping from an XML schema to a binary encoding schema and generating a binary encoding from the binary encoding schema; if the other system supports the binary encoding protocol, the Web services stack communicating with the other system according to the binary encoding protocol; and if the other system does not support the binary encoding protocol, the Web services stack communicating with the other system according to the markup language protocol. 65. The computer-accessible storage medium as recited in claim 63 , wherein the system and the other system are peers on a network.
| 0.861814 |
8,438,485 | 1 | 12 |
1. A method for presenting an interactive audio publication to a user, the method comprising: enabling a subscriber to access a subscriber portal to generate a custom audio publication template used to generate an audio publication for the subscriber, the subscriber being a subscriber to the audio publication, said enabling comprising enabling the subscriber to define one or more custom audio publication templates, the custom audio publication templates being configured to be used to generate one or more custom audio publications from one or more source audio publications, and the custom audio publication templates including one or more custom sections, such that each custom section contains one or more audio content item assignment rules; receiving a plurality of content items that includes at least one text-based content item or speech-based content item; converting the received plurality of content items into corresponding audio content items that each include digital audio data corresponding to a spoken representation of a corresponding text-based content item or speech-based content item, and audio content item metadata indicating a structure of the included digital audio data, the audio content item metadata including a plurality of markers designating boundaries of a title segment, a summary segment, and a story body segment of an audio content item; assembling the audio publication from one or more of the audio content items according to the custom audio publication template, the audio publication being organized into one or more sections; generating audio publication metadata that defines a structure of the audio publication, said generating comprising customizing the audio publication metadata for at least one user; and distributing the audio publication to the subscriber for interactive presentation, the distributed audio publication including the audio publication metadata and the one or more audio content items.
|
1. A method for presenting an interactive audio publication to a user, the method comprising: enabling a subscriber to access a subscriber portal to generate a custom audio publication template used to generate an audio publication for the subscriber, the subscriber being a subscriber to the audio publication, said enabling comprising enabling the subscriber to define one or more custom audio publication templates, the custom audio publication templates being configured to be used to generate one or more custom audio publications from one or more source audio publications, and the custom audio publication templates including one or more custom sections, such that each custom section contains one or more audio content item assignment rules; receiving a plurality of content items that includes at least one text-based content item or speech-based content item; converting the received plurality of content items into corresponding audio content items that each include digital audio data corresponding to a spoken representation of a corresponding text-based content item or speech-based content item, and audio content item metadata indicating a structure of the included digital audio data, the audio content item metadata including a plurality of markers designating boundaries of a title segment, a summary segment, and a story body segment of an audio content item; assembling the audio publication from one or more of the audio content items according to the custom audio publication template, the audio publication being organized into one or more sections; generating audio publication metadata that defines a structure of the audio publication, said generating comprising customizing the audio publication metadata for at least one user; and distributing the audio publication to the subscriber for interactive presentation, the distributed audio publication including the audio publication metadata and the one or more audio content items. 12. The method of claim 1 , further comprising: performing the assignment rule, including selecting one or more audio content items from one or more of the source audio publications, and assigning the selected one or more audio content items to one or more of the custom sections.
| 0.680365 |
6,108,444 | 3 | 4 |
3. The method of claim 2 further comprising the step of estimating an intra-word separation from said handwritten text using the projecting of boundaries of the word segment regions lying on said lines of text.
|
3. The method of claim 2 further comprising the step of estimating an intra-word separation from said handwritten text using the projecting of boundaries of the word segment regions lying on said lines of text. 4. The method of claim 3 wherein determined boundary points on connected component regions are as points that have at least one "off" neighbor and wherein said curves are smoothed using a conventional line-segment approximation algorithm.
| 0.5 |
8,468,114 | 3 | 4 |
3. The method of claim 2 including the further steps of using historical statistics data to identify the past behavior of said system components identified in said contextual information and combining the enriched alert and identified past behavior of said components to generate at least one alert resolution action.
|
3. The method of claim 2 including the further steps of using historical statistics data to identify the past behavior of said system components identified in said contextual information and combining the enriched alert and identified past behavior of said components to generate at least one alert resolution action. 4. The method of claim 3 wherein the step of receiving an alert request comprises the step of detecting an alert issued from an event management system and transmitting it to an inference module in the appropriate format.
| 0.675953 |
8,155,959 | 1 | 7 |
1. A dialog system comprising: a plurality of dialog modules in a processor of the dialog system that receive and process utterances from a speaker and generate synthetic speech or text outputs as responses to the utterances, wherein the plurality of dialog modules include a first dialog module coupled to provide an output to a second dialog module; a task flow generation module functionally coupled to the plurality of dialog modules and that receives a task flow defining a set of tasks for human agent control over real-time collection of dialog data for the speaker, a starting task, and relationships among the tasks, and that generates a script that comprises a formal description of the task flow, the script of the task flow automatically generating a graphical user interface that includes templates for control of the dialog modules and real-time collection of dialog data for the speaker, the script generating a plurality of tags defining parameters of the tasks and one or more elements of the automatically generated graphical user interface; a controller circuit embodied within the processor, the controller circuit functionally coupled to the first dialog module, wherein the controller circuit detects an abnormal output of the first dialog module when the first dialog module is processing the utterances in an automatic mode and outputs a signal indicating the abnormal output; and an operator interface coupled to the plurality of dialog modules and the controller circuit, wherein the operator interface receives the signal and executes the task flow to automatically generate the graphical user interface, wherein the graphical user interface comprises a plurality of display panels including a first panel configured to allow the human agent to control the synthetic speech or text outputs, and a second panel configured to display at least a portion of the task flow, and wherein the templates for control of the dialog modules include a mode control for the human agent to control the first dialog module through the controller by correcting the abnormal output and transferring a corrected output to the second dialog module, wherein the corrected output is used in further processing the utterances.
|
1. A dialog system comprising: a plurality of dialog modules in a processor of the dialog system that receive and process utterances from a speaker and generate synthetic speech or text outputs as responses to the utterances, wherein the plurality of dialog modules include a first dialog module coupled to provide an output to a second dialog module; a task flow generation module functionally coupled to the plurality of dialog modules and that receives a task flow defining a set of tasks for human agent control over real-time collection of dialog data for the speaker, a starting task, and relationships among the tasks, and that generates a script that comprises a formal description of the task flow, the script of the task flow automatically generating a graphical user interface that includes templates for control of the dialog modules and real-time collection of dialog data for the speaker, the script generating a plurality of tags defining parameters of the tasks and one or more elements of the automatically generated graphical user interface; a controller circuit embodied within the processor, the controller circuit functionally coupled to the first dialog module, wherein the controller circuit detects an abnormal output of the first dialog module when the first dialog module is processing the utterances in an automatic mode and outputs a signal indicating the abnormal output; and an operator interface coupled to the plurality of dialog modules and the controller circuit, wherein the operator interface receives the signal and executes the task flow to automatically generate the graphical user interface, wherein the graphical user interface comprises a plurality of display panels including a first panel configured to allow the human agent to control the synthetic speech or text outputs, and a second panel configured to display at least a portion of the task flow, and wherein the templates for control of the dialog modules include a mode control for the human agent to control the first dialog module through the controller by correcting the abnormal output and transferring a corrected output to the second dialog module, wherein the corrected output is used in further processing the utterances. 7. The dialog system of claim 1 , wherein the controller detects the abnormal output using a measure of repeats of the utterances or dialog patterns.
| 0.903871 |
8,015,183 | 15 | 16 |
15. The method of claim 11 , further comprising determining to perform the additional inquiry, wherein the additional query comprises statistically analyzing phrases within the set of documents, and identifying a plurality of statistically interesting phrases based on the statistical analysis, the statistically interesting phrases having a statistical property that distinguishes them from other phrases in the documents.
|
15. The method of claim 11 , further comprising determining to perform the additional inquiry, wherein the additional query comprises statistically analyzing phrases within the set of documents, and identifying a plurality of statistically interesting phrases based on the statistical analysis, the statistically interesting phrases having a statistical property that distinguishes them from other phrases in the documents. 16. The method of claim 15 , wherein identifying the plurality of statistically interesting phrases comprises one of selecting phrases having a frequency of occurrence that exceeds a predetermined threshold, and selecting a pre-determined number of phrases having a frequency of occurrence higher than a frequency of occurrence of other phrases in the documents.
| 0.5 |
9,288,275 | 25 | 35 |
25. A computer-implemented method for implementing an event centric social networking platform, said method comprising the following steps: storing, in a first repository, at least user related information including at least registration information; storing, in a second repository, at least the information corresponding to catalog offerings; storing, in a third repository, at least event-related information corresponding to said users, information corresponding to resources uploaded onto a social networking platform by said users, information corresponding to access privileges and action permissions granted to user roles with respect to event-related information; receiving a request from a user towards organizing an event based on at least one of catalog offerings/catalog offering related activities, said request including at least event related information; searching said second repository for catalog offerings related to said event related information, and generating a list of catalog offerings related to event specified by a user based on user related information; enabling selection of at least one vendor offering from said list of catalog offerings and updating the event-related information stored in said third repository to reflect the vendor offering selected by said user; searching friend list for users, based on a pre-defined criteria, and categorizing users in search result into pre-determined invitee categories; generating an invitee list for an event including user names selected from at least one of said pre-determined invitee categories and non-registered invitees, and selectively transmitting an invitation inviting users included in said invitee list to attend said event, enabling said registered/non-registered invitees to respond to the event invitation, and tracking the responses of invited users; and displaying a list of event invitations including past events and the events planned for future dates, controlling users' access to said list of event invitations, providing users with selective access to contents of the event invitations, enabling said users to view the listed event invitation, edit the listed event invitation, comment on the listed event invitation and add image/social media files on to the listed event invitation; generating notifications corresponding to at least the activities performed by said users on said social networking platform, and transmitting said notifications to at least one other user whose name is included in the friend list associated with the users.
|
25. A computer-implemented method for implementing an event centric social networking platform, said method comprising the following steps: storing, in a first repository, at least user related information including at least registration information; storing, in a second repository, at least the information corresponding to catalog offerings; storing, in a third repository, at least event-related information corresponding to said users, information corresponding to resources uploaded onto a social networking platform by said users, information corresponding to access privileges and action permissions granted to user roles with respect to event-related information; receiving a request from a user towards organizing an event based on at least one of catalog offerings/catalog offering related activities, said request including at least event related information; searching said second repository for catalog offerings related to said event related information, and generating a list of catalog offerings related to event specified by a user based on user related information; enabling selection of at least one vendor offering from said list of catalog offerings and updating the event-related information stored in said third repository to reflect the vendor offering selected by said user; searching friend list for users, based on a pre-defined criteria, and categorizing users in search result into pre-determined invitee categories; generating an invitee list for an event including user names selected from at least one of said pre-determined invitee categories and non-registered invitees, and selectively transmitting an invitation inviting users included in said invitee list to attend said event, enabling said registered/non-registered invitees to respond to the event invitation, and tracking the responses of invited users; and displaying a list of event invitations including past events and the events planned for future dates, controlling users' access to said list of event invitations, providing users with selective access to contents of the event invitations, enabling said users to view the listed event invitation, edit the listed event invitation, comment on the listed event invitation and add image/social media files on to the listed event invitation; generating notifications corresponding to at least the activities performed by said users on said social networking platform, and transmitting said notifications to at least one other user whose name is included in the friend list associated with the users. 35. The method as claimed in claim 25 , wherein the method further includes the step of configuring said social networking platform to cooperate with third party applications including websites and newsletters to enable said users to generate a request for organizing an event via said third party applications.
| 0.783426 |
8,294,017 | 11 | 14 |
11. A machine-readable medium including machine-readable instructions providing a method for creating a music file, the method comprising: receiving a birth date; determining angular distribution of celestial objects on a birth sky based, at least in part, on the birth date; selecting a plurality of Names from Shem ha-Meforash based, at least in part, on the angular distribution of celestial objects; associating vowels with at least some of the Names; generating a recorded musical portion for at least some of the Names; assembling at least some of the recorded musical portions in a musical file; and recording the musical file.
|
11. A machine-readable medium including machine-readable instructions providing a method for creating a music file, the method comprising: receiving a birth date; determining angular distribution of celestial objects on a birth sky based, at least in part, on the birth date; selecting a plurality of Names from Shem ha-Meforash based, at least in part, on the angular distribution of celestial objects; associating vowels with at least some of the Names; generating a recorded musical portion for at least some of the Names; assembling at least some of the recorded musical portions in a musical file; and recording the musical file. 14. The machine-readable medium including machine-readable instructions providing a method for creating a music file of claim 11 , wherein the plurality of Names is 10 Names.
| 0.879167 |
8,010,358 | 1 | 2 |
1. A method for voice recognition, the method comprising: obtaining a voice signal; performing two or more voice recognition analyses in parallel on the voice signal, wherein each voice recognition analysis uses a filter bank defined by a different maximum frequency and a different minimum frequency and wherein each voice recognition analysis produces a recognition probability r i of recognition of one or more speech units, whereby there are two or more recognition probabilities r i , wherein each recognition probability r i represents a probability that the voice signal matches a recognized unit of speech, wherein performing the two or more voice recognition analyses in parallel includes performing a first voice recognition analysis on the voice signal based on a first maximum frequency f max and a first minimum frequency f min ; wherein f min and f max are adjusted dynamically during the first voice recognition; and performing one or more additional voice recognition analyses on the voice signal based on a different maximum frequency given by f max ±Δf max and a different minimum frequency given by f min ±Δf min ,where Δf max <f max and Δf min <f min ; and determining a final recognition probability P f based on the two or more recognition probabilities r i ; determining a confidence measure based on the final recognition probability and the two or more recognition probabilities r i ; and using the confidence measure as an acceptance criterion for the final recognition probability P f after determining the final recognition probability P f .
|
1. A method for voice recognition, the method comprising: obtaining a voice signal; performing two or more voice recognition analyses in parallel on the voice signal, wherein each voice recognition analysis uses a filter bank defined by a different maximum frequency and a different minimum frequency and wherein each voice recognition analysis produces a recognition probability r i of recognition of one or more speech units, whereby there are two or more recognition probabilities r i , wherein each recognition probability r i represents a probability that the voice signal matches a recognized unit of speech, wherein performing the two or more voice recognition analyses in parallel includes performing a first voice recognition analysis on the voice signal based on a first maximum frequency f max and a first minimum frequency f min ; wherein f min and f max are adjusted dynamically during the first voice recognition; and performing one or more additional voice recognition analyses on the voice signal based on a different maximum frequency given by f max ±Δf max and a different minimum frequency given by f min ±Δf min ,where Δf max <f max and Δf min <f min ; and determining a final recognition probability P f based on the two or more recognition probabilities r i ; determining a confidence measure based on the final recognition probability and the two or more recognition probabilities r i ; and using the confidence measure as an acceptance criterion for the final recognition probability P f after determining the final recognition probability P f . 2. The method of claim 1 wherein determining the final recognition probability includes selecting a maximum probability of the two or more recognition probabilities as the final recognition probability P f .
| 0.852143 |
10,062,081 | 6 | 7 |
6. A non-transitory computer readable storage medium having computer readable instructions stored therein for business context oriented request processing, the computer readable instructions, which, when executed on a computer system, cause the computer system to perform the operations comprising: establishing a stack of business context instances in a thread, each for a context type; receiving an object request for an object in an object request broker (ORB); passing the request from the ORB to an enterprise Java bean (EJB) container, the EJB container identifying a type of the object request, determining if a business context data service collaborator is registered for the object and calling the business context data service, the business context data service establishing a business context instance in the stack on the thread for the object; and, upon the EJB completing processing of the object request, calling by the EJB container a post-invocation collaborator to remove one of the context instances corresponding to the type from the stack on the thread by clearing in the thread a context identifier for the business context instance and restoring the business context instance corresponding to the context identifier.
|
6. A non-transitory computer readable storage medium having computer readable instructions stored therein for business context oriented request processing, the computer readable instructions, which, when executed on a computer system, cause the computer system to perform the operations comprising: establishing a stack of business context instances in a thread, each for a context type; receiving an object request for an object in an object request broker (ORB); passing the request from the ORB to an enterprise Java bean (EJB) container, the EJB container identifying a type of the object request, determining if a business context data service collaborator is registered for the object and calling the business context data service, the business context data service establishing a business context instance in the stack on the thread for the object; and, upon the EJB completing processing of the object request, calling by the EJB container a post-invocation collaborator to remove one of the context instances corresponding to the type from the stack on the thread by clearing in the thread a context identifier for the business context instance and restoring the business context instance corresponding to the context identifier. 7. The computer readable storage medium of claim 6 , further comprising creating an event with a specific context instance identifier specified explicitly in the call to the business context data service rather than relying upon the business context established for the thread.
| 0.5 |
9,268,997 | 1 | 19 |
1. A method comprising: receiving, by an application server, from a user device communicatively coupled via a communication network to the application server, data storing hand-written information obtained from a user of the user device; identifying, by the application server, a first gap in the received data storing the hand-written information and a second gap in the received data storing the hand-written information, the second gap being subsequent to the first gap; processing, by the application server, in response to the identifying of the second gap, a portion of the received data storing the hand-written information that is between the first gap and the second gap to identify one or more hand-written characters included in the portion of the received data that is between the first gap and the second gap; determining, by the application server, based on the identified one or more hand-written characters, whether the identified one or more characters include a command for initiating an action across the communication network; and responsive to determining that the identified one or more characters include the command, automatically performing, by the application server, the action identified by the command included in the one or more hand-written characters across the communication network.
|
1. A method comprising: receiving, by an application server, from a user device communicatively coupled via a communication network to the application server, data storing hand-written information obtained from a user of the user device; identifying, by the application server, a first gap in the received data storing the hand-written information and a second gap in the received data storing the hand-written information, the second gap being subsequent to the first gap; processing, by the application server, in response to the identifying of the second gap, a portion of the received data storing the hand-written information that is between the first gap and the second gap to identify one or more hand-written characters included in the portion of the received data that is between the first gap and the second gap; determining, by the application server, based on the identified one or more hand-written characters, whether the identified one or more characters include a command for initiating an action across the communication network; and responsive to determining that the identified one or more characters include the command, automatically performing, by the application server, the action identified by the command included in the one or more hand-written characters across the communication network. 19. The method of claim 1 , wherein the identifying of the second gap in the received data storing the hand-written information comprises at least one of: determining that the user does not input any hand-written information for at least a predetermined amount of time that follows the first gap; and determining that the user stops writing on a first region of a user-input interface of the user device and then begins writing on a second region of the user-input interface.
| 0.645522 |
8,538,884 | 1 | 10 |
1. A method for auditing a plurality of transaction documents, comprising: transmitting a query comprising at least one query criteria from a local computer associated with a user to a centrally located computer associated with a transaction management system; receiving, from the centrally located computer, a plurality of transaction documents satisfying the at least one query criteria; before displaying any one of the plurality of documents, pre-loading the plurality of transaction documents in a temporary storage space that is located on the local computer; after each of the plurality of transaction documents are pre-loaded in the temporary storage space on the local computer, displaying, by the local computer, a first one of the plurality of transaction documents to the user; receiving, by the local computer, a user input from the user; in response to receiving the user input, performing, by the local computer, at least one operation on the first one of the plurality of transaction documents stored in the temporary storage space that is located on the local computer; and automatically displaying, without further user input, a second one of the plurality of transaction documents to the user.
|
1. A method for auditing a plurality of transaction documents, comprising: transmitting a query comprising at least one query criteria from a local computer associated with a user to a centrally located computer associated with a transaction management system; receiving, from the centrally located computer, a plurality of transaction documents satisfying the at least one query criteria; before displaying any one of the plurality of documents, pre-loading the plurality of transaction documents in a temporary storage space that is located on the local computer; after each of the plurality of transaction documents are pre-loaded in the temporary storage space on the local computer, displaying, by the local computer, a first one of the plurality of transaction documents to the user; receiving, by the local computer, a user input from the user; in response to receiving the user input, performing, by the local computer, at least one operation on the first one of the plurality of transaction documents stored in the temporary storage space that is located on the local computer; and automatically displaying, without further user input, a second one of the plurality of transaction documents to the user. 10. The method of claim 1 , further comprising: prior to searching the database to identify the plurality of transaction documents, receiving user identification information from the user; authenticating the user based on the user identification information; and recognizing the user as a document auditor based on the user identification information.
| 0.665714 |
9,916,540 | 1 | 4 |
1. A system comprising: one or more processors; and memory storing instructions that, when executed by the one or more processors, configure the one or more processors to perform operations comprising: receiving an input value; applying a first level of complexity of a machine learning model to the input value by applying at least one biased first level of complexity to the input value to generate at least one class label; determining whether the first level of complexity is able to classify the input value; and if the first level of complexity is not able to classify the input value, applying a second level of complexity of the machine learning model to the input value, wherein the second level of complexity is more complex than the first level of complexity.
|
1. A system comprising: one or more processors; and memory storing instructions that, when executed by the one or more processors, configure the one or more processors to perform operations comprising: receiving an input value; applying a first level of complexity of a machine learning model to the input value by applying at least one biased first level of complexity to the input value to generate at least one class label; determining whether the first level of complexity is able to classify the input value; and if the first level of complexity is not able to classify the input value, applying a second level of complexity of the machine learning model to the input value, wherein the second level of complexity is more complex than the first level of complexity. 4. The system of claim 1 , wherein applying the first level of complexity of the machine learning model to the input value by applying at least one biased first level of complexity to the input value to generate at least one class label comprises: applying a negatively biased first level of complexity to the input value to generate a first class label; and applying a positively biased first level of complexity to the input value to generate a second class label.
| 0.5 |
8,489,400 | 1 | 2 |
1. A method comprising: presenting text on a touch-sensitive display of a computing device; receiving, via the touch-sensitive display, a user touch; identifying a portion of the text based at least in part on the user touch; and audibly presenting the portion of the text.
|
1. A method comprising: presenting text on a touch-sensitive display of a computing device; receiving, via the touch-sensitive display, a user touch; identifying a portion of the text based at least in part on the user touch; and audibly presenting the portion of the text. 2. The method of claim 1 , wherein receiving the user touch further comprises receiving non-contiguous separate inputs, wherein the non-contiguous separate inputs indicate a number of paragraphs of the text to be audibly presented as the portion of the text.
| 0.5 |
9,563,646 | 15 | 18 |
15. A computer-implemented system, comprising: an input device enabled to generate an idea-image association that associates an image with an idea based on data that indicates user interaction with the image in a presentation of search results that correspond to a first search query, wherein the idea is determined to be related to the first search query; a database enabled to store the idea-image association and other idea-image associations; and a processor enabled to provide the image for display in a presentation of search results that correspond to a different, second search query, wherein the processor is enabled to select the image for display in the presentation of search results that correspond to the second search query based on (i) determining that the second search query relates to the idea and (ii) identifying from the stored idea-image association that a match exists between the idea that the second search query relates to and the idea to which the image is associated.
|
15. A computer-implemented system, comprising: an input device enabled to generate an idea-image association that associates an image with an idea based on data that indicates user interaction with the image in a presentation of search results that correspond to a first search query, wherein the idea is determined to be related to the first search query; a database enabled to store the idea-image association and other idea-image associations; and a processor enabled to provide the image for display in a presentation of search results that correspond to a different, second search query, wherein the processor is enabled to select the image for display in the presentation of search results that correspond to the second search query based on (i) determining that the second search query relates to the idea and (ii) identifying from the stored idea-image association that a match exists between the idea that the second search query relates to and the idea to which the image is associated. 18. The system of claim 15 , wherein the input device is further enabled to: compare the image with a second image to determine whether the image and the second image depict similar content; and in response to determining that the image and the second image depict similar content, generate a second idea-image association that associates the second image with the idea.
| 0.5 |
9,651,396 | 1 | 2 |
1. A system comprising: at least one processor; and a memory device including instructions that, when executed by the at least one processor, cause the at least one processor to: receive a request from a user of a mapping application executing on a client device; determine mapping data corresponding to at least one geographic region derived at least in part from information in the request, the mapping data including at least graphical information for rendering a map display for the at least one geographic region; based at least in part upon the at least one geographic region, determine point of interest (POI) data associated with the mapping data, the POI data including one or more POIs; analyze the request to identify a specified area of interest; determine a value of a distance function based at least in part of the specified area of interest; determine a ranking score of each POI in the POI data based at least in part on the distance function applied as a multiplier to a baseline score of the each POI within the specified area of interest; select a portion of the POI data corresponding to a current view in the mapping application based at least in part upon the ranking score of the each POI of the POI data corresponding to the current view; and provide the portion of the POI data for display.
|
1. A system comprising: at least one processor; and a memory device including instructions that, when executed by the at least one processor, cause the at least one processor to: receive a request from a user of a mapping application executing on a client device; determine mapping data corresponding to at least one geographic region derived at least in part from information in the request, the mapping data including at least graphical information for rendering a map display for the at least one geographic region; based at least in part upon the at least one geographic region, determine point of interest (POI) data associated with the mapping data, the POI data including one or more POIs; analyze the request to identify a specified area of interest; determine a value of a distance function based at least in part of the specified area of interest; determine a ranking score of each POI in the POI data based at least in part on the distance function applied as a multiplier to a baseline score of the each POI within the specified area of interest; select a portion of the POI data corresponding to a current view in the mapping application based at least in part upon the ranking score of the each POI of the POI data corresponding to the current view; and provide the portion of the POI data for display. 2. The system of claim 1 , wherein the baseline score of each POI is determined based at least in part on a quantitative indication of similarity between one or more parameters included in the request, the quantitative indication of similarity comprising a real and non-negative numerical value, and the one or more parameters including at least one of at least one query keyword, a query constraint, the specified area of interest, or a location of a user.
| 0.705161 |
7,844,466 | 1 | 5 |
1. A method for processing language comprising: identifying known words within a received input; generating a set of candidate parts of speech from each continuous sequence of identified known words within said input; permuting at least a portion of the candidate parts of speech from each continuous sequence; producing a plurality of potentially valid syntactic structures from the permuted candidate parts of speech; for at least one of the potentially valid syntactic structures, generating a conceptual representation thereof based on a database of conceptual information comprising parts of speech and a dictionary; determining at least one anomaly criterion for each conceptual representation; and at least one of responding and processing a response to the input, based on one or more of the conceptual representations, in dependence on the determined at least one anomaly criterion, in a conceptually appropriate manner.
|
1. A method for processing language comprising: identifying known words within a received input; generating a set of candidate parts of speech from each continuous sequence of identified known words within said input; permuting at least a portion of the candidate parts of speech from each continuous sequence; producing a plurality of potentially valid syntactic structures from the permuted candidate parts of speech; for at least one of the potentially valid syntactic structures, generating a conceptual representation thereof based on a database of conceptual information comprising parts of speech and a dictionary; determining at least one anomaly criterion for each conceptual representation; and at least one of responding and processing a response to the input, based on one or more of the conceptual representations, in dependence on the determined at least one anomaly criterion, in a conceptually appropriate manner. 5. The method of claim 1 , further comprising associating conceptual rules with each candidate word and each associated part of speech, and each syntactic sequence of words and each associated part of speech, wherein further the conceptual rules relate to conceptual relationships between at least two of the candidate words and syntactic sequences of words.
| 0.5 |
9,517,559 | 10 | 11 |
10. A robot control system according to claim 9 , further comprising a presuming module that presumes a degree of intimacy between the user and the robot, and a determination module that determines an action of the robot based on the presumed degree of intimacy.
|
10. A robot control system according to claim 9 , further comprising a presuming module that presumes a degree of intimacy between the user and the robot, and a determination module that determines an action of the robot based on the presumed degree of intimacy. 11. A robot control system according to claim 10 , wherein the determination module determines at least one of a reaction time until the robot begins to move, a movement speed when approaching, a distance to the user and a standing position, and a waiting position.
| 0.5 |
7,844,466 | 36 | 40 |
36. The system of claim 32 , wherein the processor is further adapted to associate conceptual rules with each candidate word and each associated part of speech, and each syntactic sequence of words and each associated part of speech, wherein further the conceptual rules relate to conceptual relationships between at least two of the candidate words and syntactic sequences of words.
|
36. The system of claim 32 , wherein the processor is further adapted to associate conceptual rules with each candidate word and each associated part of speech, and each syntactic sequence of words and each associated part of speech, wherein further the conceptual rules relate to conceptual relationships between at least two of the candidate words and syntactic sequences of words. 40. The system of claim 36 , wherein the conceptual rules comprise a compiled language.
| 0.793839 |
8,938,449 | 1 | 2 |
1. A method performed by a data processing apparatus, the method comprising: accessing, by the data processing apparatus, images stored in an image data store, the images being associated with respective sets of labels, each label describing content depicted in an image and having a respective confidence score that is a measure of confidence that the label accurately describes the content depicted in the image; accessing, by the data processing apparatus, one or more proximity metric values associated with a first image of the images; accessing, by the data processing apparatus, one or more proximity metric values associated with a second image of the images; determining, by the data processing apparatus, a proximity score for the second image based on a comparison of the proximity metric values of the first image and corresponding proximity metric values of the second image, the proximity score being a measure of a relatedness of the second image to the first image; identifying, by the data processing apparatus, a second label associated with the second image, the second label having a second confidence score that is a measure of confidence that the second label accurately describes the content depicted in the second image; and generating, by the data processing apparatus, a first label for the first image based on the second label, the proximity score for the second image, and the second confidence score for the second label; and determining, for the first label, a first confidence score based on the proximity score for the second image and the second confidence score for the second label, the first confidence score being a measure of confidence that the first label accurately describes the content depicted in the first image.
|
1. A method performed by a data processing apparatus, the method comprising: accessing, by the data processing apparatus, images stored in an image data store, the images being associated with respective sets of labels, each label describing content depicted in an image and having a respective confidence score that is a measure of confidence that the label accurately describes the content depicted in the image; accessing, by the data processing apparatus, one or more proximity metric values associated with a first image of the images; accessing, by the data processing apparatus, one or more proximity metric values associated with a second image of the images; determining, by the data processing apparatus, a proximity score for the second image based on a comparison of the proximity metric values of the first image and corresponding proximity metric values of the second image, the proximity score being a measure of a relatedness of the second image to the first image; identifying, by the data processing apparatus, a second label associated with the second image, the second label having a second confidence score that is a measure of confidence that the second label accurately describes the content depicted in the second image; and generating, by the data processing apparatus, a first label for the first image based on the second label, the proximity score for the second image, and the second confidence score for the second label; and determining, for the first label, a first confidence score based on the proximity score for the second image and the second confidence score for the second label, the first confidence score being a measure of confidence that the first label accurately describes the content depicted in the first image. 2. The method of claim 1 , wherein accessing the images is based on at least one of the one or more proximity metric values associated with the images being within a predetermined range.
| 0.647727 |
8,190,618 | 1 | 3 |
1. A computer program product for aggregating document usage information for an electronic document, the computer program product comprising one or more computer-readable tangible storage devices; program instructions, stored on at least one of the one or more storage devices, to assign a unique identifier to each segment of a plurality of segments of the electronic document at a time of creation of the electronic document; program instructions, stored on at least one of the one or more storage devices, to determine usage indication data associated with each segment of the plurality of segments of the electronic document, wherein the usage indication data comprise a measure of time spent using the electronic document; program instructions, stored on at least one of the one or more storage devices, to aggregate the usage indication data for a plurality of users of the electronic document on a segment by segment basis; and program instructions, stored on at least one of the one or more storage devices, to communicate to a user of the electronic document the aggregate usage indication data on a segment by segment basis.
|
1. A computer program product for aggregating document usage information for an electronic document, the computer program product comprising one or more computer-readable tangible storage devices; program instructions, stored on at least one of the one or more storage devices, to assign a unique identifier to each segment of a plurality of segments of the electronic document at a time of creation of the electronic document; program instructions, stored on at least one of the one or more storage devices, to determine usage indication data associated with each segment of the plurality of segments of the electronic document, wherein the usage indication data comprise a measure of time spent using the electronic document; program instructions, stored on at least one of the one or more storage devices, to aggregate the usage indication data for a plurality of users of the electronic document on a segment by segment basis; and program instructions, stored on at least one of the one or more storage devices, to communicate to a user of the electronic document the aggregate usage indication data on a segment by segment basis. 3. The computer program product of claim 1 , further comprising program instructions, stored on at least one of the one or more storage devices, to assign a unique identifier to a new segment added into a past version of the electronic document.
| 0.741015 |
8,543,397 | 1 | 2 |
1. A method, comprising: receiving, by a mobile computing device, an indication of a first user input comprising actuation of a graphical element, the actuation being associated with a voice input operation, the first user input being detected at a presence-sensitive display; responsive to receiving the indication of the first user input and prior to a termination of the actuation: initiating, by the mobile computing device, the voice input operation; receiving, by the mobile computing device using the voice input operation, a user-spoken search phrase comprising one or more search terms; outputting, by the mobile computing device and for display, one or more candidate text search phrases determined based at least in part on the user-spoken search phrase; receiving, by the mobile computing device, an indication of a gesture sliding from a first area of the presence-sensitive display associated with the one or more candidate text search phrases to a second area of the presence-sensitive display associated with an icon for an application; receiving, by the mobile computing device, an indication of a second user input, the second user input indicating the termination of the actuation, wherein the second user input indicates a completion of the user-spoken search phrase; and responsive to receiving the indication of the second user input, generating, by the mobile computing device and based on the user-spoken search phrase, a search query for the application to identify content associated with the one or more search terms.
|
1. A method, comprising: receiving, by a mobile computing device, an indication of a first user input comprising actuation of a graphical element, the actuation being associated with a voice input operation, the first user input being detected at a presence-sensitive display; responsive to receiving the indication of the first user input and prior to a termination of the actuation: initiating, by the mobile computing device, the voice input operation; receiving, by the mobile computing device using the voice input operation, a user-spoken search phrase comprising one or more search terms; outputting, by the mobile computing device and for display, one or more candidate text search phrases determined based at least in part on the user-spoken search phrase; receiving, by the mobile computing device, an indication of a gesture sliding from a first area of the presence-sensitive display associated with the one or more candidate text search phrases to a second area of the presence-sensitive display associated with an icon for an application; receiving, by the mobile computing device, an indication of a second user input, the second user input indicating the termination of the actuation, wherein the second user input indicates a completion of the user-spoken search phrase; and responsive to receiving the indication of the second user input, generating, by the mobile computing device and based on the user-spoken search phrase, a search query for the application to identify content associated with the one or more search terms. 2. The method of claim 1 , wherein receiving the indication of the first user input comprising the actuation of the graphical element comprises receiving a user actuation input at an area of the presence-sensitive display associated with graphical element displayed at the presence-sensitive display.
| 0.5 |
4,339,886 | 15 | 16 |
15. For a lettering kit providing English alphabet letters of the Helvetic font and in a predetermined nominal height having their undersides coated with a pressure sensitive adhesive and releasably mounted on the release agent coated side of a backing sheet, and an alignment grid sheet therefor bearing an alignment grid for manually laying out on one side of the grid sheet selected of said letters aligned in a predetermined order and spacing, with said one side of said grid sheet being release agent coated, the improvement wherein said grid comprises: a working face, including a foot horizontal base line indicia, delineated on said one side of said grid sheet, said foot base line indicia comprising a top base line, a middle base line and a bottom base line extending in parallelism across said one side of said grid sheet with said middle base line centered between said top and bottom base lines, said foot base line indicia top and bottom base lines being spaced from the middle base line thereof a distance approximating one-half the difference between the height of the font capital letters that have horizontally rectilinear upper and lower ends and the height of the font capital letters that have rounded upper and lower ends, said grid working face further comprising closely spaced vertical lines delineated in equal spacing on said one side of said grid sheet across said face, said grid having a length to receive for layout purposes a predetermined number of the font letters for word forming purposes, said font letters being layable out in uniform horizontal alignment by laying the lower ends of the font capital letters with horizontally rectilinear lower ends aligned with the top base line of said foot base line indicia, laying out the font lower case rounded letters with their lower ends aligned with the middle base line of said foot base line indicia, and laying out the font capital letters that have convexly rounded lower ends in tangency with the lower base line of said foot base line indicia, with predetermined vertical line separation between adjacent letters to achieve said spacing.
|
15. For a lettering kit providing English alphabet letters of the Helvetic font and in a predetermined nominal height having their undersides coated with a pressure sensitive adhesive and releasably mounted on the release agent coated side of a backing sheet, and an alignment grid sheet therefor bearing an alignment grid for manually laying out on one side of the grid sheet selected of said letters aligned in a predetermined order and spacing, with said one side of said grid sheet being release agent coated, the improvement wherein said grid comprises: a working face, including a foot horizontal base line indicia, delineated on said one side of said grid sheet, said foot base line indicia comprising a top base line, a middle base line and a bottom base line extending in parallelism across said one side of said grid sheet with said middle base line centered between said top and bottom base lines, said foot base line indicia top and bottom base lines being spaced from the middle base line thereof a distance approximating one-half the difference between the height of the font capital letters that have horizontally rectilinear upper and lower ends and the height of the font capital letters that have rounded upper and lower ends, said grid working face further comprising closely spaced vertical lines delineated in equal spacing on said one side of said grid sheet across said face, said grid having a length to receive for layout purposes a predetermined number of the font letters for word forming purposes, said font letters being layable out in uniform horizontal alignment by laying the lower ends of the font capital letters with horizontally rectilinear lower ends aligned with the top base line of said foot base line indicia, laying out the font lower case rounded letters with their lower ends aligned with the middle base line of said foot base line indicia, and laying out the font capital letters that have convexly rounded lower ends in tangency with the lower base line of said foot base line indicia, with predetermined vertical line separation between adjacent letters to achieve said spacing. 16. The improvement set forth in claim 15 wherein: said letters include Arabic numerals having their heights in the same dimension proportions as said font capital letters.
| 0.5 |
8,781,991 | 12 | 20 |
12. An emotion recognition apparatus, comprising: a data collection unit configured to collect sensing data from a terminal; a first emotion value acquisition unit configured to acquire a first emotion value corresponding to a first axis of a multidimensional emotion model based on an amount or an intensity of the sensing data; a second emotion value acquisition unit configured to acquire a second emotion value corresponding to a second axis of the multidimensional emotion model based on a meaning of the sensing data; a third emotion value acquisition unit configured to acquire a third emotion value corresponding to a user's personality trait; and an emotion estimation unit configured to estimate an emotional state of the user based on at least two selected from the group of the first emotion value, the second emotion value, and the third emotion value.
|
12. An emotion recognition apparatus, comprising: a data collection unit configured to collect sensing data from a terminal; a first emotion value acquisition unit configured to acquire a first emotion value corresponding to a first axis of a multidimensional emotion model based on an amount or an intensity of the sensing data; a second emotion value acquisition unit configured to acquire a second emotion value corresponding to a second axis of the multidimensional emotion model based on a meaning of the sensing data; a third emotion value acquisition unit configured to acquire a third emotion value corresponding to a user's personality trait; and an emotion estimation unit configured to estimate an emotional state of the user based on at least two selected from the group of the first emotion value, the second emotion value, and the third emotion value. 20. The emotion recognition apparatus of claim 12 , wherein the second emotion value acquisition unit further calculates a UC level by analyzing the meaning of sensing data relating to a context of the user, and calculates the second emotion value based on the calculated UC level.
| 0.798132 |
8,484,077 | 1 | 8 |
1. A computer-implemented method for combining probability of click models in an online advertising system, said method comprising: receiving, at a computer, at least one feature set slice; training, in a computer, a plurality of slice predictive models, the slice predictive models corresponding to at least a portion of the features in the at least one feature set slice; assigning weights, in a computer, to at least two of the plurality of slice predictive models by overlaying a weighted distribution model over the plurality of slice predictive models; and calculating, in a computer, a combined predictive model based on the at least two of the plurality of slice predictive models and their assigned weights.
|
1. A computer-implemented method for combining probability of click models in an online advertising system, said method comprising: receiving, at a computer, at least one feature set slice; training, in a computer, a plurality of slice predictive models, the slice predictive models corresponding to at least a portion of the features in the at least one feature set slice; assigning weights, in a computer, to at least two of the plurality of slice predictive models by overlaying a weighted distribution model over the plurality of slice predictive models; and calculating, in a computer, a combined predictive model based on the at least two of the plurality of slice predictive models and their assigned weights. 8. The method as set forth in claim 1 , wherein said training a plurality of slice predictive models comprises partitioning said training data set into a plurality of slices by generating a plurality of clusters from said training data.
| 0.5 |
7,587,318 | 1 | 6 |
1. A method of speech recognition, comprising: determining if video images of a speech source are detected; indicating if the video images are not detected; receiving audio signals from the speech source; receiving video signals from the speech source; detecting if the audio signals can be processed; processing the audio signals if it is detected that the audio signals can be processed; processing the video signals based on a detection that at least a portion of the audio signal cannot be processed; converting at least one of the audio signals and the video signals into recognizable information; and implementing a task based on the recognizable information.
|
1. A method of speech recognition, comprising: determining if video images of a speech source are detected; indicating if the video images are not detected; receiving audio signals from the speech source; receiving video signals from the speech source; detecting if the audio signals can be processed; processing the audio signals if it is detected that the audio signals can be processed; processing the video signals based on a detection that at least a portion of the audio signal cannot be processed; converting at least one of the audio signals and the video signals into recognizable information; and implementing a task based on the recognizable information. 6. The method of claim 1 , wherein at least the receiving of the audio signals and the receiving of the video signals occurs in a laptop computer, a home computer, a remote controller and/or a game console.
| 0.5 |
6,164,975 | 15 | 19 |
15. A method of generating a cognitive profile for a learner for use in selecting among different presentations of educational content delivered by a computer-based learning system, wherein the different presentations each have quantitative data representing the extent to which different attributes are present in the presentation, the method comprising the steps of: (a) providing an initial set of coefficients that together form at least a portion of the cognitive profile, wherein the coefficients comprise numeric values each of which is associated with at least one of the attributes; (b) providing feedback through iterations of the following steps (b1)-(b3): (b1) presenting educational content to the learner using different presentations having varying emphasis on different ones of the attributes; (b2) determining which of the presentations given to the learner results in the greatest comprehension of the educational content presented; and (b3) updating the coefficients using the quantitative data associated with the presentation identified in step (b2).
|
15. A method of generating a cognitive profile for a learner for use in selecting among different presentations of educational content delivered by a computer-based learning system, wherein the different presentations each have quantitative data representing the extent to which different attributes are present in the presentation, the method comprising the steps of: (a) providing an initial set of coefficients that together form at least a portion of the cognitive profile, wherein the coefficients comprise numeric values each of which is associated with at least one of the attributes; (b) providing feedback through iterations of the following steps (b1)-(b3): (b1) presenting educational content to the learner using different presentations having varying emphasis on different ones of the attributes; (b2) determining which of the presentations given to the learner results in the greatest comprehension of the educational content presented; and (b3) updating the coefficients using the quantitative data associated with the presentation identified in step (b2). 19. The method of claim 15, wherein step (a) further comprises providing learner-identifying data that forms a portion of the cognitive profile.
| 0.785075 |
7,873,183 | 33 | 35 |
33. The watermark detecting apparatus according to claim 30 , wherein said layout information obtaining unit further comprises a unit for dividing said document into a plurality of segments.
|
33. The watermark detecting apparatus according to claim 30 , wherein said layout information obtaining unit further comprises a unit for dividing said document into a plurality of segments. 35. The watermark detecting apparatus according to claim 33 , wherein said information extracting unit extracts each secret message of said secret message sequence based on font style changes in the corresponding segment indicated by each of the calculated embedded positions, respectively.
| 0.510135 |
9,824,331 | 1 | 2 |
1. A method for handling social media inputs in an existing multi-channel converged Computer Supported Telecommunications Applications (CSTA)-based infrastructure, the method comprising: receiving and adapting social media posts through enhanced CSTA payload to include Social Media as the social media inputs; performing a sentiment analysis by a sentiment analyzer by using the social media inputs received from the social media posts to generate sentiment analysis inputs based on textual and non-textual content including images describing facial expression and emotions; determining a priority and potential churn index by an indexer from the sentiment analysis inputs based on predetermined parameters, wherein each predetermined parameter has predefined weightage and scale; translating the priority and potential churn index into qualifiers using predetermined combinations of a severity index and a potential churn index; adapting the qualifiers for the social media posts into CSTA specifications to create adapted posts; and determining a routing of the adapted posts for further treatment using an inbound mechanism or an outbound mechanism, wherein the routing of the adapted posts using the inbound mechanism is carried out by leveraging a “one number service” of the CSTA-based infrastructure.
|
1. A method for handling social media inputs in an existing multi-channel converged Computer Supported Telecommunications Applications (CSTA)-based infrastructure, the method comprising: receiving and adapting social media posts through enhanced CSTA payload to include Social Media as the social media inputs; performing a sentiment analysis by a sentiment analyzer by using the social media inputs received from the social media posts to generate sentiment analysis inputs based on textual and non-textual content including images describing facial expression and emotions; determining a priority and potential churn index by an indexer from the sentiment analysis inputs based on predetermined parameters, wherein each predetermined parameter has predefined weightage and scale; translating the priority and potential churn index into qualifiers using predetermined combinations of a severity index and a potential churn index; adapting the qualifiers for the social media posts into CSTA specifications to create adapted posts; and determining a routing of the adapted posts for further treatment using an inbound mechanism or an outbound mechanism, wherein the routing of the adapted posts using the inbound mechanism is carried out by leveraging a “one number service” of the CSTA-based infrastructure. 2. The method of claim 1 , wherein the social media posts are received through crawlers.
| 0.87172 |
10,002,129 | 1 | 2 |
1. A method for extracting subject-verb-object (SVO) chunked text from unstructured text, the method comprising: identifying, by a SVO chunked text computing device, a plurality of part of speech (PoS) tokens in an unstructured text; and determining, by the SVO chunked text computing device, a SVO chunked text directly from the plurality of PoS tokens using a machine learning chunker model, wherein the machine learning chunker model is trained on an SVO annotated training data, wherein the SVO annotated training data comprises a plurality of tokens, a plurality of corresponding PoS tags, and a plurality of corresponding SVO tags, the plurality of corresponding SVO tags comprises one or more of a subject tag, a verb tag, an object tag, or an object-subject tag, and the plurality of corresponding SVO tags is in beginninginside-other (BIO) format, and wherein the SVO annotated training data is generated based on a plurality of corresponding span information for the plurality of tokens by for each of a plurality of PoS tokens in each of a plurality of sets of syntactically related PoS tokens in a sentence, detecting a span information for a PoS token and tagging the PoS token as a subject, a verb, an object, or an object-subject based on the span information and a pervious tagging of the PoS token.
|
1. A method for extracting subject-verb-object (SVO) chunked text from unstructured text, the method comprising: identifying, by a SVO chunked text computing device, a plurality of part of speech (PoS) tokens in an unstructured text; and determining, by the SVO chunked text computing device, a SVO chunked text directly from the plurality of PoS tokens using a machine learning chunker model, wherein the machine learning chunker model is trained on an SVO annotated training data, wherein the SVO annotated training data comprises a plurality of tokens, a plurality of corresponding PoS tags, and a plurality of corresponding SVO tags, the plurality of corresponding SVO tags comprises one or more of a subject tag, a verb tag, an object tag, or an object-subject tag, and the plurality of corresponding SVO tags is in beginninginside-other (BIO) format, and wherein the SVO annotated training data is generated based on a plurality of corresponding span information for the plurality of tokens by for each of a plurality of PoS tokens in each of a plurality of sets of syntactically related PoS tokens in a sentence, detecting a span information for a PoS token and tagging the PoS token as a subject, a verb, an object, or an object-subject based on the span information and a pervious tagging of the PoS token. 2. The method of claim 1 , wherein identifying the plurality of PoS tokens comprises: extracting a plurality of tokens from the input text, wherein each of the plurality of tokens comprises a word or a phrase; and determining a PoS tag for each of the plurality of tokens.
| 0.682984 |
8,447,610 | 5 | 7 |
5. Apparatus for use with a speech-enabled application, the apparatus comprising: a memory storing a plurality of processor-executable instructions; and at least one processor, operatively coupled to the memory, configured to execute the instructions to: receive from the speech-enabled application, input comprising a plurality of text strings; identify a first portion of a first text string of the plurality of text strings that differs from a corresponding first portion of a second text string of the plurality of text strings, and a second portion of the first text string that does not differ from a corresponding second portion of the second text string; assign contrastive stress to the identified first portion of the first text string, but not to the identified second portion of the first text string; generate speech synthesis output corresponding to the plurality of text strings, the speech synthesis output identifying a plurality of audio recordings to render the plurality of text strings as speech, at least one of the plurality of audio recordings being selected to render the first portion of the first text string as speech carrying contrastive stress, to contrast with the rendering of the second text string; and provide the speech synthesis output for the speech-enabled application.
|
5. Apparatus for use with a speech-enabled application, the apparatus comprising: a memory storing a plurality of processor-executable instructions; and at least one processor, operatively coupled to the memory, configured to execute the instructions to: receive from the speech-enabled application, input comprising a plurality of text strings; identify a first portion of a first text string of the plurality of text strings that differs from a corresponding first portion of a second text string of the plurality of text strings, and a second portion of the first text string that does not differ from a corresponding second portion of the second text string; assign contrastive stress to the identified first portion of the first text string, but not to the identified second portion of the first text string; generate speech synthesis output corresponding to the plurality of text strings, the speech synthesis output identifying a plurality of audio recordings to render the plurality of text strings as speech, at least one of the plurality of audio recordings being selected to render the first portion of the first text string as speech carrying contrastive stress, to contrast with the rendering of the second text string; and provide the speech synthesis output for the speech-enabled application. 7. The apparatus of claim 5 , wherein the first and second text strings represent different numerical fields within a larger text string.
| 0.789877 |
8,802,957 | 12 | 18 |
12. A method for creating a professional-quality media production, the method comprising: recording an acting performance in a professional media studio; identifying a portion of the acting performance for which replacement dialogue is desired, after the performance in the professional media studio has been completed; making guide data available on a media server, the guide data including audio and video from the portion of the acting performance for which replacement dialogue is desired; providing an actor from the acting performance with a mobile device equipped to: (1) download the guide data from the media server; (2) receive user-input indicating selection to play said guide media items; (3) play a user-configurable lead-in queue; (4) upon completion of said lead-in queue, play the guide data in order to permit the actor to practice a replacement performance while viewing the guide data; (5) record multiple takes of the actor's performance of the replacement dialogue while playing the guide data to the actor; (6) receive feedback from the actor regarding the multiple recorded takes and store said feedback as user feedback data; and (7) upload the multiple recorded takes and the user feedback data to a media server; receiving the multiple recorded takes and the user feedback data from the mobile device; evaluating the multiple recorded takes based at least in part on the user feedback data; selecting one of the recorded takes as the replacement dialogue for the identified portion of the acting performance; replacing the identified portion of the acting performance with the selected recorded take in order to generate a professional-quality media production comprising the replacement dialogue; and providing the professional-quality media production with the replacement dialogue for use in the entertainment industry.
|
12. A method for creating a professional-quality media production, the method comprising: recording an acting performance in a professional media studio; identifying a portion of the acting performance for which replacement dialogue is desired, after the performance in the professional media studio has been completed; making guide data available on a media server, the guide data including audio and video from the portion of the acting performance for which replacement dialogue is desired; providing an actor from the acting performance with a mobile device equipped to: (1) download the guide data from the media server; (2) receive user-input indicating selection to play said guide media items; (3) play a user-configurable lead-in queue; (4) upon completion of said lead-in queue, play the guide data in order to permit the actor to practice a replacement performance while viewing the guide data; (5) record multiple takes of the actor's performance of the replacement dialogue while playing the guide data to the actor; (6) receive feedback from the actor regarding the multiple recorded takes and store said feedback as user feedback data; and (7) upload the multiple recorded takes and the user feedback data to a media server; receiving the multiple recorded takes and the user feedback data from the mobile device; evaluating the multiple recorded takes based at least in part on the user feedback data; selecting one of the recorded takes as the replacement dialogue for the identified portion of the acting performance; replacing the identified portion of the acting performance with the selected recorded take in order to generate a professional-quality media production comprising the replacement dialogue; and providing the professional-quality media production with the replacement dialogue for use in the entertainment industry. 18. The method of claim 12 , wherein the user-configurable lead-in queue is a countdown timer configured to produce three introductory beep lasing two seconds.
| 0.563187 |
6,128,634 | 13 | 19 |
13. An apparatus for facilitating skimming of a document by a user, the document having a plurality of terms, the apparatus comprising: a processing system that determines a term-score for each of the plurality of terms and that maps the term-score of each of the plurality of terms onto one of at least three values of at least one variable emphasis attribute usable to present the document; and a presentation system that presents each of the plurality of terms of the document using the corresponding mapped values of the at least one variable emphasis attribute.
|
13. An apparatus for facilitating skimming of a document by a user, the document having a plurality of terms, the apparatus comprising: a processing system that determines a term-score for each of the plurality of terms and that maps the term-score of each of the plurality of terms onto one of at least three values of at least one variable emphasis attribute usable to present the document; and a presentation system that presents each of the plurality of terms of the document using the corresponding mapped values of the at least one variable emphasis attribute. 19. The apparatus of claim 13, further comprising a variable emphasis adjuster.
| 0.813679 |
8,019,760 | 1 | 2 |
1. A computer implemented method, comprising: storing search results at a server based on a search engine query, wherein said search results comprise a plurality of items; generating at the server a first set of clusters responsive to the search engine query, wherein each of said items is associated with at least one cluster in said first set of clusters; sending the first set of clusters to a terminal configured to display the first set of clusters; receiving at the server user input consisting of an indication to recluster the search results; generating at the server a second set of clusters, wherein said second set of clusters excludes one or more clusters from said first set of clusters, and wherein each of said items is associated with at least one cluster in said second set of clusters; and sending the second set of clusters to the terminal configured to display the second set of clusters, wherein each cluster is defined by a cluster title, and wherein generating at the server a second set of clusters comprises excluding from the second set of clusters one or more cluster titles used in said first set of clusters, excluding the literal phraseology of at least one cluster title in the first set of clusters from the second set of clusters, and excluding a linguistic equivalence class corresponding to at least one cluster title in the first set of clusters from the second set of clusters, and wherein generating the second set of clusters comprises excluding each displayed cluster of the first set of clusters from the second set of clusters.
|
1. A computer implemented method, comprising: storing search results at a server based on a search engine query, wherein said search results comprise a plurality of items; generating at the server a first set of clusters responsive to the search engine query, wherein each of said items is associated with at least one cluster in said first set of clusters; sending the first set of clusters to a terminal configured to display the first set of clusters; receiving at the server user input consisting of an indication to recluster the search results; generating at the server a second set of clusters, wherein said second set of clusters excludes one or more clusters from said first set of clusters, and wherein each of said items is associated with at least one cluster in said second set of clusters; and sending the second set of clusters to the terminal configured to display the second set of clusters, wherein each cluster is defined by a cluster title, and wherein generating at the server a second set of clusters comprises excluding from the second set of clusters one or more cluster titles used in said first set of clusters, excluding the literal phraseology of at least one cluster title in the first set of clusters from the second set of clusters, and excluding a linguistic equivalence class corresponding to at least one cluster title in the first set of clusters from the second set of clusters, and wherein generating the second set of clusters comprises excluding each displayed cluster of the first set of clusters from the second set of clusters. 2. The computer implemented method of claim 1 , wherein each generating step comprises: determining one or more linguistic equivalence classes, each linguistic equivalence class identifying a primary term and one or more corresponding linguistically similar terms, and for each linguistic equivalence class, treating all linguistically similar terms within the search results as identical to the corresponding primary term.
| 0.5 |
8,898,063 | 1 | 4 |
1. A computer based method for extracting data values from a conversation to complete an electronic trade ticket over a communications network, comprising the steps of: routing an incoming call from a first user to a second user by a digital switchboard to a processor based server over the communications network; verifying telephone numbers of the first and second users against the stored telephone numbers in a database by a server processor; recording a conversation between the first and second users by a recorder of the server and storing the conversation in the database; obtaining a sample representing a predetermined period of the conversation by a speaker engine of the server to identify and verify the first and second users; transcribing the conversation to an electronic text file by a speech recognition engine of the server and storing the electronic text file in the database; performing natural language processing on the electronic text file by a natural language processing engine of the server to correct typographical, syntax and form errors, and to obtain trade information through relational co-reference and entity tracking; and generating an electronic trade ticket by extracting terms from the electronic text file to populate data fields of the electronic trade ticket by a ticket generator of the server.
|
1. A computer based method for extracting data values from a conversation to complete an electronic trade ticket over a communications network, comprising the steps of: routing an incoming call from a first user to a second user by a digital switchboard to a processor based server over the communications network; verifying telephone numbers of the first and second users against the stored telephone numbers in a database by a server processor; recording a conversation between the first and second users by a recorder of the server and storing the conversation in the database; obtaining a sample representing a predetermined period of the conversation by a speaker engine of the server to identify and verify the first and second users; transcribing the conversation to an electronic text file by a speech recognition engine of the server and storing the electronic text file in the database; performing natural language processing on the electronic text file by a natural language processing engine of the server to correct typographical, syntax and form errors, and to obtain trade information through relational co-reference and entity tracking; and generating an electronic trade ticket by extracting terms from the electronic text file to populate data fields of the electronic trade ticket by a ticket generator of the server. 4. The method of claim 1 , further comprising the step of accessing the server over the communications network by a client device associated with each user.
| 0.777143 |
9,208,151 | 13 | 14 |
13. A specification verification system, comprising: a processor device configured to: (a) retain a plurality of abstract documents, each said abstract document of said plurality indicating a value corresponding to a metadata of that document; (b) separate a group of abstract documents based on an input condition of an operation; (c) add a new abstract document to the separated group by using, based on an output condition, at least one said operation within a group of said operations; (d) separate said abstract documents according to overlapping ranges of values designated by each said metadata of abstract documents indicated in said group; (e) unify said group of abstract documents according to overlapping ranges designated by each said metadata of abstract documents indicated in said group; (f) repeat functions (b) to (e) until a termination condition is satisfied; and (g) verify whether an incomplete abstract document exists when said termination condition is satisfied; wherein said plurality of abstract documents associated with a plurality of said metadata are processed; wherein said group of said operations are applied collectively by an operation specification specifying document processing operations; wherein said input condition that is a condition of a range of values of said metadata capable of application of a respective operation is retained for each of said operation; and wherein an output condition that is a change of said metadata value after use of said respective operation is retained for each of said operation.
|
13. A specification verification system, comprising: a processor device configured to: (a) retain a plurality of abstract documents, each said abstract document of said plurality indicating a value corresponding to a metadata of that document; (b) separate a group of abstract documents based on an input condition of an operation; (c) add a new abstract document to the separated group by using, based on an output condition, at least one said operation within a group of said operations; (d) separate said abstract documents according to overlapping ranges of values designated by each said metadata of abstract documents indicated in said group; (e) unify said group of abstract documents according to overlapping ranges designated by each said metadata of abstract documents indicated in said group; (f) repeat functions (b) to (e) until a termination condition is satisfied; and (g) verify whether an incomplete abstract document exists when said termination condition is satisfied; wherein said plurality of abstract documents associated with a plurality of said metadata are processed; wherein said group of said operations are applied collectively by an operation specification specifying document processing operations; wherein said input condition that is a condition of a range of values of said metadata capable of application of a respective operation is retained for each of said operation; and wherein an output condition that is a change of said metadata value after use of said respective operation is retained for each of said operation. 14. The system according to claim 13 , wherein said processor device is further configured to: form a graph structure by forming nodes from said abstract documents and links from said operations and retaining said abstract documents.
| 0.5 |
9,020,207 | 19 | 21 |
19. A method comprising: determining, by a biometric enrollment system and for each person in a group of multiple, different people, a similarity score that represents a similarity between a biometric image of at least a portion of the corresponding person from the group of multiple, different people and a reference image, wherein the reference image is used in determining all of the similarity scores for the group of multiple, different people; sorting biometric data that includes all of the determined similarity scores using the determined similarity scores; maintaining, in electronic storage and for the group of multiple, different people, the biometric data that includes all of the sorted similarity scores; accessing a particular biometric image of at least a portion of a particular person; accessing the reference image used in computing all of the similarity scores maintained in the electronic storage; computing a particular similarity score that represents similarity between the accessed particular biometric image and the reference image; searching, by a biometric authentication system that includes at least one processor and using the computed particular similarity score, the sorted similarity scores included in the biometric data for the group of multiple, different people; and outputting a result based on determination of whether the electronic storage includes data for the particular person in the biometric data.
|
19. A method comprising: determining, by a biometric enrollment system and for each person in a group of multiple, different people, a similarity score that represents a similarity between a biometric image of at least a portion of the corresponding person from the group of multiple, different people and a reference image, wherein the reference image is used in determining all of the similarity scores for the group of multiple, different people; sorting biometric data that includes all of the determined similarity scores using the determined similarity scores; maintaining, in electronic storage and for the group of multiple, different people, the biometric data that includes all of the sorted similarity scores; accessing a particular biometric image of at least a portion of a particular person; accessing the reference image used in computing all of the similarity scores maintained in the electronic storage; computing a particular similarity score that represents similarity between the accessed particular biometric image and the reference image; searching, by a biometric authentication system that includes at least one processor and using the computed particular similarity score, the sorted similarity scores included in the biometric data for the group of multiple, different people; and outputting a result based on determination of whether the electronic storage includes data for the particular person in the biometric data. 21. The method of claim 19 : wherein accessing the particular biometric image of at least the portion of the particular person comprises accessing an image of a fingerprint of the particular person; wherein accessing the reference image comprises accessing a reference image of a fingerprint of a reference person; and wherein computing the particular similarity score that represents similarity between the accessed particular biometric image and the reference image comprises computing a similarity score that represents similarity between the accessed image of the fingerprint of the particular person and the reference image of the fingerprint of the reference person.
| 0.719766 |
8,224,804 | 1 | 6 |
1. A method for indexing and searching for resources, the method comprising: storing, by a computing system, an index comprising a plurality of index entries, the index entries partitioned among a plurality of index partitions, each index partition in the plurality of index partitions associated with at least one website in a plurality of websites; for each given website in the plurality of websites: automatically updating, by the computing system, the index such that a given index partition in the plurality of index partitions comprises index entries that map terms in a first set of terms to web pages in the given website that contain terms in the first set of terms, the given website associated with the given index partition; automatically obtaining, by the computing system, a set of external partition identifiers, each external partition identifier in the set of external partition identifiers identifying external partitions of external data sources used by the given website, wherein automatically obtaining the set of external partition identifiers comprises: sending, by the computing system, a service request to a website proxy associated with the given website; and receiving, at the computing system, a service response from the website proxy, the service response comprising the set of external partition identifiers wherein the website proxy implements an application programming interface (API) that includes a first method and a second method and wherein sending the service request comprises, invoking, by a search proxy in the computing system, the first method and the second method, wherein invoking the first method comprises returning a list of references to each of the plurality of web pages in the given website, wherein invoking the second method comprises returning a copy of each of the plurality of web pages in the given website indicated in the list of references; and for each given external partition identifier in the set of external partition identifiers, automatically updating, by the computing system, the index such that the given index partition comprises index entries that map terms in a second set of terms to external resources in the given set of external resources that contain terms in the second set of terms, a given external partition identified by the given external partition identifier containing the given set of external resources; receiving, by the computing system, a query request from a client, the query request specifying a query term, the query request indicating a target website; and in response to receiving the query request: automatically identifying, by the computing system, a target index partition in the plurality of index partitions, the target website associated with the target index partition; automatically using, by the computing system, index entries in the target index partition to identify a relevant set of resources, each resource in the relevant set of resources containing the query term; and providing, by the computing system, a relevant set of resource identifiers to the client, each resource identifier in the relevant set of resource identifiers identifying a resource in the relevant set of resources.
|
1. A method for indexing and searching for resources, the method comprising: storing, by a computing system, an index comprising a plurality of index entries, the index entries partitioned among a plurality of index partitions, each index partition in the plurality of index partitions associated with at least one website in a plurality of websites; for each given website in the plurality of websites: automatically updating, by the computing system, the index such that a given index partition in the plurality of index partitions comprises index entries that map terms in a first set of terms to web pages in the given website that contain terms in the first set of terms, the given website associated with the given index partition; automatically obtaining, by the computing system, a set of external partition identifiers, each external partition identifier in the set of external partition identifiers identifying external partitions of external data sources used by the given website, wherein automatically obtaining the set of external partition identifiers comprises: sending, by the computing system, a service request to a website proxy associated with the given website; and receiving, at the computing system, a service response from the website proxy, the service response comprising the set of external partition identifiers wherein the website proxy implements an application programming interface (API) that includes a first method and a second method and wherein sending the service request comprises, invoking, by a search proxy in the computing system, the first method and the second method, wherein invoking the first method comprises returning a list of references to each of the plurality of web pages in the given website, wherein invoking the second method comprises returning a copy of each of the plurality of web pages in the given website indicated in the list of references; and for each given external partition identifier in the set of external partition identifiers, automatically updating, by the computing system, the index such that the given index partition comprises index entries that map terms in a second set of terms to external resources in the given set of external resources that contain terms in the second set of terms, a given external partition identified by the given external partition identifier containing the given set of external resources; receiving, by the computing system, a query request from a client, the query request specifying a query term, the query request indicating a target website; and in response to receiving the query request: automatically identifying, by the computing system, a target index partition in the plurality of index partitions, the target website associated with the target index partition; automatically using, by the computing system, index entries in the target index partition to identify a relevant set of resources, each resource in the relevant set of resources containing the query term; and providing, by the computing system, a relevant set of resource identifiers to the client, each resource identifier in the relevant set of resource identifiers identifying a resource in the relevant set of resources. 6. The method of claim 1 , wherein automatically updating the index such that the given index partition comprises index entries that map terms in the second set of terms to external resources comprises: automatically adding, by the computing system, a new index entry to the given index partition, the new index entry mapping a given term in the second set of terms to a given external resource that contains the given term, the given external partition containing the given external resource.
| 0.666892 |
9,128,702 | 1 | 5 |
1. A system comprising: a computing device comprising: a processor; an operating system that includes an execution environment in which applications can execute computer-specific commands; and a web-browser application comprising: a scripting environment for interpreting scripted modules according to one or more security policies that restrict interpretation of scripted modules; a native environment in which native modules can securely execute computer-specific commands, the native environment configured to restrict native modules from accessing one or more resources of the computing device or to restrict execution of one or more computer-specific commands; and an interface between the scripting environment of the web-browser application and the native environment of the web-browser application, the interface including functions to asynchronously pass data objects by value, from one of the scripting environment and the native environment, to the other of the scripting environment and the native environment, by providing copies of the data objects to one of the scripting environment and the native environment so that the copies are available to a scripted module or a native module in the other of the scripting environment and the native environment, respectively.
|
1. A system comprising: a computing device comprising: a processor; an operating system that includes an execution environment in which applications can execute computer-specific commands; and a web-browser application comprising: a scripting environment for interpreting scripted modules according to one or more security policies that restrict interpretation of scripted modules; a native environment in which native modules can securely execute computer-specific commands, the native environment configured to restrict native modules from accessing one or more resources of the computing device or to restrict execution of one or more computer-specific commands; and an interface between the scripting environment of the web-browser application and the native environment of the web-browser application, the interface including functions to asynchronously pass data objects by value, from one of the scripting environment and the native environment, to the other of the scripting environment and the native environment, by providing copies of the data objects to one of the scripting environment and the native environment so that the copies are available to a scripted module or a native module in the other of the scripting environment and the native environment, respectively. 5. The system of claim 1 , wherein at least one of the data objects is a serialized string.
| 0.944172 |
8,914,351 | 8 | 9 |
8. The method of claim 7 , wherein the second original electronic document previously stored in the non-transitory computer readable medium includes an e-mail message, text message or an instant message, the audio file includes a voice mail message, the video files includes a video file or and video message.
|
8. The method of claim 7 , wherein the second original electronic document previously stored in the non-transitory computer readable medium includes an e-mail message, text message or an instant message, the audio file includes a voice mail message, the video files includes a video file or and video message. 9. The method of claim 8 , wherein the second original electronic document was previously stored in the non-transitory computer readable medium and includes the second original electronic document downloaded from another server network device on a telecommunications network.
| 0.5 |
9,015,549 | 2 | 3 |
2. The method of claim 1 , wherein performing the first iteration of inner code error correction process comprises: selecting inner code words to determine selected inner code words; and determining whether errors in the selected inner code words can be corrected by the inner code.
|
2. The method of claim 1 , wherein performing the first iteration of inner code error correction process comprises: selecting inner code words to determine selected inner code words; and determining whether errors in the selected inner code words can be corrected by the inner code. 3. The method of claim 2 , wherein if the errors in at least one of the selected inner code words fails to be corrected by the inner code, then perform the first iteration of the outer code word error correction process.
| 0.5 |
8,970,854 | 1 | 4 |
1. A document management system comprising: a storage section that stores at least one of an electronic manuscript and an electronic document generated by combining a plurality of pages of electronic manuscripts; a reference electronic manuscript acquisition section that acquires a reference electronic manuscript used for identifying a specified reference page, among the pages of the electronic manuscripts, of an edit part in an edit electronic document that is an electronic document to be edited and is read from the storage section; an edit part identification section that identifies the specified reference page of the edit part in the edit electronic document based on the reference electronic manuscript; a document editing processing section that performs editing processing for the specified reference page of the edit part identified by the edit part identification section, in units of electronic manuscripts; and an edit electronic manuscript acquisition section that acquires a given number of sheets of electronic manuscripts necessary in the editing processing, wherein the editing processing includes one of a manuscript deletion mode, a manuscript substitution mode, a manuscript addition mode, and a manuscript exchange mode, wherein the edit part identification section identifies at least one of a start position of the editing processing, a start position of the edit part, and an end position of the edit part based on the electronic manuscript, which is located at the specified reference page and is extracted by an edit reference manuscript extraction section, and with adopting, as a reference, the start position of the editing processing, the start position of the edit part, or the end position of the edit part identified by the edit part identification section, the document editing processing section performs the editing processing for the electronic manuscripts in the edit part of the edit electronic document, and wherein the edit part identification section identifies at least one of a start position of substitution processing, a start position of a substitution range, and an end position of the substitution range based on the electronic manuscript, which is located at the specified reference page and is extracted by the edit reference manuscript extraction section, and the document editing processing section includes a substitution processing section that, with adopting as a reference the start position of substitution processing, the start position of substitution range, or the end position of substitution range identified by the edit part identification section, substitutes electronic manuscripts within the substitution range in the edit electronic document with the given number of sheets of the electronic manuscripts acquired by the edit electronic manuscript acquisition section.
|
1. A document management system comprising: a storage section that stores at least one of an electronic manuscript and an electronic document generated by combining a plurality of pages of electronic manuscripts; a reference electronic manuscript acquisition section that acquires a reference electronic manuscript used for identifying a specified reference page, among the pages of the electronic manuscripts, of an edit part in an edit electronic document that is an electronic document to be edited and is read from the storage section; an edit part identification section that identifies the specified reference page of the edit part in the edit electronic document based on the reference electronic manuscript; a document editing processing section that performs editing processing for the specified reference page of the edit part identified by the edit part identification section, in units of electronic manuscripts; and an edit electronic manuscript acquisition section that acquires a given number of sheets of electronic manuscripts necessary in the editing processing, wherein the editing processing includes one of a manuscript deletion mode, a manuscript substitution mode, a manuscript addition mode, and a manuscript exchange mode, wherein the edit part identification section identifies at least one of a start position of the editing processing, a start position of the edit part, and an end position of the edit part based on the electronic manuscript, which is located at the specified reference page and is extracted by an edit reference manuscript extraction section, and with adopting, as a reference, the start position of the editing processing, the start position of the edit part, or the end position of the edit part identified by the edit part identification section, the document editing processing section performs the editing processing for the electronic manuscripts in the edit part of the edit electronic document, and wherein the edit part identification section identifies at least one of a start position of substitution processing, a start position of a substitution range, and an end position of the substitution range based on the electronic manuscript, which is located at the specified reference page and is extracted by the edit reference manuscript extraction section, and the document editing processing section includes a substitution processing section that, with adopting as a reference the start position of substitution processing, the start position of substitution range, or the end position of substitution range identified by the edit part identification section, substitutes electronic manuscripts within the substitution range in the edit electronic document with the given number of sheets of the electronic manuscripts acquired by the edit electronic manuscript acquisition section. 4. The document management system according to claim 1 , wherein the edit part identification section compares the reference electronic manuscript against each of the electronic manuscripts constituting the edit electronic documents and identifies the edit part based on a score indicating a level of similarity between the reference electronic manuscript and each of the electronic manuscripts.
| 0.5 |
9,117,452 | 6 | 10 |
6. A non-transitory computer readable storage medium storing instructions executable by a data processing apparatus and that upon such execution causes the data processing apparatus to perform operations comprising: accessing command input logs storing: data defining received input sentences, each input sentence being one or more n-grams; data indicating a first action performed by user devices from which input sentences were received, the first action having been performed, in part, in response to an input sentence being successfully parsed by a first parsing rule that is associated with the first action; identifying first input sentences that are successfully parsed by the parsing rule; identifying a second input sentence having a signal indicative of user satisfaction, wherein the second input sentence is identified from among the first input sentences, and the signal is derived from data that is independent of performance of the first action, the identifying comprising, for each first input sentence: determining that a second action for which the first input sentence was received as input was performed, the second action being different from the first action; determining that data responsive to the second action meets a quality threshold; and in response to the data responsive to the second action meeting the quality threshold, determining that the first input sentence is a second input sentence having a signal indicative of user satisfaction; and generating data that precludes invocation of the first action for the second input sentence.
|
6. A non-transitory computer readable storage medium storing instructions executable by a data processing apparatus and that upon such execution causes the data processing apparatus to perform operations comprising: accessing command input logs storing: data defining received input sentences, each input sentence being one or more n-grams; data indicating a first action performed by user devices from which input sentences were received, the first action having been performed, in part, in response to an input sentence being successfully parsed by a first parsing rule that is associated with the first action; identifying first input sentences that are successfully parsed by the parsing rule; identifying a second input sentence having a signal indicative of user satisfaction, wherein the second input sentence is identified from among the first input sentences, and the signal is derived from data that is independent of performance of the first action, the identifying comprising, for each first input sentence: determining that a second action for which the first input sentence was received as input was performed, the second action being different from the first action; determining that data responsive to the second action meets a quality threshold; and in response to the data responsive to the second action meeting the quality threshold, determining that the first input sentence is a second input sentence having a signal indicative of user satisfaction; and generating data that precludes invocation of the first action for the second input sentence. 10. The non-transitory computer readable storage medium of claim 6 , wherein the parsing rule is a grammar based rule.
| 0.746781 |
7,711,142 | 1 | 8 |
1. A method for configuring a digital signature appearance graphic into an electronic document, the method being embodied as instructions executed by one or more computer processors, the method comprising the Steps of: one or more computer processors generating a composition environment for configuring a digital signature appearance where said composition environment comprises a composition window separate from said electronic document and tools for said configuring, said composition window and said electronic document being superimposed where a composition window placement is movable with respect to said electronic document during said configuring; one or more computer processors using said composition environment to configure said digital signature appearance in said composition window; one or more computer processors associating an absolute scale to said digital signature appearance where said absolute scale and said composition window placement facilitate alignment of elements of said digital signature appearance with elements of said electronic document; and one or more computer processors using said composition environment to specify a reference point in said composition window, whereby locations of said elements of said digital signature appearance are relative to said reference point and said reference point being operable for use as a placement origin point.
|
1. A method for configuring a digital signature appearance graphic into an electronic document, the method being embodied as instructions executed by one or more computer processors, the method comprising the Steps of: one or more computer processors generating a composition environment for configuring a digital signature appearance where said composition environment comprises a composition window separate from said electronic document and tools for said configuring, said composition window and said electronic document being superimposed where a composition window placement is movable with respect to said electronic document during said configuring; one or more computer processors using said composition environment to configure said digital signature appearance in said composition window; one or more computer processors associating an absolute scale to said digital signature appearance where said absolute scale and said composition window placement facilitate alignment of elements of said digital signature appearance with elements of said electronic document; and one or more computer processors using said composition environment to specify a reference point in said composition window, whereby locations of said elements of said digital signature appearance are relative to said reference point and said reference point being operable for use as a placement origin point. 8. The digital signature method of claim 1 , in which said Step of specifying a reference point comprising the Step of initializing said reference point to an optionally changeable default value.
| 0.648014 |
9,239,862 | 1 | 4 |
1. A method of operating a user equipment (UE), comprising: determining to load a web page via a mobile browsing application on the UE; obtaining, from a web server associated with the web page, web page resource information that is required to load the web page on the UE; loading the web page on the UE using the web page resource information; determining, by the UE based on the web page resource information obtained from the web server, one or more hints for assisting one or more mobile browsing applications on at least one other UE to perform an initial load of the web page without interacting with the web server to acquire the web page resource information; and reporting the one or more hints to a hints server for selective distribution of the one or more hints to the at least one other UE.
|
1. A method of operating a user equipment (UE), comprising: determining to load a web page via a mobile browsing application on the UE; obtaining, from a web server associated with the web page, web page resource information that is required to load the web page on the UE; loading the web page on the UE using the web page resource information; determining, by the UE based on the web page resource information obtained from the web server, one or more hints for assisting one or more mobile browsing applications on at least one other UE to perform an initial load of the web page without interacting with the web server to acquire the web page resource information; and reporting the one or more hints to a hints server for selective distribution of the one or more hints to the at least one other UE. 4. The method of claim 1 , further comprising: determining, in response to the determination to load the web page, that no cached web page resource information acquired via a previous loading of the web page is available on the UE, wherein the obtaining is performed in response to the unavailability determination.
| 0.5 |
8,881,005 | 4 | 6 |
4. The method of claim 1 , wherein the calculating the variable cost distance comprises utilizing a Damerau-Levenshtein distance to determine a cost of correcting the spelling errors.
|
4. The method of claim 1 , wherein the calculating the variable cost distance comprises utilizing a Damerau-Levenshtein distance to determine a cost of correcting the spelling errors. 6. The method of claim 4 , wherein the determining the best candidate solution comprises comparing the spelling errors with all words in a dictionary using the variable cost distance and selecting one or more words having a minimum variable cost distance.
| 0.5 |
5,546,168 | 6 | 8 |
6. An image forming apparatus comprising: document sheet recirculating means for separating document sheets from a stack of document sheets, feeding the separated document sheets onto a document table, and returning the document sheets from the document table to the stack, thereby recirculating the document sheets; exposure means for scanning and exposing the document sheets fed onto the document table by said document recirculating means, said exposure means operating in one of a first exposure mode in which said document recirculating means temporarily stations each document sheet on the document table while said exposure means is moved to scan and expose the stationary document sheet and a second exposure mode in which said exposure means remains stationary while said document recirculating means moves each document sheet across the document table to cause the document to be scanned and exposed; image forming means for forming images on recording sheets from the document sheets that have been scanned and exposed by said exposure means; sheet receiving means for receiving and storing the recording sheets carrying images formed by said image forming means, said receiving means having a plurality of sheet receiving portions and operating in one of the first exposure mode and the second exposure mode; selecting means for selecting one of a first receiving mode in which a set of recording medium sheets having images corresponding to those on the stack of document sheets are received and stored in each of a plurality of sheet receiving portions of said sheet receiving means and a second receiving mode in which each sheet receiving portion of said sheet receiving means receives and stores a plurality of recording medium sheets having images corresponding to that on one of said document sheets; and control means for controlling each combination of the first and second exposure modes and the first and second receiving modes.
|
6. An image forming apparatus comprising: document sheet recirculating means for separating document sheets from a stack of document sheets, feeding the separated document sheets onto a document table, and returning the document sheets from the document table to the stack, thereby recirculating the document sheets; exposure means for scanning and exposing the document sheets fed onto the document table by said document recirculating means, said exposure means operating in one of a first exposure mode in which said document recirculating means temporarily stations each document sheet on the document table while said exposure means is moved to scan and expose the stationary document sheet and a second exposure mode in which said exposure means remains stationary while said document recirculating means moves each document sheet across the document table to cause the document to be scanned and exposed; image forming means for forming images on recording sheets from the document sheets that have been scanned and exposed by said exposure means; sheet receiving means for receiving and storing the recording sheets carrying images formed by said image forming means, said receiving means having a plurality of sheet receiving portions and operating in one of the first exposure mode and the second exposure mode; selecting means for selecting one of a first receiving mode in which a set of recording medium sheets having images corresponding to those on the stack of document sheets are received and stored in each of a plurality of sheet receiving portions of said sheet receiving means and a second receiving mode in which each sheet receiving portion of said sheet receiving means receives and stores a plurality of recording medium sheets having images corresponding to that on one of said document sheets; and control means for controlling each combination of the first and second exposure modes and the first and second receiving modes. 8. An image forming apparatus according to claim 6, wherein said control means controls said sheet receiving means so as to change the sheet receiving mode each time said document recirculation means completes recirculation of the document sheet stack whenever the sheet receiving means is operating the second exposure mode and the first receiving mode has been selected by said selecting means.
| 0.55102 |
10,127,224 | 1 | 6 |
1. A computing device for automatically querying a database for contextual natural language processing, the computing device comprising: a plurality of context source modules; a plurality of language models, wherein each language model is associated with a context source module of the plurality of context source modules; and a metadata interpretation module to index the plurality of language models to determine a plurality of important words of each of the plurality of language models that are important for the corresponding context source module; and a request interpretation module to: determine, for each of the plurality of language models, a relevance measure of a plurality of words of a textual representation of a user request based on the plurality of important words of the corresponding language model; generate a ranking of the determined relevance measures corresponding to the plurality of language models; generate, based on the ranking of the determined relevance measures, a semantic representation of the textual representation of the user request; generate a database query as a function of the semantic representation using a database query mapping of a first context source module of the plurality of context source modules, the first context source module associated with a word of the textual representation; and apply the database query generated as a function of the semantic representation.
|
1. A computing device for automatically querying a database for contextual natural language processing, the computing device comprising: a plurality of context source modules; a plurality of language models, wherein each language model is associated with a context source module of the plurality of context source modules; and a metadata interpretation module to index the plurality of language models to determine a plurality of important words of each of the plurality of language models that are important for the corresponding context source module; and a request interpretation module to: determine, for each of the plurality of language models, a relevance measure of a plurality of words of a textual representation of a user request based on the plurality of important words of the corresponding language model; generate a ranking of the determined relevance measures corresponding to the plurality of language models; generate, based on the ranking of the determined relevance measures, a semantic representation of the textual representation of the user request; generate a database query as a function of the semantic representation using a database query mapping of a first context source module of the plurality of context source modules, the first context source module associated with a word of the textual representation; and apply the database query generated as a function of the semantic representation. 6. The computing device of claim 1 , wherein to generate the semantic representation comprises to determine a context state of the user request.
| 0.914286 |
7,953,730 | 1 | 9 |
1. A computer-implemented method for displaying a search history for a user, comprising: under control of one or more computer systems configured with executable instructions, generating a search history for a user including, for searches submitted by the user, two or more listings of previous search results and information indicating when each search associated with the search result was submitted by the user; and configuring a web page to include, at least: a first search result listing from the two or more listings; at least a second search result listing from the two or more listings that has a relationship to the first search result listing within the search history, the first search result listing and second search result listing each comprising one or more hyperlinks; a search history timeline including a plurality of search nodes, each search node representing a search result listing from the two or more listings, the first search result listing and the second search result listing each being indicated by the web page as represented by at least one of the plurality of search nodes, and the plurality of search nodes being arranged along a line in chronological order according to when the search associated with each search result was submitted by the user; and one or more suggested search revisions generated based at least in part on the first search result listing, the one or more suggested search revisions each being selectable to enable submission of a corresponding revised search; wherein the search history timeline is configured to allow, by user interaction with a search navigation interface, user navigation among the search listings represented by the search history timeline; and wherein the web page is configured such that: upon submission of at least one additional search by the user, the web page is updated to include a new search result listing corresponding to the additional search by the user; and the search history timeline is updated according to the submitted additional search.
|
1. A computer-implemented method for displaying a search history for a user, comprising: under control of one or more computer systems configured with executable instructions, generating a search history for a user including, for searches submitted by the user, two or more listings of previous search results and information indicating when each search associated with the search result was submitted by the user; and configuring a web page to include, at least: a first search result listing from the two or more listings; at least a second search result listing from the two or more listings that has a relationship to the first search result listing within the search history, the first search result listing and second search result listing each comprising one or more hyperlinks; a search history timeline including a plurality of search nodes, each search node representing a search result listing from the two or more listings, the first search result listing and the second search result listing each being indicated by the web page as represented by at least one of the plurality of search nodes, and the plurality of search nodes being arranged along a line in chronological order according to when the search associated with each search result was submitted by the user; and one or more suggested search revisions generated based at least in part on the first search result listing, the one or more suggested search revisions each being selectable to enable submission of a corresponding revised search; wherein the search history timeline is configured to allow, by user interaction with a search navigation interface, user navigation among the search listings represented by the search history timeline; and wherein the web page is configured such that: upon submission of at least one additional search by the user, the web page is updated to include a new search result listing corresponding to the additional search by the user; and the search history timeline is updated according to the submitted additional search. 9. The method of claim 1 , wherein the line comprises a visible line.
| 0.870787 |
9,911,052 | 17 | 23 |
17. A system for providing handwriting recognition for a superimposed stroke input to a computing device, the computing device comprising a processor and at least one computer readable program for recognizing the input under control of the processor, said at least one program configured to: create, with a segmentation expert, a segmentation graph based on a plurality of input strokes, at least two of the strokes being at least partially superimposed on one another, wherein the segmentation graph consists of nodes and paths corresponding to character hypotheses formed by segmenting the input strokes to take into account the at least partially superimposed strokes; assign, with a recognition expert, a recognition score to each node of the segmentation graph based on language recognition information; generate, with a language expert, linguistic meaning of the input strokes by optimizing the recognition scores of the node paths of the segmentation graph based on a language model; and provide an output based on the collaborative analysis of the segmentation graph, the recognition score, and the language model by the segmentation, recognition and language experts.
|
17. A system for providing handwriting recognition for a superimposed stroke input to a computing device, the computing device comprising a processor and at least one computer readable program for recognizing the input under control of the processor, said at least one program configured to: create, with a segmentation expert, a segmentation graph based on a plurality of input strokes, at least two of the strokes being at least partially superimposed on one another, wherein the segmentation graph consists of nodes and paths corresponding to character hypotheses formed by segmenting the input strokes to take into account the at least partially superimposed strokes; assign, with a recognition expert, a recognition score to each node of the segmentation graph based on language recognition information; generate, with a language expert, linguistic meaning of the input strokes by optimizing the recognition scores of the node paths of the segmentation graph based on a language model; and provide an output based on the collaborative analysis of the segmentation graph, the recognition score, and the language model by the segmentation, recognition and language experts. 23. A system according to claim 17 , wherein the generation of the linguistic meaning includes recognizing word boundaries in the superimposed input based on the language model.
| 0.51105 |
5,577,249 | 9 | 16 |
9. A method for recognizing and accessing a reference string of tokens in one or more original token strings within a database comprising the steps of: creating one or more original tuples for each of the original token strings in the database by: a. partitioning each original token string into three or more original substrings of contiguous tokens; b. appending together two or more original substrings of the original token string to form one or more original tuples associated with the original token string, at least one original tuple being formed by appending two or more non-contiguous original substrings of the original token string; creating a unique original index for each original tuple created from the original token string by using an index algorithm, the original index being associated with the original token string from which the original tuple was created; using the original index to point to a cell in a first memory look-up structure and storing in the cell an information record associated with the original string, the information record containing pointing information used to locate the original token string in the database containing the tuple from which the original index was derived and displacement information used to determine the position of the matched reference sequence in the original token string; creating one or more reference tuples from the reference string of tokens by: c. partitioning the reference string of tokens into three or more reference substrings of contiguous tokens; d. appending together two or more reference substrings to form one or more reference tuples, at least one on the reference tuples being formed by appending together two or more non-contiguous reference substrings; creating a unique reference index for each reference tuple using the index algorithm comparing at least one reference index to at least one original index using the memory look-up structure; tracking the matches between the reference index and original index; storing the tracking results in a second memory look-up structure; selecting an original token string in the database based on the number of matches between one or more original indexes and one or more reference indexes.
|
9. A method for recognizing and accessing a reference string of tokens in one or more original token strings within a database comprising the steps of: creating one or more original tuples for each of the original token strings in the database by: a. partitioning each original token string into three or more original substrings of contiguous tokens; b. appending together two or more original substrings of the original token string to form one or more original tuples associated with the original token string, at least one original tuple being formed by appending two or more non-contiguous original substrings of the original token string; creating a unique original index for each original tuple created from the original token string by using an index algorithm, the original index being associated with the original token string from which the original tuple was created; using the original index to point to a cell in a first memory look-up structure and storing in the cell an information record associated with the original string, the information record containing pointing information used to locate the original token string in the database containing the tuple from which the original index was derived and displacement information used to determine the position of the matched reference sequence in the original token string; creating one or more reference tuples from the reference string of tokens by: c. partitioning the reference string of tokens into three or more reference substrings of contiguous tokens; d. appending together two or more reference substrings to form one or more reference tuples, at least one on the reference tuples being formed by appending together two or more non-contiguous reference substrings; creating a unique reference index for each reference tuple using the index algorithm comparing at least one reference index to at least one original index using the memory look-up structure; tracking the matches between the reference index and original index; storing the tracking results in a second memory look-up structure; selecting an original token string in the database based on the number of matches between one or more original indexes and one or more reference indexes. 16. A method for recognizing and accessing a reference string of tokens in one or more original token strings within a database, as in claim 9, where information in the second memory structure includes a value which indicates the degree of similarity between the original token string and the reference string.
| 0.537313 |
7,711,551 | 11 | 12 |
11. The method of claim 9 wherein determining whether the identified word is misspelled or has an incorrect pronunciation comprises: if the word in the context free grammar does not have a pronunciation specified in the context free grammar, then determining whether the word is in the lexicon; and if the word is not in the lexicon, then providing an indication that the spelling of the word may be in error.
|
11. The method of claim 9 wherein determining whether the identified word is misspelled or has an incorrect pronunciation comprises: if the word in the context free grammar does not have a pronunciation specified in the context free grammar, then determining whether the word is in the lexicon; and if the word is not in the lexicon, then providing an indication that the spelling of the word may be in error. 12. The method of claim 11 wherein providing an indication that the spelling of the word may be in error comprises: determining whether the word is in a frequently misspelled words data store; and if the word is in the frequently misspelled words data store, then providing a suggested correct spelling from the frequently misspelled words data store.
| 0.5 |
7,849,090 | 41 | 42 |
41. The computer program storage product of claim 29 , wherein the method further comprises: examining content nodes for their respective one or more concept definitions.
|
41. The computer program storage product of claim 29 , wherein the method further comprises: examining content nodes for their respective one or more concept definitions. 42. The computer program storage product of claim 41 , wherein the act of examining content nodes further comprises: processing a localized region of the domain using content nodes proximal to a selected content node.
| 0.5 |
7,672,985 | 21 | 32 |
21. A computer implemented method for processing database content, the method comprising the steps of: syndicating one or more data objects associated with a database to one or more remote computers; parsing one or more source documents to identify at least one term based on one or more predetermined rules; identifying content for the at least one term; linking the content with the at least one term; and automatically associating the at least one term in the one or more source documents with at least one link; wherein the at least one link denotes an association between the at least one term and the linked content; wherein the one or more data objects associated with the database provide a representation of at least a portion of the database at the one or more remote computers; and wherein the linked content is displayed on a user interface based upon a user interaction with at least a portion of the one or more source documents.
|
21. A computer implemented method for processing database content, the method comprising the steps of: syndicating one or more data objects associated with a database to one or more remote computers; parsing one or more source documents to identify at least one term based on one or more predetermined rules; identifying content for the at least one term; linking the content with the at least one term; and automatically associating the at least one term in the one or more source documents with at least one link; wherein the at least one link denotes an association between the at least one term and the linked content; wherein the one or more data objects associated with the database provide a representation of at least a portion of the database at the one or more remote computers; and wherein the linked content is displayed on a user interface based upon a user interaction with at least a portion of the one or more source documents. 32. The method of claim 21 , wherein one or more of the predetermined rules are based on presence or lack thereof of an entry in a database.
| 0.539474 |
8,255,460 | 1 | 6 |
1. A method for providing a personalized network based dialogue, comprising: storing a script associated with a campaign and a set of user information for a user selected for the campaign, the script specifying a plurality of events; executing a first instruction according to the script, wherein the first instruction is operable to send a first communication to the user from a server; determining a value for a variable associated with an event specified by the script, wherein the determination of the value is based on an interaction with the first communication by the user; determining a second instruction according to the script based on the set of user information and the value for the variable associated with the event specified by the script; and executing the second instruction to send a second communication to the user from the server.
|
1. A method for providing a personalized network based dialogue, comprising: storing a script associated with a campaign and a set of user information for a user selected for the campaign, the script specifying a plurality of events; executing a first instruction according to the script, wherein the first instruction is operable to send a first communication to the user from a server; determining a value for a variable associated with an event specified by the script, wherein the determination of the value is based on an interaction with the first communication by the user; determining a second instruction according to the script based on the set of user information and the value for the variable associated with the event specified by the script; and executing the second instruction to send a second communication to the user from the server. 6. The method of claim 1 , wherein the set of user information comprises demographic information.
| 0.753807 |
7,921,100 | 1 | 6 |
1. A method for calculating a similarity score of a query set comprising a query set of tokens and a first database set comprising a first database set of tokens, wherein the first database set is one of a plurality of database sets in a data collection set stored on a non-transitory computer readable medium, comprising the steps of: for each specific token in the query set, determining the number of database sets that contain the specific token; for each specific token in the query set, calculating an inverse document frequency (idf) weight, based at least in part on the number of database sets that contain the specific token and on the total number of database sets in the data collection set; calculating a normalized length of the first database set; calculating a normalized length of the query set; and, calculating a similarity score based at least in part on the normalized length of the first database set, the normalized length of the query set, and the idf weight of each of the tokens in the query set.
|
1. A method for calculating a similarity score of a query set comprising a query set of tokens and a first database set comprising a first database set of tokens, wherein the first database set is one of a plurality of database sets in a data collection set stored on a non-transitory computer readable medium, comprising the steps of: for each specific token in the query set, determining the number of database sets that contain the specific token; for each specific token in the query set, calculating an inverse document frequency (idf) weight, based at least in part on the number of database sets that contain the specific token and on the total number of database sets in the data collection set; calculating a normalized length of the first database set; calculating a normalized length of the query set; and, calculating a similarity score based at least in part on the normalized length of the first database set, the normalized length of the query set, and the idf weight of each of the tokens in the query set. 6. The method of claim 1 further comprising the step of calculating the idf weight of a specific token according to the formula:
idf ( q i )=log 2 (1 +N/N ( q i )) wherein: q i represents the specific token; idf(q i ) represents the idf weight of the specific token; N represents the total number of database sets in the data collection set; and, N(q i ) represents the number of database sets that contain the token q i .
| 0.5 |
8,666,931 | 2 | 3 |
2. The method of claim 1 wherein building a state transition table for each node further comprises combining transitions having the same source state and the same destination into one table entry.
|
2. The method of claim 1 wherein building a state transition table for each node further comprises combining transitions having the same source state and the same destination into one table entry. 3. The method of claim 2 further comprises: assigning each state of the deterministic finite automaton a unique identifier; enumerating all transition rules for each state; minimizing number of transition rules using a partial prefix list minimization algorithm; and concatenating the transition rules from each state together by prepending each transition rule with an identifier for its corresponding source state.
| 0.5 |
8,239,380 | 22 | 27 |
22. A computer-implemented method to filter and rank general-purpose search engine results based on criteria associated with an entry point, comprising: executing a query search with the general-purpose search engine accessed through a link associated with the entry point; filtering the general-purpose search engine results by tuning the general-purpose search engine based on a set of training data associated with the entry point employed to access the general purpose search engine; ranking the filtered general-purpose search engine results; automatically storing a first query result selected by a user in a first data set categorized as relevant; automatically storing at least one non-selected query result that is ranked higher than the first query result in a second data set categorized as non-relevant upon selection of the first query result; and including the first data set and second data set in the set of training data associated with the entry point employed to access the general purpose search engine.
|
22. A computer-implemented method to filter and rank general-purpose search engine results based on criteria associated with an entry point, comprising: executing a query search with the general-purpose search engine accessed through a link associated with the entry point; filtering the general-purpose search engine results by tuning the general-purpose search engine based on a set of training data associated with the entry point employed to access the general purpose search engine; ranking the filtered general-purpose search engine results; automatically storing a first query result selected by a user in a first data set categorized as relevant; automatically storing at least one non-selected query result that is ranked higher than the first query result in a second data set categorized as non-relevant upon selection of the first query result; and including the first data set and second data set in the set of training data associated with the entry point employed to access the general purpose search engine. 27. The method of claim 22 , further comprising employing a statistical analysis to rank search query results.
| 0.911003 |
9,014,432 | 13 | 16 |
13. The system according to claim 11 , wherein the segmentation device is adapted to: produce a binary map of the plate region; use the binary map to determine object connected components relative to background components; match the determined black connected components against the at least one model; determine if a matching score for the at least one model is below a pre-set threshold; and, determine the at least one model that is a closest match to the plate region in the observed image.
|
13. The system according to claim 11 , wherein the segmentation device is adapted to: produce a binary map of the plate region; use the binary map to determine object connected components relative to background components; match the determined black connected components against the at least one model; determine if a matching score for the at least one model is below a pre-set threshold; and, determine the at least one model that is a closest match to the plate region in the observed image. 16. The system according to claim 13 , wherein after producing the binary map, the segmentation device is further adapted to: perform a projection in the vertical region; locate gaps between components by applying a threshold for valley detection; divide the region into a sub-region at the gap; and, determine a collection of black pixels in each sub-region as including a candidate for a character or logo.
| 0.5 |
9,449,052 | 1 | 5 |
1. A method performed by data processing apparatus, the method comprising: accessing data specifying a plurality of search queries; identifying, by one or more data processing apparatus and based on at least some of the search queries, a first content distribution campaign in which distribution of at least one content item provided by a first content provider is conditioned on a distribution parameter matching one of the search queries and a second content distribution campaign in which distribution of at least one content item provided by a second content provider different from the first content provider is conditioned on a distribution parameter; determining, by one or more data processing apparatus and based on one or more distribution parameters of the first content distribution campaign matching one or more distribution parameters of the second content distribution campaign, that the first content distribution campaign and the second content distribution campaign have at least a specified level of similarity to each other; identifying, by one or more data processing apparatus, a particular distribution parameter of the first content distribution campaign that is not included in the one or more distribution parameters of the second content distribution campaign; determining, by the one or more data processing apparatus and for the particular distribution parameter, a first number of users that submitted a search query matching the particular distribution parameter over a first time period; determining, by the one or more data processing apparatus and for the particular distribution parameter, a second number of users that submitted a search query matching the particular distribution parameter that is matched by a particular search query over a second time period that differs from the first time period and occurs after the first time period; determining, by the one or more data processing apparatus and for the particular distribution parameter, a trend score based on comparing the first number of users and the second number of users; determining, by the one or more data processing apparatus, that the trend score is an increasing trend score based on the second number being greater than the first number; and providing, by the one or more data processing apparatus and based on the trend score and on the specified level of similarity between the first content distribution campaign and the second content distribution campaign, suggestion data suggesting the particular distribution parameter as an additional distribution parameter for the second content distribution campaign.
|
1. A method performed by data processing apparatus, the method comprising: accessing data specifying a plurality of search queries; identifying, by one or more data processing apparatus and based on at least some of the search queries, a first content distribution campaign in which distribution of at least one content item provided by a first content provider is conditioned on a distribution parameter matching one of the search queries and a second content distribution campaign in which distribution of at least one content item provided by a second content provider different from the first content provider is conditioned on a distribution parameter; determining, by one or more data processing apparatus and based on one or more distribution parameters of the first content distribution campaign matching one or more distribution parameters of the second content distribution campaign, that the first content distribution campaign and the second content distribution campaign have at least a specified level of similarity to each other; identifying, by one or more data processing apparatus, a particular distribution parameter of the first content distribution campaign that is not included in the one or more distribution parameters of the second content distribution campaign; determining, by the one or more data processing apparatus and for the particular distribution parameter, a first number of users that submitted a search query matching the particular distribution parameter over a first time period; determining, by the one or more data processing apparatus and for the particular distribution parameter, a second number of users that submitted a search query matching the particular distribution parameter that is matched by a particular search query over a second time period that differs from the first time period and occurs after the first time period; determining, by the one or more data processing apparatus and for the particular distribution parameter, a trend score based on comparing the first number of users and the second number of users; determining, by the one or more data processing apparatus, that the trend score is an increasing trend score based on the second number being greater than the first number; and providing, by the one or more data processing apparatus and based on the trend score and on the specified level of similarity between the first content distribution campaign and the second content distribution campaign, suggestion data suggesting the particular distribution parameter as an additional distribution parameter for the second content distribution campaign. 5. The method of claim 1 , wherein: identifying the first content distribution campaign and the second content distribution campaign comprises: identifying a first content distribution campaign and a second content distribution campaign that have at least a specified percentage of matching distribution parameters; and determining that a difference between a number of impressions allocated to each of the first and the second content distribution campaigns is within a specified difference value; and providing suggestion data suggesting the particular distribution parameter as the additional distribution parameter comprises providing suggestion data suggesting the particular distribution parameter to each of the first and the second content distribution parameters based on the identification of the first and the second content distribution campaigns having at least the specified level of similarity to each other.
| 0.5 |
8,112,385 | 7 | 8 |
7. A method comprising: receiving a query that is based on a predefined format of an arbitrary query language; performing the query to obtain a query result; providing the query result and a report layout specification to a computer; associating, with the computer, the query result with at least one element of the report layout specification to generate an association; providing the query result through an interface based on the report layout specification without reliance on the type of the arbitrary query language; and rendering the query result in a report according to the association without reliance on the type of the arbitrary query language, wherein a report specified in the report layout specification is one of a chart, a detailed list report type that is tabular with each row including a detailed fact value that corresponds to a combination of non-fact columns in each row, a grouped summary report type that is tabular with at least one grouping column and at least one fact column, a grouped detail list report type that includes detail and summary fact values, a cross tab report that includes a set of members along a row and column axis, and a master detail report that associates rows within a report with other reports including parallel detail information.
|
7. A method comprising: receiving a query that is based on a predefined format of an arbitrary query language; performing the query to obtain a query result; providing the query result and a report layout specification to a computer; associating, with the computer, the query result with at least one element of the report layout specification to generate an association; providing the query result through an interface based on the report layout specification without reliance on the type of the arbitrary query language; and rendering the query result in a report according to the association without reliance on the type of the arbitrary query language, wherein a report specified in the report layout specification is one of a chart, a detailed list report type that is tabular with each row including a detailed fact value that corresponds to a combination of non-fact columns in each row, a grouped summary report type that is tabular with at least one grouping column and at least one fact column, a grouped detail list report type that includes detail and summary fact values, a cross tab report that includes a set of members along a row and column axis, and a master detail report that associates rows within a report with other reports including parallel detail information. 8. The method of claim 7 , further comprising providing a master data set with respect to each report specified in the report layout specification, the master dataset providing access to a dataset informational object and a partial dataset data retrieval object.
| 0.5 |
6,076,057 | 7 | 11 |
7. A system for decoding of speech information comprising: means for segmenting an input utterance into speech and background regions without knowledge of the lexical content of the input utterance to create a segmented input string; means for introducing insertion errors into the background regions that are error prone to generate error laden background strings; means for statistically modeling the segmented input string and the error laden background strings using a discriminative training algorithm to generate a model with adapted parameters; means for decoding the input utterance using the model with the adapted parameters; and means for outputting a recognized string based on the decoded input utterance.
|
7. A system for decoding of speech information comprising: means for segmenting an input utterance into speech and background regions without knowledge of the lexical content of the input utterance to create a segmented input string; means for introducing insertion errors into the background regions that are error prone to generate error laden background strings; means for statistically modeling the segmented input string and the error laden background strings using a discriminative training algorithm to generate a model with adapted parameters; means for decoding the input utterance using the model with the adapted parameters; and means for outputting a recognized string based on the decoded input utterance. 11. The system as recited in claim 7, wherein means for decoding the input utterance uses Viterbi decoding.
| 0.679641 |
9,344,416 | 13 | 14 |
13. The apparatus of claim 10 wherein the control logic is to digitally sign the first document before granting the first request.
|
13. The apparatus of claim 10 wherein the control logic is to digitally sign the first document before granting the first request. 14. The apparatus of claim 13 wherein the control logic is to provide date information, which concerns a date the first document was received from the first node, within the digitally signed first document.
| 0.5 |
9,858,324 | 1 | 3 |
1. A method of extracting unclassified data from a collection of data including both classified data and unclassified data, the method comprising: providing a plain text format file including a plurality of attributes in a computer system that includes a classified environment having a collection of data, which includes messages of both classified binary data and unclassified binary data, wherein the plain text format file describes each of the attributes in a message data structure in a classified network on a message type basis, wherein at least one of the attributes comprises a security mark; executing a software application within the classified environment, the software application comprising a trusted download toolkit programmed for: (a) processing at least one message contained within the collection of data by receiving target input data associated with the message, wherein the target input data comprises a binary data stream comprising classified binary data, a binary data stream comprising unclassified binary data, or a combination thereof, (b) identifying security mark data in at least one of the binary data streams, and (c) identifying a level of classification for at least a portion of the target input data in response to the security mark data; wherein the trusted download toolkit is independent of the message data structure within the classified environment and extracting at least a portion of the identified unclassified binary data from the collection of data in the classified environment in response to the identified level of classification.
|
1. A method of extracting unclassified data from a collection of data including both classified data and unclassified data, the method comprising: providing a plain text format file including a plurality of attributes in a computer system that includes a classified environment having a collection of data, which includes messages of both classified binary data and unclassified binary data, wherein the plain text format file describes each of the attributes in a message data structure in a classified network on a message type basis, wherein at least one of the attributes comprises a security mark; executing a software application within the classified environment, the software application comprising a trusted download toolkit programmed for: (a) processing at least one message contained within the collection of data by receiving target input data associated with the message, wherein the target input data comprises a binary data stream comprising classified binary data, a binary data stream comprising unclassified binary data, or a combination thereof, (b) identifying security mark data in at least one of the binary data streams, and (c) identifying a level of classification for at least a portion of the target input data in response to the security mark data; wherein the trusted download toolkit is independent of the message data structure within the classified environment and extracting at least a portion of the identified unclassified binary data from the collection of data in the classified environment in response to the identified level of classification. 3. The method of claim 1 , wherein the collection of data includes binary files and the binary files are filtered on both variable type and bit wise levels in accordance with at least one of the security marks.
| 0.543478 |
9,042,554 | 1 | 10 |
1. A method to encode auxiliary data into text data, comprising: assigning source data to one of a plurality of groups, the source data comprising text data; identifying a symbol to be added to the source data based on an assigned group of the source data; and generating, via a processor, encoded data by changing a first text character in the source data to be a second text character that is representative of the symbol and represents a same alphanumeric character or non-alphanumeric symbol as the first text character in the source data.
|
1. A method to encode auxiliary data into text data, comprising: assigning source data to one of a plurality of groups, the source data comprising text data; identifying a symbol to be added to the source data based on an assigned group of the source data; and generating, via a processor, encoded data by changing a first text character in the source data to be a second text character that is representative of the symbol and represents a same alphanumeric character or non-alphanumeric symbol as the first text character in the source data. 10. A method as defined in claim 1 , further comprising encrypting auxiliary data, the symbol being representative of a portion of the encrypted auxiliary data.
| 0.74026 |
9,288,493 | 1 | 2 |
1. A method of decoding video data in a merge mode, comprising: constructing a merge list using available spatial and temporal merge candidates; setting a merge candidate on the merge list corresponding to a merge index as motion information of a current prediction unit; generating a prediction block of the current prediction unit using the motion information; generating a quantized block by inverse-scanning quantized coefficient components, generating a transformed block by inverse-quantizing the quantized block using a quantization parameter, and generating a residual block by inverse-transforming the transformed block, wherein when the current prediction unit is a second prediction unit partitioned by asymmetric partitioning, a spatial merge candidate corresponding to a first prediction unit partitioned by the asymmetric partitioning is excluded from the merge list, and a motion vector of the temporal merge candidate is determined depending on a position of a current block within a largest coding unit (LCU), wherein the quantization parameter is generated per quantization unit, and a minimum size of the quantization unit is adjusted by a picture parameter set, wherein the quantization parameter is generated using a differential quantization parameter and a quantization parameter predictor, wherein if two or more quantization parameters are available among a left quantization parameter, an above quantization parameter and a previous quantization parameter of a current coding unit, the quantization parameter predictor is generated using two available quantization parameters determined according to a predetermined order, wherein if only one is available among the left quantization parameter, the above quantization parameter and the previous quantization parameter of the current coding unit, the available quantization parameter is set as the quantization parameter predictor, and wherein the differential quantization parameter is restored using a bin string indicating an absolute value of the differential quantization parameter and a bin indicating a sign of the differential quantization parameter.
|
1. A method of decoding video data in a merge mode, comprising: constructing a merge list using available spatial and temporal merge candidates; setting a merge candidate on the merge list corresponding to a merge index as motion information of a current prediction unit; generating a prediction block of the current prediction unit using the motion information; generating a quantized block by inverse-scanning quantized coefficient components, generating a transformed block by inverse-quantizing the quantized block using a quantization parameter, and generating a residual block by inverse-transforming the transformed block, wherein when the current prediction unit is a second prediction unit partitioned by asymmetric partitioning, a spatial merge candidate corresponding to a first prediction unit partitioned by the asymmetric partitioning is excluded from the merge list, and a motion vector of the temporal merge candidate is determined depending on a position of a current block within a largest coding unit (LCU), wherein the quantization parameter is generated per quantization unit, and a minimum size of the quantization unit is adjusted by a picture parameter set, wherein the quantization parameter is generated using a differential quantization parameter and a quantization parameter predictor, wherein if two or more quantization parameters are available among a left quantization parameter, an above quantization parameter and a previous quantization parameter of a current coding unit, the quantization parameter predictor is generated using two available quantization parameters determined according to a predetermined order, wherein if only one is available among the left quantization parameter, the above quantization parameter and the previous quantization parameter of the current coding unit, the available quantization parameter is set as the quantization parameter predictor, and wherein the differential quantization parameter is restored using a bin string indicating an absolute value of the differential quantization parameter and a bin indicating a sign of the differential quantization parameter. 2. The method of claim 1 , wherein a reference picture index and a motion vector of a current prediction unit are a reference picture index and a motion vector of a merge candidate specified by a merge index.
| 0.664516 |
8,805,670 | 1 | 7 |
1. A method for language translation comprising: providing program code to launch a translation window associated with a primary window; providing a link to the program code, wherein when the primary window is displayed on a screen and the user selects the link, the program code causes the translation window to open on the screen in combination with the primary window; in the translation window, indicating input information in a first language; translating the input information from the first language to information in a second language; in the translation window, displaying the information in the second language; and permitting scrolling of the primary window independently from the translation window.
|
1. A method for language translation comprising: providing program code to launch a translation window associated with a primary window; providing a link to the program code, wherein when the primary window is displayed on a screen and the user selects the link, the program code causes the translation window to open on the screen in combination with the primary window; in the translation window, indicating input information in a first language; translating the input information from the first language to information in a second language; in the translation window, displaying the information in the second language; and permitting scrolling of the primary window independently from the translation window. 7. The method of claim 1 comprising: displaying a translation direction field in the translation window, wherein the translation direction field provides a selection between at least two options and is implemented using a radio button graphical user interface element.
| 0.598802 |
7,788,095 | 15 | 16 |
15. The method of claim 10 further comprising an at least one speech analytics step for performing advanced analysis on the fused result.
|
15. The method of claim 10 further comprising an at least one speech analytics step for performing advanced analysis on the fused result. 16. The method of claim 15 wherein the at least one speech analytics step comprises an at least one item selected from the group consisting of: categorization; trend detection; root cause analysis for detecting causes of phenomenon exhibited by at least one word or term detected in the at least one audio signal; link analysis; hidden pattern analysis and contextual analysis.
| 0.5 |
7,680,812 | 1 | 4 |
1. A method for searching electronic material stored in a computing environment using a computer, comprising: providing a plurality of documents; determining, using the computer, an undirected, weighted link between at least two of said plurality of documents, based on similarity; determining, using the computer, a directed, weighted link between at least two of said plurality of documents; adding said determined undirected, weighted links to said determined directed, weighted links to create a hybrid web having links; and performing, using the computer, a link analysis algorithm taking the links of said hybrid web as its input, said algorithm including at least one of forward link analysis and backward link analysis, wherein the output of said algorithm is a set of link analysis scores.
|
1. A method for searching electronic material stored in a computing environment using a computer, comprising: providing a plurality of documents; determining, using the computer, an undirected, weighted link between at least two of said plurality of documents, based on similarity; determining, using the computer, a directed, weighted link between at least two of said plurality of documents; adding said determined undirected, weighted links to said determined directed, weighted links to create a hybrid web having links; and performing, using the computer, a link analysis algorithm taking the links of said hybrid web as its input, said algorithm including at least one of forward link analysis and backward link analysis, wherein the output of said algorithm is a set of link analysis scores. 4. The method according to claim 1 , wherein said at least one of forward and backward link analysis comprises using at least one of a non-normalized Forward operator and a non-normalized Backward operator.
| 0.826307 |
8,230,062 | 8 | 9 |
8. A method of compiling marketing information for a client, comprising: (a) crawling blog posts; (b) extracting an insight related to a topic from the crawled blog posts; (c) collecting one or more measurements of traffic to a client website, the traffic being referred to the client website by referring blog posts, the referring blog posts including the crawled blog posts; (d) associating the measurements of traffic with the extracted insight; (e) determining frequently reoccurring insights, which reoccur frequently enough to appear to be a driver for the measurements of traffic; and (f) presenting a plurality of said frequently reoccurring insights and associated measurement of traffic to the client.
|
8. A method of compiling marketing information for a client, comprising: (a) crawling blog posts; (b) extracting an insight related to a topic from the crawled blog posts; (c) collecting one or more measurements of traffic to a client website, the traffic being referred to the client website by referring blog posts, the referring blog posts including the crawled blog posts; (d) associating the measurements of traffic with the extracted insight; (e) determining frequently reoccurring insights, which reoccur frequently enough to appear to be a driver for the measurements of traffic; and (f) presenting a plurality of said frequently reoccurring insights and associated measurement of traffic to the client. 9. The method of claim 8 , wherein the determining comprises determining the highest number of insights associated with one or more selected measurements of traffic.
| 0.533898 |
7,685,514 | 1 | 7 |
1. A method in a web browser on a data processing system for processing a document, the method comprising: receiving a first web document including formatting information used to display the first web document; receiving a request to present a selected portion of the first web document; identifying formatting information associated with the selected portion of the first web document; creating in the web browser a second web document including the selected portion and the formatting information associated with the selected portion, in response to receiving the request, wherein the first web document and the second web document are markup language documents; responsive to a request to change a font attribute of the selected portion, inserting virtual font indicators before and after text within the selected portion; and responsive to a request to identify a page break in the selected portion, inserting at least one virtual page break indicator within the selected portion, wherein identifying the page break in the selected portion comprises identifying a location of the page break based on page setup information, document formatting information, and document content.
|
1. A method in a web browser on a data processing system for processing a document, the method comprising: receiving a first web document including formatting information used to display the first web document; receiving a request to present a selected portion of the first web document; identifying formatting information associated with the selected portion of the first web document; creating in the web browser a second web document including the selected portion and the formatting information associated with the selected portion, in response to receiving the request, wherein the first web document and the second web document are markup language documents; responsive to a request to change a font attribute of the selected portion, inserting virtual font indicators before and after text within the selected portion; and responsive to a request to identify a page break in the selected portion, inserting at least one virtual page break indicator within the selected portion, wherein identifying the page break in the selected portion comprises identifying a location of the page break based on page setup information, document formatting information, and document content. 7. The method of claim 1 , further comprising: receiving a request to display page break indicators within the second web document; identifying page break information for the second web document for an output device; and creating in the web browser a third web document from the second web document, wherein at least one virtual page break indicator is inserted into the third web document, in response to the page break information, to indicate the location of page breaks.
| 0.5 |
7,478,047 | 5 | 7 |
5. The method of claim 2 wherein said mental state further comprises a defined emotional state.
|
5. The method of claim 2 wherein said mental state further comprises a defined emotional state. 7. The method of claim 5 wherein said modification of pitch or duration is performed at least in part using the Synchronous Overlap and Add class of techniques.
| 0.5 |
8,271,260 | 22 | 23 |
22. The computer program product of claim 21 , wherein the computer code is further configured for: determining a weight for each received vote, the weight indicating the vote's relative contribution to the quality score.
|
22. The computer program product of claim 21 , wherein the computer code is further configured for: determining a weight for each received vote, the weight indicating the vote's relative contribution to the quality score. 23. The computer program product of claim 22 , wherein the weight of a vote submitted by a voting member is based on the perceived quality among members of translations previously submitted by the voting member.
| 0.650662 |
7,757,191 | 8 | 9 |
8. The method of claim 1 , wherein during step (d), the user-defined functions/tasks are capable of invoking other user-defined functions/tasks that directly or indirectly invoke the original functions/tasks, which render circular feedback loops and cause IC designs to be deadlock when in a field operation, and wherein these user-defined functions/tasks that are capable of invoking other user-defined functions/tasks are identified and analyzed for potentially circular invocation in a static analysis.
|
8. The method of claim 1 , wherein during step (d), the user-defined functions/tasks are capable of invoking other user-defined functions/tasks that directly or indirectly invoke the original functions/tasks, which render circular feedback loops and cause IC designs to be deadlock when in a field operation, and wherein these user-defined functions/tasks that are capable of invoking other user-defined functions/tasks are identified and analyzed for potentially circular invocation in a static analysis. 9. The method of claim 8 , further comprising: (v) selecting a user-defined function/task as a target; (w) examining HDL code of the target and collecting all user-defined functions/tasks that are invoked in the HDL code and any controlling conditions that enable the invocation of these user-defined functions/tasks; (x) setting each of the user-defined functions/tasks identified during the examining as a new target and repeating examining HDL code of the new target; and (y) terminating examining HDL code and setting each of the user-defined functions/tasks when either a task or function identified during the examination is the same as an original target selected in (v) and there is no conflict in controlling conditions for all targets identified, or there is no more function/task collected during the examination; wherein if a task or function identified during the examination is the same as an original target, the original target is flagged as a circular feedback function/task.
| 0.5 |
9,031,934 | 5 | 6 |
5. The method according to claim 1 , wherein said estimating further includes: obtaining corresponding probability values for the possible values of the filtering result from the first probability information and the second probability information, respectively; and determining the filter factor according to the combination of the probability values.
|
5. The method according to claim 1 , wherein said estimating further includes: obtaining corresponding probability values for the possible values of the filtering result from the first probability information and the second probability information, respectively; and determining the filter factor according to the combination of the probability values. 6. The method according to claim 5 , wherein said determining the filter factor comprises: estimating the filter factor FF as: FF = ∑ j = 1 k Fw j × Ff j , where Fw j and Ff j are the corresponding probability values for the j th possible value of the filtering result in the first probability information and the second probability information, respectively.
| 0.5 |
8,386,435 | 12 | 13 |
12. The method of claim 1 further comprising: recording token-value to archive-data-value relationships during the data tokenization process; extracting the token value range for each of the tokenized data segments prior to compression; and storing the relationships and range information in an index file.
|
12. The method of claim 1 further comprising: recording token-value to archive-data-value relationships during the data tokenization process; extracting the token value range for each of the tokenized data segments prior to compression; and storing the relationships and range information in an index file. 13. The method of claim 12 , wherein said selecting of a compacted file is based on the range information in the index file.
| 0.5 |
8,166,017 | 17 | 21 |
17. A system comprising: a bookmark database; and one or more processors configured to: identify a user; and synchronize a first set of bookmarks stored for the identified user in the bookmark database, with a second set of bookmarks stored in a client-side browser bookmark list, wherein one or more bookmarks in the first set of bookmarks or the second set of bookmarks are associated with ratings of resources, the resources being identified by the one or more bookmarks, and wherein synchronizing the first set of bookmarks and the second set of bookmarks comprises preserving the ratings associated with the one or more bookmarks.
|
17. A system comprising: a bookmark database; and one or more processors configured to: identify a user; and synchronize a first set of bookmarks stored for the identified user in the bookmark database, with a second set of bookmarks stored in a client-side browser bookmark list, wherein one or more bookmarks in the first set of bookmarks or the second set of bookmarks are associated with ratings of resources, the resources being identified by the one or more bookmarks, and wherein synchronizing the first set of bookmarks and the second set of bookmarks comprises preserving the ratings associated with the one or more bookmarks. 21. The system of claim 17 , wherein the one or more processors are further configured to: assign a hierarchy of the bookmarks of the second set as an implicit annotation of a bookmark in the second set, wherein synchronizing the first and second sets of bookmarks further comprises preserving the implicitly annotated hierarchy when synchronizing the first and second sets of bookmarks.
| 0.5 |
9,747,927 | 12 | 16 |
12. A method for multifaceted singing analysis implemented in a computer to cause the computer to execute the steps of: generating one or more modified musical audio signals, of which music and vocal characteristics are modified, from each of musical audio signals of music including singing voice; acquiring a plurality of frame signals in time series from the musical audio signals by applying a predetermined window function to one of the musical audio signals of music including singing voice and the one or more modified musical audio signals; estimating a plurality of vocal feature vectors for each of the frame signals acquired from the musical audio signals; estimating analysis-fitted segments by determining whether or not each segment in the frame signals is fitted for analysis, based on the vocal feature vectors estimated in the step of estimating a plurality of vocal feature vectors; discretizing the plurality of vocal feature vectors in the analysis-fitted segments to convert them into a vocal symbolic time series composed of a plurality of vocal symbols; analyzing topics using a topic model by analyzing a plurality of the vocal symbolic time series obtained for the respective musical audio signals of music including singing voice and the one or more modified musical signals, to thereby generate a vocal topic distribution for each of all the musical audio signals whereby the vocal topic distribution is composed of a plurality of vocal topics each indicating a relationship of one of the musical audio signals with the other musical audio signals and to thereby generate a vocal symbol distribution for each of all the vocal topics whereby the vocal symbol distribution indicates respective occurrence probabilities for the vocal symbols; storing the vocal topic distributions generated by the step of analyzing topics in a vocal topic distribution storing processor; storing the vocal symbol distributions generated by the step of analyzing topics in a vocal symbol distribution storing processor; and performing multifaceted analysis of singing voices respectively included in the musical audio signals of music including singing voice and the one or more modified musical audio signals, based on the vocal topic distributions stored in the vocal topic distribution storing processor and the vocal symbol distributions stored in vocal symbol distribution storing processor.
|
12. A method for multifaceted singing analysis implemented in a computer to cause the computer to execute the steps of: generating one or more modified musical audio signals, of which music and vocal characteristics are modified, from each of musical audio signals of music including singing voice; acquiring a plurality of frame signals in time series from the musical audio signals by applying a predetermined window function to one of the musical audio signals of music including singing voice and the one or more modified musical audio signals; estimating a plurality of vocal feature vectors for each of the frame signals acquired from the musical audio signals; estimating analysis-fitted segments by determining whether or not each segment in the frame signals is fitted for analysis, based on the vocal feature vectors estimated in the step of estimating a plurality of vocal feature vectors; discretizing the plurality of vocal feature vectors in the analysis-fitted segments to convert them into a vocal symbolic time series composed of a plurality of vocal symbols; analyzing topics using a topic model by analyzing a plurality of the vocal symbolic time series obtained for the respective musical audio signals of music including singing voice and the one or more modified musical signals, to thereby generate a vocal topic distribution for each of all the musical audio signals whereby the vocal topic distribution is composed of a plurality of vocal topics each indicating a relationship of one of the musical audio signals with the other musical audio signals and to thereby generate a vocal symbol distribution for each of all the vocal topics whereby the vocal symbol distribution indicates respective occurrence probabilities for the vocal symbols; storing the vocal topic distributions generated by the step of analyzing topics in a vocal topic distribution storing processor; storing the vocal symbol distributions generated by the step of analyzing topics in a vocal symbol distribution storing processor; and performing multifaceted analysis of singing voices respectively included in the musical audio signals of music including singing voice and the one or more modified musical audio signals, based on the vocal topic distributions stored in the vocal topic distribution storing processor and the vocal symbol distributions stored in vocal symbol distribution storing processor. 16. The method for multifaceted singing analysis according to claim 12 , wherein: in the step of generating one or more modified musical audio signals, the one or more modified musical audio signals are generated by shifting pitches of the musical audio signals of music including singing voice.
| 0.744367 |
9,342,546 | 1 | 6 |
1. A method comprising, by one or more computing devices: receiving, from a client system of a first user of an online social network, a search query for one or more objects of a first object type, wherein the search query is parsed to identify an inner query and an outer query, wherein the inner query requests one or more objects of a second object type stored in a second data store that stores only objects of the second object type, and wherein the outer query requests the one or more objects of the first object type stored in a first data store that stores only objects of the first object type; identifying, in response to receiving the search query, the one or more objects of the second object type requested by the inner query using an inverted index of the second data store corresponding to the second object type; identifying the one or more objects of the first object type requested by the outer query using one or more of the identified objects of the second object type and a forward index of the second data store corresponding to the second object type, wherein the one or more identified objects of the first object type are related within the online social network to one or more of the identified objects of the second object type; and sending, to the client system of the first user, one or more search results responsive to the search query, each search result corresponding to an identified object of the first object type from the first data store.
|
1. A method comprising, by one or more computing devices: receiving, from a client system of a first user of an online social network, a search query for one or more objects of a first object type, wherein the search query is parsed to identify an inner query and an outer query, wherein the inner query requests one or more objects of a second object type stored in a second data store that stores only objects of the second object type, and wherein the outer query requests the one or more objects of the first object type stored in a first data store that stores only objects of the first object type; identifying, in response to receiving the search query, the one or more objects of the second object type requested by the inner query using an inverted index of the second data store corresponding to the second object type; identifying the one or more objects of the first object type requested by the outer query using one or more of the identified objects of the second object type and a forward index of the second data store corresponding to the second object type, wherein the one or more identified objects of the first object type are related within the online social network to one or more of the identified objects of the second object type; and sending, to the client system of the first user, one or more search results responsive to the search query, each search result corresponding to an identified object of the first object type from the first data store. 6. The method of claim 1 , wherein identifying the one or more objects of the first object type comprises: accessing a forward index of the second data store corresponding to the second object type, wherein the forward index maps a concept node to one or more user nodes in accordance with a first relationship; and retrieving the one or more objects of the first object type requested by the search query using one or more of the identified objects of the second object type and the forward index of the second data store corresponding to the second object type, wherein the one or more objects of the first object type comprise one or more user nodes of the social graph that are related to the one or more retrieved concept nodes by the first relationship.
| 0.5 |
8,756,057 | 13 | 22 |
13. A computer program product stored on a non-transitory tangible computer usable medium for analyzing speech, comprising: program code that when executed by a processor: converts inputted speech received from a speaker to text; displays the text in a textual interface; automatically generates feedback information, that comprises results of an analysis of the inputted speech and/or text, by automatically analyzing the inputted speech and/or text; and automatically outputs the feedback information as annotations in the textual interface, wherein the annotations are distinct from the inputted speech and text.
|
13. A computer program product stored on a non-transitory tangible computer usable medium for analyzing speech, comprising: program code that when executed by a processor: converts inputted speech received from a speaker to text; displays the text in a textual interface; automatically generates feedback information, that comprises results of an analysis of the inputted speech and/or text, by automatically analyzing the inputted speech and/or text; and automatically outputs the feedback information as annotations in the textual interface, wherein the annotations are distinct from the inputted speech and text. 22. The computer program product of claim 13 , further comprising collaboration means that allows a third party collaborator to input additional feedback information.
| 0.704626 |
7,502,738 | 5 | 6 |
5. The system according to claim 1 , further comprising a speech recognition engine that recognizes words and phrases contained in the received user utterance using information in one or more dictionary and phrase tables, wherein the parser examines the recognized words and phrases to identify the one or more keywords.
|
5. The system according to claim 1 , further comprising a speech recognition engine that recognizes words and phrases contained in the received user utterance using information in one or more dictionary and phrase tables, wherein the parser examines the recognized words and phrases to identify the one or more keywords. 6. The system according to claim 5 , wherein the speech recognition engine further recognizes an identity of the user based on information contained in one or more user profiles.
| 0.5 |
9,583,104 | 1 | 4 |
1. A processing system comprising: at least one element including at least one of (a) one or more processors or (b) hardware logic/electrical circuitry; activation logic, implemented using the at least one element, configured to determine whether natural language functionality of the processing system is activated, the natural language functionality for enabling the processing system to interpret natural language requests; suggestion logic, implemented using the at least one element, configured to generate one or more intent frames in response to a determination that the natural language functionality of the processing system is activated, each of the one or more intent frames including at least one carrier phrase and at least one slot; an interface configured to provide the one or more intent frames for perception by a user; assignment logic, implemented using the at least one element, configured to assign a plurality of probabilities to a plurality of respective possible intent frames, each probability indicating a likelihood that the user is to select the corresponding possible intent frame if the corresponding possible intent frame is suggested to the user; and identification logic, implemented using the at least one element, configured to identify a high-probability intent frame from the plurality of possible intent frames, the high-probability intent frame being assigned a probability that is not less than a probability that is assigned to each other possible intent frame in the plurality of possible intent frames, the suggestion logic configured to include the high-probability intent frame in the one or more intent frames based on the high-probability intent frame being assigned a probability that is not less than a probability that is assigned to each other possible intent frame in the plurality of possible intent frames.
|
1. A processing system comprising: at least one element including at least one of (a) one or more processors or (b) hardware logic/electrical circuitry; activation logic, implemented using the at least one element, configured to determine whether natural language functionality of the processing system is activated, the natural language functionality for enabling the processing system to interpret natural language requests; suggestion logic, implemented using the at least one element, configured to generate one or more intent frames in response to a determination that the natural language functionality of the processing system is activated, each of the one or more intent frames including at least one carrier phrase and at least one slot; an interface configured to provide the one or more intent frames for perception by a user; assignment logic, implemented using the at least one element, configured to assign a plurality of probabilities to a plurality of respective possible intent frames, each probability indicating a likelihood that the user is to select the corresponding possible intent frame if the corresponding possible intent frame is suggested to the user; and identification logic, implemented using the at least one element, configured to identify a high-probability intent frame from the plurality of possible intent frames, the high-probability intent frame being assigned a probability that is not less than a probability that is assigned to each other possible intent frame in the plurality of possible intent frames, the suggestion logic configured to include the high-probability intent frame in the one or more intent frames based on the high-probability intent frame being assigned a probability that is not less than a probability that is assigned to each other possible intent frame in the plurality of possible intent frames. 4. The processing system of claim 1 , wherein the suggestion logic is configured to generate at least one of the one or more intent frames based on one or more topics that are accessed by the user with respect to a software application.
| 0.67313 |
9,286,683 | 4 | 7 |
4. A computer implemented method, comprising: under the control of one or more computer systems configured with executable instructions, receiving image data associated with an image captured by at least one camera of a computing device, the image data containing text; determining a distance between a character of the text and an edge of the image; determining that actionable text corresponding to the text of the image data may be incomplete based at least in part on one or more characteristics of the actionable text and the distance, wherein the one or more characteristics of the actionable text include at least one of a character size of the actionable text, a font of the actionable text, a height of the actionable text, or a spacing between each character of the actionable text; and providing an indication that the text of the image data may be incomplete.
|
4. A computer implemented method, comprising: under the control of one or more computer systems configured with executable instructions, receiving image data associated with an image captured by at least one camera of a computing device, the image data containing text; determining a distance between a character of the text and an edge of the image; determining that actionable text corresponding to the text of the image data may be incomplete based at least in part on one or more characteristics of the actionable text and the distance, wherein the one or more characteristics of the actionable text include at least one of a character size of the actionable text, a font of the actionable text, a height of the actionable text, or a spacing between each character of the actionable text; and providing an indication that the text of the image data may be incomplete. 7. The computer implemented method of claim 4 , further comprising: performing optical character recognition (OCR) on the image data to identify the text in the image; and transmitting the text to a computing device over a network.
| 0.720339 |
9,785,633 | 6 | 7 |
6. The apparatus according to claim 1 , wherein the information on the article attribute is a particular attribute category; the second acquisition unit acquires one or more subsequent speech candidates corresponding to the particular attribute category and a frequency of each of the one or more subsequent speech candidates from a subsequent speech candidate storing unit that stores a plurality of subsequent speech candidate entries including respective attribute categories, respective subsequent speech candidates, and respective frequencies at which the subsequent speech candidate entries are selected via the accepting unit; and the presentation unit presents the acquired one or more subsequent speech candidates based on the acquired frequencies.
|
6. The apparatus according to claim 1 , wherein the information on the article attribute is a particular attribute category; the second acquisition unit acquires one or more subsequent speech candidates corresponding to the particular attribute category and a frequency of each of the one or more subsequent speech candidates from a subsequent speech candidate storing unit that stores a plurality of subsequent speech candidate entries including respective attribute categories, respective subsequent speech candidates, and respective frequencies at which the subsequent speech candidate entries are selected via the accepting unit; and the presentation unit presents the acquired one or more subsequent speech candidates based on the acquired frequencies. 7. The apparatus according to claim 6 , wherein when the one or more subsequent speech candidates presented by the presentation unit are selected via the accepting unit, the frequencies of the one or more subsequent speech candidates stored in the subsequent speech candidate storing unit are updated.
| 0.5 |
8,150,939 | 1 | 3 |
1. A method for providing a JavaScript wrapper framework divided between a client and a server for componentizing JavaScript centric widgets, the method comprising: receiving a request for a widget to be rendered on the client, the request including a tag that defines a plurality of tag attributes that distinctly identify the widget, the request received by a client runtime component executing on the client, the client runtime component configured to load the widget when a HTML page initially loads on the client; forwarding the request to the server, the server identifying the widget based on the plurality of tag attributes received by a server-side component, the widget associated with a plurality of component resources; and the server generating a JavaScript wrapper code for each of the plurality of component resources associated with the widget and for the widget identified at the server using the plurality of tag attributes, the generated JavaScript wrapper code used in wrapping the widget and the associated plurality of component resources of the widget to provide a customized widget, wherein the wrapping of the widget and the associated plurality of component resources is customized to distinctly identify the widget, the customization enabling the widget to be rendered multiple times on the HTML page at the client without conflicts; receiving the wrapper code encompassing the widget and the associated plurality of component resources for the widget at the client; and rendering the widget on the HTML page at the client during the initial HTML page load based on information provided by the associated plurality of component resources, the associated plurality of component resources defining behavior and style of the widget, wherein the rendering of the widget further includes injecting each of the plurality of component resources in an order at an appropriate location of the HTML page so that the component resources are evaluated in a global scope of the HTML page when rendered at the client, wherein the plurality of component resources includes at least a component resource from a service and wherein the service is an external service residing on a domain external to a web application domain associated with an application requesting the widget on the client, the external service is associated with a plurality of external component resources, the plurality of external component resources retrieved using a generic proxy residing on the server, the generic proxy configured to provide restricted access to the external service.
|
1. A method for providing a JavaScript wrapper framework divided between a client and a server for componentizing JavaScript centric widgets, the method comprising: receiving a request for a widget to be rendered on the client, the request including a tag that defines a plurality of tag attributes that distinctly identify the widget, the request received by a client runtime component executing on the client, the client runtime component configured to load the widget when a HTML page initially loads on the client; forwarding the request to the server, the server identifying the widget based on the plurality of tag attributes received by a server-side component, the widget associated with a plurality of component resources; and the server generating a JavaScript wrapper code for each of the plurality of component resources associated with the widget and for the widget identified at the server using the plurality of tag attributes, the generated JavaScript wrapper code used in wrapping the widget and the associated plurality of component resources of the widget to provide a customized widget, wherein the wrapping of the widget and the associated plurality of component resources is customized to distinctly identify the widget, the customization enabling the widget to be rendered multiple times on the HTML page at the client without conflicts; receiving the wrapper code encompassing the widget and the associated plurality of component resources for the widget at the client; and rendering the widget on the HTML page at the client during the initial HTML page load based on information provided by the associated plurality of component resources, the associated plurality of component resources defining behavior and style of the widget, wherein the rendering of the widget further includes injecting each of the plurality of component resources in an order at an appropriate location of the HTML page so that the component resources are evaluated in a global scope of the HTML page when rendered at the client, wherein the plurality of component resources includes at least a component resource from a service and wherein the service is an external service residing on a domain external to a web application domain associated with an application requesting the widget on the client, the external service is associated with a plurality of external component resources, the plurality of external component resources retrieved using a generic proxy residing on the server, the generic proxy configured to provide restricted access to the external service. 3. The method for providing a JavaScript wrapper framework for componentizing JavaScript centric widgets divided between a client and a server of claim 1 , wherein receiving the associated plurality of component resources further including using default component resources for the widget when the plurality of component resources for the widget is unavailable at the server.
| 0.833629 |
7,801,899 | 1 | 18 |
1. A machine-implemented method comprising: receiving a request for keyword suggestions, the request including a seed keyword with which the keyword suggestions are to be generated; accepting, from two or more keyword suggestion tools, at least two heterogeneous sets of keyword suggestions for an online advertisement, wherein each set of keyword suggestions includes targeting keyword suggestions that are ranked and scored by a keyword suggestion tool that suggested the set of keyword suggestions, and wherein targeting keyword suggestions in each set of targeting keyword suggestions have been generated based on the seed keyword; for each heterogeneous sets of keyword suggestions accepted from the at least two or more keyword suggestion tools, determining, by one or more processors, a new normalized score for each of the targeting keyword suggestions in the heterogeneous set of keyword suggestions, wherein the new normalized score is computed based on a cardinal aspect of the targeting keyword suggestion and an ordinal aspect of the targeting keyword suggestion in the heterogeneous set of keyword suggestions, the cardinal aspect representing an absolute score corresponding to the targeting keyword suggestion and the ordinal aspect representing a rank of the targeting keyword suggestion in the heterogeneous set of keyword suggestions, and wherein the new normalized score for each targeting keyword suggestion in a particular set of heterogeneous keyword suggestions is defined as a sum of a first weight multiplied by the cardinal aspect and a second weight multiplied by the ordinal aspect; generating, by the one or more processors, an adjusted new score for each targeting keyword suggestion based on a result of a function of a new normalized score corresponding to the targeting keyword suggestion and trust factor of a keyword suggestion tool from which the targeting keyword was accepted, the trust factor representing a measure of reliability of the keyword suggestion tool; combining, by the one or more processors, the targeting keyword suggestions scored by a first keyword suggestion tool selected from the at least two or more keyword suggestion tools and the targeting keyword suggestions scored by a second suggestion tool selected from the at least two or more keyword suggestion tools using the new scores to generate a combined set of ordered and scored suggestions according to the adjusted new score for each targeting keyword suggestion; and providing the combined set of keyword suggestions to a user device.
|
1. A machine-implemented method comprising: receiving a request for keyword suggestions, the request including a seed keyword with which the keyword suggestions are to be generated; accepting, from two or more keyword suggestion tools, at least two heterogeneous sets of keyword suggestions for an online advertisement, wherein each set of keyword suggestions includes targeting keyword suggestions that are ranked and scored by a keyword suggestion tool that suggested the set of keyword suggestions, and wherein targeting keyword suggestions in each set of targeting keyword suggestions have been generated based on the seed keyword; for each heterogeneous sets of keyword suggestions accepted from the at least two or more keyword suggestion tools, determining, by one or more processors, a new normalized score for each of the targeting keyword suggestions in the heterogeneous set of keyword suggestions, wherein the new normalized score is computed based on a cardinal aspect of the targeting keyword suggestion and an ordinal aspect of the targeting keyword suggestion in the heterogeneous set of keyword suggestions, the cardinal aspect representing an absolute score corresponding to the targeting keyword suggestion and the ordinal aspect representing a rank of the targeting keyword suggestion in the heterogeneous set of keyword suggestions, and wherein the new normalized score for each targeting keyword suggestion in a particular set of heterogeneous keyword suggestions is defined as a sum of a first weight multiplied by the cardinal aspect and a second weight multiplied by the ordinal aspect; generating, by the one or more processors, an adjusted new score for each targeting keyword suggestion based on a result of a function of a new normalized score corresponding to the targeting keyword suggestion and trust factor of a keyword suggestion tool from which the targeting keyword was accepted, the trust factor representing a measure of reliability of the keyword suggestion tool; combining, by the one or more processors, the targeting keyword suggestions scored by a first keyword suggestion tool selected from the at least two or more keyword suggestion tools and the targeting keyword suggestions scored by a second suggestion tool selected from the at least two or more keyword suggestion tools using the new scores to generate a combined set of ordered and scored suggestions according to the adjusted new score for each targeting keyword suggestion; and providing the combined set of keyword suggestions to a user device. 18. The method of claim 1 , further comprising: receiving, for a keyword suggestion tool, performance feedback that represents a measure of keyword suggestion tool performance; and adjusting the trust factor of the keyword suggestion tool based on the performance feedback.
| 0.667073 |
8,908,961 | 3 | 4 |
3. The method of claim 1 , further comprising: building an Arabic corpus comprising Arabic text files and ground truths corresponding to each of the Arabic text files, wherein the Arabic text files include Arabic texts written in different writing styles; and storing writing-style indices in association with the Arabic text files by a computer, wherein each of the writing-style indices indicates that one of the Arabic text files is written in one of the writing styles, wherein the Hidden Markov Model is trained using the Arabic text files and ground truths in the Arabic corpus in accordance with the writing-style indices in association with the Arabic text files.
|
3. The method of claim 1 , further comprising: building an Arabic corpus comprising Arabic text files and ground truths corresponding to each of the Arabic text files, wherein the Arabic text files include Arabic texts written in different writing styles; and storing writing-style indices in association with the Arabic text files by a computer, wherein each of the writing-style indices indicates that one of the Arabic text files is written in one of the writing styles, wherein the Hidden Markov Model is trained using the Arabic text files and ground truths in the Arabic corpus in accordance with the writing-style indices in association with the Arabic text files. 4. The method of claim 3 , wherein the writing styles specify with or without punctuation in the Arabic text.
| 0.893137 |
8,880,516 | 32 | 39 |
32. A computer-implemented method, comprising: receiving, from particular members of a network, endorsements of electronic articles that that are presented to members of the network, particular ones of the endorsements involving a member of the network affirmatively selecting an endorsement control that is displayed simultaneously with a reference to a corresponding electronic article being endorsed; receiving a local search query from a first member that is for a particular geographic locality; searching one or more article indexes to identify a plurality of local search results that are responsive to the received local search query and correspond to the particular geographic locality, the one or more indexes indexing the electronic articles that are presented to members of the network; identifying, for particular ones of the local search results, corresponding endorsements received from particular members; ranking the plurality of local search results based at least in part on the identified endorsements; and providing references to the ranked local search results for presentation to the first member, wherein the presentation identifies, for particular ones of the references to the search results, particular ones of the members identified as having provided endorsements for the corresponding electronic articles.
|
32. A computer-implemented method, comprising: receiving, from particular members of a network, endorsements of electronic articles that that are presented to members of the network, particular ones of the endorsements involving a member of the network affirmatively selecting an endorsement control that is displayed simultaneously with a reference to a corresponding electronic article being endorsed; receiving a local search query from a first member that is for a particular geographic locality; searching one or more article indexes to identify a plurality of local search results that are responsive to the received local search query and correspond to the particular geographic locality, the one or more indexes indexing the electronic articles that are presented to members of the network; identifying, for particular ones of the local search results, corresponding endorsements received from particular members; ranking the plurality of local search results based at least in part on the identified endorsements; and providing references to the ranked local search results for presentation to the first member, wherein the presentation identifies, for particular ones of the references to the search results, particular ones of the members identified as having provided endorsements for the corresponding electronic articles. 39. The computer-implemented method of claim 32 , further comprising providing a financial incentive to at least one of the particular members.
| 0.839686 |
8,498,974 | 21 | 24 |
21. A computer readable medium having instructions stored thereon that, when executed by one or more processors, causes the one or more processors to perform operations comprising: obtaining a plurality of search results responsive to a search query submitted by a user, wherein each search result refers to a respective document that is associated with a respective plurality of click measures, each click measure relating to a different respective natural language and representing, at least, a measure of behavior of users associated with the respective language in regards to the document when the document was referred to in a search result previously provided in response to the search query; for each of a first plurality of the search results, reducing the click measure associated with the document referred to by the search result, wherein the click measure relates to a respective natural language that is incompatible with a natural language of the user; calculating a respective scoring factor for each of the first plurality of search results based on the respective click measures associated with the document referred to by the first search result; and ranking the search results based upon, at least, the calculated scoring factors.
|
21. A computer readable medium having instructions stored thereon that, when executed by one or more processors, causes the one or more processors to perform operations comprising: obtaining a plurality of search results responsive to a search query submitted by a user, wherein each search result refers to a respective document that is associated with a respective plurality of click measures, each click measure relating to a different respective natural language and representing, at least, a measure of behavior of users associated with the respective language in regards to the document when the document was referred to in a search result previously provided in response to the search query; for each of a first plurality of the search results, reducing the click measure associated with the document referred to by the search result, wherein the click measure relates to a respective natural language that is incompatible with a natural language of the user; calculating a respective scoring factor for each of the first plurality of search results based on the respective click measures associated with the document referred to by the first search result; and ranking the search results based upon, at least, the calculated scoring factors. 24. The computer readable medium of claim 21 wherein a plurality of the users are located in a different country than the user.
| 0.774823 |
8,589,408 | 6 | 7 |
6. A computer-implemented method to expand a set of seeds while applying a dynamic threshold of relatedness, the method comprising: receiving from a web query log a set of terms with contexts and one or more identified seeds, wherein the seeds are terms that are related to a concept for which to identify additional related terms from the set of terms; modeling the received terms and seeds as a bipartite graph with candidate terms being nodes on one side and identified context nodes on the other side by dividing each query into a context of a fixed number of tokens of prefix or suffix and a remaining term; determining a relevance score for each term based on the identified seeds; ranking the received set of terms by the determined relevance score; selecting an initial threshold ranking value for separating terms in the set related to the seeds from terms not related to the seeds; picking a top ranked number of terms above a threshold from the ranked set of terms based on the selected initial threshold to form a new set; determining a quality measurement that identifies how well each term relates to the picked threshold number of terms in the new set; ranking the terms in the new set based on the determined quality measurement; selecting a next threshold to use to separate terms in the new set related to the seeds from terms not related to the seeds; using the selected next threshold to select a threshold number of terms from the ranked new set; repeating the steps of determining the quality measurement, ranking the terms, and selecting a threshold number of terms for a determined number of iterations; and reporting the resulting expanded seed set that includes the terms in the received set that are the highest quality matches to the received seeds, wherein the preceding steps are performed by at least one processor.
|
6. A computer-implemented method to expand a set of seeds while applying a dynamic threshold of relatedness, the method comprising: receiving from a web query log a set of terms with contexts and one or more identified seeds, wherein the seeds are terms that are related to a concept for which to identify additional related terms from the set of terms; modeling the received terms and seeds as a bipartite graph with candidate terms being nodes on one side and identified context nodes on the other side by dividing each query into a context of a fixed number of tokens of prefix or suffix and a remaining term; determining a relevance score for each term based on the identified seeds; ranking the received set of terms by the determined relevance score; selecting an initial threshold ranking value for separating terms in the set related to the seeds from terms not related to the seeds; picking a top ranked number of terms above a threshold from the ranked set of terms based on the selected initial threshold to form a new set; determining a quality measurement that identifies how well each term relates to the picked threshold number of terms in the new set; ranking the terms in the new set based on the determined quality measurement; selecting a next threshold to use to separate terms in the new set related to the seeds from terms not related to the seeds; using the selected next threshold to select a threshold number of terms from the ranked new set; repeating the steps of determining the quality measurement, ranking the terms, and selecting a threshold number of terms for a determined number of iterations; and reporting the resulting expanded seed set that includes the terms in the received set that are the highest quality matches to the received seeds, wherein the preceding steps are performed by at least one processor. 7. The method of claim 6 wherein receiving the terms and seeds comprises receiving the terms and seeds programmatically through an application-programming interface (API) that exposes the method to software components to provide set expansion functionality.
| 0.631805 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.