Closed lazywei closed 8 years ago
Now, the very simple and crude first version of mockingbird has done, the provided features
Awesome! I'm not familiar with Go but it seems like a good opportunity to learn :)
We're trying to improve the performance in terms of memory usage for linguist classifier.
Were you able to quantify this? What is the current memory usage?
Given that, is there any suggestion / preference on the algorithms to implement in mockingbird?
What's the current accuracy with the Naive Bayesian classifier? What are you using as test samples?
Were you able to quantify this? What is the current memory usage?
nope, not yet. I'll do a benchmark for memory usage asap
What's the current accuracy with the Naive Bayesian classifier? What are you using as test samples?
I didn't conduct a accuracy comparison. However, I have used some test samples for make sure mockingbird and linguist's NB give the same results on the same training/testing data. (plus, there is no randomness in NB).
As for the test samples, I'm using a subset of Rosetta code data.
As for the test samples, I'm using a subset of Rosetta code data.
Would it be possible to use Linguist's samples in addition to Rosetta's? I know some of Rosetta codes are very short so using samples from Linguist in addition could improve the relevance of the training/test sample set. What do you think?
Given we have libsvm format converter, we are able to implement more classification algorithms now (i.e., we have the flexibility). Given that, is there any suggestion / preference on the algorithms to implement in mockingbird?
That sounds great! Hey @lazywei, What do you think about #2618?
Closing as stale.
Hi linguist community!
As some of you might know, I'm currently doing GSoC with @arfon @vmg @bkeepers . We are rewriting the Naive Bayesian part into Golang in here: https://github.com/lazywei/mockingbird
Now, the very simple and crude first version of mockingbird has done, the provided features:
And I'd like to initiate the discussion for:
Thanks!
/cc @pchaigno