WO2009156438A1

WO2009156438A1 - Method and system for entering an expression

Info

Publication number: WO2009156438A1
Application number: PCT/EP2009/057898
Authority: WO
Inventors: Johan Lamberts; Bernardus Zegveld
Original assignee: Llinxx
Priority date: 2008-06-24
Filing date: 2009-06-24
Publication date: 2009-12-30

Abstract

A method and system for entering an expression is provided. The method is for use in a data processing system which comprises at least one first label. The method comprises: receiving an expression comprising a second label (102); subsequently providing the first label (104); and receiving a selection for the first label (106); characterized in that, the method further comprises: generating a data structure representing the expression and an association between the second label and the first label (107); displaying a visual representation of the expression (108) and displaying a legend (110), the legend comprising the first label, the second label and the association between the first label and the second label.

Description

METHOD AND SYSTEM FOR ENTERING AN EXPRESSION

FIELD OF THE INVENTION

The invention relates to a method for entering an expression for use in a data processing system.

In particular, the invention relates to a method for entering an expression for use in a data processing system, the data processing system comprises at least one first label. The method comprises: receiving an expression comprising a second label; subsequently providing the first label; and receiving a selection for the first label.

The invention also relates to a corresponding computer program product and a corresponding system.

BACKGROUND OF THE INVENTION

Data processing systems for aggregating, storing and/or processing data sometimes offer the feature to evaluate formulas using data from the system. For example, using a spreadsheet program many data items may be tabulated, and formulas may be used to add subsets of those numbers. To refer to a data item, the data processing system can employ a label. When an expression needs to refer to the data item, it can use the label instead. Labels have to be unique in the system, and moreover the label has to appear in the expression exactly as used in the data processing system.

Some of these systems offer features to enhance the usability of the interface to the system. For example, US patent application 2007/0055922, incorporated herein by reference, discloses a known system for auto-completion. Upon partial data entry, the system suggests a completion for the partial data entry to a reference for an item in a database. A user may select the completion, whereupon the partial data entry is completed, wherein the selected completion is inserted in the partial data entry. SUMMARY OF THE INVENTION

A problem of the known system is, that after the desired completion has been selected the result is substituted back in the partial data entry. When the completed data entry including the substitution is subsequently viewed by the user, it may have become less comprehensible than the partial data entry itself.

It is an object of the invention to aid the comprehensibility of entered expressions.

The method for entering an expression according to the invention is characterized in that, the method further comprises: generating a data structure representing the expression and an association between the second label and the first label; displaying a visual representation of the expression and displaying a legend; the legend comprising the first label, the second label and an association between the first label and the second label.

The data processing system comprises a first label, for example, because the first label has a defined meaning within the data processing system; the first label may be used to refer to a data entity, or the first label may have some other defined meaning within the system. Through receiving an expression comprising a second label, a system receives through some input device, e.g., a keyboard or a digital network, an expression which in some way is capable of being further processed while involving the second label. For example, the expression may be a formula which can, e.g., be evaluated, simplified, or substituted in other expressions. The expression can also be a functional description, e.g., computer code, or type-setting instructions, which can be further processed by, e.g., compiling or type-setting. The expression may also be a sentence wherein the second label occurs as a word and which expression can be rendered on a displaying device, and wherefore the word can be explained. The first label, or in case there are multiple first labels, a list of first labels can be provided, e.g., by generating a list of first labels, or by showing the first label on a display device. A selection is made for one of the provided first labels, which selection is received. In case there is one first label, the selection takes the form of a confirmation. Typically, the selection will be made by a user of the method, although it is possible that an automated system can select pre-determined or default choices, for example, company wide defaults may be enforced through an automated selection device. The method displays a visual representation of the expression, which expression comprises the second label as entered by the user. A user of the method, to whom the expression is displayed, sees the expression including the second label. The second label is a label that the user himself has used. Moreover, the method displays a legend. The legend comprises the first label, the second label and an association between the first label and the second label. Thus, the legend reminds the user of his selection and shows a translation of the second label to the first label. This further aids the comprehensibility of the expression. This advantage is most pronounced when the expression with first labels would be particularly long, e.g., extend over multiple lines, and/or the first labels themselves are particularly long.

Advantageously, the invention allows a second label to be used multiple times within the expression. The second time the second label is used in the expression there is no need to receive a further selection, as the original selection may be used.

Advantageously, the invention allows the association between the second label and a first label to be set up dynamically. After the expression has been entered, the method provides a first label. By selecting the first label the user sets up an association between the second label and the first label.

Advantageously, the invention allows the data processing system to impose different syntax restrictions on a first label than on a second label. For example, using the invention, the system may impose no, or limited restriction on a first label, but require for a second label that, e.g., the symbol '+' does not occur in the second label. Since expressions are typed in and parsed with second labels, this rule avoids confusion, as the symbol '+' may typically also be used to indicate addition. Using the invention, a first label need not occur in an expression, and accordingly the syntax restriction on '+', or other such syntax restriction need not be applied to the first label. In this way, e.g., a database, which originally was not conceived to be used with expressions, and which uses first labels without syntax restriction may be conveniently extended with a system for entering and/or evaluation expressions, wherein the second labels do have such syntax restrictions. In one such embodiment the first label satisfies a first syntax rule, and the method according to the invention comprises determining whether the second label satisfies a second syntax rule, wherein the second syntax rule is different from the first syntax rule.

The inventors have realized that what a user enters him or herself corresponds more closely to the mental concepts that the user is familiar with, than the artificial concepts used by a computerized system. After a translation to artificial concepts the resulting entered expression has suffered in comprehensibility. Although auto-completion can help with the translation from natural, mental concepts to artificial concepts, the auto- completion tool does not prevent the resulting entered expression from suffering in comprehensibility.

In a preferred embodiment of the method for entering an expression according to the invention, the method further comprises determining that the first label is consistent with the second label according to a consistency rule. Typically determining that the first label is consistent with the second label is done before providing the first label.

Determining that the first label is consistent with the second label aids the selection of the first label, as the method may provide a first label that is likely intended with the second label, since it is consistent with it. Moreover, determining that the first label is consistent with the second label is also helpful for comprehensibility, as it is ensures that only associations result which are likely to be easy to comprehend. The consistency rule may be enforced by the system, i.e. a user may not associate a second label with a first label that is inconsistent with it. On the other hand, also a more flexible approach may be used. For example, a user may override the consistency rule, and associate a second label with a first label, even though they are inconsistent with each other. For example, the method may comprises: receiving an override-indication. Upon receiving the override-indication the user may select a first label not consistent with the second label according to the consistency rule.

In a preferred embodiment the data processing system comprises a first list of first labels. The method comprises: receiving an expression comprising a second label and subsequently generating a second list of first labels consistent with the second label according to a consistency rule. The first list of first labels comprises the second list of first labels. The method comprises providing the second list of first labels and receiving a selection for a first label from the second list of first labels. In a preferred embodiment of the method for entering an expression according to the invention, the first label comprises a first string of characters and the second label comprises a second string of characters. The consistency rule comprises determining that the characters of the second string appear among the characters of the first string in a same order in which the characters of the second string appear in the second string.

Typically, labels used in data processing systems are built-up modularly, possibly reflecting a hierarchy. Each module or level in the hierarchy that a label corresponds to may be reflected in a part in the label. Accordingly, many labels may be partially equal. It is advantageous to determine the consistency of the first label and the second label in a manner which allows the second label to be short, even in case the data processing system comprises many partially overlapping labels.

In a preferred embodiment of the method for entering an expression according to the invention, the method further comprises storing the expression and the association.

When at some point, the user wishes to review the expression, it is advantageous if the expression is presented to him using the second label, since it is the second label which was used by him. By storing both the expression and the association, this can be accomplished. Note that the storing may precede or follow either displaying step. The storing may also be done in parallel to either displaying step.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention is explained in further detail by way of example and with reference to the accompanying drawings, wherein:

Figure 1 is a flowchart of a first embodiment of the method for entering an expression according to the invention.

Figure 2 is a flowchart of a second embodiment of the method for entering an expression according to the invention.

Figure 3 is a block diagram showing a system for entering an expression according to the invention. Figure 4 is a block diagram showing a system for entering an expression according to the invention.

Figure 5 is a screenshot of a database system during entering of an expression. Figure 6 is a screenshot of a database system showing a legend for a partially entered expression.

Figure 7 is a screenshot of a database system during displaying of a legend.

Throughout the Figures, similar or corresponding features are indicated by same reference numerals.

List of Reference Numerals:

100 a method for entering an expression

102 receiving an expression comprising a second label

104 providing the first label

106 receiving a selection for the first label

107 generating a data structure representing the expression and an association between the second label and the first label

108 displaying a visual representation of the expression 110 displaying a legend

200 a method for entering an expression

202 determining that the first label is consistent with the second label.

300 a system for entering an expression

302 a data processing system

304 a first label

306 a means for receiving an expression

308 a means for providing the first label

310 a means for receiving a selection for the first label

312 a means for displaying

400 a system for entering an expression

402 a computer

404 a display

406 a storage device

408 a keyboard

410 a mouse DETAILED EMBODIMENTS

While this invention is susceptible of embodiment in many different forms, there is shown in the drawings and will herein be described in detail one or more specific embodiments, with the understanding that the present disclosure is to be considered as exemplary of the principles of the invention and not intended to limit the invention to the specific embodiments shown and described.

Figure 1 illustrates a method for entering an expression 100. Method 100 comprises the following steps: receiving an expression comprising a second label 102; providing the first label 104; receiving a selection for the first label 106; generating a data structure representing the expression and an association between the second label and the first label (107); displaying a visual representation of the expression 108 and displaying a legend 110.

The order of the steps can be varied or some steps may be executed in parallel, as will be apparent to a person skilled in the art. For example, displaying a legend 1 10 may be done before, or in parallel to, displaying a visual representation of the expression 108. An expression may comprise multiple labels. More than one label may be associated with another preexisting label.

During operational use, method 100 may be employed as follows. A data processing system could be a spreadsheet comprising at least one data entity, e.g. a value, a database system comprising at least one data entity, e.g. a record, a text processing system comprising at least one word. The data processing system further comprises at least one first label referring to the data entity. For example, the data processing system comprises a data structure wherein the first label is associated with a pointer, wherein the pointer is the address of a data entity in a storage system. Typically, the data processing system comprises multiple labels and multiple entities, said multiple labels referring respectively to the multiple entities.

According to step 102 of method 100, an expression comprising a second label is received. For example, the expression may be typed at an input device, such as a keyboard. The expression may also be received via a data communications network, such as the Internet. The expression may, for example, comprise at least part of a formula, a computer program code, a table definition, etc. The expression comprises a second label.

The second label may be identified in the expression, e.g., by parsing the expression according to a predefined syntax. For example, the predefined syntax may comprise the syntax of arithmetic. In this case, the in expression "a+1 ", the second label "a" can be discovered by parsing the expression for the term "+". Alternatively, the second label may be identified in the expression by requiring that a second label has a pre- defined form. For example, it may be required that second labels start with the symbol

According to step 104 of method 100, the first label is provided. In case the data processing system comprises multiple labels, a list of labels may be provided. Providing the first label can be done by accessing the data processing system and retrieving a list of the labels used the data processing system. The retrieved list, or a portion thereof, is subsequently displayed on a display. Typically, the list will be sorted before being displayed. The displaying can be done in a single column or in multiple columns. For example, the list of labels may be displayed in the vicinity of the second label.

In case the data processing system is a database, a query can be done to ask for the available labels in the data base system. The available labels include the first label.

According to step 106 of method 100, a selection for the first label is received. In case, a list was provided, a selection from the list is received. The selection may be received from an input device, e.g., via a keyboard, mouse, pointer, tablet, etc. The selection indicates that an association is desired between the second label and the first label.

According to step 107, a data structure is generated. The data structure includes a representation of the expression. The expression may be included in the data structured in a different form as was entered; for example, in case the expression is a formula, the data structure may comprise the formula in reverse polish notation, whereas the formula was entered using infix notation. The data structure further includes a representation of the first label and the second label. It is not necessary to include the first and/or second label themselves. Instead a pointer can be included that points to the appropriate label in a different data structure.

According to step 108 of method 100, a visual representation of the expression is displayed. Note that the expression as displayed comprises the second label. The second label has not been replaced with the first label. Also, according to step 110 of the method 100 a legend is displayed. The legend comprises the first label, the second label and an association between the first label and the second label. The legend shows in a visual way, the relationship between the first label and the second label. For example, the legend may contain two columns, wherein in the first column the second label is shown and in a corresponding position in the second column the first label is shown.

The expression and the legend may be displayed immediately after receiving the selection 106. However, the expression and the legend may also be displayed at some other moment, for example, during a review of the expression. Displaying the legend may be dependent on receiving an indication that a legend is desired, in which case only upon receiving said indication is the legend displayed. For example, such an indication may be received by having the user click on an icon representative of showing the legend. Upon clicking on the icon the legend will be displayed.

Alternatively, a user may indicate by a click on the expression, or a selection from a pull-down menu that a legend is desired. A legend may show only a single second label used in a single expression, and the corresponding single first label. The legend may also show all second labels in the expression and their corresponding first labels. Conveniently, a legend may also show all second labels used on a single page of a document, or all second labels used in a part of the document currently shown on a display or in a window. The latter option is especially convenient when the data processing system is a text processing application.

The system may also include an option to automatically provide a legend for any expression displayed. Such an option may be turned on in a preferences menu.

Method 100 may be executed in hardware, software or combination thereof. Figure 2 illustrates a method for entering an expression 200. Method 200 comprises all the steps of method 100, with the additional step of determining that the first label is consistent with the second label 202. The method may test the first label for consistency with the second label before providing it.

For example, in case the data processing system comprises multiple labels, each of the labels may be tested for consistency and only the labels that are consistent with the second label are provided. Testing the first label for consistency with the second label is typically done using a consistency rule. The consistency rule describes when two labels are considered consistent with each other.

Many consistency rules are possible. As an example, to illustrate the invention, a number of possible consistency rules are given. In the example, consistency rules given below, the first label comprises a first string of characters and the second label comprises a second string of characters. The consistency rules may be combined.

In a first consistency rule, the consistency between a label found in the expression, i.e. the second label, and a label found in the data processing system, i.e., the first label, is determined. The first label is consistent with the second label if the second string is shorter than the first string. When this rule is used, after the user has entered a second label, he will be presented with one or more first labels, which are longer than the second label. This rule works on the assumption that the user will want to use second labels that are easier to enter than the corresponding first labels. This is accomplished as only labels are provided that take fewer characters to type in. For example, according to this rule, a second label comprising a second string "xy" is consistent with a first label comprising a first string "abc".

In a second consistency rule, the characters of the second string have a first order. The first label is consistent with the second label if the characters of the second string are comprised in the characters of the first string in a second order, said second order being equal to the first order. That is, the characters of the second string appear among the characters of the first string in a same order in which the characters of the second string appear in the second string. For example, according to this rule a first label, which comprises the string "xaybzbycq", is consistent with a second label comprising the string "abbe". Each character of the second string is comprised in the first string and moreover in the same order as the characters appear in the second string. Note that the second string abbe, would not match with any of the following first strings: "xayzbycq", "xbyazbycq", "abc", "babe", etc.

As a further example, the string "vat" is consistent according to the second consistency rule with "value_added_tax". But, according to the second consistency rule, the string "vat" would also be consistent with "number_of_variant_articles".

It is possible to add a further condition for consistency to any consistency rule, in particular to the second consistency rule. The further condition demands that the first character of the second string is equal to the first character of the first string. Using this additional condition with the second rule, the first string abbe, no longer matches the second string xaybzbycq. However, if the second string were: axaybzbycq, then consistency is restored.

If the further condition is used together with the second consistency rule, the string "vat" is still consistent with "value_added_tax", but is no longer consistent with number_of_variant_articles".

In a third consistency rule, the second string of characters starts with a starting string of characters and ends with an ending string of characters. The first label is consistent with the second label if the first string starts with the starting string and that the first string ends with the ending string. For example, a first label comprising the first string abcxyzdef is consistent with a second label comprising the second string abcdef. Note that the starting string or ending string may be empty. However, if this rule is combined with the additional condition, the starting string comprises at least one character.

In a further refinement of the third consistency rule, the second label consists of the starting string and the ending string. In this situation the second label is partitioned into two parts: the starting string and the ending string. Then, for a first label to be consistent with the second label, the first label should start with the starting string and end with the ending string. Also with this refinement various options and combinations thereof are possible. For example, one may demand that the starting string and/or the ending string is not empty. In a third consistency rule, the first label is consistent with the second label if the first string starts with the second string. For example, a first label comprising the first string abcxyz is consistent with a second label comprising the second string abc.

In yet a more further condition, camel case is applied. The first label is consistent with the second label if they are consistent according to any consistency given above, wherein the case of the first and/or second string is ignored, and moreover, according to the more further condition, each capital in the second string corresponds to the start of a word in the first string. For example, a first label comprising the string "first percentage" is consistent with a second label comprising the string "FiPe" according to the second consistency rule and this condition.

Note that there is no requirement that the first label be the unique label consistent with the second label. Rather, the user is assisted in his selection of the first label, by having a manageable number of reasonable alternatives presented to him.

In a further refinement of method 200, preceding using the consistency rule an initial consistency rule is used. For convenience of exposition we will refer to the consistency rule as a further consistency rule. In a first iteration the initial consistency rule is employed. For example, in the first iteration, each label comprised in the data processing system is tested for consistency with the second label, according to the initial consistency rule, resulting in a list of first labels. If the results of applying the initial consistency rule are inadequate the further consistency rule may be applied in a second iteration. In the second iteration, each label comprised in the data processing system is tested for consistency with the second label, according to the further consistency rule.

The results of the first iteration may be inadequate, if no labels are consistent with the second label, or if the number of labels consistent with the second label is small compared to the total number of labels comprised in the data processing system. On the other hand the results of the first iteration may also be inadequate if the number of labels is too large. A number of results can be too large compared to the number of labels that are easily read by a human, or it can be too large compared to the number of labels in the data processing system. Note that usage of the further consistency rule after usage of the initial consistency rule may be optional or automatic. For example, a user may, after viewing the results of the initial consistency rule, judge the results to be inadequate and start, for example, through a mouse-click, an adapting of the list of first labels, using the further consistency rule. On the other hand, also the system may make such a determination, and start the adapting of the list of first labels itself.

In a further refinement of method 100 or method 200, the method comprises a step of storing the expression and the association. The storing may be to a persistent storage, such as a hard disk, or a flash memory. The storing may also be to a volatile storage, such a Random Access Memory (RAM). The storing may take place at many convenient moments. For example, the storing may take place after or prior to any one of the displaying steps, 108 and 1 10.

Storing the association to a storage has the advantage that when the expression is later retrieved from the storage, the legend can be displayed again.

In a further refinement of method 100 or method 200, the first label is a reference for a data entity, and the method further comprises a step of evaluating the expression, the evaluating comprising substituting the data entity for the second label.

Before an evaluation takes place, the second label may be replaced with the first label, which in turn may be replaced by the data entity. It is also possible to directly replace the second label with the data entity.

Below a worked example of using the method according to the invention is presented. A user enters the expression "vat x sp", which in this case is a formula. The second labels "vat" and "sp" are identified. In this case the identification is done by parsing the syntax of this type of formula. Note that the character 'x' is used to indicate multiplication.

Upon identifying "vat" as a second label the system could query the data processing system for labels used in the data processing system. The list may be provided without a pre-selection based on consistency. For example, the system may provide a list like: "sales_price" "value_added_ tax"

Alternatively it may first be determined that the first label "value_added_ tax" is consistent with the second label "vat". Possibly other first labels are also consistent with "vat", such as "Veterinary_Aptitude_Test_results", in case the data processing system is used by a veterinary school.

The consistent labels, including "value_added_ tax" are provided. Next the user selects "value_added_ tax" as a first label. When this selection is received an association is established between the second label "vat" and the first label "value_added_ tax". For example, an association can be established by recording the first label and the second label in respective fields of an appropriate data structure.

Similarly, the second label "sp" is identified, after which the first label "sales_price" is provided as being consistent. When a selection for "sales_price" is received an association between the second label "sp" and the first label "sales_price" is established.

Next the expression "vat x sp" is displayed. Also a legend is displayed, the legend could for example, comprise: vat => "value_added_ tax" sp => "sales_price"

The first label "value_added_ tax" could refer to a data entity, e.g., an actual value, stored somewhere in the data processing system. For example, "value_added_tax" may refer to the number 0.19, being the fraction of a base price which gives the amount of value added tax.

When the formula needs to be evaluate the second label "sp" may be replaced with a data entity, say $100, and the second label "vat" will be replaced with the data entity 0.19. The formula "vat x sp" would be evaluated as 0.19 ^* $100, which gives, after evaluation, $19. Note that the symbol 'x', which represents multiplication, is replaced for the purpose of evaluation, with the symbol '^*'. The symbol '^*' also indicates multiplication, but may for this particular user be less familiar than the 'x' symbol. In an embodiment the formula could also be used to make a table. For example, the variable "sp" could be replaced by a collection of sales prices, as listed in a collection of records in a database.

Note that, the second label may be longer than the first label. For example, a user may use the second label "price not including vat", and through a selection associate it with the first label "sales_price". In this way, the user makes it easier to remember that the "sales_price" variable does not include value added tax, even though this is not ordinarily included in the naming of that variable. In this case a legend could include the line:

"price not including vat" => "sales_price"

Note that a user can use the terms that he finds convenient, for example, because they are easier to comprehend, oversee or remember, as is the case of "vat" for "value_added_ tax". Or because the second label is more informative, as is the case of the second label "price_not_including_vat" for the first label "sales_price".

The legend may be displayed automatically, or only on receiving an indication from a user. An indication may be a keyboard shortcut, a mouse click, a roll-over with the mouse, etc.

In a further embodiment the method of entering an expression is used in a text processing system. The system receives an expression, which in this embodiment is a string comprising one or more words. At least one of the words in the expression is an acronym. The second label is one of these acronyms. The second label can be identified automatically, for example, by recognizing a string from a glossary, or with help from the user, for example, by selecting the acronym with a mouse. The first label can also be selected from a glossary. The first label refers to the meaning of the acronym.

For example, upon receiving the expression "The GUID must be unique for each instance of the RO." The system provides the user the first label "Globally Unique Identifier" as a possible selection choice for the second label "GUID". Upon receiving a selection for this first label, an association is established. Similarly, the second label, the term "RO", may be associated with the first label "Rights Object". The second labels can be identified by the system looking up GUID and RO in a glossary, alternatively, the user could select them as required for legend.

Upon later displaying of the expression "The GUID must be unique for each instance of the RO." a legend may be displayed. The legend in this case comprises:

GUID => "Globally Unique Identifier" RO => "Rights Object"

Note that apart from acronyms also abbreviations, or any other word in need of further definition, can be used for the second label.

An association can be used globally for other expressions that are received later. On the other hand an association can also be private to a single expression. For example, in the example given above, the user may indicate that the association between vat and "value_added_tax" is to be used for each expression that a system employing the method may further encounter. When, subsequently, a second expression is entered using the label vat, there is no need to provide a first label for the second label "vat". Optionally, a legend could be displayed, reminding the user of the global association between "vat" and "value_added_tax", he has set up earlier.

On the other hand, a user can also keep the association between vat and "value_added_tax" private to the current expression. When, subsequently, in a second application of the method, an expression is entered including the term "vat", the system would again provide a list of first labels that are consistent with "vat" and that are comprised in the data processing system. For example, in a second expression "vat" could then stand for "Veterinary_Aptitude_Test_results". For example, the second expression may define a graph, plotting the test results of applicants for a veterinary school over the past ten years.

A method according to the invention can be implemented as a computer program product, e.g., as software. For example, software comprising a number of processing means, such that each step of a method according to the invention can be achieved by at least one of the number of processing means. In one embodiment each specific processing means of the number of processing means corresponds to a specific step of the method according to the invention. The programming means can be fabricated using various well known high-level programming languages, such as, C, C++ or Pascal. The programming means can alternatively be fabricated using low-level programming languages such as assembly, machine codes or microcode. A processing means can correspond to an architectural structure, such as a subroutine, or an object, but this is not necessary, and a processing means can also correspond to one or more lines of programming code, or part thereof. A processing means could also be comprised in a larger processing means addressing an ulterior goal of the software.

The method generates a data structure representing an expression comprising a second label and an association between the second label and a first label. Using such a data structure allows the expression with an appropriate legend to be displayed on the same device that was originally used for entering the expression as wells as on a different displaying device. The data structure can be stored or transmitted, e.g. over a network, such as the Internet, or a GSM communication network.

The data structure is suitable for use with a system according to the invention. The data structure is also suitable for use with a method according to the invention. Using the data structure, the expression can be evaluated in data processing system. Conveniently, a record carrier, such as a hard disk, a floppy disk, a flash memory device, etc, may be used to record the data structure on.

In Figure 3 a system 300 for entering an expression is illustrated. The system 300 comprises a data processing system 302. The data processing system comprises a first label 304. System 300 comprises a means for receiving an expression 306. The expression comprises a second label. System 300 comprises a means for providing the first label 308 and a means for receiving a selection for the first label 310. System 300 comprises a means for displaying a visual representation of the expression and means for displaying a legend, both of which are implemented in means for displaying 312. During operation, the means for receiving an expression 306 receives an expression comprising a second label. This event is forwarded to the means for providing the first label 308, via a suitable connection. The means for providing the first label 308 has access to the first label 304. The means for providing the first label 308 provides the first label 304. The means for receiving a selection for the first label 310 receives a selection for the first label, the selection is relayed back to the means for providing the first label 308, via a suitable connection. The association is made in dependency on the selection. The means for displaying 312 displays both the expression and a legend. The legend comprises the first label, the second label and an association between the first label and the second label. The displaying of the legend is done in a suitable visual representation of the legend.

The present invention, as described in embodiments herein, may be implemented using a programmed processor executing programming instructions that are broadly described above in flow chart form that can be stored on any suitable electronic storage medium. However, those skilled in the art will appreciate that the processes described above can be implemented in any number of variations and in many suitable programming languages without departing from the present invention. For example, the order of certain operations carried out can often be varied, additional operations can be added or operations can be deleted without departing from the invention. Error trapping, enhancements and variations can be added without departing from the present invention. Such variations are contemplated and considered equivalent.

In Figure 4 a system 400 for entering an expression is shown. The system comprises a computer 402. The computer 402 is connected to a display 404 and a keyboard 408. The keyboard is connected to a mouse 410. Computer 402 is connected to a storage device 406. Computer 402 contains a processor for executing software.

Storage device 406 stores a collection of data items, e.g. numerical values. Computer 402 is connected to storage device 406 in order to provide access to the collection of data items. A user can enter an expression using keyboard 408. Computer 402 identifies in the expression a label, i.e. a second label. For example, computer 402 retrieves a list from storage device 406 comprising possible labels, and compares the list of possible labels with the entered expression. Alternatively, the user identifies the label in the expression by highlighting it using mouse 410. Computer 402 will display the expression, including the label on display 404. Next, computer 402 retrieves from storage device 406 a list of labels used for referring to data items.

Computer 402 may directly display the list of labels used for referring, or portion thereof, on display 404. Optionally, computer 402 selects out of this list, all labels which are consistent with a consistency rule. For example, computer 402 compares each item on the list to the second label according to a consistency rule. The list of labels used for referring and consistent with the second label is displayed on display 404.

Using keyboard 408 and/or mouse 410, the users selects a first label from among the displayed possibilities. For example, the user highlights his choice for a first label.

Computer 402 receives this selection, for example, in the form of an event, e.g., a mouse click. Computer 402 makes a first data record and enters the first label and the second label into it. Computer 402 also makes a second data record comprising the expression. The first data record and the second data record are stored on storage device 406. The first data record and the second data record together make up a data structure. Along with storing the first data record and the second data record in a storage device 406, computer 402 may also keep the first data record and the second data record in a memory (not shown) comprised in computer 402.

At some point, for example, immediately after entering the expression, or possibly at some later moment, computer 402 displays the expression on display 404. To that end, the second data record is retrieved. Computer 402 may transform the expression to make it more suitable for display. For example, a formula may be typeset, and/or rendered for optimal viewing. Computer 402 automatically displays, in the vicinity of the expression a legend. To that end, computer 402 first retrieves the first data record from storage device 406. From the first data record the first and second label are retrieved. Next, computer 402 displays a message on display 404, e.g. in the form of a window, or message box, the first label and the second label. The relationship between the first label and the second label is in some way expressed, for example, using an arrow, or by placing the concepts close to each other. When computer 402 evaluates the expression: The data entity to which the first label refers is retrieved from storage 406. The data entity is substituted for the second label. In this way the expression can be evaluated using an expression evaluator of the data system. Alternatively that substitution could be done in two stages. First a second label is replaced by the associated first label, next the first label is replaced by a corresponding data entity.

If the expression entered by the user includes some mathematical symbol, i.e. some pictorial representation of a mathematical concept, he may select the meaning for the mathematical symbol from a list of possible meanings. For example, on entering the symbol "+", the user may select first "modular addition" or he may select first label "arithmetical addition". On displaying the expression, computer 402 will display a legend. The legend will both show the pictorial representation, e.g. "+", and the selected meaning. In this case the first label refers to a method that is to be used when, while evaluating the expression, the symbol "+" is encountered.

Figure 5, 6 and 7 show three screenshots of an application of the method according to the invention, in the context of a database system.

The database system is implemented on a computer comprising a storage device. On the storage device multiple records with data are stored. A record comprises various fields. In this database system, fields can themselves comprise multiple fields. The format of a data record is specified in a data record definition.

In Figure 5 a user is working on the definition of a record for 'Bill'. Note that 'Bill^' record can itself occur as a field in other records. A 'Bill' record has 5 fields: 'Customer', 'Billing lines', Total Amount (Excl. VAT)', 'VAT Amount' and Total Amount (Incl. VAT)'.

The field 'Billing lines' defines a table. The table has 5 columns. The columns take their information from other records in the database. The table has been defined using the labels: Item, Price, Quantity, Discount and Amount. Although these labels are associated with other labels, a legend is not currently shown, for these labels. The screenshot shown in Figure 5 was taken while a user was filling in the field VAT Amount'. By typing '[=' the user has indicated that a formula is following. Using a special symbol, or character combination, is a convenient way to indicate to a system that an expression is following in which the method according to the invention is to be applied. That is, after^' [=^' an expression follows, which will comprise a second label, for which an association with a first label must be setup.

After the user has typed T', the system shows a windows marked 'Legend'. The label T^' serves as a second label. The system has retrieved a list of labels from the database that can be used at this point in the field. Moreover, a selection has taken place; only those labels are shown which are consistent with the second label the user has entered. The window marked 'Legend', in figure 5, is showing a list of first labels that are consistent, according to the rule the system currently has in use, with the second label. Two fields are consistent with the second label T': Total Amount (Excl. VAT)', and Total Amount (Incl. VAT)'. Note that in the screenshot, the definitions for these two labels happen to be also shown. A label, appearing as a first label in a legend can itself refer to an expression, or to another label, or directly to some data object itself, etc.

At this point the user has a number of options. He could associate the second label T' to one of the two shown consistent first labels; for example, by clicking on one of the two shown labels in the legend. He may also continue typing, this will make the second label T' longer, and possibly more informative. Extending the label T' may also have as a consequence that one of the labels is no longer consistent. For example, the user may extend the label T to TotExVat'. If the system uses, e.g., the second consistency rule, then this means that only the field Total Amount (Excl. Btw)' remains consistent.

The user also has the option, to ask the system adapt the list of first labels that is now shown in the window headed 'Legend'. For example, the user may indicate that he wants the full list of all possible first labels, without taking consistency into account.

In Figure 6 a screenshot is shown of the application at some later moment than the screenshot taken for Figure 5. The expression that the user was creating in Figure 5 has been completed. The user has completed typing the second label to TotExVAT', at this point only a single first label is consistent with the second label. To continue working with the second label TotExVAT' the sole consistent first label Total Amount (Excl. VAT)' may be selected to confirm the association between this first label and second label. Note that the system may also be configured such that this selection is made automatically. The user can now continue typing in an expression, using the term TotExVAT'. In evaluations the system will translate this into Total Amount (Excl. VAT)' when necessary.

In Figure 7 a screenshot is shown of the application at yet a later moment than the screenshot taken for Figure 6. The user has reconsidered his choice for second label and has continued working with the second label TotAmountExclVAT' to refer to the first label Total Amount (Excl. VAT)'. Using the invention it is easy for a user to change labels locally in an expression, as the method can shield the local choices from influencing other expression, if that is so desired. Note that the user has finished the expression for VAT Amount'. At this point, the user decided to review an expression, for which he has established an association earlier. Selecting the field Total Amount (Excl. VAT)' the system shows a legend, indicated in Figure 7 with the heading 'Legend'. The legend shows the second label 'Bill_Amount' which is used in the expression, and also shows the first label to which it refers. In this case, the label 'Bill_Amount' refers to a particular column in a table. The table is indicated with Billing Lines and the column with Amount. Note that the invention is also applicable in a situation such as here, where variables are ordered hierarchically. To refer to the column 'Amount' first the hierarchically higher structure 'Billing lines' need to be selected. The user, however, can simply use the second label 'Bill_amount' to refer to this hierarchically selected data entity.

The present invention could be implemented using special purpose hardware and/or dedicated processors. Similarly, general purpose computers, microprocessor based computers, digital signal processors, microcontrollers, dedicated processors, custom circuits, ASICS and/or dedicated hard wired logic may be used to construct alternative equivalent embodiments of the present invention. In a claim enumerating several means, several of these means may be embodied by one and the same item of hardware

Those skilled in the art will appreciate that the program steps and associated data used to implement the embodiments described above can be implemented using disc storage as well as other forms of storage, such as, for example, Read Only Memory (ROM) devices, Random Access Memory (RAM) devices, optical storage elements, magnetic storage elements, magneto-optical storage elements, flash memory and/or other equivalent storage technologies without departing from the present invention. Such alternative storage devices should be considered equivalents.

While the invention has been described in conjunction with specific embodiments, it is evident that many alternatives, modifications, permutations and variations will become apparent to those of ordinary skill in the art in light of the foregoing description. Accordingly, it is intended that the present invention embrace all such alternatives, modifications and variations.

Claims

1. A method for entering an expression (100) for use in a data processing system, the data processing system comprises at least one first label, the method comprises: receiving an expression comprising a second label (102); subsequently providing the first label (104); and receiving a selection for the first label (106); characterized in that, the method further comprises: generating a data structure representing the expression and an association between the second label and the first label (107); displaying a visual representation of the expression (108) and displaying a legend (1 10), the legend comprising the first label, the second label and the association between the first label and the second label.

2. A method as in Claim 1 , wherein the method further comprises determining that the first label is consistent with the second label (202) according to a consistency rule.

3. A method as in Claim 2, wherein the first label comprises a first string of characters and the second label comprises a second string of characters, and wherein the consistency rule comprises determining that the second string is shorter than the first string.

4. A method as in Claim 3, wherein the consistency rule comprises determining that the characters of the second string appear among the characters of the first string in a same order in which the characters of the second string appear in the second string.

5. A method as in any one of Claim 3 and 4, wherein the consistency rule comprises determining that a first character of the second string is equal to a first character of the first string.

6. A method as in any one of Claim 3, 4 and 5 wherein: the second string of characters starts with a starting string of characters and ends with an ending string of characters; and the consistency rule comprises determining that the first string starts with the starting string and that the first string ends with the ending string.

7. A method as in Claim 6, wherein the second string consists of the starting string and the ending string.

8. A method as in Claim 3, wherein: the consistency rule comprises determining that the first string starts with the second string.

9. A method as in any one of the preceding claims, wherein: the providing comprises providing a list of first labels according to an initial consistency rule; and the method further comprises adapting said list according to the consistency rule.

10. A method as in any one of the preceding claims, wherein the method further comprises storing the data structure in a storage medium.

1 1. A method as in any one of the preceding claims, wherein the first label being a reference for a data entity, and the method further comprises: evaluating the expression, the evaluating comprising substituting the data entity for the second label.

12. A computer program product comprising computer code for implementing the method as defined in any one of claim 1 to 1 1.

13. A data structure representing: an expression comprising a second label; and an association between the second label and a first label, wherein the data structure is suitable for use in a system comprising: a means for displaying a visual representation of the expression (312); and a means for displaying a legend (312), the legend comprising the first label , the second label and an association between the first label and the second label.

14. A system for entering an expression (300; 400) for use in a data processing system, the data processing system comprises at least one first label (304), the system for entering an expression comprises: means for receiving an expression (306) comprising a second label; means for providing the first label (308); and means for receiving a selection for the first label (310); wherein, during operational use, receiving an expression is done before providing the first label; characterized in that, the method further comprises: means for displaying a visual representation of the expression (312) and means for displaying a legend (312), the legend comprising the first label, the second label and an association between the first label and the second label.