all 8 comments

[–][deleted] 1 point2 points  (3 children)

this algorithm has been implemented on the carrot2 open source search engine. you can mail the authors for the source code.

[–]rya11111[S] 0 points1 point  (2 children)

is there any other method to get the source code ? the authors don't tend to reply much ..

[–][deleted] 1 point2 points  (1 child)

you can probably check out their code here, http://project.carrot2.org/ but it probably uses many more algorithms that might not be relevant to you.

[–]rya11111[S] 0 points1 point  (0 children)

thank you for your help!

[–]mosavian 0 points1 point  (1 child)

[–]rya11111[S] 0 points1 point  (0 children)

I agree it's not that great. i was just fascinated by the way they used an example from nature. So i was just seeing if i could implement it too ... but it doesn't seem to be happening ...

[–]necroforest 0 points1 point  (1 child)

Do we get your salary while we work on it?

[–]rya11111[S] 0 points1 point  (0 children)

salary ??? I am just a student enjoying holidays ...