From 81e1abd68236623cb7d46ee08eb69a5d1c2e200a Mon Sep 17 00:00:00 2001
From: sw5678 <151949597+sw5678@users.noreply.github.com>
Date: Mon, 11 Mar 2024 16:57:28 +0000
Subject: [PATCH] Improving efficency of RAKE

---
 src/core/operations/RAKE.mjs | 25 ++++++++++---------------
 1 file changed, 10 insertions(+), 15 deletions(-)

diff --git a/src/core/operations/RAKE.mjs b/src/core/operations/RAKE.mjs
index d1165b51..d54143ae 100644
--- a/src/core/operations/RAKE.mjs
+++ b/src/core/operations/RAKE.mjs
@@ -101,22 +101,17 @@ class RAKE extends Operation {
         phrases = phrases.filter(subArray => subArray.length > 0);
 
         // Remove duplicate phrases
-        const uniquePhrases = [...new Set(phrases.map(function (phrase) {
-            return phrase.join(" ");
-        }))];
-        phrases = uniquePhrases.map(function (phrase) {
-            return phrase.split(" ");
-        });
-
+        phrases = phrases.unique();
+        
         // Generate word_degree_matrix and populate
-        const wordDegreeMatrix = Array.from(Array(tokens.length), _ => Array(tokens.length).fill(0));
-        phrases.forEach(function (phrase) {
-            phrase.forEach(function (word1) {
-                phrase.forEach(function (word2) {
-                    wordDegreeMatrix[tokens.indexOf(word1)][tokens.indexOf(word2)]++;
-                });
-            });
-        });
+        const wordDegreeMatrix = Array(tokens.length).fill().map(() => Array(tokens.length).fill(0));
+        for (let p=0; p < phrases.length; p++) {
+            for (let w1=0; w1 < phrases[p].length; w1++) {
+                for (let w2=0; w2 < phrases[p].length; w2++) {
+                    wordDegreeMatrix[tokens.indexOf(phrases[p][w1])][tokens.indexOf(phrases[p][w2])]++;
+                }
+            }
+        }
 
         // Calculate degree score for each token
         const degreeScores = Array(tokens.length).fill(0);