axyseo 2.0.0-alpha.1

package/build/languageProcessing/helpers/passiveVoice/periphrastic/getClauses.js

@@ -0,0 +1,220 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = _default;
+var _indices = require("../../word/indices");
+var _stripSpaces = _interopRequireDefault(require("../../sanitize/stripSpaces.js"));
+var _quotes = require("../../sanitize/quotes.js");
+var _getIndicesWithRegex = _interopRequireDefault(require("./getIndicesWithRegex.js"));
+var _includesIndex = _interopRequireDefault(require("../../word/includesIndex"));
+var _followsIndex = _interopRequireDefault(require("../../word/followsIndex"));
+var _lodash = require("lodash");
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+/**
+ * Gets stop characters to determine sentence breakers.
+ *
+ * @param {string} sentence The sentence to get the stop characters from.
+ * @param {RegExp} stopCharacterRegex Regex to match the stop characters.
+ *
+ * @returns {Array} The array with stop characters.
+ */
+const getStopCharacters = function (sentence, stopCharacterRegex) {
+  let match;
+  const matches = [];
+  stopCharacterRegex.lastIndex = 0;
+  while ((match = stopCharacterRegex.exec(sentence)) !== null) {
+    matches.push({
+      index: match.index,
+      match: match[0]
+    });
+  }
+  return matches;
+};
+
+/**
+ * Filters auxiliaries preceded by a reflexive pronoun.
+ *
+ * @param {string} text The text part in which to check.
+ * @param {Array} auxiliaryMatches The auxiliary matches for which to check.
+ * @param {RegExp} directPrecedenceExceptionRegex The regex needed to find the right auxiliaries.
+ *
+ * @returns {Array} The filtered list of auxiliary indices.
+ */
+const auxiliaryPrecedenceExceptionFilter = function (text, auxiliaryMatches, directPrecedenceExceptionRegex) {
+  const directPrecedenceExceptionMatches = (0, _getIndicesWithRegex.default)(text, directPrecedenceExceptionRegex);
+  (0, _lodash.forEach)(auxiliaryMatches, function (auxiliaryMatch) {
+    if ((0, _includesIndex.default)(directPrecedenceExceptionMatches, auxiliaryMatch.index)) {
+      auxiliaryMatches = auxiliaryMatches.filter(function (auxiliaryObject) {
+        return auxiliaryObject.index !== auxiliaryMatch.index;
+      });
+    }
+  });
+  return auxiliaryMatches;
+};
+
+/**
+ * Filters auxiliaries followed by a word on the followingAuxiliaryExceptionWords list.
+ *
+ * @param {string} text The text part in which to check.
+ * @param {Array} auxiliaryMatches The auxiliary matches for which to check.
+ * @param {RegExp} followingAuxiliaryExceptionRegex The regex needed to find the right auxiliaries.
+ *
+ * @returns {Array} The filtered list of auxiliary indices.
+ */
+const followingAuxiliaryExceptionFilter = function (text, auxiliaryMatches, followingAuxiliaryExceptionRegex) {
+  const followingAuxiliaryExceptionMatches = (0, _getIndicesWithRegex.default)(text, followingAuxiliaryExceptionRegex);
+  (0, _lodash.forEach)(auxiliaryMatches, function (auxiliaryMatch) {
+    if ((0, _followsIndex.default)(followingAuxiliaryExceptionMatches, auxiliaryMatch)) {
+      auxiliaryMatches = auxiliaryMatches.filter(function (auxiliaryObject) {
+        return auxiliaryObject.index !== auxiliaryMatch.index;
+      });
+    }
+  });
+  return auxiliaryMatches;
+};
+
+/**
+ * Filters auxiliaries preceded by an elided word (e.g., s') on the elisionAuxiliaryExceptionWords list.
+ *
+ * @param {string} text The text part in which to check.
+ * @param {Array} auxiliaryMatches The auxiliary matches for which to check.
+ * @param {RegExp} elisionAuxiliaryExceptionRegex Regex to match the elisionAuxiliary exception.
+ *
+ * @returns {Array} The filtered list of auxiliary indices.
+ */
+const elisionAuxiliaryExceptionFilter = function (text, auxiliaryMatches, elisionAuxiliaryExceptionRegex) {
+  const elisionAuxiliaryExceptionMatches = (0, _getIndicesWithRegex.default)(text, elisionAuxiliaryExceptionRegex);
+  (0, _lodash.forEach)(auxiliaryMatches, function (auxiliaryMatch) {
+    if ((0, _includesIndex.default)(elisionAuxiliaryExceptionMatches, auxiliaryMatch.index, false)) {
+      auxiliaryMatches = auxiliaryMatches.filter(function (auxiliaryObject) {
+        return auxiliaryObject.index !== auxiliaryMatch.index;
+      });
+    }
+  });
+  return auxiliaryMatches;
+};
+
+/**
+ * Gets the indices of sentence breakers (auxiliaries, stopwords and stop characters;
+ * in English also active verbs) to determine clauses.
+ * Indices are filtered because there could be duplicate matches, like "even though" and "though".
+ * In addition, 'having' will be matched both as a -ing verb as well as an auxiliary.
+ *
+ * @param {string} sentence The sentence to check for indices of sentence breakers.
+ * @param {Object} options The language options for which to match the sentence breakers.
+ *
+ * @returns {Array} The array with valid indices to use for determining clauses.
+ */
+const getSentenceBreakers = function (sentence, options) {
+  sentence = sentence.toLocaleLowerCase();
+  const {
+    regexes
+  } = options;
+  let auxiliaryIndices = (0, _indices.getIndicesByWordList)(options.auxiliaries, sentence);
+  const stopCharacterIndices = getStopCharacters(sentence, regexes.stopCharacterRegex);
+  let stopwordIndices = (0, _indices.getIndicesByWordList)(options.stopwords, sentence);
+
+  // Check in options if there are other stopword indices created based on language-specific rules.
+  if (options.otherStopWordIndices && options.otherStopWordIndices.length > 0) {
+    stopwordIndices = stopwordIndices.concat(options.otherStopWordIndices);
+  }
+  if (typeof regexes.directPrecedenceExceptionRegex !== "undefined") {
+    // Filters auxiliaries matched in the sentence based on a precedence exception filter.
+    auxiliaryIndices = auxiliaryPrecedenceExceptionFilter(sentence, auxiliaryIndices, regexes.directPrecedenceExceptionRegex);
+  }
+  if (typeof regexes.elisionAuxiliaryExceptionRegex !== "undefined") {
+    // Filters auxiliaries matched in the sentence based on a elision exception filter.
+    auxiliaryIndices = elisionAuxiliaryExceptionFilter(sentence, auxiliaryIndices, regexes.elisionAuxiliaryExceptionRegex);
+  }
+  let totalIndices = auxiliaryIndices.concat(stopwordIndices, stopCharacterIndices);
+  totalIndices = (0, _indices.filterIndices)(totalIndices);
+  return (0, _indices.sortIndices)(totalIndices);
+};
+
+/**
+ * Gets the auxiliaries from a sentence.
+ *
+ * @param {string} sentencePart The part of the sentence to match for auxiliaries.
+ * @param {object} regexes The regexes needed to find the auxiliaries.
+ *
+ * @returns {Array} All formatted matches from the sentence part.
+ */
+const getAuxiliaryMatches = function (sentencePart, regexes) {
+  const {
+    auxiliaryRegex,
+    directPrecedenceExceptionRegex,
+    followingAuxiliaryExceptionRegex
+  } = regexes;
+  let auxiliaryMatches = sentencePart.match(auxiliaryRegex) || [];
+  if (typeof directPrecedenceExceptionRegex !== "undefined" || typeof followingAuxiliaryExceptionRegex !== "undefined") {
+    // An array with the matched auxiliaries and their indices.
+    let auxiliaryMatchIndices = (0, _indices.getIndicesByWordList)(auxiliaryMatches, sentencePart);
+    if (typeof directPrecedenceExceptionRegex !== "undefined") {
+      // Filters auxiliaries matched in the sentence part based on a precedence exception filter.
+      auxiliaryMatchIndices = auxiliaryPrecedenceExceptionFilter(sentencePart, auxiliaryMatchIndices, directPrecedenceExceptionRegex);
+    }
+    // Filters auxiliaries matched in the sentence part based on a exception filter for words following the auxiliary.
+    auxiliaryMatchIndices = followingAuxiliaryExceptionFilter(sentencePart, auxiliaryMatchIndices, followingAuxiliaryExceptionRegex);
+
+    // An array with the matched auxiliary verbs (without indices).
+    auxiliaryMatches = [];
+    (0, _lodash.forEach)(auxiliaryMatchIndices, function (auxiliaryMatchIndex) {
+      auxiliaryMatches.push(auxiliaryMatchIndex.match);
+    });
+  }
+  return (0, _lodash.map)(auxiliaryMatches, function (auxiliaryMatch) {
+    return (0, _stripSpaces.default)(auxiliaryMatch);
+  });
+};
+
+/**
+ * Gets the clauses from a sentence by determining sentence breakers.
+ *
+ * @param {string} sentence The sentence to split up into clauses.
+ * @param {object} options The language options for which to get the clauses.
+ *
+ * @returns {Array} The array with all clauses that have an auxiliary.
+ */
+const getClauses = function (sentence, options) {
+  const clauses = [];
+  const auxiliaryRegex = options.regexes.auxiliaryRegex;
+  sentence = (0, _quotes.normalizeSingle)(sentence);
+
+  // First check if there is an auxiliary in the sentence.
+  if (sentence.match(auxiliaryRegex) === null) {
+    return clauses;
+  }
+  const indices = getSentenceBreakers(sentence, options);
+  // Get the words after the found auxiliary.
+  for (let i = 0; i < indices.length; i++) {
+    let endIndex = sentence.length;
+    if (!(0, _lodash.isUndefined)(indices[i + 1])) {
+      endIndex = indices[i + 1].index;
+    }
+
+    // Cut the sentence from the current index to the endIndex (start of next breaker, of end of sentence).
+    const clause = (0, _stripSpaces.default)(sentence.substring(indices[i].index, endIndex));
+    const auxiliaryMatches = getAuxiliaryMatches(clause, options.regexes);
+    // If a clause doesn't have an auxiliary, we don't need it, so it can be filtered out.
+    if (auxiliaryMatches.length !== 0) {
+      const foundClause = new options.Clause(clause, auxiliaryMatches);
+      clauses.push(foundClause);
+    }
+  }
+  return clauses;
+};
+
+/**
+ * Split the sentence into clauses based on auxiliaries.
+ *
+ * @param {string} sentence The sentence to split in parts.
+ * @param {Object} options The language options for which to get the clauses.
+ *
+ * @returns {Array} A list with clauses.
+ */
+function _default(sentence, options) {
+  return getClauses(sentence, options);
+}
+//# sourceMappingURL=getClauses.js.map

package/build/languageProcessing/helpers/passiveVoice/periphrastic/getClauses.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getClauses.js","names":["_indices","require","_stripSpaces","_interopRequireDefault","_quotes","_getIndicesWithRegex","_includesIndex","_followsIndex","_lodash","e","__esModule","default","getStopCharacters","sentence","stopCharacterRegex","match","matches","lastIndex","exec","push","index","auxiliaryPrecedenceExceptionFilter","text","auxiliaryMatches","directPrecedenceExceptionRegex","directPrecedenceExceptionMatches","getWordIndices","forEach","auxiliaryMatch","includesIndex","filter","auxiliaryObject","followingAuxiliaryExceptionFilter","followingAuxiliaryExceptionRegex","followingAuxiliaryExceptionMatches","followsIndex","elisionAuxiliaryExceptionFilter","elisionAuxiliaryExceptionRegex","elisionAuxiliaryExceptionMatches","getSentenceBreakers","options","toLocaleLowerCase","regexes","auxiliaryIndices","getIndicesOfList","auxiliaries","stopCharacterIndices","stopwordIndices","stopwords","otherStopWordIndices","length","concat","totalIndices","filterIndices","sortIndices","getAuxiliaryMatches","sentencePart","auxiliaryRegex","auxiliaryMatchIndices","auxiliaryMatchIndex","map","stripSpaces","getClauses","clauses","normalizeSingleQuotes","indices","i","endIndex","isUndefined","clause","substring","foundClause","Clause","_default"],"sources":["../../../../../src/languageProcessing/helpers/passiveVoice/periphrastic/getClauses.js"],"sourcesContent":["import { getIndicesByWordList as getIndicesOfList, filterIndices, sortIndices } from \"../../word/indices\";\nimport stripSpaces from \"../../sanitize/stripSpaces.js\";\nimport { normalizeSingle as normalizeSingleQuotes } from \"../../sanitize/quotes.js\";\nimport getWordIndices from \"./getIndicesWithRegex.js\";\nimport includesIndex from \"../../word/includesIndex\";\nimport followsIndex from \"../../word/followsIndex\";\n\nimport { forEach, isUndefined, map } from \"lodash\";\n\n/**\n * Gets stop characters to determine sentence breakers.\n *\n * @param {string} sentence The sentence to get the stop characters from.\n * @param {RegExp} stopCharacterRegex Regex to match the stop characters.\n *\n * @returns {Array} The array with stop characters.\n */\nconst getStopCharacters = function( sentence, stopCharacterRegex ) {\n\tlet match;\n\tconst matches = [];\n\n\tstopCharacterRegex.lastIndex = 0;\n\n\twhile ( ( match = stopCharacterRegex.exec( sentence ) ) !== null ) {\n\t\tmatches.push(\n\t\t\t{\n\t\t\t\tindex: match.index,\n\t\t\t\tmatch: match[ 0 ],\n\t\t\t}\n\t\t);\n\t}\n\treturn matches;\n};\n\n/**\n * Filters auxiliaries preceded by a reflexive pronoun.\n *\n * @param {string} text The text part in which to check.\n * @param {Array} auxiliaryMatches The auxiliary matches for which to check.\n * @param {RegExp} directPrecedenceExceptionRegex The regex needed to find the right auxiliaries.\n *\n * @returns {Array} The filtered list of auxiliary indices.\n */\nconst auxiliaryPrecedenceExceptionFilter = function( text, auxiliaryMatches, directPrecedenceExceptionRegex ) {\n\tconst directPrecedenceExceptionMatches = getWordIndices( text, directPrecedenceExceptionRegex );\n\n\tforEach( auxiliaryMatches, function( auxiliaryMatch ) {\n\t\tif ( includesIndex( directPrecedenceExceptionMatches, auxiliaryMatch.index ) ) {\n\t\t\tauxiliaryMatches = auxiliaryMatches.filter( function( auxiliaryObject ) {\n\t\t\t\treturn auxiliaryObject.index !== auxiliaryMatch.index;\n\t\t\t} );\n\t\t}\n\t} );\n\n\treturn auxiliaryMatches;\n};\n\n/**\n * Filters auxiliaries followed by a word on the followingAuxiliaryExceptionWords list.\n *\n * @param {string} text The text part in which to check.\n * @param {Array} auxiliaryMatches The auxiliary matches for which to check.\n * @param {RegExp} followingAuxiliaryExceptionRegex The regex needed to find the right auxiliaries.\n *\n * @returns {Array} The filtered list of auxiliary indices.\n */\nconst followingAuxiliaryExceptionFilter = function( text, auxiliaryMatches, followingAuxiliaryExceptionRegex ) {\n\tconst followingAuxiliaryExceptionMatches = getWordIndices( text, followingAuxiliaryExceptionRegex );\n\n\tforEach( auxiliaryMatches, function( auxiliaryMatch ) {\n\t\tif ( followsIndex( followingAuxiliaryExceptionMatches, auxiliaryMatch ) ) {\n\t\t\tauxiliaryMatches = auxiliaryMatches.filter( function( auxiliaryObject ) {\n\t\t\t\treturn auxiliaryObject.index !== auxiliaryMatch.index;\n\t\t\t} );\n\t\t}\n\t} );\n\n\treturn auxiliaryMatches;\n};\n\n/**\n * Filters auxiliaries preceded by an elided word (e.g., s') on the elisionAuxiliaryExceptionWords list.\n *\n * @param {string} text The text part in which to check.\n * @param {Array} auxiliaryMatches The auxiliary matches for which to check.\n * @param {RegExp} elisionAuxiliaryExceptionRegex Regex to match the elisionAuxiliary exception.\n *\n * @returns {Array} The filtered list of auxiliary indices.\n */\nconst elisionAuxiliaryExceptionFilter = function( text, auxiliaryMatches, elisionAuxiliaryExceptionRegex ) {\n\tconst elisionAuxiliaryExceptionMatches = getWordIndices( text, elisionAuxiliaryExceptionRegex );\n\n\tforEach( auxiliaryMatches, function( auxiliaryMatch ) {\n\t\tif ( includesIndex( elisionAuxiliaryExceptionMatches, auxiliaryMatch.index, false ) ) {\n\t\t\tauxiliaryMatches = auxiliaryMatches.filter( function( auxiliaryObject ) {\n\t\t\t\treturn auxiliaryObject.index !== auxiliaryMatch.index;\n\t\t\t} );\n\t\t}\n\t} );\n\n\treturn auxiliaryMatches;\n};\n\n/**\n * Gets the indices of sentence breakers (auxiliaries, stopwords and stop characters;\n * in English also active verbs) to determine clauses.\n * Indices are filtered because there could be duplicate matches, like \"even though\" and \"though\".\n * In addition, 'having' will be matched both as a -ing verb as well as an auxiliary.\n *\n * @param {string} sentence The sentence to check for indices of sentence breakers.\n * @param {Object} options The language options for which to match the sentence breakers.\n *\n * @returns {Array} The array with valid indices to use for determining clauses.\n */\nconst getSentenceBreakers = function( sentence, options ) {\n\tsentence = sentence.toLocaleLowerCase();\n\tconst { regexes } = options;\n\tlet auxiliaryIndices = getIndicesOfList( options.auxiliaries, sentence );\n\tconst stopCharacterIndices = getStopCharacters( sentence, regexes.stopCharacterRegex );\n\tlet stopwordIndices = getIndicesOfList( options.stopwords, sentence );\n\n\t// Check in options if there are other stopword indices created based on language-specific rules.\n\tif ( options.otherStopWordIndices && options.otherStopWordIndices.length > 0 ) {\n\t\tstopwordIndices = stopwordIndices.concat( options.otherStopWordIndices );\n\t}\n\n\tif ( typeof regexes.directPrecedenceExceptionRegex !== \"undefined\" ) {\n\t\t// Filters auxiliaries matched in the sentence based on a precedence exception filter.\n\t\tauxiliaryIndices = auxiliaryPrecedenceExceptionFilter( sentence, auxiliaryIndices, regexes.directPrecedenceExceptionRegex );\n\t}\n\n\tif ( typeof regexes.elisionAuxiliaryExceptionRegex !== \"undefined\" ) {\n\t\t// Filters auxiliaries matched in the sentence based on a elision exception filter.\n\t\tauxiliaryIndices = elisionAuxiliaryExceptionFilter( sentence, auxiliaryIndices, regexes.elisionAuxiliaryExceptionRegex );\n\t}\n\n\tlet totalIndices = auxiliaryIndices.concat( stopwordIndices, stopCharacterIndices );\n\n\ttotalIndices = filterIndices( totalIndices );\n\n\treturn sortIndices( totalIndices );\n};\n\n/**\n * Gets the auxiliaries from a sentence.\n *\n * @param {string} sentencePart The part of the sentence to match for auxiliaries.\n * @param {object} regexes The regexes needed to find the auxiliaries.\n *\n * @returns {Array} All formatted matches from the sentence part.\n */\nconst getAuxiliaryMatches = function( sentencePart, regexes ) {\n\tconst { auxiliaryRegex, directPrecedenceExceptionRegex, followingAuxiliaryExceptionRegex } = regexes;\n\tlet auxiliaryMatches = sentencePart.match( auxiliaryRegex ) || [];\n\n\tif ( typeof directPrecedenceExceptionRegex !== \"undefined\" || typeof followingAuxiliaryExceptionRegex !== \"undefined\" ) {\n\t\t// An array with the matched auxiliaries and their indices.\n\t\tlet auxiliaryMatchIndices = getIndicesOfList( auxiliaryMatches, sentencePart );\n\n\t\tif ( typeof directPrecedenceExceptionRegex !== \"undefined\" ) {\n\t\t\t// Filters auxiliaries matched in the sentence part based on a precedence exception filter.\n\t\t\tauxiliaryMatchIndices = auxiliaryPrecedenceExceptionFilter( sentencePart, auxiliaryMatchIndices, directPrecedenceExceptionRegex );\n\t\t}\n\t\t// Filters auxiliaries matched in the sentence part based on a exception filter for words following the auxiliary.\n\t\tauxiliaryMatchIndices = followingAuxiliaryExceptionFilter( sentencePart, auxiliaryMatchIndices, followingAuxiliaryExceptionRegex );\n\n\t\t// An array with the matched auxiliary verbs (without indices).\n\t\tauxiliaryMatches = [];\n\n\t\tforEach( auxiliaryMatchIndices, function( auxiliaryMatchIndex ) {\n\t\t\tauxiliaryMatches.push( auxiliaryMatchIndex.match );\n\t\t} );\n\t}\n\n\treturn map( auxiliaryMatches, function( auxiliaryMatch ) {\n\t\treturn stripSpaces( auxiliaryMatch );\n\t} );\n};\n\n/**\n * Gets the clauses from a sentence by determining sentence breakers.\n *\n * @param {string} sentence The sentence to split up into clauses.\n * @param {object} options The language options for which to get the clauses.\n *\n * @returns {Array} The array with all clauses that have an auxiliary.\n */\nconst getClauses = function( sentence, options ) {\n\tconst clauses = [];\n\tconst auxiliaryRegex = options.regexes.auxiliaryRegex;\n\n\tsentence = normalizeSingleQuotes( sentence );\n\n\t// First check if there is an auxiliary in the sentence.\n\tif ( sentence.match( auxiliaryRegex ) === null ) {\n\t\treturn clauses;\n\t}\n\n\tconst indices = getSentenceBreakers( sentence, options );\n\t// Get the words after the found auxiliary.\n\tfor ( let i = 0; i < indices.length; i++ ) {\n\t\tlet endIndex = sentence.length;\n\t\tif ( ! isUndefined( indices[ i + 1 ] ) ) {\n\t\t\tendIndex = indices[ i + 1 ].index;\n\t\t}\n\n\t\t// Cut the sentence from the current index to the endIndex (start of next breaker, of end of sentence).\n\t\tconst clause = stripSpaces( sentence.substring( indices[ i ].index, endIndex ) );\n\n\t\tconst auxiliaryMatches = getAuxiliaryMatches( clause, options.regexes );\n\t\t// If a clause doesn't have an auxiliary, we don't need it, so it can be filtered out.\n\t\tif ( auxiliaryMatches.length !== 0 ) {\n\t\t\tconst foundClause = new options.Clause( clause, auxiliaryMatches );\n\t\t\tclauses.push( foundClause );\n\t\t}\n\t}\n\n\treturn clauses;\n};\n\n/**\n * Split the sentence into clauses based on auxiliaries.\n *\n * @param {string} sentence The sentence to split in parts.\n * @param {Object} options The language options for which to get the clauses.\n *\n * @returns {Array} A list with clauses.\n */\nexport default function( sentence, options ) {\n\treturn getClauses( sentence, options );\n}\n"],"mappings":";;;;;;AAAA,IAAAA,QAAA,GAAAC,OAAA;AACA,IAAAC,YAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,OAAA,GAAAH,OAAA;AACA,IAAAI,oBAAA,GAAAF,sBAAA,CAAAF,OAAA;AACA,IAAAK,cAAA,GAAAH,sBAAA,CAAAF,OAAA;AACA,IAAAM,aAAA,GAAAJ,sBAAA,CAAAF,OAAA;AAEA,IAAAO,OAAA,GAAAP,OAAA;AAAmD,SAAAE,uBAAAM,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAEnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,iBAAiB,GAAG,SAAAA,CAAUC,QAAQ,EAAEC,kBAAkB,EAAG;EAClE,IAAIC,KAAK;EACT,MAAMC,OAAO,GAAG,EAAE;EAElBF,kBAAkB,CAACG,SAAS,GAAG,CAAC;EAEhC,OAAQ,CAAEF,KAAK,GAAGD,kBAAkB,CAACI,IAAI,CAAEL,QAAS,CAAC,MAAO,IAAI,EAAG;IAClEG,OAAO,CAACG,IAAI,CACX;MACCC,KAAK,EAAEL,KAAK,CAACK,KAAK;MAClBL,KAAK,EAAEA,KAAK,CAAE,CAAC;IAChB,CACD,CAAC;EACF;EACA,OAAOC,OAAO;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMK,kCAAkC,GAAG,SAAAA,CAAUC,IAAI,EAAEC,gBAAgB,EAAEC,8BAA8B,EAAG;EAC7G,MAAMC,gCAAgC,GAAG,IAAAC,4BAAc,EAAEJ,IAAI,EAAEE,8BAA+B,CAAC;EAE/F,IAAAG,eAAO,EAAEJ,gBAAgB,EAAE,UAAUK,cAAc,EAAG;IACrD,IAAK,IAAAC,sBAAa,EAAEJ,gCAAgC,EAAEG,cAAc,CAACR,KAAM,CAAC,EAAG;MAC9EG,gBAAgB,GAAGA,gBAAgB,CAACO,MAAM,CAAE,UAAUC,eAAe,EAAG;QACvE,OAAOA,eAAe,CAACX,KAAK,KAAKQ,cAAc,CAACR,KAAK;MACtD,CAAE,CAAC;IACJ;EACD,CAAE,CAAC;EAEH,OAAOG,gBAAgB;AACxB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMS,iCAAiC,GAAG,SAAAA,CAAUV,IAAI,EAAEC,gBAAgB,EAAEU,gCAAgC,EAAG;EAC9G,MAAMC,kCAAkC,GAAG,IAAAR,4BAAc,EAAEJ,IAAI,EAAEW,gCAAiC,CAAC;EAEnG,IAAAN,eAAO,EAAEJ,gBAAgB,EAAE,UAAUK,cAAc,EAAG;IACrD,IAAK,IAAAO,qBAAY,EAAED,kCAAkC,EAAEN,cAAe,CAAC,EAAG;MACzEL,gBAAgB,GAAGA,gBAAgB,CAACO,MAAM,CAAE,UAAUC,eAAe,EAAG;QACvE,OAAOA,eAAe,CAACX,KAAK,KAAKQ,cAAc,CAACR,KAAK;MACtD,CAAE,CAAC;IACJ;EACD,CAAE,CAAC;EAEH,OAAOG,gBAAgB;AACxB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMa,+BAA+B,GAAG,SAAAA,CAAUd,IAAI,EAAEC,gBAAgB,EAAEc,8BAA8B,EAAG;EAC1G,MAAMC,gCAAgC,GAAG,IAAAZ,4BAAc,EAAEJ,IAAI,EAAEe,8BAA+B,CAAC;EAE/F,IAAAV,eAAO,EAAEJ,gBAAgB,EAAE,UAAUK,cAAc,EAAG;IACrD,IAAK,IAAAC,sBAAa,EAAES,gCAAgC,EAAEV,cAAc,CAACR,KAAK,EAAE,KAAM,CAAC,EAAG;MACrFG,gBAAgB,GAAGA,gBAAgB,CAACO,MAAM,CAAE,UAAUC,eAAe,EAAG;QACvE,OAAOA,eAAe,CAACX,KAAK,KAAKQ,cAAc,CAACR,KAAK;MACtD,CAAE,CAAC;IACJ;EACD,CAAE,CAAC;EAEH,OAAOG,gBAAgB;AACxB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMgB,mBAAmB,GAAG,SAAAA,CAAU1B,QAAQ,EAAE2B,OAAO,EAAG;EACzD3B,QAAQ,GAAGA,QAAQ,CAAC4B,iBAAiB,CAAC,CAAC;EACvC,MAAM;IAAEC;EAAQ,CAAC,GAAGF,OAAO;EAC3B,IAAIG,gBAAgB,GAAG,IAAAC,6BAAgB,EAAEJ,OAAO,CAACK,WAAW,EAAEhC,QAAS,CAAC;EACxE,MAAMiC,oBAAoB,GAAGlC,iBAAiB,CAAEC,QAAQ,EAAE6B,OAAO,CAAC5B,kBAAmB,CAAC;EACtF,IAAIiC,eAAe,GAAG,IAAAH,6BAAgB,EAAEJ,OAAO,CAACQ,SAAS,EAAEnC,QAAS,CAAC;;EAErE;EACA,IAAK2B,OAAO,CAACS,oBAAoB,IAAIT,OAAO,CAACS,oBAAoB,CAACC,MAAM,GAAG,CAAC,EAAG;IAC9EH,eAAe,GAAGA,eAAe,CAACI,MAAM,CAAEX,OAAO,CAACS,oBAAqB,CAAC;EACzE;EAEA,IAAK,OAAOP,OAAO,CAAClB,8BAA8B,KAAK,WAAW,EAAG;IACpE;IACAmB,gBAAgB,GAAGtB,kCAAkC,CAAER,QAAQ,EAAE8B,gBAAgB,EAAED,OAAO,CAAClB,8BAA+B,CAAC;EAC5H;EAEA,IAAK,OAAOkB,OAAO,CAACL,8BAA8B,KAAK,WAAW,EAAG;IACpE;IACAM,gBAAgB,GAAGP,+BAA+B,CAAEvB,QAAQ,EAAE8B,gBAAgB,EAAED,OAAO,CAACL,8BAA+B,CAAC;EACzH;EAEA,IAAIe,YAAY,GAAGT,gBAAgB,CAACQ,MAAM,CAAEJ,eAAe,EAAED,oBAAqB,CAAC;EAEnFM,YAAY,GAAG,IAAAC,sBAAa,EAAED,YAAa,CAAC;EAE5C,OAAO,IAAAE,oBAAW,EAAEF,YAAa,CAAC;AACnC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,mBAAmB,GAAG,SAAAA,CAAUC,YAAY,EAAEd,OAAO,EAAG;EAC7D,MAAM;IAAEe,cAAc;IAAEjC,8BAA8B;IAAES;EAAiC,CAAC,GAAGS,OAAO;EACpG,IAAInB,gBAAgB,GAAGiC,YAAY,CAACzC,KAAK,CAAE0C,cAAe,CAAC,IAAI,EAAE;EAEjE,IAAK,OAAOjC,8BAA8B,KAAK,WAAW,IAAI,OAAOS,gCAAgC,KAAK,WAAW,EAAG;IACvH;IACA,IAAIyB,qBAAqB,GAAG,IAAAd,6BAAgB,EAAErB,gBAAgB,EAAEiC,YAAa,CAAC;IAE9E,IAAK,OAAOhC,8BAA8B,KAAK,WAAW,EAAG;MAC5D;MACAkC,qBAAqB,GAAGrC,kCAAkC,CAAEmC,YAAY,EAAEE,qBAAqB,EAAElC,8BAA+B,CAAC;IAClI;IACA;IACAkC,qBAAqB,GAAG1B,iCAAiC,CAAEwB,YAAY,EAAEE,qBAAqB,EAAEzB,gCAAiC,CAAC;;IAElI;IACAV,gBAAgB,GAAG,EAAE;IAErB,IAAAI,eAAO,EAAE+B,qBAAqB,EAAE,UAAUC,mBAAmB,EAAG;MAC/DpC,gBAAgB,CAACJ,IAAI,CAAEwC,mBAAmB,CAAC5C,KAAM,CAAC;IACnD,CAAE,CAAC;EACJ;EAEA,OAAO,IAAA6C,WAAG,EAAErC,gBAAgB,EAAE,UAAUK,cAAc,EAAG;IACxD,OAAO,IAAAiC,oBAAW,EAAEjC,cAAe,CAAC;EACrC,CAAE,CAAC;AACJ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMkC,UAAU,GAAG,SAAAA,CAAUjD,QAAQ,EAAE2B,OAAO,EAAG;EAChD,MAAMuB,OAAO,GAAG,EAAE;EAClB,MAAMN,cAAc,GAAGjB,OAAO,CAACE,OAAO,CAACe,cAAc;EAErD5C,QAAQ,GAAG,IAAAmD,uBAAqB,EAAEnD,QAAS,CAAC;;EAE5C;EACA,IAAKA,QAAQ,CAACE,KAAK,CAAE0C,cAAe,CAAC,KAAK,IAAI,EAAG;IAChD,OAAOM,OAAO;EACf;EAEA,MAAME,OAAO,GAAG1B,mBAAmB,CAAE1B,QAAQ,EAAE2B,OAAQ,CAAC;EACxD;EACA,KAAM,IAAI0B,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,OAAO,CAACf,MAAM,EAAEgB,CAAC,EAAE,EAAG;IAC1C,IAAIC,QAAQ,GAAGtD,QAAQ,CAACqC,MAAM;IAC9B,IAAK,CAAE,IAAAkB,mBAAW,EAAEH,OAAO,CAAEC,CAAC,GAAG,CAAC,CAAG,CAAC,EAAG;MACxCC,QAAQ,GAAGF,OAAO,CAAEC,CAAC,GAAG,CAAC,CAAE,CAAC9C,KAAK;IAClC;;IAEA;IACA,MAAMiD,MAAM,GAAG,IAAAR,oBAAW,EAAEhD,QAAQ,CAACyD,SAAS,CAAEL,OAAO,CAAEC,CAAC,CAAE,CAAC9C,KAAK,EAAE+C,QAAS,CAAE,CAAC;IAEhF,MAAM5C,gBAAgB,GAAGgC,mBAAmB,CAAEc,MAAM,EAAE7B,OAAO,CAACE,OAAQ,CAAC;IACvE;IACA,IAAKnB,gBAAgB,CAAC2B,MAAM,KAAK,CAAC,EAAG;MACpC,MAAMqB,WAAW,GAAG,IAAI/B,OAAO,CAACgC,MAAM,CAAEH,MAAM,EAAE9C,gBAAiB,CAAC;MAClEwC,OAAO,CAAC5C,IAAI,CAAEoD,WAAY,CAAC;IAC5B;EACD;EAEA,OAAOR,OAAO;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAU,SAAU5D,QAAQ,EAAE2B,OAAO,EAAG;EAC5C,OAAOsB,UAAU,CAAEjD,QAAQ,EAAE2B,OAAQ,CAAC;AACvC","ignoreList":[]}

package/build/languageProcessing/helpers/passiveVoice/periphrastic/getIndicesWithRegex.js

@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = _default;
+/**
+ * Matches words from a list in sentence parts and returns them and their indices.
+ *
+ * @param {string} sentencePart The sentence part to match the words in.
+ * @param {RegExp} regex The regex used for matching.
+ * @returns {Array} The list of result objects.
+ */
+function _default(sentencePart, regex) {
+  const results = [];
+  /* Decided to use a for loop here so that we could retrieve all matches while keeping result objects intact.
+  For every match there is in the sentence part, an object with the match and its index will be pushed into
+  the results array. */
+  for (let match = regex.exec(sentencePart); match !== null; match = regex.exec(sentencePart)) {
+    results.push({
+      match: match[0],
+      index: match.index
+    });
+  }
+  return results;
+}
+//# sourceMappingURL=getIndicesWithRegex.js.map

package/build/languageProcessing/helpers/passiveVoice/periphrastic/getIndicesWithRegex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getIndicesWithRegex.js","names":["_default","sentencePart","regex","results","match","exec","push","index"],"sources":["../../../../../src/languageProcessing/helpers/passiveVoice/periphrastic/getIndicesWithRegex.js"],"sourcesContent":["/**\n * Matches words from a list in sentence parts and returns them and their indices.\n *\n * @param {string} sentencePart The sentence part to match the words in.\n * @param {RegExp} regex The regex used for matching.\n * @returns {Array} The list of result objects.\n */\nexport default function( sentencePart, regex ) {\n\tconst results = [];\n\t/* Decided to use a for loop here so that we could retrieve all matches while keeping result objects intact.\n\tFor every match there is in the sentence part, an object with the match and its index will be pushed into\n\tthe results array. */\n\tfor ( let match = regex.exec( sentencePart ); match !== null; match = regex.exec( sentencePart ) ) {\n\t\tresults.push( {\n\t\t\tmatch: match[ 0 ],\n\t\t\tindex: match.index,\n\t\t} );\n\t}\n\treturn results;\n}\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAA,SAAUC,YAAY,EAAEC,KAAK,EAAG;EAC9C,MAAMC,OAAO,GAAG,EAAE;EAClB;AACD;AACA;EACC,KAAM,IAAIC,KAAK,GAAGF,KAAK,CAACG,IAAI,CAAEJ,YAAa,CAAC,EAAEG,KAAK,KAAK,IAAI,EAAEA,KAAK,GAAGF,KAAK,CAACG,IAAI,CAAEJ,YAAa,CAAC,EAAG;IAClGE,OAAO,CAACG,IAAI,CAAE;MACbF,KAAK,EAAEA,KAAK,CAAE,CAAC,CAAE;MACjBG,KAAK,EAAEH,KAAK,CAACG;IACd,CAAE,CAAC;EACJ;EACA,OAAOJ,OAAO;AACf","ignoreList":[]}

package/build/languageProcessing/helpers/passiveVoice/periphrastic/matchRegularParticiples.js

@@ -0,0 +1,28 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = regularParticiples;
+var _lodash = require("lodash");
+/**
+ * Returns words that have been determined to be a regular participle.
+ *
+ * @param {string} word         The word to check.
+ * @param {RegExp[]} regexes    The regular participle regexes to match.
+ *
+ * @returns {Array} A list with the matches.
+ */
+function regularParticiples(word, regexes) {
+  // Matches word with language-specific participle regexes.
+  let matches = [];
+  regexes.forEach(function (regex) {
+    const match = word.match(regex);
+    if (match !== null) {
+      matches.push(match);
+    }
+  });
+  matches = (0, _lodash.flattenDeep)(matches);
+  return matches;
+}
+//# sourceMappingURL=matchRegularParticiples.js.map

package/build/languageProcessing/helpers/passiveVoice/periphrastic/matchRegularParticiples.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matchRegularParticiples.js","names":["_lodash","require","regularParticiples","word","regexes","matches","forEach","regex","match","push","flattenDeep"],"sources":["../../../../../src/languageProcessing/helpers/passiveVoice/periphrastic/matchRegularParticiples.js"],"sourcesContent":["import { flattenDeep } from \"lodash\";\n\n/**\n * Returns words that have been determined to be a regular participle.\n *\n * @param {string} word         The word to check.\n * @param {RegExp[]} regexes    The regular participle regexes to match.\n *\n * @returns {Array} A list with the matches.\n */\nexport default function regularParticiples( word, regexes ) {\n\t// Matches word with language-specific participle regexes.\n\tlet matches = [];\n\n\tregexes.forEach( function( regex ) {\n\t\tconst match = word.match( regex );\n\t\tif ( match !== null ) {\n\t\t\tmatches.push( match );\n\t\t}\n\t} );\n\tmatches = flattenDeep( matches );\n\treturn matches;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASC,kBAAkBA,CAAEC,IAAI,EAAEC,OAAO,EAAG;EAC3D;EACA,IAAIC,OAAO,GAAG,EAAE;EAEhBD,OAAO,CAACE,OAAO,CAAE,UAAUC,KAAK,EAAG;IAClC,MAAMC,KAAK,GAAGL,IAAI,CAACK,KAAK,CAAED,KAAM,CAAC;IACjC,IAAKC,KAAK,KAAK,IAAI,EAAG;MACrBH,OAAO,CAACI,IAAI,CAAED,KAAM,CAAC;IACtB;EACD,CAAE,CAAC;EACHH,OAAO,GAAG,IAAAK,mBAAW,EAAEL,OAAQ,CAAC;EAChC,OAAOA,OAAO;AACf","ignoreList":[]}

package/build/languageProcessing/helpers/passiveVoice/periphrastic/precedenceException.js

@@ -0,0 +1,46 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = _default;
+var _lodash = require("lodash");
+var _getWords = _interopRequireDefault(require("../../word/getWords"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+/**
+ * Checks whether a word from the precedence exception list occurs anywhere in the clause before the participle.
+ * If this is the case, the sentence part is not passive.
+ *
+ * @param {string} clause 		The clause that contains the participle.
+ * @param {string} participle   The participle.
+ * @param {Array} cannotBeBetweenPassiveAuxiliaryAndParticipleList  List of words which cannot be between auxiliary and participle.
+ *
+ * @returns {boolean} Returns true if a word from the precedence exception list occurs anywhere in the
+ *                    sentence part before the participle, otherwise returns false.
+ */
+function _default(clause, participle, cannotBeBetweenPassiveAuxiliaryAndParticipleList = []) {
+  // Break the sentence part up into words and convert to lower case.
+  const wordsInClause = (0, _getWords.default)(clause).map(word => word.toLowerCase());
+
+  // Search the participle in the word list.
+  const participleIndex = wordsInClause.indexOf(participle.toLowerCase());
+
+  /*
+   * There can be no exception in the following situations:
+   *
+   * -1 The participle is not found.
+   *  0 There is no word before the participle.
+   */
+  if (participleIndex < 1) {
+    return false;
+  }
+
+  // Check if the words preceding the participle are in the exceptions list.
+  for (let i = 0; i < participleIndex; i++) {
+    if ((0, _lodash.includes)(cannotBeBetweenPassiveAuxiliaryAndParticipleList, wordsInClause[i])) {
+      return true;
+    }
+  }
+  return false;
+}
+//# sourceMappingURL=precedenceException.js.map

package/build/languageProcessing/helpers/passiveVoice/periphrastic/precedenceException.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"precedenceException.js","names":["_lodash","require","_getWords","_interopRequireDefault","e","__esModule","default","_default","clause","participle","cannotBeBetweenPassiveAuxiliaryAndParticipleList","wordsInClause","getWords","map","word","toLowerCase","participleIndex","indexOf","i","includes"],"sources":["../../../../../src/languageProcessing/helpers/passiveVoice/periphrastic/precedenceException.js"],"sourcesContent":["import { includes } from \"lodash\";\nimport getWords from \"../../word/getWords\";\n\n/**\n * Checks whether a word from the precedence exception list occurs anywhere in the clause before the participle.\n * If this is the case, the sentence part is not passive.\n *\n * @param {string} clause \t\tThe clause that contains the participle.\n * @param {string} participle   The participle.\n * @param {Array} cannotBeBetweenPassiveAuxiliaryAndParticipleList  List of words which cannot be between auxiliary and participle.\n *\n * @returns {boolean} Returns true if a word from the precedence exception list occurs anywhere in the\n *                    sentence part before the participle, otherwise returns false.\n */\nexport default function( clause, participle, cannotBeBetweenPassiveAuxiliaryAndParticipleList = [] ) {\n\t// Break the sentence part up into words and convert to lower case.\n\tconst wordsInClause = getWords( clause ).map( word => word.toLowerCase() );\n\n\t// Search the participle in the word list.\n\tconst participleIndex = wordsInClause.indexOf( participle.toLowerCase() );\n\n\t/*\n\t * There can be no exception in the following situations:\n\t *\n\t * -1 The participle is not found.\n\t *  0 There is no word before the participle.\n\t */\n\tif ( participleIndex < 1 ) {\n\t\treturn false;\n\t}\n\n\t// Check if the words preceding the participle are in the exceptions list.\n\tfor ( let i = 0; i < participleIndex; i++ ) {\n\t\tif ( includes( cannotBeBetweenPassiveAuxiliaryAndParticipleList, wordsInClause[ i ] ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\n\treturn false;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AACA,IAAAC,SAAA,GAAAC,sBAAA,CAAAF,OAAA;AAA2C,SAAAE,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAG,SAAUC,MAAM,EAAEC,UAAU,EAAEC,gDAAgD,GAAG,EAAE,EAAG;EACpG;EACA,MAAMC,aAAa,GAAG,IAAAC,iBAAQ,EAAEJ,MAAO,CAAC,CAACK,GAAG,CAAEC,IAAI,IAAIA,IAAI,CAACC,WAAW,CAAC,CAAE,CAAC;;EAE1E;EACA,MAAMC,eAAe,GAAGL,aAAa,CAACM,OAAO,CAAER,UAAU,CAACM,WAAW,CAAC,CAAE,CAAC;;EAEzE;AACD;AACA;AACA;AACA;AACA;EACC,IAAKC,eAAe,GAAG,CAAC,EAAG;IAC1B,OAAO,KAAK;EACb;;EAEA;EACA,KAAM,IAAIE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,eAAe,EAAEE,CAAC,EAAE,EAAG;IAC3C,IAAK,IAAAC,gBAAQ,EAAET,gDAAgD,EAAEC,aAAa,CAAEO,CAAC,CAAG,CAAC,EAAG;MACvF,OAAO,IAAI;IACZ;EACD;EAEA,OAAO,KAAK;AACb","ignoreList":[]}

package/build/languageProcessing/helpers/prominentWords/determineProminentWords.js

@@ -0,0 +1,203 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.collapseProminentWordsOnStem = collapseProminentWordsOnStem;
+exports.default = void 0;
+exports.filterProminentWords = filterProminentWords;
+exports.getProminentWords = getProminentWords;
+exports.getProminentWordsFromPaperAttributes = getProminentWordsFromPaperAttributes;
+exports.retrieveAbbreviations = retrieveAbbreviations;
+exports.sortProminentWords = sortProminentWords;
+var _lodash = require("lodash");
+var _getWords = _interopRequireDefault(require("../word/getWords"));
+var _quotes = require("../sanitize/quotes");
+var _ProminentWord = _interopRequireDefault(require("../../values/ProminentWord"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+const specialCharacters = /[1234567890‘’“”"'.…?!:;,¿¡«»&*@#±^%$|~=+§`[\](){}⟨⟩<>/\\–\-\u2014\u00d7\s]/g;
+
+/**
+ * Returns only those prominent words that occur more than a certain number of times and do not consist of special characters.
+ *
+ * @param {ProminentWord[]} prominentWords A list of prominent words.
+ * @param {int} [minimalNumberOfOccurrences] A minimal number of occurrences that is needed for a relevant prominentWord, default 2.
+ *
+ * @returns {ProminentWord[]} Only relevant words.
+ */
+function filterProminentWords(prominentWords, minimalNumberOfOccurrences = 2) {
+  prominentWords = prominentWords.filter(function (word) {
+    return word.getOccurrences() >= minimalNumberOfOccurrences && word.getWord().replace(specialCharacters, "") !== "";
+  });
+  return prominentWords;
+}
+
+/**
+ * Sorts prominent words based on their number of occurrences and length.
+ *
+ * @param {ProminentWord[]} prominentWords The prominent words to sort.
+ *
+ * @returns {void}
+ */
+function sortProminentWords(prominentWords) {
+  prominentWords.sort(function (wordA, wordB) {
+    const difference = wordB.getOccurrences() - wordA.getOccurrences();
+    // The word with the highest number of occurrences comes first.
+    if (difference !== 0) {
+      return difference;
+    }
+
+    // In case of a tie on occurrence number, the alphabetically first word comes first.
+    return wordA.getStem().localeCompare(wordB.getStem());
+  });
+}
+
+/**
+ * Collapses prominent words that have the same stem.
+ *
+ * @param {ProminentWord[]} prominentWords All prominentWords.
+ *
+ * @returns {ProminentWord[]} The original array with collapsed duplicates.
+ */
+function collapseProminentWordsOnStem(prominentWords) {
+  if (prominentWords.length === 0) {
+    return [];
+  }
+
+  // Sort the input array by stem
+  prominentWords.sort(function (wordA, wordB) {
+    return wordA.getStem().localeCompare(wordB.getStem());
+  });
+  const collapsedProminentWords = [];
+  let previousWord = new _ProminentWord.default(prominentWords[0].getWord(), prominentWords[0].getStem(), prominentWords[0].getOccurrences());
+  for (let i = 1; i < prominentWords.length; i++) {
+    const currentWord = new _ProminentWord.default(prominentWords[i].getWord(), prominentWords[i].getStem(), prominentWords[i].getOccurrences());
+
+    /*
+     * Compare the stem of the current word in the loop with the previously available stem.
+     * If they are equal, the word should be collapsed.
+     * When collapsing, the numbers of occurrences get summed.
+     * If the stem happens to equal the real word that occurred in the text, we can be sure it's ok to display it
+     * to the customer. So, the stem reassigns the word.
+     */
+    if (currentWord.getStem() === previousWord.getStem()) {
+      previousWord.setOccurrences(previousWord.getOccurrences() + currentWord.getOccurrences());
+      if (currentWord.getWord() === previousWord.getStem() || currentWord.getWord().toLocaleLowerCase() === previousWord.getStem()) {
+        previousWord.setWord(currentWord.getWord());
+      }
+    } else {
+      collapsedProminentWords.push(previousWord);
+      previousWord = currentWord;
+    }
+  }
+  collapsedProminentWords.push(previousWord);
+  return collapsedProminentWords;
+}
+
+/**
+ * Retrieves a list of all abbreviations from the text. Returns an empty array if the input text is empty.
+ *
+ * @param {string} text A text.
+ *
+ * @returns {string[]} A list of abbreviations from the list.
+ */
+function retrieveAbbreviations(text) {
+  const words = (0, _getWords.default)((0, _quotes.normalizeSingle)(text));
+  const abbreviations = [];
+  words.forEach(function (word) {
+    if (word.length > 1 && word.length < 5 && word === word.toLocaleUpperCase()) {
+      abbreviations.push(word.toLocaleLowerCase());
+    }
+  });
+  return (0, _lodash.uniq)(abbreviations);
+}
+
+/**
+ * Computes prominent words from an array of words. In order to do so, checks whether the word is included in the list of
+ * function words and determines the number of occurrences for every word. Then checks if any two words have the same stem
+ * and if so collapses over them.
+ *
+ * @param {string[]} words          The words to determine relevance for.
+ * @param {string[]} abbreviations  Abbreviations that should not be stemmed.
+ * @param {Function} stemmer        The available stemmer.
+ * @param {Array} functionWords     The available function words list.
+ *
+ * @returns {ProminentWord[]} All prominent words sorted and filtered for this text.
+ */
+function computeProminentWords(words, abbreviations, stemmer, functionWords) {
+  if (words.length === 0) {
+    return [];
+  }
+  const uniqueContentWords = (0, _lodash.uniq)(words.filter(word => !functionWords.includes(word.trim())));
+  const prominentWords = [];
+  uniqueContentWords.forEach(function (word) {
+    if (abbreviations.includes(word)) {
+      prominentWords.push(new _ProminentWord.default(word.toLocaleUpperCase(), word, words.filter(element => element === word).length));
+    } else {
+      prominentWords.push(new _ProminentWord.default(word, stemmer(word), words.filter(element => element === word).length));
+    }
+  });
+  return collapseProminentWordsOnStem(prominentWords);
+}
+
+/**
+ * Caches prominent words depending on text words.
+ * Only the words and abbreviations are used as the cache key as the stemmer and function words
+ * are config and shouldn't change in the scope of one request.
+ *
+ * @param {string[]} words          The words to determine relevance for.
+ * @param {string[]} abbreviations  Abbreviations that should not be stemmed.
+ * @param {Function} stemmer        The available stemmer.
+ * @param {Array} functionWords     The available function words list.
+ *
+ * @returns {function} The function that collects prominent words for a given set of text words, language and morphologyData.
+ */
+const computeProminentWordsMemoized = (0, _lodash.memoize)((words, abbreviations, stemmer, functionWords) => {
+  return computeProminentWords(words, abbreviations, stemmer, functionWords);
+}, (words, abbreviations) => {
+  return words.join(",") + "," + abbreviations.join(",");
+});
+
+/**
+ * Gets prominent words from the paper text.
+ *
+ * @param {string} text             The text to retrieve the prominent words from.
+ * @param {string[]} abbreviations  The abbreviations that occur in the text and attributes of the paper.
+ * @param {Function} stemmer        The available stemmer.
+ * @param {Array} functionWords     The available function words list.
+ * @param {function} getWordsCustomHelper   The custom helper to get words.
+ *
+ * @returns {ProminentWord[]} All prominent words sorted and filtered for this text.
+ */
+function getProminentWords(text, abbreviations, stemmer, functionWords, getWordsCustomHelper) {
+  if (text === "") {
+    return [];
+  }
+  const words = getWordsCustomHelper ? getWordsCustomHelper((0, _quotes.normalizeSingle)(text).toLocaleLowerCase()) : (0, _getWords.default)((0, _quotes.normalizeSingle)(text).toLocaleLowerCase());
+  return computeProminentWordsMemoized(words, abbreviations, stemmer, functionWords);
+}
+
+/**
+ * Gets prominent words from keyphrase and synonyms, metadescription, title, and subheadings.
+ *
+ * @param {string[]} attributes     The array with attributes to process.
+ * @param {string[]} abbreviations  The abbreviations that occur in the text and attributes of the paper.
+ * @param {Function} stemmer        The available stemmer.
+ * @param {Array} functionWords     The available function words list.
+ * @param {function} getWordsCustomHelper   The custom helper to get words.
+ *
+ * @returns {ProminentWord[]} Prominent words from the paper attributes.
+ */
+function getProminentWordsFromPaperAttributes(attributes, abbreviations, stemmer, functionWords, getWordsCustomHelper) {
+  const wordsFromAttributes = getWordsCustomHelper ? getWordsCustomHelper(attributes.join(" ").toLocaleLowerCase()) : (0, _getWords.default)(attributes.join(" ").toLocaleLowerCase());
+  return computeProminentWords(wordsFromAttributes, abbreviations, stemmer, functionWords);
+}
+var _default = exports.default = {
+  getProminentWords,
+  getProminentWordsFromPaperAttributes,
+  filterProminentWords,
+  sortProminentWords,
+  collapseProminentWordsOnStem,
+  retrieveAbbreviations
+};
+//# sourceMappingURL=determineProminentWords.js.map

package/build/languageProcessing/helpers/prominentWords/determineProminentWords.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"determineProminentWords.js","names":["_lodash","require","_getWords","_interopRequireDefault","_quotes","_ProminentWord","e","__esModule","default","specialCharacters","filterProminentWords","prominentWords","minimalNumberOfOccurrences","filter","word","getOccurrences","getWord","replace","sortProminentWords","sort","wordA","wordB","difference","getStem","localeCompare","collapseProminentWordsOnStem","length","collapsedProminentWords","previousWord","ProminentWord","i","currentWord","setOccurrences","toLocaleLowerCase","setWord","push","retrieveAbbreviations","text","words","getWords","normalizeSingle","abbreviations","forEach","toLocaleUpperCase","uniq","computeProminentWords","stemmer","functionWords","uniqueContentWords","includes","trim","element","computeProminentWordsMemoized","memoize","join","getProminentWords","getWordsCustomHelper","getProminentWordsFromPaperAttributes","attributes","wordsFromAttributes","_default","exports"],"sources":["../../../../src/languageProcessing/helpers/prominentWords/determineProminentWords.js"],"sourcesContent":["import { memoize, uniq } from \"lodash\";\n\nimport getWords from \"../word/getWords\";\nimport { normalizeSingle } from \"../sanitize/quotes\";\nimport ProminentWord from \"../../values/ProminentWord\";\n\nconst specialCharacters = /[1234567890‘’“”\"'.…?!:;,¿¡«»&*@#±^%$|~=+§`[\\](){}⟨⟩<>/\\\\–\\-\\u2014\\u00d7\\s]/g;\n\n/**\n * Returns only those prominent words that occur more than a certain number of times and do not consist of special characters.\n *\n * @param {ProminentWord[]} prominentWords A list of prominent words.\n * @param {int} [minimalNumberOfOccurrences] A minimal number of occurrences that is needed for a relevant prominentWord, default 2.\n *\n * @returns {ProminentWord[]} Only relevant words.\n */\nfunction filterProminentWords( prominentWords, minimalNumberOfOccurrences = 2 ) {\n\tprominentWords = prominentWords.filter( function( word ) {\n\t\treturn (\n\t\t\tword.getOccurrences() >= minimalNumberOfOccurrences &&\n\t\t\tword.getWord().replace( specialCharacters, \"\" ) !== \"\"\n\t\t);\n\t} );\n\treturn prominentWords;\n}\n\n/**\n * Sorts prominent words based on their number of occurrences and length.\n *\n * @param {ProminentWord[]} prominentWords The prominent words to sort.\n *\n * @returns {void}\n */\nfunction sortProminentWords( prominentWords ) {\n\tprominentWords.sort( function( wordA, wordB ) {\n\t\tconst difference = wordB.getOccurrences() - wordA.getOccurrences();\n\t\t// The word with the highest number of occurrences comes first.\n\t\tif ( difference !== 0 ) {\n\t\t\treturn difference;\n\t\t}\n\n\t\t// In case of a tie on occurrence number, the alphabetically first word comes first.\n\t\treturn wordA.getStem().localeCompare( wordB.getStem() );\n\t} );\n}\n\n/**\n * Collapses prominent words that have the same stem.\n *\n * @param {ProminentWord[]} prominentWords All prominentWords.\n *\n * @returns {ProminentWord[]} The original array with collapsed duplicates.\n */\nfunction collapseProminentWordsOnStem( prominentWords ) {\n\tif ( prominentWords.length === 0 ) {\n\t\treturn [];\n\t}\n\n\t// Sort the input array by stem\n\tprominentWords.sort( function( wordA, wordB ) {\n\t\treturn wordA.getStem().localeCompare( wordB.getStem() );\n\t} );\n\n\tconst collapsedProminentWords = [];\n\tlet previousWord = new ProminentWord(\n\t\tprominentWords[ 0 ].getWord(),\n\t\tprominentWords[ 0 ].getStem(),\n\t\tprominentWords[ 0 ].getOccurrences()\n\t);\n\n\tfor ( let i = 1; i < prominentWords.length; i++ ) {\n\t\tconst currentWord = new ProminentWord(\n\t\t\tprominentWords[ i ].getWord(),\n\t\t\tprominentWords[ i ].getStem(),\n\t\t\tprominentWords[ i ].getOccurrences()\n\t\t);\n\n\t\t/*\n\t\t * Compare the stem of the current word in the loop with the previously available stem.\n\t\t * If they are equal, the word should be collapsed.\n\t\t * When collapsing, the numbers of occurrences get summed.\n\t\t * If the stem happens to equal the real word that occurred in the text, we can be sure it's ok to display it\n\t\t * to the customer. So, the stem reassigns the word.\n\t\t */\n\t\tif ( currentWord.getStem() ===  previousWord.getStem() ) {\n\t\t\tpreviousWord.setOccurrences( previousWord.getOccurrences() + currentWord.getOccurrences() );\n\n\t\t\tif ( currentWord.getWord() === previousWord.getStem() || currentWord.getWord().toLocaleLowerCase() === previousWord.getStem() ) {\n\t\t\t\tpreviousWord.setWord( currentWord.getWord() );\n\t\t\t}\n\t\t} else {\n\t\t\tcollapsedProminentWords.push( previousWord );\n\t\t\tpreviousWord = currentWord;\n\t\t}\n\t}\n\n\tcollapsedProminentWords.push( previousWord );\n\n\treturn collapsedProminentWords;\n}\n\n/**\n * Retrieves a list of all abbreviations from the text. Returns an empty array if the input text is empty.\n *\n * @param {string} text A text.\n *\n * @returns {string[]} A list of abbreviations from the list.\n */\nfunction retrieveAbbreviations( text ) {\n\tconst words = getWords( normalizeSingle( text ) );\n\tconst abbreviations = [];\n\n\twords.forEach( function( word ) {\n\t\tif ( word.length > 1 && word.length < 5 && word === word.toLocaleUpperCase() ) {\n\t\t\tabbreviations.push( word.toLocaleLowerCase() );\n\t\t}\n\t} );\n\n\treturn uniq( abbreviations );\n}\n\n/**\n * Computes prominent words from an array of words. In order to do so, checks whether the word is included in the list of\n * function words and determines the number of occurrences for every word. Then checks if any two words have the same stem\n * and if so collapses over them.\n *\n * @param {string[]} words          The words to determine relevance for.\n * @param {string[]} abbreviations  Abbreviations that should not be stemmed.\n * @param {Function} stemmer        The available stemmer.\n * @param {Array} functionWords     The available function words list.\n *\n * @returns {ProminentWord[]} All prominent words sorted and filtered for this text.\n */\nfunction computeProminentWords( words, abbreviations, stemmer, functionWords ) {\n\tif ( words.length === 0 ) {\n\t\treturn [];\n\t}\n\n\tconst uniqueContentWords = uniq( words.filter( word => ! functionWords.includes( word.trim() ) ) );\n\tconst prominentWords = [];\n\n\tuniqueContentWords.forEach( function( word ) {\n\t\tif ( abbreviations.includes( word ) ) {\n\t\t\tprominentWords.push( new ProminentWord(\n\t\t\t\tword.toLocaleUpperCase(),\n\t\t\t\tword,\n\t\t\t\twords.filter( element => element === word ).length\n\t\t\t) );\n\t\t} else {\n\t\t\tprominentWords.push( new ProminentWord(\n\t\t\t\tword,\n\t\t\t\tstemmer( word ),\n\t\t\t\twords.filter( element => element === word ).length\n\t\t\t) );\n\t\t}\n\t} );\n\n\treturn collapseProminentWordsOnStem( prominentWords );\n}\n\n/**\n * Caches prominent words depending on text words.\n * Only the words and abbreviations are used as the cache key as the stemmer and function words\n * are config and shouldn't change in the scope of one request.\n *\n * @param {string[]} words          The words to determine relevance for.\n * @param {string[]} abbreviations  Abbreviations that should not be stemmed.\n * @param {Function} stemmer        The available stemmer.\n * @param {Array} functionWords     The available function words list.\n *\n * @returns {function} The function that collects prominent words for a given set of text words, language and morphologyData.\n */\nconst computeProminentWordsMemoized = memoize( ( words, abbreviations, stemmer, functionWords ) => {\n\treturn computeProminentWords( words, abbreviations, stemmer, functionWords );\n}, ( words, abbreviations ) => {\n\treturn words.join( \",\" ) + \",\" + abbreviations.join( \",\" );\n} );\n\n\n/**\n * Gets prominent words from the paper text.\n *\n * @param {string} text             The text to retrieve the prominent words from.\n * @param {string[]} abbreviations  The abbreviations that occur in the text and attributes of the paper.\n * @param {Function} stemmer        The available stemmer.\n * @param {Array} functionWords     The available function words list.\n * @param {function} getWordsCustomHelper   The custom helper to get words.\n *\n * @returns {ProminentWord[]} All prominent words sorted and filtered for this text.\n */\nfunction getProminentWords( text, abbreviations, stemmer, functionWords, getWordsCustomHelper ) {\n\tif ( text === \"\" ) {\n\t\treturn [];\n\t}\n\n\tconst words = getWordsCustomHelper\n\t\t? getWordsCustomHelper( normalizeSingle( text ).toLocaleLowerCase() )\n\t\t: getWords( normalizeSingle( text ).toLocaleLowerCase() );\n\n\treturn computeProminentWordsMemoized( words, abbreviations, stemmer, functionWords );\n}\n\n/**\n * Gets prominent words from keyphrase and synonyms, metadescription, title, and subheadings.\n *\n * @param {string[]} attributes     The array with attributes to process.\n * @param {string[]} abbreviations  The abbreviations that occur in the text and attributes of the paper.\n * @param {Function} stemmer        The available stemmer.\n * @param {Array} functionWords     The available function words list.\n * @param {function} getWordsCustomHelper   The custom helper to get words.\n *\n * @returns {ProminentWord[]} Prominent words from the paper attributes.\n */\nfunction getProminentWordsFromPaperAttributes( attributes, abbreviations, stemmer, functionWords, getWordsCustomHelper ) {\n\tconst wordsFromAttributes = getWordsCustomHelper\n\t\t? getWordsCustomHelper( attributes.join( \" \" ).toLocaleLowerCase() )\n\t\t: getWords( attributes.join( \" \" ).toLocaleLowerCase() );\n\n\treturn computeProminentWords( wordsFromAttributes, abbreviations, stemmer, functionWords );\n}\n\nexport {\n\tgetProminentWords,\n\tgetProminentWordsFromPaperAttributes,\n\tfilterProminentWords,\n\tsortProminentWords,\n\tcollapseProminentWordsOnStem,\n\tretrieveAbbreviations,\n};\n\nexport default {\n\tgetProminentWords,\n\tgetProminentWordsFromPaperAttributes,\n\tfilterProminentWords,\n\tsortProminentWords,\n\tcollapseProminentWordsOnStem,\n\tretrieveAbbreviations,\n};\n"],"mappings":";;;;;;;;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AAEA,IAAAC,SAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,OAAA,GAAAH,OAAA;AACA,IAAAI,cAAA,GAAAF,sBAAA,CAAAF,OAAA;AAAuD,SAAAE,uBAAAG,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAEvD,MAAMG,iBAAiB,GAAG,6EAA6E;;AAEvG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,oBAAoBA,CAAEC,cAAc,EAAEC,0BAA0B,GAAG,CAAC,EAAG;EAC/ED,cAAc,GAAGA,cAAc,CAACE,MAAM,CAAE,UAAUC,IAAI,EAAG;IACxD,OACCA,IAAI,CAACC,cAAc,CAAC,CAAC,IAAIH,0BAA0B,IACnDE,IAAI,CAACE,OAAO,CAAC,CAAC,CAACC,OAAO,CAAER,iBAAiB,EAAE,EAAG,CAAC,KAAK,EAAE;EAExD,CAAE,CAAC;EACH,OAAOE,cAAc;AACtB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASO,kBAAkBA,CAAEP,cAAc,EAAG;EAC7CA,cAAc,CAACQ,IAAI,CAAE,UAAUC,KAAK,EAAEC,KAAK,EAAG;IAC7C,MAAMC,UAAU,GAAGD,KAAK,CAACN,cAAc,CAAC,CAAC,GAAGK,KAAK,CAACL,cAAc,CAAC,CAAC;IAClE;IACA,IAAKO,UAAU,KAAK,CAAC,EAAG;MACvB,OAAOA,UAAU;IAClB;;IAEA;IACA,OAAOF,KAAK,CAACG,OAAO,CAAC,CAAC,CAACC,aAAa,CAAEH,KAAK,CAACE,OAAO,CAAC,CAAE,CAAC;EACxD,CAAE,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASE,4BAA4BA,CAAEd,cAAc,EAAG;EACvD,IAAKA,cAAc,CAACe,MAAM,KAAK,CAAC,EAAG;IAClC,OAAO,EAAE;EACV;;EAEA;EACAf,cAAc,CAACQ,IAAI,CAAE,UAAUC,KAAK,EAAEC,KAAK,EAAG;IAC7C,OAAOD,KAAK,CAACG,OAAO,CAAC,CAAC,CAACC,aAAa,CAAEH,KAAK,CAACE,OAAO,CAAC,CAAE,CAAC;EACxD,CAAE,CAAC;EAEH,MAAMI,uBAAuB,GAAG,EAAE;EAClC,IAAIC,YAAY,GAAG,IAAIC,sBAAa,CACnClB,cAAc,CAAE,CAAC,CAAE,CAACK,OAAO,CAAC,CAAC,EAC7BL,cAAc,CAAE,CAAC,CAAE,CAACY,OAAO,CAAC,CAAC,EAC7BZ,cAAc,CAAE,CAAC,CAAE,CAACI,cAAc,CAAC,CACpC,CAAC;EAED,KAAM,IAAIe,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGnB,cAAc,CAACe,MAAM,EAAEI,CAAC,EAAE,EAAG;IACjD,MAAMC,WAAW,GAAG,IAAIF,sBAAa,CACpClB,cAAc,CAAEmB,CAAC,CAAE,CAACd,OAAO,CAAC,CAAC,EAC7BL,cAAc,CAAEmB,CAAC,CAAE,CAACP,OAAO,CAAC,CAAC,EAC7BZ,cAAc,CAAEmB,CAAC,CAAE,CAACf,cAAc,CAAC,CACpC,CAAC;;IAED;AACF;AACA;AACA;AACA;AACA;AACA;IACE,IAAKgB,WAAW,CAACR,OAAO,CAAC,CAAC,KAAMK,YAAY,CAACL,OAAO,CAAC,CAAC,EAAG;MACxDK,YAAY,CAACI,cAAc,CAAEJ,YAAY,CAACb,cAAc,CAAC,CAAC,GAAGgB,WAAW,CAAChB,cAAc,CAAC,CAAE,CAAC;MAE3F,IAAKgB,WAAW,CAACf,OAAO,CAAC,CAAC,KAAKY,YAAY,CAACL,OAAO,CAAC,CAAC,IAAIQ,WAAW,CAACf,OAAO,CAAC,CAAC,CAACiB,iBAAiB,CAAC,CAAC,KAAKL,YAAY,CAACL,OAAO,CAAC,CAAC,EAAG;QAC/HK,YAAY,CAACM,OAAO,CAAEH,WAAW,CAACf,OAAO,CAAC,CAAE,CAAC;MAC9C;IACD,CAAC,MAAM;MACNW,uBAAuB,CAACQ,IAAI,CAAEP,YAAa,CAAC;MAC5CA,YAAY,GAAGG,WAAW;IAC3B;EACD;EAEAJ,uBAAuB,CAACQ,IAAI,CAAEP,YAAa,CAAC;EAE5C,OAAOD,uBAAuB;AAC/B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASS,qBAAqBA,CAAEC,IAAI,EAAG;EACtC,MAAMC,KAAK,GAAG,IAAAC,iBAAQ,EAAE,IAAAC,uBAAe,EAAEH,IAAK,CAAE,CAAC;EACjD,MAAMI,aAAa,GAAG,EAAE;EAExBH,KAAK,CAACI,OAAO,CAAE,UAAU5B,IAAI,EAAG;IAC/B,IAAKA,IAAI,CAACY,MAAM,GAAG,CAAC,IAAIZ,IAAI,CAACY,MAAM,GAAG,CAAC,IAAIZ,IAAI,KAAKA,IAAI,CAAC6B,iBAAiB,CAAC,CAAC,EAAG;MAC9EF,aAAa,CAACN,IAAI,CAAErB,IAAI,CAACmB,iBAAiB,CAAC,CAAE,CAAC;IAC/C;EACD,CAAE,CAAC;EAEH,OAAO,IAAAW,YAAI,EAAEH,aAAc,CAAC;AAC7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASI,qBAAqBA,CAAEP,KAAK,EAAEG,aAAa,EAAEK,OAAO,EAAEC,aAAa,EAAG;EAC9E,IAAKT,KAAK,CAACZ,MAAM,KAAK,CAAC,EAAG;IACzB,OAAO,EAAE;EACV;EAEA,MAAMsB,kBAAkB,GAAG,IAAAJ,YAAI,EAAEN,KAAK,CAACzB,MAAM,CAAEC,IAAI,IAAI,CAAEiC,aAAa,CAACE,QAAQ,CAAEnC,IAAI,CAACoC,IAAI,CAAC,CAAE,CAAE,CAAE,CAAC;EAClG,MAAMvC,cAAc,GAAG,EAAE;EAEzBqC,kBAAkB,CAACN,OAAO,CAAE,UAAU5B,IAAI,EAAG;IAC5C,IAAK2B,aAAa,CAACQ,QAAQ,CAAEnC,IAAK,CAAC,EAAG;MACrCH,cAAc,CAACwB,IAAI,CAAE,IAAIN,sBAAa,CACrCf,IAAI,CAAC6B,iBAAiB,CAAC,CAAC,EACxB7B,IAAI,EACJwB,KAAK,CAACzB,MAAM,CAAEsC,OAAO,IAAIA,OAAO,KAAKrC,IAAK,CAAC,CAACY,MAC7C,CAAE,CAAC;IACJ,CAAC,MAAM;MACNf,cAAc,CAACwB,IAAI,CAAE,IAAIN,sBAAa,CACrCf,IAAI,EACJgC,OAAO,CAAEhC,IAAK,CAAC,EACfwB,KAAK,CAACzB,MAAM,CAAEsC,OAAO,IAAIA,OAAO,KAAKrC,IAAK,CAAC,CAACY,MAC7C,CAAE,CAAC;IACJ;EACD,CAAE,CAAC;EAEH,OAAOD,4BAA4B,CAAEd,cAAe,CAAC;AACtD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMyC,6BAA6B,GAAG,IAAAC,eAAO,EAAE,CAAEf,KAAK,EAAEG,aAAa,EAAEK,OAAO,EAAEC,aAAa,KAAM;EAClG,OAAOF,qBAAqB,CAAEP,KAAK,EAAEG,aAAa,EAAEK,OAAO,EAAEC,aAAc,CAAC;AAC7E,CAAC,EAAE,CAAET,KAAK,EAAEG,aAAa,KAAM;EAC9B,OAAOH,KAAK,CAACgB,IAAI,CAAE,GAAI,CAAC,GAAG,GAAG,GAAGb,aAAa,CAACa,IAAI,CAAE,GAAI,CAAC;AAC3D,CAAE,CAAC;;AAGH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,iBAAiBA,CAAElB,IAAI,EAAEI,aAAa,EAAEK,OAAO,EAAEC,aAAa,EAAES,oBAAoB,EAAG;EAC/F,IAAKnB,IAAI,KAAK,EAAE,EAAG;IAClB,OAAO,EAAE;EACV;EAEA,MAAMC,KAAK,GAAGkB,oBAAoB,GAC/BA,oBAAoB,CAAE,IAAAhB,uBAAe,EAAEH,IAAK,CAAC,CAACJ,iBAAiB,CAAC,CAAE,CAAC,GACnE,IAAAM,iBAAQ,EAAE,IAAAC,uBAAe,EAAEH,IAAK,CAAC,CAACJ,iBAAiB,CAAC,CAAE,CAAC;EAE1D,OAAOmB,6BAA6B,CAAEd,KAAK,EAAEG,aAAa,EAAEK,OAAO,EAAEC,aAAc,CAAC;AACrF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASU,oCAAoCA,CAAEC,UAAU,EAAEjB,aAAa,EAAEK,OAAO,EAAEC,aAAa,EAAES,oBAAoB,EAAG;EACxH,MAAMG,mBAAmB,GAAGH,oBAAoB,GAC7CA,oBAAoB,CAAEE,UAAU,CAACJ,IAAI,CAAE,GAAI,CAAC,CAACrB,iBAAiB,CAAC,CAAE,CAAC,GAClE,IAAAM,iBAAQ,EAAEmB,UAAU,CAACJ,IAAI,CAAE,GAAI,CAAC,CAACrB,iBAAiB,CAAC,CAAE,CAAC;EAEzD,OAAOY,qBAAqB,CAAEc,mBAAmB,EAAElB,aAAa,EAAEK,OAAO,EAAEC,aAAc,CAAC;AAC3F;AAAC,IAAAa,QAAA,GAAAC,OAAA,CAAArD,OAAA,GAWc;EACd+C,iBAAiB;EACjBE,oCAAoC;EACpC/C,oBAAoB;EACpBQ,kBAAkB;EAClBO,4BAA4B;EAC5BW;AACD,CAAC","ignoreList":[]}