axyseo 2.0.0-alpha.1

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

@@ -0,0 +1,347 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = stem;
+exports.matchAndStemWord = matchAndStemWord;
+exports.matchAndStemWordWithOneRegex = matchAndStemWordWithOneRegex;
+exports.matchAndStemWordWithRegexArray = matchAndStemWordWithRegexArray;
+/* eslint-disable max-statements,complexity */
+/**
+ * MIT License
+ *
+ * Copyright (c) 2015 apmats <amatsagkas@gmail.com>
+ *
+ * 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.
+ *
+ * https://github.com/Apmats/greekstemmerjs
+ */
+
+/**
+ * Matches word with an array of regexes and stems the word if there is any match. Further processes the stemmed word
+ * if it matches one of the regexes in the second array by attaching an additional ending.
+ *
+ * @param {string}  word        The word to check.
+ * @param {Array}   regexes1    The first array of regexes to check.
+ * @param {Array}   regexes2    The second array of regexes to check.
+ * @param {Array}   endings     The array of endings to attach to the stemmed word
+ *                              if the previously stemmed word matches one of the regexes in the second array.
+ * @returns {string}    The stemmed word if there is any matches or otherwise the original word.
+ */
+function matchAndStemWordWithRegexArray(word, regexes1, regexes2, endings) {
+  let match;
+  for (let i = 0; i < regexes1.length; i++) {
+    if ((match = new RegExp(regexes1[i]).exec(word)) !== null) {
+      word = match[1];
+      if (new RegExp(regexes2[i]).test(word)) {
+        word += endings[i];
+      }
+    }
+  }
+  return word;
+}
+
+/**
+ * Matches word with a regex and stems the word if there is any match.
+ *
+ * @param {string}  word     The word to check.
+ * @param {string}   regex    The regex to match.
+ *
+ * @returns {string}    The stemmed word if there is any matches or otherwise the original word.
+ */
+function matchAndStemWordWithOneRegex(word, regex) {
+  let match;
+  if ((match = new RegExp(regex).exec(word)) !== null) {
+    word = match[1];
+  }
+  return word;
+}
+
+/**
+ * Matches word with a regex and stems the word if there is any match. Further processes the stemmed word
+ * if it matches one of the two regexes in the second check by attaching an additional ending.
+ *
+ * @param {string}  word    The word to check.
+ * @param {string}  regex1  The first regex to match.
+ * @param {string}  regex2  The second regex to match.
+ * @param {string}  regex3  The third regex to match.
+ * @param {string}  ending  The ending to attach to the stemmed word
+ *                          if the previously stemmed word matches one of the conditions in the second check.
+ * @returns {string}    The stemmed word if there is any matches or otherwise the original word.
+ */
+function matchAndStemWord(word, regex1, regex2, regex3, ending) {
+  let match;
+  if ((match = new RegExp(regex1).exec(word)) !== null) {
+    word = match[1];
+    if (new RegExp(regex2).test(word) || new RegExp(regex3).test(word)) {
+      word += ending;
+    }
+  }
+  return word;
+}
+
+/**
+ * Checks if a word is in the exception list of step 1 stemming process.
+ *
+ * @param {string} word             The word to check.
+ * @param {Object} morphologyData   The Greek morphology data.
+ * @returns {string}    The stem of the word.
+ */
+function checkExceptionStep1(word, morphologyData) {
+  const exceptions = morphologyData.externalStemmer.step1Exceptions;
+  const regex = new RegExp("(.*)(" + Object.keys(exceptions).join("|") + ")$");
+  const match = regex.exec(word);
+  if (match !== null) {
+    word = match[1] + exceptions[match[2]];
+  }
+  return word;
+}
+
+/**
+ * Stems suffixes from step 1.
+ *
+ * @param {string} word             The word to stem.
+ * @param {Object} morphologyData   The Greek morphology data.
+ *
+ * @returns {string}     The word without suffixes or the original word if no such suffix is found.
+ */
+function stemWordStep1(word, morphologyData) {
+  const regexesStep1 = morphologyData.externalStemmer.regexesStep1;
+  const regexesArrays = regexesStep1.regexesArrays;
+  let match;
+  if ((match = new RegExp(regexesStep1.regex1a).exec(word)) !== null) {
+    word = match[1];
+    if (!new RegExp(regexesStep1.regex1b).test(word)) {
+      word += "ΑΔ";
+    }
+  }
+  word = matchAndStemWordWithRegexArray(word, regexesArrays[0], regexesArrays[1], regexesArrays[2]);
+  return word;
+}
+
+/**
+ * Stems suffixes from step 2.
+ *
+ * @param {string} word             The word to stem.
+ * @param {Object} morphologyData   The Greek morphology data.
+ *
+ * @returns {string}     The word without suffixes or the original word if no such suffix is found.
+ */
+function stemWordStep2(word, morphologyData) {
+  const regexesStep2 = morphologyData.externalStemmer.regexesStep2;
+  const vowelRegex1 = new RegExp(morphologyData.externalStemmer.vowelRegex1);
+  let match;
+  if ((match = new RegExp(regexesStep2.regex2a).exec(word)) !== null && match[1].length > 4) {
+    word = match[1];
+  }
+  if ((match = new RegExp(regexesStep2.regex2b).exec(word)) !== null) {
+    word = match[1];
+    if (vowelRegex1.test(word) || word.length < 2 || new RegExp(regexesStep2.regex2c).test(match[1])) {
+      word += "Ι";
+    }
+    if (new RegExp(regexesStep2.regex2d).test(match[1])) {
+      word += "ΑΙ";
+    }
+  }
+  return word;
+}
+
+/**
+ * Stems suffixes from step 3.
+ *
+ * @param {string} word             The word to stem.
+ * @param {Object} morphologyData   The Greek morphology data.
+ *
+ * @returns {string}     The word without suffixes or the original word if no such suffix is found.
+ */
+function stemWordStep3(word, morphologyData) {
+  const vowelRegex1 = new RegExp(morphologyData.externalStemmer.vowelRegex1);
+  const regexesStep3 = morphologyData.externalStemmer.regexesStep3;
+  let match;
+  if ((match = new RegExp(regexesStep3.regex3a).exec(word)) !== null) {
+    word = match[1];
+    if (vowelRegex1.test(word) || new RegExp(regexesStep3.regex3b).test(word) || new RegExp(regexesStep3.regex3c).test(word)) {
+      word += "ΙΚ";
+    }
+  }
+  return word;
+}
+
+/**
+ * Stems verb and nouns suffixes.
+ *
+ * @param {string} word             The word to stem.
+ * @param {Object} morphologyData   The Greek morphology data.
+ *
+ * @returns {string}     The word without suffixes or the original word if no such suffix is found.
+ */
+function stemWordStep4(word, morphologyData) {
+  const regexesStep4 = morphologyData.externalStemmer.regexesStep4;
+  const regexesArrays = regexesStep4.regexesArrays;
+  const vowelRegex1 = morphologyData.externalStemmer.vowelRegex1;
+  const vowelRegex2 = morphologyData.externalStemmer.vowelRegex2;
+  let match;
+  if (word === "ΑΓΑΜΕ") {
+    return "ΑΓΑΜ";
+  }
+  word = matchAndStemWordWithOneRegex(word, regexesStep4.regex4a);
+  word = matchAndStemWordWithRegexArray(word, regexesArrays.arrays1[0], regexesArrays.arrays1[1], regexesArrays.arrays1[2]);
+  word = matchAndStemWord(word, regexesStep4.regex4b, vowelRegex2, regexesStep4.regex4c, "ΑΝ");
+  word = matchAndStemWordWithOneRegex(word, regexesStep4.regex4d);
+  if ((match = new RegExp(regexesStep4.regex4e).exec(word)) !== null) {
+    word = match[1];
+    if (new RegExp(vowelRegex2).test(word) || new RegExp(regexesStep4.regex4f).test(word) || new RegExp(regexesStep4.regex4g).test(word)) {
+      word += "ΕΤ";
+    }
+  }
+  if ((match = new RegExp(regexesStep4.regex4h).exec(word)) !== null) {
+    word = match[1];
+    if (new RegExp(regexesStep4.regex4i).test(match[1])) {
+      word += "ΟΝΤ";
+    } else if (new RegExp(regexesStep4.regex4j).test(match[1])) {
+      word += "ΩΝΤ";
+    }
+  }
+  word = matchAndStemWordWithRegexArray(word, regexesArrays.arrays2[0], regexesArrays.arrays2[1], regexesArrays.arrays2[2]);
+  word = matchAndStemWordWithOneRegex(word, regexesStep4.regex4k);
+  word = matchAndStemWord(word, regexesStep4.regex4l, regexesStep4.regex4m, regexesStep4.regex4n, "ΗΚ");
+  if ((match = new RegExp(regexesStep4.regex4o).exec(word)) !== null) {
+    word = match[1];
+    if (new RegExp(vowelRegex1).test(word) || new RegExp(regexesStep4.regex4p).test(match[1]) || new RegExp(regexesStep4.regex4q).test(match[1])) {
+      word += "ΟΥΣ";
+    }
+  }
+  if ((match = new RegExp(regexesStep4.regex4r).exec(word)) !== null) {
+    word = match[1];
+    if (new RegExp(regexesStep4.regex4s).test(word) || new RegExp(regexesStep4.regex4t).test(word) && !new RegExp(regexesStep4.regex4u).test(word)) {
+      word += "ΑΓ";
+    }
+  }
+  word = matchAndStemWordWithRegexArray(word, regexesArrays.arrays3[0], regexesArrays.arrays3[1], regexesArrays.arrays3[2]);
+  return word;
+}
+
+/**
+ * Stems adjective suffixes.
+ *
+ * @param {string} word             The word to stem.
+ * @param {Object} morphologyData   The Greek morphology data.
+ *
+ * @returns {string}     The word without suffixes or the original word if no such suffix is found.
+ */
+function stemWordStep5(word, morphologyData) {
+  const regexesStep5 = morphologyData.externalStemmer.regexesStep5;
+  let match;
+  if ((match = new RegExp(regexesStep5.regex5a).exec(word)) !== null) {
+    word = match[1] + "Μ";
+    if (new RegExp(regexesStep5.regex5b).test(match[1])) {
+      word += "Α";
+    } else if (new RegExp(regexesStep5.regex5c).test(match[1])) {
+      word += "ΑΤ";
+    }
+  }
+  if ((match = new RegExp(regexesStep5.regex5d).exec(word)) !== null) {
+    word = match[1] + "ΟΥ";
+  }
+  return word;
+}
+
+/**
+ * Stems superlative and comparative suffixes.
+ *
+ * @param {string} word             The word to stem.
+ * @param {Object} morphologyData   The Greek morphology data.
+ *
+ * @returns {string}     The word without suffixes or the original word if no such suffix is found.
+ */
+function stemWordStep6(word, morphologyData) {
+  const regexesStep6 = morphologyData.externalStemmer.regexesStep6;
+  let match;
+  if ((match = new RegExp(regexesStep6.regex6a).exec(word)) !== null) {
+    if (!new RegExp(regexesStep6.regex6b).test(match[1])) {
+      word = match[1];
+    }
+    if (new RegExp(regexesStep6.regex6c).test(match[1])) {
+      word += "ΥΤ";
+    }
+  }
+  return word;
+}
+
+/**
+ * Normalizes Greek by removing accents.
+ *
+ * @param {string} text The text that should be normalized.
+ *
+ * @returns {string} The normalized text.
+ */
+function normalizeGreek(text) {
+  return text.replace(/[ΆΑά]/g, "α").replace(/[ΈΕέ]/g, "ε").replace(/[ΉΗή]/g, "η").replace(/[ΊΪΙίΐϊ]/g, "ι").replace(/[ΌΟό]/g, "ο").replace(/[ΎΫΥύΰϋ]/g, "υ").replace(/[ΏΩώ]/g, "ω").replace(/[Σς]/g, "σ");
+}
+
+/**
+ * Stems Greek words
+ *
+ * @param {string} word           The word to stem.
+ * @param {Object} morphologyData The object that contains regex-based rules and exception lists for Greek stemming.
+ *
+ * @returns {string} The stem of a Greek word.
+ */
+function stem(word, morphologyData) {
+  word = normalizeGreek(word);
+
+  // We process the word in uppercase to account for the character changing in lowercase depending on its position in the word.
+  word = word.toLocaleUpperCase("el");
+  const originalWord = word;
+  const doNotStemWords = morphologyData.externalStemmer.doNotStemWords;
+  if (word.length < 3 || doNotStemWords.includes(word)) {
+    return word.toLocaleLowerCase("el");
+  }
+  // Check for exceptions first before proceeding to the next step.
+  word = checkExceptionStep1(word, morphologyData);
+
+  // Step 1
+  word = stemWordStep1(word, morphologyData);
+
+  // Step 2
+  word = stemWordStep2(word, morphologyData);
+
+  // Step 3
+  word = stemWordStep3(word, morphologyData);
+
+  // Step 4
+  word = stemWordStep4(word, morphologyData);
+
+  // Step 5
+  word = stemWordStep5(word, morphologyData);
+
+  // Handle long words.
+  const longWordRegex = morphologyData.externalStemmer.longWordRegex;
+  if (originalWord.length === word.length) {
+    word = matchAndStemWordWithOneRegex(word, longWordRegex);
+  }
+  // Step 6
+  word = stemWordStep6(word, morphologyData);
+
+  // Make the word lowercase again after the stemming process complete.
+  word = word.toLocaleLowerCase("el");
+  return word;
+}
+//# sourceMappingURL=stem.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"stem.js","names":["matchAndStemWordWithRegexArray","word","regexes1","regexes2","endings","match","i","length","RegExp","exec","test","matchAndStemWordWithOneRegex","regex","matchAndStemWord","regex1","regex2","regex3","ending","checkExceptionStep1","morphologyData","exceptions","externalStemmer","step1Exceptions","Object","keys","join","stemWordStep1","regexesStep1","regexesArrays","regex1a","regex1b","stemWordStep2","regexesStep2","vowelRegex1","regex2a","regex2b","regex2c","regex2d","stemWordStep3","regexesStep3","regex3a","regex3b","regex3c","stemWordStep4","regexesStep4","vowelRegex2","regex4a","arrays1","regex4b","regex4c","regex4d","regex4e","regex4f","regex4g","regex4h","regex4i","regex4j","arrays2","regex4k","regex4l","regex4m","regex4n","regex4o","regex4p","regex4q","regex4r","regex4s","regex4t","regex4u","arrays3","stemWordStep5","regexesStep5","regex5a","regex5b","regex5c","regex5d","stemWordStep6","regexesStep6","regex6a","regex6b","regex6c","normalizeGreek","text","replace","stem","toLocaleUpperCase","originalWord","doNotStemWords","includes","toLocaleLowerCase","longWordRegex"],"sources":["../../../../../../src/languageProcessing/languages/el/helpers/internal/stem.js"],"sourcesContent":["/* eslint-disable max-statements,complexity */\n/**\n * MIT License\n *\n * Copyright (c) 2015 apmats <amatsagkas@gmail.com>\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 all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n *\n * https://github.com/Apmats/greekstemmerjs\n */\n\n/**\n * Matches word with an array of regexes and stems the word if there is any match. Further processes the stemmed word\n * if it matches one of the regexes in the second array by attaching an additional ending.\n *\n * @param {string}  word        The word to check.\n * @param {Array}   regexes1    The first array of regexes to check.\n * @param {Array}   regexes2    The second array of regexes to check.\n * @param {Array}   endings     The array of endings to attach to the stemmed word\n *                              if the previously stemmed word matches one of the regexes in the second array.\n * @returns {string}    The stemmed word if there is any matches or otherwise the original word.\n */\nexport function matchAndStemWordWithRegexArray( word, regexes1, regexes2, endings ) {\n\tlet match;\n\tfor ( let i = 0; i < regexes1.length; i++ ) {\n\t\tif ( ( match = new RegExp( regexes1[ i ] ).exec( word ) ) !== null ) {\n\t\t\tword = match[ 1 ];\n\t\t\tif ( new RegExp( regexes2[ i ] ).test( word ) ) {\n\t\t\t\tword += endings[ i ];\n\t\t\t}\n\t\t}\n\t}\n\treturn word;\n}\n\n/**\n * Matches word with a regex and stems the word if there is any match.\n *\n * @param {string}  word     The word to check.\n * @param {string}   regex    The regex to match.\n *\n * @returns {string}    The stemmed word if there is any matches or otherwise the original word.\n */\nexport function matchAndStemWordWithOneRegex( word, regex ) {\n\tlet match;\n\tif ( ( match = new RegExp( regex ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ];\n\t}\n\treturn word;\n}\n\n/**\n * Matches word with a regex and stems the word if there is any match. Further processes the stemmed word\n * if it matches one of the two regexes in the second check by attaching an additional ending.\n *\n * @param {string}  word    The word to check.\n * @param {string}  regex1  The first regex to match.\n * @param {string}  regex2  The second regex to match.\n * @param {string}  regex3  The third regex to match.\n * @param {string}  ending  The ending to attach to the stemmed word\n *                          if the previously stemmed word matches one of the conditions in the second check.\n * @returns {string}    The stemmed word if there is any matches or otherwise the original word.\n */\nexport function matchAndStemWord( word, regex1, regex2, regex3, ending ) {\n\tlet match;\n\tif ( ( match = new RegExp( regex1 ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ];\n\t\tif ( new RegExp( regex2 ).test( word ) || new RegExp( regex3 ).test( word ) ) {\n\t\t\tword += ending;\n\t\t}\n\t}\n\treturn word;\n}\n\n/**\n * Checks if a word is in the exception list of step 1 stemming process.\n *\n * @param {string} word             The word to check.\n * @param {Object} morphologyData   The Greek morphology data.\n * @returns {string}    The stem of the word.\n */\nfunction checkExceptionStep1( word, morphologyData ) {\n\tconst exceptions = morphologyData.externalStemmer.step1Exceptions;\n\tconst regex = new RegExp( \"(.*)(\" + Object.keys( exceptions ).join( \"|\" ) + \")$\" );\n\tconst match = regex.exec( word );\n\tif ( match !== null ) {\n\t\tword = match[ 1 ] + exceptions[ match[ 2 ] ];\n\t}\n\treturn word;\n}\n\n/**\n * Stems suffixes from step 1.\n *\n * @param {string} word             The word to stem.\n * @param {Object} morphologyData   The Greek morphology data.\n *\n * @returns {string}     The word without suffixes or the original word if no such suffix is found.\n */\nfunction stemWordStep1( word, morphologyData ) {\n\tconst regexesStep1 = morphologyData.externalStemmer.regexesStep1;\n\tconst regexesArrays = regexesStep1.regexesArrays;\n\tlet match;\n\tif ( ( match = new RegExp( regexesStep1.regex1a ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ];\n\t\tif ( ! new RegExp( regexesStep1.regex1b ).test( word ) ) {\n\t\t\tword += \"ΑΔ\";\n\t\t}\n\t}\n\tword = matchAndStemWordWithRegexArray( word, regexesArrays[ 0 ], regexesArrays[ 1 ], regexesArrays[ 2 ] );\n\n\treturn word;\n}\n\n/**\n * Stems suffixes from step 2.\n *\n * @param {string} word             The word to stem.\n * @param {Object} morphologyData   The Greek morphology data.\n *\n * @returns {string}     The word without suffixes or the original word if no such suffix is found.\n */\nfunction stemWordStep2( word, morphologyData ) {\n\tconst regexesStep2 = morphologyData.externalStemmer.regexesStep2;\n\tconst vowelRegex1 = new RegExp( morphologyData.externalStemmer.vowelRegex1 );\n\tlet match;\n\tif ( ( match = new RegExp( regexesStep2.regex2a ).exec( word ) ) !== null && match[ 1 ].length > 4 ) {\n\t\tword = match[ 1 ];\n\t}\n\tif ( ( match = new RegExp( regexesStep2.regex2b ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ];\n\n\t\tif ( vowelRegex1.test( word ) || word.length < 2 || new RegExp( regexesStep2.regex2c ).test( match[ 1 ] ) ) {\n\t\t\tword += \"Ι\";\n\t\t}\n\t\tif ( new RegExp( regexesStep2.regex2d ).test( match[ 1 ] ) ) {\n\t\t\tword += \"ΑΙ\";\n\t\t}\n\t}\n\treturn word;\n}\n\n/**\n * Stems suffixes from step 3.\n *\n * @param {string} word             The word to stem.\n * @param {Object} morphologyData   The Greek morphology data.\n *\n * @returns {string}     The word without suffixes or the original word if no such suffix is found.\n */\nfunction stemWordStep3( word, morphologyData ) {\n\tconst vowelRegex1 = new RegExp( morphologyData.externalStemmer.vowelRegex1 );\n\tconst regexesStep3 = morphologyData.externalStemmer.regexesStep3;\n\tlet match;\n\tif ( ( match = new RegExp( regexesStep3.regex3a ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ];\n\t\tif ( vowelRegex1.test( word ) || new RegExp( regexesStep3.regex3b ).test( word ) || new RegExp( regexesStep3.regex3c ).test( word ) ) {\n\t\t\tword += \"ΙΚ\";\n\t\t}\n\t}\n\treturn word;\n}\n\n/**\n * Stems verb and nouns suffixes.\n *\n * @param {string} word             The word to stem.\n * @param {Object} morphologyData   The Greek morphology data.\n *\n * @returns {string}     The word without suffixes or the original word if no such suffix is found.\n */\nfunction stemWordStep4( word, morphologyData ) {\n\tconst regexesStep4 = morphologyData.externalStemmer.regexesStep4;\n\tconst regexesArrays = regexesStep4.regexesArrays;\n\tconst vowelRegex1 = morphologyData.externalStemmer.vowelRegex1;\n\tconst vowelRegex2 = morphologyData.externalStemmer.vowelRegex2;\n\tlet match;\n\tif ( word === \"ΑΓΑΜΕ\" ) {\n\t\treturn \"ΑΓΑΜ\";\n\t}\n\n\tword = matchAndStemWordWithOneRegex( word, regexesStep4.regex4a );\n\n\tword = matchAndStemWordWithRegexArray( word, regexesArrays.arrays1[ 0 ], regexesArrays.arrays1[ 1 ], regexesArrays.arrays1[ 2 ] );\n\n\tword = matchAndStemWord( word, regexesStep4.regex4b, vowelRegex2, regexesStep4.regex4c, \"ΑΝ\" );\n\n\tword = matchAndStemWordWithOneRegex( word, regexesStep4.regex4d );\n\n\tif ( ( match = new RegExp( regexesStep4.regex4e ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ];\n\t\tif ( new RegExp( vowelRegex2 ).test( word ) || new RegExp( regexesStep4.regex4f ).test( word ) ||\n\t\t\tnew RegExp( regexesStep4.regex4g ).test( word ) ) {\n\t\t\tword += \"ΕΤ\";\n\t\t}\n\t}\n\n\tif ( ( match = new RegExp( regexesStep4.regex4h ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ];\n\t\tif ( new RegExp( regexesStep4.regex4i ).test( match[ 1 ] ) ) {\n\t\t\tword += \"ΟΝΤ\";\n\t\t} else if ( new RegExp( regexesStep4.regex4j ).test( match[ 1 ] ) ) {\n\t\t\tword += \"ΩΝΤ\";\n\t\t}\n\t}\n\tword = matchAndStemWordWithRegexArray( word, regexesArrays.arrays2[ 0 ], regexesArrays.arrays2[ 1 ], regexesArrays.arrays2[ 2 ] );\n\n\tword = matchAndStemWordWithOneRegex( word, regexesStep4.regex4k );\n\n\tword = matchAndStemWord( word, regexesStep4.regex4l, regexesStep4.regex4m, regexesStep4.regex4n, \"ΗΚ\" );\n\n\tif ( ( match = new RegExp( regexesStep4.regex4o ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ];\n\t\tif ( new RegExp( vowelRegex1 ).test( word ) || new RegExp( regexesStep4.regex4p ).test( match[ 1 ] ) ||\n\t\t\tnew RegExp( regexesStep4.regex4q ).test( match[ 1 ] ) ) {\n\t\t\tword += \"ΟΥΣ\";\n\t\t}\n\t}\n\n\tif ( ( match = new RegExp( regexesStep4.regex4r ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ];\n\n\t\tif ( new RegExp( regexesStep4.regex4s ).test( word ) ||\n\t\t\t( new RegExp( regexesStep4.regex4t ).test( word ) && ! new RegExp( regexesStep4.regex4u ).test( word ) ) ) {\n\t\t\tword += \"ΑΓ\";\n\t\t}\n\t}\n\tword = matchAndStemWordWithRegexArray( word, regexesArrays.arrays3[ 0 ], regexesArrays.arrays3[ 1 ], regexesArrays.arrays3[ 2 ] );\n\n\treturn word;\n}\n\n/**\n * Stems adjective suffixes.\n *\n * @param {string} word             The word to stem.\n * @param {Object} morphologyData   The Greek morphology data.\n *\n * @returns {string}     The word without suffixes or the original word if no such suffix is found.\n */\nfunction stemWordStep5( word, morphologyData ) {\n\tconst regexesStep5 = morphologyData.externalStemmer.regexesStep5;\n\tlet match;\n\tif ( ( match = new RegExp( regexesStep5.regex5a ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ] + \"Μ\";\n\t\tif ( new RegExp( regexesStep5.regex5b ).test( match[ 1 ] ) ) {\n\t\t\tword += \"Α\";\n\t\t} else if ( new RegExp( regexesStep5.regex5c ).test( match[ 1 ] ) ) {\n\t\t\tword += \"ΑΤ\";\n\t\t}\n\t}\n\n\tif ( ( match = new RegExp( regexesStep5.regex5d ).exec( word ) ) !== null ) {\n\t\tword = match[ 1 ] + \"ΟΥ\";\n\t}\n\n\treturn word;\n}\n\n/**\n * Stems superlative and comparative suffixes.\n *\n * @param {string} word             The word to stem.\n * @param {Object} morphologyData   The Greek morphology data.\n *\n * @returns {string}     The word without suffixes or the original word if no such suffix is found.\n */\nfunction stemWordStep6( word, morphologyData ) {\n\tconst regexesStep6 = morphologyData.externalStemmer.regexesStep6;\n\n\tlet match;\n\tif ( ( match = new RegExp( regexesStep6.regex6a ).exec( word ) ) !== null ) {\n\t\tif ( ! new RegExp( regexesStep6.regex6b ).test( match[ 1 ] ) ) {\n\t\t\tword = match[ 1 ];\n\t\t}\n\t\tif ( new RegExp( regexesStep6.regex6c ).test( match[ 1 ] ) ) {\n\t\t\tword += \"ΥΤ\";\n\t\t}\n\t}\n\n\treturn word;\n}\n\n/**\n * Normalizes Greek by removing accents.\n *\n * @param {string} text The text that should be normalized.\n *\n * @returns {string} The normalized text.\n */\nfunction normalizeGreek( text ) {\n\treturn text.replace( /[ΆΑά]/g, \"α\" )\n\t\t.replace( /[ΈΕέ]/g, \"ε\" )\n\t\t.replace( /[ΉΗή]/g, \"η\" )\n\t\t.replace( /[ΊΪΙίΐϊ]/g, \"ι\" )\n\t\t.replace( /[ΌΟό]/g, \"ο\" )\n\t\t.replace( /[ΎΫΥύΰϋ]/g, \"υ\" )\n\t\t.replace( /[ΏΩώ]/g, \"ω\" )\n\t\t.replace( /[Σς]/g, \"σ\" );\n}\n\n/**\n * Stems Greek words\n *\n * @param {string} word           The word to stem.\n * @param {Object} morphologyData The object that contains regex-based rules and exception lists for Greek stemming.\n *\n * @returns {string} The stem of a Greek word.\n */\nexport default function stem( word, morphologyData ) {\n\tword = normalizeGreek( word );\n\n\t// We process the word in uppercase to account for the character changing in lowercase depending on its position in the word.\n\tword = word.toLocaleUpperCase( \"el\" );\n\n\tconst originalWord = word;\n\n\tconst doNotStemWords = morphologyData.externalStemmer.doNotStemWords;\n\tif ( word.length < 3 || doNotStemWords.includes( word ) ) {\n\t\treturn word.toLocaleLowerCase( \"el\" );\n\t}\n\t// Check for exceptions first before proceeding to the next step.\n\tword = checkExceptionStep1( word, morphologyData );\n\n\t// Step 1\n\tword = stemWordStep1( word, morphologyData );\n\n\t// Step 2\n\tword = stemWordStep2( word, morphologyData );\n\n\t// Step 3\n\tword = stemWordStep3( word, morphologyData );\n\n\t// Step 4\n\tword = stemWordStep4( word, morphologyData );\n\n\t// Step 5\n\tword = stemWordStep5( word, morphologyData );\n\n\t// Handle long words.\n\tconst longWordRegex = morphologyData.externalStemmer.longWordRegex;\n\tif ( originalWord.length === word.length ) {\n\t\tword = matchAndStemWordWithOneRegex( word, longWordRegex );\n\t}\n\t// Step 6\n\tword = stemWordStep6( word, morphologyData );\n\n\t// Make the word lowercase again after the stemming process complete.\n\tword = word.toLocaleLowerCase( \"el\" );\n\n\treturn word;\n}\n"],"mappings":";;;;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASA,8BAA8BA,CAAEC,IAAI,EAAEC,QAAQ,EAAEC,QAAQ,EAAEC,OAAO,EAAG;EACnF,IAAIC,KAAK;EACT,KAAM,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGJ,QAAQ,CAACK,MAAM,EAAED,CAAC,EAAE,EAAG;IAC3C,IAAK,CAAED,KAAK,GAAG,IAAIG,MAAM,CAAEN,QAAQ,CAAEI,CAAC,CAAG,CAAC,CAACG,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;MACpEA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;MACjB,IAAK,IAAIG,MAAM,CAAEL,QAAQ,CAAEG,CAAC,CAAG,CAAC,CAACI,IAAI,CAAET,IAAK,CAAC,EAAG;QAC/CA,IAAI,IAAIG,OAAO,CAAEE,CAAC,CAAE;MACrB;IACD;EACD;EACA,OAAOL,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASU,4BAA4BA,CAAEV,IAAI,EAAEW,KAAK,EAAG;EAC3D,IAAIP,KAAK;EACT,IAAK,CAAEA,KAAK,GAAG,IAAIG,MAAM,CAAEI,KAAM,CAAC,CAACH,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC5DA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;EAClB;EACA,OAAOJ,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASY,gBAAgBA,CAAEZ,IAAI,EAAEa,MAAM,EAAEC,MAAM,EAAEC,MAAM,EAAEC,MAAM,EAAG;EACxE,IAAIZ,KAAK;EACT,IAAK,CAAEA,KAAK,GAAG,IAAIG,MAAM,CAAEM,MAAO,CAAC,CAACL,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC7DA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;IACjB,IAAK,IAAIG,MAAM,CAAEO,MAAO,CAAC,CAACL,IAAI,CAAET,IAAK,CAAC,IAAI,IAAIO,MAAM,CAAEQ,MAAO,CAAC,CAACN,IAAI,CAAET,IAAK,CAAC,EAAG;MAC7EA,IAAI,IAAIgB,MAAM;IACf;EACD;EACA,OAAOhB,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASiB,mBAAmBA,CAAEjB,IAAI,EAAEkB,cAAc,EAAG;EACpD,MAAMC,UAAU,GAAGD,cAAc,CAACE,eAAe,CAACC,eAAe;EACjE,MAAMV,KAAK,GAAG,IAAIJ,MAAM,CAAE,OAAO,GAAGe,MAAM,CAACC,IAAI,CAAEJ,UAAW,CAAC,CAACK,IAAI,CAAE,GAAI,CAAC,GAAG,IAAK,CAAC;EAClF,MAAMpB,KAAK,GAAGO,KAAK,CAACH,IAAI,CAAER,IAAK,CAAC;EAChC,IAAKI,KAAK,KAAK,IAAI,EAAG;IACrBJ,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE,GAAGe,UAAU,CAAEf,KAAK,CAAE,CAAC,CAAE,CAAE;EAC7C;EACA,OAAOJ,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASyB,aAAaA,CAAEzB,IAAI,EAAEkB,cAAc,EAAG;EAC9C,MAAMQ,YAAY,GAAGR,cAAc,CAACE,eAAe,CAACM,YAAY;EAChE,MAAMC,aAAa,GAAGD,YAAY,CAACC,aAAa;EAChD,IAAIvB,KAAK;EACT,IAAK,CAAEA,KAAK,GAAG,IAAIG,MAAM,CAAEmB,YAAY,CAACE,OAAQ,CAAC,CAACpB,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3EA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;IACjB,IAAK,CAAE,IAAIG,MAAM,CAAEmB,YAAY,CAACG,OAAQ,CAAC,CAACpB,IAAI,CAAET,IAAK,CAAC,EAAG;MACxDA,IAAI,IAAI,IAAI;IACb;EACD;EACAA,IAAI,GAAGD,8BAA8B,CAAEC,IAAI,EAAE2B,aAAa,CAAE,CAAC,CAAE,EAAEA,aAAa,CAAE,CAAC,CAAE,EAAEA,aAAa,CAAE,CAAC,CAAG,CAAC;EAEzG,OAAO3B,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS8B,aAAaA,CAAE9B,IAAI,EAAEkB,cAAc,EAAG;EAC9C,MAAMa,YAAY,GAAGb,cAAc,CAACE,eAAe,CAACW,YAAY;EAChE,MAAMC,WAAW,GAAG,IAAIzB,MAAM,CAAEW,cAAc,CAACE,eAAe,CAACY,WAAY,CAAC;EAC5E,IAAI5B,KAAK;EACT,IAAK,CAAEA,KAAK,GAAG,IAAIG,MAAM,CAAEwB,YAAY,CAACE,OAAQ,CAAC,CAACzB,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,IAAII,KAAK,CAAE,CAAC,CAAE,CAACE,MAAM,GAAG,CAAC,EAAG;IACpGN,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;EAClB;EACA,IAAK,CAAEA,KAAK,GAAG,IAAIG,MAAM,CAAEwB,YAAY,CAACG,OAAQ,CAAC,CAAC1B,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3EA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;IAEjB,IAAK4B,WAAW,CAACvB,IAAI,CAAET,IAAK,CAAC,IAAIA,IAAI,CAACM,MAAM,GAAG,CAAC,IAAI,IAAIC,MAAM,CAAEwB,YAAY,CAACI,OAAQ,CAAC,CAAC1B,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,EAAG;MAC3GJ,IAAI,IAAI,GAAG;IACZ;IACA,IAAK,IAAIO,MAAM,CAAEwB,YAAY,CAACK,OAAQ,CAAC,CAAC3B,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,EAAG;MAC5DJ,IAAI,IAAI,IAAI;IACb;EACD;EACA,OAAOA,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASqC,aAAaA,CAAErC,IAAI,EAAEkB,cAAc,EAAG;EAC9C,MAAMc,WAAW,GAAG,IAAIzB,MAAM,CAAEW,cAAc,CAACE,eAAe,CAACY,WAAY,CAAC;EAC5E,MAAMM,YAAY,GAAGpB,cAAc,CAACE,eAAe,CAACkB,YAAY;EAChE,IAAIlC,KAAK;EACT,IAAK,CAAEA,KAAK,GAAG,IAAIG,MAAM,CAAE+B,YAAY,CAACC,OAAQ,CAAC,CAAC/B,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3EA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;IACjB,IAAK4B,WAAW,CAACvB,IAAI,CAAET,IAAK,CAAC,IAAI,IAAIO,MAAM,CAAE+B,YAAY,CAACE,OAAQ,CAAC,CAAC/B,IAAI,CAAET,IAAK,CAAC,IAAI,IAAIO,MAAM,CAAE+B,YAAY,CAACG,OAAQ,CAAC,CAAChC,IAAI,CAAET,IAAK,CAAC,EAAG;MACrIA,IAAI,IAAI,IAAI;IACb;EACD;EACA,OAAOA,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS0C,aAAaA,CAAE1C,IAAI,EAAEkB,cAAc,EAAG;EAC9C,MAAMyB,YAAY,GAAGzB,cAAc,CAACE,eAAe,CAACuB,YAAY;EAChE,MAAMhB,aAAa,GAAGgB,YAAY,CAAChB,aAAa;EAChD,MAAMK,WAAW,GAAGd,cAAc,CAACE,eAAe,CAACY,WAAW;EAC9D,MAAMY,WAAW,GAAG1B,cAAc,CAACE,eAAe,CAACwB,WAAW;EAC9D,IAAIxC,KAAK;EACT,IAAKJ,IAAI,KAAK,OAAO,EAAG;IACvB,OAAO,MAAM;EACd;EAEAA,IAAI,GAAGU,4BAA4B,CAAEV,IAAI,EAAE2C,YAAY,CAACE,OAAQ,CAAC;EAEjE7C,IAAI,GAAGD,8BAA8B,CAAEC,IAAI,EAAE2B,aAAa,CAACmB,OAAO,CAAE,CAAC,CAAE,EAAEnB,aAAa,CAACmB,OAAO,CAAE,CAAC,CAAE,EAAEnB,aAAa,CAACmB,OAAO,CAAE,CAAC,CAAG,CAAC;EAEjI9C,IAAI,GAAGY,gBAAgB,CAAEZ,IAAI,EAAE2C,YAAY,CAACI,OAAO,EAAEH,WAAW,EAAED,YAAY,CAACK,OAAO,EAAE,IAAK,CAAC;EAE9FhD,IAAI,GAAGU,4BAA4B,CAAEV,IAAI,EAAE2C,YAAY,CAACM,OAAQ,CAAC;EAEjE,IAAK,CAAE7C,KAAK,GAAG,IAAIG,MAAM,CAAEoC,YAAY,CAACO,OAAQ,CAAC,CAAC1C,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3EA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;IACjB,IAAK,IAAIG,MAAM,CAAEqC,WAAY,CAAC,CAACnC,IAAI,CAAET,IAAK,CAAC,IAAI,IAAIO,MAAM,CAAEoC,YAAY,CAACQ,OAAQ,CAAC,CAAC1C,IAAI,CAAET,IAAK,CAAC,IAC7F,IAAIO,MAAM,CAAEoC,YAAY,CAACS,OAAQ,CAAC,CAAC3C,IAAI,CAAET,IAAK,CAAC,EAAG;MAClDA,IAAI,IAAI,IAAI;IACb;EACD;EAEA,IAAK,CAAEI,KAAK,GAAG,IAAIG,MAAM,CAAEoC,YAAY,CAACU,OAAQ,CAAC,CAAC7C,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3EA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;IACjB,IAAK,IAAIG,MAAM,CAAEoC,YAAY,CAACW,OAAQ,CAAC,CAAC7C,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,EAAG;MAC5DJ,IAAI,IAAI,KAAK;IACd,CAAC,MAAM,IAAK,IAAIO,MAAM,CAAEoC,YAAY,CAACY,OAAQ,CAAC,CAAC9C,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,EAAG;MACnEJ,IAAI,IAAI,KAAK;IACd;EACD;EACAA,IAAI,GAAGD,8BAA8B,CAAEC,IAAI,EAAE2B,aAAa,CAAC6B,OAAO,CAAE,CAAC,CAAE,EAAE7B,aAAa,CAAC6B,OAAO,CAAE,CAAC,CAAE,EAAE7B,aAAa,CAAC6B,OAAO,CAAE,CAAC,CAAG,CAAC;EAEjIxD,IAAI,GAAGU,4BAA4B,CAAEV,IAAI,EAAE2C,YAAY,CAACc,OAAQ,CAAC;EAEjEzD,IAAI,GAAGY,gBAAgB,CAAEZ,IAAI,EAAE2C,YAAY,CAACe,OAAO,EAAEf,YAAY,CAACgB,OAAO,EAAEhB,YAAY,CAACiB,OAAO,EAAE,IAAK,CAAC;EAEvG,IAAK,CAAExD,KAAK,GAAG,IAAIG,MAAM,CAAEoC,YAAY,CAACkB,OAAQ,CAAC,CAACrD,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3EA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;IACjB,IAAK,IAAIG,MAAM,CAAEyB,WAAY,CAAC,CAACvB,IAAI,CAAET,IAAK,CAAC,IAAI,IAAIO,MAAM,CAAEoC,YAAY,CAACmB,OAAQ,CAAC,CAACrD,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,IACnG,IAAIG,MAAM,CAAEoC,YAAY,CAACoB,OAAQ,CAAC,CAACtD,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,EAAG;MACxDJ,IAAI,IAAI,KAAK;IACd;EACD;EAEA,IAAK,CAAEI,KAAK,GAAG,IAAIG,MAAM,CAAEoC,YAAY,CAACqB,OAAQ,CAAC,CAACxD,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3EA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;IAEjB,IAAK,IAAIG,MAAM,CAAEoC,YAAY,CAACsB,OAAQ,CAAC,CAACxD,IAAI,CAAET,IAAK,CAAC,IACjD,IAAIO,MAAM,CAAEoC,YAAY,CAACuB,OAAQ,CAAC,CAACzD,IAAI,CAAET,IAAK,CAAC,IAAI,CAAE,IAAIO,MAAM,CAAEoC,YAAY,CAACwB,OAAQ,CAAC,CAAC1D,IAAI,CAAET,IAAK,CAAG,EAAG;MAC3GA,IAAI,IAAI,IAAI;IACb;EACD;EACAA,IAAI,GAAGD,8BAA8B,CAAEC,IAAI,EAAE2B,aAAa,CAACyC,OAAO,CAAE,CAAC,CAAE,EAAEzC,aAAa,CAACyC,OAAO,CAAE,CAAC,CAAE,EAAEzC,aAAa,CAACyC,OAAO,CAAE,CAAC,CAAG,CAAC;EAEjI,OAAOpE,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASqE,aAAaA,CAAErE,IAAI,EAAEkB,cAAc,EAAG;EAC9C,MAAMoD,YAAY,GAAGpD,cAAc,CAACE,eAAe,CAACkD,YAAY;EAChE,IAAIlE,KAAK;EACT,IAAK,CAAEA,KAAK,GAAG,IAAIG,MAAM,CAAE+D,YAAY,CAACC,OAAQ,CAAC,CAAC/D,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3EA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE,GAAG,GAAG;IACvB,IAAK,IAAIG,MAAM,CAAE+D,YAAY,CAACE,OAAQ,CAAC,CAAC/D,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,EAAG;MAC5DJ,IAAI,IAAI,GAAG;IACZ,CAAC,MAAM,IAAK,IAAIO,MAAM,CAAE+D,YAAY,CAACG,OAAQ,CAAC,CAAChE,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,EAAG;MACnEJ,IAAI,IAAI,IAAI;IACb;EACD;EAEA,IAAK,CAAEI,KAAK,GAAG,IAAIG,MAAM,CAAE+D,YAAY,CAACI,OAAQ,CAAC,CAAClE,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3EA,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE,GAAG,IAAI;EACzB;EAEA,OAAOJ,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS2E,aAAaA,CAAE3E,IAAI,EAAEkB,cAAc,EAAG;EAC9C,MAAM0D,YAAY,GAAG1D,cAAc,CAACE,eAAe,CAACwD,YAAY;EAEhE,IAAIxE,KAAK;EACT,IAAK,CAAEA,KAAK,GAAG,IAAIG,MAAM,CAAEqE,YAAY,CAACC,OAAQ,CAAC,CAACrE,IAAI,CAAER,IAAK,CAAC,MAAO,IAAI,EAAG;IAC3E,IAAK,CAAE,IAAIO,MAAM,CAAEqE,YAAY,CAACE,OAAQ,CAAC,CAACrE,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,EAAG;MAC9DJ,IAAI,GAAGI,KAAK,CAAE,CAAC,CAAE;IAClB;IACA,IAAK,IAAIG,MAAM,CAAEqE,YAAY,CAACG,OAAQ,CAAC,CAACtE,IAAI,CAAEL,KAAK,CAAE,CAAC,CAAG,CAAC,EAAG;MAC5DJ,IAAI,IAAI,IAAI;IACb;EACD;EAEA,OAAOA,IAAI;AACZ;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASgF,cAAcA,CAAEC,IAAI,EAAG;EAC/B,OAAOA,IAAI,CAACC,OAAO,CAAE,QAAQ,EAAE,GAAI,CAAC,CAClCA,OAAO,CAAE,QAAQ,EAAE,GAAI,CAAC,CACxBA,OAAO,CAAE,QAAQ,EAAE,GAAI,CAAC,CACxBA,OAAO,CAAE,WAAW,EAAE,GAAI,CAAC,CAC3BA,OAAO,CAAE,QAAQ,EAAE,GAAI,CAAC,CACxBA,OAAO,CAAE,WAAW,EAAE,GAAI,CAAC,CAC3BA,OAAO,CAAE,QAAQ,EAAE,GAAI,CAAC,CACxBA,OAAO,CAAE,OAAO,EAAE,GAAI,CAAC;AAC1B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASC,IAAIA,CAAEnF,IAAI,EAAEkB,cAAc,EAAG;EACpDlB,IAAI,GAAGgF,cAAc,CAAEhF,IAAK,CAAC;;EAE7B;EACAA,IAAI,GAAGA,IAAI,CAACoF,iBAAiB,CAAE,IAAK,CAAC;EAErC,MAAMC,YAAY,GAAGrF,IAAI;EAEzB,MAAMsF,cAAc,GAAGpE,cAAc,CAACE,eAAe,CAACkE,cAAc;EACpE,IAAKtF,IAAI,CAACM,MAAM,GAAG,CAAC,IAAIgF,cAAc,CAACC,QAAQ,CAAEvF,IAAK,CAAC,EAAG;IACzD,OAAOA,IAAI,CAACwF,iBAAiB,CAAE,IAAK,CAAC;EACtC;EACA;EACAxF,IAAI,GAAGiB,mBAAmB,CAAEjB,IAAI,EAAEkB,cAAe,CAAC;;EAElD;EACAlB,IAAI,GAAGyB,aAAa,CAAEzB,IAAI,EAAEkB,cAAe,CAAC;;EAE5C;EACAlB,IAAI,GAAG8B,aAAa,CAAE9B,IAAI,EAAEkB,cAAe,CAAC;;EAE5C;EACAlB,IAAI,GAAGqC,aAAa,CAAErC,IAAI,EAAEkB,cAAe,CAAC;;EAE5C;EACAlB,IAAI,GAAG0C,aAAa,CAAE1C,IAAI,EAAEkB,cAAe,CAAC;;EAE5C;EACAlB,IAAI,GAAGqE,aAAa,CAAErE,IAAI,EAAEkB,cAAe,CAAC;;EAE5C;EACA,MAAMuE,aAAa,GAAGvE,cAAc,CAACE,eAAe,CAACqE,aAAa;EAClE,IAAKJ,YAAY,CAAC/E,MAAM,KAAKN,IAAI,CAACM,MAAM,EAAG;IAC1CN,IAAI,GAAGU,4BAA4B,CAAEV,IAAI,EAAEyF,aAAc,CAAC;EAC3D;EACA;EACAzF,IAAI,GAAG2E,aAAa,CAAE3E,IAAI,EAAEkB,cAAe,CAAC;;EAE5C;EACAlB,IAAI,GAAGA,IAAI,CAACwF,iBAAiB,CAAE,IAAK,CAAC;EAErC,OAAOxF,IAAI;AACZ","ignoreList":[]}

package/build/languageProcessing/languages/el/helpers/isPassiveSentence.js

@@ -0,0 +1,43 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = isPassiveSentence;
+var _index = require("../../../index");
+var _nonPassiveVerbStems = _interopRequireDefault(require("../config/internal/nonPassiveVerbStems"));
+var _morphologicalPassiveSuffixes = require("../config/internal/morphologicalPassiveSuffixes.js");
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+const {
+  getWords,
+  directPrecedenceException
+} = _index.languageProcessing;
+const directPrecedenceExceptionList = ['να'];
+
+/**
+ * Checks the passed sentence to see if it contains Greek passive verb-forms.
+ *
+ * @param {string} sentence     The sentence to match against.
+ *
+ * @returns {Boolean}           Whether the sentence is passive or not.
+ */
+function isPassiveSentence(sentence) {
+  const words = getWords(sentence);
+  for (const word of words) {
+    for (const suffix of _morphologicalPassiveSuffixes.passiveSuffixes) {
+      if (word.endsWith(suffix) && word.length > 4) {
+        // Get the stem of the word.
+        const stem = word.slice(0, -suffix.length);
+        /*
+         * Return true if the word ends with one of the passive suffixes, if the word is more than 4 characters long
+         * And if the word stem is not in the non-passive exception list.
+         *
+         * Passive infinitive with -θεί/-τεί is not a valid passive if it's directly preceded by "να".
+         */
+        return /^(θεί|τεί)$/.test(suffix) ? !_nonPassiveVerbStems.default.includes(stem) && !directPrecedenceException(sentence, word, directPrecedenceExceptionList) : !_nonPassiveVerbStems.default.includes(stem);
+      }
+    }
+  }
+  return false;
+}
+//# sourceMappingURL=isPassiveSentence.js.map

package/build/languageProcessing/languages/el/helpers/isPassiveSentence.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"isPassiveSentence.js","names":["_index","require","_nonPassiveVerbStems","_interopRequireDefault","_morphologicalPassiveSuffixes","e","__esModule","default","getWords","directPrecedenceException","languageProcessing","directPrecedenceExceptionList","isPassiveSentence","sentence","words","word","suffix","passiveSuffixes","endsWith","length","stem","slice","test","nonPassiveVerbStems","includes"],"sources":["../../../../../src/languageProcessing/languages/el/helpers/isPassiveSentence.js"],"sourcesContent":["import {languageProcessing} from '../../../index';\nconst {getWords, directPrecedenceException} = languageProcessing;\n\nimport nonPassiveVerbStems from '../config/internal/nonPassiveVerbStems';\nimport {passiveSuffixes} from '../config/internal/morphologicalPassiveSuffixes.js';\n\nconst directPrecedenceExceptionList = ['να'];\n\n/**\n * Checks the passed sentence to see if it contains Greek passive verb-forms.\n *\n * @param {string} sentence     The sentence to match against.\n *\n * @returns {Boolean}           Whether the sentence is passive or not.\n */\nexport default function isPassiveSentence(sentence) {\n  const words = getWords(sentence);\n\n  for (const word of words) {\n    for (const suffix of passiveSuffixes) {\n      if (word.endsWith(suffix) && word.length > 4) {\n        // Get the stem of the word.\n        const stem = word.slice(0, -suffix.length);\n        /*\n         * Return true if the word ends with one of the passive suffixes, if the word is more than 4 characters long\n         * And if the word stem is not in the non-passive exception list.\n         *\n         * Passive infinitive with -θεί/-τεί is not a valid passive if it's directly preceded by \"να\".\n         */\n        return /^(θεί|τεί)$/.test(suffix)\n          ? !nonPassiveVerbStems.includes(stem) &&\n              !directPrecedenceException(sentence, word, directPrecedenceExceptionList)\n          : !nonPassiveVerbStems.includes(stem);\n      }\n    }\n  }\n  return false;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAGA,IAAAC,oBAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,6BAAA,GAAAH,OAAA;AAAmF,SAAAE,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAHnF,MAAM;EAACG,QAAQ;EAAEC;AAAyB,CAAC,GAAGC,yBAAkB;AAKhE,MAAMC,6BAA6B,GAAG,CAAC,IAAI,CAAC;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASC,iBAAiBA,CAACC,QAAQ,EAAE;EAClD,MAAMC,KAAK,GAAGN,QAAQ,CAACK,QAAQ,CAAC;EAEhC,KAAK,MAAME,IAAI,IAAID,KAAK,EAAE;IACxB,KAAK,MAAME,MAAM,IAAIC,6CAAe,EAAE;MACpC,IAAIF,IAAI,CAACG,QAAQ,CAACF,MAAM,CAAC,IAAID,IAAI,CAACI,MAAM,GAAG,CAAC,EAAE;QAC5C;QACA,MAAMC,IAAI,GAAGL,IAAI,CAACM,KAAK,CAAC,CAAC,EAAE,CAACL,MAAM,CAACG,MAAM,CAAC;QAC1C;AACR;AACA;AACA;AACA;AACA;QACQ,OAAO,aAAa,CAACG,IAAI,CAACN,MAAM,CAAC,GAC7B,CAACO,4BAAmB,CAACC,QAAQ,CAACJ,IAAI,CAAC,IACjC,CAACX,yBAAyB,CAACI,QAAQ,EAAEE,IAAI,EAAEJ,6BAA6B,CAAC,GAC3E,CAACY,4BAAmB,CAACC,QAAQ,CAACJ,IAAI,CAAC;MACzC;IACF;EACF;EACA,OAAO,KAAK;AACd","ignoreList":[]}

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

@@ -0,0 +1,46 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _index = require("../../../index");
+var _getParticiples = _interopRequireDefault(require("../helpers/internal/getParticiples"));
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+const {
+  values
+} = _index.languageProcessing;
+const {
+  Clause
+} = values;
+/**
+ * Creates a Clause object for the Greek language.
+ */
+class GreekClause 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();
+  }
+
+  /**
+   * Sets the passiveness of a clause based on whether the matched participle is a valid one.
+   * We only process clauses that have an auxiliary in this check.
+   *
+   * @returns {void}
+   */
+  checkParticiples() {
+    const participles = this.getParticiples();
+    this.setPassive(participles.length > 0);
+  }
+}
+var _default = exports.default = GreekClause;
+//# sourceMappingURL=Clause.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Clause.js","names":["_index","require","_getParticiples","_interopRequireDefault","e","__esModule","default","values","languageProcessing","Clause","GreekClause","constructor","clauseText","auxiliaries","_participles","getParticiples","getClauseText","checkParticiples","participles","setPassive","length","_default","exports"],"sources":["../../../../../src/languageProcessing/languages/el/values/Clause.js"],"sourcesContent":["import {languageProcessing} from '../../../index';\nconst {values} = languageProcessing;\nconst {Clause} = values;\nimport getParticiples from '../helpers/internal/getParticiples';\n\n/**\n * Creates a Clause object for the Greek language.\n */\nclass GreekClause 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   * Sets the passiveness of a clause based on whether the matched participle is a valid one.\n   * We only process clauses that have an auxiliary in this check.\n   *\n   * @returns {void}\n   */\n  checkParticiples() {\n    const participles = this.getParticiples();\n\n    this.setPassive(participles.length > 0);\n  }\n}\n\nexport default GreekClause;\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAGA,IAAAC,eAAA,GAAAC,sBAAA,CAAAF,OAAA;AAAgE,SAAAE,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAFhE,MAAM;EAACG;AAAM,CAAC,GAAGC,yBAAkB;AACnC,MAAM;EAACC;AAAM,CAAC,GAAGF,MAAM;AAGvB;AACA;AACA;AACA,MAAMG,WAAW,SAASD,MAAM,CAAC;EAC/B;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,WAAW,GAAG,IAAI,CAACH,cAAc,CAAC,CAAC;IAEzC,IAAI,CAACI,UAAU,CAACD,WAAW,CAACE,MAAM,GAAG,CAAC,CAAC;EACzC;AACF;AAAC,IAAAC,QAAA,GAAAC,OAAA,CAAAhB,OAAA,GAEcI,WAAW","ignoreList":[]}

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

@@ -0,0 +1,55 @@
+"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 _stopWords = _interopRequireDefault(require("./config/stopWords"));
+var _transitionWords = _interopRequireDefault(require("./config/transitionWords"));
+var _twoPartTransitionWords = _interopRequireDefault(require("./config/twoPartTransitionWords"));
+var _syllables = _interopRequireDefault(require("./config/syllables.json"));
+var _getClauses = _interopRequireDefault(require("./helpers/getClauses"));
+var _getStemmer = _interopRequireDefault(require("./helpers/getStemmer"));
+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: 'en',
+      passiveConstructionType: 'periphrastic',
+      firstWordExceptions: _firstWordExceptions.default,
+      functionWords: _functionWords.all,
+      stopWords: _stopWords.default,
+      transitionWords: _transitionWords.default,
+      twoPartTransitionWords: _twoPartTransitionWords.default,
+      syllables: _syllables.default
+    });
+    Object.assign(this.helpers, {
+      getClauses: _getClauses.default,
+      getStemmer: _getStemmer.default,
+      fleschReadingScore: _calculateFleschReadingScore.default
+    });
+  }
+}
+exports.default = Researcher;
+//# sourceMappingURL=Researcher.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Researcher.js","names":["_index","require","_firstWordExceptions","_interopRequireDefault","_functionWords","_stopWords","_transitionWords","_twoPartTransitionWords","_syllables","_getClauses","_getStemmer","_calculateFleschReadingScore","e","__esModule","default","AbstractResearcher","languageProcessing","Researcher","constructor","paper","Object","assign","config","language","passiveConstructionType","firstWordExceptions","functionWords","stopWords","transitionWords","twoPartTransitionWords","syllables","helpers","getClauses","getStemmer","fleschReadingScore","exports"],"sources":["../../../../src/languageProcessing/languages/en/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 stopWords from './config/stopWords';\nimport transitionWords from './config/transitionWords';\nimport twoPartTransitionWords from './config/twoPartTransitionWords';\nimport syllables from './config/syllables.json';\n\n// All helpers\nimport getClauses from './helpers/getClauses';\nimport getStemmer from './helpers/getStemmer';\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: 'en',\n      passiveConstructionType: 'periphrastic',\n      firstWordExceptions,\n      functionWords,\n      stopWords,\n      transitionWords,\n      twoPartTransitionWords,\n      syllables\n    });\n\n    Object.assign(this.helpers, {\n      getClauses,\n      getStemmer,\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,UAAA,GAAAF,sBAAA,CAAAF,OAAA;AACA,IAAAK,gBAAA,GAAAH,sBAAA,CAAAF,OAAA;AACA,IAAAM,uBAAA,GAAAJ,sBAAA,CAAAF,OAAA;AACA,IAAAO,UAAA,GAAAL,sBAAA,CAAAF,OAAA;AAGA,IAAAQ,WAAA,GAAAN,sBAAA,CAAAF,OAAA;AACA,IAAAS,WAAA,GAAAP,sBAAA,CAAAF,OAAA;AACA,IAAAU,4BAAA,GAAAR,sBAAA,CAAAF,OAAA;AAAuE,SAAAE,uBAAAS,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAbvE,MAAM;EAACG;AAAkB,CAAC,GAAGC,yBAAkB;;AAE/C;;AAQA;;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,cAAc;MACvCC,mBAAmB,EAAnBA,4BAAmB;MACnBC,aAAa,EAAbA,kBAAa;MACbC,SAAS,EAATA,kBAAS;MACTC,eAAe,EAAfA,wBAAe;MACfC,sBAAsB,EAAtBA,+BAAsB;MACtBC,SAAS,EAATA;IACF,CAAC,CAAC;IAEFV,MAAM,CAACC,MAAM,CAAC,IAAI,CAACU,OAAO,EAAE;MAC1BC,UAAU,EAAVA,mBAAU;MACVC,UAAU,EAAVA,mBAAU;MACVC,kBAAkB,EAAlBA;IACF,CAAC,CAAC;EACJ;AACF;AAACC,OAAA,CAAArB,OAAA,GAAAG,UAAA","ignoreList":[]}

package/build/languageProcessing/languages/en/config/abbreviations.js

@@ -0,0 +1,16 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+/**
+ * Returns a list with abbreviations. Originally created for use in avadaseo/src/languageProcessing/helpers/sentence/SentenceTokenizer.js
+ * Abbreviations were originally sourced from: https://github.com/Yoast/YoastSEO.js/issues/698
+ * IMPORTANT! For the use in the SentenceTokenizer it is important that:
+ * - all abbreviations end in a full stop.
+ * - all abbreviations should contain more than one letter to prevent clashes with the check for initials.
+ * @type {Array} The list with abbreviations.
+ */
+var _default = exports.default = ["A.D.", "Adm.", "Adv.", "B.C.", "Br.", "Brig.", "Cmrd.", "Col.", "Cpl.", "Cpt.", "Dr.", "Esq.", "Fr.", "Gen.", "Gov.", "Hon.", "Jr.", "Lieut.", "Lt.", "Maj.", "Mr.", "Mrs.", "Ms.", "Msgr.", "Mx.", "No.", "Pfc.", "Pr.", "Prof.", "Pvt.", "Rep.", "Reps.", "Rev.", "Rt. Hon.", "Sen.", "Sens.", "Sgt.", "Sps.", "Sr.", "St.", "vs.", "i.e.", "e.g.", "viz.", "Mt."];
+//# sourceMappingURL=abbreviations.js.map

package/build/languageProcessing/languages/en/config/abbreviations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"abbreviations.js","names":["_default","exports","default"],"sources":["../../../../../src/languageProcessing/languages/en/config/abbreviations.js"],"sourcesContent":["/**\n * Returns a list with abbreviations. Originally created for use in avadaseo/src/languageProcessing/helpers/sentence/SentenceTokenizer.js\n * Abbreviations were originally sourced from: https://github.com/Yoast/YoastSEO.js/issues/698\n * IMPORTANT! For the use in the SentenceTokenizer it is important that:\n * - all abbreviations end in a full stop.\n * - all abbreviations should contain more than one letter to prevent clashes with the check for initials.\n * @type {Array} The list with abbreviations.\n */\nexport default [\n\t\"A.D.\",\n\t\"Adm.\",\n\t\"Adv.\",\n\t\"B.C.\",\n\t\"Br.\",\n\t\"Brig.\",\n\t\"Cmrd.\",\n\t\"Col.\",\n\t\"Cpl.\",\n\t\"Cpt.\",\n\t\"Dr.\",\n\t\"Esq.\",\n\t\"Fr.\",\n\t\"Gen.\",\n\t\"Gov.\",\n\t\"Hon.\",\n\t\"Jr.\",\n\t\"Lieut.\",\n\t\"Lt.\",\n\t\"Maj.\",\n\t\"Mr.\",\n\t\"Mrs.\",\n\t\"Ms.\",\n\t\"Msgr.\",\n\t\"Mx.\",\n\t\"No.\",\n\t\"Pfc.\",\n\t\"Pr.\",\n\t\"Prof.\",\n\t\"Pvt.\",\n\t\"Rep.\",\n\t\"Reps.\",\n\t\"Rev.\",\n\t\"Rt. Hon.\",\n\t\"Sen.\",\n\t\"Sens.\",\n\t\"Sgt.\",\n\t\"Sps.\",\n\t\"Sr.\",\n\t\"St.\",\n\t\"vs.\",\n\t\"i.e.\",\n\t\"e.g.\",\n\t\"viz.\",\n\t\"Mt.\",\n];\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAPA,IAAAA,QAAA,GAAAC,OAAA,CAAAC,OAAA,GAQe,CACd,MAAM,EACN,MAAM,EACN,MAAM,EACN,MAAM,EACN,KAAK,EACL,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,MAAM,EACN,KAAK,EACL,MAAM,EACN,KAAK,EACL,MAAM,EACN,MAAM,EACN,MAAM,EACN,KAAK,EACL,QAAQ,EACR,KAAK,EACL,MAAM,EACN,KAAK,EACL,MAAM,EACN,KAAK,EACL,OAAO,EACP,KAAK,EACL,KAAK,EACL,MAAM,EACN,KAAK,EACL,OAAO,EACP,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,UAAU,EACV,MAAM,EACN,OAAO,EACP,MAAM,EACN,MAAM,EACN,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,MAAM,EACN,KAAK,CACL","ignoreList":[]}

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

@@ -0,0 +1,20 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+/**
+ * Returns an array with exceptions for the sentence beginning researcher.
+ * @type {Array} The array filled with exceptions.
+ */
+var _default = exports.default = [
+// Definite articles:
+"the",
+// Indefinite articles:
+"a", "an",
+// Numbers 1-10:
+"one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten",
+// Demonstrative pronouns:
+"this", "that", "these", "those"];
+//# sourceMappingURL=firstWordExceptions.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"firstWordExceptions.js","names":["_default","exports","default"],"sources":["../../../../../src/languageProcessing/languages/en/config/firstWordExceptions.js"],"sourcesContent":["/**\n * Returns an array with exceptions for the sentence beginning researcher.\n * @type {Array} The array filled with exceptions.\n */\nexport default [\n\t// Definite articles:\n\t\"the\",\n\t// Indefinite articles:\n\t\"a\", \"an\",\n\t// Numbers 1-10:\n\t\"one\", \"two\", \"three\", \"four\", \"five\", \"six\", \"seven\", \"eight\", \"nine\", \"ten\",\n\t// Demonstrative pronouns:\n\t\"this\", \"that\", \"these\", \"those\",\n];\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AAHA,IAAAA,QAAA,GAAAC,OAAA,CAAAC,OAAA,GAIe;AACd;AACA,KAAK;AACL;AACA,GAAG,EAAE,IAAI;AACT;AACA,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK;AAC7E;AACA,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,CAChC","ignoreList":[]}