axyseo 2.0.0-alpha.1

package/build/languageProcessing/languages/pt/helpers/internal/getParticiples.js

@@ -0,0 +1,43 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = getParticiples;
+var _index = require("../../../index");
+var _passiveVoiceParticiples = _interopRequireDefault(require("../../config/internal/passiveVoiceParticiples"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+const {
+  getWords
+} = _index.languageProcessing;
+/**
+ * Checks if a Portuguese word is a participle.
+ * @param {string} word A Portuguese word.
+ * @returns {boolean} Returns true if word is a Portuguese participle, and false otherwise.
+ */
+function isParticiple(word) {
+  const participleSuffixes = ['a', 'o', 'as', 'os'];
+  // For each participle suffixes, check if the word ends in one of them.
+  return participleSuffixes.some(suffix => {
+    // Make sure only possible participles are targeted (minimum length being "> 3")
+    if (word.length > 3 && word.endsWith(suffix)) {
+      // If the word ends with one of the suffixes, retrieve the stem.
+      const stem = word.slice(0, -suffix.length);
+      // Check if the stem is in the list of participle stems: return true if it is, otherwise return false.
+      return _passiveVoiceParticiples.default.includes(stem);
+    }
+  });
+}
+
+/**
+ * Creates an array of participles for the participles found in a clause.
+ *
+ * @param {string} clauseText The clause to find participles in.
+ *
+ * @returns {Array} The list with participles.
+ */
+function getParticiples(clauseText) {
+  const words = getWords(clauseText);
+  return words.filter(word => isParticiple(word));
+}
+//# sourceMappingURL=getParticiples.js.map

package/build/languageProcessing/languages/pt/helpers/internal/getParticiples.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"getParticiples.js","names":["_index","require","_passiveVoiceParticiples","_interopRequireDefault","e","__esModule","default","getWords","languageProcessing","isParticiple","word","participleSuffixes","some","suffix","length","endsWith","stem","slice","participleStems","includes","getParticiples","clauseText","words","filter"],"sources":["../../../../../../src/languageProcessing/languages/pt/helpers/internal/getParticiples.js"],"sourcesContent":["import {languageProcessing} from '../../../index';\nconst {getWords} = languageProcessing;\n\nimport participleStems from '../../config/internal/passiveVoiceParticiples';\n\n/**\n * Checks if a Portuguese word is a participle.\n * @param {string} word A Portuguese word.\n * @returns {boolean} Returns true if word is a Portuguese participle, and false otherwise.\n */\nfunction isParticiple(word) {\n  const participleSuffixes = ['a', 'o', 'as', 'os'];\n  // For each participle suffixes, check if the word ends in one of them.\n  return participleSuffixes.some(suffix => {\n    // Make sure only possible participles are targeted (minimum length being \"> 3\")\n    if (word.length > 3 && word.endsWith(suffix)) {\n      // If the word ends with one of the suffixes, retrieve the stem.\n      const stem = word.slice(0, -suffix.length);\n      // Check if the stem is in the list of participle stems: return true if it is, otherwise return false.\n      return participleStems.includes(stem);\n    }\n  });\n}\n\n/**\n * Creates an array of participles for the participles found in a clause.\n *\n * @param {string} clauseText The clause to find participles in.\n *\n * @returns {Array} The list with participles.\n */\nexport default function getParticiples(clauseText) {\n  const words = getWords(clauseText);\n  return words.filter(word => isParticiple(word));\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAGA,IAAAC,wBAAA,GAAAC,sBAAA,CAAAF,OAAA;AAA4E,SAAAE,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAF5E,MAAM;EAACG;AAAQ,CAAC,GAAGC,yBAAkB;AAIrC;AACA;AACA;AACA;AACA;AACA,SAASC,YAAYA,CAACC,IAAI,EAAE;EAC1B,MAAMC,kBAAkB,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC;EACjD;EACA,OAAOA,kBAAkB,CAACC,IAAI,CAACC,MAAM,IAAI;IACvC;IACA,IAAIH,IAAI,CAACI,MAAM,GAAG,CAAC,IAAIJ,IAAI,CAACK,QAAQ,CAACF,MAAM,CAAC,EAAE;MAC5C;MACA,MAAMG,IAAI,GAAGN,IAAI,CAACO,KAAK,CAAC,CAAC,EAAE,CAACJ,MAAM,CAACC,MAAM,CAAC;MAC1C;MACA,OAAOI,gCAAe,CAACC,QAAQ,CAACH,IAAI,CAAC;IACvC;EACF,CAAC,CAAC;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASI,cAAcA,CAACC,UAAU,EAAE;EACjD,MAAMC,KAAK,GAAGf,QAAQ,CAACc,UAAU,CAAC;EAClC,OAAOC,KAAK,CAACC,MAAM,CAACb,IAAI,IAAID,YAAY,CAACC,IAAI,CAAC,CAAC;AACjD","ignoreList":[]}

package/build/languageProcessing/languages/pt/helpers/internal/stem.js

@@ -0,0 +1,283 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = stem;
+var _index = require("../../../index");
+/* eslint-disable max-statements, complexity */
+
+/*
+Copyright (c) 2015, Luís Rodrigues
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+*/
+
+const {
+  findMatchingEndingInArray
+} = _index.languageProcessing;
+
+/**
+ * Checks whether the character is a vowel.
+ *
+ * @param {string}	    character	The character to check.
+ * @param {string[]}    vowels      The Portuguese vowels.
+ *
+ * @returns {boolean}	Whether the character is a vowel.
+ */
+const isVowel = function (character, vowels) {
+  return vowels.includes(character);
+};
+
+/**
+ * Finds the first vowel in a string after the specified index and returns the index of the character following that vowel
+ * (if found).
+ *
+ * @param {string}	    word	    The word to check.
+ * @param {string[]}    vowels      The Portuguese vowels.
+ * @param {number}	    start       The index at which the search for a vowel should begin.
+ *
+ * @returns {number} The index of the character following the found vowel. If this is not found, the length of the word.
+ */
+const nextVowelPosition = function (word, vowels, start) {
+  const length = word.length;
+  for (let position = start; position < length; position++) {
+    if (isVowel(word[position], vowels)) {
+      return position;
+    }
+  }
+  return length;
+};
+
+/**
+ * Finds the first consonant in a string after the specified index and returns the index of the character following that
+ * consonant (if found).
+ *
+ * @param {string}	    word	The word to check.
+ * @param {string[]}    vowels  The Portuguese vowels.
+ * @param {number}	    start	The index at which the search for a consonant should begin.
+ *
+ * @returns {number} The index of the character following the found consonant. If this is not found, the length of the word.
+ */
+const nextConsonantPosition = function (word, vowels, start) {
+  const length = word.length;
+  for (let position = start; position < length; position++) {
+    if (!isVowel(word[position], vowels)) {
+      return position;
+    }
+  }
+  return length;
+};
+
+/**
+ * Replaces characters with other characters if found in a word.
+ *
+ * @param {string}		word				The word to check.
+ * @param {string[]}	charactersToReplace	The characters to replace.
+ * @param {string[]}	replacements		The replacement characters.
+ *
+ * @returns {string}	The word with the replacement characters, or the original word if no characters to replace were found.
+ */
+const replaceCharacters = function (word, charactersToReplace, replacements) {
+  for (let i = 0; i < charactersToReplace.length; i++) {
+    word = word.replace(charactersToReplace[i], replacements[i]);
+  }
+  return word;
+};
+
+/**
+ * Looks for the longest suffix in each group and removes it if it is found within the specified region (R1, R2 or RV).
+ * Once a suffix is found and removed, stops searching further.
+ *
+ * For some of the suffix groups, replaces the suffix with another string after removing it (e.g. -logia is replaced with
+ * -log).
+ *
+ * @param {string}	word	            The word to check.
+ * @param {Object}  standardSuffixData  The data for stemming standard suffixes.
+ * @param {string}	r1Text	            The text in the R1 region.
+ * @param {string}	r2Text	            The text in the R2 region.
+ * @param {string}	rvText	            The text in the RV region.
+ *
+ * @returns {string} The stemmed word or the original word if no suffix was removed.
+ */
+const stemStandardSuffixes = function (word, standardSuffixData, r1Text, r2Text, rvText) {
+  const regions = {
+    r1: r1Text,
+    r2: r2Text,
+    rv: rvText
+  };
+  for (const suffixGroup of standardSuffixData.standardGroups) {
+    const foundSuffix = findMatchingEndingInArray(regions[suffixGroup.region], suffixGroup.suffixes);
+    if (foundSuffix) {
+      return word.slice(0, -foundSuffix.length) + suffixGroup.replacement;
+    }
+  }
+  const specialEnding = findMatchingEndingInArray(regions[standardSuffixData.specialClass.region], standardSuffixData.specialClass.suffixes);
+  if (findMatchingEndingInArray(word, standardSuffixData.specialClass.wordEndingsToCheck) && specialEnding) {
+    word = word.slice(0, -specialEnding.length) + standardSuffixData.specialClass.replacement;
+  }
+  return word;
+};
+
+/**
+ * Stems verb suffixes.
+ *
+ * @param {string}      word            The original word.
+ * @param {string[]}    verbSuffixes    The verb suffixes to check.
+ * @param {string}      rvText          The text of the RV.
+ *
+ * @returns {string} The word with the verb suffixes removed (if applicable).
+ */
+const stemVerbSuffixes = function (word, verbSuffixes, rvText) {
+  const verbSuffix = findMatchingEndingInArray(rvText, verbSuffixes);
+  if (verbSuffix !== '') {
+    word = word.slice(0, -verbSuffix.length);
+  }
+  return word;
+};
+
+/**
+ * Stems residual suffixes.
+ *
+ * @param {string}	word	            The word to check.
+ * @param {Object}  residualSuffixData  The data used to stem residual suffixes.
+ * @param {string}	rvText	            The text in the RV region.
+ *
+ * @returns {string} The word with a removed suffix, or the original input word if no suffix was removed.
+ */
+const stemResidualSuffixes = function (word, residualSuffixData, rvText) {
+  const foundSuffixUe = findMatchingEndingInArray(rvText, residualSuffixData.groupUe.suffixes);
+  const foundSuffixIe = findMatchingEndingInArray(rvText, residualSuffixData.groupIe.suffixes);
+  const foundSuffixE = findMatchingEndingInArray(rvText, residualSuffixData.groupESuffixes);
+  if (foundSuffixUe && findMatchingEndingInArray(word, residualSuffixData.groupUe.wordEndingsToCheck)) {
+    word = word.slice(0, -foundSuffixUe.length);
+  } else if (foundSuffixIe && findMatchingEndingInArray(word, residualSuffixData.groupIe.wordEndingsToCheck)) {
+    word = word.slice(0, -foundSuffixIe.length);
+  } else if (foundSuffixE) {
+    word = word.slice(0, -foundSuffixE.length);
+  } else if (word.endsWith(residualSuffixData.cCedilla[0])) {
+    word = word.slice(0, -1) + residualSuffixData.cCedilla[1];
+  }
+  return word;
+};
+
+/**
+ * Stems Portuguese words.
+ *
+ * @param {string} word             The word to stem.
+ * @param {Object} morphologyData   The Portuguese morphology data.
+ *
+ * @returns {string} The stemmed word.
+ */
+function stem(word, morphologyData) {
+  word.toLowerCase();
+  const vowels = morphologyData.externalStemmer.vowels;
+
+  // Nasal vowels should be treated as a vowel followed by a consonant.
+  const nasalVowels = morphologyData.externalStemmer.nasalVowels.originals;
+  const nasalVowelsReplacement = morphologyData.externalStemmer.nasalVowels.replacements;
+  word = replaceCharacters(word, nasalVowels, nasalVowelsReplacement);
+  const length = word.length;
+  if (length < 2) {
+    return word;
+  }
+  let r1 = length;
+  let r2 = length;
+  let rv = length;
+
+  /*
+   * R1 is the region after the first non-vowel following a vowel, or is the null region at the end of the word if
+   * there is no such non-vowel.
+   */
+  for (let i = 0; i < length - 1 && r1 === length; i++) {
+    if (isVowel(word[i], vowels) && !isVowel(word[i + 1], vowels)) {
+      r1 = i + 2;
+    }
+  }
+
+  /*
+   * R2 is the region after the first non-vowel following a vowel in R1, or is the null region at the end of the
+   * word if there is no such non-vowel.
+   */
+  for (let i = r1; i < length - 1 && r2 === length; i++) {
+    if (isVowel(word[i], vowels) && !isVowel(word[i + 1], vowels)) {
+      r2 = i + 2;
+    }
+  }
+
+  /*
+   * If the second letter is a consonant, RV is the region after the next following vowel. If the first two letters are
+   * vowels, RV is the region after the next consonant, and otherwise (consonant-vowel case) RV is the region after the
+   * third letter. But RV is the end of the word if these positions cannot be found.
+   */
+  if (length > 3) {
+    if (!isVowel(word[1], vowels)) {
+      rv = nextVowelPosition(word, vowels, 2) + 1;
+    } else if (isVowel(word[0], vowels) && isVowel(word[1], vowels)) {
+      rv = nextConsonantPosition(word, vowels, 2) + 1;
+    } else {
+      rv = 3;
+    }
+  }
+  const r1Text = word.slice(r1);
+  const r2Text = word.slice(r2);
+  let rvText = word.slice(rv);
+
+  // Go through the first step of removing suffixes.
+  const wordAfterStep1 = stemStandardSuffixes(word, morphologyData.externalStemmer.standardSuffixes, r1Text, r2Text, rvText);
+
+  // If no suffixes were removed in the first step, search for and remove verb suffixes.
+  let wordAfterStep2 = '';
+  if (word === wordAfterStep1) {
+    wordAfterStep2 = stemVerbSuffixes(word, morphologyData.externalStemmer.verbSuffixes, rvText);
+  }
+
+  // If suffixes were removed in one of the previous steps, replace the word with the de-suffixed word and adjust RV text.
+  if (word !== wordAfterStep1) {
+    word = wordAfterStep1;
+    rvText = word.slice(rv);
+  } else if (word !== wordAfterStep2) {
+    word = wordAfterStep2;
+    rvText = word.slice(rv);
+  }
+
+  /*
+   * If a suffix was removed in one of the two previous steps, remove -i if preceded by -c and in RV. If no suffix was
+   * removed in one of the previous steps, remove -os, -a, -i, -o, -á, í, or ó if in RV.
+   */
+  if (wordAfterStep1 !== word || wordAfterStep2 !== word) {
+    if (word.endsWith(morphologyData.externalStemmer.ciToC[0]) && rvText.endsWith(morphologyData.externalStemmer.ciToC[1])) {
+      word = word.slice(0, -1);
+      rvText = word.slice(rv);
+    }
+  } else {
+    const foundGeneralSuffix = findMatchingEndingInArray(rvText, morphologyData.externalStemmer.generalSuffixes);
+    if (foundGeneralSuffix !== '') {
+      word = word.slice(0, -foundGeneralSuffix.length);
+      rvText = word.slice(rv);
+    }
+  }
+
+  // Stem residual suffixes, regardless of whether a suffix was removed in any of the previous steps or not.
+  word = stemResidualSuffixes(word, morphologyData.externalStemmer.residualSuffixes, rvText);
+
+  // Change the nasal vowel replacements back into the nasal vowels.
+  word = replaceCharacters(word, nasalVowelsReplacement, nasalVowels);
+  return word;
+}
+//# sourceMappingURL=stem.js.map

package/build/languageProcessing/languages/pt/helpers/internal/stem.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stem.js","names":["_index","require","findMatchingEndingInArray","languageProcessing","isVowel","character","vowels","includes","nextVowelPosition","word","start","length","position","nextConsonantPosition","replaceCharacters","charactersToReplace","replacements","i","replace","stemStandardSuffixes","standardSuffixData","r1Text","r2Text","rvText","regions","r1","r2","rv","suffixGroup","standardGroups","foundSuffix","region","suffixes","slice","replacement","specialEnding","specialClass","wordEndingsToCheck","stemVerbSuffixes","verbSuffixes","verbSuffix","stemResidualSuffixes","residualSuffixData","foundSuffixUe","groupUe","foundSuffixIe","groupIe","foundSuffixE","groupESuffixes","endsWith","cCedilla","stem","morphologyData","toLowerCase","externalStemmer","nasalVowels","originals","nasalVowelsReplacement","wordAfterStep1","standardSuffixes","wordAfterStep2","ciToC","foundGeneralSuffix","generalSuffixes","residualSuffixes"],"sources":["../../../../../../src/languageProcessing/languages/pt/helpers/internal/stem.js"],"sourcesContent":["/* eslint-disable max-statements, complexity */\n\n/*\nCopyright (c) 2015, Luís Rodrigues\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nimport {languageProcessing} from '../../../index';\nconst {findMatchingEndingInArray} = languageProcessing;\n\n/**\n * Checks whether the character is a vowel.\n *\n * @param {string}\t    character\tThe character to check.\n * @param {string[]}    vowels      The Portuguese vowels.\n *\n * @returns {boolean}\tWhether the character is a vowel.\n */\nconst isVowel = function(character, vowels) {\n  return vowels.includes(character);\n};\n\n/**\n * Finds the first vowel in a string after the specified index and returns the index of the character following that vowel\n * (if found).\n *\n * @param {string}\t    word\t    The word to check.\n * @param {string[]}    vowels      The Portuguese vowels.\n * @param {number}\t    start       The index at which the search for a vowel should begin.\n *\n * @returns {number} The index of the character following the found vowel. If this is not found, the length of the word.\n */\nconst nextVowelPosition = function(word, vowels, start) {\n  const length = word.length;\n\n  for (let position = start; position < length; position++) {\n    if (isVowel(word[position], vowels)) {\n      return position;\n    }\n  }\n\n  return length;\n};\n\n/**\n * Finds the first consonant in a string after the specified index and returns the index of the character following that\n * consonant (if found).\n *\n * @param {string}\t    word\tThe word to check.\n * @param {string[]}    vowels  The Portuguese vowels.\n * @param {number}\t    start\tThe index at which the search for a consonant should begin.\n *\n * @returns {number} The index of the character following the found consonant. If this is not found, the length of the word.\n */\nconst nextConsonantPosition = function(word, vowels, start) {\n  const length = word.length;\n\n  for (let position = start; position < length; position++) {\n    if (!isVowel(word[position], vowels)) {\n      return position;\n    }\n  }\n\n  return length;\n};\n\n/**\n * Replaces characters with other characters if found in a word.\n *\n * @param {string}\t\tword\t\t\t\tThe word to check.\n * @param {string[]}\tcharactersToReplace\tThe characters to replace.\n * @param {string[]}\treplacements\t\tThe replacement characters.\n *\n * @returns {string}\tThe word with the replacement characters, or the original word if no characters to replace were found.\n */\nconst replaceCharacters = function(word, charactersToReplace, replacements) {\n  for (let i = 0; i < charactersToReplace.length; i++) {\n    word = word.replace(charactersToReplace[i], replacements[i]);\n  }\n\n  return word;\n};\n\n/**\n * Looks for the longest suffix in each group and removes it if it is found within the specified region (R1, R2 or RV).\n * Once a suffix is found and removed, stops searching further.\n *\n * For some of the suffix groups, replaces the suffix with another string after removing it (e.g. -logia is replaced with\n * -log).\n *\n * @param {string}\tword\t            The word to check.\n * @param {Object}  standardSuffixData  The data for stemming standard suffixes.\n * @param {string}\tr1Text\t            The text in the R1 region.\n * @param {string}\tr2Text\t            The text in the R2 region.\n * @param {string}\trvText\t            The text in the RV region.\n *\n * @returns {string} The stemmed word or the original word if no suffix was removed.\n */\nconst stemStandardSuffixes = function(word, standardSuffixData, r1Text, r2Text, rvText) {\n  const regions = {\n    r1: r1Text,\n    r2: r2Text,\n    rv: rvText\n  };\n\n  for (const suffixGroup of standardSuffixData.standardGroups) {\n    const foundSuffix = findMatchingEndingInArray(\n      regions[suffixGroup.region],\n      suffixGroup.suffixes\n    );\n\n    if (foundSuffix) {\n      return word.slice(0, -foundSuffix.length) + suffixGroup.replacement;\n    }\n  }\n\n  const specialEnding = findMatchingEndingInArray(\n    regions[standardSuffixData.specialClass.region],\n    standardSuffixData.specialClass.suffixes\n  );\n  if (\n    findMatchingEndingInArray(word, standardSuffixData.specialClass.wordEndingsToCheck) &&\n    specialEnding\n  ) {\n    word = word.slice(0, -specialEnding.length) + standardSuffixData.specialClass.replacement;\n  }\n\n  return word;\n};\n\n/**\n * Stems verb suffixes.\n *\n * @param {string}      word            The original word.\n * @param {string[]}    verbSuffixes    The verb suffixes to check.\n * @param {string}      rvText          The text of the RV.\n *\n * @returns {string} The word with the verb suffixes removed (if applicable).\n */\nconst stemVerbSuffixes = function(word, verbSuffixes, rvText) {\n  const verbSuffix = findMatchingEndingInArray(rvText, verbSuffixes);\n\n  if (verbSuffix !== '') {\n    word = word.slice(0, -verbSuffix.length);\n  }\n\n  return word;\n};\n\n/**\n * Stems residual suffixes.\n *\n * @param {string}\tword\t            The word to check.\n * @param {Object}  residualSuffixData  The data used to stem residual suffixes.\n * @param {string}\trvText\t            The text in the RV region.\n *\n * @returns {string} The word with a removed suffix, or the original input word if no suffix was removed.\n */\nconst stemResidualSuffixes = function(word, residualSuffixData, rvText) {\n  const foundSuffixUe = findMatchingEndingInArray(rvText, residualSuffixData.groupUe.suffixes);\n  const foundSuffixIe = findMatchingEndingInArray(rvText, residualSuffixData.groupIe.suffixes);\n  const foundSuffixE = findMatchingEndingInArray(rvText, residualSuffixData.groupESuffixes);\n\n  if (\n    foundSuffixUe &&\n    findMatchingEndingInArray(word, residualSuffixData.groupUe.wordEndingsToCheck)\n  ) {\n    word = word.slice(0, -foundSuffixUe.length);\n  } else if (\n    foundSuffixIe &&\n    findMatchingEndingInArray(word, residualSuffixData.groupIe.wordEndingsToCheck)\n  ) {\n    word = word.slice(0, -foundSuffixIe.length);\n  } else if (foundSuffixE) {\n    word = word.slice(0, -foundSuffixE.length);\n  } else if (word.endsWith(residualSuffixData.cCedilla[0])) {\n    word = word.slice(0, -1) + residualSuffixData.cCedilla[1];\n  }\n\n  return word;\n};\n\n/**\n * Stems Portuguese words.\n *\n * @param {string} word             The word to stem.\n * @param {Object} morphologyData   The Portuguese morphology data.\n *\n * @returns {string} The stemmed word.\n */\nexport default function stem(word, morphologyData) {\n  word.toLowerCase();\n  const vowels = morphologyData.externalStemmer.vowels;\n\n  // Nasal vowels should be treated as a vowel followed by a consonant.\n  const nasalVowels = morphologyData.externalStemmer.nasalVowels.originals;\n  const nasalVowelsReplacement = morphologyData.externalStemmer.nasalVowels.replacements;\n  word = replaceCharacters(word, nasalVowels, nasalVowelsReplacement);\n\n  const length = word.length;\n  if (length < 2) {\n    return word;\n  }\n\n  let r1 = length;\n  let r2 = length;\n  let rv = length;\n\n  /*\n   * R1 is the region after the first non-vowel following a vowel, or is the null region at the end of the word if\n   * there is no such non-vowel.\n   */\n  for (let i = 0; i < length - 1 && r1 === length; i++) {\n    if (isVowel(word[i], vowels) && !isVowel(word[i + 1], vowels)) {\n      r1 = i + 2;\n    }\n  }\n\n  /*\n   * R2 is the region after the first non-vowel following a vowel in R1, or is the null region at the end of the\n   * word if there is no such non-vowel.\n   */\n  for (let i = r1; i < length - 1 && r2 === length; i++) {\n    if (isVowel(word[i], vowels) && !isVowel(word[i + 1], vowels)) {\n      r2 = i + 2;\n    }\n  }\n\n  /*\n   * If the second letter is a consonant, RV is the region after the next following vowel. If the first two letters are\n   * vowels, RV is the region after the next consonant, and otherwise (consonant-vowel case) RV is the region after the\n   * third letter. But RV is the end of the word if these positions cannot be found.\n   */\n  if (length > 3) {\n    if (!isVowel(word[1], vowels)) {\n      rv = nextVowelPosition(word, vowels, 2) + 1;\n    } else if (isVowel(word[0], vowels) && isVowel(word[1], vowels)) {\n      rv = nextConsonantPosition(word, vowels, 2) + 1;\n    } else {\n      rv = 3;\n    }\n  }\n\n  const r1Text = word.slice(r1);\n  const r2Text = word.slice(r2);\n  let rvText = word.slice(rv);\n\n  // Go through the first step of removing suffixes.\n  const wordAfterStep1 = stemStandardSuffixes(\n    word,\n    morphologyData.externalStemmer.standardSuffixes,\n    r1Text,\n    r2Text,\n    rvText\n  );\n\n  // If no suffixes were removed in the first step, search for and remove verb suffixes.\n  let wordAfterStep2 = '';\n\n  if (word === wordAfterStep1) {\n    wordAfterStep2 = stemVerbSuffixes(word, morphologyData.externalStemmer.verbSuffixes, rvText);\n  }\n\n  // If suffixes were removed in one of the previous steps, replace the word with the de-suffixed word and adjust RV text.\n  if (word !== wordAfterStep1) {\n    word = wordAfterStep1;\n    rvText = word.slice(rv);\n  } else if (word !== wordAfterStep2) {\n    word = wordAfterStep2;\n    rvText = word.slice(rv);\n  }\n\n  /*\n   * If a suffix was removed in one of the two previous steps, remove -i if preceded by -c and in RV. If no suffix was\n   * removed in one of the previous steps, remove -os, -a, -i, -o, -á, í, or ó if in RV.\n   */\n  if (wordAfterStep1 !== word || wordAfterStep2 !== word) {\n    if (\n      word.endsWith(morphologyData.externalStemmer.ciToC[0]) &&\n      rvText.endsWith(morphologyData.externalStemmer.ciToC[1])\n    ) {\n      word = word.slice(0, -1);\n      rvText = word.slice(rv);\n    }\n  } else {\n    const foundGeneralSuffix = findMatchingEndingInArray(\n      rvText,\n      morphologyData.externalStemmer.generalSuffixes\n    );\n    if (foundGeneralSuffix !== '') {\n      word = word.slice(0, -foundGeneralSuffix.length);\n      rvText = word.slice(rv);\n    }\n  }\n\n  // Stem residual suffixes, regardless of whether a suffix was removed in any of the previous steps or not.\n  word = stemResidualSuffixes(word, morphologyData.externalStemmer.residualSuffixes, rvText);\n\n  // Change the nasal vowel replacements back into the nasal vowels.\n  word = replaceCharacters(word, nasalVowelsReplacement, nasalVowels);\n\n  return word;\n}\n"],"mappings":";;;;;;AAuBA,IAAAA,MAAA,GAAAC,OAAA;AAvBA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAGA,MAAM;EAACC;AAAyB,CAAC,GAAGC,yBAAkB;;AAEtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,OAAO,GAAG,SAAAA,CAASC,SAAS,EAAEC,MAAM,EAAE;EAC1C,OAAOA,MAAM,CAACC,QAAQ,CAACF,SAAS,CAAC;AACnC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,iBAAiB,GAAG,SAAAA,CAASC,IAAI,EAAEH,MAAM,EAAEI,KAAK,EAAE;EACtD,MAAMC,MAAM,GAAGF,IAAI,CAACE,MAAM;EAE1B,KAAK,IAAIC,QAAQ,GAAGF,KAAK,EAAEE,QAAQ,GAAGD,MAAM,EAAEC,QAAQ,EAAE,EAAE;IACxD,IAAIR,OAAO,CAACK,IAAI,CAACG,QAAQ,CAAC,EAAEN,MAAM,CAAC,EAAE;MACnC,OAAOM,QAAQ;IACjB;EACF;EAEA,OAAOD,MAAM;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,qBAAqB,GAAG,SAAAA,CAASJ,IAAI,EAAEH,MAAM,EAAEI,KAAK,EAAE;EAC1D,MAAMC,MAAM,GAAGF,IAAI,CAACE,MAAM;EAE1B,KAAK,IAAIC,QAAQ,GAAGF,KAAK,EAAEE,QAAQ,GAAGD,MAAM,EAAEC,QAAQ,EAAE,EAAE;IACxD,IAAI,CAACR,OAAO,CAACK,IAAI,CAACG,QAAQ,CAAC,EAAEN,MAAM,CAAC,EAAE;MACpC,OAAOM,QAAQ;IACjB;EACF;EAEA,OAAOD,MAAM;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,iBAAiB,GAAG,SAAAA,CAASL,IAAI,EAAEM,mBAAmB,EAAEC,YAAY,EAAE;EAC1E,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,mBAAmB,CAACJ,MAAM,EAAEM,CAAC,EAAE,EAAE;IACnDR,IAAI,GAAGA,IAAI,CAACS,OAAO,CAACH,mBAAmB,CAACE,CAAC,CAAC,EAAED,YAAY,CAACC,CAAC,CAAC,CAAC;EAC9D;EAEA,OAAOR,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMU,oBAAoB,GAAG,SAAAA,CAASV,IAAI,EAAEW,kBAAkB,EAAEC,MAAM,EAAEC,MAAM,EAAEC,MAAM,EAAE;EACtF,MAAMC,OAAO,GAAG;IACdC,EAAE,EAAEJ,MAAM;IACVK,EAAE,EAAEJ,MAAM;IACVK,EAAE,EAAEJ;EACN,CAAC;EAED,KAAK,MAAMK,WAAW,IAAIR,kBAAkB,CAACS,cAAc,EAAE;IAC3D,MAAMC,WAAW,GAAG5B,yBAAyB,CAC3CsB,OAAO,CAACI,WAAW,CAACG,MAAM,CAAC,EAC3BH,WAAW,CAACI,QACd,CAAC;IAED,IAAIF,WAAW,EAAE;MACf,OAAOrB,IAAI,CAACwB,KAAK,CAAC,CAAC,EAAE,CAACH,WAAW,CAACnB,MAAM,CAAC,GAAGiB,WAAW,CAACM,WAAW;IACrE;EACF;EAEA,MAAMC,aAAa,GAAGjC,yBAAyB,CAC7CsB,OAAO,CAACJ,kBAAkB,CAACgB,YAAY,CAACL,MAAM,CAAC,EAC/CX,kBAAkB,CAACgB,YAAY,CAACJ,QAClC,CAAC;EACD,IACE9B,yBAAyB,CAACO,IAAI,EAAEW,kBAAkB,CAACgB,YAAY,CAACC,kBAAkB,CAAC,IACnFF,aAAa,EACb;IACA1B,IAAI,GAAGA,IAAI,CAACwB,KAAK,CAAC,CAAC,EAAE,CAACE,aAAa,CAACxB,MAAM,CAAC,GAAGS,kBAAkB,CAACgB,YAAY,CAACF,WAAW;EAC3F;EAEA,OAAOzB,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM6B,gBAAgB,GAAG,SAAAA,CAAS7B,IAAI,EAAE8B,YAAY,EAAEhB,MAAM,EAAE;EAC5D,MAAMiB,UAAU,GAAGtC,yBAAyB,CAACqB,MAAM,EAAEgB,YAAY,CAAC;EAElE,IAAIC,UAAU,KAAK,EAAE,EAAE;IACrB/B,IAAI,GAAGA,IAAI,CAACwB,KAAK,CAAC,CAAC,EAAE,CAACO,UAAU,CAAC7B,MAAM,CAAC;EAC1C;EAEA,OAAOF,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMgC,oBAAoB,GAAG,SAAAA,CAAShC,IAAI,EAAEiC,kBAAkB,EAAEnB,MAAM,EAAE;EACtE,MAAMoB,aAAa,GAAGzC,yBAAyB,CAACqB,MAAM,EAAEmB,kBAAkB,CAACE,OAAO,CAACZ,QAAQ,CAAC;EAC5F,MAAMa,aAAa,GAAG3C,yBAAyB,CAACqB,MAAM,EAAEmB,kBAAkB,CAACI,OAAO,CAACd,QAAQ,CAAC;EAC5F,MAAMe,YAAY,GAAG7C,yBAAyB,CAACqB,MAAM,EAAEmB,kBAAkB,CAACM,cAAc,CAAC;EAEzF,IACEL,aAAa,IACbzC,yBAAyB,CAACO,IAAI,EAAEiC,kBAAkB,CAACE,OAAO,CAACP,kBAAkB,CAAC,EAC9E;IACA5B,IAAI,GAAGA,IAAI,CAACwB,KAAK,CAAC,CAAC,EAAE,CAACU,aAAa,CAAChC,MAAM,CAAC;EAC7C,CAAC,MAAM,IACLkC,aAAa,IACb3C,yBAAyB,CAACO,IAAI,EAAEiC,kBAAkB,CAACI,OAAO,CAACT,kBAAkB,CAAC,EAC9E;IACA5B,IAAI,GAAGA,IAAI,CAACwB,KAAK,CAAC,CAAC,EAAE,CAACY,aAAa,CAAClC,MAAM,CAAC;EAC7C,CAAC,MAAM,IAAIoC,YAAY,EAAE;IACvBtC,IAAI,GAAGA,IAAI,CAACwB,KAAK,CAAC,CAAC,EAAE,CAACc,YAAY,CAACpC,MAAM,CAAC;EAC5C,CAAC,MAAM,IAAIF,IAAI,CAACwC,QAAQ,CAACP,kBAAkB,CAACQ,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;IACxDzC,IAAI,GAAGA,IAAI,CAACwB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAGS,kBAAkB,CAACQ,QAAQ,CAAC,CAAC,CAAC;EAC3D;EAEA,OAAOzC,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAS0C,IAAIA,CAAC1C,IAAI,EAAE2C,cAAc,EAAE;EACjD3C,IAAI,CAAC4C,WAAW,CAAC,CAAC;EAClB,MAAM/C,MAAM,GAAG8C,cAAc,CAACE,eAAe,CAAChD,MAAM;;EAEpD;EACA,MAAMiD,WAAW,GAAGH,cAAc,CAACE,eAAe,CAACC,WAAW,CAACC,SAAS;EACxE,MAAMC,sBAAsB,GAAGL,cAAc,CAACE,eAAe,CAACC,WAAW,CAACvC,YAAY;EACtFP,IAAI,GAAGK,iBAAiB,CAACL,IAAI,EAAE8C,WAAW,EAAEE,sBAAsB,CAAC;EAEnE,MAAM9C,MAAM,GAAGF,IAAI,CAACE,MAAM;EAC1B,IAAIA,MAAM,GAAG,CAAC,EAAE;IACd,OAAOF,IAAI;EACb;EAEA,IAAIgB,EAAE,GAAGd,MAAM;EACf,IAAIe,EAAE,GAAGf,MAAM;EACf,IAAIgB,EAAE,GAAGhB,MAAM;;EAEf;AACF;AACA;AACA;EACE,KAAK,IAAIM,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGN,MAAM,GAAG,CAAC,IAAIc,EAAE,KAAKd,MAAM,EAAEM,CAAC,EAAE,EAAE;IACpD,IAAIb,OAAO,CAACK,IAAI,CAACQ,CAAC,CAAC,EAAEX,MAAM,CAAC,IAAI,CAACF,OAAO,CAACK,IAAI,CAACQ,CAAC,GAAG,CAAC,CAAC,EAAEX,MAAM,CAAC,EAAE;MAC7DmB,EAAE,GAAGR,CAAC,GAAG,CAAC;IACZ;EACF;;EAEA;AACF;AACA;AACA;EACE,KAAK,IAAIA,CAAC,GAAGQ,EAAE,EAAER,CAAC,GAAGN,MAAM,GAAG,CAAC,IAAIe,EAAE,KAAKf,MAAM,EAAEM,CAAC,EAAE,EAAE;IACrD,IAAIb,OAAO,CAACK,IAAI,CAACQ,CAAC,CAAC,EAAEX,MAAM,CAAC,IAAI,CAACF,OAAO,CAACK,IAAI,CAACQ,CAAC,GAAG,CAAC,CAAC,EAAEX,MAAM,CAAC,EAAE;MAC7DoB,EAAE,GAAGT,CAAC,GAAG,CAAC;IACZ;EACF;;EAEA;AACF;AACA;AACA;AACA;EACE,IAAIN,MAAM,GAAG,CAAC,EAAE;IACd,IAAI,CAACP,OAAO,CAACK,IAAI,CAAC,CAAC,CAAC,EAAEH,MAAM,CAAC,EAAE;MAC7BqB,EAAE,GAAGnB,iBAAiB,CAACC,IAAI,EAAEH,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC;IAC7C,CAAC,MAAM,IAAIF,OAAO,CAACK,IAAI,CAAC,CAAC,CAAC,EAAEH,MAAM,CAAC,IAAIF,OAAO,CAACK,IAAI,CAAC,CAAC,CAAC,EAAEH,MAAM,CAAC,EAAE;MAC/DqB,EAAE,GAAGd,qBAAqB,CAACJ,IAAI,EAAEH,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC;IACjD,CAAC,MAAM;MACLqB,EAAE,GAAG,CAAC;IACR;EACF;EAEA,MAAMN,MAAM,GAAGZ,IAAI,CAACwB,KAAK,CAACR,EAAE,CAAC;EAC7B,MAAMH,MAAM,GAAGb,IAAI,CAACwB,KAAK,CAACP,EAAE,CAAC;EAC7B,IAAIH,MAAM,GAAGd,IAAI,CAACwB,KAAK,CAACN,EAAE,CAAC;;EAE3B;EACA,MAAM+B,cAAc,GAAGvC,oBAAoB,CACzCV,IAAI,EACJ2C,cAAc,CAACE,eAAe,CAACK,gBAAgB,EAC/CtC,MAAM,EACNC,MAAM,EACNC,MACF,CAAC;;EAED;EACA,IAAIqC,cAAc,GAAG,EAAE;EAEvB,IAAInD,IAAI,KAAKiD,cAAc,EAAE;IAC3BE,cAAc,GAAGtB,gBAAgB,CAAC7B,IAAI,EAAE2C,cAAc,CAACE,eAAe,CAACf,YAAY,EAAEhB,MAAM,CAAC;EAC9F;;EAEA;EACA,IAAId,IAAI,KAAKiD,cAAc,EAAE;IAC3BjD,IAAI,GAAGiD,cAAc;IACrBnC,MAAM,GAAGd,IAAI,CAACwB,KAAK,CAACN,EAAE,CAAC;EACzB,CAAC,MAAM,IAAIlB,IAAI,KAAKmD,cAAc,EAAE;IAClCnD,IAAI,GAAGmD,cAAc;IACrBrC,MAAM,GAAGd,IAAI,CAACwB,KAAK,CAACN,EAAE,CAAC;EACzB;;EAEA;AACF;AACA;AACA;EACE,IAAI+B,cAAc,KAAKjD,IAAI,IAAImD,cAAc,KAAKnD,IAAI,EAAE;IACtD,IACEA,IAAI,CAACwC,QAAQ,CAACG,cAAc,CAACE,eAAe,CAACO,KAAK,CAAC,CAAC,CAAC,CAAC,IACtDtC,MAAM,CAAC0B,QAAQ,CAACG,cAAc,CAACE,eAAe,CAACO,KAAK,CAAC,CAAC,CAAC,CAAC,EACxD;MACApD,IAAI,GAAGA,IAAI,CAACwB,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;MACxBV,MAAM,GAAGd,IAAI,CAACwB,KAAK,CAACN,EAAE,CAAC;IACzB;EACF,CAAC,MAAM;IACL,MAAMmC,kBAAkB,GAAG5D,yBAAyB,CAClDqB,MAAM,EACN6B,cAAc,CAACE,eAAe,CAACS,eACjC,CAAC;IACD,IAAID,kBAAkB,KAAK,EAAE,EAAE;MAC7BrD,IAAI,GAAGA,IAAI,CAACwB,KAAK,CAAC,CAAC,EAAE,CAAC6B,kBAAkB,CAACnD,MAAM,CAAC;MAChDY,MAAM,GAAGd,IAAI,CAACwB,KAAK,CAACN,EAAE,CAAC;IACzB;EACF;;EAEA;EACAlB,IAAI,GAAGgC,oBAAoB,CAAChC,IAAI,EAAE2C,cAAc,CAACE,eAAe,CAACU,gBAAgB,EAAEzC,MAAM,CAAC;;EAE1F;EACAd,IAAI,GAAGK,iBAAiB,CAACL,IAAI,EAAEgD,sBAAsB,EAAEF,WAAW,CAAC;EAEnE,OAAO9C,IAAI;AACb","ignoreList":[]}

package/build/languageProcessing/languages/pt/values/Clause.js

@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _index = require("../../../index");
+var _functionWords = require("../config/functionWords");
+var _getParticiples = _interopRequireDefault(require("../helpers/internal/getParticiples"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+const {
+  directPrecedenceException,
+  values
+} = _index.languageProcessing;
+const {
+  Clause
+} = values;
+
+/**
+ * Creates a Clause object for the Portuguese language.
+ */
+class PortugueseClause extends Clause {
+  /**
+   * Constructor.
+   *
+   * @param {string} clauseText   The text of the clause.
+   * @param {Array} auxiliaries   The auxiliaries.
+   *
+   * @constructor
+   */
+  constructor(clauseText, auxiliaries) {
+    super(clauseText, auxiliaries);
+    this._participles = (0, _getParticiples.default)(this.getClauseText());
+    this.checkParticiples();
+  }
+
+  /**
+   * Checks if any exceptions are applicable to this participle that would result in the clause not being passive.
+   * If no exceptions are found, the clause is passive.
+   *
+   * @returns {void}
+   */
+  checkParticiples() {
+    const clause = this.getClauseText();
+    const foundParticiples = this.getParticiples().filter(participle => !directPrecedenceException(clause, participle, _functionWords.cannotDirectlyPrecedePassiveParticiple));
+    this.setPassive(foundParticiples.length > 0);
+  }
+}
+var _default = exports.default = PortugueseClause;
+//# sourceMappingURL=Clause.js.map

package/build/languageProcessing/languages/pt/values/Clause.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Clause.js","names":["_index","require","_functionWords","_getParticiples","_interopRequireDefault","e","__esModule","default","directPrecedenceException","values","languageProcessing","Clause","PortugueseClause","constructor","clauseText","auxiliaries","_participles","getParticiples","getClauseText","checkParticiples","clause","foundParticiples","filter","participle","cannotDirectlyPrecedePassiveParticiple","setPassive","length","_default","exports"],"sources":["../../../../../src/languageProcessing/languages/pt/values/Clause.js"],"sourcesContent":["import {languageProcessing} from '../../../index';\nimport {cannotDirectlyPrecedePassiveParticiple} from '../config/functionWords';\nimport getParticiples from '../helpers/internal/getParticiples';\nconst {directPrecedenceException, values} = languageProcessing;\nconst {Clause} = values;\n\n/**\n * Creates a Clause object for the Portuguese language.\n */\nclass PortugueseClause extends Clause {\n  /**\n   * Constructor.\n   *\n   * @param {string} clauseText   The text of the clause.\n   * @param {Array} auxiliaries   The auxiliaries.\n   *\n   * @constructor\n   */\n  constructor(clauseText, auxiliaries) {\n    super(clauseText, auxiliaries);\n    this._participles = getParticiples(this.getClauseText());\n    this.checkParticiples();\n  }\n\n  /**\n   * Checks if any exceptions are applicable to this participle that would result in the clause not being passive.\n   * If no exceptions are found, the clause is passive.\n   *\n   * @returns {void}\n   */\n  checkParticiples() {\n    const clause = this.getClauseText();\n\n    const foundParticiples = this.getParticiples().filter(\n      participle =>\n        !directPrecedenceException(clause, participle, cannotDirectlyPrecedePassiveParticiple)\n    );\n\n    this.setPassive(foundParticiples.length > 0);\n  }\n}\n\nexport default PortugueseClause;\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AACA,IAAAC,cAAA,GAAAD,OAAA;AACA,IAAAE,eAAA,GAAAC,sBAAA,CAAAH,OAAA;AAAgE,SAAAG,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAChE,MAAM;EAACG,yBAAyB;EAAEC;AAAM,CAAC,GAAGC,yBAAkB;AAC9D,MAAM;EAACC;AAAM,CAAC,GAAGF,MAAM;;AAEvB;AACA;AACA;AACA,MAAMG,gBAAgB,SAASD,MAAM,CAAC;EACpC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEE,WAAWA,CAACC,UAAU,EAAEC,WAAW,EAAE;IACnC,KAAK,CAACD,UAAU,EAAEC,WAAW,CAAC;IAC9B,IAAI,CAACC,YAAY,GAAG,IAAAC,uBAAc,EAAC,IAAI,CAACC,aAAa,CAAC,CAAC,CAAC;IACxD,IAAI,CAACC,gBAAgB,CAAC,CAAC;EACzB;;EAEA;AACF;AACA;AACA;AACA;AACA;EACEA,gBAAgBA,CAAA,EAAG;IACjB,MAAMC,MAAM,GAAG,IAAI,CAACF,aAAa,CAAC,CAAC;IAEnC,MAAMG,gBAAgB,GAAG,IAAI,CAACJ,cAAc,CAAC,CAAC,CAACK,MAAM,CACnDC,UAAU,IACR,CAACf,yBAAyB,CAACY,MAAM,EAAEG,UAAU,EAAEC,qDAAsC,CACzF,CAAC;IAED,IAAI,CAACC,UAAU,CAACJ,gBAAgB,CAACK,MAAM,GAAG,CAAC,CAAC;EAC9C;AACF;AAAC,IAAAC,QAAA,GAAAC,OAAA,CAAArB,OAAA,GAEcK,gBAAgB","ignoreList":[]}

package/build/languageProcessing/languages/ru/Researcher.js

@@ -0,0 +1,57 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _index = require("../../../index");
+var _firstWordExceptions = _interopRequireDefault(require("./config/firstWordExceptions"));
+var _functionWords = require("./config/functionWords");
+var _transitionWords = _interopRequireDefault(require("./config/transitionWords"));
+var _twoPartTransitionWords = _interopRequireDefault(require("./config/twoPartTransitionWords"));
+var _syllables = _interopRequireDefault(require("./config/syllables.json"));
+var _fleschReadingEaseScores = _interopRequireDefault(require("./config/fleschReadingEaseScores"));
+var _sentenceLength = _interopRequireDefault(require("./config/sentenceLength"));
+var _getStemmer = _interopRequireDefault(require("./helpers/getStemmer"));
+var _isPassiveSentence = _interopRequireDefault(require("./helpers/isPassiveSentence"));
+var _calculateFleschReadingScore = _interopRequireDefault(require("./helpers/calculateFleschReadingScore"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+const {
+  AbstractResearcher
+} = _index.languageProcessing;
+
+// All config
+
+// All helpers
+
+/**
+ * The researcher contains all the researches, helpers, data, and config.
+ */
+class Researcher extends AbstractResearcher {
+  /**
+   * Constructor
+   * @param {Paper} paper The Paper object that is needed within the researches.
+   * @constructor
+   */
+  constructor(paper) {
+    super(paper);
+    Object.assign(this.config, {
+      language: 'ru',
+      passiveConstructionType: 'morphological',
+      firstWordExceptions: _firstWordExceptions.default,
+      functionWords: _functionWords.all,
+      transitionWords: _transitionWords.default,
+      twoPartTransitionWords: _twoPartTransitionWords.default,
+      syllables: _syllables.default,
+      fleschReadingEaseScores: _fleschReadingEaseScores.default,
+      sentenceLength: _sentenceLength.default
+    });
+    Object.assign(this.helpers, {
+      getStemmer: _getStemmer.default,
+      isPassiveSentence: _isPassiveSentence.default,
+      fleschReadingScore: _calculateFleschReadingScore.default
+    });
+  }
+}
+exports.default = Researcher;
+//# sourceMappingURL=Researcher.js.map

package/build/languageProcessing/languages/ru/Researcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Researcher.js","names":["_index","require","_firstWordExceptions","_interopRequireDefault","_functionWords","_transitionWords","_twoPartTransitionWords","_syllables","_fleschReadingEaseScores","_sentenceLength","_getStemmer","_isPassiveSentence","_calculateFleschReadingScore","e","__esModule","default","AbstractResearcher","languageProcessing","Researcher","constructor","paper","Object","assign","config","language","passiveConstructionType","firstWordExceptions","functionWords","transitionWords","twoPartTransitionWords","syllables","fleschReadingEaseScores","sentenceLength","helpers","getStemmer","isPassiveSentence","fleschReadingScore","exports"],"sources":["../../../../src/languageProcessing/languages/ru/Researcher.js"],"sourcesContent":["import {languageProcessing} from '../../../index';\nconst {AbstractResearcher} = languageProcessing;\n\n// All config\nimport firstWordExceptions from './config/firstWordExceptions';\nimport {all as functionWords} from './config/functionWords';\nimport transitionWords from './config/transitionWords';\nimport twoPartTransitionWords from './config/twoPartTransitionWords';\nimport syllables from './config/syllables.json';\nimport fleschReadingEaseScores from './config/fleschReadingEaseScores';\nimport sentenceLength from './config/sentenceLength';\n\n// All helpers\nimport getStemmer from './helpers/getStemmer';\nimport isPassiveSentence from './helpers/isPassiveSentence';\nimport fleschReadingScore from './helpers/calculateFleschReadingScore';\n\n/**\n * The researcher contains all the researches, helpers, data, and config.\n */\nexport default class Researcher extends AbstractResearcher {\n  /**\n   * Constructor\n   * @param {Paper} paper The Paper object that is needed within the researches.\n   * @constructor\n   */\n  constructor(paper) {\n    super(paper);\n\n    Object.assign(this.config, {\n      language: 'ru',\n      passiveConstructionType: 'morphological',\n      firstWordExceptions,\n      functionWords,\n      transitionWords,\n      twoPartTransitionWords,\n      syllables,\n      fleschReadingEaseScores,\n      sentenceLength\n    });\n\n    Object.assign(this.helpers, {\n      getStemmer,\n      isPassiveSentence,\n      fleschReadingScore\n    });\n  }\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAIA,IAAAC,oBAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,cAAA,GAAAH,OAAA;AACA,IAAAI,gBAAA,GAAAF,sBAAA,CAAAF,OAAA;AACA,IAAAK,uBAAA,GAAAH,sBAAA,CAAAF,OAAA;AACA,IAAAM,UAAA,GAAAJ,sBAAA,CAAAF,OAAA;AACA,IAAAO,wBAAA,GAAAL,sBAAA,CAAAF,OAAA;AACA,IAAAQ,eAAA,GAAAN,sBAAA,CAAAF,OAAA;AAGA,IAAAS,WAAA,GAAAP,sBAAA,CAAAF,OAAA;AACA,IAAAU,kBAAA,GAAAR,sBAAA,CAAAF,OAAA;AACA,IAAAW,4BAAA,GAAAT,sBAAA,CAAAF,OAAA;AAAuE,SAAAE,uBAAAU,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAdvE,MAAM;EAACG;AAAkB,CAAC,GAAGC,yBAAkB;;AAE/C;;AASA;;AAKA;AACA;AACA;AACe,MAAMC,UAAU,SAASF,kBAAkB,CAAC;EACzD;AACF;AACA;AACA;AACA;EACEG,WAAWA,CAACC,KAAK,EAAE;IACjB,KAAK,CAACA,KAAK,CAAC;IAEZC,MAAM,CAACC,MAAM,CAAC,IAAI,CAACC,MAAM,EAAE;MACzBC,QAAQ,EAAE,IAAI;MACdC,uBAAuB,EAAE,eAAe;MACxCC,mBAAmB,EAAnBA,4BAAmB;MACnBC,aAAa,EAAbA,kBAAa;MACbC,eAAe,EAAfA,wBAAe;MACfC,sBAAsB,EAAtBA,+BAAsB;MACtBC,SAAS,EAATA,kBAAS;MACTC,uBAAuB,EAAvBA,gCAAuB;MACvBC,cAAc,EAAdA;IACF,CAAC,CAAC;IAEFX,MAAM,CAACC,MAAM,CAAC,IAAI,CAACW,OAAO,EAAE;MAC1BC,UAAU,EAAVA,mBAAU;MACVC,iBAAiB,EAAjBA,0BAAiB;MACjBC,kBAAkB,EAAlBA;IACF,CAAC,CAAC;EACJ;AACF;AAACC,OAAA,CAAAtB,OAAA,GAAAG,UAAA","ignoreList":[]}

package/build/languageProcessing/languages/ru/config/firstWordExceptions.js

@@ -0,0 +1,16 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+/**
+ *  Returns an array with exceptions for the sentence beginning researcher.
+ *  @returns {Array} The array filled with exceptions.
+ *  */
+var _default = exports.default = [
+// Numbers 1-10:
+"один", "одна", "одно", "два", "две", "три", "четыре", "пять", "шесть", "семь", "восемь", "девять", "десять",
+// Demonstrative pronouns: тот, этот, такой, таков, столько
+"этот", "этого", "этому", "этим", "этом", "эта", "этой", "эту", "это", "этого", "этому", "эти", "этих", "этим", "этими", "тот", "того", "тому", "тем", "том", "та", "той", "ту", "те", "тех", "тем", "теми", "тех", "такой", "такого", "такому", "таким", "такая", "такую", "такое", "такие", "таких", "таким", "такими", "стольких", "стольким", "столько", "столькими", "вот"];
+//# sourceMappingURL=firstWordExceptions.js.map

package/build/languageProcessing/languages/ru/config/firstWordExceptions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"firstWordExceptions.js","names":["_default","exports","default"],"sources":["../../../../../src/languageProcessing/languages/ru/config/firstWordExceptions.js"],"sourcesContent":["/**\n *  Returns an array with exceptions for the sentence beginning researcher.\n *  @returns {Array} The array filled with exceptions.\n *  */\nexport default [\n\t// Numbers 1-10:\n\t\"один\", \"одна\", \"одно\", \"два\", \"две\", \"три\", \"четыре\", \"пять\", \"шесть\", \"семь\", \"восемь\", \"девять\", \"десять\",\n\t// Demonstrative pronouns: тот, этот, такой, таков, столько\n\t\"этот\", \"этого\", \"этому\", \"этим\", \"этом\", \"эта\", \"этой\", \"эту\", \"это\", \"этого\", \"этому\", \"эти\", \"этих\", \"этим\",\n\t\"этими\", \"тот\", \"того\", \"тому\", \"тем\", \"том\", \"та\", \"той\", \"ту\", \"те\", \"тех\", \"тем\", \"теми\", \"тех\", \"такой\",\n\t\"такого\", \"такому\", \"таким\", \"такая\", \"такую\", \"такое\", \"такие\", \"таких\", \"таким\", \"такими\", \"стольких\",\n\t\"стольким\", \"столько\", \"столькими\", \"вот\",\n];\n\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AAHA,IAAAA,QAAA,GAAAC,OAAA,CAAAC,OAAA,GAIe;AACd;AACA,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ;AAC5G;AACA,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAC9G,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAC3G,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EACvG,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,CACzC","ignoreList":[]}

package/build/languageProcessing/languages/ru/config/fleschReadingEaseScores.js

@@ -0,0 +1,27 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _default = exports.default = {
+  borders: {
+    veryEasy: 80,
+    easy: 70,
+    fairlyEasy: 60,
+    okay: 50,
+    fairlyDifficult: 40,
+    difficult: 20,
+    veryDifficult: 0
+  },
+  scores: {
+    veryEasy: 9,
+    easy: 9,
+    fairlyEasy: 9,
+    okay: 9,
+    fairlyDifficult: 6,
+    difficult: 3,
+    veryDifficult: 3
+  }
+};
+//# sourceMappingURL=fleschReadingEaseScores.js.map

package/build/languageProcessing/languages/ru/config/fleschReadingEaseScores.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fleschReadingEaseScores.js","names":["borders","veryEasy","easy","fairlyEasy","okay","fairlyDifficult","difficult","veryDifficult","scores"],"sources":["../../../../../src/languageProcessing/languages/ru/config/fleschReadingEaseScores.js"],"sourcesContent":["export default {\n\tborders: {\n\t\tveryEasy: 80,\n\t\teasy: 70,\n\t\tfairlyEasy: 60,\n\t\tokay: 50,\n\t\tfairlyDifficult: 40,\n\t\tdifficult: 20,\n\t\tveryDifficult: 0,\n\t},\n\tscores: {\n\t\tveryEasy: 9,\n\t\teasy: 9,\n\t\tfairlyEasy: 9,\n\t\tokay: 9,\n\t\tfairlyDifficult: 6,\n\t\tdifficult: 3,\n\t\tveryDifficult: 3,\n\t},\n};\n"],"mappings":";;;;;;iCAAe;EACdA,OAAO,EAAE;IACRC,QAAQ,EAAE,EAAE;IACZC,IAAI,EAAE,EAAE;IACRC,UAAU,EAAE,EAAE;IACdC,IAAI,EAAE,EAAE;IACRC,eAAe,EAAE,EAAE;IACnBC,SAAS,EAAE,EAAE;IACbC,aAAa,EAAE;EAChB,CAAC;EACDC,MAAM,EAAE;IACPP,QAAQ,EAAE,CAAC;IACXC,IAAI,EAAE,CAAC;IACPC,UAAU,EAAE,CAAC;IACbC,IAAI,EAAE,CAAC;IACPC,eAAe,EAAE,CAAC;IAClBC,SAAS,EAAE,CAAC;IACZC,aAAa,EAAE;EAChB;AACD,CAAC","ignoreList":[]}