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
1
|
|---|---|---|---|---|---|
7,784,002 | 1 | 2 | 1. A system for using relative positioning within an Integrated Circuit (IC) design structure, the system comprising: an interface to receive requests to determine relative positions for one or more specific locations of entities within an IC design structure, the requests comprising a list of bits and hierarchy information for each bit, and to receive requests to determine specific locations associated with one or more relative positions of an IC design structure, the requests comprising a list of user-defined ranges and hierarchy information for each user-defined range; a user-defined type module, the user-defined type module comprising one or more user-defined types representing a relative position in a structure; a translation helper module, the translation helper module being adapted to receive information associated with a hierarchy and to return location information associated with the hierarchy; a translation module in communication with the user-defined type module and the translation helper module, the translation module being adapted to translate between a specific location and relative position of the structure based on one or more user-defined types and location information returned from the translation helper module and to generate a list of translated results; a relative position determiner of the translation module, the relative position determiner translating one or more received specific locations to one or more relative positions by determining locations within a design hierarchy based on the request to determine relative positions by determining design hierarchy locations with respect to an enclosing group within the hierarchy for each of the bits, comparing the determined locations with the one or more specific locations of the request by comparing known bit numbers within the design hierarchy to the bits of the request, and generating a list of relative positions based on bits of the request that matched known bit numbers within the determined design hierarchy; and a specific location determiner of the translation module to translate one or more received relative positions to one or more specific locations by determining locations within a design hierarchy based on the request to determine specific locations by determining design hierarchy locations with respect to an enclosing group within the hierarchy for elements of each of the user-defined ranges, determining specific locations for each relative position in the request to determine specific locations, and generating a list of the determined specific locations for each relative position. | 1. A system for using relative positioning within an Integrated Circuit (IC) design structure, the system comprising: an interface to receive requests to determine relative positions for one or more specific locations of entities within an IC design structure, the requests comprising a list of bits and hierarchy information for each bit, and to receive requests to determine specific locations associated with one or more relative positions of an IC design structure, the requests comprising a list of user-defined ranges and hierarchy information for each user-defined range; a user-defined type module, the user-defined type module comprising one or more user-defined types representing a relative position in a structure; a translation helper module, the translation helper module being adapted to receive information associated with a hierarchy and to return location information associated with the hierarchy; a translation module in communication with the user-defined type module and the translation helper module, the translation module being adapted to translate between a specific location and relative position of the structure based on one or more user-defined types and location information returned from the translation helper module and to generate a list of translated results; a relative position determiner of the translation module, the relative position determiner translating one or more received specific locations to one or more relative positions by determining locations within a design hierarchy based on the request to determine relative positions by determining design hierarchy locations with respect to an enclosing group within the hierarchy for each of the bits, comparing the determined locations with the one or more specific locations of the request by comparing known bit numbers within the design hierarchy to the bits of the request, and generating a list of relative positions based on bits of the request that matched known bit numbers within the determined design hierarchy; and a specific location determiner of the translation module to translate one or more received relative positions to one or more specific locations by determining locations within a design hierarchy based on the request to determine specific locations by determining design hierarchy locations with respect to an enclosing group within the hierarchy for elements of each of the user-defined ranges, determining specific locations for each relative position in the request to determine specific locations, and generating a list of the determined specific locations for each relative position. 2. The system of claim 1 , wherein the interface is a user interface to receive input from a user and to provide output to a user. | 0.73029 |
8,926,672 | 20 | 24 | 20. In a spinal fixation structure having a bone anchor and a closure, the anchor for holding a spinal fixation longitudinal connecting member, the anchor having an open receiver with spaced apart arms defining a longitudinal connecting member receiving channel therebetween and the closure sized for being received within the channel and adapted for rotation and advancement into the channel between the arms to capture a portion of the longitudinal connecting member in the channel, the improvement comprising: a) a closure guide and advancement flange form extending helically along the closure and about a central axis of the closure, the flange form having a pitch of between 0.045 and 0.055 inches, and having a crest portion with a first axial height and a root portion having a second axial height, the first height measured from a top of an upwardly extending toe of the flange form to a stab flank and taken substantially along a crest surface of the flange form, the second height measured from a load flank of the flange form to the stab flank and taken substantially along a root surface of the flange form, the first height being one of slightly less and substantially equal to the second height, the flange form having a splay control ramp surface located between the toe and the load flank running substantially at an oblique angle with respect to a radius of the closure running perpendicular to the closure axis; and b) a discontinuous receiver guide and advancement flange form extending helically about and along an inner surface of each receiver arm, the receiver flang form having a cooperating splay control ramp engaging the closure flange form control ramp during mating of the closure flange form with the receiver flange form, the receiver flange form having a clearance surfaces disposed in close spaced relation to the closure toe, the toe remaining unloaded during mating engagement and torquing of the closure flange form with the receiver flange form. | 20. In a spinal fixation structure having a bone anchor and a closure, the anchor for holding a spinal fixation longitudinal connecting member, the anchor having an open receiver with spaced apart arms defining a longitudinal connecting member receiving channel therebetween and the closure sized for being received within the channel and adapted for rotation and advancement into the channel between the arms to capture a portion of the longitudinal connecting member in the channel, the improvement comprising: a) a closure guide and advancement flange form extending helically along the closure and about a central axis of the closure, the flange form having a pitch of between 0.045 and 0.055 inches, and having a crest portion with a first axial height and a root portion having a second axial height, the first height measured from a top of an upwardly extending toe of the flange form to a stab flank and taken substantially along a crest surface of the flange form, the second height measured from a load flank of the flange form to the stab flank and taken substantially along a root surface of the flange form, the first height being one of slightly less and substantially equal to the second height, the flange form having a splay control ramp surface located between the toe and the load flank running substantially at an oblique angle with respect to a radius of the closure running perpendicular to the closure axis; and b) a discontinuous receiver guide and advancement flange form extending helically about and along an inner surface of each receiver arm, the receiver flang form having a cooperating splay control ramp engaging the closure flange form control ramp during mating of the closure flange form with the receiver flange form, the receiver flange form having a clearance surfaces disposed in close spaced relation to the closure toe, the toe remaining unloaded during mating engagement and torquing of the closure flange form with the receiver flange form. 24. The improvement of claim 20 wherein a pitch of the closure flange form ranges between about 0.65 inches and out 0.070 inches. | 0.904444 |
8,601,414 | 8 | 12 | 8. The method of claim 6 further comprises creating one or more lemmas from the set of constraints that represent the violation and conjoining the lemmas with the abstraction model for subsequent iterations. | 8. The method of claim 6 further comprises creating one or more lemmas from the set of constraints that represent the violation and conjoining the lemmas with the abstraction model for subsequent iterations. 12. The method of claim 8 further comprises storing the lemmas in a database for subsequent iterations or verification of the same electronic circuit. | 0.950593 |
9,658,991 | 2 | 6 | 2. The method of claim 1 wherein the building of the directional links further comprises: selecting one of the sections from the plurality of sections; building zero or more directional links between the selected section and the other sections included in the plurality of sections by: establishing zero or more vertical links between the selected section from the plurality of sections and a reference section selected from the plurality of sections wherein the selected section has at least one common horizontal coordinate position with the selected reference section and wherein a vertical rectangle space formed by a horizontal boundary of the selected section and a corresponding horizontal boundary the selected reference section is void of any intervening sections from the plurality of sections; and establishing zero or more horizontal links between the selected section and the selected reference section wherein the selected section has at least one common vertical coordinate position with the selected reference section and wherein a horizontal rectangle space formed by a vertical boundary of the selected section and a corresponding vertical boundary the selected reference section is void of any intervening sections from the plurality of sections; and repeatedly selecting a next one of the sections from the plurality of sections and building the zero or more directional links until each of the sections from the plurality of sections has been selected. | 2. The method of claim 1 wherein the building of the directional links further comprises: selecting one of the sections from the plurality of sections; building zero or more directional links between the selected section and the other sections included in the plurality of sections by: establishing zero or more vertical links between the selected section from the plurality of sections and a reference section selected from the plurality of sections wherein the selected section has at least one common horizontal coordinate position with the selected reference section and wherein a vertical rectangle space formed by a horizontal boundary of the selected section and a corresponding horizontal boundary the selected reference section is void of any intervening sections from the plurality of sections; and establishing zero or more horizontal links between the selected section and the selected reference section wherein the selected section has at least one common vertical coordinate position with the selected reference section and wherein a horizontal rectangle space formed by a vertical boundary of the selected section and a corresponding vertical boundary the selected reference section is void of any intervening sections from the plurality of sections; and repeatedly selecting a next one of the sections from the plurality of sections and building the zero or more directional links until each of the sections from the plurality of sections has been selected. 6. The method of claim 2 further comprising: vertically merging two or more of the plurality of sections by: identifying one of the plurality of sections as a selected section and one of the plurality of sections as a reference section, wherein the identification is based on the selected section including a first directional link to the reference section in a first vertical direction and the reference section including a second directional link to the selected section in an second vertical direction, wherein the second vertical direction is opposite from the first vertical direction; and merging the selected section and the reference section to form one of the increasingly larger sections; and repeating the building of the zero or more directional links between the increasingly larger section formed by the merger of the selected section and the reference section with the other sections included in the plurality of sections. | 0.592963 |
10,031,728 | 15 | 16 | 15. The method of claim 11 , comprising: determining a display element of the interactive application in the first format corresponding to the user input. | 15. The method of claim 11 , comprising: determining a display element of the interactive application in the first format corresponding to the user input. 16. The method of claim 15 , wherein determining the display element of the interactive application in the first format corresponding to the user input comprises: comparing a location of the user input with known locations of a plurality of display elements of the interactive application; and determining the display element of the interactive application based on the location of the user input corresponding to a location of the display element of the interactive application. | 0.818698 |
7,985,243 | 16 | 17 | 16. The implant of claim 15 including: a connected located at said second end of said inner rod of said deflection rod; said connector located adjacent to said outer shell; said connector extending from said shield; and a rod connected to said connector. | 16. The implant of claim 15 including: a connected located at said second end of said inner rod of said deflection rod; said connector located adjacent to said outer shell; said connector extending from said shield; and a rod connected to said connector. 17. The implant of claim 16 wherein said connector includes a ball and socket connector. | 0.957529 |
7,627,514 | 1 | 5 | 1. A method for determining an auction format for a market, said method comprising the steps of: selecting, performed by a computer system, characteristics of said market based at least in part on stored historical bids data that includes data for historical auctions performed in the past for a plurality of bidders, wherein said historical bids data is stored on computer readable medium that is accessed by said computer system; selecting, performed by said computer system, a relevant bidding model that specifies past bidding behavior as a function of information held privately by a bidder, that is determined based at least in part on said historical auctions data, and said characteristics of said market based on segments of said historical auctions related to a specified item; selecting, performed by said computer system, at least a first estimated structure of said market, which describes at least a first factor that affects how bidders behave, and a second estimated structure of said market, which describes a second factor that affects how bidders behave, at least in part by inverting said relevant bidding model; predicting, performed by said computer system, a first bidding behavior utilizing said first estimated structure of said market, said characteristics of said market and said relevant bidding model; predicting, performed by said computer system, a first outcome of said market based on said first bidding behavior; predicting, performed by said computer system, at least a second bidding behavior utilizing at least said second estimated structure of said market, said characteristics of said market and said relevant bidding model; predicting, performed by said computer system, a second outcome of said market based on at least said second bidding behavior prediction; and determining, performed by said computer system, said auction format for said market by evaluating said first outcome of said market and at least said second outcome of said market. | 1. A method for determining an auction format for a market, said method comprising the steps of: selecting, performed by a computer system, characteristics of said market based at least in part on stored historical bids data that includes data for historical auctions performed in the past for a plurality of bidders, wherein said historical bids data is stored on computer readable medium that is accessed by said computer system; selecting, performed by said computer system, a relevant bidding model that specifies past bidding behavior as a function of information held privately by a bidder, that is determined based at least in part on said historical auctions data, and said characteristics of said market based on segments of said historical auctions related to a specified item; selecting, performed by said computer system, at least a first estimated structure of said market, which describes at least a first factor that affects how bidders behave, and a second estimated structure of said market, which describes a second factor that affects how bidders behave, at least in part by inverting said relevant bidding model; predicting, performed by said computer system, a first bidding behavior utilizing said first estimated structure of said market, said characteristics of said market and said relevant bidding model; predicting, performed by said computer system, a first outcome of said market based on said first bidding behavior; predicting, performed by said computer system, at least a second bidding behavior utilizing at least said second estimated structure of said market, said characteristics of said market and said relevant bidding model; predicting, performed by said computer system, a second outcome of said market based on at least said second bidding behavior prediction; and determining, performed by said computer system, said auction format for said market by evaluating said first outcome of said market and at least said second outcome of said market. 5. The method as recited in claim 1 , wherein said relevant bidding model has embedded an unknown structure, and wherein said predicting of said first bidding behavior step comprises the steps of: receiving said estimated structure of said market; receiving said relevant bidding model; substituting said unknown structure with said estimated structure of said market; and outputting a prediction of bidding behavior. | 0.816784 |
9,690,771 | 11 | 13 | 11. An annotation system comprising: at least one processor unit; a display device; a user input device; and memory storing instructions that, when executed by the at least one processor, cause the annotation system to: configure a grammar and an ontology used for natural language understanding (NLU) processing by: obtaining plurality of annotations using the ontology and the grammar, each of the plurality of annotations corresponding to one of a plurality of text samples; performing, by the computing device, one or more quality assurance checks for at least one of the plurality of annotations, the ontology, or the grammar; generating, by the computing device, a list of one or more flagged annotations, each of the one or more flagged annotations corresponding to one of the plurality of annotations flagged during one of the one or more quality assurance checks; presenting, at a display device of the computing device, the list of flagged annotations; receiving, via a user input device of the computing device, user input modifying one of the one or more flagged annotations to obtain a modified annotation; and updating at least one of the grammar or the ontology based on the modified annotation; and during performance of the first one of the quality assurance checks: compare a first arrangement of a set of hypernyms in a first annotation of the plurality of annotations to a second arrangement of the set of hypernyms in a second annotation of the plurality of annotations; and configure the list of flagged annotations to include the first annotation and the second annotation responsive to determine that the first arrangement of the set of hypernyms does not match the second arrangement of the set of hypernyms. | 11. An annotation system comprising: at least one processor unit; a display device; a user input device; and memory storing instructions that, when executed by the at least one processor, cause the annotation system to: configure a grammar and an ontology used for natural language understanding (NLU) processing by: obtaining plurality of annotations using the ontology and the grammar, each of the plurality of annotations corresponding to one of a plurality of text samples; performing, by the computing device, one or more quality assurance checks for at least one of the plurality of annotations, the ontology, or the grammar; generating, by the computing device, a list of one or more flagged annotations, each of the one or more flagged annotations corresponding to one of the plurality of annotations flagged during one of the one or more quality assurance checks; presenting, at a display device of the computing device, the list of flagged annotations; receiving, via a user input device of the computing device, user input modifying one of the one or more flagged annotations to obtain a modified annotation; and updating at least one of the grammar or the ontology based on the modified annotation; and during performance of the first one of the quality assurance checks: compare a first arrangement of a set of hypernyms in a first annotation of the plurality of annotations to a second arrangement of the set of hypernyms in a second annotation of the plurality of annotations; and configure the list of flagged annotations to include the first annotation and the second annotation responsive to determine that the first arrangement of the set of hypernyms does not match the second arrangement of the set of hypernyms. 13. The annotation system of claim 11 wherein the instructions, when executed by the at least one processor during performance of a second one of the quality assurance checks, cause the annotation system to: obtain a group of text samples using semantic clustering techniques, the group of text samples comprising a first text sample corresponding to a first annotation of the plurality of annotations and a second text sample corresponding to a second annotation of the plurality of annotations; compare a first hypernym of the first annotation to a second hypernym of the second annotation; and configure the list of flagged annotations to include the first annotation and the second annotation responsive to determining that the first hypernym differs from the second hypernym. | 0.50064 |
6,041,300 | 12 | 13 | 12. A speech recognition and synthesis system, comprising: speech receiving means for receiving spoken words from at least a first speaker; a decoder for decoding the words into a plurality of associated lefeme waveforms, said lefeme waveforms comprising portions of phones in a given context; storage means for storing instances said lefeme waveforms comprising an enrolled vocabulary; means for inputting a word to be recognized from said enrolled vocabulary by a second speaker, said decoder decoding the word to be recognized into associated lefeme waveforms; means for finding closest match lefeme waveforms between said associated lefeme waveforms and ones of said lefeme waveforms stored in said storage means; and means for concatenating said closest match lefeme waveforms from said storage means to synthesize a recognized word, wherein when the first speaker and the second speaker are the same person, said recognized word is synthesized in the person's own voice. | 12. A speech recognition and synthesis system, comprising: speech receiving means for receiving spoken words from at least a first speaker; a decoder for decoding the words into a plurality of associated lefeme waveforms, said lefeme waveforms comprising portions of phones in a given context; storage means for storing instances said lefeme waveforms comprising an enrolled vocabulary; means for inputting a word to be recognized from said enrolled vocabulary by a second speaker, said decoder decoding the word to be recognized into associated lefeme waveforms; means for finding closest match lefeme waveforms between said associated lefeme waveforms and ones of said lefeme waveforms stored in said storage means; and means for concatenating said closest match lefeme waveforms from said storage means to synthesize a recognized word, wherein when the first speaker and the second speaker are the same person, said recognized word is synthesized in the person's own voice. 13. A speech recognition and synthesis system, as recited in claim 12 wherein said decoder is a Viterbi decoder. | 0.616438 |
8,626,682 | 15 | 18 | 15. The system of claim 14 , wherein the memory stores instructions that, in response to receiving the request, cause the processor to: execute a first loop code segment comprising a first loop construct, wherein the first loop code segment is executed at run time at least n times, wherein n is a value at run time of a first variable in a first loop termination condition; execute a second loop code segment comprising a second loop construct, wherein the second loop code segment is executed at least p×n times, wherein p is a value at run time of a second variable in a second loop termination condition; and execute a third loop code segment comprising a third loop construct, wherein the third loop code segment is executed p×n×q times, wherein q is a value at run time of a third variable in a third loop termination condition. | 15. The system of claim 14 , wherein the memory stores instructions that, in response to receiving the request, cause the processor to: execute a first loop code segment comprising a first loop construct, wherein the first loop code segment is executed at run time at least n times, wherein n is a value at run time of a first variable in a first loop termination condition; execute a second loop code segment comprising a second loop construct, wherein the second loop code segment is executed at least p×n times, wherein p is a value at run time of a second variable in a second loop termination condition; and execute a third loop code segment comprising a third loop construct, wherein the third loop code segment is executed p×n×q times, wherein q is a value at run time of a third variable in a third loop termination condition. 18. The system of claim 15 , wherein the memory stores instructions that, for each of the p times the second loop code is executed, cause the processor to: apply at least one profile of a set of profiles to each document of the UNVDS, the at least one profile defining a rule to be applied to each document of the UNVDS; compare at least one document of the UNVDS to all of the documents included in the first set of documents; and delete the at least one document from the UNVDS based on the comparison. | 0.772152 |
10,074,108 | 19 | 20 | 19. The method of claim 18 , further comprising: accessing a pairing server when processing an identification data associated with the sandbox reachable service of the networked device that shares a public address with the client device, wherein the pairing server performs a discovery lookup of any device that has announced that it shares the public address associated with the client device, and wherein the sandbox reachable service announces itself to the pairing server prior to establishment of a communication session between the sandboxed application and the sandbox reachable service; and appending a header of a hypertext transfer protocol to permit the networked device to communicate with the sandboxed application as a permitted origin domain through a CORS algorithm, the header being either one of an origin header when the CORS algorithm is applied and a referrer header in an alternate algorithm in accordance with the client device: processing the identification data associated with the sandbox reachable service sharing the public address with the client device; determining a private address pair of the sandbox reachable service based on the identification data; and establishing the communication session between the sandboxed application and the sandbox reachable service using a cross-site scripting technique of the security sandbox. | 19. The method of claim 18 , further comprising: accessing a pairing server when processing an identification data associated with the sandbox reachable service of the networked device that shares a public address with the client device, wherein the pairing server performs a discovery lookup of any device that has announced that it shares the public address associated with the client device, and wherein the sandbox reachable service announces itself to the pairing server prior to establishment of a communication session between the sandboxed application and the sandbox reachable service; and appending a header of a hypertext transfer protocol to permit the networked device to communicate with the sandboxed application as a permitted origin domain through a CORS algorithm, the header being either one of an origin header when the CORS algorithm is applied and a referrer header in an alternate algorithm in accordance with the client device: processing the identification data associated with the sandbox reachable service sharing the public address with the client device; determining a private address pair of the sandbox reachable service based on the identification data; and establishing the communication session between the sandboxed application and the sandbox reachable service using a cross-site scripting technique of the security sandbox. 20. The method of claim 19 , wherein: the pairing server performs a discovery lookup of any device that has announced sharing of the public address associated with the client device, and the method further comprises the sandbox reachable service announcing itself to the pairing server prior to the establishment of the communication session between the sandboxed application and the sandbox reachable service. | 0.935958 |
7,797,625 | 9 | 10 | 9. The computer of claim 8 , wherein said message formats include SGML and book manager script. | 9. The computer of claim 8 , wherein said message formats include SGML and book manager script. 10. The computer of claim 9 wherein said message formats further include formatted display. | 0.955868 |
8,224,827 | 11 | 13 | 11. A computer-readable memory device, comprising: a plurality of computer-executable instructions, which, when executed by one or more processors, cause the one or more processors to: determine a first average amount of time that a first set of users spent accessing a document during a first time period; determine a second average amount of time that a second set of users spent accessing the same document during a second time period, the second time period occurring after the first time period; compare the first average amount of time to the second average amount of time determine, based on the comparing, that the first average amount of time is different from the second average amount of time classify the document as stale or fresh based on determining that the first average amount of time is different from the second average amount of time, when classifying the document, the one or more devices further being to: classify the document as stale when determining that the first average amount of time is greater than the second average amount of time, and classify the document as fresh when determining that the first average amount of time is less than the second average amount of time generate a score for the document based on classifying the document as stale or fresh; and rank the document with regard to at least one other document based on the generated score. | 11. A computer-readable memory device, comprising: a plurality of computer-executable instructions, which, when executed by one or more processors, cause the one or more processors to: determine a first average amount of time that a first set of users spent accessing a document during a first time period; determine a second average amount of time that a second set of users spent accessing the same document during a second time period, the second time period occurring after the first time period; compare the first average amount of time to the second average amount of time determine, based on the comparing, that the first average amount of time is different from the second average amount of time classify the document as stale or fresh based on determining that the first average amount of time is different from the second average amount of time, when classifying the document, the one or more devices further being to: classify the document as stale when determining that the first average amount of time is greater than the second average amount of time, and classify the document as fresh when determining that the first average amount of time is less than the second average amount of time generate a score for the document based on classifying the document as stale or fresh; and rank the document with regard to at least one other document based on the generated score. 13. The computer-readable memory device of claim 11 , where the plurality computer-executable instructions further cause the one or more processors to: lower a ranking of the document, with regard to the at least one other document, when the document is classified as stale. | 0.781847 |
9,753,698 | 6 | 7 | 6. The method of claim 5 wherein the declarative construct is considered to be a domain, and the runtime construct is considered to be a domain instance. | 6. The method of claim 5 wherein the declarative construct is considered to be a domain, and the runtime construct is considered to be a domain instance. 7. The method of claim 6 wherein public members of the domain are domain constructors. | 0.977249 |
7,765,502 | 8 | 11 | 8. A computer storage and readable medium having program instructions for generating a register interface module, comprising method operations of: executing and providing a functional specification for the program instructions; program instructions for identifying successive register descriptions within the functional specification; program instructions for extracting register information from each of the successive register descriptions; program instructions for verifying a name assigned to each of the successive register descriptions is unique among the register descriptions; and program instructions for generating a register definition file once each name has been verified as being unique. | 8. A computer storage and readable medium having program instructions for generating a register interface module, comprising method operations of: executing and providing a functional specification for the program instructions; program instructions for identifying successive register descriptions within the functional specification; program instructions for extracting register information from each of the successive register descriptions; program instructions for verifying a name assigned to each of the successive register descriptions is unique among the register descriptions; and program instructions for generating a register definition file once each name has been verified as being unique. 11. The computer readable medium of claim 8 , wherein the program instructions for extracting register information from each of the successive register descriptions includes, program instructions for parsing text constructs to identify a name of each register. | 0.603659 |
9,875,303 | 13 | 15 | 13. A system for labeling clusters of visual objects, comprising: a memory comprising a code; at least one processor adapted to execute said code in which said code comprising: code instructions for identifying a plurality of records each comprising at least one object image associated with at least one textual field; code instructions for applying a visual analysis of a visual similarity between respective said object images of said plurality of records to yield a plurality of sub clusters; code instructions for uniting said plurality of sub clusters into a plurality of clusters according to text similarity between said object images by applying a text similarity function on each said at least one textual field; code instructions for labeling each cluster of the plurality of clusters with a label reflecting a common semantic factor of respective said textual fields of members in each cluster; code instructions for displaying a catalog wherein the label of each cluster of the plurality of clusters is presented in association with the representative image thereof, the catalog is displayed as part of a user interface at a user terminal; wherein the visual similarity provides a measure of resemblances between two visual objects based on local descriptors in the visual objects. | 13. A system for labeling clusters of visual objects, comprising: a memory comprising a code; at least one processor adapted to execute said code in which said code comprising: code instructions for identifying a plurality of records each comprising at least one object image associated with at least one textual field; code instructions for applying a visual analysis of a visual similarity between respective said object images of said plurality of records to yield a plurality of sub clusters; code instructions for uniting said plurality of sub clusters into a plurality of clusters according to text similarity between said object images by applying a text similarity function on each said at least one textual field; code instructions for labeling each cluster of the plurality of clusters with a label reflecting a common semantic factor of respective said textual fields of members in each cluster; code instructions for displaying a catalog wherein the label of each cluster of the plurality of clusters is presented in association with the representative image thereof, the catalog is displayed as part of a user interface at a user terminal; wherein the visual similarity provides a measure of resemblances between two visual objects based on local descriptors in the visual objects. 15. The system according to claim 13 , wherein said at least one processor is adapted to execute said code in which said code further comprises code instructions for filtering out copyrighted records from said plurality of records, wherein a copyrighted object image of a copyrighted record exhibits a visual similarity above a specified level with an object image ranked above a specified level of relevance retrieved by an image search engine applied to at least one textual field associated with the object image. | 0.500967 |
9,639,751 | 1 | 2 | 1. A system comprising: one or more processors; one or more non-transitory computer-readable mediums operatively coupled to the one or more processors, and having instructions stored thereon, that when executed by the one or more processors cause a computing device to: receive a document image file of a property record comprising one or more images; recognize a document title in the document image file; determine a document type of the property record based on the document title; recognize other data strings in the document image file; identify from the other data strings validation candidate data strings for validation based on the determined document type and a set of rules; search a validation server for target data strings that were extracted from at least one property document that precedes the property record; compare the validation candidate data strings and the target data strings to determine a validation score for each of the validation candidate data strings, wherein each of the validation scores indicates a confidence that a respective validation candidate data string was correctly recognized. | 1. A system comprising: one or more processors; one or more non-transitory computer-readable mediums operatively coupled to the one or more processors, and having instructions stored thereon, that when executed by the one or more processors cause a computing device to: receive a document image file of a property record comprising one or more images; recognize a document title in the document image file; determine a document type of the property record based on the document title; recognize other data strings in the document image file; identify from the other data strings validation candidate data strings for validation based on the determined document type and a set of rules; search a validation server for target data strings that were extracted from at least one property document that precedes the property record; compare the validation candidate data strings and the target data strings to determine a validation score for each of the validation candidate data strings, wherein each of the validation scores indicates a confidence that a respective validation candidate data string was correctly recognized. 2. The system of claim 1 , wherein the instructions are further configured to cause the computing device to: verify that a first validation candidate data string is valid if the first validation candidate data string's respective validation score exceeds a first predetermined threshold; and verify that a second validation candidate data string is valid if the second validation candidate data string's respective validation score exceeds the first predetermined threshold. | 0.501053 |
8,990,070 | 17 | 21 | 17. A computer program product for building an expression, the computer program product comprising: a non-transitory computer-readable storage medium; and computer-readable program code embodied in the non-transitory computer-readable storage medium, where the computer-readable program code, when executed by a processor of a computer, is configured to perform: displaying an expression on a computer display via a graphical user interface, where the expression includes a non-terminal display object corresponding to a non-terminal element defined in a grammar; and in response to receiving selection of the non-terminal display object, displaying a candidate terminal display object and a candidate non-terminal display object, where the candidate terminal display object corresponds to a terminal element within the grammar, and where the candidate non-terminal display object corresponds to another non-terminal element within the grammar; in response to receiving selection of the candidate terminal display object, replacing the selected non-terminal display object in the expression with the selected candidate terminal display object; and in response to receiving selection of the candidate non-terminal display object, replacing the selected non-terminal display object in the expression with the candidate non-terminal display object, where the candidate non-terminal display object is further replaced by one of another candidate terminal display object and another candidate non-terminal display object until no non-terminal display object remains in the displayed expression. | 17. A computer program product for building an expression, the computer program product comprising: a non-transitory computer-readable storage medium; and computer-readable program code embodied in the non-transitory computer-readable storage medium, where the computer-readable program code, when executed by a processor of a computer, is configured to perform: displaying an expression on a computer display via a graphical user interface, where the expression includes a non-terminal display object corresponding to a non-terminal element defined in a grammar; and in response to receiving selection of the non-terminal display object, displaying a candidate terminal display object and a candidate non-terminal display object, where the candidate terminal display object corresponds to a terminal element within the grammar, and where the candidate non-terminal display object corresponds to another non-terminal element within the grammar; in response to receiving selection of the candidate terminal display object, replacing the selected non-terminal display object in the expression with the selected candidate terminal display object; and in response to receiving selection of the candidate non-terminal display object, replacing the selected non-terminal display object in the expression with the candidate non-terminal display object, where the candidate non-terminal display object is further replaced by one of another candidate terminal display object and another candidate non-terminal display object until no non-terminal display object remains in the displayed expression. 21. The computer program product of claim 17 where the computer-readable program code is configured to perform generating the expression to initially include the non-terminal display object corresponding to a root object defined in the grammar. | 0.754527 |
7,617,098 | 1 | 2 | 1. A computer-readable medium having computer-executable instructions for performing steps comprising: using a prior model of static aspects of clean speech to produce a static-based predicted value; using a prior model of dynamic aspects of clean speech to produce a dynamic-based predicted value; applying a noisy feature vector representing a frame of noisy speech to an acoustic environment model to produce an acoustic environment-based predicted value; and combining the static-based predicted value, the dynamic-based predicted value and the acoustic environment-based predicted value to form at least one component of a noise-reduced feature vector. | 1. A computer-readable medium having computer-executable instructions for performing steps comprising: using a prior model of static aspects of clean speech to produce a static-based predicted value; using a prior model of dynamic aspects of clean speech to produce a dynamic-based predicted value; applying a noisy feature vector representing a frame of noisy speech to an acoustic environment model to produce an acoustic environment-based predicted value; and combining the static-based predicted value, the dynamic-based predicted value and the acoustic environment-based predicted value to form at least one component of a noise-reduced feature vector. 2. The computer-readable medium of claim 1 wherein using a prior model of static aspects of clean speech comprises selecting a mean of a distribution in the prior model of static aspects of clean speech as the static-based predicted value. | 0.810918 |
7,885,957 | 17 | 18 | 17. A method for placing clusters into a display, comprising: generating a set of clusters, each cluster comprising one or more concepts; forming candidate spines from the clusters, comprising: grouping each candidate spine from those clusters sharing at least one of the concepts; and assigning the remaining clusters in the set to the candidate spines having a best fit; placing those candidate spines that are sufficiently unique from the other candidate spines into a display; and displaying the other candidate spines, comprising: selecting anchor clusters on the placed candidate spines; determining a similarity between at least one of the candidate spines and each anchor cluster; and grafting the candidate spine on one such anchor cluster that is most similar. | 17. A method for placing clusters into a display, comprising: generating a set of clusters, each cluster comprising one or more concepts; forming candidate spines from the clusters, comprising: grouping each candidate spine from those clusters sharing at least one of the concepts; and assigning the remaining clusters in the set to the candidate spines having a best fit; placing those candidate spines that are sufficiently unique from the other candidate spines into a display; and displaying the other candidate spines, comprising: selecting anchor clusters on the placed candidate spines; determining a similarity between at least one of the candidate spines and each anchor cluster; and grafting the candidate spine on one such anchor cluster that is most similar. 18. A method according to claim 17 , further comprising: applying acceptance criteria to the concepts; and selecting those concepts that satisfy the acceptance criteria as candidate spine concepts. | 0.822842 |
7,778,982 | 15 | 17 | 15. A method for processing a document, the method comprising: storing data corresponding to at least one of the document, a plurality of documents processed at a previous time, and a set of rules wherein at least one rule in the set of rules is configured to include a rule identifier, the set of rules is further configured to include one or more of a rule for parsing, a rule for validating, a rule for identifying, a rule for relating, a rule for selecting, a rule for extracting to extract data components from the set of transformed documents and to create a report from the extracted data components, a rule for transforming, a rule for generating, a rule for analyzing including a plurality of steps of the analysis, a rule for error correcting, the rule for error correcting in the set of rules being configured (i) to identify an error in one of a data component and a relationship between two or more data components and (ii) to correct the error, wherein the rule for error correcting includes instructions for identifying an error in one of a data component and a relationship between two or more data components and instructions for correcting the error or return an error status to the source of the document if the error is not corrected, a rule for reporting, and a rule for sending, the rule for transforming being configured to include an identification associated with the document, an identification associated with a transformed document, and a logic, the logic being configured to determine a number of transformed documents present in a set of transformed documents, and one or more attributes of each transformed document in the set of transformed documents wherein the attributes of each transformed document include one or more of a type of the transformed document and a destination of the transformed document, a directive to proceed to a second rule based on a condition, a specification of a data component, the specification configured to include a data component identifier, a data component attribute, and a directive to proceed to a second specification of a second data component based on a second condition; executing a rule in the set of rules for processing the document in a non-sequential manner; executing a second rule in the set of rules for an error correction; and transforming the document into a set of second documents; generating a third document from the set of second documents, and delivering the second documents in the set of second documents to their respective destinations. | 15. A method for processing a document, the method comprising: storing data corresponding to at least one of the document, a plurality of documents processed at a previous time, and a set of rules wherein at least one rule in the set of rules is configured to include a rule identifier, the set of rules is further configured to include one or more of a rule for parsing, a rule for validating, a rule for identifying, a rule for relating, a rule for selecting, a rule for extracting to extract data components from the set of transformed documents and to create a report from the extracted data components, a rule for transforming, a rule for generating, a rule for analyzing including a plurality of steps of the analysis, a rule for error correcting, the rule for error correcting in the set of rules being configured (i) to identify an error in one of a data component and a relationship between two or more data components and (ii) to correct the error, wherein the rule for error correcting includes instructions for identifying an error in one of a data component and a relationship between two or more data components and instructions for correcting the error or return an error status to the source of the document if the error is not corrected, a rule for reporting, and a rule for sending, the rule for transforming being configured to include an identification associated with the document, an identification associated with a transformed document, and a logic, the logic being configured to determine a number of transformed documents present in a set of transformed documents, and one or more attributes of each transformed document in the set of transformed documents wherein the attributes of each transformed document include one or more of a type of the transformed document and a destination of the transformed document, a directive to proceed to a second rule based on a condition, a specification of a data component, the specification configured to include a data component identifier, a data component attribute, and a directive to proceed to a second specification of a second data component based on a second condition; executing a rule in the set of rules for processing the document in a non-sequential manner; executing a second rule in the set of rules for an error correction; and transforming the document into a set of second documents; generating a third document from the set of second documents, and delivering the second documents in the set of second documents to their respective destinations. 17. The method of claim 15 , further comprising: graphically configuring one or more rules in the set of rules; graphically creating a new rule; graphically including the new rule in the set of rules; and graphically modifying a rule other than the new rule in the set of rules to reference the new rule. | 0.759494 |
8,327,260 | 5 | 6 | 5. The computer-implemented method of claim 4 , wherein creating the graphical user interface comprises transforming the defined annotation structure. | 5. The computer-implemented method of claim 4 , wherein creating the graphical user interface comprises transforming the defined annotation structure. 6. The computer-implemented method of claim 5 , wherein transforming the defined annotation structure comprises filtering one or more or the annotation fields based on a role of the user. | 0.935294 |
10,114,817 | 1 | 7 | 1. A method comprising: storing a plurality of multi-language profiles of a plurality of users; identifying one or more multilingual cognates in each profile of the plurality of multi-language profiles; based on the one or more multilingual cognates identified in each profile of the plurality of multi-language profiles, generating one or more translation models; receiving input that indicates a selection, by a second user, of data that is associated with a first user that is different than the second user, wherein the plurality of users includes users other than the second user and the first user; determining a first language that is associated with the first user; determining a second language that is different than the first language and that is associated with the second user; wherein a plurality of data items in a profile of the first user are in the first language; translating the plurality of data items into the second language using the one or more translation models; in response to receiving the input, causing a translated version of the plurality of data items to be displayed to the second user, wherein the translated version is in the second language; wherein the method is performed by one or more computing devices. | 1. A method comprising: storing a plurality of multi-language profiles of a plurality of users; identifying one or more multilingual cognates in each profile of the plurality of multi-language profiles; based on the one or more multilingual cognates identified in each profile of the plurality of multi-language profiles, generating one or more translation models; receiving input that indicates a selection, by a second user, of data that is associated with a first user that is different than the second user, wherein the plurality of users includes users other than the second user and the first user; determining a first language that is associated with the first user; determining a second language that is different than the first language and that is associated with the second user; wherein a plurality of data items in a profile of the first user are in the first language; translating the plurality of data items into the second language using the one or more translation models; in response to receiving the input, causing a translated version of the plurality of data items to be displayed to the second user, wherein the translated version is in the second language; wherein the method is performed by one or more computing devices. 7. The method of claim 1 , wherein the data is a user interface element that, when selected, initiates a profile view of the profile of the first user. | 0.923814 |
8,688,434 | 2 | 3 | 2. The computer program product as recited in claim 1 , wherein the instructions are further configured, upon execution by a processor, to: determine at least one derived feature based on the received domain related data and information; and identify the at least one angle for the narrative story based on the processed domain related data and information and the determined at least one derived feature. | 2. The computer program product as recited in claim 1 , wherein the instructions are further configured, upon execution by a processor, to: determine at least one derived feature based on the received domain related data and information; and identify the at least one angle for the narrative story based on the processed domain related data and information and the determined at least one derived feature. 3. The computer program product as recited in claim 2 , wherein the at least one derived feature comprises at least one member of the group consisting of a threshold being crossed, a deviation from an expectation, an occurrence of an outlier, an extreme value being reached, and an occurrence of a delta value. | 0.901337 |
7,941,746 | 1 | 6 | 1. A method for creating a CSS (cascading style sheet) file from a CSSX (Extended Cascading Style Sheets) file including CSSX extensions for defining a variable, said CSS file intended for execution by a web browser that does not execute CSSX extensions wherein the web browser would not execute the variables of the CSSX file including the CSSX extensions, said method comprising: creating the CSSX file including CSSX extensions for defining a variable and CSSX extensions for referencing said variable, wherein said creating comprises: defining a left variable with a value of left and a right variable with a value of right; referencing at least the left variable or the right variable in the CSSX file; and specifying a language within the CSSX file; determining a value of the defined variable in the CSSX file; modifying the CSSX file by replacing all references to the defined variable with the determined value; and generating from the modified CSSX file the CSS file not including the variable and including the replaced variable value wherein the CSS file contains only CSS compatible commands and wherein the CSS file contains no CSSX extensions, wherein said generating comprises: determining if the specified language reads left-to-right or right-to-left; if the specified language reads right-to-left, redefining the right variable with a value of left and the left variable with a value of right; and generating from the specified CSSX file the CSS file not including the variable definition and including the replaced variable value wherein the CSS file contains only CSS compatible commands and wherein the CSS file contains no CSS extensions whereby the CSS file will automatically render a right-to-left layout in the web browser when the language reads right-to-left. | 1. A method for creating a CSS (cascading style sheet) file from a CSSX (Extended Cascading Style Sheets) file including CSSX extensions for defining a variable, said CSS file intended for execution by a web browser that does not execute CSSX extensions wherein the web browser would not execute the variables of the CSSX file including the CSSX extensions, said method comprising: creating the CSSX file including CSSX extensions for defining a variable and CSSX extensions for referencing said variable, wherein said creating comprises: defining a left variable with a value of left and a right variable with a value of right; referencing at least the left variable or the right variable in the CSSX file; and specifying a language within the CSSX file; determining a value of the defined variable in the CSSX file; modifying the CSSX file by replacing all references to the defined variable with the determined value; and generating from the modified CSSX file the CSS file not including the variable and including the replaced variable value wherein the CSS file contains only CSS compatible commands and wherein the CSS file contains no CSSX extensions, wherein said generating comprises: determining if the specified language reads left-to-right or right-to-left; if the specified language reads right-to-left, redefining the right variable with a value of left and the left variable with a value of right; and generating from the specified CSSX file the CSS file not including the variable definition and including the replaced variable value wherein the CSS file contains only CSS compatible commands and wherein the CSS file contains no CSS extensions whereby the CSS file will automatically render a right-to-left layout in the web browser when the language reads right-to-left. 6. The method of claim 1 , wherein the language is written and read right-to left such that the writings of the language begin at a right-hand side of a page and concludes at a left-hand side. | 0.567568 |
8,214,811 | 12 | 13 | 12. A computer program product comprising a computer useable medium having a computer readable program stored thereon, wherein the computer readable program, when executed on a computing device, causes the computing device to: provide mapping metadata for mapping an abstract class to a corresponding concrete class implementing the abstract class; automatically scan through classes in the application code to identify instantiation statements; encounter an instantiation statement for the abstract class during processing of application code, wherein the instantiation statement does not specify a concrete class implementing the abstract class; and convert the encountered instantiation statement to specify the concrete class implementing the abstract class based on the mapping metadata, wherein: the mapping metadata is provided as annotations within the application code, the annotations are provided at one of a class-level, a method-level, a declaration-level, or a package-level, an annotation provided at a class-level is applied to all statements in the class, an annotation provided at a method-level is applied to only an associated method, an annotation provided at a package-level is applied to all classes in the package, and annotations at a lower level of abstraction supersede annotations at a higher level of abstraction. | 12. A computer program product comprising a computer useable medium having a computer readable program stored thereon, wherein the computer readable program, when executed on a computing device, causes the computing device to: provide mapping metadata for mapping an abstract class to a corresponding concrete class implementing the abstract class; automatically scan through classes in the application code to identify instantiation statements; encounter an instantiation statement for the abstract class during processing of application code, wherein the instantiation statement does not specify a concrete class implementing the abstract class; and convert the encountered instantiation statement to specify the concrete class implementing the abstract class based on the mapping metadata, wherein: the mapping metadata is provided as annotations within the application code, the annotations are provided at one of a class-level, a method-level, a declaration-level, or a package-level, an annotation provided at a class-level is applied to all statements in the class, an annotation provided at a method-level is applied to only an associated method, an annotation provided at a package-level is applied to all classes in the package, and annotations at a lower level of abstraction supersede annotations at a higher level of abstraction. 13. The computer program product of claim 12 , wherein the abstract class is an interface class. | 0.899582 |
7,836,043 | 25 | 26 | 25. An internet browser application residing on a computer-readable medium that acts as a client to a remote web server and displays HTML files having formatting control tags in a graphical user interface in accordance with the formatting control tags of the HTML files, the internet browser application comprising: a database selection module that enables a plurality of HTML files to be downloaded and saved into at least one selectable database; a database index generation module that enables generation of a common searchable index of all files downloaded and saved into a selected database; the index including an index of word locations of words in the HTML files; and a search module that enables a search to be performed of an index generated by the database index generation module according to a search criterion to locate words and phrases in the files of the selected database; the internet browser application causing the graphical user interface to display at least portions of the HTML files that meet the search criterion in accordance with the formatting control tags of the HTML files; the internet browser application using starting positions retrieved from the word location index of words in the HTML files that meet the search criterion in order to highlight the words in the HTML files that meet the search criterion while displaying the HTML file in accordance with the formatting control tags of the HTML files. | 25. An internet browser application residing on a computer-readable medium that acts as a client to a remote web server and displays HTML files having formatting control tags in a graphical user interface in accordance with the formatting control tags of the HTML files, the internet browser application comprising: a database selection module that enables a plurality of HTML files to be downloaded and saved into at least one selectable database; a database index generation module that enables generation of a common searchable index of all files downloaded and saved into a selected database; the index including an index of word locations of words in the HTML files; and a search module that enables a search to be performed of an index generated by the database index generation module according to a search criterion to locate words and phrases in the files of the selected database; the internet browser application causing the graphical user interface to display at least portions of the HTML files that meet the search criterion in accordance with the formatting control tags of the HTML files; the internet browser application using starting positions retrieved from the word location index of words in the HTML files that meet the search criterion in order to highlight the words in the HTML files that meet the search criterion while displaying the HTML file in accordance with the formatting control tags of the HTML files. 26. The internet browser application of claim 25 , wherein the database index generation module enables generation of a common searchable index that is separate from the downloaded and saved files. | 0.502525 |
7,933,877 | 1 | 5 | 1. A computer-implemented method comprising: receiving a query from a client machine; retrieving a data set based on the query. the data set including a plurality of data units; a data unit of the plurality of data units being representative of an item, the data unit includes a value of an attribute of the item represented by the data unit; performing a first operation that organizes the data set into a first plurality of clusters; performing a second operation that partitions the first plurality of clusters into a second plurality of clusters and a third plurality of clusters, the second plurality of clusters being characterized by an attribute common to each cluster of the second plurality of clusters, a cluster of the second plurality of clusters including the data unit, the attribute common to each cluster of the second plurality of clusters being the attribute of the item, the third plurality of clusters being characterized by absence of the attribute from each cluster of the third plurality of clusters, the second operation being performed using a processor of a server machine communicatively coupled to the client machine and to a database; and storing the second plurality of clusters in the database. | 1. A computer-implemented method comprising: receiving a query from a client machine; retrieving a data set based on the query. the data set including a plurality of data units; a data unit of the plurality of data units being representative of an item, the data unit includes a value of an attribute of the item represented by the data unit; performing a first operation that organizes the data set into a first plurality of clusters; performing a second operation that partitions the first plurality of clusters into a second plurality of clusters and a third plurality of clusters, the second plurality of clusters being characterized by an attribute common to each cluster of the second plurality of clusters, a cluster of the second plurality of clusters including the data unit, the attribute common to each cluster of the second plurality of clusters being the attribute of the item, the third plurality of clusters being characterized by absence of the attribute from each cluster of the third plurality of clusters, the second operation being performed using a processor of a server machine communicatively coupled to the client machine and to a database; and storing the second plurality of clusters in the database. 5. The computer-implemented method of claim 1 , wherein: the first plurality of clusters includes a first cluster; and the second operation determines that an entirety of the first cluster is to be included in the second plurality of clusters. | 0.737013 |
8,005,270 | 1 | 4 | 1. A beauty quantification system comprising: a beauty quantification processor; a beauty measure datastore, wherein the beauty measure datastore comprises quantifiable measures of beauty of a body region; a beauty score datastore; a user computing device; a network; and a beauty enhancement processor, wherein the beauty quantification processor comprises instructions for: receiving user data indicative of physical attributes of a selected body region of the user; obtaining measures of beauty from the beauty measures datastore associated with the selected body region; evaluating the user data against the beauty measures of the selected body region; determining a user score indicative of the beauty of the selected body region of the user; storing the user score in the beauty score datastore; and comparing the user score to a score stored in the beauty score datastore; and wherein the beauty enhancement processor comprises instructions for: receiving from the user a selection for an enhancement of the selected body region; applying the selected enhancement to the selected body region; and determining an enhanced user score indicative of the beauty of the selected body region after application of the selected enhancement. | 1. A beauty quantification system comprising: a beauty quantification processor; a beauty measure datastore, wherein the beauty measure datastore comprises quantifiable measures of beauty of a body region; a beauty score datastore; a user computing device; a network; and a beauty enhancement processor, wherein the beauty quantification processor comprises instructions for: receiving user data indicative of physical attributes of a selected body region of the user; obtaining measures of beauty from the beauty measures datastore associated with the selected body region; evaluating the user data against the beauty measures of the selected body region; determining a user score indicative of the beauty of the selected body region of the user; storing the user score in the beauty score datastore; and comparing the user score to a score stored in the beauty score datastore; and wherein the beauty enhancement processor comprises instructions for: receiving from the user a selection for an enhancement of the selected body region; applying the selected enhancement to the selected body region; and determining an enhanced user score indicative of the beauty of the selected body region after application of the selected enhancement. 4. The system of claim 1 , wherein the score stored in the beauty score datastore is a score selected from the group consisting of a score of another user, a score of a public figure, and a score of an ideal person. | 0.828275 |
8,542,205 | 5 | 7 | 5. One or more computer-readable media as recited in claim 1 , wherein the refining of the search results comprises altering the search results displayed on the touch-sensitive display based at least in part on previous activities by other users that have navigated to at least a portion of the search results. | 5. One or more computer-readable media as recited in claim 1 , wherein the refining of the search results comprises altering the search results displayed on the touch-sensitive display based at least in part on previous activities by other users that have navigated to at least a portion of the search results. 7. One or more computer-readable media as recited in claim 5 , wherein the altering of the displayed search results comprises causing display more search results than previously displayed on the touch-sensitive display based at least in part on the previous activities of the other users. | 0.892054 |
7,801,906 | 8 | 9 | 8. The computer-readable storage medium of claim 7 wherein the encoding bitmap indicates those of the text encodings that have been previously used. | 8. The computer-readable storage medium of claim 7 wherein the encoding bitmap indicates those of the text encodings that have been previously used. 9. The computer-readable storage medium of claim 8 wherein the method further comprises: not identifying a match within the memory device to another converted filename of another retrieval request; retrieving a list of previously-used text encodings from the encoding bitmap; using a text encoding from the list to convert the filename of the other retrieval request to Unicode text encoding to form a new converted filename of the other retrieval request; and attempting to identify a match within the memory device to the new converted filename of the other retrieval request. | 0.802865 |
7,523,126 | 1 | 27 | 1. A method of displaying data, comprising the steps of: (1) defining a set of documents, each document having a unique identification, the set being defined by selecting at least one starting document, with the set further comprising documents being included based on predetermined relationships to information derived from said at least one starting document; (2) generating a hierarchal tree representation of at least one subset of the set of documents, a subset inclusion and hierarchy thereof being defined by said predetermined relationships between documents within the set; and (3) selectively focusing on a node of said hierarchal tree, to define a graphic display representation of at least a portion thereof to emphasize the selected focus while depicting the hierarchal relationships. | 1. A method of displaying data, comprising the steps of: (1) defining a set of documents, each document having a unique identification, the set being defined by selecting at least one starting document, with the set further comprising documents being included based on predetermined relationships to information derived from said at least one starting document; (2) generating a hierarchal tree representation of at least one subset of the set of documents, a subset inclusion and hierarchy thereof being defined by said predetermined relationships between documents within the set; and (3) selectively focusing on a node of said hierarchal tree, to define a graphic display representation of at least a portion thereof to emphasize the selected focus while depicting the hierarchal relationships. 27. The method according to claim 1 , wherein said hierarchal tree representation is derived based on a cluster analysis over the set of documents. | 0.721591 |
8,010,526 | 12 | 13 | 12. A method comprising: monitoring entity instances during a first interval, each entity instance being one of a plurality of types of entity instances; determining from the entity instances monitored during the first interval a first ranked list of entity instances in which the types of entity instances are ranked according to the number of times each type of entity instance occurred during the first interval, the first ranked list having a first cardinality of types of entity instances; monitoring entity instances during a second interval, each entity instance being one of the plurality of types of entity instances; determining from the entity instances monitored during the second interval a second ranked list of entity instances in which the types of entity instances are ranked according to the number of times each type of entity instance occurred during the second interval, the second ranked list having the first cardinality of types of entity instances; and merging the first ranked list and the second ranked list into a third ranked list of entities instances in which the types of entity instances are ranked according to the number of times each type of entity instance occurred during the first interval and the second interval; wherein monitoring entity instances during a first interval comprises: entering monitored entity instances in a first table; determining if an entity instance in the first table has a count that is greater than a threshold count; entering the entity instance in a second table if the entity instance in the first table has a count that is greater than the threshold count; determining if the second table has the first cardinality of entries; and ending the first interval if the second table has the first cardinality of entries. | 12. A method comprising: monitoring entity instances during a first interval, each entity instance being one of a plurality of types of entity instances; determining from the entity instances monitored during the first interval a first ranked list of entity instances in which the types of entity instances are ranked according to the number of times each type of entity instance occurred during the first interval, the first ranked list having a first cardinality of types of entity instances; monitoring entity instances during a second interval, each entity instance being one of the plurality of types of entity instances; determining from the entity instances monitored during the second interval a second ranked list of entity instances in which the types of entity instances are ranked according to the number of times each type of entity instance occurred during the second interval, the second ranked list having the first cardinality of types of entity instances; and merging the first ranked list and the second ranked list into a third ranked list of entities instances in which the types of entity instances are ranked according to the number of times each type of entity instance occurred during the first interval and the second interval; wherein monitoring entity instances during a first interval comprises: entering monitored entity instances in a first table; determining if an entity instance in the first table has a count that is greater than a threshold count; entering the entity instance in a second table if the entity instance in the first table has a count that is greater than the threshold count; determining if the second table has the first cardinality of entries; and ending the first interval if the second table has the first cardinality of entries. 13. The method of claim 12 , wherein the entity instance type is a webpage, file, domain, or network property. | 0.915385 |
8,620,667 | 1 | 9 | 1. A computer-implemented method of supporting speech-activated user commands, the method comprising: activating a speech-activated command and control application; launching speech support based at least in part upon the activation of the speech-activated command and control application; performing a plurality of queries against a search engine interface, comprising a web service, to obtain a collection of human language terms from a remote source through the web service, the human language terms pertaining to a system resource, the plurality of queries being directed locally and through the web service to a plurality of different sources, one of the plurality of different sources including a central database having application capability and characteristic information, a second one of the plurality of different sources including a descriptive information file that includes application description and explanation information, a third one of the plurality of different sources including directly obtaining information from a plurality of individual applications, wherein at least one term in the collection does not describe the identity of the system resource, wherein the plurality of queries include specifications of what should be included in the collection of human language terms, wherein the collection of human language terms includes query results received in response to the plurality of queries, and wherein content of the collection of human language terms is automatically determined, by a computer processor that is a functional component of a computer, to be consistent with said specifications; incorporating the collection of human language terms into a grammar, wherein the grammar includes action words including run, launch, load and start, wherein the grammar defines a collection of terms that have a logical connection to the system resource, wherein the grammar also defines other terms that have logical connections to other system resources, wherein the other terms that have the logical connections to the other system resources include names of the other system resources, the names being derived based on analysis of one or more user accessible file systems; receiving a spoken user command; identifying a particular word included in the spoken command; determining that the particular word included in the spoken command is included in the grammar as part of the collection of terms that have a logical connection to the system resource, and wherein the particular word included in the spoken command is one of the collection of human language terms received in response to the query; transmitting an indication of the particular word to the speech-activated command and control application; utilizing the speech-activated command and control application to execute one of a plurality of functions related to the system resource, wherein executing the one of the plurality of functions comprises executing the one function at least partially in response to the determination that the particular word included in the spoken command is included in the grammar as part of the collection of terms that have a logical connection to the system resource; receiving a notification that a new system resource has been added; and reconstructing the grammar to account for the new system resource. | 1. A computer-implemented method of supporting speech-activated user commands, the method comprising: activating a speech-activated command and control application; launching speech support based at least in part upon the activation of the speech-activated command and control application; performing a plurality of queries against a search engine interface, comprising a web service, to obtain a collection of human language terms from a remote source through the web service, the human language terms pertaining to a system resource, the plurality of queries being directed locally and through the web service to a plurality of different sources, one of the plurality of different sources including a central database having application capability and characteristic information, a second one of the plurality of different sources including a descriptive information file that includes application description and explanation information, a third one of the plurality of different sources including directly obtaining information from a plurality of individual applications, wherein at least one term in the collection does not describe the identity of the system resource, wherein the plurality of queries include specifications of what should be included in the collection of human language terms, wherein the collection of human language terms includes query results received in response to the plurality of queries, and wherein content of the collection of human language terms is automatically determined, by a computer processor that is a functional component of a computer, to be consistent with said specifications; incorporating the collection of human language terms into a grammar, wherein the grammar includes action words including run, launch, load and start, wherein the grammar defines a collection of terms that have a logical connection to the system resource, wherein the grammar also defines other terms that have logical connections to other system resources, wherein the other terms that have the logical connections to the other system resources include names of the other system resources, the names being derived based on analysis of one or more user accessible file systems; receiving a spoken user command; identifying a particular word included in the spoken command; determining that the particular word included in the spoken command is included in the grammar as part of the collection of terms that have a logical connection to the system resource, and wherein the particular word included in the spoken command is one of the collection of human language terms received in response to the query; transmitting an indication of the particular word to the speech-activated command and control application; utilizing the speech-activated command and control application to execute one of a plurality of functions related to the system resource, wherein executing the one of the plurality of functions comprises executing the one function at least partially in response to the determination that the particular word included in the spoken command is included in the grammar as part of the collection of terms that have a logical connection to the system resource; receiving a notification that a new system resource has been added; and reconstructing the grammar to account for the new system resource. 9. The method of claim 1 , wherein the system resource is a hardware device, and wherein obtaining the collection of terms further comprises obtaining a collection of terms that include attributes of the hardware device. | 0.812606 |
8,775,932 | 2 | 6 | 2. The system of claim 1 , wherein each of the templates includes an issue description related to a different problem, the issue description including an ordered arrangement of nodes including field nodes, each field node corresponding to a field, at least some of the fields being fillable by a user and at least some of the fields being fillable by the at least one problem detector, the issue description further including production and morphological rules, the production rules each modeling how the value of one of the nodes influences at least one other of the nodes, the morphological rules each describing a syntactic relationship between at least two of the nodes. | 2. The system of claim 1 , wherein each of the templates includes an issue description related to a different problem, the issue description including an ordered arrangement of nodes including field nodes, each field node corresponding to a field, at least some of the fields being fillable by a user and at least some of the fields being fillable by the at least one problem detector, the issue description further including production and morphological rules, the production rules each modeling how the value of one of the nodes influences at least one other of the nodes, the morphological rules each describing a syntactic relationship between at least two of the nodes. 6. The system of claim 2 , wherein at least some of the nodes comprise linguistic features including at least one feature selected from: a) gender; and b) singular or plural. | 0.960864 |
8,060,639 | 1 | 5 | 1. A system for enabling searches of content at a server, comprising: a server which is configured to receive queries from clients for content; a communication protocol which enables an asynchronous connection between the clients and the server, and allows each client to communicate, under control of a user and as part of a session, a plurality of consecutive query strings to query the server for content; and a query and result cache that stores one or more query strings previously communicated from the clients, or content results previously returned from the server; wherein each of the clients provides an input field, which allows the user to enter as an input a query comprised of a plurality of consecutive query strings, and wherein the client transmits to the server within the session a plurality of queries to retrieve content from the server matching or related to the plurality of consecutive query strings, wherein each of the plurality of queries form an increasingly lengthening query string for retrieving content from the server; and wherein the server receives the plurality of queries from the requesting client, and in response to receiving each of one or more additional characters in the increasingly lengthening query string as they are being entered at the input field, automatically matches the increasingly lengthening query string initially by matching the query string against the content of the query and result cache, and subsequently by matching the query string against other content available to the server, and asynchronously returns, while the increasingly lengthening query string is being entered by the user at the input field at the client, increasingly relevant content to the client. | 1. A system for enabling searches of content at a server, comprising: a server which is configured to receive queries from clients for content; a communication protocol which enables an asynchronous connection between the clients and the server, and allows each client to communicate, under control of a user and as part of a session, a plurality of consecutive query strings to query the server for content; and a query and result cache that stores one or more query strings previously communicated from the clients, or content results previously returned from the server; wherein each of the clients provides an input field, which allows the user to enter as an input a query comprised of a plurality of consecutive query strings, and wherein the client transmits to the server within the session a plurality of queries to retrieve content from the server matching or related to the plurality of consecutive query strings, wherein each of the plurality of queries form an increasingly lengthening query string for retrieving content from the server; and wherein the server receives the plurality of queries from the requesting client, and in response to receiving each of one or more additional characters in the increasingly lengthening query string as they are being entered at the input field, automatically matches the increasingly lengthening query string initially by matching the query string against the content of the query and result cache, and subsequently by matching the query string against other content available to the server, and asynchronously returns, while the increasingly lengthening query string is being entered by the user at the input field at the client, increasingly relevant content to the client. 5. The system of claim 1 , further compromising a connection to one or more content engines, each using a communication protocol native to said content engine, whereby said content engines are queried if the query and result cache contains no matches for the user query, and whereby the results from these content engines queries are merged and returned to the client. | 0.607676 |
8,894,489 | 16 | 19 | 16. A user interface method for use with a touch gesture user interface for implementing global or universal gestures and context-specific gestures for the control of user applications executing on a device comprising, the method comprising Recognizing at least one posture of a finger in contact with a tactile sensor, Recognizing a touch gesture from a plurality of possible touch gestures by recognizing specific changes within postures, the changes comprising at least one recognized change in the angle of finger contact with the tactile sensor, Assigning a user interface function to the recognized touch gesture, Directing executing software to perform a user interface operation associated with the recognized touch gesture, the user interface operation selected from a plurality of possible from a user interface operations, and the association from plurality of possible associations, the plurality of possible associations comprising at least a global type and a second type, the first type of association being common across the system and the second type of association being an application-specific association that is specific to an application, and Wherein the executing software is responsive to the recognized touch gesture. | 16. A user interface method for use with a touch gesture user interface for implementing global or universal gestures and context-specific gestures for the control of user applications executing on a device comprising, the method comprising Recognizing at least one posture of a finger in contact with a tactile sensor, Recognizing a touch gesture from a plurality of possible touch gestures by recognizing specific changes within postures, the changes comprising at least one recognized change in the angle of finger contact with the tactile sensor, Assigning a user interface function to the recognized touch gesture, Directing executing software to perform a user interface operation associated with the recognized touch gesture, the user interface operation selected from a plurality of possible from a user interface operations, and the association from plurality of possible associations, the plurality of possible associations comprising at least a global type and a second type, the first type of association being common across the system and the second type of association being an application-specific association that is specific to an application, and Wherein the executing software is responsive to the recognized touch gesture. 19. The method of claim 16 wherein the tactile sensor is comprised by a touchscreen. | 0.856655 |
8,429,740 | 1 | 8 | 1. A search result presentation system, the search result presentation system comprising: one or more processors; system memory; a database comprising tagged data, said tagged data tagged from one or more documents, for each of said one or more documents, said tagged data identifying items in said document for which said document may be searched and also identifying portions of said document that are eligible for alteration, based on classification of said identified portions, when presented to a user that does not have access to the entire document contents; an information retrieval system that: receives a search request from a user, said search request comprising search terms; and searches for said search terms in said database to identify a plurality of search results, said search results comprising references to the one or more documents; and a presentation engine for presenting the plurality of search results that: identifies a search result from within said plurality of search results, said search result for a document from among the one or more documents, said search result referencing a first tagged portion and a second tagged portion of said document; determines that said user has access privileges to at least a portion of said document based on an access policy; determines that said user does not have access to said first tagged portion of said document based on classification of the first tagged portion and based on the access policy; alters said search result so that said tagged first portion is not presented as part of said search result; and transmits said altered search result, including said second tagged portion of the document for presentation to said user. | 1. A search result presentation system, the search result presentation system comprising: one or more processors; system memory; a database comprising tagged data, said tagged data tagged from one or more documents, for each of said one or more documents, said tagged data identifying items in said document for which said document may be searched and also identifying portions of said document that are eligible for alteration, based on classification of said identified portions, when presented to a user that does not have access to the entire document contents; an information retrieval system that: receives a search request from a user, said search request comprising search terms; and searches for said search terms in said database to identify a plurality of search results, said search results comprising references to the one or more documents; and a presentation engine for presenting the plurality of search results that: identifies a search result from within said plurality of search results, said search result for a document from among the one or more documents, said search result referencing a first tagged portion and a second tagged portion of said document; determines that said user has access privileges to at least a portion of said document based on an access policy; determines that said user does not have access to said first tagged portion of said document based on classification of the first tagged portion and based on the access policy; alters said search result so that said tagged first portion is not presented as part of said search result; and transmits said altered search result, including said second tagged portion of the document for presentation to said user. 8. The system of claim 1 , wherein tagged data identifying portions of a document for alteration comprises tagged data identifying portions of a document for alteration based on classifying the identified portions as sensitive data. | 0.842391 |
8,521,512 | 1 | 16 | 1. A system for knowledge representation in a computer that can enable natural language communication with a computer, the system comprising: at least one hardware processor; a database configured to store at least one table, the at least one table configured to store associations between concepts in a text and associated concept identifiers; and a builder interfaced with the database, the builder configured to, when executed by the at least one hardware processor, construct a table that represents knowledge defined by a text, the construction of the table comprising assigning a unique identifier to a concept defined by the text, building a tree comprising a plurality of sub-concepts by breaking the concept into sub-concepts, and joining sub-concepts into higher order sub-concepts until two or more sub-concepts join to form the concept, and storing the concept and plurality of sub-concepts in the at least one table in the database. | 1. A system for knowledge representation in a computer that can enable natural language communication with a computer, the system comprising: at least one hardware processor; a database configured to store at least one table, the at least one table configured to store associations between concepts in a text and associated concept identifiers; and a builder interfaced with the database, the builder configured to, when executed by the at least one hardware processor, construct a table that represents knowledge defined by a text, the construction of the table comprising assigning a unique identifier to a concept defined by the text, building a tree comprising a plurality of sub-concepts by breaking the concept into sub-concepts, and joining sub-concepts into higher order sub-concepts until two or more sub-concepts join to form the concept, and storing the concept and plurality of sub-concepts in the at least one table in the database. 16. The system of claim 1 , wherein the text string describes an item or product, and wherein the table constructed by the builder to represent the item or product can be used to tag the item. | 0.880448 |
8,543,546 | 14 | 20 | 14. A computer program product for replicating IP address assignment changes in a distributed database having a plurality of nodes, the computer program product being embodied in a non-transitory computer readable medium and comprising computer instructions for: receiving a semantic command at a first node having a first local version of the database, wherein the semantic command comprises a semantically expressed request to modify one or more IP address assignments in the database that allows for provisional modification of the first local version of the database before sending the semantic command to a master node having a master version of the database; provisionally applying the semantic command to the first local version of the database before sending the semantic command to the master node; and reconciling the semantic command with the master version of the database, wherein reconciling the semantic command with the master version of the database includes determining whether the semantic command includes any IP address assignment changes that would result in an IP address assignment conflict with IP address assignment data stored in the master version of the database on the master node. | 14. A computer program product for replicating IP address assignment changes in a distributed database having a plurality of nodes, the computer program product being embodied in a non-transitory computer readable medium and comprising computer instructions for: receiving a semantic command at a first node having a first local version of the database, wherein the semantic command comprises a semantically expressed request to modify one or more IP address assignments in the database that allows for provisional modification of the first local version of the database before sending the semantic command to a master node having a master version of the database; provisionally applying the semantic command to the first local version of the database before sending the semantic command to the master node; and reconciling the semantic command with the master version of the database, wherein reconciling the semantic command with the master version of the database includes determining whether the semantic command includes any IP address assignment changes that would result in an IP address assignment conflict with IP address assignment data stored in the master version of the database on the master node. 20. A computer program product as recited in claim 14 , wherein the semantic command is determined not to have a conflict with the master version of the database, and further comprising instructions for: sending the semantic command to a second node having a second local version of the database to replicate any IP address assignment changes associated with the semantic command on the second node. | 0.521583 |
8,825,584 | 1 | 11 | 1. A system for evaluating communicative acts to determine a social regard score between two communicating entities participating in the communicative act, the two communicating entities collectively defining a communication pair, the system comprising: a patterns database storing behavior recognition patterns defining particular redressive behaviors that may be used in the communicative acts and a redress score associated with each one of the particular redressive behaviors; and an etiquette processor in communication with the patterns database and configured to determine a pairwise regard score for the communicative pair based on ones of the particular redressive behaviors identified in the communicative acts between the two communicating entities of the communicative pair; wherein: the communicative pair is one of a plurality of communicative pairs each including a different two communicating entities, the etiquette processor is configured to determine a different pairwise regard score for each one of the plurality of communicative pairs based on ones of the particular redressive behaviors identified in the communicative acts between a corresponding one of the different two communicating entities of the communicative pair, and the system further comprises: a communications network aggregation processor configured to combine the pairwise regard scores for each one of the plurality of communicative pairs, received from the etiquette processor, into a social regard network representation including a plurality of entities in the social regard network and indicating a respective social regard level of each of the plurality of entities relative to other ones of the plurality of entities, the plurality of entities including the two communicating entities of each one of the plurality of communicative pairs. | 1. A system for evaluating communicative acts to determine a social regard score between two communicating entities participating in the communicative act, the two communicating entities collectively defining a communication pair, the system comprising: a patterns database storing behavior recognition patterns defining particular redressive behaviors that may be used in the communicative acts and a redress score associated with each one of the particular redressive behaviors; and an etiquette processor in communication with the patterns database and configured to determine a pairwise regard score for the communicative pair based on ones of the particular redressive behaviors identified in the communicative acts between the two communicating entities of the communicative pair; wherein: the communicative pair is one of a plurality of communicative pairs each including a different two communicating entities, the etiquette processor is configured to determine a different pairwise regard score for each one of the plurality of communicative pairs based on ones of the particular redressive behaviors identified in the communicative acts between a corresponding one of the different two communicating entities of the communicative pair, and the system further comprises: a communications network aggregation processor configured to combine the pairwise regard scores for each one of the plurality of communicative pairs, received from the etiquette processor, into a social regard network representation including a plurality of entities in the social regard network and indicating a respective social regard level of each of the plurality of entities relative to other ones of the plurality of entities, the plurality of entities including the two communicating entities of each one of the plurality of communicative pairs. 11. The system of claim 1 , wherein the etiquette processor automatically determines the pairwise regard score for each based on analysis of the communicative acts upon receipt of data representing corresponding ones of the communicative acts. | 0.872508 |
9,576,582 | 1 | 5 | 1. A method comprising: obtaining, by a system comprising a processor, information associated with an acoustic model, wherein the acoustic model is trained on native speech in a target dialect; and updating, by the system, the information associated with the acoustic model to replace a first phoneme in the acoustic model with a second phoneme, wherein the second phoneme comprises a sum of values associated with plausible phonemes in a lattice of plausible phonemes associated with a type of speaker. | 1. A method comprising: obtaining, by a system comprising a processor, information associated with an acoustic model, wherein the acoustic model is trained on native speech in a target dialect; and updating, by the system, the information associated with the acoustic model to replace a first phoneme in the acoustic model with a second phoneme, wherein the second phoneme comprises a sum of values associated with plausible phonemes in a lattice of plausible phonemes associated with a type of speaker. 5. The method of claim 1 , wherein the updating the information associated with the acoustic model is based on evaluating an objective function. | 0.719844 |
7,660,793 | 32 | 59 | 32. A system for processing data, the system comprising: a reconfigurable logic device having firmware deployed thereon; a data store of unstructured data in communication with the reconfigurable logic device; a data store of structured data in communication with the reconfigurable logic device, the structured data comprising metadata about at least a portion of the unstructured data; a processor configured to execute an interface, the interface configured to (1) receive a query, the query comprising at least one term for processing against unstructured data, (2) process at least a portion of the query against the structured data in the data store of structured data to identify a subset of unstructured data in the data store of unstructured data, and (3) request that the subset of unstructured data be delivered to the firmware on the reconfigurable logic device; and wherein the firmware is configured to perform a query-specified data processing operation on the subset of unstructured data using the at least one query term. | 32. A system for processing data, the system comprising: a reconfigurable logic device having firmware deployed thereon; a data store of unstructured data in communication with the reconfigurable logic device; a data store of structured data in communication with the reconfigurable logic device, the structured data comprising metadata about at least a portion of the unstructured data; a processor configured to execute an interface, the interface configured to (1) receive a query, the query comprising at least one term for processing against unstructured data, (2) process at least a portion of the query against the structured data in the data store of structured data to identify a subset of unstructured data in the data store of unstructured data, and (3) request that the subset of unstructured data be delivered to the firmware on the reconfigurable logic device; and wherein the firmware is configured to perform a query-specified data processing operation on the subset of unstructured data using the at least one query term. 59. The system of claim 32 wherein the firmware is further configured to perform the query-specified data processing operation via at least one member of the group consisting of an exact matching operation, an approximate matching operation, and a regular expression pattern matching operation based on the at least one query term. | 0.801082 |
9,846,696 | 10 | 11 | 10. A non-transitory computer-readable storage medium storing program instructions executable by a computer to implement a multimedia content indexer configured to: segment multimedia content into a plurality of segments; identify, for each segment, one or more features present in the segment, wherein the features are of respective media types; identify, for each identified feature in each segment, one or more respective keywords associated the identified feature; and determine, for each identified keyword associated with an identified feature in a given segment, a respective relevance of the keyword to the given segment, wherein the respective relevance is dependent on a weight associated with the respective media type of the identified feature. | 10. A non-transitory computer-readable storage medium storing program instructions executable by a computer to implement a multimedia content indexer configured to: segment multimedia content into a plurality of segments; identify, for each segment, one or more features present in the segment, wherein the features are of respective media types; identify, for each identified feature in each segment, one or more respective keywords associated the identified feature; and determine, for each identified keyword associated with an identified feature in a given segment, a respective relevance of the keyword to the given segment, wherein the respective relevance is dependent on a weight associated with the respective media type of the identified feature. 11. The medium of claim 10 , wherein the program instructions are further executable to: create an index for the multimedia content, wherein the index correlates each identified keyword with those of the plurality of segments that are determined as being relevant to the keyword based on the determined respective relevances. | 0.819444 |
7,853,869 | 1 | 6 | 1. A computer-implemented method of constructing an object model reflective of structure of a document, from an unstructured document, comprising: scanning an unstructured markup language representation of the document for one or more markup language glyphs to generate a plurality of text runs, where the text runs comprise one or more semantically structured, selectable representations of the markup language glyphs; creating one or more semantic block containers comprising text runs that correspond to a same semantic block by determining which text runs correspond to the same semantic block; determining a logical structured order of the text runs within the respective one or more semantic blocks; determining an order of the respective one or more semantic blocks in the document; and saving the semantic blocks comprising the order of the text runs and the order of the one or more semantic blocks in the document as the object model to generate a logically structured document comprising semantically structured, selectable representations of the markup language. | 1. A computer-implemented method of constructing an object model reflective of structure of a document, from an unstructured document, comprising: scanning an unstructured markup language representation of the document for one or more markup language glyphs to generate a plurality of text runs, where the text runs comprise one or more semantically structured, selectable representations of the markup language glyphs; creating one or more semantic block containers comprising text runs that correspond to a same semantic block by determining which text runs correspond to the same semantic block; determining a logical structured order of the text runs within the respective one or more semantic blocks; determining an order of the respective one or more semantic blocks in the document; and saving the semantic blocks comprising the order of the text runs and the order of the one or more semantic blocks in the document as the object model to generate a logically structured document comprising semantically structured, selectable representations of the markup language. 6. The method of claim 1 , determining which text runs correspond to the same semantic block comprising determining if there is a transformation matrix for a current text run determined from the markup language representation. | 0.944526 |
7,680,789 | 6 | 7 | 6. A computer-readable storage medium having stored thereon an index entry data structure, comprising: a first portion indicative of said index entry being indicative of a range of values, wherein the minimum value and maximum value of said range of values are different; a second portion indicative of said range of values, said second portion comprising: a first part indicative of a predetermined value and a second part indicative of a range of values; a populated index with a set of index entries comprising a minimum number of index entries that includes an entire range of numerical values, in which each index entry provides an indication of a respective portion of said range of values associated with the index entry, wherein a value representable by the range corresponds to only one entry in the index; a data structure of a formatted query value comprises a number of digit positions, wherein each digit position comprises a digit value; a data structure of a first search term of said plurality of search terms comprises a don't care indicator in each digit position of said first search term, wherein said don't care indicator indicates that any value can be placed at said digit position; and a data structure for each subsequent search term of said plurality of search terms comprises: a replica of a previously constructed search term with a don't care indicator replaced with a digit value in a corresponding digit position of said formatted query value. | 6. A computer-readable storage medium having stored thereon an index entry data structure, comprising: a first portion indicative of said index entry being indicative of a range of values, wherein the minimum value and maximum value of said range of values are different; a second portion indicative of said range of values, said second portion comprising: a first part indicative of a predetermined value and a second part indicative of a range of values; a populated index with a set of index entries comprising a minimum number of index entries that includes an entire range of numerical values, in which each index entry provides an indication of a respective portion of said range of values associated with the index entry, wherein a value representable by the range corresponds to only one entry in the index; a data structure of a formatted query value comprises a number of digit positions, wherein each digit position comprises a digit value; a data structure of a first search term of said plurality of search terms comprises a don't care indicator in each digit position of said first search term, wherein said don't care indicator indicates that any value can be placed at said digit position; and a data structure for each subsequent search term of said plurality of search terms comprises: a replica of a previously constructed search term with a don't care indicator replaced with a digit value in a corresponding digit position of said formatted query value. 7. A computer-readable storage medium in accordance with claim 6 , wherein: a minimum value of said second portion is indicative of a minimum value of said range of values; and a maximum value of said second portion is indicative of a maximum value of said range of values. | 0.839223 |
9,110,990 | 6 | 11 | 6. The method of claim 1 , wherein calculating the result weights further comprises: calculating the result weights further based on a log file of frequently selected programs. | 6. The method of claim 1 , wherein calculating the result weights further comprises: calculating the result weights further based on a log file of frequently selected programs. 11. The method of claim 6 , further comprising: determining the most frequently selected programs from the log file; creating a boosting file including the most frequently selected programs; querying the boosting file with at least a portion of the search results; and weighting the search results if it is present in the boosting file. | 0.895327 |
8,285,721 | 1 | 7 | 1. A computer-implemented method comprising: accessing a seller-generated item description received from a seller of an item, the item description being descriptive of the item; inferring an attribute and an attribute value based on the item description, the inferring being performed by a hardware-implemented analysis module of a machine; including the attribute and the attribute value in an item record for the item, the item record being stored in an item database; presenting a product record stored in a product database to the seller as a proposed record to be mapped to the item record; receiving an acceptance of the proposed record from the seller; incrementing an acceptance count corresponding to the product record; and mapping the item record to the product record by including a reference to the product record in the item record, the mapping being performed by a hardware-implemented mapping module of the machine using the attribute value. | 1. A computer-implemented method comprising: accessing a seller-generated item description received from a seller of an item, the item description being descriptive of the item; inferring an attribute and an attribute value based on the item description, the inferring being performed by a hardware-implemented analysis module of a machine; including the attribute and the attribute value in an item record for the item, the item record being stored in an item database; presenting a product record stored in a product database to the seller as a proposed record to be mapped to the item record; receiving an acceptance of the proposed record from the seller; incrementing an acceptance count corresponding to the product record; and mapping the item record to the product record by including a reference to the product record in the item record, the mapping being performed by a hardware-implemented mapping module of the machine using the attribute value. 7. The computer-implemented method of claim 1 , further comprising: determining that the seller is to be presented with the product record. | 0.867619 |
8,484,192 | 1 | 2 | 1. A computer-implemented method, comprising: receiving at a central information provider a search request input by a user; identifying one or more media-related terms in the search request that indicate that the search request is media-related and determining that the search request matches a first media-related category; identifying a second media-related category that is different from the first media-related category and is based on the first media-related category, and determining, based on the second media-related category, one or more additional media-related terms; in response to identifying the one or more media-related terms and the first and second media-related categories, and without receiving further input from the user about the search request, generating a query that is based on the search request and the one or more media-related terms in the search request and that additionally includes the one or more additional media-related terms that are not received from or selected by the user and that are related to the first and second media-related categories, and submitting the query to a search engine having access to media-related search results, wherein the query is broader than the received search request input by the user; in response to determining that one or more search results, responsive to the submitted query, is media-related, generating code for formatting a display for the one or more media-related search results, the display comprising a list area that is adjacent to an electronic program guide grid, wherein: (i) the list area displays (a) one or more icons that indicate that one or more search results is related to a television media program, (b) a media program identifier that identifies a name of a media program associated with one or more search results responsive to the submitted query, and (c) upcoming viewing times for one or more media programs associated with one or more search results responsive to the submitted query; and (ii) the electronic program guide grid displays at least one of the media-related search results; and transmitting the media-related search results, generated in response to the query by the search engine, to a remote device for presentation to the user in the generated format, wherein generating the query includes appending to the search request the one or more additional media-related terms. | 1. A computer-implemented method, comprising: receiving at a central information provider a search request input by a user; identifying one or more media-related terms in the search request that indicate that the search request is media-related and determining that the search request matches a first media-related category; identifying a second media-related category that is different from the first media-related category and is based on the first media-related category, and determining, based on the second media-related category, one or more additional media-related terms; in response to identifying the one or more media-related terms and the first and second media-related categories, and without receiving further input from the user about the search request, generating a query that is based on the search request and the one or more media-related terms in the search request and that additionally includes the one or more additional media-related terms that are not received from or selected by the user and that are related to the first and second media-related categories, and submitting the query to a search engine having access to media-related search results, wherein the query is broader than the received search request input by the user; in response to determining that one or more search results, responsive to the submitted query, is media-related, generating code for formatting a display for the one or more media-related search results, the display comprising a list area that is adjacent to an electronic program guide grid, wherein: (i) the list area displays (a) one or more icons that indicate that one or more search results is related to a television media program, (b) a media program identifier that identifies a name of a media program associated with one or more search results responsive to the submitted query, and (c) upcoming viewing times for one or more media programs associated with one or more search results responsive to the submitted query; and (ii) the electronic program guide grid displays at least one of the media-related search results; and transmitting the media-related search results, generated in response to the query by the search engine, to a remote device for presentation to the user in the generated format, wherein generating the query includes appending to the search request the one or more additional media-related terms. 2. The method of claim 1 , wherein identifying the one or more media-related terms in the search request comprises comparing words or word groups in the search request to a media-related whitelist. | 0.502525 |
9,495,695 | 1 | 3 | 1. A method for reconciling detailed user transaction feedback with a numerical seller rating that rates a seller of a product, comprising: detecting, by one or more computer processors, that the numerical seller rating indicates a negative experience; mining a sentiment of words in the feedback and detecting that the words in the feedback indicate positive sentiment; responsive to detecting that the words in the feedback indicate positive sentiment, mining the sentiment of words in the feedback and detecting that the words in the feedback do not indicate any negative sentiment; and responsive to detecting that the words in the feedback do not indicate any negative sentiment, transforming a state of the numerical seller rating from a state that is inconsistent with the words in the feedback to a state that is reconciled with the words in the feedback. | 1. A method for reconciling detailed user transaction feedback with a numerical seller rating that rates a seller of a product, comprising: detecting, by one or more computer processors, that the numerical seller rating indicates a negative experience; mining a sentiment of words in the feedback and detecting that the words in the feedback indicate positive sentiment; responsive to detecting that the words in the feedback indicate positive sentiment, mining the sentiment of words in the feedback and detecting that the words in the feedback do not indicate any negative sentiment; and responsive to detecting that the words in the feedback do not indicate any negative sentiment, transforming a state of the numerical seller rating from a state that is inconsistent with the words in the feedback to a state that is reconciled with the words in the feedback. 3. The method of claim 1 wherein mining the sentiment of words in the feedback and detecting that the words in the feedback do not indicate any negative sentiment is done by using a negative sentiment mining tool. | 0.787425 |
7,675,436 | 1 | 2 | 1. An encoder, comprising: a mapping module that receives input words comprising first input words and second input words, that maps the first input words to first output words that are run-length limited and that have a digital sum that is equal to zero and that maps the second input words to second output words that are run-length limited and have one of a positive and a negative digital sum; and an inverter module that selectively inverts the second output words based on a cumulative digital sum of the second output words. | 1. An encoder, comprising: a mapping module that receives input words comprising first input words and second input words, that maps the first input words to first output words that are run-length limited and that have a digital sum that is equal to zero and that maps the second input words to second output words that are run-length limited and have one of a positive and a negative digital sum; and an inverter module that selectively inverts the second output words based on a cumulative digital sum of the second output words. 2. The encoder of claim 1 wherein the mapping module maps the second input words to the second output words based on a Hamming weight thereof. | 0.681614 |
8,245,210 | 1 | 2 | 1. A method of transforming selected compile-time context data into a semantics payload for operation binding at run-time, the method comprising the steps of: placing in a semantics payload at compile-time at least one of the following payload portions: a compound-operation-event-add payload portion for a program construct of the form d.P+=h, where d.P is a dynamically typed expression, said payload portion containing an invocation to a run-time-evaluated method to check whether d.P evaluates to an event, an invocation to a mechanism to add an event in case d.P evaluates to an event, and information to perform a compound add assignment operation in case d.P does not evaluate to an event; a compound-operation-event-remove payload portion for a program construct of the form d.P −=h, where d.P is a dynamically typed expression, said payload portion containing an invocation to a run-time-evaluated method to check whether d.P evaluates to an event, an invocation to a mechanism to remove an event in case d.P evaluates to an event, and information to perform a compound remove assignment operation in case d.P does not evaluate to an event; a compound-operation-delegate-combine payload portion for a program construct of the form d.P+=h, where d.P is a dynamically typed expression, said payload portion containing an invocation to a run-time-evaluated method to check whether d.P evaluates to a delegate, an invocation to a mechanism to combine a delegate in case d.P evaluates to a delegate, and information to perform a compound add assignment operation in case d.P does not evaluate to a delegate; a compound-operation-delegate-remove payload portion for a program construct of the form d.P −=h, where d.P is a dynamically typed expression, said payload portion containing an invocation to a run-time-evaluated method to check whether d.P evaluates to a delegate, an invocation to a mechanism to remove a delegate in case d.P evaluates to a delegate, and information to perform a compound remove assignment operation in case d.P does not evaluate to a delegate; a member-accessibility payload portion indicating where an access originated, thereby allowing a runtime to determine whether an invocation location has access to a specified member; a dynamic-typed-object payload portion containing an indication that an object is statically defined to have a dynamic type to be determined at run-time; a struct-by-ref payload portion for a program construct of the form s.M(d) where s is a struct type, d is a dynamically typed variable, and M is a method on s, said payload portion containing an express indication that struct s is to be passed by reference address; an argument-by-name payload portion containing a source code name of a method argument which is specified by name rather than by position in a method invocation in source code; an extension-method-scope payload portion containing at least one of: an express indication that an extension method to be dynamically bound is in scope at compile time, a set of extension methods in scope of a dynamically bound method call which includes all extension methods that the call could possibly bind to; and providing the semantics payload to a run-time binder which performs overload resolution by either binding overloaded program items to particular respective implementations after compile-time or by raising a run-time exception or other error condition if no type-compatible resolution is possible with the information available to the binder. | 1. A method of transforming selected compile-time context data into a semantics payload for operation binding at run-time, the method comprising the steps of: placing in a semantics payload at compile-time at least one of the following payload portions: a compound-operation-event-add payload portion for a program construct of the form d.P+=h, where d.P is a dynamically typed expression, said payload portion containing an invocation to a run-time-evaluated method to check whether d.P evaluates to an event, an invocation to a mechanism to add an event in case d.P evaluates to an event, and information to perform a compound add assignment operation in case d.P does not evaluate to an event; a compound-operation-event-remove payload portion for a program construct of the form d.P −=h, where d.P is a dynamically typed expression, said payload portion containing an invocation to a run-time-evaluated method to check whether d.P evaluates to an event, an invocation to a mechanism to remove an event in case d.P evaluates to an event, and information to perform a compound remove assignment operation in case d.P does not evaluate to an event; a compound-operation-delegate-combine payload portion for a program construct of the form d.P+=h, where d.P is a dynamically typed expression, said payload portion containing an invocation to a run-time-evaluated method to check whether d.P evaluates to a delegate, an invocation to a mechanism to combine a delegate in case d.P evaluates to a delegate, and information to perform a compound add assignment operation in case d.P does not evaluate to a delegate; a compound-operation-delegate-remove payload portion for a program construct of the form d.P −=h, where d.P is a dynamically typed expression, said payload portion containing an invocation to a run-time-evaluated method to check whether d.P evaluates to a delegate, an invocation to a mechanism to remove a delegate in case d.P evaluates to a delegate, and information to perform a compound remove assignment operation in case d.P does not evaluate to a delegate; a member-accessibility payload portion indicating where an access originated, thereby allowing a runtime to determine whether an invocation location has access to a specified member; a dynamic-typed-object payload portion containing an indication that an object is statically defined to have a dynamic type to be determined at run-time; a struct-by-ref payload portion for a program construct of the form s.M(d) where s is a struct type, d is a dynamically typed variable, and M is a method on s, said payload portion containing an express indication that struct s is to be passed by reference address; an argument-by-name payload portion containing a source code name of a method argument which is specified by name rather than by position in a method invocation in source code; an extension-method-scope payload portion containing at least one of: an express indication that an extension method to be dynamically bound is in scope at compile time, a set of extension methods in scope of a dynamically bound method call which includes all extension methods that the call could possibly bind to; and providing the semantics payload to a run-time binder which performs overload resolution by either binding overloaded program items to particular respective implementations after compile-time or by raising a run-time exception or other error condition if no type-compatible resolution is possible with the information available to the binder. 2. The method of claim 1 , further comprising providing to a run-time binder an argument-is-literal payload portion containing an express indication whether a method argument is a literal constant. | 0.917711 |
8,438,310 | 30 | 39 | 30. A method of providing web services for a business hierarchy, comprising: providing a website capable of simultaneously operating in one of a plurality of operational modes, wherein each of the plurality of operational modes corresponds to a respective geographic granularity of the business hierarchy, the operational modes including a local advertising association mode comprising content of a local advertising association, an advertising association mode comprising content of a plurality of local advertising associations, and a national mode comprising content of a plurality of advertising associations; detecting an incoming request for web content from a user using a configuration module operating on a processor; selecting an operational mode responsive to the request based upon a geographic granularity associated with the user; and configuring the website to present content to the user according to the selected operational mode. | 30. A method of providing web services for a business hierarchy, comprising: providing a website capable of simultaneously operating in one of a plurality of operational modes, wherein each of the plurality of operational modes corresponds to a respective geographic granularity of the business hierarchy, the operational modes including a local advertising association mode comprising content of a local advertising association, an advertising association mode comprising content of a plurality of local advertising associations, and a national mode comprising content of a plurality of advertising associations; detecting an incoming request for web content from a user using a configuration module operating on a processor; selecting an operational mode responsive to the request based upon a geographic granularity associated with the user; and configuring the website to present content to the user according to the selected operational mode. 39. The method of claim 30 , further comprising changing an operational mode of the website responsive to activity of a user on the website, wherein the user activity comprises one of a user selection of a region on a map displayed on the website and a user input of a location identifier to the website. | 0.547619 |
8,838,613 | 11 | 17 | 11. A non-transitory computer-readable medium having instructions encoded thereon, which, when executed by a processor, cause the processor to perform operations comprising: identifying, with one or more processors, a set T of query terms; selecting, with the one or more processors, candidate documents D that each satisfy one or more of the terms of the set T; selecting, from the candidate documents D, a set S of quantity k of the candidate documents D based on a weighted-coverage function ƒ for the set T of terms; pairing each document in the set S with another document in the set S based on a distance between the paired documents; generating, with the one or more processors, a set C of clusters from the paired documents, each cluster in the set C being associated with one or more topics of the query terms; selecting, with the one or more processors, from the set S, a set V of quantity p documents, for one or more clusters of the set C, based on a diversity function, wherein the diversity function is expressed as (Σ 1≦i≦k, 1≦j≦p Σ 1≦i′≦k′, 1≦j′≦p GJD(D i j , D i′ j′ )); and providing for presentation the set V of documents as representative documents that cover one or more topics associated with the one or more clusters. | 11. A non-transitory computer-readable medium having instructions encoded thereon, which, when executed by a processor, cause the processor to perform operations comprising: identifying, with one or more processors, a set T of query terms; selecting, with the one or more processors, candidate documents D that each satisfy one or more of the terms of the set T; selecting, from the candidate documents D, a set S of quantity k of the candidate documents D based on a weighted-coverage function ƒ for the set T of terms; pairing each document in the set S with another document in the set S based on a distance between the paired documents; generating, with the one or more processors, a set C of clusters from the paired documents, each cluster in the set C being associated with one or more topics of the query terms; selecting, with the one or more processors, from the set S, a set V of quantity p documents, for one or more clusters of the set C, based on a diversity function, wherein the diversity function is expressed as (Σ 1≦i≦k, 1≦j≦p Σ 1≦i′≦k′, 1≦j′≦p GJD(D i j , D i′ j′ )); and providing for presentation the set V of documents as representative documents that cover one or more topics associated with the one or more clusters. 17. The non-transitory computer-readable medium of claim 11 , wherein selecting, from the candidate documents D, a set S of quantity k of the candidate documents D that maximizes a weighted-coverage function ƒ for the set T of query terms comprises: initializing an empty set of documents as the set S; and iteratively, until the set S includes the quantity k of the candidate documents D: selecting a document d, from the candidate documents D, that exhibits a maximum marginal increase in the weighted-coverage function ƒ, and that is not already in the set S, and adding the document d to the set S. | 0.662556 |
7,574,659 | 1 | 14 | 1. A search engine apparatus, comprising: a first database containing records relating to a content of a plurality of information resources; a second database of records relating to commercial messages; a memory storing: a persistent identifier, instructions for execution by a search query input processor, and instructions for execution by an output processor; the search query input processor, configured to execute the instructions for execution by the search query input processor causing the search query input processor to receive a search query and automatically define in dependence thereon a query of said first database to retrieve hyperlinked identifiers of records of said first database corresponding to said search query, and a selection of records from said second database to define hyperlinked identifiers of records of said second database relating to commercial messages associated with at least one of said search query and said persistent identifier; the output processor, configured to execute the instructions for execution by the output processor causing the output processor to: automatically organize said hyperlinked identifiers of records from said first database together with said hyperlinked identifiers of records from said second database in a common output, in further dependence on said persistent identifier, define a hierarchy from the hyperlinked identifiers of records of said first database corresponding to said search query according to content of or linkage among the hyperlinked identifiers of records of said first database, insert the hyperlinked identifiers of records of said second database relating to commercial messages associated with at least one of said search query and said persistent identifier into the hierarchy according to content of or linkage between the hyperlinked identifiers of records of said second database and the hyperlinked identifiers of records of said first database; and an accounting database, for recording accounting information for at least one of a presentation and a selection of an identifier of a record from said second database with respect to an account maintained by an entity relating to a corresponding commercial message. | 1. A search engine apparatus, comprising: a first database containing records relating to a content of a plurality of information resources; a second database of records relating to commercial messages; a memory storing: a persistent identifier, instructions for execution by a search query input processor, and instructions for execution by an output processor; the search query input processor, configured to execute the instructions for execution by the search query input processor causing the search query input processor to receive a search query and automatically define in dependence thereon a query of said first database to retrieve hyperlinked identifiers of records of said first database corresponding to said search query, and a selection of records from said second database to define hyperlinked identifiers of records of said second database relating to commercial messages associated with at least one of said search query and said persistent identifier; the output processor, configured to execute the instructions for execution by the output processor causing the output processor to: automatically organize said hyperlinked identifiers of records from said first database together with said hyperlinked identifiers of records from said second database in a common output, in further dependence on said persistent identifier, define a hierarchy from the hyperlinked identifiers of records of said first database corresponding to said search query according to content of or linkage among the hyperlinked identifiers of records of said first database, insert the hyperlinked identifiers of records of said second database relating to commercial messages associated with at least one of said search query and said persistent identifier into the hierarchy according to content of or linkage between the hyperlinked identifiers of records of said second database and the hyperlinked identifiers of records of said first database; and an accounting database, for recording accounting information for at least one of a presentation and a selection of an identifier of a record from said second database with respect to an account maintained by an entity relating to a corresponding commercial message. 14. The search engine apparatus according to claim 1 , wherein said common output produces an output graphically representing a history of access to records by a user. | 0.886085 |
9,854,390 | 11 | 16 | 11. A computer-implemented method comprising: receiving, at a computing device, context data of a scheduled event and an association data comprising identifiers that each uniquely identify a corresponding accepted computing device with which to engage in interactions; receiving, at the computing device, an identifier from another computing device; comparing the identifier to the association data to determine whether the other computing device is an accepted computing device; retrieving an aspect of a current context of the computing device, the aspect of the current context of the computing device comprising one or more of a current time or a current location of the computing device; in response to a determination that the other computing device is an accepted computing device, comparing the aspect to the context data to determine whether an appropriate context exists to share resources and exchange provision of network services with the other computing device through a network; and in response to a determination that the appropriate context exists, engaging in the interactions with the other computing device through the network, the interactions comprising receiving, at the computing device, an indication of an available network service and a requested network service from the other computing device, provisioning of the requested network service to the other computing device from the computing device based on the indication, and provisioning of the available network service to the computing device from the other computing device based on the indication. | 11. A computer-implemented method comprising: receiving, at a computing device, context data of a scheduled event and an association data comprising identifiers that each uniquely identify a corresponding accepted computing device with which to engage in interactions; receiving, at the computing device, an identifier from another computing device; comparing the identifier to the association data to determine whether the other computing device is an accepted computing device; retrieving an aspect of a current context of the computing device, the aspect of the current context of the computing device comprising one or more of a current time or a current location of the computing device; in response to a determination that the other computing device is an accepted computing device, comparing the aspect to the context data to determine whether an appropriate context exists to share resources and exchange provision of network services with the other computing device through a network; and in response to a determination that the appropriate context exists, engaging in the interactions with the other computing device through the network, the interactions comprising receiving, at the computing device, an indication of an available network service and a requested network service from the other computing device, provisioning of the requested network service to the other computing device from the computing device based on the indication, and provisioning of the available network service to the computing device from the other computing device based on the indication. 16. The computer-implemented method of claim 11 , comprising providing a network service to the other computing device. | 0.884913 |
9,183,173 | 1 | 6 | 1. In a computing environment, a computer-implemented method performed on at least one processor, comprising: creating a similarity measure between objects, each object represented by term vectors, including learning values of the term vectors by: extracting terms from each object for generating a plurality of features from each of the extracted terms; for each of the extracted terms, creating a term vector by including one or more of the plurality of features, the one or more of the plurality of features of the term vector being associated with one or more model parameters; creating a term-weighting function including the term vectors associated with the extracted terms; learning the one or more model parameters of the term vectors of the term-weighting function that optimize a loss function to construct a learned term-weighting function; and applying the learned term-weighting function to determine similarity between the objects. | 1. In a computing environment, a computer-implemented method performed on at least one processor, comprising: creating a similarity measure between objects, each object represented by term vectors, including learning values of the term vectors by: extracting terms from each object for generating a plurality of features from each of the extracted terms; for each of the extracted terms, creating a term vector by including one or more of the plurality of features, the one or more of the plurality of features of the term vector being associated with one or more model parameters; creating a term-weighting function including the term vectors associated with the extracted terms; learning the one or more model parameters of the term vectors of the term-weighting function that optimize a loss function to construct a learned term-weighting function; and applying the learned term-weighting function to determine similarity between the objects. 6. The computer-implemented method of claim 1 further comprising, selecting or scoring terms or k-grams to create signatures. | 0.905446 |
10,057,291 | 6 | 10 | 6. A computing device comprising: a hardware processing unit; wherein the computing device is configured to perform operations for assessing semantic difference between networking access control lists (ACLs), the operations comprising: parsing a first device-level ACL file to generate a high-level ACL representation of the first device-level ACL file in a common ACL data structure format; parsing a second device-level ACL file to generate a high-level ACL representation of the second device-level ACL file in the common ACL data structure format; comparing the high-level ACL representation of the first device-level ACL file and the high-level representation of the second device-level ACL file; performing semantic analysis using results of the comparing to determine a semantic difference between the high-level ACL representation of the first device-level ACL file and the high-level representation of the second device-level ACL file; calculating a risk score based on the semantic difference, wherein the risk score indicates whether the semantic difference represents an acceptable change if the second device-level ACL file is deployed, and wherein the risk score weights changes that delete hosts higher than changes that add hosts comparing the risk score to a threshold value; and determining whether to deploy the second device-level ACL file based at least in part on the comparison of the risk score to the threshold value. | 6. A computing device comprising: a hardware processing unit; wherein the computing device is configured to perform operations for assessing semantic difference between networking access control lists (ACLs), the operations comprising: parsing a first device-level ACL file to generate a high-level ACL representation of the first device-level ACL file in a common ACL data structure format; parsing a second device-level ACL file to generate a high-level ACL representation of the second device-level ACL file in the common ACL data structure format; comparing the high-level ACL representation of the first device-level ACL file and the high-level representation of the second device-level ACL file; performing semantic analysis using results of the comparing to determine a semantic difference between the high-level ACL representation of the first device-level ACL file and the high-level representation of the second device-level ACL file; calculating a risk score based on the semantic difference, wherein the risk score indicates whether the semantic difference represents an acceptable change if the second device-level ACL file is deployed, and wherein the risk score weights changes that delete hosts higher than changes that add hosts comparing the risk score to a threshold value; and determining whether to deploy the second device-level ACL file based at least in part on the comparison of the risk score to the threshold value. 10. The computing device of claim 6 wherein parsing the first device-level ACL file and the second device-level ACL file comprises: identifying a plurality of ACLs associated with a rule identifier; and creating a single entry in the common ACL data structure format representing the plurality of ACLs. | 0.654462 |
8,607,138 | 5 | 7 | 5. The system of claim 1 , wherein the report processed by the OLAP system includes one or more formatting macros, and the server system further processes the one or more formatting macros to format the report for presentation in the spreadsheet application displayed within the instance of the web browser. | 5. The system of claim 1 , wherein the report processed by the OLAP system includes one or more formatting macros, and the server system further processes the one or more formatting macros to format the report for presentation in the spreadsheet application displayed within the instance of the web browser. 7. The system of claim 5 , wherein the spreadsheet application applies the one or more formatting macros upon receipt at the user system to format the report for presentation in the spreadsheet application displayed within the instance of the web browser. | 0.928129 |
9,020,246 | 9 | 13 | 9. A non-transitory computer-readable medium storing software having stored thereon instructions, which, when executed by one or more computers, cause the one or more computers to perform operations of: obtaining a query image that has been submitted by a user of an image search system; determining that the query image is indicated to be associated with an object; obtaining, for the query image: (i) one or more training images of a corpus of training images that are indicated to be associated with the object, and (ii) for each one of the one or more training images that are indicated to be associated with the object, a similarity score that reflects a level of similarity between the query image and the respective training image; determining to add the query image to the corpus of training images that are indicated to be associated with the object in response to the similarity score that reflects the level of similarity between the query image and the respective training image satisfying a threshold; and training the image search system to recognize the object in subsequently received query images, using the corpus of training images that are indicated to be associated with the object. | 9. A non-transitory computer-readable medium storing software having stored thereon instructions, which, when executed by one or more computers, cause the one or more computers to perform operations of: obtaining a query image that has been submitted by a user of an image search system; determining that the query image is indicated to be associated with an object; obtaining, for the query image: (i) one or more training images of a corpus of training images that are indicated to be associated with the object, and (ii) for each one of the one or more training images that are indicated to be associated with the object, a similarity score that reflects a level of similarity between the query image and the respective training image; determining to add the query image to the corpus of training images that are indicated to be associated with the object in response to the similarity score that reflects the level of similarity between the query image and the respective training image satisfying a threshold; and training the image search system to recognize the object in subsequently received query images, using the corpus of training images that are indicated to be associated with the object. 13. The non-transitory computer-readable medium of claim 9 , further comprising: obtaining one or more other query images; determining that the query image and the one or more other query images matches a particular object; and in response to determining that the query image and the one or more other query images matches the particular object, adding the query image and the one or more other query images to a corpus of training images associated with the particular object. | 0.508247 |
7,617,183 | 2 | 3 | 2. The method as claimed in claim 1 , further comprising expanding each term to remove NOT operators. | 2. The method as claimed in claim 1 , further comprising expanding each term to remove NOT operators. 3. The method as claimed in claim 2 , wherein the sum of terms are expanded using Boolean logic. | 0.953802 |
7,885,807 | 10 | 11 | 10. A system according to claim 7 , wherein said text array of said data handler comprises a multi-dimensional array of cells, each cell being representative of an element, its location within said body of text and a vector path indicative of a possible translation of said element into said target language. | 10. A system according to claim 7 , wherein said text array of said data handler comprises a multi-dimensional array of cells, each cell being representative of an element, its location within said body of text and a vector path indicative of a possible translation of said element into said target language. 11. A system according to claim 10 , wherein said possible translation may be one of a plurality of possible translations into said target language, including any alternative translations and spelling variations, corresponding to a respective element. | 0.932527 |
8,406,385 | 11 | 13 | 11. A non-transitory computer readable medium having instructions stored which, when executed by a computing device, cause the computing device to perform a method comprising: receiving, from a user, a voice message intended for delivery to a recipient, the voice message being in a first language; determining a second language understood by the recipient; and when the first language differs from the second language, prompting the user to determine whether to translate the voice message into the second language; when the user, in response to the prompting indicates translation should occur, translating, via a processor, the voice message into the second language, to yield a translated voice message; and delivering the translated voice message to the recipient. | 11. A non-transitory computer readable medium having instructions stored which, when executed by a computing device, cause the computing device to perform a method comprising: receiving, from a user, a voice message intended for delivery to a recipient, the voice message being in a first language; determining a second language understood by the recipient; and when the first language differs from the second language, prompting the user to determine whether to translate the voice message into the second language; when the user, in response to the prompting indicates translation should occur, translating, via a processor, the voice message into the second language, to yield a translated voice message; and delivering the translated voice message to the recipient. 13. The non-transitory computer readable medium of claim 11 , the non-transitory computer readable medium having additional instructions stored which result in the method further comprising: delivering the voice message in addition to the translated voice message to the recipient. | 0.635065 |
8,677,377 | 27 | 29 | 27. A system for registering services for use in a domain, said system comprising: an execution environment comprising an active ontology modeling the domain, the active ontology comprising a logical arrangement of a plurality of active processing elements, wherein each active processing element is configured to receive at least one fact relating to the modeled domain and to perform at least one action responsive to at least one received fact; and a processor configured as a service broker for interfacing the at least one active ontology to a service-oriented architecture comprising a plurality of services; wherein a service registers with the at least one active ontology by specifying at least one of: one or more active processing elements that the service can accept; and one or more active processing elements that the service cannot accept and wherein the active ontology filters requests for services to the at least one of the plurality of services in accordance with the one or more active processing elements specified by the at least one of the plurality of services. | 27. A system for registering services for use in a domain, said system comprising: an execution environment comprising an active ontology modeling the domain, the active ontology comprising a logical arrangement of a plurality of active processing elements, wherein each active processing element is configured to receive at least one fact relating to the modeled domain and to perform at least one action responsive to at least one received fact; and a processor configured as a service broker for interfacing the at least one active ontology to a service-oriented architecture comprising a plurality of services; wherein a service registers with the at least one active ontology by specifying at least one of: one or more active processing elements that the service can accept; and one or more active processing elements that the service cannot accept and wherein the active ontology filters requests for services to the at least one of the plurality of services in accordance with the one or more active processing elements specified by the at least one of the plurality of services. 29. The system of claim 27 , wherein the service broker selects services for registration based on meta-data relating to the services. | 0.807471 |
8,782,042 | 3 | 4 | 3. The non-transitory computer readable medium of claim 2 , wherein the entity attribute is a name of the person. | 3. The non-transitory computer readable medium of claim 2 , wherein the entity attribute is a name of the person. 4. The non-transitory computer readable medium of claim 3 , wherein the identity attribute is a title designated to the person. | 0.975605 |
7,609,669 | 12 | 13 | 12. The method of claim 1 further comprising maintaining a record at the server regarding the acknowledgement messages from a particular operator. | 12. The method of claim 1 further comprising maintaining a record at the server regarding the acknowledgement messages from a particular operator. 13. The method of claim 12 further comprising tracking from the record which operators at least one of accessed or understood the textual message. | 0.934056 |
10,102,849 | 1 | 6 | 1. A method comprising: training, using at least one computer hardware processor to perform an automated two-stage training procedure having a first training stage and a second training stage different from the first training stage, an automatic speech recognition (ASR) engine at least in part by generating one or more language models for use as part of the ASR engine, the training comprising: obtaining language data comprising training data and associated values for one or more metadata attributes, the language data comprising a plurality of instances of language data, an instance of language data comprising an instance of training data and one or more metadata attribute values associated with the instance of training data; identifying, by processing the language data, a set of the one or more metadata attributes to use for clustering the instances of training data, the set of metadata attributes comprising first and second sets of metadata attributes; performing the first training stage, comprising: clustering the training data instances based on their respective values for the first set of metadata attributes to obtain a first plurality of clusters, the clustering comprising dividing the training data instances into the first plurality of clusters based on their respective values for the first set of metadata attributes; and generating a respective language model for multiple clusters of the first plurality of clusters to obtain a plurality of language models, the generating comprising using training data in each of one or more of the multiple clusters to generate a respective language model in the plurality of language models; performing the second training stage, comprising: clustering the training data instances based on their respective values for the second set of metadata attributes to obtain a second plurality of clusters, the clustering comprising subdividing the training data instances in the first plurality of clusters based on their respective values for the second set of metadata attributes to obtain the second plurality of clusters; and generating a first language model for a first cluster in the second plurality of clusters as a first weighted mixture of language models in the plurality of language models by estimating weights of the language models in the first weighted mixture using training data instances in the first cluster; and storing the plurality of language models and the first language model for use as part of the ASR engine. | 1. A method comprising: training, using at least one computer hardware processor to perform an automated two-stage training procedure having a first training stage and a second training stage different from the first training stage, an automatic speech recognition (ASR) engine at least in part by generating one or more language models for use as part of the ASR engine, the training comprising: obtaining language data comprising training data and associated values for one or more metadata attributes, the language data comprising a plurality of instances of language data, an instance of language data comprising an instance of training data and one or more metadata attribute values associated with the instance of training data; identifying, by processing the language data, a set of the one or more metadata attributes to use for clustering the instances of training data, the set of metadata attributes comprising first and second sets of metadata attributes; performing the first training stage, comprising: clustering the training data instances based on their respective values for the first set of metadata attributes to obtain a first plurality of clusters, the clustering comprising dividing the training data instances into the first plurality of clusters based on their respective values for the first set of metadata attributes; and generating a respective language model for multiple clusters of the first plurality of clusters to obtain a plurality of language models, the generating comprising using training data in each of one or more of the multiple clusters to generate a respective language model in the plurality of language models; performing the second training stage, comprising: clustering the training data instances based on their respective values for the second set of metadata attributes to obtain a second plurality of clusters, the clustering comprising subdividing the training data instances in the first plurality of clusters based on their respective values for the second set of metadata attributes to obtain the second plurality of clusters; and generating a first language model for a first cluster in the second plurality of clusters as a first weighted mixture of language models in the plurality of language models by estimating weights of the language models in the first weighted mixture using training data instances in the first cluster; and storing the plurality of language models and the first language model for use as part of the ASR engine. 6. The method of claim 1 , further comprising: generating a second language model for a second cluster in the second plurality of clusters as a second weighted mixture of language models in the plurality of language models by estimating weights of the language models in the second weighted mixture using training data instances in the second cluster. | 0.799886 |
9,122,484 | 9 | 10 | 9. The apparatus according to claim 8 , wherein nodes belonging respectively to the at least two document object models are connected based on the non-intrusive monitor monitoring user events and triggering of any function associated with the nodes belonging respectively to the at least two document object models. | 9. The apparatus according to claim 8 , wherein nodes belonging respectively to the at least two document object models are connected based on the non-intrusive monitor monitoring user events and triggering of any function associated with the nodes belonging respectively to the at least two document object models. 10. The apparatus according to claim 9 , nodes belonging respectively to the at least two document object models are connected, where the method further comprises adding one or more custom extra functions at least one of before and after any function associated with the connected nodes belonging respectively to the at least two document object models. | 0.913395 |
9,082,309 | 1 | 6 | 1. A method for generating questions, comprising: providing a user interface or a text editor on a client device for a user to compose a dynamic question template in a first representation of a human readable language; receiving from the client device by a system running on one or more server machines the dynamic question template in the first representation, the dynamic question template having a question, question variables, and question constraints, with or without a correct answer; the system checking the dynamic question template in the first representation for syntax errors according to a query specification language and enabling correction of any syntax error found by the system; the system compiling the dynamic question template from the first representation into a second representation of a first machine readable language supported by a symbolic math engine; the system generating a dynamic question template object of a second machine readable language supported by an object library of the system based at least on the compiled dynamic question template in the first machine readable language, the dynamic question template object including one or more predefined objects from the object library, the generating including: determining whether the question constraints are sufficient to produce a plurality of unique question variants; suggesting at least one change or enhancement to the question; or a combination thereof; the system running one or more simulations of the question; and the system generating a plurality of unique question variants using the dynamic question template object and output from the one or more simulations without further input from the user to thereby improve computer based question generation technologies, wherein each of the plurality of unique question variants comprises a unique variation of the question text incorporating a unique combination of values for the question variables as constrained by the question constraints. | 1. A method for generating questions, comprising: providing a user interface or a text editor on a client device for a user to compose a dynamic question template in a first representation of a human readable language; receiving from the client device by a system running on one or more server machines the dynamic question template in the first representation, the dynamic question template having a question, question variables, and question constraints, with or without a correct answer; the system checking the dynamic question template in the first representation for syntax errors according to a query specification language and enabling correction of any syntax error found by the system; the system compiling the dynamic question template from the first representation into a second representation of a first machine readable language supported by a symbolic math engine; the system generating a dynamic question template object of a second machine readable language supported by an object library of the system based at least on the compiled dynamic question template in the first machine readable language, the dynamic question template object including one or more predefined objects from the object library, the generating including: determining whether the question constraints are sufficient to produce a plurality of unique question variants; suggesting at least one change or enhancement to the question; or a combination thereof; the system running one or more simulations of the question; and the system generating a plurality of unique question variants using the dynamic question template object and output from the one or more simulations without further input from the user to thereby improve computer based question generation technologies, wherein each of the plurality of unique question variants comprises a unique variation of the question text incorporating a unique combination of values for the question variables as constrained by the question constraints. 6. The method according to claim 1 , further comprising: providing one or more hints associated with the question to the user at the client device via the user interface. | 0.88498 |
10,037,155 | 9 | 10 | 9. An apparatus for storing data, the apparatus comprising: a storage device; one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the apparatus to: store a first version of a document in a first structure on the storage device; receive an updated version of the document; identify one or more frequently updated portions of the document; store on the storage device the one or more frequently updated portions of the document, in a second structure separate from the first structure; receive a request for the document; retrieve the first version of the document from the first structure and the frequently updated portions of the document from the second structure; merge the updated portions with the first version to obtain a merged version of the document, by writing the updated portions to the first version of the document; and return the merged version of the document in response to the request. | 9. An apparatus for storing data, the apparatus comprising: a storage device; one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the apparatus to: store a first version of a document in a first structure on the storage device; receive an updated version of the document; identify one or more frequently updated portions of the document; store on the storage device the one or more frequently updated portions of the document, in a second structure separate from the first structure; receive a request for the document; retrieve the first version of the document from the first structure and the frequently updated portions of the document from the second structure; merge the updated portions with the first version to obtain a merged version of the document, by writing the updated portions to the first version of the document; and return the merged version of the document in response to the request. 10. The apparatus of claim 9 , wherein storing the frequently updated portions of the documents comprises: extracting the frequently updated portions from the updated version of the document; and storing the frequently updated portions in the second structure and not in the first structure; wherein no other portion of the updated document is stored; and wherein a controller for accessing the storage device cannot write to or read from the storage device only a portion of the first structure or the second structure. | 0.539007 |
5,537,485 | 20 | 26 | 20. The method according to claim 15, wherein said first cluster filtering step comprises: a step of area-point transformation in which signals representing possible microcalcifications are reduced to respective single pixels in a first binary image; a step of counting the number of pixels exceeding a predetermined value in a kernel of predetermined size scanned across said first binary image and copying the contents of the said binary image that lay within the kernel to the corresponding locations in a second binary image whenever the contents of the kernel meet a predetermined grouping criteria based on said counting; and outputting said second binary image comprised of the pixels remaining after the counting and copying step. | 20. The method according to claim 15, wherein said first cluster filtering step comprises: a step of area-point transformation in which signals representing possible microcalcifications are reduced to respective single pixels in a first binary image; a step of counting the number of pixels exceeding a predetermined value in a kernel of predetermined size scanned across said first binary image and copying the contents of the said binary image that lay within the kernel to the corresponding locations in a second binary image whenever the contents of the kernel meet a predetermined grouping criteria based on said counting; and outputting said second binary image comprised of the pixels remaining after the counting and copying step. 26. The method according to claim 20, wherein said first cluster filtering step comprises: selecting the size of said kernel so as to discriminate against false clusters represented by pixels in the first binary image separated by greater than a predetermined distance. | 0.940169 |
9,747,349 | 1 | 7 | 1. A method for building an optimal group of cubes based upon historical queries to a database for answering a greatest number of future queries from a database, comprising the steps of: identifying a set of grouping patterns in accordance with a plurality of historical queries to the database for grouping components of the historical queries; defining one or more constraints to be applied to the set of grouping patterns, the one or more constraints being selected so as to optimize one or more parameters associated with the answering of a future query; determining an optimal set of grouping patterns in accordance with the defined constraints, each grouping pattern comprising a multi-dimensional database; wherein the determining of the optimal set of grouping patterns further comprises iterating the steps of: determining a plurality of grouping patterns or combined cubes in accordance with the plurality of historical queries and one or more knowledge modeling constructs defining a schema for data stored within the database; combining two or more of the plurality of grouping patterns or combined cubes that are determined to provide overlapping components so that, when combined into a larger combined cube, allow for a larger percentage of the historical queries to be answered in accordance with the defined constraints in a more efficient manner; and removing one or more the plurality of grouping patterns or combined cubes that comprise a completely defined subset of the larger combined cube in accordance with a plurality of overlapping components; and wherein the steps for creating the cubes are iterated until an optimal set of combined cubes is generated able to answer a greatest percentage of historical questions. | 1. A method for building an optimal group of cubes based upon historical queries to a database for answering a greatest number of future queries from a database, comprising the steps of: identifying a set of grouping patterns in accordance with a plurality of historical queries to the database for grouping components of the historical queries; defining one or more constraints to be applied to the set of grouping patterns, the one or more constraints being selected so as to optimize one or more parameters associated with the answering of a future query; determining an optimal set of grouping patterns in accordance with the defined constraints, each grouping pattern comprising a multi-dimensional database; wherein the determining of the optimal set of grouping patterns further comprises iterating the steps of: determining a plurality of grouping patterns or combined cubes in accordance with the plurality of historical queries and one or more knowledge modeling constructs defining a schema for data stored within the database; combining two or more of the plurality of grouping patterns or combined cubes that are determined to provide overlapping components so that, when combined into a larger combined cube, allow for a larger percentage of the historical queries to be answered in accordance with the defined constraints in a more efficient manner; and removing one or more the plurality of grouping patterns or combined cubes that comprise a completely defined subset of the larger combined cube in accordance with a plurality of overlapping components; and wherein the steps for creating the cubes are iterated until an optimal set of combined cubes is generated able to answer a greatest percentage of historical questions. 7. The method of claim 1 , wherein the plurality of grouping patterns are determined in accordance with the steps of: inputting a set of user-defined instructions into a computer database system; inputting a user query into said computer database system; mining said computer database system for data relevant to said user query; creating a data set comprising said data relevant to said user query; aggregating data in said data set using domain metrics selected based on any of predefined and configurable rules and past user usage, wherein the aggregation comprises: tagging all data attributes in said data set based on database metadata and inputs from a user, wherein said data attributes comprise any of data identifications (IDs), data grouping attributes, and data measure attributes; and wherein the tagging process comprises inputting said user query, said database metadata for said data attributes associated with said user query, and attributes specifications; and reducing the number of the tagged data attributes in said data set by logically eliminating data attributes. | 0.50046 |
9,122,497 | 9 | 10 | 9. A computer system comprising: a central processing unit (CPU); a memory coupled to the CPU; a computer-readable, tangible storage device coupled to the CPU, the storage device containing instructions that are executed by the CPU via the memory to implement a method of validating translated files for inclusion in an application being developed, wherein the method comprises the steps of: the computer system sending a translatable file having externalized content in a single base natural language to a plurality of other computer systems, wherein the externalized content is external to code of the application being developed; in response to a generation of a first translated file including a first translation of the externalized content into a natural language other than the base natural language by another computer system included in the plurality of other computer systems, the computer system receiving the first translated file from the other computer system; in a simulation environment, the computer system simulating a loading of the first translation of the externalized content into a user interface of the application at a runtime of the application and simulating a presentation of the first translation of the externalized content in the user interface at the runtime, by calling one or more functions included in the application, without an actual presentation of the first translation of the externalized content in the user interface, wherein an execution at the runtime of the one or more functions displays the externalized content in the user interface; the computer system determining whether the simulating of the loading of the first translation of the externalized content into the user interface and the simulating of the presentation of the first translation of the externalized content in the user interface by the calling the one or more functions indicates an error condition that causes the application to stop running at the runtime; based in part on the error condition being indicated by the simulating of the loading of the first translation and the simulating of the presentation of the first translation, the computer system: determining the first translation of the externalized content includes a syntax error that causes the error condition, generating a report including an identification of a portion of the first translation of the externalized content that includes the syntax error and an error message that is generated by the application at the runtime in response to the error condition, and initiating a correction of the syntax error by sending the report to the other computer system, wherein the syntax error includes at least one of: (1) a first key included in the first translated file is not matched with exactly one corresponding first value in the first translated file, the first translated file being a first property file including first key-value pairs including the first key and the first value as one of the pairs; (2) a second key in the translatable file is not in the first translated file, the translatable file being a second property file including second key-value pairs, one of the second key-value pairs including the second key; and (3) one or more placeholders in the first translated file are not matched to respective one or more placeholders in the translatable file, the one or more placeholders in the first translated file and the one or more placeholders in the translatable file providing variable substitution by being filled in with actual values by the code of the application at the runtime; and based in part on the error condition being indicated by the simulating of the loading of the first translation and the simulating of the presentation of the first translation, subsequent to a completion by the other computer system of the correction of the syntax error included in the first translation, and in response to a receipt by the computer system of a second translation of the externalized content which includes the correction of the syntax error, the second translation included in a second translated file generated by the other computer system: the computer system simulating a loading of the second translation of the externalized content into the user interface of the application at the runtime and simulating a presentation of the second translation of the externalized content in the user interface at the runtime, by calling the one or more functions, without an actual presentation of the second translation of the externalized content in the user interface; and the computer system determining whether the simulating of the loading of the second translation and the simulating of the presentation of the second translation by the calling the one or more functions indicates the error condition that causes the application to stop running at the runtime; and based in part on the error condition not being indicated by the simulating of the loading of the second translation and the simulating of the presentation of the second translation, the computer system at the runtime presenting the second translation of the externalized content in the user interface without causing the application to stop running at the runtime. | 9. A computer system comprising: a central processing unit (CPU); a memory coupled to the CPU; a computer-readable, tangible storage device coupled to the CPU, the storage device containing instructions that are executed by the CPU via the memory to implement a method of validating translated files for inclusion in an application being developed, wherein the method comprises the steps of: the computer system sending a translatable file having externalized content in a single base natural language to a plurality of other computer systems, wherein the externalized content is external to code of the application being developed; in response to a generation of a first translated file including a first translation of the externalized content into a natural language other than the base natural language by another computer system included in the plurality of other computer systems, the computer system receiving the first translated file from the other computer system; in a simulation environment, the computer system simulating a loading of the first translation of the externalized content into a user interface of the application at a runtime of the application and simulating a presentation of the first translation of the externalized content in the user interface at the runtime, by calling one or more functions included in the application, without an actual presentation of the first translation of the externalized content in the user interface, wherein an execution at the runtime of the one or more functions displays the externalized content in the user interface; the computer system determining whether the simulating of the loading of the first translation of the externalized content into the user interface and the simulating of the presentation of the first translation of the externalized content in the user interface by the calling the one or more functions indicates an error condition that causes the application to stop running at the runtime; based in part on the error condition being indicated by the simulating of the loading of the first translation and the simulating of the presentation of the first translation, the computer system: determining the first translation of the externalized content includes a syntax error that causes the error condition, generating a report including an identification of a portion of the first translation of the externalized content that includes the syntax error and an error message that is generated by the application at the runtime in response to the error condition, and initiating a correction of the syntax error by sending the report to the other computer system, wherein the syntax error includes at least one of: (1) a first key included in the first translated file is not matched with exactly one corresponding first value in the first translated file, the first translated file being a first property file including first key-value pairs including the first key and the first value as one of the pairs; (2) a second key in the translatable file is not in the first translated file, the translatable file being a second property file including second key-value pairs, one of the second key-value pairs including the second key; and (3) one or more placeholders in the first translated file are not matched to respective one or more placeholders in the translatable file, the one or more placeholders in the first translated file and the one or more placeholders in the translatable file providing variable substitution by being filled in with actual values by the code of the application at the runtime; and based in part on the error condition being indicated by the simulating of the loading of the first translation and the simulating of the presentation of the first translation, subsequent to a completion by the other computer system of the correction of the syntax error included in the first translation, and in response to a receipt by the computer system of a second translation of the externalized content which includes the correction of the syntax error, the second translation included in a second translated file generated by the other computer system: the computer system simulating a loading of the second translation of the externalized content into the user interface of the application at the runtime and simulating a presentation of the second translation of the externalized content in the user interface at the runtime, by calling the one or more functions, without an actual presentation of the second translation of the externalized content in the user interface; and the computer system determining whether the simulating of the loading of the second translation and the simulating of the presentation of the second translation by the calling the one or more functions indicates the error condition that causes the application to stop running at the runtime; and based in part on the error condition not being indicated by the simulating of the loading of the second translation and the simulating of the presentation of the second translation, the computer system at the runtime presenting the second translation of the externalized content in the user interface without causing the application to stop running at the runtime. 10. The computer system of claim 9 , wherein the method further comprises the steps of: the computer system presenting a graphical user interface (GUI) that displays entries of the first translated file in proximity to corresponding entries of the translatable file; the computer system receiving and storing an identification of a second error in the first translated file based on a comparison, via the GUI, of the entries of the first translated file against the corresponding entries of the translatable file; the computer system initiating a correction of the second error by the other computer system; and based in part on a completion of the correction of the second error by the other computer system and a generation by the other computer system of the second translate file which includes the correction of the second error, the computer system receiving the second translated file and validating the second translated file by determining the second error is not included in the second translated file, wherein the presenting at the runtime of the second translation of the externalized content in the user interface is further based on the determining the second error is not included in the second translated file. | 0.510774 |
7,945,567 | 1 | 7 | 1. Process of aiding retrieval by a search engine of a document in a repository of documents, said process comprising the steps of: applying to each document in the repository a first classification based on a profile of a user with access to the repository, the classification being determined by the role of the user in use of the content of the particular document that the user seeks to retrieve from the repository; after the classification has been applied to the documents, applying a query formulated by said user to the search engine; said search engine responding to the query by producing a list of references of documents in the repository; causing a machine to reduce said list of references by, in said machine, eliminating from said list those references which do not correspond to the user's profile. wherein the application of said first classification comprises counting the number of words in the document, determining whether the document contains an immediate solution to a problem in response to the counting step, and assigning a first category to said document in response to said determination. | 1. Process of aiding retrieval by a search engine of a document in a repository of documents, said process comprising the steps of: applying to each document in the repository a first classification based on a profile of a user with access to the repository, the classification being determined by the role of the user in use of the content of the particular document that the user seeks to retrieve from the repository; after the classification has been applied to the documents, applying a query formulated by said user to the search engine; said search engine responding to the query by producing a list of references of documents in the repository; causing a machine to reduce said list of references by, in said machine, eliminating from said list those references which do not correspond to the user's profile. wherein the application of said first classification comprises counting the number of words in the document, determining whether the document contains an immediate solution to a problem in response to the counting step, and assigning a first category to said document in response to said determination. 7. Arranging a help-desk software tool to access a document repository for first level agents, technicians and experts by using the process of claim 1 . | 0.879937 |
9,086,735 | 1 | 16 | 1. A computer-implemented method, comprising: receiving a user input into a user interface of an input method editor (IME); determining, based on the user input, whether to process the user input with a script engine; when the user input indicates that the user input is to be processed with the script engine: providing the user input to the script engine, selecting a script from a plurality of scripts electronically stored in a script repository, processing the user input through the script using the script engine to generate one or more candidates, and providing the one or more candidates to an IME engine; when the user input indicates that the user input is not to be processed with the script engine: providing the user input to the IME engine, and processing the user input with the IME engine to generate the one or more candidates; and receiving an extension mode input indicating operation of the IME in an extension mode, operating the IME in the extension mode in response to receiving the extension mode input, and providing all user input to the script engine when operating in the extension mode. | 1. A computer-implemented method, comprising: receiving a user input into a user interface of an input method editor (IME); determining, based on the user input, whether to process the user input with a script engine; when the user input indicates that the user input is to be processed with the script engine: providing the user input to the script engine, selecting a script from a plurality of scripts electronically stored in a script repository, processing the user input through the script using the script engine to generate one or more candidates, and providing the one or more candidates to an IME engine; when the user input indicates that the user input is not to be processed with the script engine: providing the user input to the IME engine, and processing the user input with the IME engine to generate the one or more candidates; and receiving an extension mode input indicating operation of the IME in an extension mode, operating the IME in the extension mode in response to receiving the extension mode input, and providing all user input to the script engine when operating in the extension mode. 16. The computer-implemented method of claim 1 , further comprising identifying a script language of the script, wherein the script engine instantiates a runtime corresponding to the script language for processing the user input through the script. | 0.81575 |
8,666,962 | 13 | 22 | 13. One or more non-transitory computer-readable media storing instructions for providing speculative search results, wherein the instructions, when executed by one or more processors, causes: receiving, at a search engine, over a network from a client node, a not-yet-submitted search query provided by a user; in response to receiving at the search engine, from the client node, the not-yet-submitted search query, determining, at the search engine, whether the not-yet-submitted search query meets a criterion for initiating a speculative search for items that satisfy the not-yet-submitted search query; in response to determining, at the search engine, that the not-yet-submitted search query does not meet the criterion, waiting for additional input from the client node without initiating the speculative search for items that satisfy the not-yet-submitted search query; receiving, at the search engine, over the network, from the client node, an updated not-yet-submitted search query that comprises the not-yet-submitted search query and one or more additional characters; in response to receiving, at the search engine, from the client node, the updated not-yet-submitted search query, determining, at the search engine, whether the updated not-yet-submitted search query meets the criterion for initiating a speculative search for items that satisfy the updated not-yet-submitted search query; in response to determining, at the search engine, that the updated not-yet-submitted search query meets the criterion, performing, at the search engine, the speculative search for items that satisfy said updated not-yet-submitted search query prior to receiving, from said client node, an indication that said updated not-yet-submitted search query is completely formed; providing, from the search engine, to said client node, information about to at least one item, found by the speculative search, that satisfies said updated not-yet submitted search query; wherein the at least one item, found by the speculative search, includes at least one of (a) a web page, (b) a graphic, or (c) textual information. | 13. One or more non-transitory computer-readable media storing instructions for providing speculative search results, wherein the instructions, when executed by one or more processors, causes: receiving, at a search engine, over a network from a client node, a not-yet-submitted search query provided by a user; in response to receiving at the search engine, from the client node, the not-yet-submitted search query, determining, at the search engine, whether the not-yet-submitted search query meets a criterion for initiating a speculative search for items that satisfy the not-yet-submitted search query; in response to determining, at the search engine, that the not-yet-submitted search query does not meet the criterion, waiting for additional input from the client node without initiating the speculative search for items that satisfy the not-yet-submitted search query; receiving, at the search engine, over the network, from the client node, an updated not-yet-submitted search query that comprises the not-yet-submitted search query and one or more additional characters; in response to receiving, at the search engine, from the client node, the updated not-yet-submitted search query, determining, at the search engine, whether the updated not-yet-submitted search query meets the criterion for initiating a speculative search for items that satisfy the updated not-yet-submitted search query; in response to determining, at the search engine, that the updated not-yet-submitted search query meets the criterion, performing, at the search engine, the speculative search for items that satisfy said updated not-yet-submitted search query prior to receiving, from said client node, an indication that said updated not-yet-submitted search query is completely formed; providing, from the search engine, to said client node, information about to at least one item, found by the speculative search, that satisfies said updated not-yet submitted search query; wherein the at least one item, found by the speculative search, includes at least one of (a) a web page, (b) a graphic, or (c) textual information. 22. The one or more non-transitory computer-readable media of claim 13 , wherein the instructions, when executed by one or more processors, further cause: receiving input that indicates that the user submitted a search query; and performing a search based on said submitted search query. | 0.797602 |
7,543,237 | 33 | 35 | 33. The method of claim 32 further comprising: querying the detected context indication against a knowledge model to generate a list of relations as a function of the detected context indication. | 33. The method of claim 32 further comprising: querying the detected context indication against a knowledge model to generate a list of relations as a function of the detected context indication. 35. The method of claim 33 , wherein the list of relations includes an associated user list and a document list. | 0.985079 |
9,213,686 | 8 | 9 | 8. The method of claim 1 , wherein the pre-defined patient intake form comprises at least one form completion tool that provides form completion instructions in the selected language for providing form completion assistance. | 8. The method of claim 1 , wherein the pre-defined patient intake form comprises at least one form completion tool that provides form completion instructions in the selected language for providing form completion assistance. 9. The method of claim 8 , wherein the at least one form completion tool comprises: at least one audio clip, at least one video clip, and access to live assistance. | 0.961248 |
8,291,374 | 1 | 11 | 1. A method of automatically generating source code for a programming application, said method comprising the steps of: providing existing source code to be used in part for said programming application; testing said existing source code for functionality to create tested source code; creating abstracted change model representations of a possible set of changes for said tested source code, wherein each of said abstracted change model representations is a change-model and said change model representations collectively are change-models; creating application templates by applying mark-up language to said tested source code; producing generalized implementations of source code changes utilizing said application templates; mapping said generalized implementations of source code changes to at least one selection of a grouping containing said change-models and said tested source code to produce mapped sections of code; accepting inputs in to arrange, configure and assign specific values for said change-model representations; and selectively transforming, in any combination, said tested source code, said change-model representations, said specific values, said generalized implementations and said mapped sections of code in order to produce new source code. | 1. A method of automatically generating source code for a programming application, said method comprising the steps of: providing existing source code to be used in part for said programming application; testing said existing source code for functionality to create tested source code; creating abstracted change model representations of a possible set of changes for said tested source code, wherein each of said abstracted change model representations is a change-model and said change model representations collectively are change-models; creating application templates by applying mark-up language to said tested source code; producing generalized implementations of source code changes utilizing said application templates; mapping said generalized implementations of source code changes to at least one selection of a grouping containing said change-models and said tested source code to produce mapped sections of code; accepting inputs in to arrange, configure and assign specific values for said change-model representations; and selectively transforming, in any combination, said tested source code, said change-model representations, said specific values, said generalized implementations and said mapped sections of code in order to produce new source code. 11. The method according to claim 1 , further including the step of storing said change-models and said application-templates into a database. | 0.752613 |
8,074,168 | 1 | 6 | 1. A method for automated rendering of context-compensated text in a graphical environment that is displayed in a display of a computing device, comprising: receiving a specification of items to be graphically displayed in the graphical environment, wherein the specification includes text to be graphically displayed in the graphical environment, and wherein the text is associated with an enhanced type-font for the text; determining a set of graphical items that will be displayed in proximity to a graphical representation of the text; determining that graphical aspects of the proximate graphical items will interfere with a user's ability to view the graphical representation of the text; and modifying the graphical representation of the text to more clearly display the text in the graphical environment, wherein modifying the graphical representation of the text comprises using rules associated with the enhanced type-font to change the complexity and detail displayed for the graphical representation of the text based on the size of the displayed text. | 1. A method for automated rendering of context-compensated text in a graphical environment that is displayed in a display of a computing device, comprising: receiving a specification of items to be graphically displayed in the graphical environment, wherein the specification includes text to be graphically displayed in the graphical environment, and wherein the text is associated with an enhanced type-font for the text; determining a set of graphical items that will be displayed in proximity to a graphical representation of the text; determining that graphical aspects of the proximate graphical items will interfere with a user's ability to view the graphical representation of the text; and modifying the graphical representation of the text to more clearly display the text in the graphical environment, wherein modifying the graphical representation of the text comprises using rules associated with the enhanced type-font to change the complexity and detail displayed for the graphical representation of the text based on the size of the displayed text. 6. The method of claim 1 , wherein changing the graphical representation of the text involves removing shadows and serifs for the displayed text when reducing the size of the displayed text. | 0.920635 |
9,264,824 | 1 | 3 | 1. A method comprising: providing a graphical user interface in a user field of vision for a user to identify and select a speaker of interest from a plurality of speakers; recording a plurality of lip movement patterns of the speaker of interest; generating voice activity detection data from the plurality of lip movement patterns; recording voice audio data; and generating noise-reduced voice audio data, wherein generating the noise-reduced voice audio data uses the voice activity detection data to isolate voice audio within the recorded voice audio data corresponding to the speaker of interest. | 1. A method comprising: providing a graphical user interface in a user field of vision for a user to identify and select a speaker of interest from a plurality of speakers; recording a plurality of lip movement patterns of the speaker of interest; generating voice activity detection data from the plurality of lip movement patterns; recording voice audio data; and generating noise-reduced voice audio data, wherein generating the noise-reduced voice audio data uses the voice activity detection data to isolate voice audio within the recorded voice audio data corresponding to the speaker of interest. 3. The method of claim 1 , further comprising: transmitting the noise-reduced voice audio data to a hearing aid worn by the user. | 0.861884 |
8,201,085 | 1 | 2 | 1. A computer-based method for preparing a document for publication, the method comprising: receiving an electronic document previously prepared by an author using a markup formatting structure, the electronic document including a set of cited references and having a descriptive metadata associated with a set of components of the set of cited references embedded in accordance with the markup formatting structure; and executing on the electronic document a reference validation process adapted to recognize the markup formatting structure and the embedded metadata and further adapted to extract the embedded metadata and compare the extracted metadata against a set of at least one authority database to determine the validity of the set of cited references. | 1. A computer-based method for preparing a document for publication, the method comprising: receiving an electronic document previously prepared by an author using a markup formatting structure, the electronic document including a set of cited references and having a descriptive metadata associated with a set of components of the set of cited references embedded in accordance with the markup formatting structure; and executing on the electronic document a reference validation process adapted to recognize the markup formatting structure and the embedded metadata and further adapted to extract the embedded metadata and compare the extracted metadata against a set of at least one authority database to determine the validity of the set of cited references. 2. The method of claim 1 further comprising generating an output comprising data representing the validity determination. | 0.87996 |
8,996,377 | 1 | 2 | 1. A method for blending recorded speech with text-to-speech (TTS) for specific domains, comprising: receiving input text; identifying a domain from the input text; determining a static part from the input text that has previously been recorded and stored within a data store, wherein determining the static part comprises detecting the static part based on recorded units for the identified domain; determining a dynamic part from the input text; and blending the static part with the dynamic part within a TTS engine. | 1. A method for blending recorded speech with text-to-speech (TTS) for specific domains, comprising: receiving input text; identifying a domain from the input text; determining a static part from the input text that has previously been recorded and stored within a data store, wherein determining the static part comprises detecting the static part based on recorded units for the identified domain; determining a dynamic part from the input text; and blending the static part with the dynamic part within a TTS engine. 2. The method of claim 1 , wherein blending the static part with the dynamic part within the TTS engine comprises smoothing an acoustic trajectory of a transition between the static part and the dynamic part based on the recorded units for the static part and a predicted trajectory. | 0.80643 |
8,670,975 | 13 | 14 | 13. A method, comprising: processing, by a computing device, a bilingual web page into bilingual snippet pairs; linking, by the computing device, the bilingual snippet pairs into a plurality of translation snippet pairs using an alignment model, the alignment model including a bilingual dictionary or a transliteration model; determining, by the computing device, one or more best fit candidate patterns from a plurality of candidate patterns based at least in part on the plurality of translation snippet pairs, wherein the plurality of candidate patterns is produced from one or more of the plurality of translation snippet pairs; mining, by the computing device, one or more translation pairs from the bilingual web page using the one or more best fit candidate patterns; and storing, by the computing device, the one or more translation pairs into the alignment model, wherein the one or more translation pairs including at least one of a term pair, a phrase pair, or a sentence pair. | 13. A method, comprising: processing, by a computing device, a bilingual web page into bilingual snippet pairs; linking, by the computing device, the bilingual snippet pairs into a plurality of translation snippet pairs using an alignment model, the alignment model including a bilingual dictionary or a transliteration model; determining, by the computing device, one or more best fit candidate patterns from a plurality of candidate patterns based at least in part on the plurality of translation snippet pairs, wherein the plurality of candidate patterns is produced from one or more of the plurality of translation snippet pairs; mining, by the computing device, one or more translation pairs from the bilingual web page using the one or more best fit candidate patterns; and storing, by the computing device, the one or more translation pairs into the alignment model, wherein the one or more translation pairs including at least one of a term pair, a phrase pair, or a sentence pair. 14. The method of claim 13 , further comprising providing one or more translations between a first language and a second language based on a translation pair. | 0.863558 |
9,483,453 | 1 | 8 | 1. A method of displaying clips comprising the steps of: displaying a document, the document stored at a source location; receiving, within a current access session, a first user input that creates a first annotation of displayed active first content from within the displayed document, wherein there exists a link to the active first content, the active first content is non-static content, and the first annotation is displayed within the displayed document; receiving, within the current access session, a second user input that creates a second annotation of displayed second content within the displayed document, wherein there exists a link to the second content, and the second annotation is displayed within the displayed document; storing the first annotation as displayed in the current access session together with a static image of the displayed active first content from the current access session; storing the link to the active first content, wherein the link to the active first content refers to the source location; storing the second annotation as displayed in the current access session together with an image of the displayed second content; storing the link to the second content, wherein the link to the second content refers to the source location; responsive to a user request, combining the stored first annotation and the stored second annotation based on a criterion; rendering an image by retrieving a clip comprising the combination of the stored first annotation and the static image of the active first content and the stored second annotation and the image of the second content; and displaying the rendered clip, wherein selection of said first annotation in said clip accesses the active first content via the stored link to the active first content. | 1. A method of displaying clips comprising the steps of: displaying a document, the document stored at a source location; receiving, within a current access session, a first user input that creates a first annotation of displayed active first content from within the displayed document, wherein there exists a link to the active first content, the active first content is non-static content, and the first annotation is displayed within the displayed document; receiving, within the current access session, a second user input that creates a second annotation of displayed second content within the displayed document, wherein there exists a link to the second content, and the second annotation is displayed within the displayed document; storing the first annotation as displayed in the current access session together with a static image of the displayed active first content from the current access session; storing the link to the active first content, wherein the link to the active first content refers to the source location; storing the second annotation as displayed in the current access session together with an image of the displayed second content; storing the link to the second content, wherein the link to the second content refers to the source location; responsive to a user request, combining the stored first annotation and the stored second annotation based on a criterion; rendering an image by retrieving a clip comprising the combination of the stored first annotation and the static image of the active first content and the stored second annotation and the image of the second content; and displaying the rendered clip, wherein selection of said first annotation in said clip accesses the active first content via the stored link to the active first content. 8. The method according to claim 1 , further comprising utilizing a storage for storing said first annotation and said active first content. | 0.863813 |
9,697,867 | 12 | 17 | 12. An interactive adaptive narrative presentation method, comprising: generating, by an adaptive narration presentation circuit, a narrative presentation output at a communicably coupled communications interface; receiving, by the adaptive narration presentation circuit, a signal containing data indicative of an object placed in a field-of-view of at least one optical sensor communicably coupled to the adaptive narrative presentation system; concurrent with the narrative presentation, optically identifying, by the adaptive narration presentation circuit, the object based at least in part on at least one intrinsic characteristic of the object; autonomously identifying, by the adaptive narration presentation circuit, at least one aspect of the narrative presentation associated with the identified object; and modifying, by the adaptive narration presentation circuit, the at least one aspect of the narrative presentation based at least in part on the identified object. | 12. An interactive adaptive narrative presentation method, comprising: generating, by an adaptive narration presentation circuit, a narrative presentation output at a communicably coupled communications interface; receiving, by the adaptive narration presentation circuit, a signal containing data indicative of an object placed in a field-of-view of at least one optical sensor communicably coupled to the adaptive narrative presentation system; concurrent with the narrative presentation, optically identifying, by the adaptive narration presentation circuit, the object based at least in part on at least one intrinsic characteristic of the object; autonomously identifying, by the adaptive narration presentation circuit, at least one aspect of the narrative presentation associated with the identified object; and modifying, by the adaptive narration presentation circuit, the at least one aspect of the narrative presentation based at least in part on the identified object. 17. The method of claim 12 , further comprising: identifying, by the adaptive narrative presentation circuit, a number of permissible aspect changes in the narrative presentation upon identification of the object; and autonomously selecting, by the adaptive narrative presentation circuit, one of the number of permissible aspect changes in the narrative presentation based at least in part on the at least one aspect of the narrative presentation associated with the identified object. | 0.651862 |
7,898,546 | 6 | 12 | 6. A method of designing a graphics processing unit, comprising: receiving an abstract model of a graphics system having a class of commands and a set of state variables; and semantically processing said abstract model to generate validation logic for said class of commands utilizing a reduced memory space shadow memory having a memory size smaller than that of a memory size associated with storing a full representation of said set of state variables, wherein said semantic processing comprises semantic processing and parsing validation checks to determine a subset of said set of state variables required for validation. | 6. A method of designing a graphics processing unit, comprising: receiving an abstract model of a graphics system having a class of commands and a set of state variables; and semantically processing said abstract model to generate validation logic for said class of commands utilizing a reduced memory space shadow memory having a memory size smaller than that of a memory size associated with storing a full representation of said set of state variables, wherein said semantic processing comprises semantic processing and parsing validation checks to determine a subset of said set of state variables required for validation. 12. The method of claim 6 , wherein said semantic processing comprises: receiving an engine tile defining attributes of a graphics pipeline; receiving a master file defining said class of commands and said abstract model; generating a front end having an interface for converting said class of commands into instructions for said graphics pipeline, said front-end including said validation logic and a reduced memory space shadow memory. | 0.579808 |
7,650,286 | 93 | 94 | 93. The computer program product of claim 92 , the computer readable medium further storing: program code for setting the term of experience to zero when the experience range is zero; program code for determining a start time for the experience range when the experience range is greater than zero; program code for determining an end time for the experience range when the experience range is greater than zero; program code for computing a time difference between the start time and the end time when the experience range is greater than zero; and program code for setting the term of experience to the time difference when the experience range is greater than zero. | 93. The computer program product of claim 92 , the computer readable medium further storing: program code for setting the term of experience to zero when the experience range is zero; program code for determining a start time for the experience range when the experience range is greater than zero; program code for determining an end time for the experience range when the experience range is greater than zero; program code for computing a time difference between the start time and the end time when the experience range is greater than zero; and program code for setting the term of experience to the time difference when the experience range is greater than zero. 94. The computer program product of claim 93 , wherein the program code for setting the term of experience to the time difference further comprises: program code for computing a repeated entry time difference for the required skill or experience-related phrase for each said at least one job requirement that is a repeated entry and is associated with an other experience range; and program code for adding to the time difference each repeated entry time difference, wherein the other experience range includes an other start time and an other end time, wherein the start time precedes the end time, wherein the other start time precedes the other end time, and wherein the other end time either precedes or is equal to the start time, or the other start time either succeeds or is equal to the end time. | 0.802651 |
5,544,285 | 9 | 10 | 9. The computer program product of claim 7 wherein said display includes plural display elements and, said system further includes means recorded on said data storage medium responsive to replication of said data field for repositioning one or more of said display elements positioned in a predetermined direction from said replication function indicator. | 9. The computer program product of claim 7 wherein said display includes plural display elements and, said system further includes means recorded on said data storage medium responsive to replication of said data field for repositioning one or more of said display elements positioned in a predetermined direction from said replication function indicator. 10. The computer program product of claim 9 further including .means recorded on said data storage medium responsive to replication of said data field for storing positions of said one or more display elements. | 0.949029 |
8,923,838 | 1 | 2 | 1. A method for activating a cellular phone account utilizing automated speech recognition, comprising: receiving a plurality of user supplied information over a network utilizing automated speech recognition; storing the information in a memory database; and determining if the stored information is sufficient for cellular phone activation, wherein if sufficient, automatically activating the cellular phone account based on the information received utilizing the automated speech recognition, and wherein, if not sufficient, continuing to store the information in the memory database without activating the cellular phone and allowing the user to resume an interrupted activation session without repeating the previously stored information. | 1. A method for activating a cellular phone account utilizing automated speech recognition, comprising: receiving a plurality of user supplied information over a network utilizing automated speech recognition; storing the information in a memory database; and determining if the stored information is sufficient for cellular phone activation, wherein if sufficient, automatically activating the cellular phone account based on the information received utilizing the automated speech recognition, and wherein, if not sufficient, continuing to store the information in the memory database without activating the cellular phone and allowing the user to resume an interrupted activation session without repeating the previously stored information. 2. The method as recited in claim 1 , wherein in response to a predetermined criteria being met, connecting to a human for information collection. | 0.963627 |
8,578,264 | 1 | 2 | 1. A method for providing suggested tags associated with a target web page for manipulation by a user in a tag-based online bookmark system, comprising: generating in memory of a computer a list of keywords associated with a target web page as suggested tags for the target web page; adding said keywords as suggested tags for the target web page into said target web page by generating a tagged hypertext markup language (HTML) file and transforming said tagged HTML file bearing said keywords into a transformed hypertext markup language (HTML) file; creating a new transparent or semi-transparent window overlaying an original window displaying said target web page, said new window renders said transformed HTML file comprising said keywords as a suggestion set of tags for selection by an end user; and, rendering the new window over the original window; wherein said generating, adding and creating is performed in a background process in the computer; wherein said new window comprises an input region and a send button, and wherein said suggested tags are movable to the input region by clicking said tags, and sent to a server side of said bookmark system upon clicking said send button; and wherein the suggested tags that exist in the web page of the original window are rendered in the new window right on the top of the tags of the web page of the original window. | 1. A method for providing suggested tags associated with a target web page for manipulation by a user in a tag-based online bookmark system, comprising: generating in memory of a computer a list of keywords associated with a target web page as suggested tags for the target web page; adding said keywords as suggested tags for the target web page into said target web page by generating a tagged hypertext markup language (HTML) file and transforming said tagged HTML file bearing said keywords into a transformed hypertext markup language (HTML) file; creating a new transparent or semi-transparent window overlaying an original window displaying said target web page, said new window renders said transformed HTML file comprising said keywords as a suggestion set of tags for selection by an end user; and, rendering the new window over the original window; wherein said generating, adding and creating is performed in a background process in the computer; wherein said new window comprises an input region and a send button, and wherein said suggested tags are movable to the input region by clicking said tags, and sent to a server side of said bookmark system upon clicking said send button; and wherein the suggested tags that exist in the web page of the original window are rendered in the new window right on the top of the tags of the web page of the original window. 2. The method according to claim 1 , wherein said transforming step transforms said tagged HTML file bearing said keywords into said transformed HTML file by utilizing a layer stylesheet written in XSL transformation (XSLT) language, and wherein said layer stylesheet is used to define the stylesheet of said layer. | 0.730308 |
9,390,376 | 1 | 7 | 1. A distributed machine learning system, comprising: a plurality of distributed learning environments in communication over a network, wherein each environment comprises: a computing device having a memory and a processor coupled to the memory, the processor adapted to implement a learning environment via one or more agents in a rules-based system, wherein the agents learn to perform tasks in their respective learning environment to develop knowledge; a storage in which knowledge comprising a plurality of rule sets developed by the agents for performing the tasks are stored, wherein the knowledge is tagged to facilitate identification, storage and retrieval; an ontology that is weighted to provide, in response to at least one request by the one or more agents, classification of at least a close choice of knowledge to share rule sets developed by the agents in the plurality of distributed learning environments for implementing tasks which are related, but not necessarily the same so that matched parts from the at least close choice of the knowledge provided from at least one sending agent is included with an unmatched part of the rule sets of at least one requesting agent, wherein the at least close choice of knowledge comprising a highest score indicating a level of match of the capabilities between a desired and an available rules lists and providing classification comprises tagging the knowledge with words that define what it does using an ontology-based tagging system; an interface for sharing at least one of the tagged knowledge and the at least close choice of knowledge with other agents throughout the plurality of distributed learning environments when the at least one requesting agent requests at least one of the tagged knowledge and the close choice of knowledge. | 1. A distributed machine learning system, comprising: a plurality of distributed learning environments in communication over a network, wherein each environment comprises: a computing device having a memory and a processor coupled to the memory, the processor adapted to implement a learning environment via one or more agents in a rules-based system, wherein the agents learn to perform tasks in their respective learning environment to develop knowledge; a storage in which knowledge comprising a plurality of rule sets developed by the agents for performing the tasks are stored, wherein the knowledge is tagged to facilitate identification, storage and retrieval; an ontology that is weighted to provide, in response to at least one request by the one or more agents, classification of at least a close choice of knowledge to share rule sets developed by the agents in the plurality of distributed learning environments for implementing tasks which are related, but not necessarily the same so that matched parts from the at least close choice of the knowledge provided from at least one sending agent is included with an unmatched part of the rule sets of at least one requesting agent, wherein the at least close choice of knowledge comprising a highest score indicating a level of match of the capabilities between a desired and an available rules lists and providing classification comprises tagging the knowledge with words that define what it does using an ontology-based tagging system; an interface for sharing at least one of the tagged knowledge and the at least close choice of knowledge with other agents throughout the plurality of distributed learning environments when the at least one requesting agent requests at least one of the tagged knowledge and the close choice of knowledge. 7. The distributed machine learning system of claim 1 , wherein the knowledge is also metatagged with one or more higher levels in an ontology of behavior. | 0.810976 |
5,404,528 | 13 | 15 | 13. A method according to claim 1, wherein script commands include commands to execute utility functions. | 13. A method according to claim 1, wherein script commands include commands to execute utility functions. 15. A method according to claim 13, wherein the utility functions include a function to invoke another script. | 0.96463 |
8,924,209 | 1 | 15 | 1. A method to identify a spoken command comprising voiced and unvoiced intervals in a particular order, and to responsively select an action from a set of predetermined actions, said method comprising the steps: 3.1 Converting sound of the spoken command into a digital signal comprising periodic digital measurements of the sound using a transducer and a converter; 3.2 Analyzing the digital signal to detect slow variations therein, by deriving an integrated signal by additively combining successive digital measurements, and comparing the integrated signal to a slow-variation threshold, a slow variation being detected when the integrated signal exceeds the slow-variation threshold; 3.3 Analyzing the digital signal to detect fast variations therein, by deriving a differentiated signal by subtractively combining successive digital measurements, and comparing the differentiated signal to a fast-variation threshold, a fast variation being detected when the differentiated signal exceeds the fast-variation threshold; 3.4 Analyzing the slow variations to detect voiced intervals having voiced sound, and analyzing the fast variations to detect unvoiced intervals having unvoiced sound; 3.5 Preparing a command sequence indicating the order of voiced and unvoiced intervals in the spoken command; 3.6 Comparing the command sequence to templates that indicate the order of voiced and unvoiced intervals in acceptable commands using a computer, each template being associated with one action in the set of predetermined actions; 3.7 And, when the command matches one of the templates, selecting the action associated with the matched template. | 1. A method to identify a spoken command comprising voiced and unvoiced intervals in a particular order, and to responsively select an action from a set of predetermined actions, said method comprising the steps: 3.1 Converting sound of the spoken command into a digital signal comprising periodic digital measurements of the sound using a transducer and a converter; 3.2 Analyzing the digital signal to detect slow variations therein, by deriving an integrated signal by additively combining successive digital measurements, and comparing the integrated signal to a slow-variation threshold, a slow variation being detected when the integrated signal exceeds the slow-variation threshold; 3.3 Analyzing the digital signal to detect fast variations therein, by deriving a differentiated signal by subtractively combining successive digital measurements, and comparing the differentiated signal to a fast-variation threshold, a fast variation being detected when the differentiated signal exceeds the fast-variation threshold; 3.4 Analyzing the slow variations to detect voiced intervals having voiced sound, and analyzing the fast variations to detect unvoiced intervals having unvoiced sound; 3.5 Preparing a command sequence indicating the order of voiced and unvoiced intervals in the spoken command; 3.6 Comparing the command sequence to templates that indicate the order of voiced and unvoiced intervals in acceptable commands using a computer, each template being associated with one action in the set of predetermined actions; 3.7 And, when the command matches one of the templates, selecting the action associated with the matched template. 15. The method of claim 1 which further suppresses detection of unvoiced intervals while a voiced interval is present, by further including in Step 3.4 the steps: 18.1 Preparing an unvoiced tally counter, an unvoiced tally threshold which is variable, a predetermined lower value, and a predetermined upper value which is higher than the lower value; 18.2 Incrementing the unvoiced tally counter when each fast variation is detected, and decrementing the unvoiced tally counter periodically; 18.3 Setting the unvoiced tally threshold equal to the upper value when a voiced interval is recognized, and setting the unvoiced tally threshold equal to the lower value when the voiced interval ends; 18.4 And detecting an unvoiced interval when the unvoiced tally counter exceeds the unvoiced tally threshold so obtained. | 0.599705 |
7,559,015 | 10 | 12 | 10. A data processing method, performed by a computer system, for processing media content comprised of a plurality of scenes, said method comprising: inputting context description data including a plurality of segments each for describing one of said plurality of scenes of media content, said context description data including: a context attribute having a value for describing a context of said media content, and a plurality of importance attributes each associated with one of said segments and having a value representing a degree of contextual importance of said corresponding one of said segments; and outputting at least one of said segments based on at least one of said importance attributes, wherein said context description data further includes a plurality of time attributes each associated with a corresponding one of said segments for determining a start time and one of an end time or a duration of the scene associated with said corresponding segment. | 10. A data processing method, performed by a computer system, for processing media content comprised of a plurality of scenes, said method comprising: inputting context description data including a plurality of segments each for describing one of said plurality of scenes of media content, said context description data including: a context attribute having a value for describing a context of said media content, and a plurality of importance attributes each associated with one of said segments and having a value representing a degree of contextual importance of said corresponding one of said segments; and outputting at least one of said segments based on at least one of said importance attributes, wherein said context description data further includes a plurality of time attributes each associated with a corresponding one of said segments for determining a start time and one of an end time or a duration of the scene associated with said corresponding segment. 12. The data processing method according to claim 10 , wherein said context description data includes supplemental information. | 0.957239 |
10,002,124 | 5 | 6 | 5. The method of claim 1 further comprising training the verb/type lookup resource using a type database resource and a corpus of information. | 5. The method of claim 1 further comprising training the verb/type lookup resource using a type database resource and a corpus of information. 6. The method of claim 5 , wherein training the verb/type lookup resource comprises, for each sentence in the corpus of information: annotating the sentence with a verb, a database entity, and a syntactic relation between the verb and the database entity; responsive to determining an entry for the verb and syntactic relation does not exist in the verb/type lookup resource, create an entry for the verb and syntactic relation with a class of the database entity and an integer count of one; and responsive to determining an entry for the verb and syntactic relation exists in the verb/type lookup resource, increment an integer count for a class of the database entity in the entry. | 0.843978 |
7,894,596 | 1 | 8 | 1. A method of providing language interpretation comprising: providing a language interpretation number that services multiple languages, wherein the language interpretation number can be used to place a telephone call for language interpretation; receiving a language interpretation telephone call at a language interpretation provider from a caller speaking a first language, wherein the caller places the language interpretation telephone call by dialing the language interpretation number; identifying a business need of the caller; determining a group of business entities that can each satisfy the business need of the caller; selecting, from the group of business entities, a first business entity that is a subscriber for a subscription fee to the language interpretation provider for language interpretation for the first business entity over a second business entity that is not a subscriber for a subscription fee to the language interpretation provider for language interpretation for the second business entity; identifying an interpreter that can interpret between the first language and a second language spoken by an agent of the first business entity; and telephonically engaging the interpreter and the agent of the first business entity in the language interpretation telephone call, wherein the interpreter interprets a conversation between the caller and the agent of the first business entity. | 1. A method of providing language interpretation comprising: providing a language interpretation number that services multiple languages, wherein the language interpretation number can be used to place a telephone call for language interpretation; receiving a language interpretation telephone call at a language interpretation provider from a caller speaking a first language, wherein the caller places the language interpretation telephone call by dialing the language interpretation number; identifying a business need of the caller; determining a group of business entities that can each satisfy the business need of the caller; selecting, from the group of business entities, a first business entity that is a subscriber for a subscription fee to the language interpretation provider for language interpretation for the first business entity over a second business entity that is not a subscriber for a subscription fee to the language interpretation provider for language interpretation for the second business entity; identifying an interpreter that can interpret between the first language and a second language spoken by an agent of the first business entity; and telephonically engaging the interpreter and the agent of the first business entity in the language interpretation telephone call, wherein the interpreter interprets a conversation between the caller and the agent of the first business entity. 8. The method of claim 1 , further comprising establishing a billing that accounts a time count accruing from a time at which the interpreter is engaged until a time at which the agent representing a merchant is engaged. | 0.66967 |
8,731,934 | 5 | 8 | 5. The system according to claim 1 , wherein the event detection processor comprises an entity identification processor configured to analyze at least the transcript of the monitored telephone conversation to identify one or more entities mentioned during the monitored telephone conversation, further comprising at least one entity database coupled to the event detection processor. | 5. The system according to claim 1 , wherein the event detection processor comprises an entity identification processor configured to analyze at least the transcript of the monitored telephone conversation to identify one or more entities mentioned during the monitored telephone conversation, further comprising at least one entity database coupled to the event detection processor. 8. The system according to claim 5 , wherein the entity identification processor is configured to search the at least one entity database using one or more Viterbi search algorithms to identify one or more entities mentioned during the monitored telephone conversation. | 0.909549 |
8,412,782 | 15 | 16 | 15. The method of claim 14 , wherein: the inserting the tags in the email contents is executed once only when a user sends or saves the email. | 15. The method of claim 14 , wherein: the inserting the tags in the email contents is executed once only when a user sends or saves the email. 16. The method of claim 15 , wherein: when a user clicks a send button to send the email, texts in various styles are translated into contents with corresponding tags and then an original sending function of the email client is called. | 0.946567 |
9,984,585 | 7 | 11 | 7. A system for constructive response grading implemented using a hardware processor, the system comprising: a memory having computer readable instructions stored therein; and a candidate response module stored in the memory and operable to receive electronically recorded speech samples, wherein the electronically recorded speech samples include a plurality of responses of one or more candidates from a plurality of data processing devices associated with the one or more candidates, wherein the plurality of responses are stored in the memory; a crowdsourcing engine stored in the memory and operable to (1) provide the electronically recorded speech samples to crowdsource volunteers and (2) receive a crowdsourced transcription and crowd scores from each of the crowdsource volunteers for one or more of a plurality of features for each of the plurality of responses of the one or more candidates, wherein the plurality of features are a function of pronunciation, fluency, content organization, and grammar; a force alignment engine stored in the memory and operable to automatically combine, with a transcription combination algorithm, crowdsourced transcriptions from each of the crowdsource volunteers to form a combined transcription; a feature generation machine learning module stored in the memory and operable to generate, for each of the plurality of responses of the one or more candidates, individual scores for a first feature pertaining to grades given by the crowdsource volunteers and second features generated by force aligning free speech on the crowdsourced transcriptions and natural language processing features from the crowdsourced transcriptions, a machine learning module stored in the memory and operable to (1) generate a composite score for each of the plurality of responses of the one or more candidates based on the individual scores for each of the plurality of features together with the crowd scores given by the crowdsource volunteers, (2) communicate the individual scores and the composite score through a communication interface to each candidate of the one or more candidates; (3) provide the crowdsource volunteers with gold standard tasks with known answers; (4) compare crowdsource answers from the crowdsource volunteers to the known answers; (5) assign a respective risk level to each of the crowdsource volunteers based on a comparison of the crowdsource answers to the known answers; and (6) responsive to the respective risk level exceeding a predetermined risk threshold, automatically remove a corresponding crowdsource volunteer from evaluations of the electronically recorded speech samples. | 7. A system for constructive response grading implemented using a hardware processor, the system comprising: a memory having computer readable instructions stored therein; and a candidate response module stored in the memory and operable to receive electronically recorded speech samples, wherein the electronically recorded speech samples include a plurality of responses of one or more candidates from a plurality of data processing devices associated with the one or more candidates, wherein the plurality of responses are stored in the memory; a crowdsourcing engine stored in the memory and operable to (1) provide the electronically recorded speech samples to crowdsource volunteers and (2) receive a crowdsourced transcription and crowd scores from each of the crowdsource volunteers for one or more of a plurality of features for each of the plurality of responses of the one or more candidates, wherein the plurality of features are a function of pronunciation, fluency, content organization, and grammar; a force alignment engine stored in the memory and operable to automatically combine, with a transcription combination algorithm, crowdsourced transcriptions from each of the crowdsource volunteers to form a combined transcription; a feature generation machine learning module stored in the memory and operable to generate, for each of the plurality of responses of the one or more candidates, individual scores for a first feature pertaining to grades given by the crowdsource volunteers and second features generated by force aligning free speech on the crowdsourced transcriptions and natural language processing features from the crowdsourced transcriptions, a machine learning module stored in the memory and operable to (1) generate a composite score for each of the plurality of responses of the one or more candidates based on the individual scores for each of the plurality of features together with the crowd scores given by the crowdsource volunteers, (2) communicate the individual scores and the composite score through a communication interface to each candidate of the one or more candidates; (3) provide the crowdsource volunteers with gold standard tasks with known answers; (4) compare crowdsource answers from the crowdsource volunteers to the known answers; (5) assign a respective risk level to each of the crowdsource volunteers based on a comparison of the crowdsource answers to the known answers; and (6) responsive to the respective risk level exceeding a predetermined risk threshold, automatically remove a corresponding crowdsource volunteer from evaluations of the electronically recorded speech samples. 11. The system of claim 7 , wherein the force alignment engine is further operable to perform force alignment on the crowdsource transcriptions to derive speech quality features from the crowdsourced transcriptions and wherein the individual scores and the composite score are further based on the speech quality features. | 0.501548 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.