Hello,

I have to find n-grams over a large corpora, which I would like to do
in batches, that is, using merge.  I know that this functionality
exists in NSP Ngrams, but limited to bigrams, but looking at the code
it seems that the constraint comes only at the sorting step. Is that
true? Are there any potential pitfalls in changing that? Is this
something that will come in a future release?

thanks very much,
ilya









SPONSORED LINKS
Computer internet security Package design Ski packages
Vacation packages Snowboard packages Package integrity testing


YAHOO! GROUPS LINKS




Reply via email to