Adam Funk wrote:
> Sorry if this is a bit off-topic, but at least it's for an NLP
> application. I have a file of pairs of WordNet synset numbers that
> represent hypernym-hyponym pairs, for example:
> and I want to produce all the longest possible chains of them. The
> output for that list is as follows:
> I have a program that does this correctly for small samples of the data
> I'm supposed to process, but I've estimated (using a log plot) that it
> will take about 10^595 seconds to run over the whole list (about 89000
> pairs), so I think I'm doing it wrong.
> I haven't been able to find an algorithm for this, because I don't know
> what the computational problem is called. Can anyone point me in the
> direction of something suitable?
> Corpora mailing list
> Corpora at uib.no
-- Ken Litkowski TEL.: 301-482-0237 CL Research EMAIL: ken at clres.com 9208 Gue Road Home Page: http://www.clres.com Damascus, MD 20872-1025 USA Blog: http://www.clres.com/blog