Back to results
US 5,966,127 AGranted
Graph processing method and apparatus
OwnerMantaro Yajimainventor
Life of this patent
Estimating the term…
Abstract
In accordance with the method of the present invention, a graph using an information processing apparatus is made. It includes: entering written signs in the form of characters, symbols, and/or graphicals in a document, the written signs serving as descriptors that specify a format of a graph represented by ordinary writings; recognizing unitary descriptors having a unitary meaning from the entered written signs and recognizing composite descriptors from a plurality of the unitary descriptors corresponding to a plurality of those written signs having an association with one another according to predetermined association rules; and producing graph definition data defining contents of the unitary descriptors and/or composite descriptors.
Claims14
A method for use in an information processing apparatus for defining a graph, said method comprising:
- entering written signs in the form of characters, symbols, and/or graphicals in a document, the entered written signs having an attribute distinct from those of ordinary writings representative of contents of the document, and the entered written signs specifying a format of a graph represented by the ordinary writings;
- recognizing unitary descriptors having a unitary meaning on the basis of the entered written signs;
- recognizing composite descriptors on the basis of a plurality of the unitary descriptors corresponding to a plurality of the entered written signs having association with one another according to predetermined association rules;
- and
- producing graph definition data defining contents of the unitary descriptors and/or the composite descriptors.
2 more elements
A method for use in an information processing apparatus for defining a graph, said method:
- entering written signs in the form of characters, symbols, and/or graphicals in a document, the entered written signs specifying a format of a graph represented by ordinary writings representative of contents of the document;
- recognizing unitary descriptors having a unitary meaning on the basis of the entered written signs;
- recognizing composite descriptors on the basis of a plurality of the unitary descriptors corresponding to a plurality of the entered written signs having association with one another according to predetermined association rules, the association rules including conditions for determining whether a plurality of individual written signs have association with one another by a predetermined descriptor-dedicated sign;
- and
- producing graph definition data defining contents of the unitary descriptors and/or the composite descriptors.
2 more elements
A method for use in an information processing apparatus for defining a graph, said method comprising:
- entering written signs in the form of characters, symbols, and/or graphicals in a document, the entered written signs having an attribute distinct from those of ordinary writings representative of contents of the document, and the entered written signs specifying a format of a graph represented by the ordinary writings;
- recognizing unitary descriptors having a unitary meaning on the basis of the entered written signs;
- recognizing composite descriptors on the basis of a plurality of the unitary descriptors corresponding to a plurality of the entered written signs having association with one another according to predetermined association rules;
- producing graph definition data defining contents of the unitary descriptors and/or the composite descriptors;
- and
- executing predetermined processes specified by the graph definition data in a predetermined order to make an object graph defined in the document.
3 more elements
A method as claimed in 8, wherein said executing predetermined processes further comprises executing a transfer of desired data from a source data file to a graph with respect to common data items.
An apparatus for making a graph, said apparatus comprising:
- entering means for entering written signs in the form of characters, symbols, and/or graphicals in a sheet-carried or electronic documents;
- first recognizing means for recognizing unitary descriptors having a unitary meaning from the entered written signs;
- second recognizing means for recognizing, from the recognized unitary descriptors, composite descriptors based on a plurality of the unitary descriptors corresponding to a plurality of the entered written signs having association with one another according to predetermined association rules;
- producing means for producing graph definition data defining contents of the unitary descriptors and/or the composite descriptors;
- and
- executing means for selecting, from the produced graph definition data, those graph definition data which command a predetermined process, and for executing contents defined by the graph definition data in a predetermined order.
3 more elements
An apparatus for making a graph, said apparatus comprising:
- entering means for entering written signs in the form of characters, symbols, and/or graphicals in a sheet-carried or electronic documents, the entered written signs having an attribute distinct from those of ordinary writings representative of contents of the document, and the entered written signs specifying a format of a graph represented by the ordinary writings;
- first recognizing means for recognizing unitary descriptors having a unitary meaning from the entered written signs;
- second recognizing means for recognizing, from the recognized unitary descriptors, composite descriptors based on a plurality of the unitary descriptors corresponding to a plurality of the entered written signs having association with one another according to predetermined association rules;
- producing means for producing graph definition data defining contents of the unitary descriptors and/or the composite descriptors;
- and
- executing means for selecting, from the produced graph definition data, those graph definition data which command a predetermined process, and for executing contents defined by the graph definition data in a predetermined order.
3 more elements
A computer program embodied on a computer readable medium for use with a computer for defining a graph, said computer program comprising:
- computer readable program code means for causing the computer to accept entered written signs in the form of characters, symbols, and/or graphicals in a document, the entered written signs having an attribute distinct from those of ordinary writings representative of contents of the document, and the entered written signs specifying a format of a graph represented by the ordinary writings;
- computer readable program code means for causing the computer to recognize unitary descriptors having a unitary meaning on the basis of the entered written signs;
- computer readable program code means for causing the computer to recognize composite descriptors on the basis of a plurality of the unitary descriptors corresponding to a plurality of the entered written signs having association with one another according to predetermined association rules;
- and
- computer readable program code means for causing the computer to produce graph definition data defining contents of the unitary descriptors and/or the composite descriptors.
2 more elements
A computer program embodied on a computer readable medium for use with a computer for defining a graph, said computer program comprising:
- computer readable program code means for causing the computer to accept entered written signs in the form of characters, symbols, and/or graphicals in a document, the entered written signs having an attribute distinct from those of ordinary writings representative of contents of the document, and the entered written signs specifying a format of a graph represented by the ordinary writings;
- computer readable program code means for causing the computer to recognize unitary descriptors having a unitary meaning on the basis of the entered written signs;
- computer readable program code means for causing the computer to recognize composite descriptors on the basis of a plurality of the unitary descriptors corresponding to a plurality of the entered written signs having association with one another according to predetermined association rules;
- computer readable program code means for causing the computer to produce graph definition data defining contents of the unitary descriptors and/or the composite descriptors;
- and
- computer readable program code means for causing the computer to execute predetermined processes specified by the graph definition data in a predetermined order to make an object graph defined in the document.
3 more elements
Dependencies are inferred from the claim text.