AU2007200402A1 - Completeness in dependency networks - Google Patents

Completeness in dependency networks Download PDF

Info

Publication number
AU2007200402A1
AU2007200402A1 AU2007200402A AU2007200402A AU2007200402A1 AU 2007200402 A1 AU2007200402 A1 AU 2007200402A1 AU 2007200402 A AU2007200402 A AU 2007200402A AU 2007200402 A AU2007200402 A AU 2007200402A AU 2007200402 A1 AU2007200402 A1 AU 2007200402A1
Authority
AU
Australia
Prior art keywords
variables
relevant
dataset
document
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
AU2007200402A
Inventor
Philip Edgar Vasey
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Business Integrity Ltd
Original Assignee
Business Integrity Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Business Integrity Ltd filed Critical Business Integrity Ltd
Priority to AU2007200402A priority Critical patent/AU2007200402A1/en
Publication of AU2007200402A1 publication Critical patent/AU2007200402A1/en
Abandoned legal-status Critical Current

Links

Landscapes

  • Machine Translation (AREA)

Description

ci 0 0 0 ci 0 ci
AUSTRALIA
Patents Act 1990 COMPLETE SPECIFICATION STANDARD PATENT Applicant(s): BUSINESS INTEGRITY LIMITED Invention Title: COMPLETENESS IN DEPENDENCY NETWORKS The following statement is a full description of this invention, including the best method of performing it known to me/us: Completeness in Dependency Networks Field of the Invention The present invention relates to the collection of data. The present invention may be applied in particular to systems capable of generating customised documents in which data is collected to enable a customised document to be generated.
Background of the Invention There are innumerable applications which require the collection of data. For example, one particular area of interest is the creation of customised documents from document templates. A document template contains those parts of the document which are common to all documents generated from the templates.
The template also comprises various portions of document content (such as text or images) whose inclusion in the final document depends on particular information. The final content of a completed document will therefore depend on certain pieces of relevant information which needs to be collected. For example, in a legal contract it is usually necessary to include a clause which specifies the law governing the contract and the particular wording of this clause will depend on the jurisdiction involved (such as 'England and Wales', 'Scotland' or 'Japan').
It is therefore necessary to determine the relevant jurisdiction before a completed document can be generated. Once the jurisdiction is determined, the appropriate clause wording is inserted into the document template at the appropriate position to create a partially customised document. Once all further relevant information is known, a fully customised document can be generated by inserting all the necessary portions of document content.
Sometimes, certain information may be relevant and need to be collected in some cases but not relevant in other cases. For example, in the above example of a legal contract, where the jurisdiction is Japan, the document may be required to specify to which court (such as 'Tokyo' or 'Kyoto') legal proceedings should be brought. In this case, the completed document can only be generated if this further piece of information is known. However, if the jurisdiction is not Japan, then this information is not relevant and is not required to generate a completed document.
The collection of data is often performed using a questionnaire. For example, in an electronic document generation system a user may be prompted to answer various questions presented on a user interface by typing information into text boxes, by selecting buttons and so on. In some systems the, questionnaire may be arranged so that those questions which are not relevant are indicated as such.
For example, those questions that are not relevant may be 'greyed out' so that the user is unable to input any data for those questions. In the above example, where the user has indicated in a previous question that the jurisdiction is 'England and Wales' or 'Scotland' the question relating to the Japanese court is greyed out since this question is not relevant.
When data collection is required, it is often important to ensure that all relevant information has been properly collected. In the above example, it is important that all relevant information has been collected to ensure that the resulting legal contract is complete. If certain information was missing, this could render the contract invalid or ineffective. In cases where the relevance of a piece of information depends on other pieces of information it can be extremely difficult to determine whether all relevant information has been collected.
In the case of the generation of official documents such as legal documents, previously it has been necessary for an expert such as a lawyer to review the final document to ensure that the documents are complete and contain all the relevant information. However, this approach is expensive and time consuming.
Also, if an expert is not available, it may not be possible to generate a final document with a high degree of certainty that the document contains all relevant information.
It would be advantageous if there was provided a method which addressed at least some of the problems set out above.
Brief Description of the Figures Figures 1, 2 and 3 show three examples of well-formed dependency networks; Figures 4 and 5 show two examples of dependency networks that are not wellformed; Figure 6 shows a table of examples of comparisons between conditions and the dataset and the result of each comparison; Figures 7, 8 and 9 show tables giving several examples of the evaluation of conditions involving the 'not', 'and' and 'or' operators; Figure 10 shows a table illustrating whether the variables of the networks shown in Figures 1 and 2 are relevant or not given various datasets; and Figure 11 shows a table illustrating whether various datasets are complete or not.
Summary of the Invention In accordance with a first aspect, there is provided a method for determining whether a dataset is complete comprising the steps of determining which variables are relevant; and determining whether all relevant variables are in the dataset.
In accordance with a second aspect there is provided a method for producing a customised document comprising the steps of completing a questionnaire to define a dataset; determining which variables are relevant; determining whether all relevant variables are in the dataset; and generating a fully customised document if the dataset is complete.
Detailed Description of Preferred Embodiments The embodiment of the invention described below is in the form of a document generation system for generating customised documents using document templates. The system comprises an electronic questionnaire used to gather information which is used to generate a fully customised document. The questionnaire is implemented as a web page created using HTML displayed on a suitable computer system and is completed by a user by inputting various information in response to a series of questions presented on a display. The user may input information using suitable input devices for example by typing text into text boxes, by selecting buttons corresponding to different options and by any other suitable means. The user may also navigate forwards and backwards through the questionnaire amending their answers to the questions. The software necessary to run the questionnaire may be stored on any suitable storage device or medium, which software is retrieved and executed by a processor when required. In some embodiments, the questionnaire web page may be accessed independently from several computers connected together by a network. This allows different users to complete different parts of the questionnaire more easily.
In some embodiments, the information required to answer some questions may be provided from a database or other information source. Examples of electronic questionnaires used to collect information are known to those skilled in the art.
The information which needs to be collected in the described embodiment relates to a set of data variables. Each question in the questionnaire is associated with a variable and the user's answer to a particular question assigns a value to the associated variable. For example, a first question in the questionnaire may request information relating to the gender of a person. In this case, 'gender' may be regarded as a variable which may take one of two values, 'male' or 'female' depending on the user's answer to the first question. A second question may request information relating to whether the person is pregnant or not. In this case 'pregnant' may be regarded as a data variable which may take one of two values, 'true' or 'false' depending on the user's answer to the second question. As the user answers further questions, the values are assigned to further variables. A collection of variables, each having a value assigned to it may be referred to as a dataset. Once the user has completed the questionnaire, those variables which have been assigned a value form a dataset. It is understood that the phrase 'completing a questionnaire' does not require that every question be answered.
When the questionnaire is completed, a customised document may be generated using the information collected by the questionnaire. The document generation process involves selectively inserting portions of document content at particular locations in a document template depending on the information collected.
Examples of document generation systems are described in earlier United States patent application serial number 10/347,785, incorporated herein by reference and earlier United States patent application serial number 10/932,266, incorporated herein by reference.
The dataset does not necessarily contain all possible variables since those variables corresponding to questions not answered will not be assigned a value and so would not be included in the dataset. A question may not have been answered for several reasons. For example, if the user had answered the question relating to gender by indicating 'male', thereby assigning the value 'male' to the variable gender, then the question relating to pregnancy would have been irrelevant. In this case, the question relating to pregnancy would have been greyed out, preventing the user from providing an answer to this question, so that the variable gender would not have been assigned a value and would not be included in the dataset. Some questions may not have been answered for other reasons. For example, the user may have failed to answer one or more of the questions due to error or because the user did not know the answer to those questions. Accordingly, the variables associated with those questions not answered would not have been assigned values and so will not be included in the dataset.
In the first case where certain questions are not answered due to their irrelevance, a fully customised document may still be generated since the only variables that are missing from the dataset are irrelevant ones. In this case the dataset contains all relevant information necessary to generate a complete document. In the second case where certain questions are not answered due to error or because the answer to those questions are not known, some relevant variables may be missing from the dataset. In this case there may be insufficient information to generate a complete document.
The present invention provides a system and method for determining whether all necessary variables are included in the dataset. In other words, the present invention provides a method to determine whether all relevant information has been collected so that a fully customised document can be generated. In the described embodiment, the dependency relationship between the variables is represented by a dependency network. As discussed in greater detail below, the system then determines whether each variable in the network is relevant or not relevant according to a rule. Finally, the system determines whether all relevant variables are included in the dataset.
A dependency network consists of nodes representing the data variables and directed arcs between the nodes. The node at the 'target' end of the arc represents the dependent variable and the nodes at the 'source' end of the arc Srepresent the controlling variables. The arc represents the conditions that relate the dependent variable back to the controlling variables. In particular, the _condition represented by an arc is a condition involving the variables represented t' by the source nodes that needs to be satisfied for the variable represented by the target node to be relevant. An arc representing a condition may be said to be tagged with that condition.
Three examples of dependency networks are shown in Figures 1, 2 and 3 respectively. The dependency network shown in Figure 1 comprises a first node 1 representing the controlling variable 'gender and a second node 3 representing the dependent variable 'pregnant'. An arc 5 connecting the first and second nodes 1, 3 represents the condition gender "female:".
The dependency network shown in Figure 2 is one in which an arc has more than one source node. This network comprises first and second nodes 7, 9 representing the controlling variables 'gender' and 'age' and a third node 11 representing the dependent variable 'state pension'. An arc 13 connecting the first and second nodes 7, 9 to the third node 11 represents the condition (gender "male"and age 65) or (gender "female" and age The dependency network shown in Figure 3 is one comprising multiple arcs. This network comprises a first node 13 representing the controlling variable 'company type' and second and third nodes 15, 17 representing the dependent variables 'director' and 'age'. A first arc 19 connects the first node 13 and the second node and a second arc 21 connects the first node 13 and the third node 17. The first and second arcs 19, 21 each represent the condition company type "plc".
In addition, the network of Figure 3 comprises a fourth node 23 representing the dependent variable 'enforced retirement'. A third arc 25 representing the condition director "true" and age 70 connects the second and third nodes 17 with the fourth node 23. The second and third nodes are source nodes as well as target nodes and so represent controlling variables as well as dependent variables.
A dependency network may be said to be well-formed if, and only if the following condition is satisfied: For every arc which involves two or more source nodes, either: none of the source nodes are themselves target nodes of arcs, or (ii) all of the source nodes are target nodes of other arcs, and all those arcs are tagged with the same condition.
The dependency networks shown in Figures 1, 2 and 3 are all well-formed.
Figures 4 and 5 show examples of dependency networks which are not well formed. For example, the network shown in Figure 4 is not well formed because the node 27 representing the variable 'age' is not a target node of any arc, whereas node 29 representing the variable 'director is a target node. The network shown in Figure 5 is not well-formed because the node 31 representing the variable 'director' is not subject to the same condition as the node 33 representing the variable 'age' because the arcs 35 and 37 are tagged with different conditions.
By applying the condition that the dependency networks are well-formed, this ensures that the dependency network is meaningful. Dependency networks which are not well-formed would involve conditions which in some situations depend on variables which are relevant and variables which are not relevant.
Such a condition would not be meaningful.
In order to evaluate the conditions represented by the arcs, the following definitions are provided.
Given a dataset, the evaluation of a condition represented by an arc is a threevalued logic. A condition is true if enough variables are in the dataset to definitely conclude the condition is true. A condition is false if enough variables are in the dataset to definitely conclude the condition is false. Otherwise, a condition is indefinite because one or more significant variables are not in the dataset.
The result of a comparison is indefinite if the dataset does not contain a value for the variable. The result is true if the dataset contains a value for the variable and the comparison holds. The result is false if the dataset contains a value for the variable but the comparison does not hold. Figure 6 shows a table of examples of comparisons and the result of each comparison given a particular dataset.
SConditions may involve several variables combined together using the logical operators 'not', 'and' and In the case of the operator 'not', the result is indefinite if the negated component is itself indefinite, the result is true if the t' negated component evaluates to false, and the result is false if the negated component evaluates to true. Figure 7 shows a table giving several examples of the evaluation of conditions involving the 'not' operator.
In the case of the operator 'and', the result is indefinite if some or all of the individual components evaluate to indefinite, and all the others evaluate to true.
SThe result is true if all of the individual components evaluate to true and the result is false if at least one of the individual components evaluates to false. Figure 8 shows a table giving several examples of the evaluation of conditions involving the 'and' operator.
In the case of the operator the result is indefinite if some or all of the individual components evaluate to indefinite, and all the others evaluate to false.
The result is true if at least one of the individual components evaluate to true and the result is false if all of the individual components evaluates to false. Figure 9 shows a table giving several examples of the evaluation of conditions involving the 'or' operator.
The above operators may be used to form more complex conditions by combining simpler sub-conditions in the usual way with logical operators.
Given a well-formed dependency network and a dataset, a variable is defined as relevant if, and only if: the variable is not the target node of any arcs, or (ii) it is the target node of an arc, and all the source node variables are relevant, and the conditions do evaluate to true or indefinite.
Figure 10 shows a table illustrating whether, according to the above rule, the variables of the networks shown in Figures 1 and 2 are relevant or not given various datasets.
Given a well-formed dependency network, a dataset is defined as complete if, and only if all relevant variables are in the dataset. Figure 11 shows a table illustrating whether, according to the above rule, various datasets are complete or not. The table of Figure 11 also indicates where a dataset is not complete by listing those variables which are missing from the dataset.
Once the questionnaire has been completed, the system determines, using the rules described above, whether each variable is relevant or not relevant. Due to the dependencies between variables, whether a particular variable is relevant will depend on the values, if any, assigned to other variables. Then, the system determines whether the dataset produced from the questionnaire is complete or not by determining whether all relevant variables are in the dataset. The user may then be provided with a visual or other indication as to whether or not the information provided from the questionnaire is sufficient to generate a fully customised document. In one embodiment a flag is set to either a value 1 or 0 depending on whether the dataset is complete or incomplete. The system may then use the status of the flag as an indication of completeness. If the dataset is complete a fully customised document containing all relevant information is generated. If the dataset is not complete then only a partially customised document may be generated.
In the claims which follow and in the preceding description of the invention, except where the context requires otherwise due to express language or necessary implication, the word "comprise" or variations such as "comprises" or "comprising" is used in an inclusive sense, i.e. to specify the presence of the stated features but not to preclude the presence or addition of further features in various embodiments of the invention.
A reference herein to a prior art document is not an admission that the document forms part of the common general knowledge in the art in Australia.

Claims (8)

1. A method for determining whether a dataset is complete comprising the steps of determining which variables are relevant; and determining whether all relevant variables are in the dataset.
2. The method of claim 1 in which the variables form a well-formed dependency network comprising two or more nodes each node representing a variable, and one or more arcs, each arc connecting one or more source nodes with a target node and representing the dependency between the source nodes and the target node, the dependency being specified as a condition which evaluates to true, false or indefinite.
3. The method of claim 2 in which the step of determining which variables are relevant comprises the step of determining that a variable represented by a node is relevant if: the node is not the target node of any arcs, or (ii) the node is the target node of an arc, and all the variables represented by the source nodes of the arc are relevant, and the condition represented by the arc evaluates to true or indefinite.
4. The method of claim 1 in which the values of the variables determine which items of information are incorporated into a customised document.
The method of claim 4 in which the customised document is a legal document.
6. An electronic document generation system arranged to determine whether a dataset is complete using the method of claim 1.
7. A computer program product having software recorded thereon which, when executed by a computer, causes the computer to undertake the method of claim 1.
8. A method for producing a customised document comprising the steps of completing a questionnaire to define a dataset; determining which variables are relevant; determining whether all relevant variables are in the dataset; and generating a fully customised document if the dataset is complete.
AU2007200402A 2007-01-31 2007-01-31 Completeness in dependency networks Abandoned AU2007200402A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2007200402A AU2007200402A1 (en) 2007-01-31 2007-01-31 Completeness in dependency networks

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
AU2007200402A AU2007200402A1 (en) 2007-01-31 2007-01-31 Completeness in dependency networks

Publications (1)

Publication Number Publication Date
AU2007200402A1 true AU2007200402A1 (en) 2008-08-14

Family

ID=39731301

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2007200402A Abandoned AU2007200402A1 (en) 2007-01-31 2007-01-31 Completeness in dependency networks

Country Status (1)

Country Link
AU (1) AU2007200402A1 (en)

Similar Documents

Publication Publication Date Title
Vanderdonckt Development milestones towards a tool for working with guidelines
US9047563B2 (en) Performing an action related to a measure of credibility of a document
US20110320433A1 (en) Automated Joining of Disparate Data for Database Queries
KR101201019B1 (en) Declarative sequenced report parameterization
EP2203847A2 (en) Intelligent editing of relational models
Abdul‐Rahman et al. Constructive visual analytics for text similarity detection
US20150277727A1 (en) Systems and methods for collaborative editing of interactive walkthroughs of content
US11537799B2 (en) Creating apps from natural language descriptions
US20070282805A1 (en) Apparatus and method for comparing metadata structures
Koch et al. Iterative integration of visual insights during patent search and analysis
Pol’la et al. Analysis of variability models: a systematic literature review
US8745050B2 (en) Definitions in master documents
US9953021B2 (en) Completeness in dependency networks
De Medeiros et al. Kuaba approach: Integrating formal semantics and design rationale representation to support design reuse
Tapia et al. A process to support the remote tree testing technique for evaluating the information architecture of user interfaces in software projects
Pigott et al. Complex knowledge modelling with functional entity relationship diagrams
US8234563B1 (en) Editing of customised documents
CN117897710A (en) Artificial intelligence method for solving industrial data conversion problem
US7725504B2 (en) Method and apparatus for helping user form structured diagram from unstructured information source
Ng Interactive visualisation techniques for ontology development
Greenleaf et al. Representing and using legal knowledge in integrated decision support systems: DataLex WorkStations
AU2007200402A1 (en) Completeness in dependency networks
Li et al. A Web application framework for end-user-initiative development with a visual tool
Lara Visualization of ontology evolution using OntoDiffGraph
US11113451B2 (en) Representation of mark-up of master documents

Legal Events

Date Code Title Description
MK5 Application lapsed section 142(2)(e) - patent request and compl. specification not accepted