  This paper proposes an algebraic view of trees which opens the doors to an
alternative computational scheme with respect to classic algorithms. In
particular, it is shown that this view is very well-suited for machine learning
and computational linguistics.
