axyseo 2.0.0-alpha.0.0.2 → 2.0.0-alpha.0.0.21

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

@@ -0,0 +1,390 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = stem;
+/*
+ * Copyright (c) 2001, Dr Martin Porter,
+ * Copyright (c) 2002, Richard Boulton.
+ *
+ * All rights reserved.
+ * Redistribution and use in source and binary forms, with or without modification, are permitted provided
+ * that the following conditions are met:
+ * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer
+ * in the documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products
+ * derived from this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
+ * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
+ * IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
+ * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
+ * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+ * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/**
+ * Checks if the input character is a Hungarian vowel.
+ *
+ * @param {Object} morphologyData   The Hungarian morphology data.
+ * @param {string} word             The word to check
+ * @returns {number} Whether the input character is a Hungarian vowel.
+ */
+const isVowel = function (morphologyData, word) {
+  const vowels = morphologyData.externalStemmer.vowels;
+  const regex = new RegExp(vowels);
+  return word.search(regex);
+};
+
+/**
+ * Defines consonants or digraphs position.
+ *
+ * @param {Object} morphologyData   Morphology data file
+ * @param {string} word             The word to check
+ * @returns {number} the position of the digraph or consonant
+ */
+const consonantOrDigraphPosition = function (morphologyData, word) {
+  const digraphRegex = new RegExp(morphologyData.externalStemmer.digraphs);
+  const consonantRegex = new RegExp(morphologyData.externalStemmer.consonants);
+  const digraphPosition = word.search(digraphRegex);
+  const consonantPosition = word.search(consonantRegex);
+  if (digraphPosition === consonantPosition) {
+    return digraphPosition + 1;
+  }
+  return consonantPosition;
+};
+
+/**
+ * Defines the R1 region: Checks if the word begins with a vowel: defines R1 as the region after the first consonant or diagraph
+ * Checks if the word begins with a consonant: defines R1 as the region after the first vowel
+ *
+ * @param {Object} morphologyData   The Morphology data file
+ * @param {string} word             The word to stem
+ * @returns {number} The R1 region index.
+ */
+const findR1Position = function (morphologyData, word) {
+  const vowelPosition = isVowel(morphologyData, word);
+  if (vowelPosition === 0) {
+    const consonantOrDigraph = consonantOrDigraphPosition(morphologyData, word);
+    return consonantOrDigraph + 1;
+  }
+  return vowelPosition + 1;
+};
+
+/**
+ * Searches on of the following noun case suffixes: al, el and stems the suffix if found in R1 and preceded by a double consonant
+ * and removes one of the double consonants
+ *
+ * @param {string} word             The word to stem
+ * @param {Object} morphologyData   The morphology data file with suffix list
+ *
+ * @returns {string}    The stemmed word.
+ *
+ */
+const stemSuffixes1 = function (word, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix = word.search(new RegExp(morphologyData.externalStemmer.suffixes1));
+  if (suffix >= r1Position) {
+    let wordAfterStemming = word.slice(0, -2);
+    const doubleConsonantRegex = new RegExp(morphologyData.externalStemmer.doubleConsonants);
+    const checkIfWordEndsOnDoubleConsonant = wordAfterStemming.search(doubleConsonantRegex);
+    if (checkIfWordEndsOnDoubleConsonant !== -1) {
+      wordAfterStemming = wordAfterStemming.slice(0, -1);
+    }
+    const tripleConsonantsRegex = new RegExp(morphologyData.externalStemmer.tripleDoubleConsonants);
+    const checkIfWordEndsOnTripleDoubleConsonant = wordAfterStemming.search(tripleConsonantsRegex);
+    if (checkIfWordEndsOnTripleDoubleConsonant !== -1) {
+      wordAfterStemming = wordAfterStemming.slice(0, -2) + wordAfterStemming.charAt(wordAfterStemming.length - 1);
+    }
+    if (wordAfterStemming.length !== word.slice(0, -2).length) {
+      return wordAfterStemming;
+    }
+  }
+  return word;
+};
+
+/**
+ * Searches for the longer of the following suffixes: ban   ben   ba   be   ra   re   nak   nek   val   vel   tól   tõl
+ * ról   rõl   ból   bõl   hoz   hez   höz   nál   nél   ig   at   et   ot   öt   ért   képp   képpen   kor   ul   ül
+ * vá   vé   onként   enként   anként   ként   en   on   an   ön   n   t and stems the suffix if found in R1
+ * If the suffix is preceded by á replaces with a. If the suffix is preceded by é replaces with e
+ *
+ * @param {string} word             The word to stem
+ * @param {string} suffixes2        The suffixes from group 2
+ * @param {Object} morphologyData   The Morphology data file
+ *
+ * @returns {string}    The stemmed word
+ */
+const stemSuffixes2 = function (word, suffixes2, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix2 = word.search(new RegExp(suffixes2));
+  if (suffix2 >= r1Position) {
+    const wordAfterStemming = word.substring(0, suffix2);
+    if (wordAfterStemming.endsWith("á")) {
+      return wordAfterStemming.replace(/á$/i, "a");
+    }
+    if (wordAfterStemming.endsWith("é")) {
+      return wordAfterStemming.replace(/é$/i, "e");
+    }
+    return wordAfterStemming;
+  }
+  return word;
+};
+
+/**
+ * Searches for the longest among the following suffixes in R1: án   ánként and replace by a
+ * Search for én in R1 and replace with e
+ *
+ * @param {string} word             The word to check for the suffix.
+ * @param {string} suffixes3        The suffixes to check.
+ * @param {Object} morphologyData   The Morphology data file
+ *
+ * @returns {string} The word without the suffix.
+ */
+const stemSuffixes3 = function (word, suffixes3, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix3 = word.search(new RegExp(suffixes3));
+  if (suffix3 >= r1Position) {
+    return word.substring(0, suffix3) + "a";
+  }
+  return word;
+};
+
+/**
+ * Searches for the longest among following suffixes astul   estül   stul   stül in R1 and delete.
+ *
+ * @param {string} word             The word to check for the suffix.
+ * @param {string} suffixes4        The suffixes to check.
+ * @param {Object} morphologyData   The Morphology data file
+ *
+ * @returns {string} The word without the suffix.
+ */
+const stemSuffixes4 = function (word, suffixes4, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix4 = word.search(new RegExp(suffixes4));
+  if (suffix4 >= r1Position) {
+    return word.substring(0, suffix4);
+  }
+  return word;
+};
+
+/**
+ * Searches for one of the suffixes Search for one of the following suffixes: á   é and delete. If preceded by double
+ * Consonant, remove one of the double consonants.
+ *
+ * @param {string} word             The word to check for the suffix.
+ * @param {string} suffixes6        The suffixes to check.
+ * @param {Object} morphologyData   The Morphology data file
+ *
+ * @returns {string} The word without the suffix.
+ */
+const stemSuffixes5 = function (word, suffixes6, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix6 = word.search(new RegExp(suffixes6));
+  if (suffix6 >= r1Position) {
+    let wordAfterStemming = word.slice(0, -1);
+    const doubleConsonantRegex = new RegExp(morphologyData.externalStemmer.doubleConsonants);
+    const checkIfWordEndsOnDoubleConsonant = wordAfterStemming.search(doubleConsonantRegex);
+    if (checkIfWordEndsOnDoubleConsonant !== -1) {
+      wordAfterStemming = wordAfterStemming.slice(0, -1);
+    }
+    return wordAfterStemming;
+  }
+  return word;
+};
+
+/**
+ * Searches for one of the suffixes in R1 and delete oké   öké   aké   eké   ké   éi   é.
+ *
+ * @param {string} word             The word to check for the suffix.
+ * @param {string} suffixes6        The suffixes to check.
+ * @param {Object} morphologyData   The Morphology data file
+ *
+ * @returns {string} The word without the suffix.
+ */
+const stemSuffixes6 = function (word, suffixes6, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix6 = word.search(new RegExp(suffixes6));
+  if (suffix6 >= r1Position) {
+    return word.substring(0, suffix6);
+  }
+  return word;
+};
+
+/**
+ * Searches for the longest one of the suffixes in R1 and delete: ünk   unk   nk   juk   jük   uk   ük   em   om   am
+ * m   od   ed ad   öd   d   ja   je   a   e o
+ * @param {string} word             The word to check for the suffix.
+ * @param {string} suffixes7        The suffixes to check.
+ * @param {Object} morphologyData   The Morphology data file
+ * @returns {string} The word without the suffix.
+ */
+const stemSuffixes7 = function (word, suffixes7, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix7 = word.search(new RegExp(suffixes7));
+  if (suffix7 >= r1Position) {
+    return word.substring(0, suffix7);
+  }
+  return word;
+};
+
+/**
+ * Searches for the longest one of these suffixes in R1: jaim, jeim, aim, eim, im, jaid, eid, aid, eid, id, jai, jei, ai,
+ * ei, i, jaink, jeink, eink, aink, ink, jaitok, jeitek, aitok, eitek, itek, jeik, jaik, aik, eik, ik and stem it
+ *
+ * @param {string} word             The word to check.
+ * @param {string} suffixes8        The suffixes to check.
+ * @param {Object} morphologyData   The Morphology data file
+ * @returns {string}    The stemmed word.
+ */
+const stemSuffixes8 = function (word, suffixes8, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix8 = word.search(new RegExp(suffixes8));
+  if (suffix8 >= r1Position) {
+    return word.substring(0, suffix8);
+  }
+  return word;
+};
+
+/**
+ * Searches for the longest one of these suffixes in R1 ánk ájuk ám ád á and replace  with a
+ * Searches the longest one of the suffixes in R1 énk éjük ém éd é and replace with e
+ *
+ * @param {string} word             The word to check for the suffix.
+ * @param {Object} suffixes9     	The suffixes to check.
+ * @param {Object} morphologyData	The Morphology data file
+ *
+ * @returns {string} The word without the suffix.
+ */
+const stemSuffixes9 = function (word, suffixes9, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffixes9a = word.search(new RegExp(suffixes9.suffixes9a));
+  if (suffixes9a >= r1Position) {
+    return word.substring(0, suffixes9a) + "a";
+  }
+  const suffixes9b = word.search(new RegExp(suffixes9.suffixes9b));
+  if (suffixes9b >= r1Position) {
+    return word.substring(0, suffixes9b) + "e";
+  }
+  return word;
+};
+
+/**
+ * Searches for the longest one of these suffixes in R1 áim   áid   ái   áink   áitok   áik and replace with a, and
+ * Search for the longest one of the suffixes in R1 éim   éid     éi   éink   éitek   éik and replace with e
+ *
+ * @param {string} word         	The word to check.
+ * @param {string} suffixes10  		The suffixes to stem.
+ * @param {string} morphologyData 	The Morphology data file
+ * @returns {string}    The stemmed word.
+ */
+const stemSuffixes10 = function (word, suffixes10, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix10 = word.search(new RegExp(suffixes10));
+  if (suffix10 >= r1Position) {
+    return word.substring(0, suffix10) + "a";
+  }
+  return word;
+};
+
+/**
+ * Searches for suffix ák and ék in R1 and replace with a and e respectively.
+ *
+ * @param {string} 	word         	The word to check.
+ * @param {Object} 	suffixes11  	The suffixes to stem.
+ * @param {Object} 	morphologyData 	The Morphology data file.
+ *
+ * @returns {string}    The stemmed word.
+ */
+const stemSuffixes11 = function (word, suffixes11, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix11a = word.search(new RegExp(suffixes11.suffixes11a));
+  if (suffix11a >= r1Position) {
+    return word.slice(0, -2) + "a";
+  }
+  const suffix11b = word.search(new RegExp(suffixes11.suffixes11b));
+  if (suffix11b >= r1Position) {
+    return word.slice(0, -2) + "e";
+  }
+  return word;
+};
+
+/**
+ * Searches for the longest of these suffixes ök ok ek ak k in R1 and stem the suffix
+ *
+ * @param {string} word         The word to check.
+ * @param {string}suffixes12  The suffixes to stem.
+ * @param {Object} morphologyData Morphology data file
+ * @returns {string}    The stemmed word.
+ */
+const stemSuffixes12 = function (word, suffixes12, morphologyData) {
+  if (word.length < 3) {
+    return word;
+  }
+  const r1Position = findR1Position(morphologyData, word);
+  const suffix12 = word.search(new RegExp(suffixes12));
+  if (suffix12 >= r1Position) {
+    return word.substring(0, suffix12);
+  }
+  return word;
+};
+
+/**
+ * Stems Hungarian words.
+ *
+ * @param {string} word            The word to stem.
+ * @param {Object} morphologyData  The Hungarian morphology data.
+ *
+ * @returns {string} The stemmed word.
+ */
+function stem(word, morphologyData) {
+  const wordAfterSuffixes1 = stemSuffixes1(word, morphologyData);
+  const wordAfterSuffixes2 = stemSuffixes2(wordAfterSuffixes1, morphologyData.externalStemmer.suffixes2, morphologyData);
+  const wordAfterSuffixes3 = stemSuffixes3(wordAfterSuffixes2, morphologyData.externalStemmer.suffixes3, morphologyData);
+  const wordAfterSuffixes4 = stemSuffixes4(wordAfterSuffixes3, morphologyData.externalStemmer.suffixes4, morphologyData);
+  const wordAfterSuffixes5 = stemSuffixes5(wordAfterSuffixes4, morphologyData.externalStemmer.suffixes5, morphologyData);
+  const wordAfterSuffixes6 = stemSuffixes6(wordAfterSuffixes5, morphologyData.externalStemmer.suffixes6, morphologyData);
+  const wordAfterSuffixes7 = stemSuffixes7(wordAfterSuffixes6, morphologyData.externalStemmer.suffixes7, morphologyData);
+  const wordAfterSuffixes8 = stemSuffixes8(wordAfterSuffixes7, morphologyData.externalStemmer.suffixes8, morphologyData);
+  const wordAfterSuffixes9 = stemSuffixes9(wordAfterSuffixes8, morphologyData.externalStemmer.suffixes9, morphologyData);
+  const wordAfterSuffixes10 = stemSuffixes10(wordAfterSuffixes9, morphologyData.externalStemmer.suffixes10, morphologyData);
+  const wordAfterSuffixes11 = stemSuffixes11(wordAfterSuffixes10, morphologyData.externalStemmer.suffixes11, morphologyData);
+  return stemSuffixes12(wordAfterSuffixes11, morphologyData.externalStemmer.suffixes12, morphologyData);
+}
+//# sourceMappingURL=stem.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"stem.js","names":["isVowel","morphologyData","word","vowels","externalStemmer","regex","RegExp","search","consonantOrDigraphPosition","digraphRegex","digraphs","consonantRegex","consonants","digraphPosition","consonantPosition","findR1Position","vowelPosition","consonantOrDigraph","stemSuffixes1","length","r1Position","suffix","suffixes1","wordAfterStemming","slice","doubleConsonantRegex","doubleConsonants","checkIfWordEndsOnDoubleConsonant","tripleConsonantsRegex","tripleDoubleConsonants","checkIfWordEndsOnTripleDoubleConsonant","charAt","stemSuffixes2","suffixes2","suffix2","substring","endsWith","replace","stemSuffixes3","suffixes3","suffix3","stemSuffixes4","suffixes4","suffix4","stemSuffixes5","suffixes6","suffix6","stemSuffixes6","stemSuffixes7","suffixes7","suffix7","stemSuffixes8","suffixes8","suffix8","stemSuffixes9","suffixes9","suffixes9a","suffixes9b","stemSuffixes10","suffixes10","suffix10","stemSuffixes11","suffixes11","suffix11a","suffixes11a","suffix11b","suffixes11b","stemSuffixes12","suffixes12","suffix12","stem","wordAfterSuffixes1","wordAfterSuffixes2","wordAfterSuffixes3","wordAfterSuffixes4","wordAfterSuffixes5","suffixes5","wordAfterSuffixes6","wordAfterSuffixes7","wordAfterSuffixes8","wordAfterSuffixes9","wordAfterSuffixes10","wordAfterSuffixes11"],"sources":["../../../../../../src/languageProcessing/languages/hu/helpers/internal/stem.js"],"sourcesContent":["/*\n * Copyright (c) 2001, Dr Martin Porter,\n * Copyright (c) 2002, Richard Boulton.\n *\n * All rights reserved.\n * Redistribution and use in source and binary forms, with or without modification, are permitted provided\n * that the following conditions are met:\n * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.\n * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer\n * in the documentation and/or other materials provided with the distribution.\n * 3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products\n * derived from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES,\n * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.\n * IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,\n * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,\n * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,\n * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n/**\n * Checks if the input character is a Hungarian vowel.\n *\n * @param {Object} morphologyData   The Hungarian morphology data.\n * @param {string} word             The word to check\n * @returns {number} Whether the input character is a Hungarian vowel.\n */\nconst isVowel = function( morphologyData, word ) {\n\tconst vowels = morphologyData.externalStemmer.vowels;\n\tconst regex = new RegExp( vowels );\n\treturn word.search( regex );\n};\n\n/**\n * Defines consonants or digraphs position.\n *\n * @param {Object} morphologyData   Morphology data file\n * @param {string} word             The word to check\n * @returns {number} the position of the digraph or consonant\n */\nconst consonantOrDigraphPosition = function( morphologyData, word ) {\n\tconst digraphRegex = new RegExp( morphologyData.externalStemmer.digraphs );\n\tconst consonantRegex = new RegExp( morphologyData.externalStemmer.consonants );\n\tconst digraphPosition = word.search( digraphRegex );\n\tconst consonantPosition = word.search( consonantRegex );\n\tif ( digraphPosition === consonantPosition ) {\n\t\treturn digraphPosition + 1;\n\t}\n\treturn consonantPosition;\n};\n\n/**\n * Defines the R1 region: Checks if the word begins with a vowel: defines R1 as the region after the first consonant or diagraph\n * Checks if the word begins with a consonant: defines R1 as the region after the first vowel\n *\n * @param {Object} morphologyData   The Morphology data file\n * @param {string} word             The word to stem\n * @returns {number} The R1 region index.\n */\nconst findR1Position = function( morphologyData, word ) {\n\tconst vowelPosition = isVowel( morphologyData, word );\n\tif ( vowelPosition === 0 ) {\n\t\tconst consonantOrDigraph = consonantOrDigraphPosition( morphologyData, word );\n\t\treturn ( consonantOrDigraph + 1 );\n\t}\n\treturn ( vowelPosition + 1 );\n};\n\n/**\n * Searches on of the following noun case suffixes: al, el and stems the suffix if found in R1 and preceded by a double consonant\n * and removes one of the double consonants\n *\n * @param {string} word             The word to stem\n * @param {Object} morphologyData   The morphology data file with suffix list\n *\n * @returns {string}    The stemmed word.\n *\n */\nconst stemSuffixes1 = function( word, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix = word.search( new RegExp( morphologyData.externalStemmer.suffixes1 ) );\n\tif ( suffix >= r1Position ) {\n\t\tlet wordAfterStemming = word.slice( 0, -2 );\n\n\t\tconst doubleConsonantRegex = new RegExp( morphologyData.externalStemmer.doubleConsonants );\n\t\tconst checkIfWordEndsOnDoubleConsonant = wordAfterStemming.search( doubleConsonantRegex );\n\t\tif ( checkIfWordEndsOnDoubleConsonant !== -1 ) {\n\t\t\twordAfterStemming = wordAfterStemming.slice( 0, -1 );\n\t\t}\n\n\t\tconst tripleConsonantsRegex = new RegExp( morphologyData.externalStemmer.tripleDoubleConsonants );\n\t\tconst checkIfWordEndsOnTripleDoubleConsonant = wordAfterStemming.search( tripleConsonantsRegex );\n\t\tif ( checkIfWordEndsOnTripleDoubleConsonant !== -1 ) {\n\t\t\twordAfterStemming = wordAfterStemming.slice( 0, -2 ) + wordAfterStemming.charAt( wordAfterStemming.length - 1 );\n\t\t}\n\n\t\tif ( wordAfterStemming.length !== word.slice( 0, -2 ).length ) {\n\t\t\treturn wordAfterStemming;\n\t\t}\n\t}\n\treturn word;\n};\n\n/**\n * Searches for the longer of the following suffixes: ban   ben   ba   be   ra   re   nak   nek   val   vel   tól   tõl\n * ról   rõl   ból   bõl   hoz   hez   höz   nál   nél   ig   at   et   ot   öt   ért   képp   képpen   kor   ul   ül\n * vá   vé   onként   enként   anként   ként   en   on   an   ön   n   t and stems the suffix if found in R1\n * If the suffix is preceded by á replaces with a. If the suffix is preceded by é replaces with e\n *\n * @param {string} word             The word to stem\n * @param {string} suffixes2        The suffixes from group 2\n * @param {Object} morphologyData   The Morphology data file\n *\n * @returns {string}    The stemmed word\n */\nconst stemSuffixes2 = function( word, suffixes2, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix2 = word.search( new RegExp( suffixes2 ) );\n\tif ( suffix2 >= r1Position ) {\n\t\tconst wordAfterStemming = word.substring( 0, suffix2 );\n\t\tif ( wordAfterStemming.endsWith( \"á\" ) ) {\n\t\t\treturn wordAfterStemming.replace( /á$/i, \"a\" );\n\t\t}\n\t\tif ( wordAfterStemming.endsWith( \"é\" ) ) {\n\t\t\treturn wordAfterStemming.replace( /é$/i, \"e\" );\n\t\t}\n\t\treturn wordAfterStemming;\n\t}\n\treturn word;\n};\n\n/**\n * Searches for the longest among the following suffixes in R1: án   ánként and replace by a\n * Search for én in R1 and replace with e\n *\n * @param {string} word             The word to check for the suffix.\n * @param {string} suffixes3        The suffixes to check.\n * @param {Object} morphologyData   The Morphology data file\n *\n * @returns {string} The word without the suffix.\n */\nconst stemSuffixes3 = function( word, suffixes3, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix3 = word.search( new RegExp( suffixes3 ) );\n\tif ( suffix3 >= r1Position ) {\n\t\treturn ( word.substring( 0, suffix3 ) + \"a\" );\n\t}\n\n\treturn word;\n};\n\n/**\n * Searches for the longest among following suffixes astul   estül   stul   stül in R1 and delete.\n *\n * @param {string} word             The word to check for the suffix.\n * @param {string} suffixes4        The suffixes to check.\n * @param {Object} morphologyData   The Morphology data file\n *\n * @returns {string} The word without the suffix.\n */\nconst stemSuffixes4 = function( word, suffixes4, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix4 = word.search( new RegExp( suffixes4 ) );\n\tif ( suffix4 >= r1Position ) {\n\t\treturn ( word.substring( 0, suffix4 ) );\n\t}\n\treturn word;\n};\n\n/**\n * Searches for one of the suffixes Search for one of the following suffixes: á   é and delete. If preceded by double\n * Consonant, remove one of the double consonants.\n *\n * @param {string} word             The word to check for the suffix.\n * @param {string} suffixes6        The suffixes to check.\n * @param {Object} morphologyData   The Morphology data file\n *\n * @returns {string} The word without the suffix.\n */\nconst stemSuffixes5 = function( word, suffixes6, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix6 = word.search( new RegExp( suffixes6 ) );\n\tif ( suffix6 >= r1Position ) {\n\t\tlet wordAfterStemming = word.slice( 0, -1 );\n\t\tconst doubleConsonantRegex = new RegExp( morphologyData.externalStemmer.doubleConsonants );\n\t\tconst checkIfWordEndsOnDoubleConsonant = wordAfterStemming.search( doubleConsonantRegex );\n\t\tif ( checkIfWordEndsOnDoubleConsonant !== -1 ) {\n\t\t\twordAfterStemming = wordAfterStemming.slice( 0, -1 );\n\t\t}\n\t\treturn wordAfterStemming;\n\t}\n\treturn word;\n};\n\n/**\n * Searches for one of the suffixes in R1 and delete oké   öké   aké   eké   ké   éi   é.\n *\n * @param {string} word             The word to check for the suffix.\n * @param {string} suffixes6        The suffixes to check.\n * @param {Object} morphologyData   The Morphology data file\n *\n * @returns {string} The word without the suffix.\n */\nconst stemSuffixes6 = function( word, suffixes6, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix6 = word.search( new RegExp( suffixes6 ) );\n\tif ( suffix6 >= r1Position ) {\n\t\treturn word.substring( 0, suffix6 );\n\t}\n\treturn word;\n};\n\n\n/**\n * Searches for the longest one of the suffixes in R1 and delete: ünk   unk   nk   juk   jük   uk   ük   em   om   am\n * m   od   ed ad   öd   d   ja   je   a   e o\n * @param {string} word             The word to check for the suffix.\n * @param {string} suffixes7        The suffixes to check.\n * @param {Object} morphologyData   The Morphology data file\n * @returns {string} The word without the suffix.\n */\nconst stemSuffixes7 = function( word, suffixes7, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix7 = word.search( new RegExp( suffixes7 ) );\n\tif ( suffix7 >= r1Position ) {\n\t\treturn word.substring( 0, suffix7 );\n\t}\n\treturn word;\n};\n\n/**\n * Searches for the longest one of these suffixes in R1: jaim, jeim, aim, eim, im, jaid, eid, aid, eid, id, jai, jei, ai,\n * ei, i, jaink, jeink, eink, aink, ink, jaitok, jeitek, aitok, eitek, itek, jeik, jaik, aik, eik, ik and stem it\n *\n * @param {string} word             The word to check.\n * @param {string} suffixes8        The suffixes to check.\n * @param {Object} morphologyData   The Morphology data file\n * @returns {string}    The stemmed word.\n */\nconst stemSuffixes8 = function( word, suffixes8, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix8 = word.search( new RegExp( suffixes8 ) );\n\tif ( suffix8 >= r1Position ) {\n\t\treturn word.substring( 0, suffix8 );\n\t}\n\treturn word;\n};\n\n/**\n * Searches for the longest one of these suffixes in R1 ánk ájuk ám ád á and replace  with a\n * Searches the longest one of the suffixes in R1 énk éjük ém éd é and replace with e\n *\n * @param {string} word             The word to check for the suffix.\n * @param {Object} suffixes9     \tThe suffixes to check.\n * @param {Object} morphologyData\tThe Morphology data file\n *\n * @returns {string} The word without the suffix.\n */\nconst stemSuffixes9 = function( word, suffixes9, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffixes9a = word.search( new RegExp( suffixes9.suffixes9a ) );\n\tif ( suffixes9a >= r1Position ) {\n\t\treturn word.substring( 0, suffixes9a ) + \"a\";\n\t}\n\tconst suffixes9b = word.search( new RegExp( suffixes9.suffixes9b ) );\n\tif ( suffixes9b >= r1Position ) {\n\t\treturn word.substring( 0, suffixes9b ) + \"e\";\n\t}\n\treturn word;\n};\n\n/**\n * Searches for the longest one of these suffixes in R1 áim   áid   ái   áink   áitok   áik and replace with a, and\n * Search for the longest one of the suffixes in R1 éim   éid     éi   éink   éitek   éik and replace with e\n *\n * @param {string} word         \tThe word to check.\n * @param {string} suffixes10  \t\tThe suffixes to stem.\n * @param {string} morphologyData \tThe Morphology data file\n * @returns {string}    The stemmed word.\n */\nconst stemSuffixes10 = function( word, suffixes10, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix10 = word.search( new RegExp( suffixes10 ) );\n\tif ( suffix10 >= r1Position ) {\n\t\treturn word.substring( 0, suffix10 ) + \"a\";\n\t}\n\treturn word;\n};\n\n/**\n * Searches for suffix ák and ék in R1 and replace with a and e respectively.\n *\n * @param {string} \tword         \tThe word to check.\n * @param {Object} \tsuffixes11  \tThe suffixes to stem.\n * @param {Object} \tmorphologyData \tThe Morphology data file.\n *\n * @returns {string}    The stemmed word.\n */\nconst stemSuffixes11 = function( word, suffixes11, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix11a = word.search( new RegExp( suffixes11.suffixes11a ) );\n\tif ( suffix11a >= r1Position ) {\n\t\treturn ( word.slice( 0, -2 ) + \"a\" );\n\t}\n\tconst suffix11b = word.search( new RegExp( suffixes11.suffixes11b ) );\n\tif ( suffix11b >= r1Position  ) {\n\t\treturn ( word.slice( 0, -2 ) + \"e\" );\n\t}\n\treturn word;\n};\n\n/**\n * Searches for the longest of these suffixes ök ok ek ak k in R1 and stem the suffix\n *\n * @param {string} word         The word to check.\n * @param {string}suffixes12  The suffixes to stem.\n * @param {Object} morphologyData Morphology data file\n * @returns {string}    The stemmed word.\n */\nconst stemSuffixes12 = function( word, suffixes12, morphologyData ) {\n\tif ( word.length < 3 ) {\n\t\treturn word;\n\t}\n\tconst r1Position = findR1Position( morphologyData, word );\n\tconst suffix12 = word.search( new RegExp( suffixes12 ) );\n\tif ( suffix12 >= r1Position ) {\n\t\treturn ( word.substring( 0, suffix12 ) );\n\t}\n\treturn word;\n};\n\n/**\n * Stems Hungarian words.\n *\n * @param {string} word            The word to stem.\n * @param {Object} morphologyData  The Hungarian morphology data.\n *\n * @returns {string} The stemmed word.\n */\nexport default function stem( word, morphologyData ) {\n\tconst wordAfterSuffixes1 = stemSuffixes1( word, morphologyData );\n\tconst wordAfterSuffixes2 = stemSuffixes2( wordAfterSuffixes1, morphologyData.externalStemmer.suffixes2, morphologyData );\n\tconst wordAfterSuffixes3 = stemSuffixes3( wordAfterSuffixes2, morphologyData.externalStemmer.suffixes3, morphologyData );\n\tconst wordAfterSuffixes4 = stemSuffixes4( wordAfterSuffixes3, morphologyData.externalStemmer.suffixes4, morphologyData );\n\tconst wordAfterSuffixes5 = stemSuffixes5( wordAfterSuffixes4, morphologyData.externalStemmer.suffixes5, morphologyData );\n\tconst wordAfterSuffixes6 = stemSuffixes6( wordAfterSuffixes5, morphologyData.externalStemmer.suffixes6, morphologyData );\n\tconst wordAfterSuffixes7 = stemSuffixes7( wordAfterSuffixes6, morphologyData.externalStemmer.suffixes7, morphologyData );\n\tconst wordAfterSuffixes8 = stemSuffixes8( wordAfterSuffixes7, morphologyData.externalStemmer.suffixes8, morphologyData );\n\tconst wordAfterSuffixes9 = stemSuffixes9( wordAfterSuffixes8, morphologyData.externalStemmer.suffixes9, morphologyData );\n\tconst wordAfterSuffixes10 = stemSuffixes10( wordAfterSuffixes9, morphologyData.externalStemmer.suffixes10, morphologyData );\n\tconst wordAfterSuffixes11 = stemSuffixes11( wordAfterSuffixes10, morphologyData.externalStemmer.suffixes11, morphologyData );\n\n\treturn ( stemSuffixes12( wordAfterSuffixes11, morphologyData.externalStemmer.suffixes12, morphologyData ) );\n}\n"],"mappings":";;;;;;AAAA;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,MAAMA,OAAO,GAAG,SAAAA,CAAUC,cAAc,EAAEC,IAAI,EAAG;EAChD,MAAMC,MAAM,GAAGF,cAAc,CAACG,eAAe,CAACD,MAAM;EACpD,MAAME,KAAK,GAAG,IAAIC,MAAM,CAAEH,MAAO,CAAC;EAClC,OAAOD,IAAI,CAACK,MAAM,CAAEF,KAAM,CAAC;AAC5B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,0BAA0B,GAAG,SAAAA,CAAUP,cAAc,EAAEC,IAAI,EAAG;EACnE,MAAMO,YAAY,GAAG,IAAIH,MAAM,CAAEL,cAAc,CAACG,eAAe,CAACM,QAAS,CAAC;EAC1E,MAAMC,cAAc,GAAG,IAAIL,MAAM,CAAEL,cAAc,CAACG,eAAe,CAACQ,UAAW,CAAC;EAC9E,MAAMC,eAAe,GAAGX,IAAI,CAACK,MAAM,CAAEE,YAAa,CAAC;EACnD,MAAMK,iBAAiB,GAAGZ,IAAI,CAACK,MAAM,CAAEI,cAAe,CAAC;EACvD,IAAKE,eAAe,KAAKC,iBAAiB,EAAG;IAC5C,OAAOD,eAAe,GAAG,CAAC;EAC3B;EACA,OAAOC,iBAAiB;AACzB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,cAAc,GAAG,SAAAA,CAAUd,cAAc,EAAEC,IAAI,EAAG;EACvD,MAAMc,aAAa,GAAGhB,OAAO,CAAEC,cAAc,EAAEC,IAAK,CAAC;EACrD,IAAKc,aAAa,KAAK,CAAC,EAAG;IAC1B,MAAMC,kBAAkB,GAAGT,0BAA0B,CAAEP,cAAc,EAAEC,IAAK,CAAC;IAC7E,OAASe,kBAAkB,GAAG,CAAC;EAChC;EACA,OAASD,aAAa,GAAG,CAAC;AAC3B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,aAAa,GAAG,SAAAA,CAAUhB,IAAI,EAAED,cAAc,EAAG;EACtD,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAMmB,MAAM,GAAGnB,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEL,cAAc,CAACG,eAAe,CAACkB,SAAU,CAAE,CAAC;EACpF,IAAKD,MAAM,IAAID,UAAU,EAAG;IAC3B,IAAIG,iBAAiB,GAAGrB,IAAI,CAACsB,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;IAE3C,MAAMC,oBAAoB,GAAG,IAAInB,MAAM,CAAEL,cAAc,CAACG,eAAe,CAACsB,gBAAiB,CAAC;IAC1F,MAAMC,gCAAgC,GAAGJ,iBAAiB,CAAChB,MAAM,CAAEkB,oBAAqB,CAAC;IACzF,IAAKE,gCAAgC,KAAK,CAAC,CAAC,EAAG;MAC9CJ,iBAAiB,GAAGA,iBAAiB,CAACC,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;IACrD;IAEA,MAAMI,qBAAqB,GAAG,IAAItB,MAAM,CAAEL,cAAc,CAACG,eAAe,CAACyB,sBAAuB,CAAC;IACjG,MAAMC,sCAAsC,GAAGP,iBAAiB,CAAChB,MAAM,CAAEqB,qBAAsB,CAAC;IAChG,IAAKE,sCAAsC,KAAK,CAAC,CAAC,EAAG;MACpDP,iBAAiB,GAAGA,iBAAiB,CAACC,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC,GAAGD,iBAAiB,CAACQ,MAAM,CAAER,iBAAiB,CAACJ,MAAM,GAAG,CAAE,CAAC;IAChH;IAEA,IAAKI,iBAAiB,CAACJ,MAAM,KAAKjB,IAAI,CAACsB,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC,CAACL,MAAM,EAAG;MAC9D,OAAOI,iBAAiB;IACzB;EACD;EACA,OAAOrB,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM8B,aAAa,GAAG,SAAAA,CAAU9B,IAAI,EAAE+B,SAAS,EAAEhC,cAAc,EAAG;EACjE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAMgC,OAAO,GAAGhC,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAE2B,SAAU,CAAE,CAAC;EACtD,IAAKC,OAAO,IAAId,UAAU,EAAG;IAC5B,MAAMG,iBAAiB,GAAGrB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAED,OAAQ,CAAC;IACtD,IAAKX,iBAAiB,CAACa,QAAQ,CAAE,GAAI,CAAC,EAAG;MACxC,OAAOb,iBAAiB,CAACc,OAAO,CAAE,KAAK,EAAE,GAAI,CAAC;IAC/C;IACA,IAAKd,iBAAiB,CAACa,QAAQ,CAAE,GAAI,CAAC,EAAG;MACxC,OAAOb,iBAAiB,CAACc,OAAO,CAAE,KAAK,EAAE,GAAI,CAAC;IAC/C;IACA,OAAOd,iBAAiB;EACzB;EACA,OAAOrB,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMoC,aAAa,GAAG,SAAAA,CAAUpC,IAAI,EAAEqC,SAAS,EAAEtC,cAAc,EAAG;EACjE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAMsC,OAAO,GAAGtC,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEiC,SAAU,CAAE,CAAC;EACtD,IAAKC,OAAO,IAAIpB,UAAU,EAAG;IAC5B,OAASlB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAEK,OAAQ,CAAC,GAAG,GAAG;EAC5C;EAEA,OAAOtC,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMuC,aAAa,GAAG,SAAAA,CAAUvC,IAAI,EAAEwC,SAAS,EAAEzC,cAAc,EAAG;EACjE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAMyC,OAAO,GAAGzC,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEoC,SAAU,CAAE,CAAC;EACtD,IAAKC,OAAO,IAAIvB,UAAU,EAAG;IAC5B,OAASlB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAEQ,OAAQ,CAAC;EACtC;EACA,OAAOzC,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM0C,aAAa,GAAG,SAAAA,CAAU1C,IAAI,EAAE2C,SAAS,EAAE5C,cAAc,EAAG;EACjE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAM4C,OAAO,GAAG5C,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEuC,SAAU,CAAE,CAAC;EACtD,IAAKC,OAAO,IAAI1B,UAAU,EAAG;IAC5B,IAAIG,iBAAiB,GAAGrB,IAAI,CAACsB,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;IAC3C,MAAMC,oBAAoB,GAAG,IAAInB,MAAM,CAAEL,cAAc,CAACG,eAAe,CAACsB,gBAAiB,CAAC;IAC1F,MAAMC,gCAAgC,GAAGJ,iBAAiB,CAAChB,MAAM,CAAEkB,oBAAqB,CAAC;IACzF,IAAKE,gCAAgC,KAAK,CAAC,CAAC,EAAG;MAC9CJ,iBAAiB,GAAGA,iBAAiB,CAACC,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;IACrD;IACA,OAAOD,iBAAiB;EACzB;EACA,OAAOrB,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM6C,aAAa,GAAG,SAAAA,CAAU7C,IAAI,EAAE2C,SAAS,EAAE5C,cAAc,EAAG;EACjE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAM4C,OAAO,GAAG5C,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEuC,SAAU,CAAE,CAAC;EACtD,IAAKC,OAAO,IAAI1B,UAAU,EAAG;IAC5B,OAAOlB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAEW,OAAQ,CAAC;EACpC;EACA,OAAO5C,IAAI;AACZ,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM8C,aAAa,GAAG,SAAAA,CAAU9C,IAAI,EAAE+C,SAAS,EAAEhD,cAAc,EAAG;EACjE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAMgD,OAAO,GAAGhD,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAE2C,SAAU,CAAE,CAAC;EACtD,IAAKC,OAAO,IAAI9B,UAAU,EAAG;IAC5B,OAAOlB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAEe,OAAQ,CAAC;EACpC;EACA,OAAOhD,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMiD,aAAa,GAAG,SAAAA,CAAUjD,IAAI,EAAEkD,SAAS,EAAEnD,cAAc,EAAG;EACjE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAMmD,OAAO,GAAGnD,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAE8C,SAAU,CAAE,CAAC;EACtD,IAAKC,OAAO,IAAIjC,UAAU,EAAG;IAC5B,OAAOlB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAEkB,OAAQ,CAAC;EACpC;EACA,OAAOnD,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMoD,aAAa,GAAG,SAAAA,CAAUpD,IAAI,EAAEqD,SAAS,EAAEtD,cAAc,EAAG;EACjE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAMsD,UAAU,GAAGtD,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEiD,SAAS,CAACC,UAAW,CAAE,CAAC;EACpE,IAAKA,UAAU,IAAIpC,UAAU,EAAG;IAC/B,OAAOlB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAEqB,UAAW,CAAC,GAAG,GAAG;EAC7C;EACA,MAAMC,UAAU,GAAGvD,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEiD,SAAS,CAACE,UAAW,CAAE,CAAC;EACpE,IAAKA,UAAU,IAAIrC,UAAU,EAAG;IAC/B,OAAOlB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAEsB,UAAW,CAAC,GAAG,GAAG;EAC7C;EACA,OAAOvD,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMwD,cAAc,GAAG,SAAAA,CAAUxD,IAAI,EAAEyD,UAAU,EAAE1D,cAAc,EAAG;EACnE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAM0D,QAAQ,GAAG1D,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEqD,UAAW,CAAE,CAAC;EACxD,IAAKC,QAAQ,IAAIxC,UAAU,EAAG;IAC7B,OAAOlB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAEyB,QAAS,CAAC,GAAG,GAAG;EAC3C;EACA,OAAO1D,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM2D,cAAc,GAAG,SAAAA,CAAU3D,IAAI,EAAE4D,UAAU,EAAE7D,cAAc,EAAG;EACnE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAM6D,SAAS,GAAG7D,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEwD,UAAU,CAACE,WAAY,CAAE,CAAC;EACrE,IAAKD,SAAS,IAAI3C,UAAU,EAAG;IAC9B,OAASlB,IAAI,CAACsB,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC,GAAG,GAAG;EACnC;EACA,MAAMyC,SAAS,GAAG/D,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAEwD,UAAU,CAACI,WAAY,CAAE,CAAC;EACrE,IAAKD,SAAS,IAAI7C,UAAU,EAAI;IAC/B,OAASlB,IAAI,CAACsB,KAAK,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC,GAAG,GAAG;EACnC;EACA,OAAOtB,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMiE,cAAc,GAAG,SAAAA,CAAUjE,IAAI,EAAEkE,UAAU,EAAEnE,cAAc,EAAG;EACnE,IAAKC,IAAI,CAACiB,MAAM,GAAG,CAAC,EAAG;IACtB,OAAOjB,IAAI;EACZ;EACA,MAAMkB,UAAU,GAAGL,cAAc,CAAEd,cAAc,EAAEC,IAAK,CAAC;EACzD,MAAMmE,QAAQ,GAAGnE,IAAI,CAACK,MAAM,CAAE,IAAID,MAAM,CAAE8D,UAAW,CAAE,CAAC;EACxD,IAAKC,QAAQ,IAAIjD,UAAU,EAAG;IAC7B,OAASlB,IAAI,CAACiC,SAAS,CAAE,CAAC,EAAEkC,QAAS,CAAC;EACvC;EACA,OAAOnE,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASoE,IAAIA,CAAEpE,IAAI,EAAED,cAAc,EAAG;EACpD,MAAMsE,kBAAkB,GAAGrD,aAAa,CAAEhB,IAAI,EAAED,cAAe,CAAC;EAChE,MAAMuE,kBAAkB,GAAGxC,aAAa,CAAEuC,kBAAkB,EAAEtE,cAAc,CAACG,eAAe,CAAC6B,SAAS,EAAEhC,cAAe,CAAC;EACxH,MAAMwE,kBAAkB,GAAGnC,aAAa,CAAEkC,kBAAkB,EAAEvE,cAAc,CAACG,eAAe,CAACmC,SAAS,EAAEtC,cAAe,CAAC;EACxH,MAAMyE,kBAAkB,GAAGjC,aAAa,CAAEgC,kBAAkB,EAAExE,cAAc,CAACG,eAAe,CAACsC,SAAS,EAAEzC,cAAe,CAAC;EACxH,MAAM0E,kBAAkB,GAAG/B,aAAa,CAAE8B,kBAAkB,EAAEzE,cAAc,CAACG,eAAe,CAACwE,SAAS,EAAE3E,cAAe,CAAC;EACxH,MAAM4E,kBAAkB,GAAG9B,aAAa,CAAE4B,kBAAkB,EAAE1E,cAAc,CAACG,eAAe,CAACyC,SAAS,EAAE5C,cAAe,CAAC;EACxH,MAAM6E,kBAAkB,GAAG9B,aAAa,CAAE6B,kBAAkB,EAAE5E,cAAc,CAACG,eAAe,CAAC6C,SAAS,EAAEhD,cAAe,CAAC;EACxH,MAAM8E,kBAAkB,GAAG5B,aAAa,CAAE2B,kBAAkB,EAAE7E,cAAc,CAACG,eAAe,CAACgD,SAAS,EAAEnD,cAAe,CAAC;EACxH,MAAM+E,kBAAkB,GAAG1B,aAAa,CAAEyB,kBAAkB,EAAE9E,cAAc,CAACG,eAAe,CAACmD,SAAS,EAAEtD,cAAe,CAAC;EACxH,MAAMgF,mBAAmB,GAAGvB,cAAc,CAAEsB,kBAAkB,EAAE/E,cAAc,CAACG,eAAe,CAACuD,UAAU,EAAE1D,cAAe,CAAC;EAC3H,MAAMiF,mBAAmB,GAAGrB,cAAc,CAAEoB,mBAAmB,EAAEhF,cAAc,CAACG,eAAe,CAAC0D,UAAU,EAAE7D,cAAe,CAAC;EAE5H,OAASkE,cAAc,CAAEe,mBAAmB,EAAEjF,cAAc,CAACG,eAAe,CAACgE,UAAU,EAAEnE,cAAe,CAAC;AAC1G","ignoreList":[]}

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

@@ -0,0 +1,53 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = isPassiveSentence;
+var _index = require("../../../../index.js");
+var _odikVerbs = _interopRequireDefault(require("../config/internal/odikVerbs"));
+var _morphologicalPassiveAffixes = require("../config/internal/morphologicalPassiveAffixes");
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+const {
+  getWords
+} = _index.languageProcessing;
+/**
+ * Checks if the input word's root is in the Hungarian verb roots list.
+ *
+ * @param {string} word             The word to check.
+ * @param {string[]} verbRootsList  The Hungarian verb roots list.
+ * @param {string[]} prefixes       The list of prefixes.
+ * @param {string[]} suffixes       The list of suffixes.
+ *
+ * @returns {Boolean}               Returns true if the root of the input word is in the list.
+ */
+const checkHungarianPassive = function (word, verbRootsList, prefixes, suffixes) {
+  return verbRootsList.some(root => {
+    return suffixes.some(function (suffix) {
+      const rootAndSuffix = root + suffix;
+
+      // Check whether the word ends in a root + suffix combination.
+      if (word.endsWith(rootAndSuffix)) {
+        const beforeRoot = word.slice(0, word.indexOf(rootAndSuffix));
+
+        // Word is passive if nothing precedes the root or the root is preceded by a valid prefix.
+        return beforeRoot === '' || prefixes.includes(beforeRoot);
+      }
+    });
+  });
+};
+
+/**
+ * Checks the passed sentence to see if it contains Hungarian passive verb-forms.
+ *
+ * @param {string} sentence     The sentence to match against.
+ *
+ * @returns {Boolean}           Whether the sentence contains Hungarian passive voice.
+ */
+function isPassiveSentence(sentence) {
+  const words = getWords(sentence);
+  const passiveVerbs1 = _odikVerbs.default.odikVerbStems1;
+  const passiveVerbs2 = _odikVerbs.default.odikVerbStems2;
+  return words.some(word => checkHungarianPassive(word, passiveVerbs1, _morphologicalPassiveAffixes.verbPrefixes, _morphologicalPassiveAffixes.odikSuffixes1) || checkHungarianPassive(word, passiveVerbs2, _morphologicalPassiveAffixes.verbPrefixes, _morphologicalPassiveAffixes.odikSuffixes2));
+}
+//# sourceMappingURL=isPassiveSentence.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"isPassiveSentence.js","names":["_index","require","_odikVerbs","_interopRequireDefault","_morphologicalPassiveAffixes","e","__esModule","default","getWords","languageProcessing","checkHungarianPassive","word","verbRootsList","prefixes","suffixes","some","root","suffix","rootAndSuffix","endsWith","beforeRoot","slice","indexOf","includes","isPassiveSentence","sentence","words","passiveVerbs1","passiveVerbs","odikVerbStems1","passiveVerbs2","odikVerbStems2","verbPrefixes","odikSuffixes1","odikSuffixes2"],"sources":["../../../../../src/languageProcessing/languages/hu/helpers/isPassiveSentence.js"],"sourcesContent":["import {languageProcessing} from '@axyseo/index.js';\nconst {getWords} = languageProcessing;\n\nimport passiveVerbs from '../config/internal/odikVerbs';\nimport {\n  verbPrefixes,\n  odikSuffixes1,\n  odikSuffixes2\n} from '../config/internal/morphologicalPassiveAffixes';\n\n/**\n * Checks if the input word's root is in the Hungarian verb roots list.\n *\n * @param {string} word             The word to check.\n * @param {string[]} verbRootsList  The Hungarian verb roots list.\n * @param {string[]} prefixes       The list of prefixes.\n * @param {string[]} suffixes       The list of suffixes.\n *\n * @returns {Boolean}               Returns true if the root of the input word is in the list.\n */\nconst checkHungarianPassive = function(word, verbRootsList, prefixes, suffixes) {\n  return verbRootsList.some(root => {\n    return suffixes.some(function(suffix) {\n      const rootAndSuffix = root + suffix;\n\n      // Check whether the word ends in a root + suffix combination.\n      if (word.endsWith(rootAndSuffix)) {\n        const beforeRoot = word.slice(0, word.indexOf(rootAndSuffix));\n\n        // Word is passive if nothing precedes the root or the root is preceded by a valid prefix.\n        return beforeRoot === '' || prefixes.includes(beforeRoot);\n      }\n    });\n  });\n};\n\n/**\n * Checks the passed sentence to see if it contains Hungarian passive verb-forms.\n *\n * @param {string} sentence     The sentence to match against.\n *\n * @returns {Boolean}           Whether the sentence contains Hungarian passive voice.\n */\nexport default function isPassiveSentence(sentence) {\n  const words = getWords(sentence);\n  const passiveVerbs1 = passiveVerbs.odikVerbStems1;\n  const passiveVerbs2 = passiveVerbs.odikVerbStems2;\n\n  return words.some(\n    word =>\n      checkHungarianPassive(word, passiveVerbs1, verbPrefixes, odikSuffixes1) ||\n      checkHungarianPassive(word, passiveVerbs2, verbPrefixes, odikSuffixes2)\n  );\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAGA,IAAAC,UAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,4BAAA,GAAAH,OAAA;AAIwD,SAAAE,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAPxD,MAAM;EAACG;AAAQ,CAAC,GAAGC,yBAAkB;AASrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,qBAAqB,GAAG,SAAAA,CAASC,IAAI,EAAEC,aAAa,EAAEC,QAAQ,EAAEC,QAAQ,EAAE;EAC9E,OAAOF,aAAa,CAACG,IAAI,CAACC,IAAI,IAAI;IAChC,OAAOF,QAAQ,CAACC,IAAI,CAAC,UAASE,MAAM,EAAE;MACpC,MAAMC,aAAa,GAAGF,IAAI,GAAGC,MAAM;;MAEnC;MACA,IAAIN,IAAI,CAACQ,QAAQ,CAACD,aAAa,CAAC,EAAE;QAChC,MAAME,UAAU,GAAGT,IAAI,CAACU,KAAK,CAAC,CAAC,EAAEV,IAAI,CAACW,OAAO,CAACJ,aAAa,CAAC,CAAC;;QAE7D;QACA,OAAOE,UAAU,KAAK,EAAE,IAAIP,QAAQ,CAACU,QAAQ,CAACH,UAAU,CAAC;MAC3D;IACF,CAAC,CAAC;EACJ,CAAC,CAAC;AACJ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASI,iBAAiBA,CAACC,QAAQ,EAAE;EAClD,MAAMC,KAAK,GAAGlB,QAAQ,CAACiB,QAAQ,CAAC;EAChC,MAAME,aAAa,GAAGC,kBAAY,CAACC,cAAc;EACjD,MAAMC,aAAa,GAAGF,kBAAY,CAACG,cAAc;EAEjD,OAAOL,KAAK,CAACX,IAAI,CACfJ,IAAI,IACFD,qBAAqB,CAACC,IAAI,EAAEgB,aAAa,EAAEK,yCAAY,EAAEC,0CAAa,CAAC,IACvEvB,qBAAqB,CAACC,IAAI,EAAEmB,aAAa,EAAEE,yCAAY,EAAEE,0CAAa,CAC1E,CAAC;AACH","ignoreList":[]}

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

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

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

@@ -0,0 +1 @@
+{"version":3,"file":"Clause.js","names":["_index","require","_getParticiples","_interopRequireDefault","_nonPassivesInVaAndVe","e","__esModule","default","values","languageProcessing","Clause","HungarianClause","constructor","clauseText","auxiliaries","_participles","getParticiples","getClauseText","checkParticiples","foundParticiples","filter","participle","nonPassivesInVaAndVe","includes","setPassive","length","_default","exports"],"sources":["../../../../../src/languageProcessing/languages/hu/values/Clause.js"],"sourcesContent":["import {languageProcessing} from '@axyseo/index.js';\nconst {values} = languageProcessing;\nconst {Clause} = values;\n\nimport getParticiples from '../helpers/internal/getParticiples';\nimport nonPassivesInVaAndVe from '../config/internal/nonPassivesInVaAndVe';\n\n/**\n * Creates a Clause object for the Hungarian language.\n */\nclass HungarianClause extends Clause {\n  /**\n   * Constructor.\n   *\n   * @param {string} clauseText   The text of the clause.\n   * @param {Array} auxiliaries   The auxiliaries.\n   *\n   * @constructor\n   */\n  constructor(clauseText, auxiliaries) {\n    super(clauseText, auxiliaries);\n    this._participles = getParticiples(this.getClauseText());\n    this.checkParticiples();\n  }\n\n  /**\n   * Checks if any exceptions are applicable to this participle that would result in the clause not being passive.\n   * If no exceptions are found, the clause is passive.\n   *\n   * @returns {void}\n   */\n  checkParticiples() {\n    const foundParticiples = this.getParticiples().filter(\n      participle => !nonPassivesInVaAndVe.includes(participle)\n    );\n\n    this.setPassive(foundParticiples.length > 0);\n  }\n}\n\nexport default HungarianClause;\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAIA,IAAAC,eAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,qBAAA,GAAAD,sBAAA,CAAAF,OAAA;AAA2E,SAAAE,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAJ3E,MAAM;EAACG;AAAM,CAAC,GAAGC,yBAAkB;AACnC,MAAM;EAACC;AAAM,CAAC,GAAGF,MAAM;AAKvB;AACA;AACA;AACA,MAAMG,eAAe,SAASD,MAAM,CAAC;EACnC;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,gBAAgB,GAAG,IAAI,CAACH,cAAc,CAAC,CAAC,CAACI,MAAM,CACnDC,UAAU,IAAI,CAACC,6BAAoB,CAACC,QAAQ,CAACF,UAAU,CACzD,CAAC;IAED,IAAI,CAACG,UAAU,CAACL,gBAAgB,CAACM,MAAM,GAAG,CAAC,CAAC;EAC9C;AACF;AAAC,IAAAC,QAAA,GAAAC,OAAA,CAAApB,OAAA,GAEcI,eAAe","ignoreList":[]}

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

@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _index = require("../../../index.js");
+var _firstWordExceptions = _interopRequireDefault(require("./config/firstWordExceptions"));
+var _functionWords = require("./config/functionWords");
+var _transitionWords = _interopRequireDefault(require("./config/transitionWords"));
+var _twoPartTransitionWords = _interopRequireDefault(require("./config/twoPartTransitionWords"));
+var _getStemmer = _interopRequireDefault(require("./helpers/getStemmer"));
+var _isPassiveSentence = _interopRequireDefault(require("./helpers/isPassiveSentence"));
+var _splitIntoTokensCustom = _interopRequireDefault(require("./helpers/splitIntoTokensCustom"));
+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);
+
+    // Delete the researches that are not available for Indonesian.
+    delete this.defaultResearches.getFleschReadingScore;
+    Object.assign(this.config, {
+      language: 'id',
+      passiveConstructionType: 'morphological',
+      firstWordExceptions: _firstWordExceptions.default,
+      functionWords: _functionWords.all,
+      transitionWords: _transitionWords.default,
+      twoPartTransitionWords: _twoPartTransitionWords.default,
+      areHyphensWordBoundaries: false
+    });
+    Object.assign(this.helpers, {
+      getStemmer: _getStemmer.default,
+      isPassiveSentence: _isPassiveSentence.default,
+      splitIntoTokensCustom: _splitIntoTokensCustom.default
+    });
+  }
+}
+exports.default = Researcher;
+//# sourceMappingURL=Researcher.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Researcher.js","names":["_index","require","_firstWordExceptions","_interopRequireDefault","_functionWords","_transitionWords","_twoPartTransitionWords","_getStemmer","_isPassiveSentence","_splitIntoTokensCustom","e","__esModule","default","AbstractResearcher","languageProcessing","Researcher","constructor","paper","defaultResearches","getFleschReadingScore","Object","assign","config","language","passiveConstructionType","firstWordExceptions","functionWords","transitionWords","twoPartTransitionWords","areHyphensWordBoundaries","helpers","getStemmer","isPassiveSentence","splitIntoTokensCustom","exports"],"sources":["../../../../src/languageProcessing/languages/id/Researcher.js"],"sourcesContent":["import {languageProcessing} from '@axyseo/index.js';\nconst {AbstractResearcher} = languageProcessing;\n\n// All config\nimport firstWordExceptions from './config/firstWordExceptions';\nimport {all as functionWords} from './config/functionWords';\nimport transitionWords from './config/transitionWords';\nimport twoPartTransitionWords from './config/twoPartTransitionWords';\n\n// All helpers\nimport getStemmer from './helpers/getStemmer';\nimport isPassiveSentence from './helpers/isPassiveSentence';\nimport splitIntoTokensCustom from './helpers/splitIntoTokensCustom';\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    // Delete the researches that are not available for Indonesian.\n    delete this.defaultResearches.getFleschReadingScore;\n\n    Object.assign(this.config, {\n      language: 'id',\n      passiveConstructionType: 'morphological',\n      firstWordExceptions,\n      functionWords,\n      transitionWords,\n      twoPartTransitionWords,\n      areHyphensWordBoundaries: false\n    });\n\n    Object.assign(this.helpers, {\n      getStemmer,\n      isPassiveSentence,\n      splitIntoTokensCustom\n    });\n  }\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAIA,IAAAC,oBAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,cAAA,GAAAH,OAAA;AACA,IAAAI,gBAAA,GAAAF,sBAAA,CAAAF,OAAA;AACA,IAAAK,uBAAA,GAAAH,sBAAA,CAAAF,OAAA;AAGA,IAAAM,WAAA,GAAAJ,sBAAA,CAAAF,OAAA;AACA,IAAAO,kBAAA,GAAAL,sBAAA,CAAAF,OAAA;AACA,IAAAQ,sBAAA,GAAAN,sBAAA,CAAAF,OAAA;AAAoE,SAAAE,uBAAAO,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAXpE,MAAM;EAACG;AAAkB,CAAC,GAAGC,yBAAkB;;AAE/C;;AAMA;;AAKA;AACA;AACA;AACe,MAAMC,UAAU,SAASF,kBAAkB,CAAC;EACzD;AACF;AACA;AACA;AACA;EACEG,WAAWA,CAACC,KAAK,EAAE;IACjB,KAAK,CAACA,KAAK,CAAC;;IAEZ;IACA,OAAO,IAAI,CAACC,iBAAiB,CAACC,qBAAqB;IAEnDC,MAAM,CAACC,MAAM,CAAC,IAAI,CAACC,MAAM,EAAE;MACzBC,QAAQ,EAAE,IAAI;MACdC,uBAAuB,EAAE,eAAe;MACxCC,mBAAmB,EAAnBA,4BAAmB;MACnBC,aAAa,EAAbA,kBAAa;MACbC,eAAe,EAAfA,wBAAe;MACfC,sBAAsB,EAAtBA,+BAAsB;MACtBC,wBAAwB,EAAE;IAC5B,CAAC,CAAC;IAEFT,MAAM,CAACC,MAAM,CAAC,IAAI,CAACS,OAAO,EAAE;MAC1BC,UAAU,EAAVA,mBAAU;MACVC,iBAAiB,EAAjBA,0BAAiB;MACjBC,qBAAqB,EAArBA;IACF,CAAC,CAAC;EACJ;AACF;AAACC,OAAA,CAAAtB,OAAA,GAAAG,UAAA","ignoreList":[]}

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

@@ -0,0 +1,18 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+/**
+ * Returns a list of exceptions for the sentence beginning research.
+ * @returns {Array} The list of exceptions.
+ */
+var _default = exports.default = [
+// Indefinite articles:
+"sebuah", "seorang", "sang", "si",
+// Numbers 1-10:
+"satu", "dua", "tiga", "empat", "lima", "enam", "tujuh", "delapan", "sembilan", "sepuluh", "sebelas", "seratus", "seribu", "sejuta", "semiliar", "setriliun",
+// Demonstrative pronouns:
+"ini", "itu", "hal", "ia"];
+//# sourceMappingURL=firstWordExceptions.js.map