Datasets:

patent

/

AIPD_nlp_sbert_dataset

like 0

1. A method of abstracting an object model, the method comprising: receiving an object model specification defining application semantics for an application to access, via invocations, objects identified in the object model specification; applying a categorical-based generator that applies at least one morphism to the object model specification, application of the categorical-based generator generating: i) an abstraction interface object model, the abstraction interface object model preserving application semantics defined within the object model specification and being independent of a middleware object access mechanism used to access data within objects corresponding to the object model specification; and ii) an implementation of the abstraction interface object model for a particular middleware object access mechanism used to access data within objects corresponding to the object model specification; wherein object model specification is defined in an interface description language (IDL) that includes a plurality of IDL types; and wherein applying a categorical-based generator that applies at least one morphism to the object model specification comprises: visiting each IDL type defined in the IDL once; for each IDL type visited applying the at least one morphism to map the IDL type one-to-one and onto into application types by defining at least one corresponding morphism for that type within the abstraction interface object model, the corresponding morphism preserving inheritance among application interfaces defined in the abstraction interface object model and preserving all relationships among the application interfaces; and for each type in the object model specification, defining two morphisms, h( ) and hh( ), with common implementations, but each having different return types, the return type of morphism hh( ) being a categorical return type corresponding to a middleware-specific type, the return type of the morphism h( ) anonymizing the middleware-specific type into a language type generic to the application.

1. A method of abstracting an object model, the method comprising: receiving an object model specification defining application semantics for an application to access, via invocations, objects identified in the object model specification; applying a categorical-based generator that applies at least one morphism to the object model specification, application of the categorical-based generator generating: i) an abstraction interface object model, the abstraction interface object model preserving application semantics defined within the object model specification and being independent of a middleware object access mechanism used to access data within objects corresponding to the object model specification; and ii) an implementation of the abstraction interface object model for a particular middleware object access mechanism used to access data within objects corresponding to the object model specification; wherein object model specification is defined in an interface description language (IDL) that includes a plurality of IDL types; and wherein applying a categorical-based generator that applies at least one morphism to the object model specification comprises: visiting each IDL type defined in the IDL once; for each IDL type visited applying the at least one morphism to map the IDL type one-to-one and onto into application types by defining at least one corresponding morphism for that type within the abstraction interface object model, the corresponding morphism preserving inheritance among application interfaces defined in the abstraction interface object model and preserving all relationships among the application interfaces; and for each type in the object model specification, defining two morphisms, h( ) and hh( ), with common implementations, but each having different return types, the return type of morphism hh( ) being a categorical return type corresponding to a middleware-specific type, the return type of the morphism h( ) anonymizing the middleware-specific type into a language type generic to the application. 12. The method of claim 1 wherein applying a categorical-based generator that applies at least one morphism to the object model specification comprises: for each middleware-specific type in the object model specification, performing a reflection technique and emitting corresponding types in the abstraction interface object model and in the implementation of the abstraction interface object model.

1. A method for enabling generation of text on a handheld electronic device comprising a processor, a plurality of keys and a memory, a least some of the keys each having a number of linguistic elements assigned thereto, and the memory having a plurality of language objects stored therein, the method comprising: enabling, by the processor, detection of a number of key selections corresponding with an ambiguous input; setting, by the processor, a threshold, the threshold having a value of at east two; only after the processor determines that the number of key selections is greater than or equal to the threshold, generating, by the processor, a first set of predicted language objects corresponding to the ambiguous input; and providing, by the processor, at a text input location an output comprising a first predicted language object selected from the first set of predicted language objects.

1. A method for enabling generation of text on a handheld electronic device comprising a processor, a plurality of keys and a memory, a least some of the keys each having a number of linguistic elements assigned thereto, and the memory having a plurality of language objects stored therein, the method comprising: enabling, by the processor, detection of a number of key selections corresponding with an ambiguous input; setting, by the processor, a threshold, the threshold having a value of at east two; only after the processor determines that the number of key selections is greater than or equal to the threshold, generating, by the processor, a first set of predicted language objects corresponding to the ambiguous input; and providing, by the processor, at a text input location an output comprising a first predicted language object selected from the first set of predicted language objects. 4. The method of claim 1 , further comprising: providing at a variant component location an output comprising a subset of the first set of predicted language objects.

9. A computing system having one or more physical computing devices and, comprising: one or more memories; a relationship search engine stored in the one or more memories and configured, when invoked, to execute an indicated relationship search and to return search results; a query template engine stored in the one or more memories and configured, when invoked, to retrieve one or more query templates that match at least one of an indicated entity, entity type, topic, concept, ontology path, action, action type, or link; cause the relationship search engine to be invoked with one or more relationship searches that are included in the one or more retrieved query templates, at least one of the relationship searches included in the one or more retrieved query templates specifying an output specification that indicates how search results of the associated relationship search are to be presented; and forward relationship search results received from the relationship search engine for further presentation, wherein the search results of the at least one of the relationship searches are forwarded according to the output specification specified by the at least one of the relationship searches.

9. A computing system having one or more physical computing devices and, comprising: one or more memories; a relationship search engine stored in the one or more memories and configured, when invoked, to execute an indicated relationship search and to return search results; a query template engine stored in the one or more memories and configured, when invoked, to retrieve one or more query templates that match at least one of an indicated entity, entity type, topic, concept, ontology path, action, action type, or link; cause the relationship search engine to be invoked with one or more relationship searches that are included in the one or more retrieved query templates, at least one of the relationship searches included in the one or more retrieved query templates specifying an output specification that indicates how search results of the associated relationship search are to be presented; and forward relationship search results received from the relationship search engine for further presentation, wherein the search results of the at least one of the relationship searches are forwarded according to the output specification specified by the at least one of the relationship searches. 14. The computing system of claim 9 wherein at least some of the query templates are generated by an interactive interface or by editing existing query templates.

5. A user interface device comprising: a speech rendering module for performing speech synthesis on a text; an audio output unit for outputting synthesized speech data corresponding to the text processed by the speech rendering module; a speech recognition module for recognizing a first speech command of a user for indicating the start of a first selected range of the text and a second speech command of the user for indicating the end of the first selected range during output of the synthesized speech data; a speech interpretation module for interpreting the first speech command and the second speech command received from the speech recognition module; and a controller for executing an application including the text, specifying the first selected range according to the first speech command and the second speech command interpreted by the speech interpretation module, wherein a word or a phrase, which is determined according to an attribute of the executed application, included in the output speech-synthesized text is sequentially highlighted, wherein the speech recognition module further recognizes: a third speech command for repeatedly outputting the specified first selected range, a fourth speech command indicating the start of a second selected range, and a fifth speech command indicating the end of the first second selected range, wherein the controller re-specifies the second selected range within the specified first selected range after specifying the first selected range in response to the third speech command through the fifth speech command.

5. A user interface device comprising: a speech rendering module for performing speech synthesis on a text; an audio output unit for outputting synthesized speech data corresponding to the text processed by the speech rendering module; a speech recognition module for recognizing a first speech command of a user for indicating the start of a first selected range of the text and a second speech command of the user for indicating the end of the first selected range during output of the synthesized speech data; a speech interpretation module for interpreting the first speech command and the second speech command received from the speech recognition module; and a controller for executing an application including the text, specifying the first selected range according to the first speech command and the second speech command interpreted by the speech interpretation module, wherein a word or a phrase, which is determined according to an attribute of the executed application, included in the output speech-synthesized text is sequentially highlighted, wherein the speech recognition module further recognizes: a third speech command for repeatedly outputting the specified first selected range, a fourth speech command indicating the start of a second selected range, and a fifth speech command indicating the end of the first second selected range, wherein the controller re-specifies the second selected range within the specified first selected range after specifying the first selected range in response to the third speech command through the fifth speech command. 7. The user interface device according to claim 5 , wherein the speech rendering module performs speech synthesis on the selected range of the text and outputs synthesized speech, and wherein the speech interpretation module interprets the third speech command to the fifth speech command.

30. A system to estimate performance of a model to filter documents according to quality comprising: A) a storage device; B) at least one processor to implement the following steps: C) obtaining from the storage device a set of documents labeled according to content quality; D) extracting and representing features from the set of documents; E) modifying the extracted represented features; F) constructing models to estimate performance for labeling documents based on content quality using pattern recognition algorithms stored in the storage device consisting of the following steps; 1) dividing the set of documents into N subsets such that the union of all the subsets is the set of documents; 2) processing each of the N subsets comprising the following steps: a) defining a first set of documents, a second set of documents, and a third set of documents in the subset; b) choosing at least one pattern recognition algorithm; i) instantiating a set of parameters for the pattern recognition algorithm; a′) training the pattern recognition algorithm to build a model using the first set of documents and the parameter set; b′) applying the model to the second set of documents to obtain labels and scores for each document; c′) evaluating the labels and scores; d′) storing the evaluation measure, set of parameters, and current pattern recognition algorithm; and e′) repeating step i) until all appropriate sets of parameters for the pattern recognition algorithm have been applied; and c) repeating step 2b) until all pattern recognition algorithm have been applied; d) aggregating the evaluation measures, the pattern recognition algorithms with the set of parameters; e) selecting the parameter set and pattern recognition algorithm with an aggregate evaluation measure that meets a selection criteria; f) applying the parameter set and the pattern recognition algorithm identified from step e) to the union of the first and second subset to form an intermediate final model; g) applying the intermediate final model to the third set of documents to obtain labels and scores for each document; h) evaluating the labels and scores; i) storing the intermediate evaluation measure; j) repeating step 2 until all subsets have been applied; and 3) aggregating the intermediate evaluation measures to form an aggregate evaluation measure; and 4) displaying the aggregate evaluation measure as the estimated performance.

30. A system to estimate performance of a model to filter documents according to quality comprising: A) a storage device; B) at least one processor to implement the following steps: C) obtaining from the storage device a set of documents labeled according to content quality; D) extracting and representing features from the set of documents; E) modifying the extracted represented features; F) constructing models to estimate performance for labeling documents based on content quality using pattern recognition algorithms stored in the storage device consisting of the following steps; 1) dividing the set of documents into N subsets such that the union of all the subsets is the set of documents; 2) processing each of the N subsets comprising the following steps: a) defining a first set of documents, a second set of documents, and a third set of documents in the subset; b) choosing at least one pattern recognition algorithm; i) instantiating a set of parameters for the pattern recognition algorithm; a′) training the pattern recognition algorithm to build a model using the first set of documents and the parameter set; b′) applying the model to the second set of documents to obtain labels and scores for each document; c′) evaluating the labels and scores; d′) storing the evaluation measure, set of parameters, and current pattern recognition algorithm; and e′) repeating step i) until all appropriate sets of parameters for the pattern recognition algorithm have been applied; and c) repeating step 2b) until all pattern recognition algorithm have been applied; d) aggregating the evaluation measures, the pattern recognition algorithms with the set of parameters; e) selecting the parameter set and pattern recognition algorithm with an aggregate evaluation measure that meets a selection criteria; f) applying the parameter set and the pattern recognition algorithm identified from step e) to the union of the first and second subset to form an intermediate final model; g) applying the intermediate final model to the third set of documents to obtain labels and scores for each document; h) evaluating the labels and scores; i) storing the intermediate evaluation measure; j) repeating step 2 until all subsets have been applied; and 3) aggregating the intermediate evaluation measures to form an aggregate evaluation measure; and 4) displaying the aggregate evaluation measure as the estimated performance. 34. A process according to claim 30 in step C wherein the set of documents are chosen using a plurality of different sources.

11. A mobile device comprising: means for receiving sensor data from at least one data source associated with the mobile device, wherein the at least one data source comprises one or more sensors of the mobile device; means for determining a first context class for the received sensor data, the first context class corresponding to a context state indicated by the received sensor data; means for determining that a confidence value associated with the determination of the first context class is below a threshold value; means for creating a fusion class for the received sensor data at least in part by fusing the first context class for the received sensor data and at least a second context class for the received sensor data, the at least the second context class being different from the first context class, wherein the fusion class semantically encompasses the first context class and the at least the second context class and further wherein the fusion class is broader than each of the first context class and the at least the second context class; means for substituting the fusion class for the first context class; and means for outputting the fusion class as an inferred context for the mobile device.

11. A mobile device comprising: means for receiving sensor data from at least one data source associated with the mobile device, wherein the at least one data source comprises one or more sensors of the mobile device; means for determining a first context class for the received sensor data, the first context class corresponding to a context state indicated by the received sensor data; means for determining that a confidence value associated with the determination of the first context class is below a threshold value; means for creating a fusion class for the received sensor data at least in part by fusing the first context class for the received sensor data and at least a second context class for the received sensor data, the at least the second context class being different from the first context class, wherein the fusion class semantically encompasses the first context class and the at least the second context class and further wherein the fusion class is broader than each of the first context class and the at least the second context class; means for substituting the fusion class for the first context class; and means for outputting the fusion class as an inferred context for the mobile device. 13. The mobile device of claim 11 comprising means for determining the confidence value associated with the determination of the first context class.

1. A computer program product having a non-transitory computer-readable medium having computer program logic recorded thereon for locating at least one object in a text input, the computer program product comprising: means for parsing the text input into parsed terms, wherein the text input is a request to search for information in a repository, wherein the means for parsing the text input further comprises means for determining a fractional length, the fractional length indicating a number of term units from a first term unit to a next functional term unit; means for analyzing the parsed terms to locate an object term and a plurality of non-object terms, wherein the object term is a noun and each non-object term is one of a verb, adverb, adjective, pronoun, preposition, conjunction, article, and interjection, wherein at least one object term is placed into an object string and at least one non-object term is placed into one of a plurality of non-object buckets; and means for providing the object string and the plurality of non-object buckets to a search engine, wherein the search engine compares the object string and the non-object buckets with information in the repository.

1. A computer program product having a non-transitory computer-readable medium having computer program logic recorded thereon for locating at least one object in a text input, the computer program product comprising: means for parsing the text input into parsed terms, wherein the text input is a request to search for information in a repository, wherein the means for parsing the text input further comprises means for determining a fractional length, the fractional length indicating a number of term units from a first term unit to a next functional term unit; means for analyzing the parsed terms to locate an object term and a plurality of non-object terms, wherein the object term is a noun and each non-object term is one of a verb, adverb, adjective, pronoun, preposition, conjunction, article, and interjection, wherein at least one object term is placed into an object string and at least one non-object term is placed into one of a plurality of non-object buckets; and means for providing the object string and the plurality of non-object buckets to a search engine, wherein the search engine compares the object string and the non-object buckets with information in the repository. 5. The computer program product of claim 1 , wherein each term is separated from another term by a delimiter.

1. A method, comprising: converting a plurality of feature vectors that represents a speech utterance into a plurality of log probability sets, the converting using a classifier ensemble including a plurality of classifiers; transforming the plurality of log probability sets into a plurality of output symbol sequences; combining the plurality of output symbol sequences, using an iterative a priori probability calculation algorithm, into a fusion output symbol sequence; and retrieving one or more speech utterances from a speech database using the plurality of output symbol sequences.

1. A method, comprising: converting a plurality of feature vectors that represents a speech utterance into a plurality of log probability sets, the converting using a classifier ensemble including a plurality of classifiers; transforming the plurality of log probability sets into a plurality of output symbol sequences; combining the plurality of output symbol sequences, using an iterative a priori probability calculation algorithm, into a fusion output symbol sequence; and retrieving one or more speech utterances from a speech database using the plurality of output symbol sequences. 3. The method of claim 1 , wherein the classifier ensemble includes at least one supervised classifier and at least one unsupervised classifier.

11. The computer-implemented method of claim 4 , further comprising: quantizing a plurality of confidence scores into a discrete number of confidence scores; and decorating a word candidate with a confidence score by appending to the word candidate a suffix corresponding to that confidence score.

11. The computer-implemented method of claim 4 , further comprising: quantizing a plurality of confidence scores into a discrete number of confidence scores; and decorating a word candidate with a confidence score by appending to the word candidate a suffix corresponding to that confidence score. 16. The computer-implemented method of claim 11 , further comprising: encoding each word lattice column as a single linear text string by concatenating each word in the column with a separation character; and outputting the single linear text string from a text ingestion plug-in of the full-text search engine.

8. A threat detection system comprising: a non-transitory data storage that stores security events associated with network devices, and an actor category model including a plurality of levels arranged in a hierarchy and each level is associated with a subcategory for a category of the actor category model, wherein the actor category model comprises an attribute for users, and the actor category model comprises parent-child relationships between the plurality of levels, and child levels inherit rules from their parent levels; and at least one physical processor that correlates security events with the actor category model, wherein to correlate the security events the at least one processor: identifies a user for each security event; determines the actor category model is applicable to the user for each security event and any of the security events associated with the user by matching the attribute for users in the actor category model with a user attribute of the user in a user data model; identifies a level in the actor category model associated with the user for each security event; and determines whether a security threat exists based on the correlating, wherein to determine whether the security threat exists, the at least one processor: determines a security rule for the identified level; and applies the security rule to determine whether the security threat exists.

8. A threat detection system comprising: a non-transitory data storage that stores security events associated with network devices, and an actor category model including a plurality of levels arranged in a hierarchy and each level is associated with a subcategory for a category of the actor category model, wherein the actor category model comprises an attribute for users, and the actor category model comprises parent-child relationships between the plurality of levels, and child levels inherit rules from their parent levels; and at least one physical processor that correlates security events with the actor category model, wherein to correlate the security events the at least one processor: identifies a user for each security event; determines the actor category model is applicable to the user for each security event and any of the security events associated with the user by matching the attribute for users in the actor category model with a user attribute of the user in a user data model; identifies a level in the actor category model associated with the user for each security event; and determines whether a security threat exists based on the correlating, wherein to determine whether the security threat exists, the at least one processor: determines a security rule for the identified level; and applies the security rule to determine whether the security threat exists. 11. The threat detection system of claim 8 , wherein the physical processor aggregates two or more of the security events into an aggregated event based on the correlated security events, wherein the aggregated event satisfies a condition in the security rule.

30. The non-transitory computer-readable medium of claim 28 , wherein the operations further comprise: receiving the search query comprising an identifier corresponding to the particular item; and identifying the consolidated listing associated with the identifier.

30. The non-transitory computer-readable medium of claim 28 , wherein the operations further comprise: receiving the search query comprising an identifier corresponding to the particular item; and identifying the consolidated listing associated with the identifier. 31. The non-transitory computer-readable medium of claim 30 , wherein the operations further comprise causing display of the consolidated listing on the client device.

10. A handheld electronic device comprising: a processor apparatus comprising a processor and a memory, the processor apparatus having a first data source and a second data source available thereto, the first data source having a plurality of language objects stored there in, the second data source having a plurality of language objects stored therein; an input apparatus structured to provide input to the processor apparatus; an output apparatus structured to receive output signals from the processor apparatus; the memory having stored therein a number of routines having instructions which, when executed on the processor, cause the handheld electronic device to perform operations comprising: detecting a text entry comprising a plurality of characters; employing the spell check function to identify in the first data source one or more first language objects as one or more first proposed spell-check interpretations of the text entry when it is determined that no stored language object corresponds with the text entry; if the quantity of the one or more first proposed spell-check interpretations is less than a predetermined quantity, employing the spell check function to identify in the second data source one or more second language objects as one or more second proposed spell-check interpretations of the text entry; outputting the one or more first spell-check interpretations and, if the quantity of the one or more first language objects is less than the predetermined quantity, the one or more second proposed spell-check interpretations; and responsive to a predetermined input, outputting a menu including a plurality of selectable spell check options.

10. A handheld electronic device comprising: a processor apparatus comprising a processor and a memory, the processor apparatus having a first data source and a second data source available thereto, the first data source having a plurality of language objects stored there in, the second data source having a plurality of language objects stored therein; an input apparatus structured to provide input to the processor apparatus; an output apparatus structured to receive output signals from the processor apparatus; the memory having stored therein a number of routines having instructions which, when executed on the processor, cause the handheld electronic device to perform operations comprising: detecting a text entry comprising a plurality of characters; employing the spell check function to identify in the first data source one or more first language objects as one or more first proposed spell-check interpretations of the text entry when it is determined that no stored language object corresponds with the text entry; if the quantity of the one or more first proposed spell-check interpretations is less than a predetermined quantity, employing the spell check function to identify in the second data source one or more second language objects as one or more second proposed spell-check interpretations of the text entry; outputting the one or more first spell-check interpretations and, if the quantity of the one or more first language objects is less than the predetermined quantity, the one or more second proposed spell-check interpretations; and responsive to a predetermined input, outputting a menu including a plurality of selectable spell check options. 12. The handheld electronic device of claim 10 wherein the operations further comprise employing as the first data source an unalterable word list, and employing as the second data source an alterable data source.

1. A method for facilitating a workflow using a workflow template in a call center, comprising the steps of: providing a first workflow template associated with a workflow item, wherein the first workflow template includes data and scripts for rendering the workflow template and one or more routing rules and one or more trigger points defined for said workflow item, wherein said each trigger point specifies an action to be taken with respect to said workflow item, including routing and supervisor intervention, wherein said one or more routing rules include a workgroup-related threshold that triggers a routing action to be taken with respect to the workgroup, and an agent-related threshold that triggers a routing action to be taken with respect to the agent; linking said first workflow template to a project of an interaction type, wherein the interaction type is one of a phone, web callback, email, and chat, wherein the linking is performed by receiving, via a manager application, a first selection of a project template defining the interaction type from a predefined dropdown list of project templates, wherein the first selection generates a second dropdown list of one or more workflow templates including the first workflow template, and a third dropdown list of one or more additional workflow templates, receiving a second selection of the first workflow template from the second dropdown list, receiving a third selection of a third workflow template from the third dropdown list, receiving a selection of an entry and exit points for each of the workflow templates selected in the second and third selections, and storing attributes of each of the project template and workflow templates selected in the first, second and third selections and attributes of the entry and exit points, wherein each attribute is linked to at least one of a plurality of scripts used to generate logic flows for the project; routing said workflow item according to the one or more routing rules as defined in the first workflow template, via a server running on one or more microprocessors, to at least one of an agent and a knowledge worker; and receiving a score via a survey of a supervisor and the score being based on a key performance indicator (KPI) library linked to the workflow template selected in the second or third selection and selected from a KPI dropdown list associated with said at least one of an agent and a knowledge worker based on the agent's or the knowledge worker's handling of said workflow item associated with the first workflow template in the project, wherein one or more scoring values are stored in a database and are used for subsequent routing decisions.

1. A method for facilitating a workflow using a workflow template in a call center, comprising the steps of: providing a first workflow template associated with a workflow item, wherein the first workflow template includes data and scripts for rendering the workflow template and one or more routing rules and one or more trigger points defined for said workflow item, wherein said each trigger point specifies an action to be taken with respect to said workflow item, including routing and supervisor intervention, wherein said one or more routing rules include a workgroup-related threshold that triggers a routing action to be taken with respect to the workgroup, and an agent-related threshold that triggers a routing action to be taken with respect to the agent; linking said first workflow template to a project of an interaction type, wherein the interaction type is one of a phone, web callback, email, and chat, wherein the linking is performed by receiving, via a manager application, a first selection of a project template defining the interaction type from a predefined dropdown list of project templates, wherein the first selection generates a second dropdown list of one or more workflow templates including the first workflow template, and a third dropdown list of one or more additional workflow templates, receiving a second selection of the first workflow template from the second dropdown list, receiving a third selection of a third workflow template from the third dropdown list, receiving a selection of an entry and exit points for each of the workflow templates selected in the second and third selections, and storing attributes of each of the project template and workflow templates selected in the first, second and third selections and attributes of the entry and exit points, wherein each attribute is linked to at least one of a plurality of scripts used to generate logic flows for the project; routing said workflow item according to the one or more routing rules as defined in the first workflow template, via a server running on one or more microprocessors, to at least one of an agent and a knowledge worker; and receiving a score via a survey of a supervisor and the score being based on a key performance indicator (KPI) library linked to the workflow template selected in the second or third selection and selected from a KPI dropdown list associated with said at least one of an agent and a knowledge worker based on the agent's or the knowledge worker's handling of said workflow item associated with the first workflow template in the project, wherein one or more scoring values are stored in a database and are used for subsequent routing decisions. 12. The method of claim 1 wherein the one or more trigger points for said workflow item is a skill related to an agent skill or a workgroup skill and a skill weighting of an importance value of the skill.

1. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to: decode an identifier indicating that all samples within a scope of the bitstream have been coded with a prediction restriction; determine that the scope covers a region of interest within a picture; decode at least a first coding unit preceding said region of interest in decoding order in a parse mode such that syntax elements belonging to said at least first coding unit are parsed, but a sample reconstruction process of said syntax elements is omitted; and decode at least a second coding unit belonging to said region of interest such that syntax elements belonging to said at least second coding unit are parsed and a sample reconstruction process is performed to said syntax elements.

1. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to: decode an identifier indicating that all samples within a scope of the bitstream have been coded with a prediction restriction; determine that the scope covers a region of interest within a picture; decode at least a first coding unit preceding said region of interest in decoding order in a parse mode such that syntax elements belonging to said at least first coding unit are parsed, but a sample reconstruction process of said syntax elements is omitted; and decode at least a second coding unit belonging to said region of interest such that syntax elements belonging to said at least second coding unit are parsed and a sample reconstruction process is performed to said syntax elements. 16. The apparatus according to claim 1 , wherein the identifier indicates that an in-loop filtering process is disabled for the region of interest.

21. A non-transitory computer-readable medium storing program code operable to cause one or more computers to perform operations comprising: receiving a source web page document; identifying, by a preprocessor based on formatting information of the source web page document, a plurality of regions contained within the source webpage document, that would be displayed to a user visiting said source web page document, wherein the regions contained within the source webpage document contain content between opening and closing HTML or XML tags; determining at least one local concept expressed in each previously identified region, wherein determining the at least one local concept comprises identifying words in the document and aligning the words with concepts, wherein said at least one local concept expressed in the previously identified region is expressed by two or more words in the region; determining a score for a local concept expressed in each previously-identified region, wherein the score is based on a size of, or an importance associated with, the previously-identified region; analyzing the previously determined at least one local concept of each region to identify and eliminate from consideration one or more local concepts that are unrelated to local concepts of other of said previously identified regions by creating a ranked global list of all of said local concepts; analyzing the previously identified regions to identify and eliminate from consideration one or more regions that are unrelated to regions by comparing a ranked list of local concepts for each of said previously identified regions to said global list; determining a source meaning for the source web page document, wherein the source meaning for the source web page document is a weighted vector of said previously determined local concepts expressed in the source web page document that remain after the eliminations; and matching the source web page document with an item selected from a set of items by comparing the previously determined source meaning and a meaning of the item.

21. A non-transitory computer-readable medium storing program code operable to cause one or more computers to perform operations comprising: receiving a source web page document; identifying, by a preprocessor based on formatting information of the source web page document, a plurality of regions contained within the source webpage document, that would be displayed to a user visiting said source web page document, wherein the regions contained within the source webpage document contain content between opening and closing HTML or XML tags; determining at least one local concept expressed in each previously identified region, wherein determining the at least one local concept comprises identifying words in the document and aligning the words with concepts, wherein said at least one local concept expressed in the previously identified region is expressed by two or more words in the region; determining a score for a local concept expressed in each previously-identified region, wherein the score is based on a size of, or an importance associated with, the previously-identified region; analyzing the previously determined at least one local concept of each region to identify and eliminate from consideration one or more local concepts that are unrelated to local concepts of other of said previously identified regions by creating a ranked global list of all of said local concepts; analyzing the previously identified regions to identify and eliminate from consideration one or more regions that are unrelated to regions by comparing a ranked list of local concepts for each of said previously identified regions to said global list; determining a source meaning for the source web page document, wherein the source meaning for the source web page document is a weighted vector of said previously determined local concepts expressed in the source web page document that remain after the eliminations; and matching the source web page document with an item selected from a set of items by comparing the previously determined source meaning and a meaning of the item. 26. The non-transitory computer-readable medium of claim 21 , wherein eliminating said unrelated concepts comprises ranking said previously determined local concepts in said global list using biasing factors.

11. A non-transitory computer readable medium comprising stored instructions for legalizing a circuit layout using a plurality of non-uniform grids, the circuit layout for manufacturing a circuit, the circuit layout comprised of a layout object, the instructions when executed by a processor causes the processor to: generate a set of layout constraints for the layout object based on the plurality of non-uniform grids, the set of layout constraints comprising design rule check constraints and gridding requirements, the gridding requirements being requisites for the layout object to align to one of the plurality of non-uniform grids, the layout object having layout variables to identify a position of the layout object; process the set of layout constraints to a feasible form for the layout object to be modified to satisfy the set of layout constraints by causing the processor to: assign Boolean variables to the layout variables, each Boolean variable from the Boolean variables assigned to a corresponding layout variable from the layout variables, determine whether the set of layout constraints is infeasible using the Boolean variables assigned to the layout variables, and responsive to the set of layout constraints determined to be infeasible, (i) identify an infeasible layout constraint from the set of layout constraints, the infeasible layout constraint causing the set of layout constraints to be infeasible, and (ii) relax the identified infeasible layout constraint for the set of layout constraints to be in the feasible form; and generate, by solving the set of layout constraints in the feasible form with a linear program solver, an output circuit layout to provide for manufacture of the circuit.

11. A non-transitory computer readable medium comprising stored instructions for legalizing a circuit layout using a plurality of non-uniform grids, the circuit layout for manufacturing a circuit, the circuit layout comprised of a layout object, the instructions when executed by a processor causes the processor to: generate a set of layout constraints for the layout object based on the plurality of non-uniform grids, the set of layout constraints comprising design rule check constraints and gridding requirements, the gridding requirements being requisites for the layout object to align to one of the plurality of non-uniform grids, the layout object having layout variables to identify a position of the layout object; process the set of layout constraints to a feasible form for the layout object to be modified to satisfy the set of layout constraints by causing the processor to: assign Boolean variables to the layout variables, each Boolean variable from the Boolean variables assigned to a corresponding layout variable from the layout variables, determine whether the set of layout constraints is infeasible using the Boolean variables assigned to the layout variables, and responsive to the set of layout constraints determined to be infeasible, (i) identify an infeasible layout constraint from the set of layout constraints, the infeasible layout constraint causing the set of layout constraints to be infeasible, and (ii) relax the identified infeasible layout constraint for the set of layout constraints to be in the feasible form; and generate, by solving the set of layout constraints in the feasible form with a linear program solver, an output circuit layout to provide for manufacture of the circuit. 14. The non-transitory computer readable medium of claim 11 , further comprising instructions that when executed by the processor cause the processor to iteratively relax the infeasible layout constraint and determine whether the set of layout constraints is infeasible until the set of layout constraints is feasible.

19. The system of claim 1 : wherein the first device further comprises the speech recognition processing component; wherein the system further comprises a third device; wherein the second device further includes means for providing the result output to the third device; and wherein the third device comprises means for providing output representing the result output to the user.

19. The system of claim 1 : wherein the first device further comprises the speech recognition processing component; wherein the system further comprises a third device; wherein the second device further includes means for providing the result output to the third device; and wherein the third device comprises means for providing output representing the result output to the user. 20. The system of claim 19 : wherein the third device comprises a terminal services client; wherein the means for providing the result output to the third device comprises a terminal session manager in the second device; and wherein the terminal services client comprises the means for providing output representing the result output to the user.

17. A method comprising: finding, by a processor of a computer; at least one document having text that is similar to input data, the input, data being data for conversion from a phonetic representation or speech; to written text characters of one or more words of a language and having a plurality of data pieces, the finding based on the text of the at least one document and the input data converted to a textual format from an iterative process, the iterative process including starting with a first data piece of the input data converted to a selected textual format to form a current format of the input data and iteratively updating the current format with a next data piece of the input data using elements of the current format until all the data pieces are converted into the textual format, the text of the at least one document being written in the language; creating by the processor a customized dictionary comprising a weighted list of the text that occur in the at least one document; and converting the input data to a representation of one or more written text characters of the language based on the weighted list.

17. A method comprising: finding, by a processor of a computer; at least one document having text that is similar to input data, the input, data being data for conversion from a phonetic representation or speech; to written text characters of one or more words of a language and having a plurality of data pieces, the finding based on the text of the at least one document and the input data converted to a textual format from an iterative process, the iterative process including starting with a first data piece of the input data converted to a selected textual format to form a current format of the input data and iteratively updating the current format with a next data piece of the input data using elements of the current format until all the data pieces are converted into the textual format, the text of the at least one document being written in the language; creating by the processor a customized dictionary comprising a weighted list of the text that occur in the at least one document; and converting the input data to a representation of one or more written text characters of the language based on the weighted list. 21. The method of claim 17 , wherein creating the customized dictionary further comprises assigning a higher weight to the text in the weighted list that has a higher probability of being used in the input data.

11. A computer program product comprising: a non-transitory computer readable medium; and program code on the non-transitory computer readable medium that when executed within a data processing device within a distributed storage system (DSS), the program code provides the functionality of; identifying a pre-established data storage threshold value for an amount of data that can be stored within the DSS; tracking a current storage usage for an amount of data stored within the DSS; determining whether the current storage usage exceeds the pre-established data storage threshold value; in response to determining that the current storage usage exceeds the pre-established data storage threshold value, calculating a target number of documents that can be deleted from the DSS based on an amount by which the current storage usage exceeds the pre-established data storage threshold value, wherein the current storage usage is proportional to a number of stored documents in the DSS, wherein the stored documents have a same document type; determining a data characteristic parameter that can be used to identify parameter values of the stored documents, which parameter values enable the stored documents to be assigned into a plurality of groups which include a set of document categories, wherein the groups are ordered based on a relative index associated with corresponding parameter values, wherein all of the stored documents assigned to at least one of the plurality of groups can be deleted, based on an order associated with the relative index of the document categories, in order to provide the target number of documents that can be deleted; assigning stored documents to the plurality of groups using corresponding parameter values; and deleting all of the stored documents assigned to at least one of the plurality of groups in order to remove the target number of stored documents.

11. A computer program product comprising: a non-transitory computer readable medium; and program code on the non-transitory computer readable medium that when executed within a data processing device within a distributed storage system (DSS), the program code provides the functionality of; identifying a pre-established data storage threshold value for an amount of data that can be stored within the DSS; tracking a current storage usage for an amount of data stored within the DSS; determining whether the current storage usage exceeds the pre-established data storage threshold value; in response to determining that the current storage usage exceeds the pre-established data storage threshold value, calculating a target number of documents that can be deleted from the DSS based on an amount by which the current storage usage exceeds the pre-established data storage threshold value, wherein the current storage usage is proportional to a number of stored documents in the DSS, wherein the stored documents have a same document type; determining a data characteristic parameter that can be used to identify parameter values of the stored documents, which parameter values enable the stored documents to be assigned into a plurality of groups which include a set of document categories, wherein the groups are ordered based on a relative index associated with corresponding parameter values, wherein all of the stored documents assigned to at least one of the plurality of groups can be deleted, based on an order associated with the relative index of the document categories, in order to provide the target number of documents that can be deleted; assigning stored documents to the plurality of groups using corresponding parameter values; and deleting all of the stored documents assigned to at least one of the plurality of groups in order to remove the target number of stored documents. 12. The computer program product of claim 11 , wherein: the data characteristic parameter is one of (a) an age of stored documents and (b) an acquisition period of stored documents; and the plurality of groups associated with the data characteristic parameter are time-based groups selected from among groups comprising: (a) a collection of months that span an identified document acquisition period; (b) a collection of weeks that span an identified document acquisition period; (c) a collection of hours that span an identified document acquisition period; and (d) any other collection of time intervals of a measurable time span associated with an identified document acquisition period.

3. The control system of claim 9 or claim 2 wherein said means for activating a binary bit of a second polarity includes means for calculating a table of address points for said memory buffer based on the relative positioning of said binary signals of second polarity in said memory buffer and means for storing said table of address points.

3. The control system of claim 9 or claim 2 wherein said means for activating a binary bit of a second polarity includes means for calculating a table of address points for said memory buffer based on the relative positioning of said binary signals of second polarity in said memory buffer and means for storing said table of address points. 4. The control system of claim 3 wherein said means for calculating the modulo N value of the magnitude representation of said input character string includes means for accessing said table of address points for the memory buffer address nearest said calculated modulo N value for the input character string.

10. A system comprising: one or more computers and one or more non-transitory computer-readable storage devices storing instructions that when executed by the one or more computers cause the one or more computers to perform operations comprising: identifying two or more consecutive terms in a search query; determining a first quantity of search results that (i) are responsive to the search query, and (ii) have been selected by a user; determining a second quantity of search results that (i) are responsive to the search query, (ii) have been selected by the user, and (iii) have summaries that include the two or more consecutive terms; determining a value using the first quantity and the second quantity; and determining a likelihood that the two or more consecutive terms represent a compound based on the value.

10. A system comprising: one or more computers and one or more non-transitory computer-readable storage devices storing instructions that when executed by the one or more computers cause the one or more computers to perform operations comprising: identifying two or more consecutive terms in a search query; determining a first quantity of search results that (i) are responsive to the search query, and (ii) have been selected by a user; determining a second quantity of search results that (i) are responsive to the search query, (ii) have been selected by the user, and (iii) have summaries that include the two or more consecutive terms; determining a value using the first quantity and the second quantity; and determining a likelihood that the two or more consecutive terms represent a compound based on the value. 13. The system of claim 10 , wherein determining the likelihood comprises comparing the value to a threshold.

34. The method of claim 33 , wherein the operational policies and procedures under which the presentation authority operates each has a policy identifier.

34. The method of claim 33 , wherein the operational policies and procedures under which the presentation authority operates each has a policy identifier. 35. The method of claim 34 , wherein the policy identifier of the presentation authority is an object identifier.

1. A method comprising; receiving a communication from a source, wherein the communication is associated with an account, and wherein the account is associated with the source; determining, at a processor, whether a time period satisfies a threshold time period, wherein the time period is associated with a voice message box, wherein the voice message box is associated with the account, wherein the voice message box is associated with a particular status, and wherein the particular status is associated with an available capacity of the voice message box; and routing the communication to a first destination based on a determination that the time period satisfies the threshold time period.

1. A method comprising; receiving a communication from a source, wherein the communication is associated with an account, and wherein the account is associated with the source; determining, at a processor, whether a time period satisfies a threshold time period, wherein the time period is associated with a voice message box, wherein the voice message box is associated with the account, wherein the voice message box is associated with a particular status, and wherein the particular status is associated with an available capacity of the voice message box; and routing the communication to a first destination based on a determination that the time period satisfies the threshold time period. 5. The method of claim 1 , further comprising routing the communication to a second destination based on a determination that the time period does not satisfy the threshold time period.

1. A computer-implemented method of facilitating dynamic-recognition-grammar-based interpretation of one or more natural language utterance, the method being implemented by a computer system that includes one or more physical processors executing computer program instructions which, when executed, perform the method, the method comprising: receiving, by the computer system, a natural language utterance relating to a navigation context; determining, by the computer system, one or more similarities between a user associated with the natural language utterance and one or more other users; determining, by the computer system, a dynamic recognition grammar based on the one or more determined similarities; and generating, by the computer system, one or more interpretations associated with the natural language utterance based on the dynamic recognition grammar.

1. A computer-implemented method of facilitating dynamic-recognition-grammar-based interpretation of one or more natural language utterance, the method being implemented by a computer system that includes one or more physical processors executing computer program instructions which, when executed, perform the method, the method comprising: receiving, by the computer system, a natural language utterance relating to a navigation context; determining, by the computer system, one or more similarities between a user associated with the natural language utterance and one or more other users; determining, by the computer system, a dynamic recognition grammar based on the one or more determined similarities; and generating, by the computer system, one or more interpretations associated with the natural language utterance based on the dynamic recognition grammar. 11. The method of claim 1 , wherein the natural language utterance comprises one or more words from which a location is inferred, the method further comprising: updating, by the computer system, the dynamic recognition grammar based on information relating to at least one of the inferred location, a current location of the user, or a route from the current location to the inferred location, wherein the information comprises at least one of traffic information, weather information, or event information relating to at least one of the inferred location, the current location, or the route; and refining, by the computer system, the one or more interpretations associated with the natural language utterance based on the updated dynamic recognition grammar.

1. A word information storage and retrieval apparatus comprising: a plurality of character keys for entering first word information representing a desired word in original form; search means responsive to said plurality of character keys for searching second word information representing said desired word in a variant form, said search means including; an original form memory for containing original forms of a plurality of words; at least one variant form memory for containing variant forms corresponding to said plurality of words; a counter for producing an incremental count upon the initiation of searching; a coincidence detector for sequentially comparing said desired word with the original forms of said plurality of words stored in said original form memory; said coincidence detector comparing said desired word with the original form of a new one of said plurality of words with each increment of said counter, a detected coincidence stopping the incremental count of said counter to thereby allow said counter to produce a signal representative of the original form of the word corresponding to said desired word; said signal generated by said counter being used to address and recall the variant form of said desired word from one of said at least one variant form memories; and a display responsive to said variant form of said desired word for indicating said second word information.

1. A word information storage and retrieval apparatus comprising: a plurality of character keys for entering first word information representing a desired word in original form; search means responsive to said plurality of character keys for searching second word information representing said desired word in a variant form, said search means including; an original form memory for containing original forms of a plurality of words; at least one variant form memory for containing variant forms corresponding to said plurality of words; a counter for producing an incremental count upon the initiation of searching; a coincidence detector for sequentially comparing said desired word with the original forms of said plurality of words stored in said original form memory; said coincidence detector comparing said desired word with the original form of a new one of said plurality of words with each increment of said counter, a detected coincidence stopping the incremental count of said counter to thereby allow said counter to produce a signal representative of the original form of the word corresponding to said desired word; said signal generated by said counter being used to address and recall the variant form of said desired word from one of said at least one variant form memories; and a display responsive to said variant form of said desired word for indicating said second word information. 2. The apparatus as specified in claim 1, which further comprises a control switch for controlling the searching means coincidence detector to thereby search the second word information.

32. A non-transitory computer readable storage medium comprising program instructions, wherein the program instructions are computer-executable to implement an event message gate unit on a client platform in a distributed computing system, wherein the program instructions are configured to: obtain, from a remote location, a markup language schema on a client platform, wherein said markup language schema defines a message interface of a remote service for a plurality of events generated by the remote service and indicates the plurality of events to be published by the remote service; obtain an address for said remote service within a distributed computing system; automatically construct, using computer-executable message endpoint construction code on the client platform, an event message endpoint on the client platform according to the markup language schema and the obtained address for the remote service, wherein said automatically constructing is performed within a runtime system of the client platform, and wherein the event message endpoint implements an API to send and receive event messages to and from the service; receive indications from one or more client processes registering interest in receiving one or more of a plurality of events generated by the remote service in the distributed computing system; automatically subscribe to the one or more events with the remote service in response to said indications registering interest in the one or more events received from the one or more client processes such that the event message endpoint becomes subscribed to the one or more events; receive over a network a message in a markup language sent to the client platform in the distributed computing system from the service in the distributed computing system, wherein the message is received at the event message endpoint from the service over the network in the distributed computing system, and wherein the message includes a markup language representation of one of the one or more events generated by the service to which the event message endpoint is subscribed; and send the markup language representation of the event from the event message endpoint to at least one of the one or more client processes registered with the event message endpoint to receive the event, wherein said markup language representation is in a data representation format which is independent of said client platform.

32. A non-transitory computer readable storage medium comprising program instructions, wherein the program instructions are computer-executable to implement an event message gate unit on a client platform in a distributed computing system, wherein the program instructions are configured to: obtain, from a remote location, a markup language schema on a client platform, wherein said markup language schema defines a message interface of a remote service for a plurality of events generated by the remote service and indicates the plurality of events to be published by the remote service; obtain an address for said remote service within a distributed computing system; automatically construct, using computer-executable message endpoint construction code on the client platform, an event message endpoint on the client platform according to the markup language schema and the obtained address for the remote service, wherein said automatically constructing is performed within a runtime system of the client platform, and wherein the event message endpoint implements an API to send and receive event messages to and from the service; receive indications from one or more client processes registering interest in receiving one or more of a plurality of events generated by the remote service in the distributed computing system; automatically subscribe to the one or more events with the remote service in response to said indications registering interest in the one or more events received from the one or more client processes such that the event message endpoint becomes subscribed to the one or more events; receive over a network a message in a markup language sent to the client platform in the distributed computing system from the service in the distributed computing system, wherein the message is received at the event message endpoint from the service over the network in the distributed computing system, and wherein the message includes a markup language representation of one of the one or more events generated by the service to which the event message endpoint is subscribed; and send the markup language representation of the event from the event message endpoint to at least one of the one or more client processes registered with the event message endpoint to receive the event, wherein said markup language representation is in a data representation format which is independent of said client platform. 35. The non-transitory computer readable storage medium as recited in claim 32 , wherein the event message endpoint is configured to verify type correctness of the markup language message according to the markup language schema prior to said sending the markup language representation of the event to the at least one of the one or more client processes.

13. A method for making optimal medical decisions, comprising: (a) collecting a plurality of medical evidence data, (b) establishing approximate probabilities of a plurality of distinct states of the disease compatible with said medical evidence data, (c) establishing approximate probabilities of a plurality of future distinct states of the disease for a plurality of medical treatments, (d) establishing probabilities of costs and benefits for each of the future distinct states of the disease and probabilities of costs of said medical treatments, (e) establishing a utility function operating over said costs and benefits each combination of costs and benefits, (f) computing an expected utility function over the probabilities of costs and benefits of future states of the disease and over the probabilities of costs of each of said medical treatments, (g) sorting said medical treatments by the value of said expected utility function, (h) selecting the medical treatment corresponding to the top value for said expected utility function, whereby the medical treatment selected in the last step is the optimal medical decision.

13. A method for making optimal medical decisions, comprising: (a) collecting a plurality of medical evidence data, (b) establishing approximate probabilities of a plurality of distinct states of the disease compatible with said medical evidence data, (c) establishing approximate probabilities of a plurality of future distinct states of the disease for a plurality of medical treatments, (d) establishing probabilities of costs and benefits for each of the future distinct states of the disease and probabilities of costs of said medical treatments, (e) establishing a utility function operating over said costs and benefits each combination of costs and benefits, (f) computing an expected utility function over the probabilities of costs and benefits of future states of the disease and over the probabilities of costs of each of said medical treatments, (g) sorting said medical treatments by the value of said expected utility function, (h) selecting the medical treatment corresponding to the top value for said expected utility function, whereby the medical treatment selected in the last step is the optimal medical decision. 17. The method for making optimal medical decisions of claim 13 further including (a) establishing a patient utility function approximately representing utility preferences of the patient (b) establishing a provider utility function approximately representing utility preferences of the medical care provider, (c) selecting a patient optimal medical decision corresponding to said patient utility function, (d) selecting a provider optimal medical decision corresponding to said provider utility function, (e) comparing said patient optimal medical decision and said provider optimal medical decision, (f) modifying arguments and parameters of said provider utility function and said patient utility function if said provider optimal medical decision and said patient optimal medical decision are not substantially the same, (g) establishing an iterative process in which last three steps until said provider optimal medical decision and said patient optimal medical decision are substantially the same and said iterative process stops, whereby the optimal medical decision obtained is common for the patient and for the medical care provider.

28. The method of claim 1 , further comprising: receiving a command to delete a file; determining that one of the subdocuments of the composite document is a copy of the file to be deleted; and performing a predetermined action in response to the determining.

28. The method of claim 1 , further comprising: receiving a command to delete a file; determining that one of the subdocuments of the composite document is a copy of the file to be deleted; and performing a predetermined action in response to the determining. 29. The method of claim 28 , wherein the predetermined action is one of notifying a user about the subdocument and deleting the one subdocument from the composite document.

11. The system of claim 10 wherein said code comprises a command configured to instruct said network device to make corresponding modifications to said remote copy of said configuration file.

11. The system of claim 10 wherein said code comprises a command configured to instruct said network device to make corresponding modifications to said remote copy of said configuration file. 12. The system of claim 11 wherein said command configured to instruct said network device to make corresponding modifications to said remote copy of said configuration file is rendered in Command Line Interface format.

18. The touch screen system of claim 11 , wherein: the touch screen system further comprises a clock; and the command interpreter is configured to start a timer that relies on the clock in response to identification of a stationary contact with the graphical display.

18. The touch screen system of claim 11 , wherein: the touch screen system further comprises a clock; and the command interpreter is configured to start a timer that relies on the clock in response to identification of a stationary contact with the graphical display. 19. The touch screen system of claim 18 , wherein the command interpreter is configured to identify a modifier interaction in response to a second user interaction being received before the timer reaches a threshold period.

30. The computer readable medium of claim 29 : wherein (C)(1) comprises displaying a structured input element; and wherein (C)(2) comprises receiving input from the human user in the structured input element.

30. The computer readable medium of claim 29 : wherein (C)(1) comprises displaying a structured input element; and wherein (C)(2) comprises receiving input from the human user in the structured input element. 49. The computer readable medium of claim 30 , wherein the structured input element comprises a text field.

1. A method, implemented at least in party by a computer system, of facilitating a closing of a real estate transaction, comprising: receiving first real estate transaction information for a first real estate transaction; wherein the first real estate transaction information comprises information identifying a first party to the transaction and information identifying a property of the first real estate transaction; storing the first real estate transaction information in a memory; preliminarily compiling one or more electronic documents with at least some of the first real estate transaction information; outputting for review by the first party, the one or more preliminarily compiled electronic documents; receiving an electronic signature indicating approval of at least one of the preliminarily compiled electronic documents by the first party; maintaining one or more financing terms associated with a loan to be obtained at the closing of the first real estate transaction; receiving a digital image of at least one ancillary document; and outputting electronic closing documents for the first real estate transaction that comprise: said digital image of at least one ancillary document; said at least one preliminary compiled electronic document with an electronic signature; and one or more documents sufficient to contractually bind the first party to the first real estate transaction.

1. A method, implemented at least in party by a computer system, of facilitating a closing of a real estate transaction, comprising: receiving first real estate transaction information for a first real estate transaction; wherein the first real estate transaction information comprises information identifying a first party to the transaction and information identifying a property of the first real estate transaction; storing the first real estate transaction information in a memory; preliminarily compiling one or more electronic documents with at least some of the first real estate transaction information; outputting for review by the first party, the one or more preliminarily compiled electronic documents; receiving an electronic signature indicating approval of at least one of the preliminarily compiled electronic documents by the first party; maintaining one or more financing terms associated with a loan to be obtained at the closing of the first real estate transaction; receiving a digital image of at least one ancillary document; and outputting electronic closing documents for the first real estate transaction that comprise: said digital image of at least one ancillary document; said at least one preliminary compiled electronic document with an electronic signature; and one or more documents sufficient to contractually bind the first party to the first real estate transaction. 11. The method of claim 1 , wherein said at least one preliminarily compiled electronic document comprises a negotiable financial instrument.

8. A non-transitory, computer-readable medium comprising instructions stored thereon, which when executed, are configured to cause a processor to: send a device description request message to a plurality of remote devices, wherein the device description request message comprises indications of criteria for a responding device that is at least one of the plurality of remote devices, wherein the indications of criteria for the responding device comprises: a fabric identifier that identifies a fabric to which the responding device is connected; a device mode that indicates a mode for the responding device; a vendor identifier that identifies a vendor for the responding device; and a product identifier that identifies a product type for the responding device; and receive a response message from only the responding device using a wireless communication protocol capable of utilizing more than a single frequency band in response to the device description request message that satisfy all criteria indicated in the indications of criteria, wherein the response message includes device description data about the responding device, and the device description data in the response message is encoded in a tag-length-value format.

8. A non-transitory, computer-readable medium comprising instructions stored thereon, which when executed, are configured to cause a processor to: send a device description request message to a plurality of remote devices, wherein the device description request message comprises indications of criteria for a responding device that is at least one of the plurality of remote devices, wherein the indications of criteria for the responding device comprises: a fabric identifier that identifies a fabric to which the responding device is connected; a device mode that indicates a mode for the responding device; a vendor identifier that identifies a vendor for the responding device; and a product identifier that identifies a product type for the responding device; and receive a response message from only the responding device using a wireless communication protocol capable of utilizing more than a single frequency band in response to the device description request message that satisfy all criteria indicated in the indications of criteria, wherein the response message includes device description data about the responding device, and the device description data in the response message is encoded in a tag-length-value format. 20. The non-transitory, computer-readable medium of claim 8 , wherein the responding device comprises a smart doorbell configured to detect a person's approach to or departure from a location, control audible functionality, announce a person's approach or departure via audio or visual means, or control settings on a security system.

9. A file management method as claimed in claim 8 , further comprising a second selection step of selecting the file from a plurality of files stored in the storage unit, wherein the addition step includes adding the composite search keywords to the index information associated with the file selected in the second selection step.

9. A file management method as claimed in claim 8 , further comprising a second selection step of selecting the file from a plurality of files stored in the storage unit, wherein the addition step includes adding the composite search keywords to the index information associated with the file selected in the second selection step. 13. A file management method as claimed in claim 9 , wherein the second selection step includes selecting the file by searching at least some of the plurality of files stored in said storage unit under search conditions designated by the user.

6. An MMS decoder, comprising: A file parsing module configured for parsing an original MMS data packet, acquiring all the non-SMIL files in the original MMS data packet and counting the number of all the non-SMIL files as a first non-SMIL file number; an SMIL pre-parsing module configured for determining whether an SMIL file exists in a parsing result, when an SMIL file exists, then pre-parsing the SMIL file, obtaining the number of non-SMIL files described by the SMIL file and counting the number as a second non-SMIL file number; when no SMIL file exists, then setting the second non-SMIL file number as zero; an SMIL decision unit configured for comparing the first non-SMIL file number with the second non-SMIL file number, and taking the SMIL file in the parsing result as a formal SMIL file to be parsed when the two numbers are equal; an SMIL file reconstruction unit configured for, when the first non-SMIL file number and the second non-SMIL file number are not equal, constructing an SMIL file according to all the non-SMIL files obtained in the file parsing module, and taking the constructed SMIL file as a formal SMIL file to be parsed; An MMS decoding output module configured for integrally parsing the formal SMIL file to be parsed, obtaining a data structure describing a playing layout of MMS, and taking the obtained data structure and all the non-SMIL files obtained in the file parsing module as an MMS decoding result.

6. An MMS decoder, comprising: A file parsing module configured for parsing an original MMS data packet, acquiring all the non-SMIL files in the original MMS data packet and counting the number of all the non-SMIL files as a first non-SMIL file number; an SMIL pre-parsing module configured for determining whether an SMIL file exists in a parsing result, when an SMIL file exists, then pre-parsing the SMIL file, obtaining the number of non-SMIL files described by the SMIL file and counting the number as a second non-SMIL file number; when no SMIL file exists, then setting the second non-SMIL file number as zero; an SMIL decision unit configured for comparing the first non-SMIL file number with the second non-SMIL file number, and taking the SMIL file in the parsing result as a formal SMIL file to be parsed when the two numbers are equal; an SMIL file reconstruction unit configured for, when the first non-SMIL file number and the second non-SMIL file number are not equal, constructing an SMIL file according to all the non-SMIL files obtained in the file parsing module, and taking the constructed SMIL file as a formal SMIL file to be parsed; An MMS decoding output module configured for integrally parsing the formal SMIL file to be parsed, obtaining a data structure describing a playing layout of MMS, and taking the obtained data structure and all the non-SMIL files obtained in the file parsing module as an MMS decoding result. 9. A mobile terminal including the MMS decoder according to claim 6 .

5. The system of claim 1 , further comprising a storage device communicably coupled to the adaptive narrative presentation circuit, the storage device including: a data store that includes data indicative of intrinsic parameters logically associated with each of a number of objects.

5. The system of claim 1 , further comprising a storage device communicably coupled to the adaptive narrative presentation circuit, the storage device including: a data store that includes data indicative of intrinsic parameters logically associated with each of a number of objects. 6. The system of claim 5 the adaptive narration presentation circuit to further: optically identify the object based at least in part on at least one intrinsic parameter of the object including at least one of: a shape of the object, a color of the object, a proportion of the object, or an anatomical feature of the object.

3. The method of claim 1 , wherein the classifying a mood and a genre of the music file using the generated music content summary includes: extracting a modified discrete cosine transformation (MDCT)-based timbre feature from the music content summary; extracting an MDCT-based tempo feature from the music content summary; and classifying the mood and the genre of the music file based on the extracted timbre feature tempo feature.

3. The method of claim 1 , wherein the classifying a mood and a genre of the music file using the generated music content summary includes: extracting a modified discrete cosine transformation (MDCT)-based timbre feature from the music content summary; extracting an MDCT-based tempo feature from the music content summary; and classifying the mood and the genre of the music file based on the extracted timbre feature tempo feature. 4. The method of claim 3 , wherein the extracting an MDCT-based timbre feature from the music content summary includes: extracting MDCT coefficients by decoding a part of the music content summary; selecting a predetermined number of MDCT coefficients of a sub-band from the extracted MDCT coefficients; and extracting a spectral centroid, a bandwidth, a rolloff, a flux, and a flatness from the selected MDCT coefficients.

27. The organization system as claimed in claim 26 , wherein the organization server is accessible by a computer system via a connection.

27. The organization system as claimed in claim 26 , wherein the organization server is accessible by a computer system via a connection. 28. The organization system as claimed in claim 27 wherein the computer system is located at a remote location from the organization server.

8. A computer-implemented method for behavior evaluation of a user in a conversation session, comprising: receiving, by a processor of a computer, a message from a user device, wherein the conversation session is between the user and an electronic conversational agent; updating, based on the conversation session and one or more factors associated with the message, a behavior measure associated with the user; determining, based on analyzing the behavior measure in relation to one or more historical factors associated with a subset of other users of the electronic conversational agent, whether the user is exhibiting anomalous behavior; and when it is determined that the user is exhibiting anomalous behavior, providing an indication to the electronic conversational agent to adapt one or more future communications with the user device based on the determined anomalous behavior.

8. A computer-implemented method for behavior evaluation of a user in a conversation session, comprising: receiving, by a processor of a computer, a message from a user device, wherein the conversation session is between the user and an electronic conversational agent; updating, based on the conversation session and one or more factors associated with the message, a behavior measure associated with the user; determining, based on analyzing the behavior measure in relation to one or more historical factors associated with a subset of other users of the electronic conversational agent, whether the user is exhibiting anomalous behavior; and when it is determined that the user is exhibiting anomalous behavior, providing an indication to the electronic conversational agent to adapt one or more future communications with the user device based on the determined anomalous behavior. 12. The computer-implemented method of claim 8 , further comprising: receiving a second message from the user device; updating, based on the conversation session and one or more factors associated with the second message, the behavior measure associated with the user; determining, based on the behavior measure, whether the user continues to exhibit anomalous behavior; and when it is determined that the user does not exhibit anomalous behavior, providing an indication to the electronic conversational agent to enter a normal state.

1. A system, comprising: a data structure populated with document tokens selected from signatures of documents and member tokens selected from database members, the data structure including entries identifying co-occurrences of the document tokens and the member tokens; a filter component configured to identify individual documents that cannot match individual database members using the co-occurrences identified in the data structure; a verification component configured to receive a remainder of the documents and to verify whether sub-strings of the remainder of the documents match the individual database members; and at least one computing device configured to execute one or more of the filter component or the verification component.

1. A system, comprising: a data structure populated with document tokens selected from signatures of documents and member tokens selected from database members, the data structure including entries identifying co-occurrences of the document tokens and the member tokens; a filter component configured to identify individual documents that cannot match individual database members using the co-occurrences identified in the data structure; a verification component configured to receive a remainder of the documents and to verify whether sub-strings of the remainder of the documents match the individual database members; and at least one computing device configured to execute one or more of the filter component or the verification component. 6. The system of claim 1 , wherein the data structure comprises an inverted signature-based hashtable.

17. A method comprising: identifying causal relationships between a plurality of documents; identifying a plurality of characteristics of a communication, including a modality used, actors involved, and proximate events of relevance; enabling a user to query based on all of the characteristics available; evaluating actor behavior over time, to create a threshold behavior for the actor; and identifying deviations from the threshold behavior.

17. A method comprising: identifying causal relationships between a plurality of documents; identifying a plurality of characteristics of a communication, including a modality used, actors involved, and proximate events of relevance; enabling a user to query based on all of the characteristics available; evaluating actor behavior over time, to create a threshold behavior for the actor; and identifying deviations from the threshold behavior. 18. The method of claim 17 , further comprising: relating the deviation from the threshold behavior to relevant events.

1. An apparatus comprising: at least one processor; a memory coupled to the at least one processor; a repository residing in the memory that includes a plurality of documents that each include at least one element; and a content management system residing in the memory and executed by the at least one processor, the content management system managing the plurality of documents in the repository, the content management system comprising: an on-demand bursting mechanism that, in response to determining at least one desired element is needed in a first document, performs a search of at least one document in the repository to locate the at least one desired element, and when the at least one desired element is found in a second document in the repository that includes at least one additional element, the on-demand bursting mechanism extracts the at least one desired element from the second document, creates at least one document in the repository from the extracted at least one element, returns at least one link to the at least one created document, and inserts the at least one link to the at least one created document into the first document.

1. An apparatus comprising: at least one processor; a memory coupled to the at least one processor; a repository residing in the memory that includes a plurality of documents that each include at least one element; and a content management system residing in the memory and executed by the at least one processor, the content management system managing the plurality of documents in the repository, the content management system comprising: an on-demand bursting mechanism that, in response to determining at least one desired element is needed in a first document, performs a search of at least one document in the repository to locate the at least one desired element, and when the at least one desired element is found in a second document in the repository that includes at least one additional element, the on-demand bursting mechanism extracts the at least one desired element from the second document, creates at least one document in the repository from the extracted at least one element, returns at least one link to the at least one created document, and inserts the at least one link to the at least one created document into the first document. 5. The apparatus of claim 1 wherein the content management system further comprises a user-level bursting mechanism that bursts at least one element in a document when a user requests bursting of the at least one element while editing the document.

1. A method comprising: identifying, in a domain-independent manner, a dialog act for an independent clause of a speech recognizer output; identifying, in a domain-dependent manner, an object within the independent clause; and recursively generating, via a processor, for each sub-independent clause within the independent clause, a semantic representation using the dialog act and the object of the independent clause.

1. A method comprising: identifying, in a domain-independent manner, a dialog act for an independent clause of a speech recognizer output; identifying, in a domain-dependent manner, an object within the independent clause; and recursively generating, via a processor, for each sub-independent clause within the independent clause, a semantic representation using the dialog act and the object of the independent clause. 7. The method of claim 1 , wherein recursively generating the semantic representation further comprises filling in a data structure associated with the dialog act.

11. The method of claim 1 , further comprising providing a choice of a plurality of options for automated seller engine architecture implementations depending upon the particular application involved, and selected from the group consisting of a parallel processing architecture, a pipeline architecture, a hub and spoke architecture and a hybrid architecture.

11. The method of claim 1 , further comprising providing a choice of a plurality of options for automated seller engine architecture implementations depending upon the particular application involved, and selected from the group consisting of a parallel processing architecture, a pipeline architecture, a hub and spoke architecture and a hybrid architecture. 18. The method of claim 11 , wherein the optimized price is computed by the seller engine by maximizing an expected seller utility representation of the seller's business objectives while factoring in other bid features including buyer characteristics and competitor behavior.

8. A computer system for managing methods for determining accurate document transformation, the computer program product comprising, the computer system comprising: one or more computer processors; one or more computer readable storage media; program instructions stored on the one or more computer readable storage media, for execution by at least one of the one or more computer processors, the program instructions comprising: program instructions to receive a source document for transformation to a target document during an Extract Transform Load (ETL) process, wherein the source document is in a first format and the target document is in a second format; program instructions to queue the source document according to an assigned priority for the target document, wherein the assigned priority is based on a descending order of file sizes for target documents of queued source documents; program instructions to, responsive to determining the source document is next in the queue, transform content of the source document into the target document, wherein transforming the content of the source document includes transforming the content from the first format to the second format; program instructions to, responsive to determining an increased likelihood the source document was not accurately transformed to the target document based on a file size for the target document, render the source document into a non-rasterized graphical format, wherein a rendered source document represents the source document in the non-rasterized graphical format; program instructions to render the target document into a non-rasterized graphical format, wherein a rendered target document represents the target document in the non-rasterized graphical format; program instructions to compare one or more aspects of the rendered source document to corresponding one or more aspects of the rendered target document; and program instructions to determine, based at least in part on the compared one or more aspects, the source document was accurately transformed to the target document.

8. A computer system for managing methods for determining accurate document transformation, the computer program product comprising, the computer system comprising: one or more computer processors; one or more computer readable storage media; program instructions stored on the one or more computer readable storage media, for execution by at least one of the one or more computer processors, the program instructions comprising: program instructions to receive a source document for transformation to a target document during an Extract Transform Load (ETL) process, wherein the source document is in a first format and the target document is in a second format; program instructions to queue the source document according to an assigned priority for the target document, wherein the assigned priority is based on a descending order of file sizes for target documents of queued source documents; program instructions to, responsive to determining the source document is next in the queue, transform content of the source document into the target document, wherein transforming the content of the source document includes transforming the content from the first format to the second format; program instructions to, responsive to determining an increased likelihood the source document was not accurately transformed to the target document based on a file size for the target document, render the source document into a non-rasterized graphical format, wherein a rendered source document represents the source document in the non-rasterized graphical format; program instructions to render the target document into a non-rasterized graphical format, wherein a rendered target document represents the target document in the non-rasterized graphical format; program instructions to compare one or more aspects of the rendered source document to corresponding one or more aspects of the rendered target document; and program instructions to determine, based at least in part on the compared one or more aspects, the source document was accurately transformed to the target document. 14. The computer system of claim 8 , wherein the program instructions to render the target document into a non-rasterized graphical format, comprise program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to: identify one or more attachments associated with the target document; and render each of the one or more attachments associated with the target document into a non-rasterized format.

1. A method for accommodating a plurality of translations of a source text string into a limited available display area of a visual element in a graphical interface of a client computer system, the method comprising: receiving an input source text string in the display area of the visual element; receiving input specifying a source language for the source text string; receiving input selecting two or more target languages for the source text string to be translated into; obtaining translations of the source text string in each of the selected two or more target languages; displaying, in response to the input source text string, a set of translation vectors, each translation vector comprising one possible translation of the source text string for each of the selected two or more target languages; receiving a selection of a translation vector that contains a translation of the source text string corresponding to an intended meaning of the source text string; and calculating a minimum display area necessary for the visual element to display a longest translation of the translations contained in the selected translation vector, wherein the display area of the visual element in the graphical interface is adjusted to encompass the minimum display area such that the longest translation fits within the display area of the visual element.

1. A method for accommodating a plurality of translations of a source text string into a limited available display area of a visual element in a graphical interface of a client computer system, the method comprising: receiving an input source text string in the display area of the visual element; receiving input specifying a source language for the source text string; receiving input selecting two or more target languages for the source text string to be translated into; obtaining translations of the source text string in each of the selected two or more target languages; displaying, in response to the input source text string, a set of translation vectors, each translation vector comprising one possible translation of the source text string for each of the selected two or more target languages; receiving a selection of a translation vector that contains a translation of the source text string corresponding to an intended meaning of the source text string; and calculating a minimum display area necessary for the visual element to display a longest translation of the translations contained in the selected translation vector, wherein the display area of the visual element in the graphical interface is adjusted to encompass the minimum display area such that the longest translation fits within the display area of the visual element. 8. The method of claim 1 further comprising: receiving an existing graphical interface design comprising one or more existing visual elements; and testing the existing graphical interface design by calculating a minimum display area necessary for a longest translation in each of the existing visual element in the existing design.

42. The apparatus of claim 41 wherein the generated scan information includes optical scan information.

42. The apparatus of claim 41 wherein the generated scan information includes optical scan information. 43. The apparatus of claim 42 wherein the means for encrypting encrypts using a session key.

14. A system for determining a presence of a material from a hyperspectral image, the system comprising: one or more processors; a memory; a library of spectral signatures including one or more spectral signatures corresponding to a material; a receiver configured to receive a first spectral signature corresponding to a region of interest (ROI) contained in the hyperspectral image; a model generator configured to: create a model search space including two or more models, wherein each of the two or more models corresponds to a subset of spectral signatures in a library, and create, for each of the two or more models, a model spectral signature based on the corresponding subset of spectral signatures in the library, wherein each of the model spectral signatures approximates the first spectral signature; and a material identifier configured to: calculate a cumulative probability of the first spectral signature indicating a presence of a material within the ROI, wherein the cumulative probability is based on a sum of similarity probabilities of models that contain the material as an element, and determine the presence of the material in the ROI based on the cumulative probability.

14. A system for determining a presence of a material from a hyperspectral image, the system comprising: one or more processors; a memory; a library of spectral signatures including one or more spectral signatures corresponding to a material; a receiver configured to receive a first spectral signature corresponding to a region of interest (ROI) contained in the hyperspectral image; a model generator configured to: create a model search space including two or more models, wherein each of the two or more models corresponds to a subset of spectral signatures in a library, and create, for each of the two or more models, a model spectral signature based on the corresponding subset of spectral signatures in the library, wherein each of the model spectral signatures approximates the first spectral signature; and a material identifier configured to: calculate a cumulative probability of the first spectral signature indicating a presence of a material within the ROI, wherein the cumulative probability is based on a sum of similarity probabilities of models that contain the material as an element, and determine the presence of the material in the ROI based on the cumulative probability. 16. The system of claim 14 , wherein the probability determiner is further configured to determine a background expected value associated with the model search space.

13. A system for tracking time using speech recognition, the system comprising: a computer system comprising: a memory that stores computer-readable code; and a processor operatively coupled to the memory, the processor configured to implement the computer-readable code, the computer-readable code configured to: access speech data; recognize at least two voice commands from the speech data, each voice command occurring at a different time; determine a first time, indicative of a first time of day, associated with a speaking of a first of the voice commands, wherein said first voice command identifies a start of a time interval; determine a second time, indicative of a second time of day, associated with a speaking of a second of the voice commands, wherein said second voice command identifies an end of a time interval; convert each of the at least two voice commands to text; determine text versions of the at least two voice commands by comparing words in the text with phase grammar rules; and storing data identifying said time interval and data identifying one or more of said first voice command and second voice command, wherein the speech data comprises a time stamp that indicates a third time of day; and the act of determining a first time comprises: determining an offset time that is a time difference between the time stamp and a time when the first voice command is spoken; and determining the first time through reference to the time stamp and the offset time.

13. A system for tracking time using speech recognition, the system comprising: a computer system comprising: a memory that stores computer-readable code; and a processor operatively coupled to the memory, the processor configured to implement the computer-readable code, the computer-readable code configured to: access speech data; recognize at least two voice commands from the speech data, each voice command occurring at a different time; determine a first time, indicative of a first time of day, associated with a speaking of a first of the voice commands, wherein said first voice command identifies a start of a time interval; determine a second time, indicative of a second time of day, associated with a speaking of a second of the voice commands, wherein said second voice command identifies an end of a time interval; convert each of the at least two voice commands to text; determine text versions of the at least two voice commands by comparing words in the text with phase grammar rules; and storing data identifying said time interval and data identifying one or more of said first voice command and second voice command, wherein the speech data comprises a time stamp that indicates a third time of day; and the act of determining a first time comprises: determining an offset time that is a time difference between the time stamp and a time when the first voice command is spoken; and determining the first time through reference to the time stamp and the offset time. 16. The system of claim 13 , wherein the system further comprises a digital personal recorder and wherein the computer-readable code is further configured to receive the speech data from the digital personal recorder.

4. A handheld electronic device comprising: a processor apparatus comprising a processor and a memory; an input apparatus comprising a plurality of input keys and being structured to provide input to the processor apparatus, a first set of the input keys each having a Roman character assigned thereto, at least some of the input keys in the first set of the input keys having a first non-Roman character and a second non-Roman character assigned thereto; and an output apparatus structured to receive output signals from the processor apparatus, wherein the memory has stored therein a number of routines that, when executed on the processor, cause the handheld electronic device to be selectively switchable between: (i) a Roman character input mode, and (ii) a non-Roman character input mode, wherein in said Roman character input mode, each said Roman character may be selected and input into said processor apparatus for display on said output apparatus in response to selection of the input key to which it is assigned, and wherein in said non-Roman character input mode, each first non-Roman character may be selected and input into said processor apparatus for display on said output apparatus in response to a first type of selection of the input key to which it is assigned, and each second non-Roman character may be selected and input into said processor apparatus for display on said output apparatus in response to a second type of selection of the input key to which it is assigned, wherein said non-Roman characters are employed in a first language, said first language having one or more rules that govern use of characters in the first language, said routines, when executed on the processor, further cause the processor to: receive an input requesting entry of a first one of the non-Roman characters; determine that said input is for beginning a new word; and based on said one or more rules, determine that said first one of the non-Roman characters is not permissible for beginning said new word and prevent display on said output apparatus of said first one of the non-Roman characters.

4. A handheld electronic device comprising: a processor apparatus comprising a processor and a memory; an input apparatus comprising a plurality of input keys and being structured to provide input to the processor apparatus, a first set of the input keys each having a Roman character assigned thereto, at least some of the input keys in the first set of the input keys having a first non-Roman character and a second non-Roman character assigned thereto; and an output apparatus structured to receive output signals from the processor apparatus, wherein the memory has stored therein a number of routines that, when executed on the processor, cause the handheld electronic device to be selectively switchable between: (i) a Roman character input mode, and (ii) a non-Roman character input mode, wherein in said Roman character input mode, each said Roman character may be selected and input into said processor apparatus for display on said output apparatus in response to selection of the input key to which it is assigned, and wherein in said non-Roman character input mode, each first non-Roman character may be selected and input into said processor apparatus for display on said output apparatus in response to a first type of selection of the input key to which it is assigned, and each second non-Roman character may be selected and input into said processor apparatus for display on said output apparatus in response to a second type of selection of the input key to which it is assigned, wherein said non-Roman characters are employed in a first language, said first language having one or more rules that govern use of characters in the first language, said routines, when executed on the processor, further cause the processor to: receive an input requesting entry of a first one of the non-Roman characters; determine that said input is for beginning a new word; and based on said one or more rules, determine that said first one of the non-Roman characters is not permissible for beginning said new word and prevent display on said output apparatus of said first one of the non-Roman characters. 7. The handheld electronic device according to claim 4 , wherein said first type of selection comprises a single selection of the input key and said second type of selection comprises a first selection of the input key followed by a second selection of the input key within a predetermined time frame.

26. The method of claim 16 , wherein the step of rating new items based on previous explicit user ratings of items comprises: determining features that correlate to the user's tastes and preferences, based on previous ratings of items by the user; optionally, presenting the user with a list of said features allowing the user to interactively modify the list; and inputting the features to the second predictive algorithm, wherein the second predictive algorithm rates items not previously rated.

26. The method of claim 16 , wherein the step of rating new items based on previous explicit user ratings of items comprises: determining features that correlate to the user's tastes and preferences, based on previous ratings of items by the user; optionally, presenting the user with a list of said features allowing the user to interactively modify the list; and inputting the features to the second predictive algorithm, wherein the second predictive algorithm rates items not previously rated. 27. The method of claim 26 , wherein the second predictive algorithm includes a modified naïve Bayes classifier, wherein the modified Bayes classifier accommodates multiple simultaneous features, and wherein the modified Bayes classifier is capable of excluding selected features.

37. A system for selecting advertisements in a computer environment, comprising: a database of electronic advertisements; and an electronic advertisement management system, comprising: a converter capable of converting an observed behavior of a user computing device in the computer environment to a behavior vector, a comparater capable of comparing the behavior vector to a plurality of entity vectors, the entity vectors indicative of the electronic advertisements, so as to identify at least one entity vector closely associated with the observed behavior, and a selector accessing the electronic database with the identified entity vector so as to select at least one electronic advertisement to communicate to the user computing device.

37. A system for selecting advertisements in a computer environment, comprising: a database of electronic advertisements; and an electronic advertisement management system, comprising: a converter capable of converting an observed behavior of a user computing device in the computer environment to a behavior vector, a comparater capable of comparing the behavior vector to a plurality of entity vectors, the entity vectors indicative of the electronic advertisements, so as to identify at least one entity vector closely associated with the observed behavior, and a selector accessing the electronic database with the identified entity vector so as to select at least one electronic advertisement to communicate to the user computing device. 43. The system as defined in claim 37, wherein the selector includes inventory management to allow selection of the entity based upon a presentation delivery schedule.

30. A system according to claim 29 , wherein the taxonomy is displayed in the form of a grid with the listing of the documents relevant to the deal on one axis, and the listing of the parties of the deal on another axis.

30. A system according to claim 29 , wherein the taxonomy is displayed in the form of a grid with the listing of the documents relevant to the deal on one axis, and the listing of the parties of the deal on another axis. 42. A system according to claim 30 , wherein the grid includes at least one communication feature.

1. A method comprising: defining, via a processor, a data interchange protocol modeling language specifying data models shared by one or more communication devices, the data models comprise data specifying criteria to define one or more data interchange protocol objects comprising instances of data; specifying features in the data models corresponding to (i) properties of the objects or (ii) the objects and defining a property restriction in the data models to designate a restriction for at least one property of the data interchange protocol document, the specified features and the defined property restriction being utilized in part to determine whether one or more properties or objects of at least one data interchange protocol document are valid, wherein the defined property restriction restricts a value of a property type for the at least one property of the data interchange protocol document; and evaluating at least one object of a data interchange protocol document to determine whether the object is valid based in part on analyzing defined items of data in the data models specifying that objects assigned a type and a name are valid objects.

1. A method comprising: defining, via a processor, a data interchange protocol modeling language specifying data models shared by one or more communication devices, the data models comprise data specifying criteria to define one or more data interchange protocol objects comprising instances of data; specifying features in the data models corresponding to (i) properties of the objects or (ii) the objects and defining a property restriction in the data models to designate a restriction for at least one property of the data interchange protocol document, the specified features and the defined property restriction being utilized in part to determine whether one or more properties or objects of at least one data interchange protocol document are valid, wherein the defined property restriction restricts a value of a property type for the at least one property of the data interchange protocol document; and evaluating at least one object of a data interchange protocol document to determine whether the object is valid based in part on analyzing defined items of data in the data models specifying that objects assigned a type and a name are valid objects. 2. The method of claim 1 , wherein, a syntax of the data interchange protocol modeling language comprises a JavaScript Object Notation syntax.

13. The method of claim 9 , wherein the graphical model includes a third entity coupled to the second entity, wherein the second entity further comprises a second property, wherein the third entity comprises the second property, a third behavioral constraint, and optionally a third behavioral description, wherein the second behavioral constraint and the third behavioral constraint are identical or different, wherein the second behavioral description and the third behavioral description are identical or different, wherein the second symbolic expression represents the second property of the third entity in the graphical model, the method further comprising: identifying the first property in the first and the second entities and the second property in the second and the third entities based on at least one of the connectivity information, a behavioral constraint of the first, the second, or the third entities, or a behavioral description of the first, the second, or the third entities; propagating the second symbolic expression to the second entity to represent the second property of the second entity with the second symbolic expression; and expressing the second and third entities in terms of the second symbolic expression.

13. The method of claim 9 , wherein the graphical model includes a third entity coupled to the second entity, wherein the second entity further comprises a second property, wherein the third entity comprises the second property, a third behavioral constraint, and optionally a third behavioral description, wherein the second behavioral constraint and the third behavioral constraint are identical or different, wherein the second behavioral description and the third behavioral description are identical or different, wherein the second symbolic expression represents the second property of the third entity in the graphical model, the method further comprising: identifying the first property in the first and the second entities and the second property in the second and the third entities based on at least one of the connectivity information, a behavioral constraint of the first, the second, or the third entities, or a behavioral description of the first, the second, or the third entities; propagating the second symbolic expression to the second entity to represent the second property of the second entity with the second symbolic expression; and expressing the second and third entities in terms of the second symbolic expression. 14. The method of claim 13 , wherein the graphical model includes a fourth entity coupled to the third entity, wherein the fourth entity comprises the second property, a fourth behavioral constraint, and optionally a fourth behavioral description, wherein the third behavioral constraint and the fourth behavioral constraint are identical or different, wherein the third behavioral description and the fourth behavioral description are identical or different, the method further comprising: propagating the second symbolic expression to the fourth entity to represent the second property of the fourth entity with the second symbolic expression; and expressing the third and fourth entities in terms of the second symbolic expression.

1. A computer implemented method, the method comprising: receiving a scan request, wherein the scan request includes a plurality of text images, each text image representing a portion of a text document, wherein the plurality of text images includes a first text image and a second text image that at least partially overlap; for each text image of the plurality of text images: rectifying the text image to generate a text image with parallel image lines, generating a plurality of word bounding boxes that enclose one or more connected components in the text image, wherein each word bounding box is associated with a respective word of the text image, and generating, for each respective word bounding box in the text image, a vector that describes a shape of the respective word; combining text images of the plurality of text images that at least partially overlap to form a single text document including combining the first text image of the plurality of text images and the second text image of the plurality of text images by matching one or more shape descriptors from a first set of vectors generated for each respective word in the first text image and one or more shape descriptors from a second set of vectors generated for each respective word in the second text image; and providing the combined image as a scannable document.

1. A computer implemented method, the method comprising: receiving a scan request, wherein the scan request includes a plurality of text images, each text image representing a portion of a text document, wherein the plurality of text images includes a first text image and a second text image that at least partially overlap; for each text image of the plurality of text images: rectifying the text image to generate a text image with parallel image lines, generating a plurality of word bounding boxes that enclose one or more connected components in the text image, wherein each word bounding box is associated with a respective word of the text image, and generating, for each respective word bounding box in the text image, a vector that describes a shape of the respective word; combining text images of the plurality of text images that at least partially overlap to form a single text document including combining the first text image of the plurality of text images and the second text image of the plurality of text images by matching one or more shape descriptors from a first set of vectors generated for each respective word in the first text image and one or more shape descriptors from a second set of vectors generated for each respective word in the second text image; and providing the combined image as a scannable document. 22. The method of claim 1 , wherein generating a particular vector for a particular word includes generating a grid for the corresponding word bounding box, performing histogram oriented gradient over the cells of the grid to determine word shape descriptors, and generating the particular vector from the words shape descriptors.

1. A method of categorizing color palettes comprising: associating natural language terms with achromatic entity categories of a set of achromatic entity categories; mining a collection of color palettes which have been previously labeled with comments of reviewers to form a dataset of labeled color palettes; assigning entity categories from the set of achromatic entity categories to a subset of the labeled color palettes in the dataset of color palettes based on matching natural language terms in the labels of the color palettes with the natural language terms associated with the achromatic entity categories, each color palette in the subset consisting of a sequence of from two to one hundred swatches, each swatch in the color palette being of a different color, each color palette in the dataset of color palettes differing from each of the other color palettes in the dataset with respect to at least one of its swatches; extracting color-related features from each of the color palettes; and with a computer processor and based on the assigned entity categories and color related features of the labeled color palettes, training a classifier to categorize a color palette into at least one of the set of achromatic entity categories based on its extracted color-related features.

1. A method of categorizing color palettes comprising: associating natural language terms with achromatic entity categories of a set of achromatic entity categories; mining a collection of color palettes which have been previously labeled with comments of reviewers to form a dataset of labeled color palettes; assigning entity categories from the set of achromatic entity categories to a subset of the labeled color palettes in the dataset of color palettes based on matching natural language terms in the labels of the color palettes with the natural language terms associated with the achromatic entity categories, each color palette in the subset consisting of a sequence of from two to one hundred swatches, each swatch in the color palette being of a different color, each color palette in the dataset of color palettes differing from each of the other color palettes in the dataset with respect to at least one of its swatches; extracting color-related features from each of the color palettes; and with a computer processor and based on the assigned entity categories and color related features of the labeled color palettes, training a classifier to categorize a color palette into at least one of the set of achromatic entity categories based on its extracted color-related features. 16. The method of claim 1 , wherein there are up to 20 different colors in each of the color palettes.

12. The method of claim 11 wherein the semantic unit is a word of a human language.

12. The method of claim 11 wherein the semantic unit is a word of a human language. 18. The method of claim 12 further comprising the steps of ranking words in the index in terms of data reduction and assigning relatively shorter pointers to words having better potential data reduction ranking.

1. A method for use in a vehicle comprising a plurality of in-vehicle consoles comprising at least a first in-vehicle console and a second in-vehicle console, the method comprising acts, performed via a speech processor, of: (A) receiving, at the speech processor, a first speech processing request from the first in-vehicle console, wherein the first in-vehicle console comprises a first computer running at least one first speech-enabled application, where the first speech processing request comprises at least one first signal indicative of a first spoken utterance; (B) processing the first speech processing request to recognize first content in the first spoken utterance and generate a first processing result based, at least in part, on the recognized first content; (C) sending the first processing result to the first in-vehicle console; (D) receiving, at the speech processor, a second speech processing request from the second in-vehicle console, wherein the second in-vehicle console comprises a second computer running at least one second speech-enabled application, where the second speech processing request comprises at least one second signal indicative of a second spoken utterance; (E) processing the second speech processing request to recognize second content in the second spoken utterance and generate a second processing result based, at least in part, on the recognized second content; and (F) sending the second processing result to the second in-vehicle console; wherein the first in-vehicle console and second in-vehicle console are configured to be operated independently and simultaneously.

1. A method for use in a vehicle comprising a plurality of in-vehicle consoles comprising at least a first in-vehicle console and a second in-vehicle console, the method comprising acts, performed via a speech processor, of: (A) receiving, at the speech processor, a first speech processing request from the first in-vehicle console, wherein the first in-vehicle console comprises a first computer running at least one first speech-enabled application, where the first speech processing request comprises at least one first signal indicative of a first spoken utterance; (B) processing the first speech processing request to recognize first content in the first spoken utterance and generate a first processing result based, at least in part, on the recognized first content; (C) sending the first processing result to the first in-vehicle console; (D) receiving, at the speech processor, a second speech processing request from the second in-vehicle console, wherein the second in-vehicle console comprises a second computer running at least one second speech-enabled application, where the second speech processing request comprises at least one second signal indicative of a second spoken utterance; (E) processing the second speech processing request to recognize second content in the second spoken utterance and generate a second processing result based, at least in part, on the recognized second content; and (F) sending the second processing result to the second in-vehicle console; wherein the first in-vehicle console and second in-vehicle console are configured to be operated independently and simultaneously. 4. The method of claim 1 wherein the first in-vehicle console has a dock that allows at least one external device to interoperate with the console.

1. A computerized method for use by an online service provider to help maintain the privacy of offline identities of online users, the method comprising: a computer system testing a proposed online identifier which is a username or an avatar, by comparing at least a portion of said proposed online identifier's content to a set of personal identification information tokens; and the computer system accepting the proposed online identifier, which satisfies a predetermined privacy criterion, the privacy criterion being defined in terms of matches to personal identification information tokens to prevent said proposed online identifier from disclosing information about the online user's offline identity.

1. A computerized method for use by an online service provider to help maintain the privacy of offline identities of online users, the method comprising: a computer system testing a proposed online identifier which is a username or an avatar, by comparing at least a portion of said proposed online identifier's content to a set of personal identification information tokens; and the computer system accepting the proposed online identifier, which satisfies a predetermined privacy criterion, the privacy criterion being defined in terms of matches to personal identification information tokens to prevent said proposed online identifier from disclosing information about the online user's offline identity. 7. The method of claim 1 , wherein the testing step compares proposed online identifier content to a result of an online search engine search.

13. One or more memory devices having computer-executable instructions embodied thereon that, when executed, perform a method for providing a user interface, the method comprising: receiving a search query term; storing the search query term in a database, wherein the search query term is associated with a first identifier; generating a set of facets for the search query term; communicating for display the set of facets for the search query term; receiving a selected facet from the set of facets; storing the selected facet, wherein the selected facet is associated with a second identifier; matching the second identifier of the selected facet to the first identifier of the search query term, wherein the combination of operations of receiving the selected facet and matching the second identifier to the first identifier supports maintaining the state of the search query term corresponding to the set of facets when the selected facet corresponds to a facet in the set of facets of the search query term, wherein the selected facet that corresponds to the facet in the set of facets operates as an indication that the set of facets corresponding to the search query term will remain available on display, wherein maintaining comprises: (1) recalling the search query term from the database; and (2) re-generating the set of facets of the search query term; and communicating for display the set of facets.

13. One or more memory devices having computer-executable instructions embodied thereon that, when executed, perform a method for providing a user interface, the method comprising: receiving a search query term; storing the search query term in a database, wherein the search query term is associated with a first identifier; generating a set of facets for the search query term; communicating for display the set of facets for the search query term; receiving a selected facet from the set of facets; storing the selected facet, wherein the selected facet is associated with a second identifier; matching the second identifier of the selected facet to the first identifier of the search query term, wherein the combination of operations of receiving the selected facet and matching the second identifier to the first identifier supports maintaining the state of the search query term corresponding to the set of facets when the selected facet corresponds to a facet in the set of facets of the search query term, wherein the selected facet that corresponds to the facet in the set of facets operates as an indication that the set of facets corresponding to the search query term will remain available on display, wherein maintaining comprises: (1) recalling the search query term from the database; and (2) re-generating the set of facets of the search query term; and communicating for display the set of facets. 14. The method of claim 13 , wherein storing the search query term further comprises: wherein the first identifier and the second identifier are source identifiers used to identify the selected facet as corresponding the search query term.

1. A method for a computer network user for creating a voice XML file automatically, comprising: providing a graphic user interface (GUI) for defining a plurality of first and second icons, each of said first icons corresponding to one or more attributes of voice XML, and wherein at least one second icon corresponds to a hyperlink to a linkable voice XML file; receiving user selection input of said icons to edit a content stream displayed in said GUI to customize audio output of said content stream and to add one or more hyperlinks to one or more linkable voice XML files; recording an action stream of a user invoking said icons in the graphic user interface; interpreting said action stream based on a library of voice XML tags and generating voice XML tags for said content; and generating a voice XML file by combining the generated voice XML tags and the content stream including at least one hyperlink to a linkable voice XML file, wherein, upon listener hyperlink input to the generated voice XML file, audio accessed through said hyperlink is automatically delivered to said listener.

1. A method for a computer network user for creating a voice XML file automatically, comprising: providing a graphic user interface (GUI) for defining a plurality of first and second icons, each of said first icons corresponding to one or more attributes of voice XML, and wherein at least one second icon corresponds to a hyperlink to a linkable voice XML file; receiving user selection input of said icons to edit a content stream displayed in said GUI to customize audio output of said content stream and to add one or more hyperlinks to one or more linkable voice XML files; recording an action stream of a user invoking said icons in the graphic user interface; interpreting said action stream based on a library of voice XML tags and generating voice XML tags for said content; and generating a voice XML file by combining the generated voice XML tags and the content stream including at least one hyperlink to a linkable voice XML file, wherein, upon listener hyperlink input to the generated voice XML file, audio accessed through said hyperlink is automatically delivered to said listener. 4. The method according to claim 1 , wherein said receiving user selection input to add one or more hyperlinks to a content stream comprising a real-time-recorded audio voice XML stream by the steps of the user editing the real-time-recorded audio voice XML file in the edit area of said graphic user interface, marking or entering the parts to be added with the hyperlinks, invoking the corresponding icons and entering the corresponding hyperlink addresses, and wherein speech recognition technology is applied to find the parts in the real-time-recorded audio voice XML stream that match the parts entered by the user when interpreting said action stream based on a library of voice XML tags.

1. A medical response environment based speech recognition system, the system comprising: one or more filters to each generate a set of processed audio data based on raw audio data received from one or more computing devices, the one or more filters applying filter processes to the raw audio data to generate the set of processed audio data, the one or more filters comprising at least one filter appropriate for the medical response environment; a translator, operable by a processor, to provide a set of translation results for the raw audio data based on the set of processed audio data, each translation result being associated with at least one processed audio data and each translation result including a text data and a confidence level associated with that text data; and in response to receiving the set of translation results, a decision controller is automatically triggered by the processor to select the text data that represents the raw audio data, the decision control is operable to: identify at least one translation result from the set of translation results that includes the text data associated with the confidence level that exceeds a confidence threshold; determine whether the identified at least one translation result comprises more than one translation result; in response to determining the identified at least one translation result comprises more than one translation result, determine an occurrence frequency for each text data of the identified at least one translation result and select the text data based on the occurrence frequency, the occurrence frequency representing a number of times that the text data appears in the set of translation results; and generate an output signal associated with the selection by the decision controller.

1. A medical response environment based speech recognition system, the system comprising: one or more filters to each generate a set of processed audio data based on raw audio data received from one or more computing devices, the one or more filters applying filter processes to the raw audio data to generate the set of processed audio data, the one or more filters comprising at least one filter appropriate for the medical response environment; a translator, operable by a processor, to provide a set of translation results for the raw audio data based on the set of processed audio data, each translation result being associated with at least one processed audio data and each translation result including a text data and a confidence level associated with that text data; and in response to receiving the set of translation results, a decision controller is automatically triggered by the processor to select the text data that represents the raw audio data, the decision control is operable to: identify at least one translation result from the set of translation results that includes the text data associated with the confidence level that exceeds a confidence threshold; determine whether the identified at least one translation result comprises more than one translation result; in response to determining the identified at least one translation result comprises more than one translation result, determine an occurrence frequency for each text data of the identified at least one translation result and select the text data based on the occurrence frequency, the occurrence frequency representing a number of times that the text data appears in the set of translation results; and generate an output signal associated with the selection by the decision controller. 4. The speech recognition system of claim 1 , wherein each translation result comprises a sub-set of translation results for at least one of the processed audio data, the sub-set of translation results including two or more text data and each text data is associated with a respective confidence level.

3. The system according to claim 2 , wherein the memory further storing instructions that upon execution by the processor cause the system to: query the search tree storage unit according to the guiding Chinese character(s) to acquire the address information of the guiding recommended word(s) with the guiding Chinese character(s) as a prefix; query the recommended word database according to the address information of the guiding recommended word(s) to acquire corresponding recommended word(s) and then suggest the recommended word(s) to the user.

3. The system according to claim 2 , wherein the memory further storing instructions that upon execution by the processor cause the system to: query the search tree storage unit according to the guiding Chinese character(s) to acquire the address information of the guiding recommended word(s) with the guiding Chinese character(s) as a prefix; query the recommended word database according to the address information of the guiding recommended word(s) to acquire corresponding recommended word(s) and then suggest the recommended word(s) to the user. 4. The system according to claim 3 , wherein the system also comprises: a polyphonic word database and a phoneticizing unit; and wherein the memory further storing instructions that upon execution by the processor cause the system to: store Chinese character(s) and a marked Pinyin corresponding to the Chinese character(s); query the polyphonic word database to acquire the marked Pinyin corresponding to the input Chinese character when the number of the primary recommended word(s) is less than a preset threshold value; query again the recommended word database according to the Pinyin mark to acquire extended Chinese character(s) corresponding to the Pinyin mark; query the search tree storage unit according to the extended Chinese character(s) to acquire address information of extended recommended word(s) with the extended Chinese character(s) as a prefix; and query the recommended word database according to the address information of the mentioned extended recommended word(s) to acquire the extended recommended word(s) and then suggest the extended recommended word(s) to a user.

12. Apparatus for determining a requested map location, comprising: a database, which is arranged to hold a plurality of map objects having respective descriptors and loci; a user input device, which is arranged to accept a search query comprising one or more query terms that describe the requested map location; and a processor, which is arranged to identify in the database two or more matched map objects such that the respective descriptors of the matched map objects each match at least one of the query terms, to render the respective matched map objects onto a common grid using the loci, to identify grid cells overlapped by at least one of the rendered map objects, to assign respective scores to the identified grid cells based on a number of the matched map objects that overlap each of the identified grid cells, and to determine the requested map location responsively to the scores.

12. Apparatus for determining a requested map location, comprising: a database, which is arranged to hold a plurality of map objects having respective descriptors and loci; a user input device, which is arranged to accept a search query comprising one or more query terms that describe the requested map location; and a processor, which is arranged to identify in the database two or more matched map objects such that the respective descriptors of the matched map objects each match at least one of the query terms, to render the respective matched map objects onto a common grid using the loci, to identify grid cells overlapped by at least one of the rendered map objects, to assign respective scores to the identified grid cells based on a number of the matched map objects that overlap each of the identified grid cells, and to determine the requested map location responsively to the scores. 22. The apparatus according to claim 12 , wherein the map objects comprise streets having respective street names, and wherein at least one of the query terms comprises at least a part of a street name.

1. A computer-implemented method comprising: determining, using data associated with search queries submitted by past users of a search engine, that a particular search result selected by a particular, past user of the search engine includes a query term included in an initial search query, and a particular synonym that was generated for the query term included in the initial search query using a particular synonym rule, wherein the data associated with the search queries indicates that the particular search result was selected by the particular, past user of the search engine from among multiple search results that were generated by the search engine using the initial search query and one or more revised search queries that include the particular synonym for the query term; determining, using the data associated with the search queries, that a different search result that also includes the particular synonym for the query term was ranked above the particular search result and was not selected by the particular, past user of the search engine; in response to determining that (i) the particular search result selected by the particular, past user of the search engine includes the query term included in the initial search query, and the particular synonym for the query term, and (ii) the different search result that also includes the particular synonym for the query term was ranked above the particular search result and was not selected by the particular, past user of the search engine, incrementing a particular type of skip count for the particular synonym rule; and determining whether to revise a subsequently received search query that includes the query term included in the initial search query, to include the particular synonym for the query term, based at least on the particular type of skip count for the particular synonym rule.

1. A computer-implemented method comprising: determining, using data associated with search queries submitted by past users of a search engine, that a particular search result selected by a particular, past user of the search engine includes a query term included in an initial search query, and a particular synonym that was generated for the query term included in the initial search query using a particular synonym rule, wherein the data associated with the search queries indicates that the particular search result was selected by the particular, past user of the search engine from among multiple search results that were generated by the search engine using the initial search query and one or more revised search queries that include the particular synonym for the query term; determining, using the data associated with the search queries, that a different search result that also includes the particular synonym for the query term was ranked above the particular search result and was not selected by the particular, past user of the search engine; in response to determining that (i) the particular search result selected by the particular, past user of the search engine includes the query term included in the initial search query, and the particular synonym for the query term, and (ii) the different search result that also includes the particular synonym for the query term was ranked above the particular search result and was not selected by the particular, past user of the search engine, incrementing a particular type of skip count for the particular synonym rule; and determining whether to revise a subsequently received search query that includes the query term included in the initial search query, to include the particular synonym for the query term, based at least on the particular type of skip count for the particular synonym rule. 6. The method of claim 1 , wherein the different search result includes the query term included in the initial search query.

1. A processor-implemented method of lemmatizing a phrase for a specific category, the processor-implemented method comprising: receiving, by a processor, a string of binary data that represents an initial phrase, wherein the initial phrase is an initial version of the phrase, wherein the phrase comprises multiple words, and wherein the phrase is associated with a specific category; removing one or more letters from an end of a word in the initial phrase to form an initial truncated version of the phrase; running, by the processor, a term frequency-inverse document frequency (TF-IDF) algorithm on the initial truncated version of the phrase; the processor lemmatizing subsequent truncated versions of the initial phrase by recursively removing a remaining said one or more letters from the end of the word in a subsequent truncated version of the initial truncated version of the initial phrase; the processor running the TF-IDF algorithm on subsequent truncated versions of the initial truncated version of the initial phrase until a highest TF-IDF value is identified for a specific truncated version of the initial phrase when compared to TF-IDF values of other truncated versions of the initial phrase; assigning the specific truncated version of the initial phrase that is associated with the highest TF-IDF value to the specific category; in response to receiving a request for the phrase within the specific category, returning the specific truncated version of the initial phrase that is associated with the highest TF-IDF value for said specific category; and using the specific truncated version of the initial phrase that is associated with the highest TF-IDF value for said specific category to search a database that is dedicated to the specific category.

1. A processor-implemented method of lemmatizing a phrase for a specific category, the processor-implemented method comprising: receiving, by a processor, a string of binary data that represents an initial phrase, wherein the initial phrase is an initial version of the phrase, wherein the phrase comprises multiple words, and wherein the phrase is associated with a specific category; removing one or more letters from an end of a word in the initial phrase to form an initial truncated version of the phrase; running, by the processor, a term frequency-inverse document frequency (TF-IDF) algorithm on the initial truncated version of the phrase; the processor lemmatizing subsequent truncated versions of the initial phrase by recursively removing a remaining said one or more letters from the end of the word in a subsequent truncated version of the initial truncated version of the initial phrase; the processor running the TF-IDF algorithm on subsequent truncated versions of the initial truncated version of the initial phrase until a highest TF-IDF value is identified for a specific truncated version of the initial phrase when compared to TF-IDF values of other truncated versions of the initial phrase; assigning the specific truncated version of the initial phrase that is associated with the highest TF-IDF value to the specific category; in response to receiving a request for the phrase within the specific category, returning the specific truncated version of the initial phrase that is associated with the highest TF-IDF value for said specific category; and using the specific truncated version of the initial phrase that is associated with the highest TF-IDF value for said specific category to search a database that is dedicated to the specific category. 2. The processor-implemented method of claim 1 , wherein the specific category is a type of industry.

9. A computer-readable storage medium containing computer-executable instructions which when executed by a computer perform the steps for checking a sequence of input characters, the steps comprising: determining whether a sequence checking feature operatively associated with a state transition table, containing allowable sequences of characters based on the rules of a selected language, is enabled, the sequence checking feature being set to operate by a registry entry setting set in the computer's operating system's registry, the registry entry setting being set in the computer's operating system's registry for each language requiring the sequence checking feature; upon determining that the sequence checking feature is enabled: receiving a first character of the sequence of input characters; receiving a second character of the sequence of input characters; determining whether the sequence of characters belongs to a set of characters comprising a selected language by determining that a sequential order of reception of the first character relative to reception of the second character is consistent with at least one valid sequence of characters, said determining that the sequential order of reception of the first character relative to the reception of the second character is consistent with the at least one valid input of characters comprises: assigning a first state to the first character according to rules associated with the selected language, assigning a second state to the second character according to the rules, and determining that the state transition table includes a state transition from the first state to the second state, the state transition from the first state to the second state indicating that the sequential order of reception of the first character relative to reception of the second character is consistent with the at least one valid sequence of characters based on the rules of the selected language, said determining that the state transition table includes the state transition from the first state to the second state comprises determining that the state transition table includes a cell corresponding to a cross-reference of the first character and the second character, the cell not being blank and not including only type and replacement actions; when the first character and the second character form the at least one valid sequence of characters according to rules associated with forming a complex character, displaying the complex character formed by the first character and the second character prior to accepting additional characters for display; when the first character and the second character do not form the at least one valid sequence of characters according to the rules associated with forming the complex character: displaying the first character, prohibiting the display of the second character, and requiring receipt of a third character as an alternate character.

9. A computer-readable storage medium containing computer-executable instructions which when executed by a computer perform the steps for checking a sequence of input characters, the steps comprising: determining whether a sequence checking feature operatively associated with a state transition table, containing allowable sequences of characters based on the rules of a selected language, is enabled, the sequence checking feature being set to operate by a registry entry setting set in the computer's operating system's registry, the registry entry setting being set in the computer's operating system's registry for each language requiring the sequence checking feature; upon determining that the sequence checking feature is enabled: receiving a first character of the sequence of input characters; receiving a second character of the sequence of input characters; determining whether the sequence of characters belongs to a set of characters comprising a selected language by determining that a sequential order of reception of the first character relative to reception of the second character is consistent with at least one valid sequence of characters, said determining that the sequential order of reception of the first character relative to the reception of the second character is consistent with the at least one valid input of characters comprises: assigning a first state to the first character according to rules associated with the selected language, assigning a second state to the second character according to the rules, and determining that the state transition table includes a state transition from the first state to the second state, the state transition from the first state to the second state indicating that the sequential order of reception of the first character relative to reception of the second character is consistent with the at least one valid sequence of characters based on the rules of the selected language, said determining that the state transition table includes the state transition from the first state to the second state comprises determining that the state transition table includes a cell corresponding to a cross-reference of the first character and the second character, the cell not being blank and not including only type and replacement actions; when the first character and the second character form the at least one valid sequence of characters according to rules associated with forming a complex character, displaying the complex character formed by the first character and the second character prior to accepting additional characters for display; when the first character and the second character do not form the at least one valid sequence of characters according to the rules associated with forming the complex character: displaying the first character, prohibiting the display of the second character, and requiring receipt of a third character as an alternate character. 14. The computer-readable storage medium of claim 9 , wherein the rules comprise at least one rule for creating complex characters according to the selected language.

7. The method of claim 4 , further comprises: receiving a selection from the search results provided to the member; and adjusting a quality score of the entities and entity facts based on the selection from the search results provided to the member.

7. The method of claim 4 , further comprises: receiving a selection from the search results provided to the member; and adjusting a quality score of the entities and entity facts based on the selection from the search results provided to the member. 8. The method of claim 7 , wherein the adjusting occurs by auto-tuning without member input.

49. A computer readable storage medium having program code stored thereon, wherein the program code is arranged so that, when the program code is executed by a computer, a note is displayed, the note has an options area, a notation area, and a grab area, and the notation area and the grab area are different areas of the note and so that, when the options area is activated, a list of options is displayed, wherein the options area contains a nonmove option.

49. A computer readable storage medium having program code stored thereon, wherein the program code is arranged so that, when the program code is executed by a computer, a note is displayed, the note has an options area, a notation area, and a grab area, and the notation area and the grab area are different areas of the note and so that, when the options area is activated, a list of options is displayed, wherein the options area contains a nonmove option. 62. The computer readable storage medium of claim 49 wherein the options area contains a video and/or sound option.

1. A computer-implemented method comprising: accessing a social networking system question associated with a social networking system questioning user, the question associated with a plurality of answers provided by one or more social networking system answering users, the plurality of answers associated with a pre-determined order received from the questioning user; presenting the accessed question to a social networking system viewing user different than the questioning user; selecting a subset of the plurality of answers to present to the viewing user, the selected subset of answers comprising a threshold number of answers that have received a highest number of votes by social networking system answering users that have answered the question and that have established a connection with the viewing user, the threshold number selected based on a client device used by the viewing user to display the answer display; generating, by a processor, an answer display comprising the selected subset of answers, the selected subset of answers ordered within the answer display according to the pre-determined order received from the questioning user; and sending the answer display for display to the viewing user.

1. A computer-implemented method comprising: accessing a social networking system question associated with a social networking system questioning user, the question associated with a plurality of answers provided by one or more social networking system answering users, the plurality of answers associated with a pre-determined order received from the questioning user; presenting the accessed question to a social networking system viewing user different than the questioning user; selecting a subset of the plurality of answers to present to the viewing user, the selected subset of answers comprising a threshold number of answers that have received a highest number of votes by social networking system answering users that have answered the question and that have established a connection with the viewing user, the threshold number selected based on a client device used by the viewing user to display the answer display; generating, by a processor, an answer display comprising the selected subset of answers, the selected subset of answers ordered within the answer display according to the pre-determined order received from the questioning user; and sending the answer display for display to the viewing user. 7. The computer-implemented method of claim 1 , wherein the pre-determined order is further based on a number of votes received by each of the subset of answers from a set of social networking system answering users.

2. The method of creating a document layout of claim 1 further comprising the step of creating and outputting a formatted document using said particular document layout.

2. The method of creating a document layout of claim 1 further comprising the step of creating and outputting a formatted document using said particular document layout. 5. The method of creating a document layout according to claim 2 wherein step (b) comprises the steps of: (1) fetching a current object area from said ordered list of object areas; (2) creating a list of actual anchor points for said current object area according to said rule of placement; (3) fetching a current anchor point from said list of actual anchor points; (4) making a copy of a list of mapped object areas; (5) adding said current object area to said list of mapped object areas; (6) repeating steps (1) through (5) recursively for each subsequent object area until all of said object areas in said ordered list of object areas have been added to said list of mapped object areas creating a document layout; and (7) repeating steps (3) through (6) to create a plurality of lists of mapped object areas corresponding to a plurality of document layouts until there are no more actual anchor points at which to position any of said object areas.

1. A computer system method for matching an utterance of a user to a template comprising the steps of: (a) receiving by a processor the utterance from an input device, wherein the utterance includes at least one word; (b) accessing a set of template hierarchies from a database, wherein each template hierarchy in the set of template hierarchies includes at least one template; (c) comparing by the processor the at least one word of the utterance to at least one term of the at least one template of each template hierarchy in the set of template hierarchies; (d) determining by the processor whether the at least one word of the utterance matches the at least one term of the at least one template of each template hierarchy in the set of template hierarchies to obtain one or more matched terms; (e) calculating by the processor a score of the template hierarchy based on the one or more matched terms; (f) repeating steps (c)-(e) until there are no more words of the utterance for said comparing step; (g) populating the at least one template with at least one data element corresponding to the at least one term of the at least one template of each template hierarchy in the set of template hierarchies to obtain one or more populated templates; (h) computing a total score of each populated template of the one or more populated templates based on the one or more matched terms to obtain one or more scored populated templates; (i) selecting by the processor the one or more scored populated templates with a highest total score to obtain a matching populated template; (j) recording the at least one data element corresponding to the at least one term of the at least one template of each template hierarchy in the set of template hierarchies; and (k) communicating the matching populated template to the user.

1. A computer system method for matching an utterance of a user to a template comprising the steps of: (a) receiving by a processor the utterance from an input device, wherein the utterance includes at least one word; (b) accessing a set of template hierarchies from a database, wherein each template hierarchy in the set of template hierarchies includes at least one template; (c) comparing by the processor the at least one word of the utterance to at least one term of the at least one template of each template hierarchy in the set of template hierarchies; (d) determining by the processor whether the at least one word of the utterance matches the at least one term of the at least one template of each template hierarchy in the set of template hierarchies to obtain one or more matched terms; (e) calculating by the processor a score of the template hierarchy based on the one or more matched terms; (f) repeating steps (c)-(e) until there are no more words of the utterance for said comparing step; (g) populating the at least one template with at least one data element corresponding to the at least one term of the at least one template of each template hierarchy in the set of template hierarchies to obtain one or more populated templates; (h) computing a total score of each populated template of the one or more populated templates based on the one or more matched terms to obtain one or more scored populated templates; (i) selecting by the processor the one or more scored populated templates with a highest total score to obtain a matching populated template; (j) recording the at least one data element corresponding to the at least one term of the at least one template of each template hierarchy in the set of template hierarchies; and (k) communicating the matching populated template to the user. 8. The computer system method of claim 1 , wherein said computing step further comprises the step of establishing content of the one or more matched terms used in the at least one template.

1. An automated pricing system for use with transaction parties who provide respective sets of business rules for transactions to be processed, the system comprising: a database storing the business rules including the information for selecting a currency conversion standard and also storing tolerance information useful for setting contract terms, the tolerance information including at least one of: a tolerance payment range, a currency conversion rate tolerance, and a delivery term range; and a transaction processor computer circuit configured to access the business rules and operative using executable modules, with one of the modules configured with the computer circuit to, for each transaction, retrieve respective sets of business rules for parties involved in the transaction, the business rules including currency conversion base conditions, currency conversion tolerances and price tolerances, another module configured with the computer circuit to derive a specific term for each transaction, the transaction having a price in the base currency that is set as a function of the specific term, another module configured with the computer circuit to select a currency conversion standard for each transaction as a function of the business rules, the currency conversion standard being susceptible to fluctuation as a function of currency conversion rates, another module configured with the computer circuit to convert the set price, for each transaction, from the base currency into a converted price in a different currency as a function of the currency conversion standard and the currency-conversion tolerance information specified by the business rules, another module to use the respective sets of business rules provided by each of the parties to the transaction to select the currency conversion standard, the respective sets of business rules provided by each of the parties to the transaction including terms identifying a particular currency conversion standard, and to convert the set price from the first currency into a second different currency for at least one party to the transaction as a function of the currency conversion standard by using the currency conversion standard in response to the time that settlement is effected; and another module configured with the computer circuit, responsive to differences in business rules for each party used to derive the specific term, transform at least one of the business rules to set the price within the retrieved price tolerances, and deriving the specific term using the transformed business rules and according to the retrieved price tolerances.

1. An automated pricing system for use with transaction parties who provide respective sets of business rules for transactions to be processed, the system comprising: a database storing the business rules including the information for selecting a currency conversion standard and also storing tolerance information useful for setting contract terms, the tolerance information including at least one of: a tolerance payment range, a currency conversion rate tolerance, and a delivery term range; and a transaction processor computer circuit configured to access the business rules and operative using executable modules, with one of the modules configured with the computer circuit to, for each transaction, retrieve respective sets of business rules for parties involved in the transaction, the business rules including currency conversion base conditions, currency conversion tolerances and price tolerances, another module configured with the computer circuit to derive a specific term for each transaction, the transaction having a price in the base currency that is set as a function of the specific term, another module configured with the computer circuit to select a currency conversion standard for each transaction as a function of the business rules, the currency conversion standard being susceptible to fluctuation as a function of currency conversion rates, another module configured with the computer circuit to convert the set price, for each transaction, from the base currency into a converted price in a different currency as a function of the currency conversion standard and the currency-conversion tolerance information specified by the business rules, another module to use the respective sets of business rules provided by each of the parties to the transaction to select the currency conversion standard, the respective sets of business rules provided by each of the parties to the transaction including terms identifying a particular currency conversion standard, and to convert the set price from the first currency into a second different currency for at least one party to the transaction as a function of the currency conversion standard by using the currency conversion standard in response to the time that settlement is effected; and another module configured with the computer circuit, responsive to differences in business rules for each party used to derive the specific term, transform at least one of the business rules to set the price within the retrieved price tolerances, and deriving the specific term using the transformed business rules and according to the retrieved price tolerances. 15. The system of claim 1 , wherein the system is configured for use with a transaction involving a buyer and a seller and wherein the transaction processor computer circuit is adapted to convert the set price for the buyer or the seller into a currency selected by the buyer or seller for which the currency conversion is being made.

11. A computer program product for autonomic caching in an in memory data grid (IMDG), the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code for receiving from a client of the IMDG a request for a primary query in the IMDG; computer readable program code for monitoring resource utilization in the IMDG: computer readable program code for associating the primary query with a previously requested sub-query related to the primary query in response to the monitored resource utilization falling below a threshold value indicating available resource utilization, wherein associating the primary query with the previously requested sub-query comprises determining that a sub-query uses a portion of a result set from a previously requested primary query and mapping the previously requested primary query to the sub-query, wherein the previously requested sub-query is associated with the primary query in reference to fields of the primary query upon which the sub-query is based; computer readable program code for directing the sub-query concurrently with a directing of the primary query without waiting to receive a request for the sub-query from the client in response to the monitored resource utilization falling below the threshold value; and, computer readable program code for caching query results of the sub-query subsequent to a completion of the primary query.

11. A computer program product for autonomic caching in an in memory data grid (IMDG), the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code for receiving from a client of the IMDG a request for a primary query in the IMDG; computer readable program code for monitoring resource utilization in the IMDG: computer readable program code for associating the primary query with a previously requested sub-query related to the primary query in response to the monitored resource utilization falling below a threshold value indicating available resource utilization, wherein associating the primary query with the previously requested sub-query comprises determining that a sub-query uses a portion of a result set from a previously requested primary query and mapping the previously requested primary query to the sub-query, wherein the previously requested sub-query is associated with the primary query in reference to fields of the primary query upon which the sub-query is based; computer readable program code for directing the sub-query concurrently with a directing of the primary query without waiting to receive a request for the sub-query from the client in response to the monitored resource utilization falling below the threshold value; and, computer readable program code for caching query results of the sub-query subsequent to a completion of the primary query. 15. The computer program product of claim 11 , wherein the resource utilization is a request processing capacity for processing query requests.

1. A method of verifying content of a news story with a computing system, comprising: a) monitoring published items with the computing system in a knowledge domain including one or more social network domains, news content domains, blog domains and/or message board domains; b) processing news content with the computing system in a first set of items published in said knowledge domain to extract at least a first set of events referenced in such news content; c) identifying at least a first event in said first set of events described in a first content item published in said knowledge domain; d) automatically verifying with the computing system if said first event in said first content item has occurred in fact; wherein said automatically verifying is performed automatically in real-time by checking one or more verification sources by constructing and retrieving results from an automated query based on first content keywords extracted from said first content item; and e) generating a verification rating for said first event indicating a result of said verification step (d).

1. A method of verifying content of a news story with a computing system, comprising: a) monitoring published items with the computing system in a knowledge domain including one or more social network domains, news content domains, blog domains and/or message board domains; b) processing news content with the computing system in a first set of items published in said knowledge domain to extract at least a first set of events referenced in such news content; c) identifying at least a first event in said first set of events described in a first content item published in said knowledge domain; d) automatically verifying with the computing system if said first event in said first content item has occurred in fact; wherein said automatically verifying is performed automatically in real-time by checking one or more verification sources by constructing and retrieving results from an automated query based on first content keywords extracted from said first content item; and e) generating a verification rating for said first event indicating a result of said verification step (d). 23. The method of claim 1 wherein said automated query also includes predicted keywords determined from phrases determined to be temporally related to said first content keywords.

2. A system comprising: a mobile device associated with a vehicle, wherein the mobile device comprises: a transceiver; a controller operatively coupled to the transceiver; and one or more memory sources operatively coupled to the controller, the one or more memory sources including instructions for configuring the controller to generate one or more messages indicative of identification information and location information to be sent by the transceiver to a server device via a network connection, wherein the server device comprises: a transceiver configured to receive the one or more messages from the mobile device and a pick-up request from a client device via the network connection; a controller operatively coupled to the transceiver; and one or more memory sources operatively coupled to the controller, the one or more memory sources configuring the controller to: store the location information associated with the vehicle; determine if the location information associated with the vehicle is within a predetermined distance of the pick-up request; determine a travel path associated with the pick-up request and send a message indicative of the travel path to the mobile device; and determine an output value associated with the pick-request from a trained model.

2. A system comprising: a mobile device associated with a vehicle, wherein the mobile device comprises: a transceiver; a controller operatively coupled to the transceiver; and one or more memory sources operatively coupled to the controller, the one or more memory sources including instructions for configuring the controller to generate one or more messages indicative of identification information and location information to be sent by the transceiver to a server device via a network connection, wherein the server device comprises: a transceiver configured to receive the one or more messages from the mobile device and a pick-up request from a client device via the network connection; a controller operatively coupled to the transceiver; and one or more memory sources operatively coupled to the controller, the one or more memory sources configuring the controller to: store the location information associated with the vehicle; determine if the location information associated with the vehicle is within a predetermined distance of the pick-up request; determine a travel path associated with the pick-up request and send a message indicative of the travel path to the mobile device; and determine an output value associated with the pick-request from a trained model. 5. The system of claim 2 , further comprising: a plurality of the mobile devices associated with a plurality of the vehicles, respectively, wherein the controller is further configured to: determine a number of the plurality of vehicles within the predetermined distance of the pick-up request; and determine a charge for the pick-up request as the output value based upon the determined number of the plurality of vehicles.

15. The program of claim 14 , wherein the second display is further caused to perform the following additional steps: i. receive a list of available content items from the proxy server and display the list on the second display using the second character font set; ii. receive a selection of one or more of the available content items; and iii. transmit one or more reference identifiers identifying the one or more respective content items to the proxy server, iv. such that the one or more reference identifiers are configured to be employed at the proxy server with an authentication credential of the content playback and display device to request from one or more respective service providers that the one or more content items be made accessible for playback on the content playback and display device, whereby such playback occurs using the first language and character font set.

15. The program of claim 14 , wherein the second display is further caused to perform the following additional steps: i. receive a list of available content items from the proxy server and display the list on the second display using the second character font set; ii. receive a selection of one or more of the available content items; and iii. transmit one or more reference identifiers identifying the one or more respective content items to the proxy server, iv. such that the one or more reference identifiers are configured to be employed at the proxy server with an authentication credential of the content playback and display device to request from one or more respective service providers that the one or more content items be made accessible for playback on the content playback and display device, whereby such playback occurs using the first language and character font set. 20. The program of claim 15 , wherein the step of transmitting one or more reference identifiers identifying the one or more respective content items to the proxy server includes transmitting the reference identifiers directly to the content playback and display device whereby the content playback device transmits a request to a service provider using its authentication credential for the identified content items.

1. A method of machine learning in the selection of a ranked response to a structured data input having a natural language processing output schema received from a requesting device, the method comprising: in an electronic, machine learning processing system: receiving the structured data input, wherein the structured data input includes filtering parameters for conversion into response template filtering criteria; converting the filtering parameters into the response template filtering criteria; querying a library of response templates to identify candidate response templates that meet the response template filtering criteria to filter the response templates; receiving a selection of the candidate response templates that meet the response template filtering criteria and respond to the structured input data, wherein the candidate response templates include static data; operating a ranking engine to rank the selection of candidate response templates in accordance with ranking criteria; selecting a highest ranked candidate response template to provide a response to a device; deriving the response to the structured data input from the selected, highest ranked, candidate response template; providing the response to a recipient device; and providing feedback to the ranking engine to refine the ranking criteria.

1. A method of machine learning in the selection of a ranked response to a structured data input having a natural language processing output schema received from a requesting device, the method comprising: in an electronic, machine learning processing system: receiving the structured data input, wherein the structured data input includes filtering parameters for conversion into response template filtering criteria; converting the filtering parameters into the response template filtering criteria; querying a library of response templates to identify candidate response templates that meet the response template filtering criteria to filter the response templates; receiving a selection of the candidate response templates that meet the response template filtering criteria and respond to the structured input data, wherein the candidate response templates include static data; operating a ranking engine to rank the selection of candidate response templates in accordance with ranking criteria; selecting a highest ranked candidate response template to provide a response to a device; deriving the response to the structured data input from the selected, highest ranked, candidate response template; providing the response to a recipient device; and providing feedback to the ranking engine to refine the ranking criteria. 2. The method of claim 1 wherein the requesting device accesses data that provides insight into an individual and formulates the structured data input as a proactive query to obtain a proactive response to provide to the recipient device that is germane to the individual based on the insight.

4. A method for selecting target-entries from a find list of target-entries, each of the selected target-entries approximately matching a search-entry, comprising the steps of: examining the initial characters of the search-entry to identify at least one search preamble; selecting all of the target-entries in the find list of target-entries that begin with one of the search preambles; for each particular search preamble, retrieving any substitute preambles identified in a preamble exchange database for the particular search preamble; and selecting all of the target-entries in the find list of target-entries that begin with one of the substitute preambles.

4. A method for selecting target-entries from a find list of target-entries, each of the selected target-entries approximately matching a search-entry, comprising the steps of: examining the initial characters of the search-entry to identify at least one search preamble; selecting all of the target-entries in the find list of target-entries that begin with one of the search preambles; for each particular search preamble, retrieving any substitute preambles identified in a preamble exchange database for the particular search preamble; and selecting all of the target-entries in the find list of target-entries that begin with one of the substitute preambles. 5. The method of claim 4, wherein the search-entry includes a search-context that identifies particular contexts applicable to the search-entry and each particular target-entry in the find list of target-entries includes a context identifier, the context identifier identifying particular contexts associated with the particular target-entry, further comprising the steps of: examining the context identifier for each of the selected target-entries; and deselecting each target-entry that is not associated with a context identified in the search-context of the search-entry.

18. A computer-implemented method for providing translated content, comprising: providing, by one or more processors, to a first user a content instance in connection with an offer for consumption of an item in an electronic marketplace; receiving a translation of a content instance from the first user, the first user having a translator score, the translator score being based at least in part on particular translation scores for particular translations submitted by the first user and reviewer scores associated with one or more reviewers of the received translation; providing the received translation to the one or more reviewers; receiving one or more votes from a set of the one or more reviewers; calculating, based at least in part on the received one or more votes and the translator score, a translation score for the translation; and when the translation score satisfies one or more criteria, providing to a second user the translation of the content instance in connection with another offer for consumption of the item.

18. A computer-implemented method for providing translated content, comprising: providing, by one or more processors, to a first user a content instance in connection with an offer for consumption of an item in an electronic marketplace; receiving a translation of a content instance from the first user, the first user having a translator score, the translator score being based at least in part on particular translation scores for particular translations submitted by the first user and reviewer scores associated with one or more reviewers of the received translation; providing the received translation to the one or more reviewers; receiving one or more votes from a set of the one or more reviewers; calculating, based at least in part on the received one or more votes and the translator score, a translation score for the translation; and when the translation score satisfies one or more criteria, providing to a second user the translation of the content instance in connection with another offer for consumption of the item. 23. The computer implemented method of claim 18 , further comprising calculating a reviewer score for a particular reviewer of the one or more reviewers based at least in part on agreement of the particular reviewer with one or more other reviewers, and wherein calculating the translation score for a translation reviewed by the particular reviewer is based at least in part on the particular reviewer score.

5. A computer-implemented process for graphing social connections among entities' names extracted from general Web pages by creating a 2-D graph with a set of vertices representing names, and a set of edges representing social connections, comprising: using a computing device to perform: receiving a ranked list of social connections between a social graph owner and additional entities obtained from information blocks extracted from the general Web pages, wherein the ranked list was obtained by using a context measure of a relationship and a distance measure of relationship, wherein the context measure of relationship is based on a keyword of a keyword set being found between the name of the social graph owner and a name of an entity in an information block, and wherein the distance measure of relationship is determined by measuring the distance between the name of the social graph owner and a name of an entity; on a display placing the social graph owner in the center of the 2D graph as a center vertex; for each of the additional entities, placing a vertex representing a name of an entity in the ranked list in a difference orbit around the center vertex where the shorter the orbit's radius is, the stronger a social connection between the vertex in the orbit and the center vertex is; clustering the vertices into different clusters according to connectivity between the vertices; placing the vertices in the same cluster closer to each other than to vertices in other clusters; placing clusters of vertices so that clusters of vertices do not overlap each other; and using a force-directed model to improve the uniformity of the 2D layout.

5. A computer-implemented process for graphing social connections among entities' names extracted from general Web pages by creating a 2-D graph with a set of vertices representing names, and a set of edges representing social connections, comprising: using a computing device to perform: receiving a ranked list of social connections between a social graph owner and additional entities obtained from information blocks extracted from the general Web pages, wherein the ranked list was obtained by using a context measure of a relationship and a distance measure of relationship, wherein the context measure of relationship is based on a keyword of a keyword set being found between the name of the social graph owner and a name of an entity in an information block, and wherein the distance measure of relationship is determined by measuring the distance between the name of the social graph owner and a name of an entity; on a display placing the social graph owner in the center of the 2D graph as a center vertex; for each of the additional entities, placing a vertex representing a name of an entity in the ranked list in a difference orbit around the center vertex where the shorter the orbit's radius is, the stronger a social connection between the vertex in the orbit and the center vertex is; clustering the vertices into different clusters according to connectivity between the vertices; placing the vertices in the same cluster closer to each other than to vertices in other clusters; placing clusters of vertices so that clusters of vertices do not overlap each other; and using a force-directed model to improve the uniformity of the 2D layout. 8. The computer-implemented process of claim 5 wherein the force directed model further comprises a repulsive force between adjacent orbits and wherein each orbit is either radially or tangentially free or both radially and tangentially free so that the orbit can move according to the repulsive force.

1. A computer-implemented method of generating at least a portion of an integrated circuit design, the method comprising: providing a user with an integrated circuit design for a processor or processor peripheral device, the integrated circuit design described by a hardware description language model; assigning default values to a plurality of design parameters from a set of design parameters for the hardware description language model, the plurality of design parameters including at least a cache size parameter and a parameter indicating either to include or not include in the integrated circuit design an interface to memory external to the processor or processor peripheral device; providing a graphical user interface (GUI) displaying a representation of the cache size parameter and a representation of the parameter indicating either to include or not include in the integrated circuit design the interface to memory external to the processor or processor peripheral device; receiving, via the GUI, one or more inputs from the user for at least one of the set of design parameters to customize the integrated circuit design responsive to assigning the default values, the received set of design parameters including a cache size and an indication to include the interface to memory in the integrated circuit design; displaying, via the GUI, a plurality of memory extensions available to an extension algorithm for inclusion in the integrated circuit design based on the indication to include the interface to memory in the integrated circuit design, the plurality of memory extensions including a load and storage memory controller, an instruction fetch memory controller, a host interface for communication with the processor or processor peripheral device, an arbitration unit for memory access, and a random access memory sequencer; receiving, via the GUI, a selection of one or more of the plurality of memory extensions for inclusion in the integrated circuit design; determining, using the extension algorithm, the one or more of the plurality of memory extensions that were selected via the GUI; and generating, by a computer, an updated hardware description language model for the integrated circuit design based on the received set of design parameters and the hardware description language model, wherein the processor or processor peripheral device is fabricated based at least in part on the updated hardware description language model.

1. A computer-implemented method of generating at least a portion of an integrated circuit design, the method comprising: providing a user with an integrated circuit design for a processor or processor peripheral device, the integrated circuit design described by a hardware description language model; assigning default values to a plurality of design parameters from a set of design parameters for the hardware description language model, the plurality of design parameters including at least a cache size parameter and a parameter indicating either to include or not include in the integrated circuit design an interface to memory external to the processor or processor peripheral device; providing a graphical user interface (GUI) displaying a representation of the cache size parameter and a representation of the parameter indicating either to include or not include in the integrated circuit design the interface to memory external to the processor or processor peripheral device; receiving, via the GUI, one or more inputs from the user for at least one of the set of design parameters to customize the integrated circuit design responsive to assigning the default values, the received set of design parameters including a cache size and an indication to include the interface to memory in the integrated circuit design; displaying, via the GUI, a plurality of memory extensions available to an extension algorithm for inclusion in the integrated circuit design based on the indication to include the interface to memory in the integrated circuit design, the plurality of memory extensions including a load and storage memory controller, an instruction fetch memory controller, a host interface for communication with the processor or processor peripheral device, an arbitration unit for memory access, and a random access memory sequencer; receiving, via the GUI, a selection of one or more of the plurality of memory extensions for inclusion in the integrated circuit design; determining, using the extension algorithm, the one or more of the plurality of memory extensions that were selected via the GUI; and generating, by a computer, an updated hardware description language model for the integrated circuit design based on the received set of design parameters and the hardware description language model, wherein the processor or processor peripheral device is fabricated based at least in part on the updated hardware description language model. 8. The method of claim 1 , further comprising: evaluating an acceptability of the updated hardware description language model using test code.

13. The method of claim 12 , further comprising receiving a clinician input accepting or rejecting the general interpretation output.

13. The method of claim 12 , further comprising receiving a clinician input accepting or rejecting the general interpretation output. 14. The method of claim 13 , further comprising further training the general interpretation module based on the clinician input.

16. An improved password validation system comprising: (a) means for accessing a data base of bad passwords, wherein each said bad password is comprised of one or more characters; (b) means for computing a frequency of occurrence of said bad password characters; (c) means for computing a probability of occurrence T, within said bad passwords, of the bad password characters using the computed frequency of occurrence; (d) means for inputting a validation password to the system, wherein said validation password is comprised of one or more characters; and (e) comparitor means for comparing said validation password characters with the probability of occurrence T of the bad password characters.

16. An improved password validation system comprising: (a) means for accessing a data base of bad passwords, wherein each said bad password is comprised of one or more characters; (b) means for computing a frequency of occurrence of said bad password characters; (c) means for computing a probability of occurrence T, within said bad passwords, of the bad password characters using the computed frequency of occurrence; (d) means for inputting a validation password to the system, wherein said validation password is comprised of one or more characters; and (e) comparitor means for comparing said validation password characters with the probability of occurrence T of the bad password characters. 30. An improved password validation system according to claim 16, wherein the means for computing the probability of occurrence T utilizes a Markov model comprised of a common alphabet plus selected other characters.

20. A method according to claim 19 , wherein the step of deporting exporting said elements includes the steps of: creating a table in said document; and placing in said table said exported elements.

20. A method according to claim 19 , wherein the step of deporting exporting said elements includes the steps of: creating a table in said document; and placing in said table said exported elements. 21. A method according to claim 20 , wherein the placing step includes the step of placing in said table additional data associated with said exported elements.

7. The method according to claim 1 , wherein using the schema and the portions of the markup language fragment respectively corresponding to the child nodes for data entry with the data entry fields further comprises displaying an electronic form on a user interface (UI) for interactive data entry with the electronic form.

7. The method according to claim 1 , wherein using the schema and the portions of the markup language fragment respectively corresponding to the child nodes for data entry with the data entry fields further comprises displaying an electronic form on a user interface (UI) for interactive data entry with the electronic form. 8. The method according to claim 7 , wherein the formed markup language fragment is formed when the electronic form is created.

1. A method comprising: identifying a user interaction by traversing a social graph maintained by a social network system, wherein the user interaction is without a corresponding explicit social graph connection in the social graph, the user interaction involving both a first social network object and a second social network object; generating an implicit social graph connection between the first social network object and the second social network object based on the user interaction that is without the corresponding explicit social graph connection; and storing the implicit social graph connection in the social graph of the social network system; and providing a social network service that selectively presents, based on the implicit social graph connection, a content entry to a client device of the social network system.

1. A method comprising: identifying a user interaction by traversing a social graph maintained by a social network system, wherein the user interaction is without a corresponding explicit social graph connection in the social graph, the user interaction involving both a first social network object and a second social network object; generating an implicit social graph connection between the first social network object and the second social network object based on the user interaction that is without the corresponding explicit social graph connection; and storing the implicit social graph connection in the social graph of the social network system; and providing a social network service that selectively presents, based on the implicit social graph connection, a content entry to a client device of the social network system. 3. The method of claim 1 , wherein the user interaction is a communication action or a reference action, wherein the communication action refers to a messaging event between social network objects of the social network system and the reference action refers one social network object publishing content to the social network system that references another social network object.

10. A system comprising: a comparing engine to compare, using one or more processors, a first search result with a second search result to automatically identify from the first search result at least one data item that is new or modified as compared to the second search result, the first search result comprising a first set of data items satisfying a first set of user-specific search criteria and the second search result comprising a second set of data items satisfying a second set of user-specific search criteria; and a notification engine to send a notification of a result of the comparing to a user device.

10. A system comprising: a comparing engine to compare, using one or more processors, a first search result with a second search result to automatically identify from the first search result at least one data item that is new or modified as compared to the second search result, the first search result comprising a first set of data items satisfying a first set of user-specific search criteria and the second search result comprising a second set of data items satisfying a second set of user-specific search criteria; and a notification engine to send a notification of a result of the comparing to a user device. 14. The system of claim 10 , wherein each data item of the first set of data items comprises a change tag to indicate whether a change has occurred to the data item.

20. A system for generating metadata relating to a media object, the system comprising: a content analysis module configured to determine input data, the input data comprising content data determined by analyzing content of the media object; a machine learning module, configured to generate new metadata responsive to the input data; and metadata storage, configured to receive the new metadata and store the new metadata as well as a correspondence between the new metadata and the media object.

20. A system for generating metadata relating to a media object, the system comprising: a content analysis module configured to determine input data, the input data comprising content data determined by analyzing content of the media object; a machine learning module, configured to generate new metadata responsive to the input data; and metadata storage, configured to receive the new metadata and store the new metadata as well as a correspondence between the new metadata and the media object. 21. The system of claim 20 , further comprising a feedback module, configured to collect feedback relating to the correspondence, wherein the metadata storage is further configured to modify the correspondence responsive to the feedback.

13. In a knowledge-based authentication (KBA) system, a computer program product having a non-transitory, computer-readable storage medium which stores code to generate a set of questions, the code including instructions to: collect a set of facts that have references to a population of users; receive a request to authenticate a particular user claiming to belong to a group of users included in the population of users; in response to the request, identify a set of group facts, each group fact of the set of group facts being included in the set of facts and having references to users of the group of users; and generate the set of questions from the set of group facts, responses to questions of the set of questions provided by the particular user being indicative of whether the particular user belongs to the group of users; wherein generating the set of questions from the set of group facts includes: for each group fact of the set of group facts, producing an internal link strength that represents a number of users of the group of users referenced by that group fact; using a group fact of the set of group facts to produce a question of the set of questions when the internal link strength for the group fact is greater than a threshold internal link strength; and not using the group fact in producing questions of the set of questions when the internal link strength for the group fact is less than the threshold internal link strength.

13. In a knowledge-based authentication (KBA) system, a computer program product having a non-transitory, computer-readable storage medium which stores code to generate a set of questions, the code including instructions to: collect a set of facts that have references to a population of users; receive a request to authenticate a particular user claiming to belong to a group of users included in the population of users; in response to the request, identify a set of group facts, each group fact of the set of group facts being included in the set of facts and having references to users of the group of users; and generate the set of questions from the set of group facts, responses to questions of the set of questions provided by the particular user being indicative of whether the particular user belongs to the group of users; wherein generating the set of questions from the set of group facts includes: for each group fact of the set of group facts, producing an internal link strength that represents a number of users of the group of users referenced by that group fact; using a group fact of the set of group facts to produce a question of the set of questions when the internal link strength for the group fact is greater than a threshold internal link strength; and not using the group fact in producing questions of the set of questions when the internal link strength for the group fact is less than the threshold internal link strength. 17. A computer program product according to claim 13 , wherein each fact of the set of facts includes a value of a time-to-live (TTL) parameter; wherein the method further includes: excluding the fact in producing questions of the set of questions when the value of the TTL parameter exceeds a threshold TTL value.

3. A text display system as claimed in claim 2 wherein a display area corresponds to a window.

3. A text display system as claimed in claim 2 wherein a display area corresponds to a window. 4. A text display system as claimed in claim 3 wherein the size of the window corresponds to the complete screen of the display means.

1. A non-transitory machine-readable storage medium encoded with instructions for execution by a network node, the medium comprising: instructions for establishing context objects in memory in response to receiving a message, wherein the context objects have respective context object types based on respective pre-stored context artifacts that define the respective context object types and the respective pre-stored context artifacts include computer code defining at least one new function, respectively; and instructions for processing the received message comprising: instructions for evaluating a plurality of rules to identify an applicable rule of the plurality of rules, instructions for performing at least one action specified by the applicable rule, and instructions for executing computer code placed in memory from the pre-stored context artifact that defines the context object type of the established context object, wherein the instructions for executing computer code are configured to be executed as part of at least one of the instructions for evaluating a plurality of rules and the instructions for performing at least one action specified by the applicable rule.

1. A non-transitory machine-readable storage medium encoded with instructions for execution by a network node, the medium comprising: instructions for establishing context objects in memory in response to receiving a message, wherein the context objects have respective context object types based on respective pre-stored context artifacts that define the respective context object types and the respective pre-stored context artifacts include computer code defining at least one new function, respectively; and instructions for processing the received message comprising: instructions for evaluating a plurality of rules to identify an applicable rule of the plurality of rules, instructions for performing at least one action specified by the applicable rule, and instructions for executing computer code placed in memory from the pre-stored context artifact that defines the context object type of the established context object, wherein the instructions for executing computer code are configured to be executed as part of at least one of the instructions for evaluating a plurality of rules and the instructions for performing at least one action specified by the applicable rule. 4. The non-transitory machine-readable storage medium of claim 1 , wherein the instructions for performing at least one action are configured to cause execution of the instructions for executing computer code placed in memory from the pre-stored context artifact.

11. A computer storage medium having stored thereon computer executable instructions which when executed by a processor in a computer system implement steps for performing static type checking of dynamic languages in an Integrated Development Environment (IDE), the steps comprising: receiving input to the IDE that specifies a supplemental type system to be added to the IDE, the IDE having a base type system corresponding to an object-oriented programming language, the supplemental type system comprising one of an XML data model or a relational data model; attaching elements of the supplemental type system to objects of the base type system such that the objects are associated with a base type and a supplemental type; and in response to receiving user input into a text editor of the IDE, the user input being associated with an object of the base type system, providing visual feedback that is based on the base type of the object as well as the supplemental type associated with the object.

11. A computer storage medium having stored thereon computer executable instructions which when executed by a processor in a computer system implement steps for performing static type checking of dynamic languages in an Integrated Development Environment (IDE), the steps comprising: receiving input to the IDE that specifies a supplemental type system to be added to the IDE, the IDE having a base type system corresponding to an object-oriented programming language, the supplemental type system comprising one of an XML data model or a relational data model; attaching elements of the supplemental type system to objects of the base type system such that the objects are associated with a base type and a supplemental type; and in response to receiving user input into a text editor of the IDE, the user input being associated with an object of the base type system, providing visual feedback that is based on the base type of the object as well as the supplemental type associated with the object. 19. The computer storage medium of claim 11 , wherein the user input into the text editor comprises the object followed by a “.” and a sub-element of either the base type system or the supplemental type system, and wherein the visual feedback comprises an indication that the sub-element is not a proper sub-element of the object.

11. A computer program product comprising a non-transitory computer-readable storage medium including executable code for selecting a classifier for production, the code when executed performs steps comprising: identifying a plurality of classifiers; selecting a set of test cases based on time; grouping the set of test cases into a plurality of datasets based on time, each of the plurality of datasets associated with a different interval of time; applying each of the plurality of classifiers to each of the plurality of datasets to generate classifications for test cases in each of the plurality of datasets; determining, for each of the plurality of classifiers, a classification performance score for each of the plurality of datasets based on the classifications generated for the test cases of each dataset; determining, for each of the plurality of classifiers, a variance across the classification performance scores for the plurality of data sets; and selecting a classifier from among the plurality of classifiers for production, the selected classifier having a least amount of variance across the classification performance scores for the plurality of datasets associated with the different intervals of time.

11. A computer program product comprising a non-transitory computer-readable storage medium including executable code for selecting a classifier for production, the code when executed performs steps comprising: identifying a plurality of classifiers; selecting a set of test cases based on time; grouping the set of test cases into a plurality of datasets based on time, each of the plurality of datasets associated with a different interval of time; applying each of the plurality of classifiers to each of the plurality of datasets to generate classifications for test cases in each of the plurality of datasets; determining, for each of the plurality of classifiers, a classification performance score for each of the plurality of datasets based on the classifications generated for the test cases of each dataset; determining, for each of the plurality of classifiers, a variance across the classification performance scores for the plurality of data sets; and selecting a classifier from among the plurality of classifiers for production, the selected classifier having a least amount of variance across the classification performance scores for the plurality of datasets associated with the different intervals of time. 14. The computer program product of claim 11 , wherein determining the classification performance score of each of the plurality of classifiers comprises: identifying, for the plurality of datasets, a plurality of first labels for the test cases in each dataset, each first label describing an accurate classification of a corresponding test case as being associated with a first classification or a second classification; comparing, for each of the plurality of classifiers, the generated classifications of test cases for each of the plurality of datasets with the plurality of first labels corresponding to the test cases in each of the plurality of datasets; and determining, for each of the plurality of classifiers, a classification performance score associated with each of the plurality of datasets based on the comparison.

23. In an electronic program guide system for television programs, a system for automatically verifying the integrity of the data contained in a database of television program schedule information comprising: storage means for storing a database of television program schedule information, said database comprising a plurality of data fields for a plurality of television stations means for selecting a station list file for comparison with said plurality of television stations in said database; a data processor for automatically comparing said station list file against said data fields for said plurality of stations in said database to determine if each station in said file is included in said database; and a display device for displaying information identifying stations in said file not included in said database.

23. In an electronic program guide system for television programs, a system for automatically verifying the integrity of the data contained in a database of television program schedule information comprising: storage means for storing a database of television program schedule information, said database comprising a plurality of data fields for a plurality of television stations means for selecting a station list file for comparison with said plurality of television stations in said database; a data processor for automatically comparing said station list file against said data fields for said plurality of stations in said database to determine if each station in said file is included in said database; and a display device for displaying information identifying stations in said file not included in said database. 24. The system of claim 23 wherein said data processor automatically locates missing titles in said data fields for said plurality of stations and said display device displays information identifying the locations of said missing titles.

1. A keyword presenting device comprising: an extraction unit configured to extract a plurality of keywords from a browsing document; a determination unit configured to arrange keywords, of the plurality of keywords, with spellings similar to each other to obtain a plurality of groups of similar keywords; an integration unit configured to classify keywords of each of the plurality of groups into a main keyword that is a title and at least one sub-keyword, and to associate the main keyword with the sub-keywords for each of the plurality of groups; and a presentation unit configured to present the main keywords of respective groups of the plurality of groups, wherein the presentation unit is further configured to, in response to one of the main keywords being selected by a user, allow selection of a sub-keyword, with a spelling similar to the one of the main keywords, of the at least one sub-keyword associated with the one of the main keywords.

1. A keyword presenting device comprising: an extraction unit configured to extract a plurality of keywords from a browsing document; a determination unit configured to arrange keywords, of the plurality of keywords, with spellings similar to each other to obtain a plurality of groups of similar keywords; an integration unit configured to classify keywords of each of the plurality of groups into a main keyword that is a title and at least one sub-keyword, and to associate the main keyword with the sub-keywords for each of the plurality of groups; and a presentation unit configured to present the main keywords of respective groups of the plurality of groups, wherein the presentation unit is further configured to, in response to one of the main keywords being selected by a user, allow selection of a sub-keyword, with a spelling similar to the one of the main keywords, of the at least one sub-keyword associated with the one of the main keywords. 7. The keyword presenting device according to claim 1 , wherein the presentation unit is further configured to present the main keywords of the respective groups so that the main keyword that is associated with the sub-keyword with the spelling similar to the main keyword is visually distinguishable from another main keyword that is not associated with the sub-keyword with the spelling similar to the main keyword.

2. The method of claim 1 , wherein determining that the user belongs to the first population group comprises determining, using the server device, demographic data associated with the user.

2. The method of claim 1 , wherein determining that the user belongs to the first population group comprises determining, using the server device, demographic data associated with the user. 5. The method of claim 2 , wherein determining the demographic data comprises determining, using the server device, a least one of the following: age, age range, sex, race, primary language, secondary language, location, income, income range, a continent, a region, a country, a state, a county, a city, a gender, an ethnic group, a group, persons with a shared characteristic, persons with a shared interest, persons grouped by a predetermined selection, and internet service provider data.

15. A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to perform at least the following steps: construct a reduced ordered binary decision diagram from a resource description framework graph; compute a hash identifier corresponding to the decision diagram; and cause, at least in part, a storing of the hash identifier with the decision diagram.

15. A non-transitory computer-readable storage medium carrying one or more sequences of one or more instructions which, when executed by one or more processors, cause an apparatus to perform at least the following steps: construct a reduced ordered binary decision diagram from a resource description framework graph; compute a hash identifier corresponding to the decision diagram; and cause, at least in part, a storing of the hash identifier with the decision diagram. 20. A non-transitory computer-readable storage medium of claim 15 , wherein the apparatus is caused to further perform: encrypt the hash identifier with a key to generate a keyed hash identifier of the decision diagram; and cause, at least in part, a transmitting of the keyed hash identifier and an identifier of the key in response to a query.

1. A system for using a computer to improve a precision ratio when searching a resume database, comprising: a memory device resident in the computer; and a processor disposed in communication with the memory device, the processor configured to: receive a request to search the resume database; receive search criteria; send a database query to the resume database, the database query including the search criteria; receive a result set in response to the database query, the result set including at least one matching resume; and send the result set in a response to the request, wherein the resume database includes at least one resume, and a parsed resume associated with each resume, wherein each resume includes at least one skill or experience-related phrase, wherein each skill or experience-related phrase has an experience range determined by examining a use of the skill or experience-related phrase in the resume, and a term of experience based on the experience range, wherein the term of experience for each skill or experience-related phrase having multiple occurrences in the resume is a summation of the term of experience, or a portion of the term of experience, for each occurrence of the skill or experience-related phrase associated with a different experience range, wherein each parsed resume includes each said at least one skill or experience-related phrase located in the resume, the term of experience for each said at least one skill or experience-related phrase, and a relationship between the term of experience and each said at least one skill or experience-related phrase, and wherein each matching resume is one of said at least one resume having the parsed resume associated with the matching resume satisfying the search criteria.

1. A system for using a computer to improve a precision ratio when searching a resume database, comprising: a memory device resident in the computer; and a processor disposed in communication with the memory device, the processor configured to: receive a request to search the resume database; receive search criteria; send a database query to the resume database, the database query including the search criteria; receive a result set in response to the database query, the result set including at least one matching resume; and send the result set in a response to the request, wherein the resume database includes at least one resume, and a parsed resume associated with each resume, wherein each resume includes at least one skill or experience-related phrase, wherein each skill or experience-related phrase has an experience range determined by examining a use of the skill or experience-related phrase in the resume, and a term of experience based on the experience range, wherein the term of experience for each skill or experience-related phrase having multiple occurrences in the resume is a summation of the term of experience, or a portion of the term of experience, for each occurrence of the skill or experience-related phrase associated with a different experience range, wherein each parsed resume includes each said at least one skill or experience-related phrase located in the resume, the term of experience for each said at least one skill or experience-related phrase, and a relationship between the term of experience and each said at least one skill or experience-related phrase, and wherein each matching resume is one of said at least one resume having the parsed resume associated with the matching resume satisfying the search criteria. 5. The system of claim 1 , wherein to receive the result set, the processor is further configured to: receive a portion of the result set in response to the database query.