implementing similarity measures we can check if sinx + siny is a sub tree
of the given expr tree..and sometimes when users pose similar questions
like trigsimp(some similar exprs not exactly same) we can incorporate AI to
the trigsimp function for ex. trigsimp by fu algo rule list 2 is a long
proc
How does the similarity measure help in either of these cases?
Aaron Meurer
On Mon, Apr 9, 2012 at 6:22 PM, manoj babu wrote:
> in many cases we are just using term.match(pattern) but applying the
> similarity between these two trees expr tree and pattern tree it would
> become useful in some ca
in many cases we are just using term.match(pattern) but applying the
similarity between these two trees expr tree and pattern tree it would
become useful in some cases like...
simplify(sinx + siny + 2sin(x-y/2)cos(x+y/2)) which will result in 2*cos(x)
On Tue, Apr 10, 2012 at 5:48 AM, manoj babu wr
I think it should be useful for term.match(pattern).
On Mon, Apr 9, 2012 at 11:59 PM, Aaron Meurer wrote:
> An expression tree is essentially the tree you get from recursively
> calling .args on an expression. For example, if you have expr =
> sin(x) + 1, then expr.args = (sin(x), 1), and sin(x
An expression tree is essentially the tree you get from recursively
calling .args on an expression. For example, if you have expr =
sin(x) + 1, then expr.args = (sin(x), 1), and sin(x).args = (x,).
The idea is to come up with some measures that use this tree structure
to indicate how similar two
Can any one please help me with it.. what does it accutally mean ??
and implementing it what is the plus for sympy...
--
You received this message because you are subscribed to the Google Groups
"sympy" group.
To post to this group, send email to sympy@googlegroups.com.
To unsubscribe from this
