<> <> <> <<>> <> <<>> <> <<>> <<(1) For each keyword ki, get a list of all fileName containing ki, call this L[ki].>> <<(2) For each L[ki], traverse list, and add results of entry to CumulativeHashTable.>> <<(3) Dump results of CumulativeHashTable back to FinalList. Sort final List by frequency. Done.>> <<>> DIRECTORY KeyNote, Rope; KeyNoteWeightedMatching: CEDAR DEFINITIONS = BEGIN <> ROPE: TYPE = Rope.ROPE; TokenInfoList: TYPE = LIST OF TokenInfo; TokenInfo: TYPE = REF ANY; <> TokenInfoObject: TYPE = RECORD [ token: ROPE, frequency: INTEGER]; <> << >> WeightedMatch: PROC [db: KeyNote.Handle, ropeList: KeyNote.ResultList] RETURNS [resultList: KeyNote.ResultList]; <<>> END.