Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

difficulty with full covariance matrices (math)

by etherC (Initiate)
on Feb 21, 2006 at 07:36 UTC ( [id://531637]=perlquestion: print w/replies, xml ) Need Help??

etherC has asked for the wisdom of the Perl Monks concerning the following question:

First of all, thanks so much to those of you who helped me a year back when I was first starting to learn perl.

Now I've landed an internship where I can finally use it, though now I'm sinking in a huge speech recognition engine trying to adapt it to be able to process full-covariance matrices as opposed to just the diagonal elements of one.

This requires a rewrite of the underlying math of the system to work with full-covariance data in all places where diagonal data is being used, and I've done that. The new option is selectable by using a switch at the command line. All the tests I've done show that the new code works, at least in the test environment.

If I give the test program a full-covariance matrix that has only diagonal elements (and the rest is filled with 0's) as input, it will give the exact same result as when given an array of those elements (and processed by the old math/system), which makes me think the new math is correct. Calculations by hand with simple full-covariance matrices (not 0's on the diagonal), give the same results as the program spits out.

The problem is, when I give the real program diagonal data that's been converted to be in the form of a full-covariance matrix (once again, 0's on the diagonal), the speech recognition results drop by 20%.

I've spent a ton of time debugging and so far have found absolutely nothing strange.

Has anyone ever encountered such a situation? What finally worked for you?

If you haven't had this situation before, does anything jump out at you when you hear about it?

Any input would be greatly appreciated. Thanks :)

~etherC~

  • Comment on difficulty with full covariance matrices (math)

Replies are listed 'Best First'.
Re: difficulty with full covariance matrices (math)
by moklevat (Priest) on Feb 21, 2006 at 14:38 UTC
    I work a fair bit with matrices, but know nothing about speech recognition. I usually think of a "full covariance" matrix as a variance/covariance matrix with the variances on the diagonal. So, why do you have "0's on the diagonal"?

    Without more information I tend to suspect indexing/slicing problems, or that something needs to be transposed, when a matrix misbehaves. If you can post some code someone might be able to help more.
Re: difficulty with full covariance matrices (math)
by Anonymous Monk on Feb 21, 2006 at 09:50 UTC
    To be honest, i totally don't understand the question, what do you want to do, how is it related to perl, do you have a sample source of what you want (or try)??

      Chicken! You logged out just cause you didn't want to admit (like I don't want to admit) that the mathematics here is WAAAY beyond us! :)
        Indeed i was logged out i see now...
        So it was me, does it make you feel better? :)

        And no, i don't understand the question, does anyone?

        "We all agree on the necessity of compromise. We just can't agree on when it's necessary to compromise." - Larry Wall.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: perlquestion [id://531637]
Approved by Corion
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (2)
As of 2024-04-26 03:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found