Method and/or system for transforming between trees and strings
First Claim
1. A method of converting signal values representing a first expression for more convenient processing and/or storage, the method comprising:
- executing one or more processors of one or more computing devices comprising;
accessing, from memory, signal values representing a first expression;
transforming the signal values representing the first expression to signal values representing a second expression, the represented expressions having a common view for non-common expression types of the represented expressions and having a non-common view for common expression types of the represented expressions, the represented expressions comprising at least one of the following expression types;
a hierarchical edge and/or node labeled tree or a symbol string; and
storing, in the memory, the signal values corresponding to the represented second expression.
3 Assignments
0 Petitions
Accused Products
Abstract
Briefly, in accordance with one embodiment, a method of processing non-transitory binary signal quantities using a computing device is disclosed. For example, a computing device transforms between at least first and at least second non-transitory stored binary digital signal quantities respectively representing at least a first and at least a second expression. The represented expressions have a common view for non-common expression types and have a non-common view for common expression types of said represented expressions. The represented expressions include at least one of the following expression types: a hierarchical edge and/or node labeled tree or a symbol string.
248 Citations
30 Claims
-
1. A method of converting signal values representing a first expression for more convenient processing and/or storage, the method comprising:
-
executing one or more processors of one or more computing devices comprising; accessing, from memory, signal values representing a first expression; transforming the signal values representing the first expression to signal values representing a second expression, the represented expressions having a common view for non-common expression types of the represented expressions and having a non-common view for common expression types of the represented expressions, the represented expressions comprising at least one of the following expression types;
a hierarchical edge and/or node labeled tree or a symbol string; andstoring, in the memory, the signal values corresponding to the represented second expression. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. An article comprising:
-
a non-transitory storage medium comprising instructions stored thereon to, the instructions being executable by one or more processors of one or more computing devices to; access, from memory, signal values representing a first expression; transform the signal values representing the first expression to signal values representing a second expression, the represented expressions having a common view for non-common expression types of the represented expressions and having a non-common view for common expression types of the represented expressions, the represented expressions comprising at least one of the following expression types;
a hierarchical edge and/or node labeled tree or a symbol string; andstoring, in the memory, the signal values corresponding to the represented second expression. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. An apparatus comprising a computing device to convert signal values representing a first expression for more convenient processing and/or storage, the computing device to:
-
access, from memory, signal values to represent a first expression; transform the signal values to represent the first expression to signal values to represent a second expression, the represented expressions to have a common view for non-common expression types of the represented expressions and to have a non-common view for common expression types of the represented expressions, the represented expressions to comprise at least one of the following expression types;
a hierarchical edge and/or node labeled tree or a symbol string; andstore, in the memory, the signal values to represent the second expression. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30)
-
Specification