Method and/or system for transforming between trees and strings
View Patent ↗Briefly, in accordance with one embodiment, a method of processing non-transitory stored binary digital 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 of the represented expressions and have a non-common view for common expression types of the 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.
1. A method of processing non-transitory stored binary digital signal quantities using a computing device comprising:
transforming via said computing device 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, said represented expressions having a common view for non-common expression types of said represented expressions and having a non-common view for common expression types of said represented expressions, said represented expressions comprising at least one of the following expression types: a hierarchical edge and/or node labeled tree or a symbol string.
2. The method of claim 1 , wherein for non-common expression types said represented expression that comprises a symbol string includes an ASCII symbol string that comprises one or more numerals.
3. The method of claim 1 , wherein said first represented expression comprises a hierarchical edge and/or node labeled tree and said second represented expression comprises a symbol string.
4. The method of claim 1 , wherein said first represented expression comprises a symbol string and said second represented expression comprises a hierarchical edge and/or node labeled tree.
5. The method of claim 1 , and further comprising, prior to said transforming, employing operations with respect to said first represented expression.
6. The method of claim 5 , and further comprising, prior to said transforming, employing operations with respect to said second represented expression.
7. The method of claim 1 , and further comprising, subsequent to said transforming, employing operations with respect to said first represented expression.
8. The method of claim 7 , and further comprising, subsequent to said transforming, employing operations with respect to said second represented expression.
9. The method of claim 1 , wherein said first represented expression comprises an ASCII symbol string comprising one or more numerals and said second represented expression comprises a hierarchical edge and/or node labeled tree.
10. The method of claim of claim 1 , wherein said non-transitory stored binary digital signal quantities are stored within a database.
11. An article comprising:
a non-transitory storage medium comprising instructions stored thereon to, said instructions being executable by a computing device to:
transform 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, said represented expressions to have a common view for non-common expression types of said represented expressions and to have a non-common view for common expression types of said represented expressions, said represented expressions to comprise at least one of the following expression types: a hierarchical edge and/or node labeled tree or a symbol string.
12. The article of claim 11 , wherein for non-common expression types said represented expression that is to comprise a symbol string includes an ASCII symbol string that is to comprise one or more numerals.
13. The article of claim 11 , wherein said first represented expression to comprise a hierarchical edge and/or node labeled tree and said second represented expression to comprise a symbol string.
14. The article of claim 11 , wherein said first represented expression to comprise a symbol string and said second represented expression to comprise a hierarchical edge and/or node labeled tree.
15. The article of claim 11 , wherein said storage medium further comprises instructions stored thereon to employ operations with respect to said first represented expression prior to said transformation.
16. The article of claim 15 , wherein said storage medium further comprises instructions stored thereon to employ operations with respect to said second represented expression prior to said transformation.
17. The article of claim 11 , wherein said storage medium further comprises instructions stored thereon to employ operations with respect to said first represented expression subsequent to said transformation.
18. The article of claim 11 , wherein said storage medium further comprises instructions stored thereon to employ operations with respect to said second represented expression subsequent to said transformation.
19. The article of claim 11 , wherein said first represented expression to comprise an ASCII symbol string to comprise one or more numerals and said second represented expression to comprise a hierarchical edge and/or node labeled tree and/or a symbol string.
20. The article of claim of claim 11 , wherein said non-transitory stored binary digital signal quantities are to be stored within a database.
21. An apparatus comprising: a computing device, the computing device to:
transform 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, said represented expressions to have a common view for non-common expression types of said represented expressions and to have a non-common view for common expression types of said represented expressions, said represented expressions to comprise at least one of the following expression types: a hierarchical edge and/or node labeled tree or a symbol string.
22. The apparatus of claim 21 , wherein for non-common expression types said represented expression that is to comprise a symbol string includes an ASCII symbol string that is to comprise one or more numerals.
23. The apparatus of claim 21 , wherein said first represented expression to comprise a hierarchical edge and/or node labeled tree and said second represented expression to comprise a symbol string.
24. The apparatus of claim 21 , wherein said first represented expression to comprise a symbol string and said second represented expression to comprise a hierarchical edge and/or node labeled tree.
25. The apparatus of claim 21 , wherein said computing device to employ operations with respect to said first represented expression prior to said transformation.
26. The apparatus of claim 25 , wherein said computing device to employ operations with respect to said second represented expression prior to said transformation.
27. The apparatus of claim 21 , wherein said computing device to employ operations with respect to said first represented expression subsequent to said transformation.
28. The apparatus of claim 27 , wherein said computing device to employ operations with respect to said second represented expression subsequent to said transformation.
29. The apparatus of claim 21 , wherein said first represented expression to comprise an ASCII symbol string to comprise one or more numerals and said second represented expression to comprise a hierarchical edge and/or node labeled tree.
30. The apparatus of claim of claim 21 , wherein said non-transitory stored binary digital signal quantities are to be stored within a database.