Abstract: This disclosure provides systems, methods and apparatuses for converting natural language text in financial documents to mathematical operations for a financial management program. In some implementations, a computing device may obtain a first segment of computer readable text associated with a text capture in a financial document, parse only a portion of the first segment to generate a parsed segment, and determine translation information associated with the parsed segment to translate the parsed segment. The computing device may also store the parsed segment and the translation information in a data structure in memory, translate the parsed segment in the data structure based on the translation information, and output one or more computer readable mathematical operations corresponding to the translated segment. In this manner, the computing device may output the one or more computer readable mathematical operations without parsing all of the segment.

Abstract: This disclosure provides systems, methods and apparatuses for converting natural language text in financial documents to mathematical operations for a financial management program. In some implementations, a computing device may obtain a first segment of computer readable text associated with a text capture in a financial document, parse only a portion of the first segment to generate a parsed segment, and determine translation information associated with the parsed segment to translate the parsed segment. The computing device may also store the parsed segment and the translation information in a data structure in memory, translate the parsed segment in the data structure based on the translation information, and output one or more computer readable mathematical operations corresponding to the translated segment. In this manner, the computing device may output the one or more computer readable mathematical operations without parsing all of the segment.

Abstract: Computer-implemented systems, methods and articles for preparing and/or submitting a plurality of different types of compliance forms for submission to a regulatory agency. The system includes a computing device, a data store, and a compliance form software program executable by the computing device. The compliance program includes a universal calculation engine, logic agent and user interface manager which are configured to process a respective domain model configured for each type of compliance form. Each domain model includes a calculation graph, a completeness model comprising decision table(s) and/or completeness graph(s), user interface assets and filing rules configured specifically for a particular type of compliance form. The rules and regulations for each type of compliance form are embodied in the declaratory data structures of the respective calculation graph and completeness graph for each domain model.

Abstract: A method for collecting a payment. The method includes sending, to a payor, a request for the payment, wherein the request comprises an original payment amount and an original payment due date, generating, based on a set of payment collection records from an online financial management application used by payees, a payment statistical measure representing a payment behavior of payors paying the payees, generating, based on the payment statistical measure, the original payment amount, and the original payment due date, an adjusted payment amount and a condition to qualify the adjusted payment amount for completing the payment, enabling, prior to the payor completing the payment, the payor to view the adjusted payment amount and the condition, wherein the payor completes the payment in response to at least the payor viewing the adjusted payment amount and the condition, and collecting the payment completed by the payor.

Abstract: Computer-implemented systems, methods and articles for preparing and/or submitting a plurality of different types of compliance forms for submission to a regulatory agency. The system includes a computing device, a data store, and a compliance form software program executable by the computing device. The compliance program includes a universal calculation engine, logic agent and user interface manager which are configured to process a respective domain model configured for each type of compliance form. Each domain model includes a calculation graph, a completeness model comprising decision table(s) and/or completeness graph(s), user interface assets and filing rules configured specifically for a particular type of compliance form. The rules and regulations for each type of compliance form are embodied in the declaratory data structures of the respective calculation graph and completeness graph for each domain model.

Abstract: The disclosed embodiments relate to a tax-information assembly technique, which extracts tax information and associated context information from income-tax documents, where these income-tax documents are associated with an income-tax agency, and some of the income-tax documents include the same tax information in different document formats. During this technique, semantic and structural heuristics are used to identify tax phrases in the extracted tax information. Moreover, additional tax phrases in the extracted tax information are identified using a statistical identification technique. Next, relationships between the tax phrases and the additional tax phrases are determined, and the context information is used to consolidate the tax phrases and the additional tax phrases into a tax-information data structure.

Abstract: The present invention solves a number of problems in using stems (canonical indicators of word meanings) in full-text retrieval of natural language documents, and thus permits recall to be improved without sacrificing precision. It uses various arrangements of finite-state transducers to accurately encode a number of desirable ways of mapping back and forth between words and stems, taking into account both systematic aspects of a language's morphological rule system and also the word-by-word irregularities that also occur. The techniques described apply generally across the languages of the world and are not just limited to simple suffixing languages like English. Although the resulting transducers can have many states and transitions or arcs, they can be compacted by finite-state compression algorithms so that they can be used effectively in resource-limited applications.