axyseo 2.0.0-alpha.0.0.37 → 2.0.0-alpha.0.0.39

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

@@ -0,0 +1,566 @@
+/* eslint-disable max-statements, complexity */
+// The original stemmer is available at https://github.com/dmarman/lorca/blob/master/src/stemmer.js.
+import { languageProcessing } from "../../../../../index.js";
+import checkVerbStemModifications from "./checkVerbStemModifications";
+const {
+  buildFormRule,
+  createRulesFromArrays,
+  findMatchingEndingInArray
+} = languageProcessing;
+
+/**
+ * Copyright (C) 2018 Domingo Martín Mancera
+ *
+ * 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.
+ */
+
+/**
+ * Checks if the input character is a Spanish vowel.
+ *
+ * @param {string} letter The character to be checked.
+ *
+ * @returns {boolean} Whether the input character is a Spanish vowel.
+ */
+const isVowel = function (letter) {
+  const regex = /[aeiouáéíóú]/gi;
+  return regex.test(letter);
+};
+
+/**
+ * Checks what the position number of the next vowel is. The function starts searching starting from a position specified
+ * in the start parameter.
+ *
+ * @param {string} word         The word to be analyzed.
+ * @param {int}    [start=0]    The first position in the word to start checking from.
+ *
+ * @returns {int} The position at which the next vowel occurs.
+ */
+const nextVowelPosition = function (word, start) {
+  const length = word.length;
+  for (let position = start; position < length; position++) {
+    if (isVowel(word[position])) {
+      return position;
+    }
+  }
+  return length;
+};
+
+/**
+ * Checks what the position number of the next consonant is. The function starts searching starting from a position specified
+ * in the start parameter.
+ *
+ * @param {string} word         The word to be analyzed.
+ * @param {int}    [start=0]    The first position in the word to start checking from.
+ *
+ * @returns {int} The position at which the next consonant occurs.
+ */
+const nextConsonantPosition = function (word, start) {
+  const length = word.length;
+  for (let position = start; position < length; position++) {
+    if (!isVowel(word[position])) {
+      return position;
+    }
+  }
+  return length;
+};
+
+/**
+ * Replaces accented vowels with non-accented vowels in the input string.
+ *
+ * @param {string}   word     The word to be de-accentified.
+ *
+ * @returns {string} The de-accentified input word.
+ */
+const removeAccent = function (word) {
+  const accentedVowels = ['á', 'é', 'í', 'ó', 'ú'];
+  const vowels = ['a', 'e', 'i', 'o', 'u'];
+  for (let i = 0; i < accentedVowels.length; i++) {
+    word = word.replace(accentedVowels[i], vowels[i]);
+  }
+  return word;
+};
+
+/**
+ * Checks whether the input word ends with the input suffix.
+ *
+ * @param {string} word   The word to be analyzed.
+ * @param {string} suffix The suffix to check for.
+ *
+ * @returns {boolean} Whether the word ends with the suffix provided.
+ */
+const endsIn = function (word, suffix) {
+  if (word.length < suffix.length) {
+    return false;
+  }
+  return word.slice(-suffix.length) === suffix;
+};
+
+/**
+ * Checks whether the input word ends with one of the input suffixes and returns the longest suffix matched.
+ *
+ * @param {string}   word     The word to be analyzed.
+ * @param {string[]} suffixes The suffix to check for.
+ *
+ * @returns {string} The longest suffix matched in the word from the input list of suffixes.
+ */
+const endsInArr = function (word, suffixes) {
+  const matches = [];
+  for (const i in suffixes) {
+    if (endsIn(word, suffixes[i])) {
+      matches.push(suffixes[i]);
+    }
+  }
+  const longest = matches.sort(function (a, b) {
+    return b.length - a.length;
+  })[0];
+  if (longest) {
+    return longest;
+  }
+  return '';
+};
+
+/**
+ * Checks whether a word is in the full-form exception list and if so returns the canonical stem.
+ *
+ * @param {string} word	      The word to be checked.
+ * @param {Object} exceptions The list of full-form exceptions to be checked in.
+ *
+ * @returns {null|string} The canonical stem or null if nothing was found.
+ */
+const checkWordInFullFormExceptions = function (word, exceptions) {
+  for (const paradigm of exceptions) {
+    if (paradigm[1].includes(word)) {
+      return paradigm[0];
+    }
+  }
+  return null;
+};
+
+/**
+ * The function considers if the input word can be an adjective in -ano/anos/ana/anas and if so stems it.
+ *
+ * @param   {string}   word     The word to stem.
+ * @param   {string}   r1Text   The R1 region of the word to stem.
+ *
+ * @returns {string}   A stemmed adjective or the input word, if it is not an adjective on -ano/os/a/as.
+ */
+const stemAdjectivesOnAn = function (word, r1Text) {
+  const adjectiveSuffix = findMatchingEndingInArray(r1Text, ['ano', 'anos', 'ana', 'anas']);
+
+  // Remove o/a/os/as
+  if (adjectiveSuffix !== '') {
+    if (word.endsWith('s')) {
+      return word.slice(0, word.length - 2);
+    }
+    return word.slice(0, word.length - 1);
+  }
+  return word;
+};
+
+/**
+ * The function considers if the input word can be an adverb in -mente and if so stems it.
+ *
+ * @param   {string}   word                             The word to stem.
+ * @param   {string}   r1Text                           The R1 region of the word to stem.
+ * @param   {Object}   menteStemming                    An object containing information about how to stem mente-adverbs.
+ * @param   {string[]} menteStemming.notMenteAdverbs    An array of words that look like mente-adverbs but are not.
+ * @param   {Array}    menteStemming.menteToStem        An array of pairs of regexes to match.
+ *
+ * @returns {string}   A stemmed adverb or the input word, if it is not an adverb.
+ */
+const tryStemAsMente = function (word, r1Text, menteStemming) {
+  const suffix = endsIn(r1Text, 'mente');
+
+  // Immediately return the input word if no mente suffix is found or the word is in the stopList.
+  if (!suffix || menteStemming.notMenteAdverbs.includes(word)) {
+    return word;
+  }
+  return buildFormRule(word, createRulesFromArrays(menteStemming.menteToStem)) || word;
+};
+
+/**
+ * The function considers if the input word can be a superlative and if so stems it.
+ *
+ * @param   {string}   word                                      The word to stem.
+ * @param   {string}   r1Text                                    The R1 region of the word to stem.
+ * @param   {Object}   superlativesStemming                      An object containing information about how to stem superlatives.
+ * @param   {string[]} superlativesStemming.superlativeSuffixes  An array of suffixes possible in superlatives.
+ * @param   {string[]} superlativesStemming.notSuperlatives      An array of words that look like superlatives but are not.
+ * @param   {Array}    superlativesStemming.superlativeToStem    An array of pairs of regexes to match.
+ *
+ * @returns {string}   A stemmed superlative or the input word, if it is not a superlative.
+ */
+const tryStemAsSuperlative = function (word, r1Text, superlativesStemming) {
+  const superlativeSuffix = findMatchingEndingInArray(r1Text, superlativesStemming.superlativeSuffixes);
+
+  // Immediately return the input word if no superlative suffix is found or the word is in the stopList.
+  if (superlativeSuffix === '' || superlativesStemming.notSuperlatives.includes(word)) {
+    return word;
+  }
+  return buildFormRule(word, createRulesFromArrays(superlativesStemming.superlativeToStem));
+};
+
+/**
+ * The function considers if the input word can be a diminutive and if so stems it.
+ * @param   {string}   word                                         The word to stem.
+ * @param   {Object}   diminutivesStemming                          An object containing information about how to stem diminutives.
+ * @param   {string[]} diminutivesStemming.notDiminutives           An array of words that look like diminutives but are not.
+ * @param   {Array}    diminutivesStemming.diminutiveToStem         An array of pairs of regexes to match.
+ * @param   {Array}    diminutivesStemming.irregularDiminutives     An array containing data for irregular diminutives.
+ *
+ * @returns {string}   A stemmed diminutive or the input word, if it is not a diminutive.
+ */
+const tryStemAsDiminutive = function (word, diminutivesStemming) {
+  const diminutiveSuffix = findMatchingEndingInArray(word, ['ito', 'ita', 'itos', 'itas', 'íto', 'íta', 'ítos', 'ítas']);
+
+  // Immediately return the input word if no diminutive suffix is found or the word is in the stopList.
+  if (diminutiveSuffix === '' || diminutivesStemming.notDiminutives.includes(word)) {
+    return word;
+  }
+
+  // Remove o/a/os/as and check irregular diminutives ending in -it-/-ít-
+  const wordWithoutEnding = word.endsWith('s') ? word.slice(0, word.length - 2) : word.slice(0, word.length - 1);
+  for (const paradigm of diminutivesStemming.irregularDiminutives) {
+    if (paradigm[1].includes(wordWithoutEnding)) {
+      return paradigm[0];
+    }
+  }
+  return buildFormRule(word, createRulesFromArrays(diminutivesStemming.diminutiveToStem)) || word;
+};
+
+/**
+ * Checks whether a stem is in an exception list of verbs, nouns or adjectives with multiple stems and if so returns
+ * the canonical stem.
+ *
+ * @param {string} stemmedWord	            The stemmed word to be checked.
+ * @param {Object} stemsThatBelongToOneWord The POS-specific data that shows how non-canonical stems should be canonicalized.
+ *
+ * @returns {null|string} The canonical stem or null if nothing was found.
+ */
+const canonicalizeStem = function (stemmedWord, stemsThatBelongToOneWord) {
+  // First check for nouns with multiple stems, which are only diminutives.
+  for (const paradigm of stemsThatBelongToOneWord.nouns) {
+    if (paradigm.includes(stemmedWord)) {
+      return paradigm[0];
+    }
+  }
+
+  // Second check for adjectives with multiple stems, which are only adjectives ending in -bl/-bil.
+  for (const paradigm of stemsThatBelongToOneWord.adjectives) {
+    if (paradigm.includes(stemmedWord)) {
+      return paradigm[0];
+    }
+  }
+
+  // Last check for verbs that have irregular forms.
+  for (const paradigm of stemsThatBelongToOneWord.verbs) {
+    if (paradigm.includes(stemmedWord)) {
+      return paradigm[0];
+    }
+  }
+  return null;
+};
+
+/**
+ * Stems verb suffixes.
+ *
+ * @param {string}  word                The original word.
+ * @param {string}  wordAfter1          The word after step 1.
+ * @param {string}  rvText              The text of the RV.
+ * @param {number}  rv                  The start position of the RV.
+ *
+ * @returns {string} The word with the verb suffixes removed (if applicable).
+ */
+const stemVerbSuffixes = function (word, wordAfter1, rvText, rv) {
+  // Do step 2a if no ending was removed by step 1.
+  const suf = findMatchingEndingInArray(rvText, ['ya', 'ye', 'yan', 'yen', 'yeron', 'yendo', 'yo', 'yó', 'yas', 'yes', 'yais', 'yamos']);
+  if (suf !== '' && word.slice(-suf.length - 1, -suf.length) === 'u') {
+    word = word.slice(0, -suf.length);
+  }
+  if (word !== wordAfter1) {
+    rvText = word.slice(rv);
+  }
+
+  // Do Step 2b if step 2a was done, but failed to remove a suffix.
+  if (word === wordAfter1) {
+    const suf11 = findMatchingEndingInArray(rvText, ['arían', 'arías', 'arán', 'arás', 'aríais', 'aría', 'aréis', 'aríamos', 'aremos', 'ará', 'aré', 'erían', 'erías', 'erán', 'erás', 'eríais', 'ería', 'eréis', 'eríamos', 'eremos', 'erá', 'eré', 'irían', 'irías', 'irán', 'irás', 'iríais', 'iría', 'iréis', 'iríamos', 'iremos', 'irá', 'iré', 'aba', 'ada', 'ida', 'ía', 'ara', 'iera', 'ad', 'ed', 'id', 'ase', 'iese', 'aste', 'iste', 'an', 'aban', 'ían', 'aran', 'ieran', 'asen', 'iesen', 'aron', 'ieron', 'ado', 'ido', 'ando', 'iendo', 'ió', 'ar', 'er', 'ir', 'as', 'abas', 'adas', 'idas', 'ías', 'aras', 'ieras', 'ases', 'ieses', 'ís', 'áis', 'abais', 'íais', 'arais', 'ierais', '  aseis', 'ieseis', 'asteis', 'isteis', 'ados', 'idos', 'amos', 'ábamos', 'íamos', 'imos', 'áramos', 'iéramos', 'iésemos', 'ásemos']);
+    const suf12 = findMatchingEndingInArray(rvText, ['en', 'es', 'éis', 'emos']);
+    if (suf11 !== '') {
+      word = word.slice(0, -suf11.length);
+    } else if (suf12 !== '') {
+      word = word.slice(0, -suf12.length);
+      if (endsIn(word, 'gu')) {
+        word = word.slice(0, -1);
+      }
+    }
+  }
+  return word;
+};
+
+/**
+ * Determines the R1, R2 and RV of the word.
+ *
+ * @param {string} word		The word checked.
+ *
+ * @returns {number[]} The array of R1, R2, and RV.
+ */
+const determineWordRegion = function (word) {
+  let r1 = word.length;
+  let r2 = word.length;
+  let rv = word.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 < word.length - 1 && r1 === word.length; i++) {
+    if (isVowel(word[i]) && !isVowel(word[i + 1])) {
+      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 < word.length - 1 && r2 === word.length; i++) {
+    if (isVowel(word[i]) && !isVowel(word[i + 1])) {
+      r2 = i + 2;
+    }
+  }
+  if (word.length > 3) {
+    if (!isVowel(word[1])) {
+      rv = nextVowelPosition(word, 2) + 1;
+    } else if (isVowel(word[0]) && isVowel(word[1])) {
+      rv = nextConsonantPosition(word, 2) + 1;
+    } else {
+      rv = 3;
+    }
+  }
+  return [r1, r2, rv];
+};
+
+/**
+ * Stems enclitic pronouns.
+ *
+ * @param {string}  word            The word checked.
+ * @param {string}  rvText	        The text of RV.
+ * @param {Object}  morphologyData  The Spanish morphology data.
+ *
+ * @returns {string} The word without the enclitic pronoun (if applicable).
+ */
+const stemEncliticPronouns = function (word, rvText, morphologyData) {
+  const pronounSuffix = ['me', 'se', 'sela', 'selo', 'selas', 'selos', 'la', 'le', 'lo', 'las', 'les', 'los', 'nos'];
+  const pronounSuffixPre1 = ['iéndo', 'ándo', 'ár', 'ér', 'ír'];
+  const pronounSuffixPre2 = ['iendo', 'ando', 'ar', 'er', 'ir'];
+  const suffix = findMatchingEndingInArray(word, pronounSuffix);
+  if (suffix !== '' && !morphologyData.wordsThatLookLikeButAreNot.notVerbsEndingInPersonalPronouns.includes(word)) {
+    let preSuffix = findMatchingEndingInArray(rvText.slice(0, -suffix.length), pronounSuffixPre1);
+    if (preSuffix === '') {
+      preSuffix = findMatchingEndingInArray(rvText.slice(0, -suffix.length), pronounSuffixPre2);
+      if (preSuffix !== '' || endsIn(word.slice(0, -suffix.length), 'uyendo')) {
+        word = word.slice(0, -suffix.length);
+      }
+    } else {
+      word = removeAccent(word.slice(0, -suffix.length));
+    }
+  }
+  return word;
+};
+
+/**
+ * Stems derivational suffixes such as "anza", "anzas", "ico", "ica", "icos", "icas" etc. E.g. esperanza -> esper
+ *
+ * @param {string} word		The word checked.
+ * @param {string} r2Text	The text of the R2.
+ *
+ * @returns {string} The word with removed derivational suffix.
+ */
+const stemDerivationalForms = function (word, r2Text) {
+  const suf1 = findMatchingEndingInArray(r2Text, ['anza', 'anzas', 'ico', 'ica', 'icos', 'icas', 'ismo', 'ismos', 'able', 'ables', 'ible', 'ibles', 'ista', 'istas', 'oso', 'osa', 'osos', 'osas', 'amiento', 'amientos', 'imiento', 'imientos']);
+  const suf2 = findMatchingEndingInArray(r2Text, ['icadora', 'icador', 'icación', 'icadoras', 'icadores', 'icaciones', 'icante', 'icantes', 'icancia', 'icancias', 'adora', 'ador', 'ación', 'adoras', 'adores', 'aciones', 'ante', 'antes', 'ancia', 'ancias']);
+  const suf3 = findMatchingEndingInArray(r2Text, ['logía', 'logías']);
+  const suf4 = findMatchingEndingInArray(r2Text, ['ución', 'uciones']);
+  const suf5 = findMatchingEndingInArray(r2Text, ['encia', 'encias']);
+  const suf9 = findMatchingEndingInArray(r2Text, ['abilidad', 'abilidades', 'icidad', 'icidades', 'ividad', 'ividades', 'idad', 'idades']);
+  const suf10 = findMatchingEndingInArray(r2Text, ['ativa', 'ativo', 'ativas', 'ativos', 'iva', 'ivo', 'ivas', 'ivos']);
+  if (suf1 !== '') {
+    word = word.slice(0, -suf1.length);
+  } else if (suf2 !== '') {
+    word = word.slice(0, -suf2.length);
+  } else if (suf3 !== '') {
+    word = word.slice(0, -suf3.length) + 'log';
+  } else if (suf4 !== '') {
+    word = word.slice(0, -suf4.length) + 'u';
+  } else if (suf5 !== '') {
+    word = word.slice(0, -suf5.length) + 'ente';
+  } else if (suf9 !== '') {
+    word = word.slice(0, -suf9.length);
+  } else if (suf10 !== '') {
+    word = word.slice(0, -suf10.length);
+  }
+  return word;
+};
+
+/**
+ * Stems suffixes "os", "a", "o", "á", "í", "ó", "e", and "é" in RV. e.g. regla -> regl
+ *
+ * @param {string} word					The word checked.
+ * @param {string} rvText				The text of RV.
+ * @param {number} rv                  	The start position of the RV.
+ * @returns {string} The word with removed suffix.
+ */
+const stemGenericSuffix = function (word, rvText, rv) {
+  const suf13 = endsInArr(rvText, ['os', 'a', 'o', 'á', 'í', 'ó']);
+  if (suf13 !== '') {
+    word = word.slice(0, -suf13.length);
+  } else if (endsInArr(rvText, ['e', 'é']) !== '') {
+    word = word.slice(0, -1);
+    rvText = word.slice(rv);
+    if (endsIn(rvText, 'u') && endsIn(word, 'gu')) {
+      word = word.slice(0, -1);
+    }
+  }
+  return word;
+};
+
+/**
+ * Stems Spanish words.
+ *
+ * @param {string} word            The word to stem.
+ * @param {Object} morphologyData  The Spanish morphology data.
+ *
+ * @returns {string} The stemmed word.
+ */
+export default function stem(word, morphologyData) {
+  word.toLowerCase();
+  const ifException = checkWordInFullFormExceptions(word, morphologyData.exceptionStemsWithFullForms);
+  if (ifException) {
+    return ifException;
+  }
+  const nonPluralsOnS = morphologyData.wordsThatLookLikeButAreNot.nonPluralsOnS;
+  if (nonPluralsOnS.includes(word)) {
+    return removeAccent(word);
+  }
+  const length = word.length;
+  if (length < 2) {
+    return removeAccent(word);
+  }
+
+  // Determine the r1, r2 and rv of the word
+  const [r1, r2, rv] = determineWordRegion(word);
+  let r1Text = word.slice(r1);
+  let r2Text = word.slice(r2);
+  let rvText = word.slice(rv);
+  const originalWord = word;
+  const wordAfterAdjectiveOnAnCheck = stemAdjectivesOnAn(word, r1Text);
+  if (wordAfterAdjectiveOnAnCheck !== word) {
+    return removeAccent(wordAfterAdjectiveOnAnCheck);
+  }
+
+  /*
+   * Step 0:
+   * Stem enclitic pronouns.
+   */
+  word = stemEncliticPronouns(word, rvText, morphologyData);
+  if (word !== originalWord) {
+    r1Text = word.slice(r1);
+    r2Text = word.slice(r2);
+    rvText = word.slice(rv);
+  }
+
+  // The word after removing enclitic pronouns.
+  const wordAfter0 = word;
+
+  /*
+   * Step 1:
+   * If the word ends in derivational suffixes such as "anza", "anzas", "ico", "ica", "icos", "icas" etc. the suffix will be stemmed here.
+   */
+  word = stemDerivationalForms(word, r2Text);
+
+  // Check if the word is an adverb in -mente. Stem it as a adverb if so, and immediately return the result.
+  const ifMente = tryStemAsMente(word, r1Text, morphologyData.menteStemming);
+  if (ifMente !== word) {
+    return removeAccent(ifMente);
+  }
+
+  // Check if the word is a superlative. Stem it as a superlative if so, and immediately return the result.
+  const ifSuperlative = tryStemAsSuperlative(word, r1Text, morphologyData.superlativesStemming);
+  if (ifSuperlative !== word) {
+    return removeAccent(ifSuperlative);
+  }
+
+  // Check if the word is a diminutive. Stem it as a diminutive if so, and immediately return the result.
+  const ifDiminutive = tryStemAsDiminutive(word, morphologyData.diminutivesStemming);
+  if (ifDiminutive !== word) {
+    return removeAccent(ifDiminutive);
+  }
+
+  // Adjust RV text if the word has been changed after derivational suffixes have been removed.
+  if (word !== wordAfter0) {
+    rvText = word.slice(rv);
+  }
+
+  // The word after removing derivational suffixes.
+  const wordAfter1 = word;
+  /*
+   * Step 2a and 2b:
+   * Stem verb suffixes.
+   */
+  let isNonVerb = false;
+  const notVerbForms = morphologyData.wordsThatLookLikeButAreNot.notVerbForms;
+
+  // Stem verbal suffixes if no derivational suffix was detected and removed.
+  if (wordAfter0 === wordAfter1) {
+    // If the word ends in -s, it is removed before checking the non-verbs list, as the list does not include plural forms.
+    let wordWithoutS = word;
+    if (word.endsWith('s')) {
+      wordWithoutS = word.slice(0, -1);
+    }
+    if (notVerbForms.includes(wordWithoutS)) {
+      /*
+       * If the word without -s is matched on the non-verbs list, we can perform the next (non-verb) stemming steps
+       * with the -s removed. This is because all possible non-verb suffixes ending in -s also have an equivalent
+       * without the -s (e.g. -as/a; -es/e), so will be stemmed after stripping the -s.
+       */
+      word = wordWithoutS;
+      isNonVerb = true;
+    } else {
+      word = stemVerbSuffixes(word, wordAfter1, rvText, rv);
+    }
+  }
+
+  // Adjust RV text after derivational suffixes have been removed.
+  rvText = word.slice(rv);
+
+  /*
+   * Step 4:
+   * Stem generic suffixes;
+   * If the word ends in "os", "a", "o", "á", "í", "ó", "e", "é", the suffix will be removed here.
+   */
+  word = stemGenericSuffix(word, rvText, rv);
+
+  // Check if the stemmed word is on the list of words with multiple stems. If so, return the canonical stem.
+  const canonicalStem = canonicalizeStem(word, morphologyData.stemsThatBelongToOneWord);
+  if (canonicalStem) {
+    return canonicalStem;
+  }
+  if (!isNonVerb) {
+    const modifiedVerbStem = checkVerbStemModifications(word, morphologyData);
+    if (modifiedVerbStem) {
+      // If on the list of words that look like verbs [notVerbForms] do not perform stem modification.
+      // Do not perform at the beginning of the word and if word does not have verb suffix.
+      return modifiedVerbStem;
+    }
+  }
+  return removeAccent(word);
+}
+//# sourceMappingURL=stem.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"stem.js","names":["languageProcessing","checkVerbStemModifications","buildFormRule","createRulesFromArrays","findMatchingEndingInArray","isVowel","letter","regex","test","nextVowelPosition","word","start","length","position","nextConsonantPosition","removeAccent","accentedVowels","vowels","i","replace","endsIn","suffix","slice","endsInArr","suffixes","matches","push","longest","sort","a","b","checkWordInFullFormExceptions","exceptions","paradigm","includes","stemAdjectivesOnAn","r1Text","adjectiveSuffix","endsWith","tryStemAsMente","menteStemming","notMenteAdverbs","menteToStem","tryStemAsSuperlative","superlativesStemming","superlativeSuffix","superlativeSuffixes","notSuperlatives","superlativeToStem","tryStemAsDiminutive","diminutivesStemming","diminutiveSuffix","notDiminutives","wordWithoutEnding","irregularDiminutives","diminutiveToStem","canonicalizeStem","stemmedWord","stemsThatBelongToOneWord","nouns","adjectives","verbs","stemVerbSuffixes","wordAfter1","rvText","rv","suf","suf11","suf12","determineWordRegion","r1","r2","stemEncliticPronouns","morphologyData","pronounSuffix","pronounSuffixPre1","pronounSuffixPre2","wordsThatLookLikeButAreNot","notVerbsEndingInPersonalPronouns","preSuffix","stemDerivationalForms","r2Text","suf1","suf2","suf3","suf4","suf5","suf9","suf10","stemGenericSuffix","suf13","stem","toLowerCase","ifException","exceptionStemsWithFullForms","nonPluralsOnS","originalWord","wordAfterAdjectiveOnAnCheck","wordAfter0","ifMente","ifSuperlative","ifDiminutive","isNonVerb","notVerbForms","wordWithoutS","canonicalStem","modifiedVerbStem"],"sources":["../../../../../../src/languageProcessing/languages/es/helpers/internal/stem.js"],"sourcesContent":["/* eslint-disable max-statements, complexity */\n// The original stemmer is available at https://github.com/dmarman/lorca/blob/master/src/stemmer.js.\nimport {languageProcessing} from '@axyseo/index.js';\nimport checkVerbStemModifications from './checkVerbStemModifications';\n\nconst {buildFormRule, createRulesFromArrays, findMatchingEndingInArray} = languageProcessing;\n\n/**\n * Copyright (C) 2018 Domingo Martín Mancera\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n */\n\n/**\n * Checks if the input character is a Spanish vowel.\n *\n * @param {string} letter The character to be checked.\n *\n * @returns {boolean} Whether the input character is a Spanish vowel.\n */\nconst isVowel = function(letter) {\n  const regex = /[aeiouáéíóú]/gi;\n\n  return regex.test(letter);\n};\n\n/**\n * Checks what the position number of the next vowel is. The function starts searching starting from a position specified\n * in the start parameter.\n *\n * @param {string} word         The word to be analyzed.\n * @param {int}    [start=0]    The first position in the word to start checking from.\n *\n * @returns {int} The position at which the next vowel occurs.\n */\nconst nextVowelPosition = function(word, start) {\n  const length = word.length;\n\n  for (let position = start; position < length; position++) {\n    if (isVowel(word[position])) {\n      return position;\n    }\n  }\n\n  return length;\n};\n\n/**\n * Checks what the position number of the next consonant is. The function starts searching starting from a position specified\n * in the start parameter.\n *\n * @param {string} word         The word to be analyzed.\n * @param {int}    [start=0]    The first position in the word to start checking from.\n *\n * @returns {int} The position at which the next consonant occurs.\n */\nconst nextConsonantPosition = function(word, start) {\n  const length = word.length;\n\n  for (let position = start; position < length; position++) {\n    if (!isVowel(word[position])) {\n      return position;\n    }\n  }\n\n  return length;\n};\n\n/**\n * Replaces accented vowels with non-accented vowels in the input string.\n *\n * @param {string}   word     The word to be de-accentified.\n *\n * @returns {string} The de-accentified input word.\n */\nconst removeAccent = function(word) {\n  const accentedVowels = ['á', 'é', 'í', 'ó', 'ú'];\n  const vowels = ['a', 'e', 'i', 'o', 'u'];\n\n  for (let i = 0; i < accentedVowels.length; i++) {\n    word = word.replace(accentedVowels[i], vowels[i]);\n  }\n\n  return word;\n};\n\n/**\n * Checks whether the input word ends with the input suffix.\n *\n * @param {string} word   The word to be analyzed.\n * @param {string} suffix The suffix to check for.\n *\n * @returns {boolean} Whether the word ends with the suffix provided.\n */\nconst endsIn = function(word, suffix) {\n  if (word.length < suffix.length) {\n    return false;\n  }\n\n  return word.slice(-suffix.length) === suffix;\n};\n\n/**\n * Checks whether the input word ends with one of the input suffixes and returns the longest suffix matched.\n *\n * @param {string}   word     The word to be analyzed.\n * @param {string[]} suffixes The suffix to check for.\n *\n * @returns {string} The longest suffix matched in the word from the input list of suffixes.\n */\nconst endsInArr = function(word, suffixes) {\n  const matches = [];\n  for (const i in suffixes) {\n    if (endsIn(word, suffixes[i])) {\n      matches.push(suffixes[i]);\n    }\n  }\n  const longest = matches.sort(function(a, b) {\n    return b.length - a.length;\n  })[0];\n  if (longest) {\n    return longest;\n  }\n  return '';\n};\n\n/**\n * Checks whether a word is in the full-form exception list and if so returns the canonical stem.\n *\n * @param {string} word\t      The word to be checked.\n * @param {Object} exceptions The list of full-form exceptions to be checked in.\n *\n * @returns {null|string} The canonical stem or null if nothing was found.\n */\nconst checkWordInFullFormExceptions = function(word, exceptions) {\n  for (const paradigm of exceptions) {\n    if (paradigm[1].includes(word)) {\n      return paradigm[0];\n    }\n  }\n  return null;\n};\n\n/**\n * The function considers if the input word can be an adjective in -ano/anos/ana/anas and if so stems it.\n *\n * @param   {string}   word     The word to stem.\n * @param   {string}   r1Text   The R1 region of the word to stem.\n *\n * @returns {string}   A stemmed adjective or the input word, if it is not an adjective on -ano/os/a/as.\n */\nconst stemAdjectivesOnAn = function(word, r1Text) {\n  const adjectiveSuffix = findMatchingEndingInArray(r1Text, ['ano', 'anos', 'ana', 'anas']);\n\n  // Remove o/a/os/as\n  if (adjectiveSuffix !== '') {\n    if (word.endsWith('s')) {\n      return word.slice(0, word.length - 2);\n    }\n    return word.slice(0, word.length - 1);\n  }\n  return word;\n};\n\n/**\n * The function considers if the input word can be an adverb in -mente and if so stems it.\n *\n * @param   {string}   word                             The word to stem.\n * @param   {string}   r1Text                           The R1 region of the word to stem.\n * @param   {Object}   menteStemming                    An object containing information about how to stem mente-adverbs.\n * @param   {string[]} menteStemming.notMenteAdverbs    An array of words that look like mente-adverbs but are not.\n * @param   {Array}    menteStemming.menteToStem        An array of pairs of regexes to match.\n *\n * @returns {string}   A stemmed adverb or the input word, if it is not an adverb.\n */\nconst tryStemAsMente = function(word, r1Text, menteStemming) {\n  const suffix = endsIn(r1Text, 'mente');\n\n  // Immediately return the input word if no mente suffix is found or the word is in the stopList.\n  if (!suffix || menteStemming.notMenteAdverbs.includes(word)) {\n    return word;\n  }\n\n  return buildFormRule(word, createRulesFromArrays(menteStemming.menteToStem)) || word;\n};\n\n/**\n * The function considers if the input word can be a superlative and if so stems it.\n *\n * @param   {string}   word                                      The word to stem.\n * @param   {string}   r1Text                                    The R1 region of the word to stem.\n * @param   {Object}   superlativesStemming                      An object containing information about how to stem superlatives.\n * @param   {string[]} superlativesStemming.superlativeSuffixes  An array of suffixes possible in superlatives.\n * @param   {string[]} superlativesStemming.notSuperlatives      An array of words that look like superlatives but are not.\n * @param   {Array}    superlativesStemming.superlativeToStem    An array of pairs of regexes to match.\n *\n * @returns {string}   A stemmed superlative or the input word, if it is not a superlative.\n */\nconst tryStemAsSuperlative = function(word, r1Text, superlativesStemming) {\n  const superlativeSuffix = findMatchingEndingInArray(\n    r1Text,\n    superlativesStemming.superlativeSuffixes\n  );\n\n  // Immediately return the input word if no superlative suffix is found or the word is in the stopList.\n  if (superlativeSuffix === '' || superlativesStemming.notSuperlatives.includes(word)) {\n    return word;\n  }\n\n  return buildFormRule(word, createRulesFromArrays(superlativesStemming.superlativeToStem));\n};\n\n/**\n * The function considers if the input word can be a diminutive and if so stems it.\n * @param   {string}   word                                         The word to stem.\n * @param   {Object}   diminutivesStemming                          An object containing information about how to stem diminutives.\n * @param   {string[]} diminutivesStemming.notDiminutives           An array of words that look like diminutives but are not.\n * @param   {Array}    diminutivesStemming.diminutiveToStem         An array of pairs of regexes to match.\n * @param   {Array}    diminutivesStemming.irregularDiminutives     An array containing data for irregular diminutives.\n *\n * @returns {string}   A stemmed diminutive or the input word, if it is not a diminutive.\n */\nconst tryStemAsDiminutive = function(word, diminutivesStemming) {\n  const diminutiveSuffix = findMatchingEndingInArray(word, [\n    'ito',\n    'ita',\n    'itos',\n    'itas',\n    'íto',\n    'íta',\n    'ítos',\n    'ítas'\n  ]);\n\n  // Immediately return the input word if no diminutive suffix is found or the word is in the stopList.\n  if (diminutiveSuffix === '' || diminutivesStemming.notDiminutives.includes(word)) {\n    return word;\n  }\n\n  // Remove o/a/os/as and check irregular diminutives ending in -it-/-ít-\n  const wordWithoutEnding = word.endsWith('s')\n    ? word.slice(0, word.length - 2)\n    : word.slice(0, word.length - 1);\n\n  for (const paradigm of diminutivesStemming.irregularDiminutives) {\n    if (paradigm[1].includes(wordWithoutEnding)) {\n      return paradigm[0];\n    }\n  }\n\n  return buildFormRule(word, createRulesFromArrays(diminutivesStemming.diminutiveToStem)) || word;\n};\n\n/**\n * Checks whether a stem is in an exception list of verbs, nouns or adjectives with multiple stems and if so returns\n * the canonical stem.\n *\n * @param {string} stemmedWord\t            The stemmed word to be checked.\n * @param {Object} stemsThatBelongToOneWord The POS-specific data that shows how non-canonical stems should be canonicalized.\n *\n * @returns {null|string} The canonical stem or null if nothing was found.\n */\nconst canonicalizeStem = function(stemmedWord, stemsThatBelongToOneWord) {\n  // First check for nouns with multiple stems, which are only diminutives.\n  for (const paradigm of stemsThatBelongToOneWord.nouns) {\n    if (paradigm.includes(stemmedWord)) {\n      return paradigm[0];\n    }\n  }\n\n  // Second check for adjectives with multiple stems, which are only adjectives ending in -bl/-bil.\n  for (const paradigm of stemsThatBelongToOneWord.adjectives) {\n    if (paradigm.includes(stemmedWord)) {\n      return paradigm[0];\n    }\n  }\n\n  // Last check for verbs that have irregular forms.\n  for (const paradigm of stemsThatBelongToOneWord.verbs) {\n    if (paradigm.includes(stemmedWord)) {\n      return paradigm[0];\n    }\n  }\n  return null;\n};\n\n/**\n * Stems verb suffixes.\n *\n * @param {string}  word                The original word.\n * @param {string}  wordAfter1          The word after step 1.\n * @param {string}  rvText              The text of the RV.\n * @param {number}  rv                  The start position of the RV.\n *\n * @returns {string} The word with the verb suffixes removed (if applicable).\n */\nconst stemVerbSuffixes = function(word, wordAfter1, rvText, rv) {\n  // Do step 2a if no ending was removed by step 1.\n  const suf = findMatchingEndingInArray(rvText, [\n    'ya',\n    'ye',\n    'yan',\n    'yen',\n    'yeron',\n    'yendo',\n    'yo',\n    'yó',\n    'yas',\n    'yes',\n    'yais',\n    'yamos'\n  ]);\n\n  if (suf !== '' && word.slice(-suf.length - 1, -suf.length) === 'u') {\n    word = word.slice(0, -suf.length);\n  }\n\n  if (word !== wordAfter1) {\n    rvText = word.slice(rv);\n  }\n\n  // Do Step 2b if step 2a was done, but failed to remove a suffix.\n  if (word === wordAfter1) {\n    const suf11 = findMatchingEndingInArray(rvText, [\n      'arían',\n      'arías',\n      'arán',\n      'arás',\n      'aríais',\n      'aría',\n      'aréis',\n      'aríamos',\n      'aremos',\n      'ará',\n      'aré',\n      'erían',\n      'erías',\n      'erán',\n      'erás',\n      'eríais',\n      'ería',\n      'eréis',\n      'eríamos',\n      'eremos',\n      'erá',\n      'eré',\n      'irían',\n      'irías',\n      'irán',\n      'irás',\n      'iríais',\n      'iría',\n      'iréis',\n      'iríamos',\n      'iremos',\n      'irá',\n      'iré',\n      'aba',\n      'ada',\n      'ida',\n      'ía',\n      'ara',\n      'iera',\n      'ad',\n      'ed',\n      'id',\n      'ase',\n      'iese',\n      'aste',\n      'iste',\n      'an',\n      'aban',\n      'ían',\n      'aran',\n      'ieran',\n      'asen',\n      'iesen',\n      'aron',\n      'ieron',\n      'ado',\n      'ido',\n      'ando',\n      'iendo',\n      'ió',\n      'ar',\n      'er',\n      'ir',\n      'as',\n      'abas',\n      'adas',\n      'idas',\n      'ías',\n      'aras',\n      'ieras',\n      'ases',\n      'ieses',\n      'ís',\n      'áis',\n      'abais',\n      'íais',\n      'arais',\n      'ierais',\n      '  aseis',\n      'ieseis',\n      'asteis',\n      'isteis',\n      'ados',\n      'idos',\n      'amos',\n      'ábamos',\n      'íamos',\n      'imos',\n      'áramos',\n      'iéramos',\n      'iésemos',\n      'ásemos'\n    ]);\n    const suf12 = findMatchingEndingInArray(rvText, ['en', 'es', 'éis', 'emos']);\n    if (suf11 !== '') {\n      word = word.slice(0, -suf11.length);\n    } else if (suf12 !== '') {\n      word = word.slice(0, -suf12.length);\n      if (endsIn(word, 'gu')) {\n        word = word.slice(0, -1);\n      }\n    }\n  }\n\n  return word;\n};\n\n/**\n * Determines the R1, R2 and RV of the word.\n *\n * @param {string} word\t\tThe word checked.\n *\n * @returns {number[]} The array of R1, R2, and RV.\n */\nconst determineWordRegion = function(word) {\n  let r1 = word.length;\n  let r2 = word.length;\n  let rv = word.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 < word.length - 1 && r1 === word.length; i++) {\n    if (isVowel(word[i]) && !isVowel(word[i + 1])) {\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 < word.length - 1 && r2 === word.length; i++) {\n    if (isVowel(word[i]) && !isVowel(word[i + 1])) {\n      r2 = i + 2;\n    }\n  }\n\n  if (word.length > 3) {\n    if (!isVowel(word[1])) {\n      rv = nextVowelPosition(word, 2) + 1;\n    } else if (isVowel(word[0]) && isVowel(word[1])) {\n      rv = nextConsonantPosition(word, 2) + 1;\n    } else {\n      rv = 3;\n    }\n  }\n  return [r1, r2, rv];\n};\n\n/**\n * Stems enclitic pronouns.\n *\n * @param {string}  word            The word checked.\n * @param {string}  rvText\t        The text of RV.\n * @param {Object}  morphologyData  The Spanish morphology data.\n *\n * @returns {string} The word without the enclitic pronoun (if applicable).\n */\nconst stemEncliticPronouns = function(word, rvText, morphologyData) {\n  const pronounSuffix = [\n    'me',\n    'se',\n    'sela',\n    'selo',\n    'selas',\n    'selos',\n    'la',\n    'le',\n    'lo',\n    'las',\n    'les',\n    'los',\n    'nos'\n  ];\n  const pronounSuffixPre1 = ['iéndo', 'ándo', 'ár', 'ér', 'ír'];\n  const pronounSuffixPre2 = ['iendo', 'ando', 'ar', 'er', 'ir'];\n\n  const suffix = findMatchingEndingInArray(word, pronounSuffix);\n\n  if (\n    suffix !== '' &&\n    !morphologyData.wordsThatLookLikeButAreNot.notVerbsEndingInPersonalPronouns.includes(word)\n  ) {\n    let preSuffix = findMatchingEndingInArray(rvText.slice(0, -suffix.length), pronounSuffixPre1);\n\n    if (preSuffix === '') {\n      preSuffix = findMatchingEndingInArray(rvText.slice(0, -suffix.length), pronounSuffixPre2);\n\n      if (preSuffix !== '' || endsIn(word.slice(0, -suffix.length), 'uyendo')) {\n        word = word.slice(0, -suffix.length);\n      }\n    } else {\n      word = removeAccent(word.slice(0, -suffix.length));\n    }\n  }\n  return word;\n};\n\n/**\n * Stems derivational suffixes such as \"anza\", \"anzas\", \"ico\", \"ica\", \"icos\", \"icas\" etc. E.g. esperanza -> esper\n *\n * @param {string} word\t\tThe word checked.\n * @param {string} r2Text\tThe text of the R2.\n *\n * @returns {string} The word with removed derivational suffix.\n */\nconst stemDerivationalForms = function(word, r2Text) {\n  const suf1 = findMatchingEndingInArray(r2Text, [\n    'anza',\n    'anzas',\n    'ico',\n    'ica',\n    'icos',\n    'icas',\n    'ismo',\n    'ismos',\n    'able',\n    'ables',\n    'ible',\n    'ibles',\n    'ista',\n    'istas',\n    'oso',\n    'osa',\n    'osos',\n    'osas',\n    'amiento',\n    'amientos',\n    'imiento',\n    'imientos'\n  ]);\n  const suf2 = findMatchingEndingInArray(r2Text, [\n    'icadora',\n    'icador',\n    'icación',\n    'icadoras',\n    'icadores',\n    'icaciones',\n    'icante',\n    'icantes',\n    'icancia',\n    'icancias',\n    'adora',\n    'ador',\n    'ación',\n    'adoras',\n    'adores',\n    'aciones',\n    'ante',\n    'antes',\n    'ancia',\n    'ancias'\n  ]);\n  const suf3 = findMatchingEndingInArray(r2Text, ['logía', 'logías']);\n  const suf4 = findMatchingEndingInArray(r2Text, ['ución', 'uciones']);\n  const suf5 = findMatchingEndingInArray(r2Text, ['encia', 'encias']);\n  const suf9 = findMatchingEndingInArray(r2Text, [\n    'abilidad',\n    'abilidades',\n    'icidad',\n    'icidades',\n    'ividad',\n    'ividades',\n    'idad',\n    'idades'\n  ]);\n  const suf10 = findMatchingEndingInArray(r2Text, [\n    'ativa',\n    'ativo',\n    'ativas',\n    'ativos',\n    'iva',\n    'ivo',\n    'ivas',\n    'ivos'\n  ]);\n\n  if (suf1 !== '') {\n    word = word.slice(0, -suf1.length);\n  } else if (suf2 !== '') {\n    word = word.slice(0, -suf2.length);\n  } else if (suf3 !== '') {\n    word = word.slice(0, -suf3.length) + 'log';\n  } else if (suf4 !== '') {\n    word = word.slice(0, -suf4.length) + 'u';\n  } else if (suf5 !== '') {\n    word = word.slice(0, -suf5.length) + 'ente';\n  } else if (suf9 !== '') {\n    word = word.slice(0, -suf9.length);\n  } else if (suf10 !== '') {\n    word = word.slice(0, -suf10.length);\n  }\n  return word;\n};\n\n/**\n * Stems suffixes \"os\", \"a\", \"o\", \"á\", \"í\", \"ó\", \"e\", and \"é\" in RV. e.g. regla -> regl\n *\n * @param {string} word\t\t\t\t\tThe word checked.\n * @param {string} rvText\t\t\t\tThe text of RV.\n * @param {number} rv                  \tThe start position of the RV.\n * @returns {string} The word with removed suffix.\n */\nconst stemGenericSuffix = function(word, rvText, rv) {\n  const suf13 = endsInArr(rvText, ['os', 'a', 'o', 'á', 'í', 'ó']);\n  if (suf13 !== '') {\n    word = word.slice(0, -suf13.length);\n  } else if (endsInArr(rvText, ['e', 'é']) !== '') {\n    word = word.slice(0, -1);\n    rvText = word.slice(rv);\n    if (endsIn(rvText, 'u') && endsIn(word, 'gu')) {\n      word = word.slice(0, -1);\n    }\n  }\n  return word;\n};\n\n/**\n * Stems Spanish words.\n *\n * @param {string} word            The word to stem.\n * @param {Object} morphologyData  The Spanish morphology data.\n *\n * @returns {string} The stemmed word.\n */\nexport default function stem(word, morphologyData) {\n  word.toLowerCase();\n  const ifException = checkWordInFullFormExceptions(\n    word,\n    morphologyData.exceptionStemsWithFullForms\n  );\n  if (ifException) {\n    return ifException;\n  }\n\n  const nonPluralsOnS = morphologyData.wordsThatLookLikeButAreNot.nonPluralsOnS;\n  if (nonPluralsOnS.includes(word)) {\n    return removeAccent(word);\n  }\n\n  const length = word.length;\n  if (length < 2) {\n    return removeAccent(word);\n  }\n\n  // Determine the r1, r2 and rv of the word\n  const [r1, r2, rv] = determineWordRegion(word);\n\n  let r1Text = word.slice(r1);\n  let r2Text = word.slice(r2);\n  let rvText = word.slice(rv);\n  const originalWord = word;\n\n  const wordAfterAdjectiveOnAnCheck = stemAdjectivesOnAn(word, r1Text);\n  if (wordAfterAdjectiveOnAnCheck !== word) {\n    return removeAccent(wordAfterAdjectiveOnAnCheck);\n  }\n\n  /*\n   * Step 0:\n   * Stem enclitic pronouns.\n   */\n  word = stemEncliticPronouns(word, rvText, morphologyData);\n\n  if (word !== originalWord) {\n    r1Text = word.slice(r1);\n    r2Text = word.slice(r2);\n    rvText = word.slice(rv);\n  }\n\n  // The word after removing enclitic pronouns.\n  const wordAfter0 = word;\n\n  /*\n   * Step 1:\n   * If the word ends in derivational suffixes such as \"anza\", \"anzas\", \"ico\", \"ica\", \"icos\", \"icas\" etc. the suffix will be stemmed here.\n   */\n  word = stemDerivationalForms(word, r2Text);\n\n  // Check if the word is an adverb in -mente. Stem it as a adverb if so, and immediately return the result.\n  const ifMente = tryStemAsMente(word, r1Text, morphologyData.menteStemming);\n  if (ifMente !== word) {\n    return removeAccent(ifMente);\n  }\n\n  // Check if the word is a superlative. Stem it as a superlative if so, and immediately return the result.\n  const ifSuperlative = tryStemAsSuperlative(word, r1Text, morphologyData.superlativesStemming);\n  if (ifSuperlative !== word) {\n    return removeAccent(ifSuperlative);\n  }\n\n  // Check if the word is a diminutive. Stem it as a diminutive if so, and immediately return the result.\n  const ifDiminutive = tryStemAsDiminutive(word, morphologyData.diminutivesStemming);\n  if (ifDiminutive !== word) {\n    return removeAccent(ifDiminutive);\n  }\n\n  // Adjust RV text if the word has been changed after derivational suffixes have been removed.\n  if (word !== wordAfter0) {\n    rvText = word.slice(rv);\n  }\n\n  // The word after removing derivational suffixes.\n  const wordAfter1 = word;\n  /*\n   * Step 2a and 2b:\n   * Stem verb suffixes.\n   */\n  let isNonVerb = false;\n  const notVerbForms = morphologyData.wordsThatLookLikeButAreNot.notVerbForms;\n\n  // Stem verbal suffixes if no derivational suffix was detected and removed.\n  if (wordAfter0 === wordAfter1) {\n    // If the word ends in -s, it is removed before checking the non-verbs list, as the list does not include plural forms.\n    let wordWithoutS = word;\n    if (word.endsWith('s')) {\n      wordWithoutS = word.slice(0, -1);\n    }\n\n    if (notVerbForms.includes(wordWithoutS)) {\n      /*\n       * If the word without -s is matched on the non-verbs list, we can perform the next (non-verb) stemming steps\n       * with the -s removed. This is because all possible non-verb suffixes ending in -s also have an equivalent\n       * without the -s (e.g. -as/a; -es/e), so will be stemmed after stripping the -s.\n       */\n      word = wordWithoutS;\n      isNonVerb = true;\n    } else {\n      word = stemVerbSuffixes(word, wordAfter1, rvText, rv);\n    }\n  }\n\n  // Adjust RV text after derivational suffixes have been removed.\n  rvText = word.slice(rv);\n\n  /*\n   * Step 4:\n   * Stem generic suffixes;\n   * If the word ends in \"os\", \"a\", \"o\", \"á\", \"í\", \"ó\", \"e\", \"é\", the suffix will be removed here.\n   */\n  word = stemGenericSuffix(word, rvText, rv);\n\n  // Check if the stemmed word is on the list of words with multiple stems. If so, return the canonical stem.\n  const canonicalStem = canonicalizeStem(word, morphologyData.stemsThatBelongToOneWord);\n  if (canonicalStem) {\n    return canonicalStem;\n  }\n\n  if (!isNonVerb) {\n    const modifiedVerbStem = checkVerbStemModifications(word, morphologyData);\n    if (modifiedVerbStem) {\n      // If on the list of words that look like verbs [notVerbForms] do not perform stem modification.\n      // Do not perform at the beginning of the word and if word does not have verb suffix.\n      return modifiedVerbStem;\n    }\n  }\n\n  return removeAccent(word);\n}\n"],"mappings":"AAAA;AACA;AACA,SAAQA,kBAAkB;AAC1B,OAAOC,0BAA0B;AAEjC,MAAM;EAACC,aAAa;EAAEC,qBAAqB;EAAEC;AAAyB,CAAC,GAAGJ,kBAAkB;;AAE5F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMK,OAAO,GAAG,SAAAA,CAASC,MAAM,EAAE;EAC/B,MAAMC,KAAK,GAAG,gBAAgB;EAE9B,OAAOA,KAAK,CAACC,IAAI,CAACF,MAAM,CAAC;AAC3B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,iBAAiB,GAAG,SAAAA,CAASC,IAAI,EAAEC,KAAK,EAAE;EAC9C,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,CAAC,EAAE;MAC3B,OAAOA,QAAQ;IACjB;EACF;EAEA,OAAOD,MAAM;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,qBAAqB,GAAG,SAAAA,CAASJ,IAAI,EAAEC,KAAK,EAAE;EAClD,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,CAAC,EAAE;MAC5B,OAAOA,QAAQ;IACjB;EACF;EAEA,OAAOD,MAAM;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,YAAY,GAAG,SAAAA,CAASL,IAAI,EAAE;EAClC,MAAMM,cAAc,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;EAChD,MAAMC,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC;EAExC,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,cAAc,CAACJ,MAAM,EAAEM,CAAC,EAAE,EAAE;IAC9CR,IAAI,GAAGA,IAAI,CAACS,OAAO,CAACH,cAAc,CAACE,CAAC,CAAC,EAAED,MAAM,CAACC,CAAC,CAAC,CAAC;EACnD;EAEA,OAAOR,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMU,MAAM,GAAG,SAAAA,CAASV,IAAI,EAAEW,MAAM,EAAE;EACpC,IAAIX,IAAI,CAACE,MAAM,GAAGS,MAAM,CAACT,MAAM,EAAE;IAC/B,OAAO,KAAK;EACd;EAEA,OAAOF,IAAI,CAACY,KAAK,CAAC,CAACD,MAAM,CAACT,MAAM,CAAC,KAAKS,MAAM;AAC9C,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,SAAS,GAAG,SAAAA,CAASb,IAAI,EAAEc,QAAQ,EAAE;EACzC,MAAMC,OAAO,GAAG,EAAE;EAClB,KAAK,MAAMP,CAAC,IAAIM,QAAQ,EAAE;IACxB,IAAIJ,MAAM,CAACV,IAAI,EAAEc,QAAQ,CAACN,CAAC,CAAC,CAAC,EAAE;MAC7BO,OAAO,CAACC,IAAI,CAACF,QAAQ,CAACN,CAAC,CAAC,CAAC;IAC3B;EACF;EACA,MAAMS,OAAO,GAAGF,OAAO,CAACG,IAAI,CAAC,UAASC,CAAC,EAAEC,CAAC,EAAE;IAC1C,OAAOA,CAAC,CAAClB,MAAM,GAAGiB,CAAC,CAACjB,MAAM;EAC5B,CAAC,CAAC,CAAC,CAAC,CAAC;EACL,IAAIe,OAAO,EAAE;IACX,OAAOA,OAAO;EAChB;EACA,OAAO,EAAE;AACX,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMI,6BAA6B,GAAG,SAAAA,CAASrB,IAAI,EAAEsB,UAAU,EAAE;EAC/D,KAAK,MAAMC,QAAQ,IAAID,UAAU,EAAE;IACjC,IAAIC,QAAQ,CAAC,CAAC,CAAC,CAACC,QAAQ,CAACxB,IAAI,CAAC,EAAE;MAC9B,OAAOuB,QAAQ,CAAC,CAAC,CAAC;IACpB;EACF;EACA,OAAO,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,kBAAkB,GAAG,SAAAA,CAASzB,IAAI,EAAE0B,MAAM,EAAE;EAChD,MAAMC,eAAe,GAAGjC,yBAAyB,CAACgC,MAAM,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;;EAEzF;EACA,IAAIC,eAAe,KAAK,EAAE,EAAE;IAC1B,IAAI3B,IAAI,CAAC4B,QAAQ,CAAC,GAAG,CAAC,EAAE;MACtB,OAAO5B,IAAI,CAACY,KAAK,CAAC,CAAC,EAAEZ,IAAI,CAACE,MAAM,GAAG,CAAC,CAAC;IACvC;IACA,OAAOF,IAAI,CAACY,KAAK,CAAC,CAAC,EAAEZ,IAAI,CAACE,MAAM,GAAG,CAAC,CAAC;EACvC;EACA,OAAOF,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM6B,cAAc,GAAG,SAAAA,CAAS7B,IAAI,EAAE0B,MAAM,EAAEI,aAAa,EAAE;EAC3D,MAAMnB,MAAM,GAAGD,MAAM,CAACgB,MAAM,EAAE,OAAO,CAAC;;EAEtC;EACA,IAAI,CAACf,MAAM,IAAImB,aAAa,CAACC,eAAe,CAACP,QAAQ,CAACxB,IAAI,CAAC,EAAE;IAC3D,OAAOA,IAAI;EACb;EAEA,OAAOR,aAAa,CAACQ,IAAI,EAAEP,qBAAqB,CAACqC,aAAa,CAACE,WAAW,CAAC,CAAC,IAAIhC,IAAI;AACtF,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMiC,oBAAoB,GAAG,SAAAA,CAASjC,IAAI,EAAE0B,MAAM,EAAEQ,oBAAoB,EAAE;EACxE,MAAMC,iBAAiB,GAAGzC,yBAAyB,CACjDgC,MAAM,EACNQ,oBAAoB,CAACE,mBACvB,CAAC;;EAED;EACA,IAAID,iBAAiB,KAAK,EAAE,IAAID,oBAAoB,CAACG,eAAe,CAACb,QAAQ,CAACxB,IAAI,CAAC,EAAE;IACnF,OAAOA,IAAI;EACb;EAEA,OAAOR,aAAa,CAACQ,IAAI,EAAEP,qBAAqB,CAACyC,oBAAoB,CAACI,iBAAiB,CAAC,CAAC;AAC3F,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,mBAAmB,GAAG,SAAAA,CAASvC,IAAI,EAAEwC,mBAAmB,EAAE;EAC9D,MAAMC,gBAAgB,GAAG/C,yBAAyB,CAACM,IAAI,EAAE,CACvD,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,CACP,CAAC;;EAEF;EACA,IAAIyC,gBAAgB,KAAK,EAAE,IAAID,mBAAmB,CAACE,cAAc,CAAClB,QAAQ,CAACxB,IAAI,CAAC,EAAE;IAChF,OAAOA,IAAI;EACb;;EAEA;EACA,MAAM2C,iBAAiB,GAAG3C,IAAI,CAAC4B,QAAQ,CAAC,GAAG,CAAC,GACxC5B,IAAI,CAACY,KAAK,CAAC,CAAC,EAAEZ,IAAI,CAACE,MAAM,GAAG,CAAC,CAAC,GAC9BF,IAAI,CAACY,KAAK,CAAC,CAAC,EAAEZ,IAAI,CAACE,MAAM,GAAG,CAAC,CAAC;EAElC,KAAK,MAAMqB,QAAQ,IAAIiB,mBAAmB,CAACI,oBAAoB,EAAE;IAC/D,IAAIrB,QAAQ,CAAC,CAAC,CAAC,CAACC,QAAQ,CAACmB,iBAAiB,CAAC,EAAE;MAC3C,OAAOpB,QAAQ,CAAC,CAAC,CAAC;IACpB;EACF;EAEA,OAAO/B,aAAa,CAACQ,IAAI,EAAEP,qBAAqB,CAAC+C,mBAAmB,CAACK,gBAAgB,CAAC,CAAC,IAAI7C,IAAI;AACjG,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM8C,gBAAgB,GAAG,SAAAA,CAASC,WAAW,EAAEC,wBAAwB,EAAE;EACvE;EACA,KAAK,MAAMzB,QAAQ,IAAIyB,wBAAwB,CAACC,KAAK,EAAE;IACrD,IAAI1B,QAAQ,CAACC,QAAQ,CAACuB,WAAW,CAAC,EAAE;MAClC,OAAOxB,QAAQ,CAAC,CAAC,CAAC;IACpB;EACF;;EAEA;EACA,KAAK,MAAMA,QAAQ,IAAIyB,wBAAwB,CAACE,UAAU,EAAE;IAC1D,IAAI3B,QAAQ,CAACC,QAAQ,CAACuB,WAAW,CAAC,EAAE;MAClC,OAAOxB,QAAQ,CAAC,CAAC,CAAC;IACpB;EACF;;EAEA;EACA,KAAK,MAAMA,QAAQ,IAAIyB,wBAAwB,CAACG,KAAK,EAAE;IACrD,IAAI5B,QAAQ,CAACC,QAAQ,CAACuB,WAAW,CAAC,EAAE;MAClC,OAAOxB,QAAQ,CAAC,CAAC,CAAC;IACpB;EACF;EACA,OAAO,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM6B,gBAAgB,GAAG,SAAAA,CAASpD,IAAI,EAAEqD,UAAU,EAAEC,MAAM,EAAEC,EAAE,EAAE;EAC9D;EACA,MAAMC,GAAG,GAAG9D,yBAAyB,CAAC4D,MAAM,EAAE,CAC5C,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,KAAK,EACL,OAAO,EACP,OAAO,EACP,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,KAAK,EACL,MAAM,EACN,OAAO,CACR,CAAC;EAEF,IAAIE,GAAG,KAAK,EAAE,IAAIxD,IAAI,CAACY,KAAK,CAAC,CAAC4C,GAAG,CAACtD,MAAM,GAAG,CAAC,EAAE,CAACsD,GAAG,CAACtD,MAAM,CAAC,KAAK,GAAG,EAAE;IAClEF,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC4C,GAAG,CAACtD,MAAM,CAAC;EACnC;EAEA,IAAIF,IAAI,KAAKqD,UAAU,EAAE;IACvBC,MAAM,GAAGtD,IAAI,CAACY,KAAK,CAAC2C,EAAE,CAAC;EACzB;;EAEA;EACA,IAAIvD,IAAI,KAAKqD,UAAU,EAAE;IACvB,MAAMI,KAAK,GAAG/D,yBAAyB,CAAC4D,MAAM,EAAE,CAC9C,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,QAAQ,EACR,MAAM,EACN,OAAO,EACP,SAAS,EACT,QAAQ,EACR,KAAK,EACL,KAAK,EACL,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,QAAQ,EACR,MAAM,EACN,OAAO,EACP,SAAS,EACT,QAAQ,EACR,KAAK,EACL,KAAK,EACL,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,QAAQ,EACR,MAAM,EACN,OAAO,EACP,SAAS,EACT,QAAQ,EACR,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,IAAI,EACJ,KAAK,EACL,MAAM,EACN,IAAI,EACJ,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,MAAM,EACN,MAAM,EACN,MAAM,EACN,IAAI,EACJ,MAAM,EACN,KAAK,EACL,MAAM,EACN,OAAO,EACP,MAAM,EACN,OAAO,EACP,MAAM,EACN,OAAO,EACP,KAAK,EACL,KAAK,EACL,MAAM,EACN,OAAO,EACP,IAAI,EACJ,IAAI,EACJ,IAAI,EACJ,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,MAAM,EACN,MAAM,EACN,KAAK,EACL,MAAM,EACN,OAAO,EACP,MAAM,EACN,OAAO,EACP,IAAI,EACJ,KAAK,EACL,OAAO,EACP,MAAM,EACN,OAAO,EACP,QAAQ,EACR,SAAS,EACT,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,MAAM,EACN,MAAM,EACN,MAAM,EACN,QAAQ,EACR,OAAO,EACP,MAAM,EACN,QAAQ,EACR,SAAS,EACT,SAAS,EACT,QAAQ,CACT,CAAC;IACF,MAAMI,KAAK,GAAGhE,yBAAyB,CAAC4D,MAAM,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC;IAC5E,IAAIG,KAAK,KAAK,EAAE,EAAE;MAChBzD,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC6C,KAAK,CAACvD,MAAM,CAAC;IACrC,CAAC,MAAM,IAAIwD,KAAK,KAAK,EAAE,EAAE;MACvB1D,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC8C,KAAK,CAACxD,MAAM,CAAC;MACnC,IAAIQ,MAAM,CAACV,IAAI,EAAE,IAAI,CAAC,EAAE;QACtBA,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;MAC1B;IACF;EACF;EAEA,OAAOZ,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM2D,mBAAmB,GAAG,SAAAA,CAAS3D,IAAI,EAAE;EACzC,IAAI4D,EAAE,GAAG5D,IAAI,CAACE,MAAM;EACpB,IAAI2D,EAAE,GAAG7D,IAAI,CAACE,MAAM;EACpB,IAAIqD,EAAE,GAAGvD,IAAI,CAACE,MAAM;;EAEpB;AACF;AACA;AACA;EACE,KAAK,IAAIM,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGR,IAAI,CAACE,MAAM,GAAG,CAAC,IAAI0D,EAAE,KAAK5D,IAAI,CAACE,MAAM,EAAEM,CAAC,EAAE,EAAE;IAC9D,IAAIb,OAAO,CAACK,IAAI,CAACQ,CAAC,CAAC,CAAC,IAAI,CAACb,OAAO,CAACK,IAAI,CAACQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;MAC7CoD,EAAE,GAAGpD,CAAC,GAAG,CAAC;IACZ;EACF;;EAEA;AACF;AACA;AACA;EACE,KAAK,IAAIA,CAAC,GAAGoD,EAAE,EAAEpD,CAAC,GAAGR,IAAI,CAACE,MAAM,GAAG,CAAC,IAAI2D,EAAE,KAAK7D,IAAI,CAACE,MAAM,EAAEM,CAAC,EAAE,EAAE;IAC/D,IAAIb,OAAO,CAACK,IAAI,CAACQ,CAAC,CAAC,CAAC,IAAI,CAACb,OAAO,CAACK,IAAI,CAACQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;MAC7CqD,EAAE,GAAGrD,CAAC,GAAG,CAAC;IACZ;EACF;EAEA,IAAIR,IAAI,CAACE,MAAM,GAAG,CAAC,EAAE;IACnB,IAAI,CAACP,OAAO,CAACK,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;MACrBuD,EAAE,GAAGxD,iBAAiB,CAACC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC;IACrC,CAAC,MAAM,IAAIL,OAAO,CAACK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAIL,OAAO,CAACK,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;MAC/CuD,EAAE,GAAGnD,qBAAqB,CAACJ,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC;IACzC,CAAC,MAAM;MACLuD,EAAE,GAAG,CAAC;IACR;EACF;EACA,OAAO,CAACK,EAAE,EAAEC,EAAE,EAAEN,EAAE,CAAC;AACrB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMO,oBAAoB,GAAG,SAAAA,CAAS9D,IAAI,EAAEsD,MAAM,EAAES,cAAc,EAAE;EAClE,MAAMC,aAAa,GAAG,CACpB,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,MAAM,EACN,OAAO,EACP,OAAO,EACP,IAAI,EACJ,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,CACN;EACD,MAAMC,iBAAiB,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC;EAC7D,MAAMC,iBAAiB,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC;EAE7D,MAAMvD,MAAM,GAAGjB,yBAAyB,CAACM,IAAI,EAAEgE,aAAa,CAAC;EAE7D,IACErD,MAAM,KAAK,EAAE,IACb,CAACoD,cAAc,CAACI,0BAA0B,CAACC,gCAAgC,CAAC5C,QAAQ,CAACxB,IAAI,CAAC,EAC1F;IACA,IAAIqE,SAAS,GAAG3E,yBAAyB,CAAC4D,MAAM,CAAC1C,KAAK,CAAC,CAAC,EAAE,CAACD,MAAM,CAACT,MAAM,CAAC,EAAE+D,iBAAiB,CAAC;IAE7F,IAAII,SAAS,KAAK,EAAE,EAAE;MACpBA,SAAS,GAAG3E,yBAAyB,CAAC4D,MAAM,CAAC1C,KAAK,CAAC,CAAC,EAAE,CAACD,MAAM,CAACT,MAAM,CAAC,EAAEgE,iBAAiB,CAAC;MAEzF,IAAIG,SAAS,KAAK,EAAE,IAAI3D,MAAM,CAACV,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAACD,MAAM,CAACT,MAAM,CAAC,EAAE,QAAQ,CAAC,EAAE;QACvEF,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAACD,MAAM,CAACT,MAAM,CAAC;MACtC;IACF,CAAC,MAAM;MACLF,IAAI,GAAGK,YAAY,CAACL,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAACD,MAAM,CAACT,MAAM,CAAC,CAAC;IACpD;EACF;EACA,OAAOF,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMsE,qBAAqB,GAAG,SAAAA,CAAStE,IAAI,EAAEuE,MAAM,EAAE;EACnD,MAAMC,IAAI,GAAG9E,yBAAyB,CAAC6E,MAAM,EAAE,CAC7C,MAAM,EACN,OAAO,EACP,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,OAAO,EACP,MAAM,EACN,OAAO,EACP,MAAM,EACN,OAAO,EACP,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,SAAS,EACT,UAAU,EACV,SAAS,EACT,UAAU,CACX,CAAC;EACF,MAAME,IAAI,GAAG/E,yBAAyB,CAAC6E,MAAM,EAAE,CAC7C,SAAS,EACT,QAAQ,EACR,SAAS,EACT,UAAU,EACV,UAAU,EACV,WAAW,EACX,QAAQ,EACR,SAAS,EACT,SAAS,EACT,UAAU,EACV,OAAO,EACP,MAAM,EACN,OAAO,EACP,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,MAAM,EACN,OAAO,EACP,OAAO,EACP,QAAQ,CACT,CAAC;EACF,MAAMG,IAAI,GAAGhF,yBAAyB,CAAC6E,MAAM,EAAE,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;EACnE,MAAMI,IAAI,GAAGjF,yBAAyB,CAAC6E,MAAM,EAAE,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;EACpE,MAAMK,IAAI,GAAGlF,yBAAyB,CAAC6E,MAAM,EAAE,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;EACnE,MAAMM,IAAI,GAAGnF,yBAAyB,CAAC6E,MAAM,EAAE,CAC7C,UAAU,EACV,YAAY,EACZ,QAAQ,EACR,UAAU,EACV,QAAQ,EACR,UAAU,EACV,MAAM,EACN,QAAQ,CACT,CAAC;EACF,MAAMO,KAAK,GAAGpF,yBAAyB,CAAC6E,MAAM,EAAE,CAC9C,OAAO,EACP,OAAO,EACP,QAAQ,EACR,QAAQ,EACR,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,CACP,CAAC;EAEF,IAAIC,IAAI,KAAK,EAAE,EAAE;IACfxE,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC4D,IAAI,CAACtE,MAAM,CAAC;EACpC,CAAC,MAAM,IAAIuE,IAAI,KAAK,EAAE,EAAE;IACtBzE,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC6D,IAAI,CAACvE,MAAM,CAAC;EACpC,CAAC,MAAM,IAAIwE,IAAI,KAAK,EAAE,EAAE;IACtB1E,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC8D,IAAI,CAACxE,MAAM,CAAC,GAAG,KAAK;EAC5C,CAAC,MAAM,IAAIyE,IAAI,KAAK,EAAE,EAAE;IACtB3E,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC+D,IAAI,CAACzE,MAAM,CAAC,GAAG,GAAG;EAC1C,CAAC,MAAM,IAAI0E,IAAI,KAAK,EAAE,EAAE;IACtB5E,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAACgE,IAAI,CAAC1E,MAAM,CAAC,GAAG,MAAM;EAC7C,CAAC,MAAM,IAAI2E,IAAI,KAAK,EAAE,EAAE;IACtB7E,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAACiE,IAAI,CAAC3E,MAAM,CAAC;EACpC,CAAC,MAAM,IAAI4E,KAAK,KAAK,EAAE,EAAE;IACvB9E,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAACkE,KAAK,CAAC5E,MAAM,CAAC;EACrC;EACA,OAAOF,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM+E,iBAAiB,GAAG,SAAAA,CAAS/E,IAAI,EAAEsD,MAAM,EAAEC,EAAE,EAAE;EACnD,MAAMyB,KAAK,GAAGnE,SAAS,CAACyC,MAAM,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;EAChE,IAAI0B,KAAK,KAAK,EAAE,EAAE;IAChBhF,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAACoE,KAAK,CAAC9E,MAAM,CAAC;EACrC,CAAC,MAAM,IAAIW,SAAS,CAACyC,MAAM,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;IAC/CtD,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxB0C,MAAM,GAAGtD,IAAI,CAACY,KAAK,CAAC2C,EAAE,CAAC;IACvB,IAAI7C,MAAM,CAAC4C,MAAM,EAAE,GAAG,CAAC,IAAI5C,MAAM,CAACV,IAAI,EAAE,IAAI,CAAC,EAAE;MAC7CA,IAAI,GAAGA,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1B;EACF;EACA,OAAOZ,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASiF,IAAIA,CAACjF,IAAI,EAAE+D,cAAc,EAAE;EACjD/D,IAAI,CAACkF,WAAW,CAAC,CAAC;EAClB,MAAMC,WAAW,GAAG9D,6BAA6B,CAC/CrB,IAAI,EACJ+D,cAAc,CAACqB,2BACjB,CAAC;EACD,IAAID,WAAW,EAAE;IACf,OAAOA,WAAW;EACpB;EAEA,MAAME,aAAa,GAAGtB,cAAc,CAACI,0BAA0B,CAACkB,aAAa;EAC7E,IAAIA,aAAa,CAAC7D,QAAQ,CAACxB,IAAI,CAAC,EAAE;IAChC,OAAOK,YAAY,CAACL,IAAI,CAAC;EAC3B;EAEA,MAAME,MAAM,GAAGF,IAAI,CAACE,MAAM;EAC1B,IAAIA,MAAM,GAAG,CAAC,EAAE;IACd,OAAOG,YAAY,CAACL,IAAI,CAAC;EAC3B;;EAEA;EACA,MAAM,CAAC4D,EAAE,EAAEC,EAAE,EAAEN,EAAE,CAAC,GAAGI,mBAAmB,CAAC3D,IAAI,CAAC;EAE9C,IAAI0B,MAAM,GAAG1B,IAAI,CAACY,KAAK,CAACgD,EAAE,CAAC;EAC3B,IAAIW,MAAM,GAAGvE,IAAI,CAACY,KAAK,CAACiD,EAAE,CAAC;EAC3B,IAAIP,MAAM,GAAGtD,IAAI,CAACY,KAAK,CAAC2C,EAAE,CAAC;EAC3B,MAAM+B,YAAY,GAAGtF,IAAI;EAEzB,MAAMuF,2BAA2B,GAAG9D,kBAAkB,CAACzB,IAAI,EAAE0B,MAAM,CAAC;EACpE,IAAI6D,2BAA2B,KAAKvF,IAAI,EAAE;IACxC,OAAOK,YAAY,CAACkF,2BAA2B,CAAC;EAClD;;EAEA;AACF;AACA;AACA;EACEvF,IAAI,GAAG8D,oBAAoB,CAAC9D,IAAI,EAAEsD,MAAM,EAAES,cAAc,CAAC;EAEzD,IAAI/D,IAAI,KAAKsF,YAAY,EAAE;IACzB5D,MAAM,GAAG1B,IAAI,CAACY,KAAK,CAACgD,EAAE,CAAC;IACvBW,MAAM,GAAGvE,IAAI,CAACY,KAAK,CAACiD,EAAE,CAAC;IACvBP,MAAM,GAAGtD,IAAI,CAACY,KAAK,CAAC2C,EAAE,CAAC;EACzB;;EAEA;EACA,MAAMiC,UAAU,GAAGxF,IAAI;;EAEvB;AACF;AACA;AACA;EACEA,IAAI,GAAGsE,qBAAqB,CAACtE,IAAI,EAAEuE,MAAM,CAAC;;EAE1C;EACA,MAAMkB,OAAO,GAAG5D,cAAc,CAAC7B,IAAI,EAAE0B,MAAM,EAAEqC,cAAc,CAACjC,aAAa,CAAC;EAC1E,IAAI2D,OAAO,KAAKzF,IAAI,EAAE;IACpB,OAAOK,YAAY,CAACoF,OAAO,CAAC;EAC9B;;EAEA;EACA,MAAMC,aAAa,GAAGzD,oBAAoB,CAACjC,IAAI,EAAE0B,MAAM,EAAEqC,cAAc,CAAC7B,oBAAoB,CAAC;EAC7F,IAAIwD,aAAa,KAAK1F,IAAI,EAAE;IAC1B,OAAOK,YAAY,CAACqF,aAAa,CAAC;EACpC;;EAEA;EACA,MAAMC,YAAY,GAAGpD,mBAAmB,CAACvC,IAAI,EAAE+D,cAAc,CAACvB,mBAAmB,CAAC;EAClF,IAAImD,YAAY,KAAK3F,IAAI,EAAE;IACzB,OAAOK,YAAY,CAACsF,YAAY,CAAC;EACnC;;EAEA;EACA,IAAI3F,IAAI,KAAKwF,UAAU,EAAE;IACvBlC,MAAM,GAAGtD,IAAI,CAACY,KAAK,CAAC2C,EAAE,CAAC;EACzB;;EAEA;EACA,MAAMF,UAAU,GAAGrD,IAAI;EACvB;AACF;AACA;AACA;EACE,IAAI4F,SAAS,GAAG,KAAK;EACrB,MAAMC,YAAY,GAAG9B,cAAc,CAACI,0BAA0B,CAAC0B,YAAY;;EAE3E;EACA,IAAIL,UAAU,KAAKnC,UAAU,EAAE;IAC7B;IACA,IAAIyC,YAAY,GAAG9F,IAAI;IACvB,IAAIA,IAAI,CAAC4B,QAAQ,CAAC,GAAG,CAAC,EAAE;MACtBkE,YAAY,GAAG9F,IAAI,CAACY,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC;IAEA,IAAIiF,YAAY,CAACrE,QAAQ,CAACsE,YAAY,CAAC,EAAE;MACvC;AACN;AACA;AACA;AACA;MACM9F,IAAI,GAAG8F,YAAY;MACnBF,SAAS,GAAG,IAAI;IAClB,CAAC,MAAM;MACL5F,IAAI,GAAGoD,gBAAgB,CAACpD,IAAI,EAAEqD,UAAU,EAAEC,MAAM,EAAEC,EAAE,CAAC;IACvD;EACF;;EAEA;EACAD,MAAM,GAAGtD,IAAI,CAACY,KAAK,CAAC2C,EAAE,CAAC;;EAEvB;AACF;AACA;AACA;AACA;EACEvD,IAAI,GAAG+E,iBAAiB,CAAC/E,IAAI,EAAEsD,MAAM,EAAEC,EAAE,CAAC;;EAE1C;EACA,MAAMwC,aAAa,GAAGjD,gBAAgB,CAAC9C,IAAI,EAAE+D,cAAc,CAACf,wBAAwB,CAAC;EACrF,IAAI+C,aAAa,EAAE;IACjB,OAAOA,aAAa;EACtB;EAEA,IAAI,CAACH,SAAS,EAAE;IACd,MAAMI,gBAAgB,GAAGzG,0BAA0B,CAACS,IAAI,EAAE+D,cAAc,CAAC;IACzE,IAAIiC,gBAAgB,EAAE;MACpB;MACA;MACA,OAAOA,gBAAgB;IACzB;EACF;EAEA,OAAO3F,YAAY,CAACL,IAAI,CAAC;AAC3B","ignoreList":[]}