From: Eric F. <er...@us...> - 2002-01-02 20:00:43
|
Update of /cvsroot/maxent/maxent In directory usw-pr-cvs1:/tmp/cvs-serv11395 Modified Files: CHANGES Log Message: [copied from CHANGES file] Upgraded trove dependency to 0.1.1 (includes TIntArrayList, with reset()) (Eric) (opennlp.maxent.DataIndexer) Refactored event count computation so that the cutoff can be applied while events are read. This obviates the need for a separate pass over the predicates between event count computation and indexing. It also saves memory by reducing the amount of temporary data needed and by avoiding creation of instances of the Counter class. the applyCutoff() method was no longer needed and so is gone. (Eric) (opennlp.maxent.DataIndexer) Made the event count computation + cutoff application also handle the assignment of unique indexes to predicates that "make the cut." This saves a fair amount of time in the indexing process. (Eric) (opennlp.maxent.DataIndexer) Refactored the indexing implementation so that TIntArrayLists are (re-)used for constructing the array of predicate references associated with each ComparableEvent. Using the TIntArrayList instead of an ArrayList of Integers dramatically reduces the amount of garbage produced during indexing; it's also smaller. (Eric) (opennlp.maxent.DataIndexer) removed toIntArray() method, since TIntArrayList provides the same behavior without the cost of a loop over a List of Integers (Eric) (opennlp.maxent.DataIndexer) changed indexing Maps to TObjectIntHashMaps to save space in several places. (Eric) Index: CHANGES =================================================================== RCS file: /cvsroot/maxent/maxent/CHANGES,v retrieving revision 1.6 retrieving revision 1.7 diff -C2 -d -r1.6 -r1.7 *** CHANGES 2002/01/02 11:31:30 1.6 --- CHANGES 2002/01/02 20:00:39 1.7 *************** *** 1,2 **** --- 1,36 ---- + 1.2.7 + _____ + + Upgraded trove dependency to 0.1.1 (includes TIntArrayList, with reset()) + (Eric) + + (opennlp.maxent.DataIndexer) + Refactored event count computation so that the cutoff can be applied while + events are read. This obviates the need for a separate pass over the + predicates between event count computation and indexing. It also saves + memory by reducing the amount of temporary data needed and by avoiding + creation of instances of the Counter class. the applyCutoff() method + was no longer needed and so is gone. (Eric) + + (opennlp.maxent.DataIndexer) + Made the event count computation + cutoff application also handle the + assignment of unique indexes to predicates that "make the cut." This + saves a fair amount of time in the indexing process. (Eric) + + (opennlp.maxent.DataIndexer) + Refactored the indexing implementation so that TIntArrayLists are + (re-)used for constructing the array of predicate references associated + with each ComparableEvent. Using the TIntArrayList instead of an + ArrayList of Integers dramatically reduces the amount of garbage + produced during indexing; it's also smaller. (Eric) + + (opennlp.maxent.DataIndexer) + removed toIntArray() method, since TIntArrayList provides the same + behavior without the cost of a loop over a List of Integers (Eric) + + (opennlp.maxent.DataIndexer) + changed indexing Maps to TObjectIntHashMaps to save space in several + places. (Eric) + 1.2.6 ----- |