mirror of
https://github.com/gchq/CyberChef.git
synced 2025-04-20 14:56:19 -04:00
Merge pull request #1751 from sw5678/master
This commit is contained in:
commit
a429902d41
1 changed files with 9 additions and 14 deletions
|
@ -101,22 +101,17 @@ class RAKE extends Operation {
|
||||||
phrases = phrases.filter(subArray => subArray.length > 0);
|
phrases = phrases.filter(subArray => subArray.length > 0);
|
||||||
|
|
||||||
// Remove duplicate phrases
|
// Remove duplicate phrases
|
||||||
const uniquePhrases = [...new Set(phrases.map(function (phrase) {
|
phrases = phrases.unique();
|
||||||
return phrase.join(" ");
|
|
||||||
}))];
|
|
||||||
phrases = uniquePhrases.map(function (phrase) {
|
|
||||||
return phrase.split(" ");
|
|
||||||
});
|
|
||||||
|
|
||||||
// Generate word_degree_matrix and populate
|
// Generate word_degree_matrix and populate
|
||||||
const wordDegreeMatrix = Array.from(Array(tokens.length), _ => Array(tokens.length).fill(0));
|
const wordDegreeMatrix = Array(tokens.length).fill().map(() => Array(tokens.length).fill(0));
|
||||||
phrases.forEach(function (phrase) {
|
for (const phrase of phrases) {
|
||||||
phrase.forEach(function (word1) {
|
for (const word1 of phrase) {
|
||||||
phrase.forEach(function (word2) {
|
for (const word2 of phrase) {
|
||||||
wordDegreeMatrix[tokens.indexOf(word1)][tokens.indexOf(word2)]++;
|
wordDegreeMatrix[tokens.indexOf(word1)][tokens.indexOf(word2)]++;
|
||||||
});
|
}
|
||||||
});
|
}
|
||||||
});
|
}
|
||||||
|
|
||||||
// Calculate degree score for each token
|
// Calculate degree score for each token
|
||||||
const degreeScores = Array(tokens.length).fill(0);
|
const degreeScores = Array(tokens.length).fill(0);
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue