A JavaScript implementation of the Recall-Oriented Understudy for Gisting Evaluation (ROUGE) evaluation metric for summaries. This package implements the following metrics:
Note: This is a fork of the original ROUGE.js by kenlimmj. This fork adds TypeScript types, security fixes, and other improvements.
ROUGE is somewhat a standard metric for evaluating the performance of auto-summarization algorithms. However, with the exception of MEAD (which is written in Perl. Yes. Perl.), requesting a copy of ROUGE to work with requires one to navigate a barely functional webpage, fill up forms, and sign a legal release somewhere along the way while at it. These definitely exist for good reason, but it gets irritating when all one wishes to do is benchmark an algorithm.
Nevertheless, the paper describing ROUGE is available for public consumption. The appropriate course of action is then to convert the equations in the paper to a more user-friendly format, which takes the form of the present repository. So there. No more forms. See how life could have been made a lot easier for everyone if we were all willing to stop writing legalese or making people click submit buttons?
This package is available on NPM:
npm install js-rouge
To use it:
import { n, l, s } from "js-rouge"; // ES Modules // OR const { n, l, s } = require("js-rouge"); // CommonJS
js-rouge provides three main functions:
n(candidate, reference, opts) - N-gram overlapl(candidate, reference, opts) - Longest Common Subsequences(candidate, reference, opts) - Skip-bigram co-occurrenceAll functions return an F-score between 0 and 1.
import { n as rougeN } from "js-rouge"; const candidate = "the cat sat on the mat"; const reference = "the cat sat on the mat"; // ROUGE-1 (unigram) rougeN(candidate, reference, { n: 1 }); // => 1.0 // ROUGE-2 (bigram) rougeN(candidate, reference, { n: 2 }); // => 1.0 // With partial match rougeN("the cat sat", "the cat sat on the mat", { n: 1 }); // => 0.75
import { l as rougeL } from "js-rouge"; const reference = "police killed the gunman"; const candidate = "police kill the gunman"; rougeL(candidate, reference); // => 0.75
import { s as rougeS } from "js-rouge"; const reference = "police killed the gunman"; const candidate = "police kill the gunman"; // Default: considers all word pairs rougeS(candidate, reference); // => 0.5 // With skip distance limit rougeS(candidate, reference, { maxSkip: 2 }); // considers only nearby word pairs
All functions are case-sensitive by default. Use caseSensitive: false for case-insensitive comparison:
import { n as rougeN } from "js-rouge"; rougeN("Hello World", "hello world"); // => 0 (no match) rougeN("Hello World", "hello world", { caseSensitive: false }); // => 1.0
| Option | Type | Default | Description |
|---|---|---|---|
n | number | 1 | N-gram size (1 = unigram, 2 = bigram, etc.) |
beta | number | 1.0 | F-measure weight (1.0 = F1, balanced precision/recall) |
caseSensitive | boolean | true | Whether comparison is case-sensitive |
tokenizer | function | Penn Treebank | Custom tokenizer function |
nGram | function | built-in | Custom n-gram generator |
| Option | Type | Default | Description |
|---|---|---|---|
beta | number | 1.0 | F-measure weight |
caseSensitive | boolean | true | Whether comparison is case-sensitive |
tokenizer | function | Penn Treebank | Custom tokenizer function |
segmenter | function | built-in | Custom sentence segmenter |
lcs | function | built-in | Custom LCS function |
| Option | Type | Default | Description |
|---|---|---|---|
beta | number | 1.0 | F-measure weight |
caseSensitive | boolean | true | Whether comparison is case-sensitive |
maxSkip | number | Infinity | Maximum skip distance between words |
tokenizer | function | Penn Treebank | Custom tokenizer function |
skipBigram | function | built-in | Custom skip-bigram generator |
tokenizer function that appropriately segments text in your target language.The package also exports utility functions, including jackknife resampling as described in the original paper:
import { n as rougeN, jackKnife } from "js-rouge"; const reference = "police killed the gunman"; const candidates = [ "police kill the gunman", "the gunman kill police", "the gunman police killed", ]; // Standard evaluation taking the arithmetic mean jackKnife(candidates, reference, rougeN); // Modified evaluation taking the distribution maximum const distMax = (arr) => Math.max(...arr); jackKnife(candidates, reference, rougeN, distMax);
This package is written in TypeScript and includes type definitions. All functions and utilities are fully typed.
import { n, l, s, jackKnife } from "js-rouge"; const score: number = n("candidate text", "reference text", { n: 2 });
Option interfaces are exported for typing your own functions and configurations:
import { n, RougeNOptions, RougeSOptions, RougeLOptions } from "js-rouge"; // Type your options objects const opts: RougeNOptions = { n: 2, caseSensitive: false }; const score = n("candidate", "reference", opts); // Type function parameters function evaluateSummary( candidate: string, reference: string, opts: RougeNOptions, ): number { return n(candidate, reference, opts); }
Development will be maintained under the Semantic Versioning guidelines as much as possible in order to ensure transparency and backwards compatibility.
Releases will be numbered with the following format:
<major>.<minor>.<patch>
And constructed with the following guidelines:
For more information on SemVer, visit http://semver.org/.
Have a bug or a feature request? Please open a new issue.
Please submit all pull requests against the main branch. All code should pass ESLint validation and tests.
The amount of data available for writing tests is unfortunately woefully inadequate. We've tried to be as thorough as possible, but that eliminates neither the possibility of nor existence of errors. The gold standard is the DUC data-set, but that too is form-walled and legal-release-walled, which is infuriating. If you have data in the form of a candidate summary, reference(s), and a verified ROUGE score you do not mind sharing, we would love to add that to the test harness.
MIT