1. A method of representing data comprising: representing each root of a set of roots with a value based on a definitional tree-type structure, each root including a plurality of common fields representing levels of the tree-type structure, each specific field included in a specific root having a value corresponding to the meaning of the specific root at a level of the tree-type structure represented by the specific field; representing a data concept by grouping a plurality of roots selected from the set of roots to form a word, each root of the plurality of roots corresponding to a characteristic of the data concept represented by the word; and storing the word.
1. A method of representing data comprising: representing each root of a set of roots with a value based on a definitional tree-type structure, each root including a plurality of common fields representing levels of the tree-type structure, each specific field included in a specific root having a value corresponding to the meaning of the specific root at a level of the tree-type structure represented by the specific field; representing a data concept by grouping a plurality of roots selected from the set of roots to form a word, each root of the plurality of roots corresponding to a characteristic of the data concept represented by the word; and storing the word. 2. The method of claim 1 wherein each word includes a number of bits equal to a number of bits contained in a processor register of a computer for processing the word, each field of the plurality of common fields associated with at least one bit.