axyseo 2.0.0-alpha.2 → 2.1.0

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

@@ -1 +1 @@
-{"version":3,"file":"stem.js","names":["matchWithRegexAndReplace","word","regexAndReplacement","replace","RegExp","checkWordsWithRemovedLastLetter","morphologyData","externalStemmer","characters","wordsWithLastAlefRemoved","includes","alef","wordsWithLastHamzaRemoved","alef_hamza_above","wordsWithLastMaksoraRemoved","yeh_maksorah","wordsWithLastYehRemoved","yeh","checkWordsWithRemovedFirstLetter","wordsWithFirstWawRemoved","waw","wordsWithFirstYehRemoved","checkWordsWithRemovedMiddleLetter","wordsWithMiddleWawRemoved","wordsWithMiddleYehRemoved","processTwoLetterWords","wordsWithRemovedDuplicateLetter","substring","wordAfterLastLetterCheck","wordAfterFirstLetterCheck","wordAfterMiddleLetterCheck","processThreeLetterWordsWithWeakLetterOrHamza","replacementPattern","functionToRunToGetRoot","wordAfterRemovingWeakLetterOrHamza","processThreeLetterWords","threeLetterRoots","waw_hamza","yeh_hamza","slice","wordAfterLastWeakLetterOrHamzaCheck","regexRemoveLastWeakLetterOrHamza","wordAfterMiddleWeakLetterOrHamzaCheck","regexRemoveMiddleWeakLetterOrHamza","regexReplaceMiddleLetterWithAlef","regexReplaceMiddleLetterWithAlefWithHamza","wordAfterReplacingMiddleLetterWithAlef","regexRemoveShaddaAndDuplicateLastLetter","checkFirstPatternAndGetRoot","numberSameLetters","length","checkSecondPatternAndGetRoot","pattern","root","i","feh","aen","lam","concat","countSharedLettersBetweenWordAndPattern","checkPatterns","wordAfterModification","regexReplaceFirstHamzaWithAlef","patterns","wordAfterCheckingFirstPattern","rootFound","wordAfterCheckingSecondPattern","checkIfWordIsRoot","fourLetterRoots","removeSuffix","suffixes","suffix","endsWith","removePrefix","prefixes","prefix","startsWith","processWordWithSuffix","wordAfterRemovingSuffix","outputAfterCheckingPatterns","processWordWithPrefix","wordAfterRemovingPrefix","outputAfterCheckingForSuffixes","findRoot","stemmedWord","outputAfterProcessingSuffix","outputAfterRemovingPrefix","processWordWithDefiniteArticle","wordAfterRemovingDefiniteArticle","definiteArticles","outputAfterTryingToFindRoot","processWordWithPrefixWaw","wordAfterRemovingWaw","stem","regexRemovingDiacritics","outputAfterProcessingDefiniteArticle","outputAfterProcessingPrefixWaw","wordAfterProcessingPrefix"],"sources":["../../../../../../src/languageProcessing/languages/ar/helpers/internal/stem.js"],"sourcesContent":["/**\n * Copyright (c) 2015 Mouaffak A. Sarhan\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\n/**\n * Tries to match a word with a regex. If matched, modifies the string according to the indicated pattern.\n *\n * @param {string}\t\tword\t\t\t\tThe word to check.\n * @param {string[]}\tregexAndReplacement\tThe regex to match the word with and what the word should be replaced with if it is matched.\n *\n * @returns {string}\tThe modified word or the original word if it was not matched.\n */\nconst matchWithRegexAndReplace = function( word, regexAndReplacement ) {\n\treturn word.replace( new RegExp( regexAndReplacement[ 0 ] ),\n\t\tregexAndReplacement[ 1 ] );\n};\n\n/**\n * Check if the word is on the list of three-letter roots which had the last weak letter removed (so are now two letters long).\n * If the word is on the list, add back the removed last letter and return the three-letter root.\n * Examples: طر -> طري (word with last weak letter ي (yeh) removed) , حص -> حصا (word with last weak letter ا (alef) removed)\n *\n * @param {string}\tword\t\t\tThe two-letter word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null}\tThe word with the last weak letter added back or null if the word was not found on a list.\n */\nconst checkWordsWithRemovedLastLetter = function( word, morphologyData ) {\n\tconst externalStemmer = morphologyData.externalStemmer;\n\tconst characters = externalStemmer.characters;\n\n\tif ( externalStemmer.wordsWithLastAlefRemoved.includes( word ) ) {\n\t\treturn word + characters.alef;\n\t}\n\tif ( externalStemmer.wordsWithLastHamzaRemoved.includes( word ) ) {\n\t\treturn word + characters.alef_hamza_above;\n\t}\n\tif ( externalStemmer.wordsWithLastMaksoraRemoved.includes( word ) ) {\n\t\treturn word + characters.yeh_maksorah;\n\t}\n\tif ( externalStemmer.wordsWithLastYehRemoved.includes( word ) ) {\n\t\treturn word + characters.yeh;\n\t}\n};\n\n/**\n * Check if the word is on the list of three-letter roots which had the first weak letter removed (so are now two letters long).\n * If the word is on the list, add back the removed first letter and return the three-letter root.\n * Examples: مض -> ومض (word with first weak letter و (waw) removed) , سن -> يسن (word with first weak letter ي (yeh) removed)\n *\n * @param {string}\tword\t\t\tThe two-letter word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null}\tThe word with the first weak letter added back or null if the word was not found on any list.\n */\nconst checkWordsWithRemovedFirstLetter = function( word, morphologyData ) {\n\tconst externalStemmer = morphologyData.externalStemmer;\n\tconst characters = externalStemmer.characters;\n\n\tif ( externalStemmer.wordsWithFirstWawRemoved.includes( word ) ) {\n\t\treturn characters.waw + word;\n\t}\n\tif ( externalStemmer.wordsWithFirstYehRemoved.includes( word ) ) {\n\t\treturn characters.yeh + word;\n\t}\n};\n\n/**\n * Check if the word is on the list of three-letter roots which had the middle weak letter removed (so are now two letters long).\n * If the word is on the list, add back the removed middle letter and return the three-letter root.\n * Examples: غز -> غوز (word with middle weak letter و (waw) removed), لن -> لين (word with middle weak letter ي (yeh) removed)\n *\n * @param {string}\tword\t\t\tThe two-letter word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null}\tThe word with the middle weak letter added back or null if the word was not found on a list.\n */\nconst checkWordsWithRemovedMiddleLetter = function( word, morphologyData ) {\n\tconst externalStemmer = morphologyData.externalStemmer;\n\tconst characters = externalStemmer.characters;\n\n\tif ( externalStemmer.wordsWithMiddleWawRemoved.includes( word ) ) {\n\t\treturn word[ 0 ] + characters.waw + word[ 1 ];\n\t}\n\tif ( externalStemmer.wordsWithMiddleYehRemoved.includes( word ) ) {\n\t\treturn word[ 0 ] + characters.yeh + word[ 1 ];\n\t}\n};\n\n\n/**\n * Find the root of two-letter words. Two-letter words usually come from three-letter roots for which a letter was deleted\n * as it is a duplicated last letter or a weak letter.\n *\n * @param {string}\tword\t\t\tThe two-letter word to process.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string}\tThe three-letter root or the input word if no root was found.\n */\nconst processTwoLetterWords = function( word, morphologyData ) {\n\t// Check whether the word is on the list of words with removed duplicate last letter. If it is, add back the removed letter to get the root.\n\tif ( morphologyData.externalStemmer.wordsWithRemovedDuplicateLetter.includes( word ) ) {\n\t\treturn word + word.substring( 1 );\n\t}\n\t// Check whether the word is on one of the lists of words with removed weak letter or hamza.\n\tconst wordAfterLastLetterCheck = checkWordsWithRemovedLastLetter( word, morphologyData );\n\tif ( wordAfterLastLetterCheck ) {\n\t\treturn wordAfterLastLetterCheck;\n\t}\n\tconst wordAfterFirstLetterCheck = checkWordsWithRemovedFirstLetter( word, morphologyData );\n\tif ( wordAfterFirstLetterCheck ) {\n\t\treturn wordAfterFirstLetterCheck;\n\t}\n\tconst wordAfterMiddleLetterCheck = checkWordsWithRemovedMiddleLetter( word, morphologyData );\n\tif ( wordAfterMiddleLetterCheck ) {\n\t\treturn wordAfterMiddleLetterCheck;\n\t}\n\n\treturn word;\n};\n\n/**\n * Remove the middle/last weak letter or hamza in a three letter word. Find its root by checking the appropriate exception lists\n * (words with middle letter removed or words with last letter removed) and attaching the removed letter back.\n * Example: بدء -> بد -> بدأ (three letter word with (ء) hamza ending,\n * which is found on the list of words with last letter removed after removing the suffix)\n *\n * @param {string}\t\tword\t\t\t\t\tThe three-letter word to check.\n * @param {Object}\t\tmorphologyData\t\t\tThe Arabic morphology data.\n * @param {string[]}\treplacementPattern\t\tThe regex to find and remove middle or last weak letter/hamza in three letter words\n * @param {function}\tfunctionToRunToGetRoot\tThe function that checks lists of words with either middle or last letter removed\n * \t\t\t\t\t\t\t\t\t\t\t\tand attaches it back.\n *\n * @returns {string|null}\tThe root or null if no root was found.\n */\nconst processThreeLetterWordsWithWeakLetterOrHamza = function( word, morphologyData, replacementPattern, functionToRunToGetRoot ) {\n\t// Find and remove middle or last weak letter or hamza\n\tconst wordAfterRemovingWeakLetterOrHamza = word.replace( new RegExp( replacementPattern[ 0 ] ),\n\t\treplacementPattern[ 1 ] );\n\tif ( wordAfterRemovingWeakLetterOrHamza !== word ) {\n\t\t/*\n\t\t * If the weak letter or hamza was removed, get the root by checking lists of words with middle/last weak letter\n\t\t * or hamza removed and attaching it back.\n\t\t */\n\t\treturn functionToRunToGetRoot( wordAfterRemovingWeakLetterOrHamza, morphologyData );\n\t}\n};\n\n/**\n * Get the root of three letter words.\n * Examples: ؤكد -> أكد (three letter word with ؤ (waw_hamza) beginning, قدّ -> قدد (three letter word which has a shadda on the second letter)\n *\n * @param {string}\tword\t\t\tThe three-letter word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null}\tThe root or the original input word (which may already be the root).\n */\nconst processThreeLetterWords = function( word, morphologyData ) {\n\tconst characters = morphologyData.externalStemmer.characters;\n\n\t// If the word exists on the list of three letter roots, return the word.\n\tif ( morphologyData.externalStemmer.threeLetterRoots.includes( word ) ) {\n\t\treturn word;\n\t}\n\t// If the first letter is ا/ ؤ/ ئ (yeh_hamza/waw_hamza/alef), change it to أ (alef_hamza_above).\n\tif ( word[ 0 ] === characters.alef || word[ 0 ] === characters.waw_hamza ||\n\t\t\tword[ 0 ] === characters.yeh_hamza ) {\n\t\tword = characters.alef_hamza_above + word.slice( 1 );\n\t}\n\n\t// If the last letter is a weak letter or a hamza, check if the word is a root that may get the last weak letter/hamza removed.\n\tconst wordAfterLastWeakLetterOrHamzaCheck = processThreeLetterWordsWithWeakLetterOrHamza( word, morphologyData,\n\t\tmorphologyData.externalStemmer.regexRemoveLastWeakLetterOrHamza, checkWordsWithRemovedLastLetter );\n\tif ( wordAfterLastWeakLetterOrHamzaCheck ) {\n\t\treturn wordAfterLastWeakLetterOrHamzaCheck;\n\t}\n\n\t// If the middle letter is a waw, yeh, alef or a yeh_hamza, check if the word is a root that may get the middle weak letter/hamza removed..\n\tconst wordAfterMiddleWeakLetterOrHamzaCheck = processThreeLetterWordsWithWeakLetterOrHamza( word, morphologyData,\n\t\tmorphologyData.externalStemmer.regexRemoveMiddleWeakLetterOrHamza, checkWordsWithRemovedMiddleLetter );\n\tif ( wordAfterMiddleWeakLetterOrHamzaCheck ) {\n\t\treturn wordAfterMiddleWeakLetterOrHamzaCheck;\n\t}\n\n\tconst regexReplaceMiddleLetterWithAlef = morphologyData.externalStemmer.regexReplaceMiddleLetterWithAlef;\n\tconst regexReplaceMiddleLetterWithAlefWithHamza = morphologyData.externalStemmer.regexReplaceMiddleLetterWithAlefWithHamza;\n\n\t// If the word has ئ/ؤ (yeh_hamza/waw_hamza) as the second letter and ends in ر/ز/ن (noon/zai/reh), change ئ/ؤ (yeh_hamza/waw_hamza) to ا (alef).\n\tconst wordAfterReplacingMiddleLetterWithAlef = word.replace( new RegExp( regexReplaceMiddleLetterWithAlef[ 0 ] ),\n\t\tregexReplaceMiddleLetterWithAlef[ 1 ] );\n\tif ( wordAfterReplacingMiddleLetterWithAlef === word ) {\n\t\t// If the second letter is a ئ/ؤ (yeh_hamza/waw_hamza) and it doesn't end in noon/zai/reh, change ئ/ؤ d to أ (alef_hamza_above).\n\t\tword = word.replace( new RegExp( regexReplaceMiddleLetterWithAlefWithHamza[ 0 ] ),\n\t\t\tregexReplaceMiddleLetterWithAlefWithHamza[ 1 ] );\n\t} else {\n\t\tword = wordAfterReplacingMiddleLetterWithAlef;\n\t}\n\t// If the last letter is a shadda, remove it and duplicate the last letter.\n\tconst regexRemoveShaddaAndDuplicateLastLetter = morphologyData.externalStemmer.regexRemoveShaddaAndDuplicateLastLetter;\n\tword = word.replace( new RegExp( regexRemoveShaddaAndDuplicateLastLetter[ 0 ] ),\n\t\tregexRemoveShaddaAndDuplicateLastLetter[ 1 ] );\n\n\treturn word;\n};\n\n/**\n * Check whether the word matches the pattern (it is a 6 letter-word, the fourth and sixth letter are the same, and the pattern\n * and the word share two same letters at the same index). If it does, remove the first character and the two last characters and\n * get the root.\n * Example: احولال -> حول (the stem is the 2nd to 4th character)\n *\n * @param {string}\tword\t\t\t\tThe word to check.\n * @param {number}\tnumberSameLetters\tThe number of letters the word and the pattern share at the same index.\n * @param {Object}\tmorphologyData\t\tThe Arabic morphology data.\n *\n * @returns {string} The root or the original word if word was not matched by the pattern.\n */\nconst checkFirstPatternAndGetRoot = function( word, numberSameLetters, morphologyData ) {\n\tif ( word.length === 6 && word[ 3 ] === word[ 5 ] && numberSameLetters === 2 ) {\n\t\treturn processThreeLetterWords( word.substring( 1, 4 ), morphologyData );\n\t}\n\treturn word;\n};\n\n/**\n * Checks whether the word matches the pattern (the word shares three characters with the pattern) and get the root if it does.\n * Example: استكتب -> كتب (A word that matches pattern (استفعل))\n *\n * @param {string}\tword\t\t\t\tThe word to check.\n * @param {string}\tpattern\t\t\t\tThe pattern to check.\n * @param {number}\tnumberSameLetters\tThe number of letters the word and the pattern share at the same index.\n * @param {Object}\tmorphologyData\t\tThe Arabic morphology data.\n *\n * @returns {string} The root or the original word if no root was found.\n */\nconst checkSecondPatternAndGetRoot = function( word, pattern, numberSameLetters, morphologyData ) {\n\tconst characters = morphologyData.externalStemmer.characters;\n\t// If the word length minus three is equal to or less than the number of same letters found in the checkPatterns function.\n\tif ( word.length - 3 <= numberSameLetters ) {\n\t\tlet root = \"\";\n\t\tfor ( let i = 0; i < word.length; i++ ) {\n\t\t\tif ( pattern[ i ] === characters.feh ||\n\t\t\t\tpattern[ i ] === characters.aen ||\n\t\t\t\tpattern[ i ] === characters.lam ) {\n\t\t\t\troot = root.concat( word[ i ] );\n\t\t\t}\n\t\t}\n\n\t\treturn processThreeLetterWords( root, morphologyData );\n\t}\n\treturn word;\n};\n\n/**\n * Count the number of letters the word and the pattern to match with share at the same index.\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {string}\tpattern\t\t\tThe pattern to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {number}\tThe number of shared letters between the word and the pattern at the same index.\n */\nconst countSharedLettersBetweenWordAndPattern = function( word, pattern, morphologyData ) {\n\tconst characters = morphologyData.externalStemmer.characters;\n\n\tlet numberSameLetters = 0;\n\tfor ( let i = 0; i < word.length; i++ ) {\n\t\tif ( pattern[ i ] === word[ i ] &&\n\t\t\tpattern[ i ] !== characters.feh &&\n\t\t\tpattern[ i ] !== characters.aen &&\n\t\t\tpattern[ i ] !== characters.lam ) {\n\t\t\tnumberSameLetters++;\n\t\t}\n\t}\n\treturn numberSameLetters;\n};\n\n/**\n * Check if a word matches a specific pattern of letters, and if it does, modify the word to get the root.\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null} An object with either the root or the modified word and the information whether the root was found,\n * \t\t\t\t\t\t  or null if the word was not modified and the root was not found.\n */\nconst checkPatterns = function( word, morphologyData ) {\n\t// If the first letter is an alef_madda, alef_hamza_above, or alef_hamza_below (أ/إ/آ), change it to an alef (ا)\n\tconst wordAfterModification = matchWithRegexAndReplace( word, morphologyData.externalStemmer.regexReplaceFirstHamzaWithAlef );\n\n\t// Try and find a pattern that matches the word\n\tfor ( const pattern of morphologyData.externalStemmer.patterns ) {\n\t\tif ( pattern.length === wordAfterModification.length ) {\n\t\t\t// Count the number of letters the word and the pattern share at the same index.\n\t\t\tconst numberSameLetters = countSharedLettersBetweenWordAndPattern( wordAfterModification, pattern, morphologyData );\n\n\t\t\tconst wordAfterCheckingFirstPattern = checkFirstPatternAndGetRoot( wordAfterModification, numberSameLetters, morphologyData );\n\t\t\tif ( wordAfterCheckingFirstPattern !== wordAfterModification ) {\n\t\t\t\treturn { word: wordAfterCheckingFirstPattern, rootFound: true };\n\t\t\t}\n\n\t\t\tconst wordAfterCheckingSecondPattern = checkSecondPatternAndGetRoot( wordAfterModification, pattern, numberSameLetters, morphologyData );\n\t\t\tif ( wordAfterCheckingSecondPattern !== wordAfterModification ) {\n\t\t\t\treturn { word: wordAfterCheckingSecondPattern, rootFound: true };\n\t\t\t}\n\t\t}\n\t}\n\n\t// If a pattern was not matched but the word was modified, return the modified word.\n\tif ( wordAfterModification !== word ) {\n\t\treturn { word: wordAfterModification, rootFound: false };\n\t}\n};\n\n/**\n * Tries to find the root of two-, three- and four-letter words by checking lists and/or applying modifications to the word.\n *\n * Example: the word أبطر is on the list of four-letter roots.\n *\n * @param {string} \tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null} The root or null if the root was not found.\n */\nconst checkIfWordIsRoot = function( word, morphologyData ) {\n\t// Check if the word consists of two letters and find its root.\n\tif ( word.length === 2 ) {\n\t\treturn processTwoLetterWords( word, morphologyData );\n\t}\n\t// Check if the word consists of three letters.\n\tif ( word.length === 3 ) {\n\t\treturn processThreeLetterWords( word, morphologyData );\n\t}\n\t// If the word consists of four letters, check if it is on the list of four-letter roots.\n\tif ( word.length === 4 ) {\n\t\tif ( morphologyData.externalStemmer.fourLetterRoots.includes( word ) ) {\n\t\t\treturn word;\n\t\t}\n\t}\n};\n\n/**\n * Checks whether the word ends in a suffix, and removes it if it does.\n *\n * @param {string}\t\tword\t\tThe word to check.\n * @param {string[]}\tsuffixes\tThe suffixes to check.\n *\n * @returns {string}\tThe word with the suffix removed or the input word if no suffix was found.\n */\nconst removeSuffix = function( word, suffixes ) {\n\tfor ( const suffix of suffixes ) {\n\t\tif ( word.endsWith( suffix ) ) {\n\t\t\treturn word.slice( 0, -suffix.length );\n\t\t}\n\t}\n\treturn word;\n};\n\n/**\n * Checks whether the word starts with a prefix, and removes it if it does.\n *\n * @param {string}\t\tword\t\tThe word to check.\n * @param {string[]}\tprefixes\tThe prefixes to check.\n *\n * @returns {string}\tThe word with the prefix removed or the input word if no prefix was found.\n */\nconst removePrefix = function( word, prefixes ) {\n\tfor ( const prefix of prefixes ) {\n\t\tif ( word.startsWith( prefix ) ) {\n\t\t\treturn word.substring( prefix.length, word.length );\n\t\t}\n\t}\n\treturn word;\n};\n\n/**\n * Searches for a suffix, removes it if found, and tries to find the root of the stemmed word. If the root is not found, the\n * function returns null, with one exception: it is possible that in the checkPatterns function that is ran inside of this one,\n * the word is modified but no root is found. In this case, the function returns the modified word.\n *\n * Example: جمعكم -> جمع (word with suffix كم which is found on the list of three-letter roots after removing the suffix).\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null} An object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t  the word is not modified and no root is found.\n */\nconst processWordWithSuffix = function( word, morphologyData ) {\n\t// Find and remove suffix.\n\tconst wordAfterRemovingSuffix = removeSuffix( word, morphologyData.externalStemmer.suffixes );\n\tif ( wordAfterRemovingSuffix !== word ) {\n\t\t// If suffix was removed, check if the stemmed word is a root.\n\t\tconst root = checkIfWordIsRoot( wordAfterRemovingSuffix, morphologyData );\n\t\tif ( root ) {\n\t\t\treturn { word: root, rootFound: true };\n\t\t}\n\t\t// If no root was found, try to get the root by matching with a pattern.\n\t\tconst outputAfterCheckingPatterns = checkPatterns( wordAfterRemovingSuffix, morphologyData );\n\t\tif ( outputAfterCheckingPatterns ) {\n\t\t\treturn outputAfterCheckingPatterns;\n\t\t}\n\t}\n};\n\n/**\n * Searches for a prefix (other than the definite article), removes it if found, and tries to find the root of the stemmed\n * word. If the root is not found, the function returns null, with one exception: it is possible that in the checkPatterns\n * function that is ran inside of this one, the word is modified but no root is found. In this case, the function returns\n * the modified word.\n *\n * Example: للزهور -> زهر (word with prefix لل that gets its root by matching with a pattern after removing the prefix).\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null}\tAn object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t    the word is not modified and no root is found.\n */\nconst processWordWithPrefix = function( word, morphologyData ) {\n\t// Find and remove prefix.\n\tlet wordAfterRemovingPrefix = removePrefix( word, morphologyData.externalStemmer.prefixes );\n\tif ( wordAfterRemovingPrefix !== word ) {\n\t\t// If prefix was removed, check if the stemmed word is a root.\n\t\tconst root = checkIfWordIsRoot( wordAfterRemovingPrefix, morphologyData );\n\t\tif ( root ) {\n\t\t\treturn { word: root, rootFound: true };\n\t\t}\n\t\t// If no root was found, try to get the root by matching with a pattern.\n\t\tconst outputAfterCheckingPatterns = checkPatterns( wordAfterRemovingPrefix, morphologyData );\n\t\tif ( outputAfterCheckingPatterns ) {\n\t\t\tif ( outputAfterCheckingPatterns.rootFound === true ) {\n\t\t\t\treturn outputAfterCheckingPatterns;\n\t\t\t}\n\t\t\twordAfterRemovingPrefix = outputAfterCheckingPatterns.word;\n\t\t}\n\t\t// If the root was still not found, try to find and remove suffixes and find the root again.\n\t\tconst outputAfterCheckingForSuffixes = processWordWithSuffix( wordAfterRemovingPrefix, morphologyData );\n\t\tif ( outputAfterCheckingForSuffixes ) {\n\t\t\treturn outputAfterCheckingForSuffixes;\n\t\t}\n\t}\n};\n\n/**\n * Checks if the word is a root. If root is not found, checks whether the root can be derived using a pattern. If the root is\n * still not found, removes affixes and tries to find the root again. If the root is not found, the function returns null,\n * with one exception: it is possible that in the checkPatterns function that is ran inside of this one, the word is modified\n * but no root is found. In this case, the function returns the modified word.\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null}\tAn object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t    the word is not modified and no root is found.\n */\nconst findRoot = function( word, morphologyData ) {\n\t// Check if the word is a root.\n\tconst root = checkIfWordIsRoot( word, morphologyData );\n\tif ( root ) {\n\t\treturn { word: root, rootFound: true };\n\t}\n\n\t// Check if the root can be derived by matching a pattern. إعدجص\n\tconst outputAfterCheckingPatterns = checkPatterns( word, morphologyData );\n\tlet stemmedWord = word;\n\tif ( outputAfterCheckingPatterns ) {\n\t\tif ( outputAfterCheckingPatterns.rootFound === true ) {\n\t\t\treturn outputAfterCheckingPatterns;\n\t\t}\n\t\t// Word: اعدجص\n\t\tstemmedWord = outputAfterCheckingPatterns.word;\n\t}\n\t// Remove affixes and check if the stemmed word is a root\n\tconst outputAfterProcessingSuffix = processWordWithSuffix( stemmedWord, morphologyData );\n\tif ( outputAfterProcessingSuffix ) {\n\t\treturn outputAfterProcessingSuffix;\n\t}\n\tconst outputAfterRemovingPrefix = processWordWithPrefix( stemmedWord, morphologyData );\n\tif ( outputAfterRemovingPrefix ) {\n\t\treturn outputAfterRemovingPrefix;\n\t}\n\n\tif ( stemmedWord !== word ) {\n\t\treturn { word: stemmedWord, rootFound: false };\n\t}\n};\n\n/**\n * Search for and remove a definite article and try to get the root of the word. If the root was not found, but the word\n * was modified inside the checkPatterns function, returns the modified word. If the definite article was removed and the\n * stemmed word is longer than three letters, but the root was not found, returns the stemmed word. Otherwise, if the root\n * was not found, returns null.\n *\n * Example: الجدولين -> جدول (word with definite article ال and suffix ين ).\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null}\tAn object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t    the word is not modified and no root is found.\n */\nconst processWordWithDefiniteArticle = function( word, morphologyData ) {\n\t// Search for and remove the definite article.\n\tconst wordAfterRemovingDefiniteArticle = removePrefix( word, morphologyData.externalStemmer.definiteArticles );\n\t// If a definite article was removed, try to find the root.\n\tif ( wordAfterRemovingDefiniteArticle !== word ) {\n\t\t/**\n\t\t * If definite article was removed, try to find root by checking whether the word is a root, matching with a pattern, and/or\n\t\t * searching for and removing prefixes.\n\t\t */\n\t\tconst outputAfterTryingToFindRoot = findRoot( wordAfterRemovingDefiniteArticle, morphologyData );\n\t\tif ( outputAfterTryingToFindRoot  ) {\n\t\t\treturn outputAfterTryingToFindRoot;\n\t\t}\n\n\t\t// Return it even if no root was found.\n\t\treturn { word: wordAfterRemovingDefiniteArticle, rootFound: false };\n\t}\n};\n\n/**\n * Searches for prefix waw (و) and removes it if found, then tries to find the root. If the root is still not found, removes\n * affixes and tries to find the root again. If the root is not found, the function returns null, with one exception: it\n * is possible that in the checkPatterns function that is ran inside of this one, the word is modified but no root is found.\n * In this case, the function returns the modified word.\n *\n * Example: وتمثّل -> مثل (word with prefix waw which matches a pattern after removing the prefix).\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null}\tAn object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t    the word is not modified and no root is found.\n */\nconst processWordWithPrefixWaw = function( word, morphologyData ) {\n\tlet wordAfterRemovingWaw = \"\";\n\tif ( word.length > 3 && word.startsWith( morphologyData.externalStemmer.characters.waw ) ) {\n\t\twordAfterRemovingWaw = word.substring( 1 );\n\t\t/*\n\t\t * If the prefix waw was removed, try to find the root by checking whether the word is a root, matching with a pattern,\n\t\t * and/or searching for and removing prefixes.\n\t\t */\n\t\tconst outputAfterTryingToFindRoot = findRoot( wordAfterRemovingWaw, morphologyData );\n\n\t\tif ( outputAfterTryingToFindRoot ) {\n\t\t\treturn outputAfterTryingToFindRoot;\n\t\t}\n\t}\n};\n\n/**\n * Stems Arabic words.\n *\n * @param {string}\tword\t\t\tThe word to stem.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string}\tThe stemmed word.\n */\nexport default function stem( word, morphologyData ) {\n\t// Remove diacritics that serve as phonetic guides and are not usually used in regular writing.\n\tconst regexRemovingDiacritics = morphologyData.externalStemmer.regexRemovingDiacritics;\n\tword.replace( new RegExp( regexRemovingDiacritics ), \"\" );\n\n\tconst root = checkIfWordIsRoot( word, morphologyData );\n\tif ( root ) {\n\t\treturn root;\n\t}\n\t// If the root still hasn't been found, check if the word matches a pattern and get its root if it does.\n\tconst outputAfterCheckingPatterns = checkPatterns( word, morphologyData );\n\tif ( outputAfterCheckingPatterns ) {\n\t\t// Return the root if it was found in the checkPatterns function\n\t\tif ( outputAfterCheckingPatterns.rootFound === true ) {\n\t\t\treturn outputAfterCheckingPatterns.word;\n\t\t}\n\t\t// If the checkPatterns function modified the word but did not find the root, replace the word with the modified word.\n\t\tword = outputAfterCheckingPatterns.word;\n\t}\n\n\t// If the root still hasn't been found, remove the definite article and try to find the root.\n\tconst outputAfterProcessingDefiniteArticle = processWordWithDefiniteArticle( word, morphologyData );\n\tif ( outputAfterProcessingDefiniteArticle ) {\n\t\t// Return the root if it was found after removing the definite article.\n\t\tif ( outputAfterProcessingDefiniteArticle.rootFound === true ) {\n\t\t\treturn outputAfterProcessingDefiniteArticle.word;\n\t\t}\n\t\t// If the definite article was removed but the root was not found, replace the word with the stemmed word.\n\n\t\tword = outputAfterProcessingDefiniteArticle.word;\n\t}\n\n\t// If the root still hasn't been found, remove the prefix waw and try to find the root.\n\tconst outputAfterProcessingPrefixWaw = processWordWithPrefixWaw( word, morphologyData );\n\tif ( outputAfterProcessingPrefixWaw ) {\n\t\tif ( outputAfterProcessingPrefixWaw.rootFound === true ) {\n\t\t\treturn outputAfterProcessingPrefixWaw.word;\n\t\t}\n\t\t// If the checkPatterns function modified the word but did not find the root, replace the word with the modified word.\n\t\tword = outputAfterProcessingPrefixWaw.word;\n\t}\n\t// If the root still hasn't been found, remove a suffix and try to find the root.\n\tconst outputAfterProcessingSuffix = processWordWithSuffix( word, morphologyData );\n\tif ( outputAfterProcessingSuffix ) {\n\t\treturn outputAfterProcessingSuffix.word;\n\t}\n\n\t// If the root still hasn't been found, remove a prefix and try to find the root.\n\tconst wordAfterProcessingPrefix = processWordWithPrefix( word, morphologyData );\n\tif ( wordAfterProcessingPrefix ) {\n\t\treturn wordAfterProcessingPrefix.word;\n\t}\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;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMA,wBAAwB,GAAG,SAAAA,CAAUC,IAAI,EAAEC,mBAAmB,EAAG;EACtE,OAAOD,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAEF,mBAAmB,CAAE,CAAC,CAAG,CAAC,EAC1DA,mBAAmB,CAAE,CAAC,CAAG,CAAC;AAC5B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,+BAA+B,GAAG,SAAAA,CAAUJ,IAAI,EAAEK,cAAc,EAAG;EACxE,MAAMC,eAAe,GAAGD,cAAc,CAACC,eAAe;EACtD,MAAMC,UAAU,GAAGD,eAAe,CAACC,UAAU;EAE7C,IAAKD,eAAe,CAACE,wBAAwB,CAACC,QAAQ,CAAET,IAAK,CAAC,EAAG;IAChE,OAAOA,IAAI,GAAGO,UAAU,CAACG,IAAI;EAC9B;EACA,IAAKJ,eAAe,CAACK,yBAAyB,CAACF,QAAQ,CAAET,IAAK,CAAC,EAAG;IACjE,OAAOA,IAAI,GAAGO,UAAU,CAACK,gBAAgB;EAC1C;EACA,IAAKN,eAAe,CAACO,2BAA2B,CAACJ,QAAQ,CAAET,IAAK,CAAC,EAAG;IACnE,OAAOA,IAAI,GAAGO,UAAU,CAACO,YAAY;EACtC;EACA,IAAKR,eAAe,CAACS,uBAAuB,CAACN,QAAQ,CAAET,IAAK,CAAC,EAAG;IAC/D,OAAOA,IAAI,GAAGO,UAAU,CAACS,GAAG;EAC7B;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,gCAAgC,GAAG,SAAAA,CAAUjB,IAAI,EAAEK,cAAc,EAAG;EACzE,MAAMC,eAAe,GAAGD,cAAc,CAACC,eAAe;EACtD,MAAMC,UAAU,GAAGD,eAAe,CAACC,UAAU;EAE7C,IAAKD,eAAe,CAACY,wBAAwB,CAACT,QAAQ,CAAET,IAAK,CAAC,EAAG;IAChE,OAAOO,UAAU,CAACY,GAAG,GAAGnB,IAAI;EAC7B;EACA,IAAKM,eAAe,CAACc,wBAAwB,CAACX,QAAQ,CAAET,IAAK,CAAC,EAAG;IAChE,OAAOO,UAAU,CAACS,GAAG,GAAGhB,IAAI;EAC7B;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMqB,iCAAiC,GAAG,SAAAA,CAAUrB,IAAI,EAAEK,cAAc,EAAG;EAC1E,MAAMC,eAAe,GAAGD,cAAc,CAACC,eAAe;EACtD,MAAMC,UAAU,GAAGD,eAAe,CAACC,UAAU;EAE7C,IAAKD,eAAe,CAACgB,yBAAyB,CAACb,QAAQ,CAAET,IAAK,CAAC,EAAG;IACjE,OAAOA,IAAI,CAAE,CAAC,CAAE,GAAGO,UAAU,CAACY,GAAG,GAAGnB,IAAI,CAAE,CAAC,CAAE;EAC9C;EACA,IAAKM,eAAe,CAACiB,yBAAyB,CAACd,QAAQ,CAAET,IAAK,CAAC,EAAG;IACjE,OAAOA,IAAI,CAAE,CAAC,CAAE,GAAGO,UAAU,CAACS,GAAG,GAAGhB,IAAI,CAAE,CAAC,CAAE;EAC9C;AACD,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMwB,qBAAqB,GAAG,SAAAA,CAAUxB,IAAI,EAAEK,cAAc,EAAG;EAC9D;EACA,IAAKA,cAAc,CAACC,eAAe,CAACmB,+BAA+B,CAAChB,QAAQ,CAAET,IAAK,CAAC,EAAG;IACtF,OAAOA,IAAI,GAAGA,IAAI,CAAC0B,SAAS,CAAE,CAAE,CAAC;EAClC;EACA;EACA,MAAMC,wBAAwB,GAAGvB,+BAA+B,CAAEJ,IAAI,EAAEK,cAAe,CAAC;EACxF,IAAKsB,wBAAwB,EAAG;IAC/B,OAAOA,wBAAwB;EAChC;EACA,MAAMC,yBAAyB,GAAGX,gCAAgC,CAAEjB,IAAI,EAAEK,cAAe,CAAC;EAC1F,IAAKuB,yBAAyB,EAAG;IAChC,OAAOA,yBAAyB;EACjC;EACA,MAAMC,0BAA0B,GAAGR,iCAAiC,CAAErB,IAAI,EAAEK,cAAe,CAAC;EAC5F,IAAKwB,0BAA0B,EAAG;IACjC,OAAOA,0BAA0B;EAClC;EAEA,OAAO7B,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM8B,4CAA4C,GAAG,SAAAA,CAAU9B,IAAI,EAAEK,cAAc,EAAE0B,kBAAkB,EAAEC,sBAAsB,EAAG;EACjI;EACA,MAAMC,kCAAkC,GAAGjC,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAE4B,kBAAkB,CAAE,CAAC,CAAG,CAAC,EAC7FA,kBAAkB,CAAE,CAAC,CAAG,CAAC;EAC1B,IAAKE,kCAAkC,KAAKjC,IAAI,EAAG;IAClD;AACF;AACA;AACA;IACE,OAAOgC,sBAAsB,CAAEC,kCAAkC,EAAE5B,cAAe,CAAC;EACpF;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM6B,uBAAuB,GAAG,SAAAA,CAAUlC,IAAI,EAAEK,cAAc,EAAG;EAChE,MAAME,UAAU,GAAGF,cAAc,CAACC,eAAe,CAACC,UAAU;;EAE5D;EACA,IAAKF,cAAc,CAACC,eAAe,CAAC6B,gBAAgB,CAAC1B,QAAQ,CAAET,IAAK,CAAC,EAAG;IACvE,OAAOA,IAAI;EACZ;EACA;EACA,IAAKA,IAAI,CAAE,CAAC,CAAE,KAAKO,UAAU,CAACG,IAAI,IAAIV,IAAI,CAAE,CAAC,CAAE,KAAKO,UAAU,CAAC6B,SAAS,IACtEpC,IAAI,CAAE,CAAC,CAAE,KAAKO,UAAU,CAAC8B,SAAS,EAAG;IACtCrC,IAAI,GAAGO,UAAU,CAACK,gBAAgB,GAAGZ,IAAI,CAACsC,KAAK,CAAE,CAAE,CAAC;EACrD;;EAEA;EACA,MAAMC,mCAAmC,GAAGT,4CAA4C,CAAE9B,IAAI,EAAEK,cAAc,EAC7GA,cAAc,CAACC,eAAe,CAACkC,gCAAgC,EAAEpC,+BAAgC,CAAC;EACnG,IAAKmC,mCAAmC,EAAG;IAC1C,OAAOA,mCAAmC;EAC3C;;EAEA;EACA,MAAME,qCAAqC,GAAGX,4CAA4C,CAAE9B,IAAI,EAAEK,cAAc,EAC/GA,cAAc,CAACC,eAAe,CAACoC,kCAAkC,EAAErB,iCAAkC,CAAC;EACvG,IAAKoB,qCAAqC,EAAG;IAC5C,OAAOA,qCAAqC;EAC7C;EAEA,MAAME,gCAAgC,GAAGtC,cAAc,CAACC,eAAe,CAACqC,gCAAgC;EACxG,MAAMC,yCAAyC,GAAGvC,cAAc,CAACC,eAAe,CAACsC,yCAAyC;;EAE1H;EACA,MAAMC,sCAAsC,GAAG7C,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAEwC,gCAAgC,CAAE,CAAC,CAAG,CAAC,EAC/GA,gCAAgC,CAAE,CAAC,CAAG,CAAC;EACxC,IAAKE,sCAAsC,KAAK7C,IAAI,EAAG;IACtD;IACAA,IAAI,GAAGA,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAEyC,yCAAyC,CAAE,CAAC,CAAG,CAAC,EAChFA,yCAAyC,CAAE,CAAC,CAAG,CAAC;EAClD,CAAC,MAAM;IACN5C,IAAI,GAAG6C,sCAAsC;EAC9C;EACA;EACA,MAAMC,uCAAuC,GAAGzC,cAAc,CAACC,eAAe,CAACwC,uCAAuC;EACtH9C,IAAI,GAAGA,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAE2C,uCAAuC,CAAE,CAAC,CAAG,CAAC,EAC9EA,uCAAuC,CAAE,CAAC,CAAG,CAAC;EAE/C,OAAO9C,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM+C,2BAA2B,GAAG,SAAAA,CAAU/C,IAAI,EAAEgD,iBAAiB,EAAE3C,cAAc,EAAG;EACvF,IAAKL,IAAI,CAACiD,MAAM,KAAK,CAAC,IAAIjD,IAAI,CAAE,CAAC,CAAE,KAAKA,IAAI,CAAE,CAAC,CAAE,IAAIgD,iBAAiB,KAAK,CAAC,EAAG;IAC9E,OAAOd,uBAAuB,CAAElC,IAAI,CAAC0B,SAAS,CAAE,CAAC,EAAE,CAAE,CAAC,EAAErB,cAAe,CAAC;EACzE;EACA,OAAOL,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMkD,4BAA4B,GAAG,SAAAA,CAAUlD,IAAI,EAAEmD,OAAO,EAAEH,iBAAiB,EAAE3C,cAAc,EAAG;EACjG,MAAME,UAAU,GAAGF,cAAc,CAACC,eAAe,CAACC,UAAU;EAC5D;EACA,IAAKP,IAAI,CAACiD,MAAM,GAAG,CAAC,IAAID,iBAAiB,EAAG;IAC3C,IAAII,IAAI,GAAG,EAAE;IACb,KAAM,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGrD,IAAI,CAACiD,MAAM,EAAEI,CAAC,EAAE,EAAG;MACvC,IAAKF,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAAC+C,GAAG,IACnCH,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAACgD,GAAG,IAC/BJ,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAACiD,GAAG,EAAG;QAClCJ,IAAI,GAAGA,IAAI,CAACK,MAAM,CAAEzD,IAAI,CAAEqD,CAAC,CAAG,CAAC;MAChC;IACD;IAEA,OAAOnB,uBAAuB,CAAEkB,IAAI,EAAE/C,cAAe,CAAC;EACvD;EACA,OAAOL,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM0D,uCAAuC,GAAG,SAAAA,CAAU1D,IAAI,EAAEmD,OAAO,EAAE9C,cAAc,EAAG;EACzF,MAAME,UAAU,GAAGF,cAAc,CAACC,eAAe,CAACC,UAAU;EAE5D,IAAIyC,iBAAiB,GAAG,CAAC;EACzB,KAAM,IAAIK,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGrD,IAAI,CAACiD,MAAM,EAAEI,CAAC,EAAE,EAAG;IACvC,IAAKF,OAAO,CAAEE,CAAC,CAAE,KAAKrD,IAAI,CAAEqD,CAAC,CAAE,IAC9BF,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAAC+C,GAAG,IAC/BH,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAACgD,GAAG,IAC/BJ,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAACiD,GAAG,EAAG;MAClCR,iBAAiB,EAAE;IACpB;EACD;EACA,OAAOA,iBAAiB;AACzB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMW,aAAa,GAAG,SAAAA,CAAU3D,IAAI,EAAEK,cAAc,EAAG;EACtD;EACA,MAAMuD,qBAAqB,GAAG7D,wBAAwB,CAAEC,IAAI,EAAEK,cAAc,CAACC,eAAe,CAACuD,8BAA+B,CAAC;;EAE7H;EACA,KAAM,MAAMV,OAAO,IAAI9C,cAAc,CAACC,eAAe,CAACwD,QAAQ,EAAG;IAChE,IAAKX,OAAO,CAACF,MAAM,KAAKW,qBAAqB,CAACX,MAAM,EAAG;MACtD;MACA,MAAMD,iBAAiB,GAAGU,uCAAuC,CAAEE,qBAAqB,EAAET,OAAO,EAAE9C,cAAe,CAAC;MAEnH,MAAM0D,6BAA6B,GAAGhB,2BAA2B,CAAEa,qBAAqB,EAAEZ,iBAAiB,EAAE3C,cAAe,CAAC;MAC7H,IAAK0D,6BAA6B,KAAKH,qBAAqB,EAAG;QAC9D,OAAO;UAAE5D,IAAI,EAAE+D,6BAA6B;UAAEC,SAAS,EAAE;QAAK,CAAC;MAChE;MAEA,MAAMC,8BAA8B,GAAGf,4BAA4B,CAAEU,qBAAqB,EAAET,OAAO,EAAEH,iBAAiB,EAAE3C,cAAe,CAAC;MACxI,IAAK4D,8BAA8B,KAAKL,qBAAqB,EAAG;QAC/D,OAAO;UAAE5D,IAAI,EAAEiE,8BAA8B;UAAED,SAAS,EAAE;QAAK,CAAC;MACjE;IACD;EACD;;EAEA;EACA,IAAKJ,qBAAqB,KAAK5D,IAAI,EAAG;IACrC,OAAO;MAAEA,IAAI,EAAE4D,qBAAqB;MAAEI,SAAS,EAAE;IAAM,CAAC;EACzD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,iBAAiB,GAAG,SAAAA,CAAUlE,IAAI,EAAEK,cAAc,EAAG;EAC1D;EACA,IAAKL,IAAI,CAACiD,MAAM,KAAK,CAAC,EAAG;IACxB,OAAOzB,qBAAqB,CAAExB,IAAI,EAAEK,cAAe,CAAC;EACrD;EACA;EACA,IAAKL,IAAI,CAACiD,MAAM,KAAK,CAAC,EAAG;IACxB,OAAOf,uBAAuB,CAAElC,IAAI,EAAEK,cAAe,CAAC;EACvD;EACA;EACA,IAAKL,IAAI,CAACiD,MAAM,KAAK,CAAC,EAAG;IACxB,IAAK5C,cAAc,CAACC,eAAe,CAAC6D,eAAe,CAAC1D,QAAQ,CAAET,IAAK,CAAC,EAAG;MACtE,OAAOA,IAAI;IACZ;EACD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMoE,YAAY,GAAG,SAAAA,CAAUpE,IAAI,EAAEqE,QAAQ,EAAG;EAC/C,KAAM,MAAMC,MAAM,IAAID,QAAQ,EAAG;IAChC,IAAKrE,IAAI,CAACuE,QAAQ,CAAED,MAAO,CAAC,EAAG;MAC9B,OAAOtE,IAAI,CAACsC,KAAK,CAAE,CAAC,EAAE,CAACgC,MAAM,CAACrB,MAAO,CAAC;IACvC;EACD;EACA,OAAOjD,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMwE,YAAY,GAAG,SAAAA,CAAUxE,IAAI,EAAEyE,QAAQ,EAAG;EAC/C,KAAM,MAAMC,MAAM,IAAID,QAAQ,EAAG;IAChC,IAAKzE,IAAI,CAAC2E,UAAU,CAAED,MAAO,CAAC,EAAG;MAChC,OAAO1E,IAAI,CAAC0B,SAAS,CAAEgD,MAAM,CAACzB,MAAM,EAAEjD,IAAI,CAACiD,MAAO,CAAC;IACpD;EACD;EACA,OAAOjD,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM4E,qBAAqB,GAAG,SAAAA,CAAU5E,IAAI,EAAEK,cAAc,EAAG;EAC9D;EACA,MAAMwE,uBAAuB,GAAGT,YAAY,CAAEpE,IAAI,EAAEK,cAAc,CAACC,eAAe,CAAC+D,QAAS,CAAC;EAC7F,IAAKQ,uBAAuB,KAAK7E,IAAI,EAAG;IACvC;IACA,MAAMoD,IAAI,GAAGc,iBAAiB,CAAEW,uBAAuB,EAAExE,cAAe,CAAC;IACzE,IAAK+C,IAAI,EAAG;MACX,OAAO;QAAEpD,IAAI,EAAEoD,IAAI;QAAEY,SAAS,EAAE;MAAK,CAAC;IACvC;IACA;IACA,MAAMc,2BAA2B,GAAGnB,aAAa,CAAEkB,uBAAuB,EAAExE,cAAe,CAAC;IAC5F,IAAKyE,2BAA2B,EAAG;MAClC,OAAOA,2BAA2B;IACnC;EACD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,qBAAqB,GAAG,SAAAA,CAAU/E,IAAI,EAAEK,cAAc,EAAG;EAC9D;EACA,IAAI2E,uBAAuB,GAAGR,YAAY,CAAExE,IAAI,EAAEK,cAAc,CAACC,eAAe,CAACmE,QAAS,CAAC;EAC3F,IAAKO,uBAAuB,KAAKhF,IAAI,EAAG;IACvC;IACA,MAAMoD,IAAI,GAAGc,iBAAiB,CAAEc,uBAAuB,EAAE3E,cAAe,CAAC;IACzE,IAAK+C,IAAI,EAAG;MACX,OAAO;QAAEpD,IAAI,EAAEoD,IAAI;QAAEY,SAAS,EAAE;MAAK,CAAC;IACvC;IACA;IACA,MAAMc,2BAA2B,GAAGnB,aAAa,CAAEqB,uBAAuB,EAAE3E,cAAe,CAAC;IAC5F,IAAKyE,2BAA2B,EAAG;MAClC,IAAKA,2BAA2B,CAACd,SAAS,KAAK,IAAI,EAAG;QACrD,OAAOc,2BAA2B;MACnC;MACAE,uBAAuB,GAAGF,2BAA2B,CAAC9E,IAAI;IAC3D;IACA;IACA,MAAMiF,8BAA8B,GAAGL,qBAAqB,CAAEI,uBAAuB,EAAE3E,cAAe,CAAC;IACvG,IAAK4E,8BAA8B,EAAG;MACrC,OAAOA,8BAA8B;IACtC;EACD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,QAAQ,GAAG,SAAAA,CAAUlF,IAAI,EAAEK,cAAc,EAAG;EACjD;EACA,MAAM+C,IAAI,GAAGc,iBAAiB,CAAElE,IAAI,EAAEK,cAAe,CAAC;EACtD,IAAK+C,IAAI,EAAG;IACX,OAAO;MAAEpD,IAAI,EAAEoD,IAAI;MAAEY,SAAS,EAAE;IAAK,CAAC;EACvC;;EAEA;EACA,MAAMc,2BAA2B,GAAGnB,aAAa,CAAE3D,IAAI,EAAEK,cAAe,CAAC;EACzE,IAAI8E,WAAW,GAAGnF,IAAI;EACtB,IAAK8E,2BAA2B,EAAG;IAClC,IAAKA,2BAA2B,CAACd,SAAS,KAAK,IAAI,EAAG;MACrD,OAAOc,2BAA2B;IACnC;IACA;IACAK,WAAW,GAAGL,2BAA2B,CAAC9E,IAAI;EAC/C;EACA;EACA,MAAMoF,2BAA2B,GAAGR,qBAAqB,CAAEO,WAAW,EAAE9E,cAAe,CAAC;EACxF,IAAK+E,2BAA2B,EAAG;IAClC,OAAOA,2BAA2B;EACnC;EACA,MAAMC,yBAAyB,GAAGN,qBAAqB,CAAEI,WAAW,EAAE9E,cAAe,CAAC;EACtF,IAAKgF,yBAAyB,EAAG;IAChC,OAAOA,yBAAyB;EACjC;EAEA,IAAKF,WAAW,KAAKnF,IAAI,EAAG;IAC3B,OAAO;MAAEA,IAAI,EAAEmF,WAAW;MAAEnB,SAAS,EAAE;IAAM,CAAC;EAC/C;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMsB,8BAA8B,GAAG,SAAAA,CAAUtF,IAAI,EAAEK,cAAc,EAAG;EACvE;EACA,MAAMkF,gCAAgC,GAAGf,YAAY,CAAExE,IAAI,EAAEK,cAAc,CAACC,eAAe,CAACkF,gBAAiB,CAAC;EAC9G;EACA,IAAKD,gCAAgC,KAAKvF,IAAI,EAAG;IAChD;AACF;AACA;AACA;IACE,MAAMyF,2BAA2B,GAAGP,QAAQ,CAAEK,gCAAgC,EAAElF,cAAe,CAAC;IAChG,IAAKoF,2BAA2B,EAAI;MACnC,OAAOA,2BAA2B;IACnC;;IAEA;IACA,OAAO;MAAEzF,IAAI,EAAEuF,gCAAgC;MAAEvB,SAAS,EAAE;IAAM,CAAC;EACpE;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM0B,wBAAwB,GAAG,SAAAA,CAAU1F,IAAI,EAAEK,cAAc,EAAG;EACjE,IAAIsF,oBAAoB,GAAG,EAAE;EAC7B,IAAK3F,IAAI,CAACiD,MAAM,GAAG,CAAC,IAAIjD,IAAI,CAAC2E,UAAU,CAAEtE,cAAc,CAACC,eAAe,CAACC,UAAU,CAACY,GAAI,CAAC,EAAG;IAC1FwE,oBAAoB,GAAG3F,IAAI,CAAC0B,SAAS,CAAE,CAAE,CAAC;IAC1C;AACF;AACA;AACA;IACE,MAAM+D,2BAA2B,GAAGP,QAAQ,CAAES,oBAAoB,EAAEtF,cAAe,CAAC;IAEpF,IAAKoF,2BAA2B,EAAG;MAClC,OAAOA,2BAA2B;IACnC;EACD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASG,IAAIA,CAAE5F,IAAI,EAAEK,cAAc,EAAG;EACpD;EACA,MAAMwF,uBAAuB,GAAGxF,cAAc,CAACC,eAAe,CAACuF,uBAAuB;EACtF7F,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAE0F,uBAAwB,CAAC,EAAE,EAAG,CAAC;EAEzD,MAAMzC,IAAI,GAAGc,iBAAiB,CAAElE,IAAI,EAAEK,cAAe,CAAC;EACtD,IAAK+C,IAAI,EAAG;IACX,OAAOA,IAAI;EACZ;EACA;EACA,MAAM0B,2BAA2B,GAAGnB,aAAa,CAAE3D,IAAI,EAAEK,cAAe,CAAC;EACzE,IAAKyE,2BAA2B,EAAG;IAClC;IACA,IAAKA,2BAA2B,CAACd,SAAS,KAAK,IAAI,EAAG;MACrD,OAAOc,2BAA2B,CAAC9E,IAAI;IACxC;IACA;IACAA,IAAI,GAAG8E,2BAA2B,CAAC9E,IAAI;EACxC;;EAEA;EACA,MAAM8F,oCAAoC,GAAGR,8BAA8B,CAAEtF,IAAI,EAAEK,cAAe,CAAC;EACnG,IAAKyF,oCAAoC,EAAG;IAC3C;IACA,IAAKA,oCAAoC,CAAC9B,SAAS,KAAK,IAAI,EAAG;MAC9D,OAAO8B,oCAAoC,CAAC9F,IAAI;IACjD;IACA;;IAEAA,IAAI,GAAG8F,oCAAoC,CAAC9F,IAAI;EACjD;;EAEA;EACA,MAAM+F,8BAA8B,GAAGL,wBAAwB,CAAE1F,IAAI,EAAEK,cAAe,CAAC;EACvF,IAAK0F,8BAA8B,EAAG;IACrC,IAAKA,8BAA8B,CAAC/B,SAAS,KAAK,IAAI,EAAG;MACxD,OAAO+B,8BAA8B,CAAC/F,IAAI;IAC3C;IACA;IACAA,IAAI,GAAG+F,8BAA8B,CAAC/F,IAAI;EAC3C;EACA;EACA,MAAMoF,2BAA2B,GAAGR,qBAAqB,CAAE5E,IAAI,EAAEK,cAAe,CAAC;EACjF,IAAK+E,2BAA2B,EAAG;IAClC,OAAOA,2BAA2B,CAACpF,IAAI;EACxC;;EAEA;EACA,MAAMgG,yBAAyB,GAAGjB,qBAAqB,CAAE/E,IAAI,EAAEK,cAAe,CAAC;EAC/E,IAAK2F,yBAAyB,EAAG;IAChC,OAAOA,yBAAyB,CAAChG,IAAI;EACtC;EAEA,OAAOA,IAAI;AACZ","ignoreList":[]}
+{"version":3,"file":"stem.js","names":["matchWithRegexAndReplace","word","regexAndReplacement","replace","RegExp","checkWordsWithRemovedLastLetter","morphologyData","externalStemmer","characters","wordsWithLastAlefRemoved","includes","alef","wordsWithLastHamzaRemoved","alef_hamza_above","wordsWithLastMaksoraRemoved","yeh_maksorah","wordsWithLastYehRemoved","yeh","checkWordsWithRemovedFirstLetter","wordsWithFirstWawRemoved","waw","wordsWithFirstYehRemoved","checkWordsWithRemovedMiddleLetter","wordsWithMiddleWawRemoved","wordsWithMiddleYehRemoved","processTwoLetterWords","wordsWithRemovedDuplicateLetter","substring","wordAfterLastLetterCheck","wordAfterFirstLetterCheck","wordAfterMiddleLetterCheck","processThreeLetterWordsWithWeakLetterOrHamza","replacementPattern","functionToRunToGetRoot","wordAfterRemovingWeakLetterOrHamza","processThreeLetterWords","threeLetterRoots","waw_hamza","yeh_hamza","slice","wordAfterLastWeakLetterOrHamzaCheck","regexRemoveLastWeakLetterOrHamza","wordAfterMiddleWeakLetterOrHamzaCheck","regexRemoveMiddleWeakLetterOrHamza","regexReplaceMiddleLetterWithAlef","regexReplaceMiddleLetterWithAlefWithHamza","wordAfterReplacingMiddleLetterWithAlef","regexRemoveShaddaAndDuplicateLastLetter","checkFirstPatternAndGetRoot","numberSameLetters","length","checkSecondPatternAndGetRoot","pattern","root","i","feh","aen","lam","concat","countSharedLettersBetweenWordAndPattern","checkPatterns","wordAfterModification","regexReplaceFirstHamzaWithAlef","patterns","wordAfterCheckingFirstPattern","rootFound","wordAfterCheckingSecondPattern","checkIfWordIsRoot","fourLetterRoots","removeSuffix","suffixes","suffix","endsWith","removePrefix","prefixes","prefix","startsWith","processWordWithSuffix","wordAfterRemovingSuffix","outputAfterCheckingPatterns","processWordWithPrefix","wordAfterRemovingPrefix","outputAfterCheckingForSuffixes","findRoot","stemmedWord","outputAfterProcessingSuffix","outputAfterRemovingPrefix","processWordWithDefiniteArticle","wordAfterRemovingDefiniteArticle","definiteArticles","outputAfterTryingToFindRoot","processWordWithPrefixWaw","wordAfterRemovingWaw","stem","regexRemovingDiacritics","outputAfterProcessingDefiniteArticle","outputAfterProcessingPrefixWaw","wordAfterProcessingPrefix"],"sources":["../../../../../../src/languageProcessing/languages/ar/helpers/internal/stem.js"],"sourcesContent":["/**\n * Copyright (c) 2015 Mouaffak A. Sarhan\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\n/**\n * Tries to match a word with a regex. If matched, modifies the string according to the indicated pattern.\n *\n * @param {string}\t\tword\t\t\t\tThe word to check.\n * @param {string[]}\tregexAndReplacement\tThe regex to match the word with and what the word should be replaced with if it is matched.\n *\n * @returns {string}\tThe modified word or the original word if it was not matched.\n */\nconst matchWithRegexAndReplace = function( word, regexAndReplacement ) {\n\treturn word.replace( new RegExp( regexAndReplacement[ 0 ] ),\n\t\tregexAndReplacement[ 1 ] );\n};\n\n/**\n * Check if the word is on the list of three-letter roots which had the last weak letter removed (so are now two letters long).\n * If the word is on the list, add back the removed last letter and return the three-letter root.\n * Examples: طر -> طري (word with last weak letter ي (yeh) removed) , حص -> حصا (word with last weak letter ا (alef) removed)\n *\n * @param {string}\tword\t\t\tThe two-letter word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null}\tThe word with the last weak letter added back or null if the word was not found on a list.\n */\nconst checkWordsWithRemovedLastLetter = function( word, morphologyData ) {\n\tconst externalStemmer = morphologyData.externalStemmer;\n\tconst characters = externalStemmer.characters;\n\n\tif ( externalStemmer.wordsWithLastAlefRemoved.includes( word ) ) {\n\t\treturn word + characters.alef;\n\t}\n\tif ( externalStemmer.wordsWithLastHamzaRemoved.includes( word ) ) {\n\t\treturn word + characters.alef_hamza_above;\n\t}\n\tif ( externalStemmer.wordsWithLastMaksoraRemoved.includes( word ) ) {\n\t\treturn word + characters.yeh_maksorah;\n\t}\n\tif ( externalStemmer.wordsWithLastYehRemoved.includes( word ) ) {\n\t\treturn word + characters.yeh;\n\t}\n};\n\n/**\n * Check if the word is on the list of three-letter roots which had the first weak letter removed (so are now two letters long).\n * If the word is on the list, add back the removed first letter and return the three-letter root.\n * Examples: مض -> ومض (word with first weak letter و (waw) removed) , سن -> يسن (word with first weak letter ي (yeh) removed)\n *\n * @param {string}\tword\t\t\tThe two-letter word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null}\tThe word with the first weak letter added back or null if the word was not found on any list.\n */\nconst checkWordsWithRemovedFirstLetter = function( word, morphologyData ) {\n\tconst externalStemmer = morphologyData.externalStemmer;\n\tconst characters = externalStemmer.characters;\n\n\tif ( externalStemmer.wordsWithFirstWawRemoved.includes( word ) ) {\n\t\treturn characters.waw + word;\n\t}\n\tif ( externalStemmer.wordsWithFirstYehRemoved.includes( word ) ) {\n\t\treturn characters.yeh + word;\n\t}\n};\n\n/**\n * Check if the word is on the list of three-letter roots which had the middle weak letter removed (so are now two letters long).\n * If the word is on the list, add back the removed middle letter and return the three-letter root.\n * Examples: غز -> غوز (word with middle weak letter و (waw) removed), لن -> لين (word with middle weak letter ي (yeh) removed)\n *\n * @param {string}\tword\t\t\tThe two-letter word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null}\tThe word with the middle weak letter added back or null if the word was not found on a list.\n */\nconst checkWordsWithRemovedMiddleLetter = function( word, morphologyData ) {\n\tconst externalStemmer = morphologyData.externalStemmer;\n\tconst characters = externalStemmer.characters;\n\n\tif ( externalStemmer.wordsWithMiddleWawRemoved.includes( word ) ) {\n\t\treturn word[ 0 ] + characters.waw + word[ 1 ];\n\t}\n\tif ( externalStemmer.wordsWithMiddleYehRemoved.includes( word ) ) {\n\t\treturn word[ 0 ] + characters.yeh + word[ 1 ];\n\t}\n};\n\n\n/**\n * Find the root of two-letter words. Two-letter words usually come from three-letter roots for which a letter was deleted\n * as it is a duplicated last letter or a weak letter.\n *\n * @param {string}\tword\t\t\tThe two-letter word to process.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string}\tThe three-letter root or the input word if no root was found.\n */\nconst processTwoLetterWords = function( word, morphologyData ) {\n\t// Check whether the word is on the list of words with removed duplicate last letter. If it is, add back the removed letter to get the root.\n\tif ( morphologyData.externalStemmer.wordsWithRemovedDuplicateLetter.includes( word ) ) {\n\t\treturn word + word.substring( 1 );\n\t}\n\t// Check whether the word is on one of the lists of words with removed weak letter or hamza.\n\tconst wordAfterLastLetterCheck = checkWordsWithRemovedLastLetter( word, morphologyData );\n\tif ( wordAfterLastLetterCheck ) {\n\t\treturn wordAfterLastLetterCheck;\n\t}\n\tconst wordAfterFirstLetterCheck = checkWordsWithRemovedFirstLetter( word, morphologyData );\n\tif ( wordAfterFirstLetterCheck ) {\n\t\treturn wordAfterFirstLetterCheck;\n\t}\n\tconst wordAfterMiddleLetterCheck = checkWordsWithRemovedMiddleLetter( word, morphologyData );\n\tif ( wordAfterMiddleLetterCheck ) {\n\t\treturn wordAfterMiddleLetterCheck;\n\t}\n\n\treturn word;\n};\n\n/**\n * Remove the middle/last weak letter or hamza in a three letter word. Find its root by checking the appropriate exception lists\n * (words with middle letter removed or words with last letter removed) and attaching the removed letter back.\n * Example: بدء -> بد -> بدأ (three letter word with (ء) hamza ending,\n * which is found on the list of words with last letter removed after removing the suffix)\n *\n * @param {string}\t\tword\t\t\t\t\tThe three-letter word to check.\n * @param {Object}\t\tmorphologyData\t\t\tThe Arabic morphology data.\n * @param {string[]}\treplacementPattern\t\tThe regex to find and remove middle or last weak letter/hamza in three letter words\n * @param {function}\tfunctionToRunToGetRoot\tThe function that checks lists of words with either middle or last letter removed\n * \t\t\t\t\t\t\t\t\t\t\t\tand attaches it back.\n *\n * @returns {string|null}\tThe root or null if no root was found.\n */\nconst processThreeLetterWordsWithWeakLetterOrHamza = function( word, morphologyData, replacementPattern, functionToRunToGetRoot ) {\n\t// Find and remove middle or last weak letter or hamza\n\tconst wordAfterRemovingWeakLetterOrHamza = word.replace( new RegExp( replacementPattern[ 0 ] ),\n\t\treplacementPattern[ 1 ] );\n\tif ( wordAfterRemovingWeakLetterOrHamza !== word ) {\n\t\t/*\n\t\t * If the weak letter or hamza was removed, get the root by checking lists of words with middle/last weak letter\n\t\t * or hamza removed and attaching it back.\n\t\t */\n\t\treturn functionToRunToGetRoot( wordAfterRemovingWeakLetterOrHamza, morphologyData );\n\t}\n};\n\n/**\n * Get the root of three letter words.\n * Examples: ؤكد -> أكد (three letter word with ؤ (waw_hamza) beginning, قدّ -> قدد (three letter word which has a shadda on the second letter)\n *\n * @param {string}\tword\t\t\tThe three-letter word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null}\tThe root or the original input word (which may already be the root).\n */\nconst processThreeLetterWords = function( word, morphologyData ) {\n\tconst characters = morphologyData.externalStemmer.characters;\n\n\t// If the word exists on the list of three letter roots, return the word.\n\tif ( morphologyData.externalStemmer.threeLetterRoots.includes( word ) ) {\n\t\treturn word;\n\t}\n\t// If the first letter is ا/ ؤ/ ئ (yeh_hamza/waw_hamza/alef), change it to أ (alef_hamza_above).\n\tif ( word[ 0 ] === characters.alef || word[ 0 ] === characters.waw_hamza ||\n\t\t\tword[ 0 ] === characters.yeh_hamza ) {\n\t\tword = characters.alef_hamza_above + word.slice( 1 );\n\t}\n\n\t// If the last letter is a weak letter or a hamza, check if the word is a root that may get the last weak letter/hamza removed.\n\tconst wordAfterLastWeakLetterOrHamzaCheck = processThreeLetterWordsWithWeakLetterOrHamza( word, morphologyData,\n\t\tmorphologyData.externalStemmer.regexRemoveLastWeakLetterOrHamza, checkWordsWithRemovedLastLetter );\n\tif ( wordAfterLastWeakLetterOrHamzaCheck ) {\n\t\treturn wordAfterLastWeakLetterOrHamzaCheck;\n\t}\n\n\t// If the middle letter is a waw, yeh, alef or a yeh_hamza, check if the word is a root that may get the middle weak letter/hamza removed..\n\tconst wordAfterMiddleWeakLetterOrHamzaCheck = processThreeLetterWordsWithWeakLetterOrHamza( word, morphologyData,\n\t\tmorphologyData.externalStemmer.regexRemoveMiddleWeakLetterOrHamza, checkWordsWithRemovedMiddleLetter );\n\tif ( wordAfterMiddleWeakLetterOrHamzaCheck ) {\n\t\treturn wordAfterMiddleWeakLetterOrHamzaCheck;\n\t}\n\n\tconst regexReplaceMiddleLetterWithAlef = morphologyData.externalStemmer.regexReplaceMiddleLetterWithAlef;\n\tconst regexReplaceMiddleLetterWithAlefWithHamza = morphologyData.externalStemmer.regexReplaceMiddleLetterWithAlefWithHamza;\n\n\t// If the word has ئ/ؤ (yeh_hamza/waw_hamza) as the second letter and ends in ر/ز/ن (noon/zai/reh), change ئ/ؤ (yeh_hamza/waw_hamza) to ا (alef).\n\tconst wordAfterReplacingMiddleLetterWithAlef = word.replace( new RegExp( regexReplaceMiddleLetterWithAlef[ 0 ] ),\n\t\tregexReplaceMiddleLetterWithAlef[ 1 ] );\n\tif ( wordAfterReplacingMiddleLetterWithAlef === word ) {\n\t\t// If the second letter is a ئ/ؤ (yeh_hamza/waw_hamza) and it doesn't end in noon/zai/reh, change ئ/ؤ d to أ (alef_hamza_above).\n\t\tword = word.replace( new RegExp( regexReplaceMiddleLetterWithAlefWithHamza[ 0 ] ),\n\t\t\tregexReplaceMiddleLetterWithAlefWithHamza[ 1 ] );\n\t} else {\n\t\tword = wordAfterReplacingMiddleLetterWithAlef;\n\t}\n\t// If the last letter is a shadda, remove it and duplicate the last letter.\n\tconst regexRemoveShaddaAndDuplicateLastLetter = morphologyData.externalStemmer.regexRemoveShaddaAndDuplicateLastLetter;\n\tword = word.replace( new RegExp( regexRemoveShaddaAndDuplicateLastLetter[ 0 ] ),\n\t\tregexRemoveShaddaAndDuplicateLastLetter[ 1 ] );\n\n\treturn word;\n};\n\n/**\n * Check whether the word matches the pattern (it is a 6 letter-word, the fourth and sixth letter are the same, and the pattern\n * and the word share two same letters at the same index). If it does, remove the first character and the two last characters and\n * get the root.\n * Example: احولال -> حول (the stem is the 2nd to 4th character)\n *\n * @param {string}\tword\t\t\t\tThe word to check.\n * @param {number}\tnumberSameLetters\tThe number of letters the word and the pattern share at the same index.\n * @param {Object}\tmorphologyData\t\tThe Arabic morphology data.\n *\n * @returns {string} The root or the original word if word was not matched by the pattern.\n */\nconst checkFirstPatternAndGetRoot = function( word, numberSameLetters, morphologyData ) {\n\tif ( word.length === 6 && word[ 3 ] === word[ 5 ] && numberSameLetters === 2 ) {\n\t\treturn processThreeLetterWords( word.substring( 1, 4 ), morphologyData );\n\t}\n\treturn word;\n};\n\n/**\n * Checks whether the word matches the pattern (the word shares three characters with the pattern) and get the root if it does.\n * Example: استكتب -> كتب (A word that matches pattern (استفعل))\n *\n * @param {string}\tword\t\t\t\tThe word to check.\n * @param {string}\tpattern\t\t\t\tThe pattern to check.\n * @param {number}\tnumberSameLetters\tThe number of letters the word and the pattern share at the same index.\n * @param {Object}\tmorphologyData\t\tThe Arabic morphology data.\n *\n * @returns {string} The root or the original word if no root was found.\n */\nconst checkSecondPatternAndGetRoot = function( word, pattern, numberSameLetters, morphologyData ) {\n\tconst characters = morphologyData.externalStemmer.characters;\n\t// If the word length minus three is equal to or less than the number of same letters found in the checkPatterns function.\n\tif ( word.length - 3 <= numberSameLetters ) {\n\t\tlet root = \"\";\n\t\tfor ( let i = 0; i < word.length; i++ ) {\n\t\t\tif ( pattern[ i ] === characters.feh ||\n\t\t\t\tpattern[ i ] === characters.aen ||\n\t\t\t\tpattern[ i ] === characters.lam ) {\n\t\t\t\troot = root.concat( word[ i ] );\n\t\t\t}\n\t\t}\n\n\t\treturn processThreeLetterWords( root, morphologyData );\n\t}\n\treturn word;\n};\n\n/**\n * Count the number of letters the word and the pattern to match with share at the same index.\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {string}\tpattern\t\t\tThe pattern to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {number}\tThe number of shared letters between the word and the pattern at the same index.\n */\nconst countSharedLettersBetweenWordAndPattern = function( word, pattern, morphologyData ) {\n\tconst characters = morphologyData.externalStemmer.characters;\n\n\tlet numberSameLetters = 0;\n\tfor ( let i = 0; i < word.length; i++ ) {\n\t\tif ( pattern[ i ] === word[ i ] &&\n\t\t\tpattern[ i ] !== characters.feh &&\n\t\t\tpattern[ i ] !== characters.aen &&\n\t\t\tpattern[ i ] !== characters.lam ) {\n\t\t\tnumberSameLetters++;\n\t\t}\n\t}\n\treturn numberSameLetters;\n};\n\n/**\n * Check if a word matches a specific pattern of letters, and if it does, modify the word to get the root.\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null} An object with either the root or the modified word and the information whether the root was found,\n * \t\t\t\t\t\t  or null if the word was not modified and the root was not found.\n */\nconst checkPatterns = function( word, morphologyData ) {\n\t// If the first letter is an alef_madda, alef_hamza_above, or alef_hamza_below (أ/إ/آ), change it to an alef (ا)\n\tconst wordAfterModification = matchWithRegexAndReplace( word, morphologyData.externalStemmer.regexReplaceFirstHamzaWithAlef );\n\n\t// Try and find a pattern that matches the word\n\tfor ( const pattern of morphologyData.externalStemmer.patterns ) {\n\t\tif ( pattern.length === wordAfterModification.length ) {\n\t\t\t// Count the number of letters the word and the pattern share at the same index.\n\t\t\tconst numberSameLetters = countSharedLettersBetweenWordAndPattern( wordAfterModification, pattern, morphologyData );\n\n\t\t\tconst wordAfterCheckingFirstPattern = checkFirstPatternAndGetRoot( wordAfterModification, numberSameLetters, morphologyData );\n\t\t\tif ( wordAfterCheckingFirstPattern !== wordAfterModification ) {\n\t\t\t\treturn { word: wordAfterCheckingFirstPattern, rootFound: true };\n\t\t\t}\n\n\t\t\tconst wordAfterCheckingSecondPattern = checkSecondPatternAndGetRoot( wordAfterModification, pattern, numberSameLetters, morphologyData );\n\t\t\tif ( wordAfterCheckingSecondPattern !== wordAfterModification ) {\n\t\t\t\treturn { word: wordAfterCheckingSecondPattern, rootFound: true };\n\t\t\t}\n\t\t}\n\t}\n\n\t// If a pattern was not matched but the word was modified, return the modified word.\n\tif ( wordAfterModification !== word ) {\n\t\treturn { word: wordAfterModification, rootFound: false };\n\t}\n};\n\n/**\n * Tries to find the root of two-, three- and four-letter words by checking lists and/or applying modifications to the word.\n *\n * Example: the word أبطر is on the list of four-letter roots.\n *\n * @param {string} \tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string|null} The root or null if the root was not found.\n */\nconst checkIfWordIsRoot = function( word, morphologyData ) {\n\t// Check if the word consists of two letters and find its root.\n\tif ( word.length === 2 ) {\n\t\treturn processTwoLetterWords( word, morphologyData );\n\t}\n\t// Check if the word consists of three letters.\n\tif ( word.length === 3 ) {\n\t\treturn processThreeLetterWords( word, morphologyData );\n\t}\n\t// If the word consists of four letters, check if it is on the list of four-letter roots.\n\tif ( word.length === 4 ) {\n\t\tif ( morphologyData.externalStemmer.fourLetterRoots.includes( word ) ) {\n\t\t\treturn word;\n\t\t}\n\t}\n};\n\n/**\n * Checks whether the word ends in a suffix, and removes it if it does.\n *\n * @param {string}\t\tword\t\tThe word to check.\n * @param {string[]}\tsuffixes\tThe suffixes to check.\n *\n * @returns {string}\tThe word with the suffix removed or the input word if no suffix was found.\n */\nconst removeSuffix = function( word, suffixes ) {\n\tfor ( const suffix of suffixes ) {\n\t\tif ( word.endsWith( suffix ) ) {\n\t\t\treturn word.slice( 0, -suffix.length );\n\t\t}\n\t}\n\treturn word;\n};\n\n/**\n * Checks whether the word starts with a prefix, and removes it if it does.\n *\n * @param {string}\t\tword\t\tThe word to check.\n * @param {string[]}\tprefixes\tThe prefixes to check.\n *\n * @returns {string}\tThe word with the prefix removed or the input word if no prefix was found.\n */\nconst removePrefix = function( word, prefixes ) {\n\tfor ( const prefix of prefixes ) {\n\t\tif ( word.startsWith( prefix ) ) {\n\t\t\treturn word.substring( prefix.length, word.length );\n\t\t}\n\t}\n\treturn word;\n};\n\n/**\n * Searches for a suffix, removes it if found, and tries to find the root of the stemmed word. If the root is not found, the\n * function returns null, with one exception: it is possible that in the checkPatterns function that is ran inside of this one,\n * the word is modified but no root is found. In this case, the function returns the modified word.\n *\n * Example: جمعكم -> جمع (word with suffix كم which is found on the list of three-letter roots after removing the suffix).\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null} An object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t  the word is not modified and no root is found.\n */\nconst processWordWithSuffix = function( word, morphologyData ) {\n\t// Find and remove suffix.\n\tconst wordAfterRemovingSuffix = removeSuffix( word, morphologyData.externalStemmer.suffixes );\n\tif ( wordAfterRemovingSuffix !== word ) {\n\t\t// If suffix was removed, check if the stemmed word is a root.\n\t\tconst root = checkIfWordIsRoot( wordAfterRemovingSuffix, morphologyData );\n\t\tif ( root ) {\n\t\t\treturn { word: root, rootFound: true };\n\t\t}\n\t\t// If no root was found, try to get the root by matching with a pattern.\n\t\tconst outputAfterCheckingPatterns = checkPatterns( wordAfterRemovingSuffix, morphologyData );\n\t\tif ( outputAfterCheckingPatterns ) {\n\t\t\treturn outputAfterCheckingPatterns;\n\t\t}\n\t}\n};\n\n/**\n * Searches for a prefix (other than the definite article), removes it if found, and tries to find the root of the stemmed\n * word. If the root is not found, the function returns null, with one exception: it is possible that in the checkPatterns\n * function that is ran inside of this one, the word is modified but no root is found. In this case, the function returns\n * the modified word.\n *\n * Example: للزهور -> زهر (word with prefix لل that gets its root by matching with a pattern after removing the prefix).\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null}\tAn object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t    the word is not modified and no root is found.\n */\nconst processWordWithPrefix = function( word, morphologyData ) {\n\t// Find and remove prefix.\n\tlet wordAfterRemovingPrefix = removePrefix( word, morphologyData.externalStemmer.prefixes );\n\tif ( wordAfterRemovingPrefix !== word ) {\n\t\t// If prefix was removed, check if the stemmed word is a root.\n\t\tconst root = checkIfWordIsRoot( wordAfterRemovingPrefix, morphologyData );\n\t\tif ( root ) {\n\t\t\treturn { word: root, rootFound: true };\n\t\t}\n\t\t// If no root was found, try to get the root by matching with a pattern.\n\t\tconst outputAfterCheckingPatterns = checkPatterns( wordAfterRemovingPrefix, morphologyData );\n\t\tif ( outputAfterCheckingPatterns ) {\n\t\t\tif ( outputAfterCheckingPatterns.rootFound === true ) {\n\t\t\t\treturn outputAfterCheckingPatterns;\n\t\t\t}\n\t\t\twordAfterRemovingPrefix = outputAfterCheckingPatterns.word;\n\t\t}\n\t\t// If the root was still not found, try to find and remove suffixes and find the root again.\n\t\tconst outputAfterCheckingForSuffixes = processWordWithSuffix( wordAfterRemovingPrefix, morphologyData );\n\t\tif ( outputAfterCheckingForSuffixes ) {\n\t\t\treturn outputAfterCheckingForSuffixes;\n\t\t}\n\t}\n};\n\n/**\n * Checks if the word is a root. If root is not found, checks whether the root can be derived using a pattern. If the root is\n * still not found, removes affixes and tries to find the root again. If the root is not found, the function returns null,\n * with one exception: it is possible that in the checkPatterns function that is ran inside of this one, the word is modified\n * but no root is found. In this case, the function returns the modified word.\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null}\tAn object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t    the word is not modified and no root is found.\n */\nconst findRoot = function( word, morphologyData ) {\n\t// Check if the word is a root.\n\tconst root = checkIfWordIsRoot( word, morphologyData );\n\tif ( root ) {\n\t\treturn { word: root, rootFound: true };\n\t}\n\n\t// Check if the root can be derived by matching a pattern. إعدجص\n\tconst outputAfterCheckingPatterns = checkPatterns( word, morphologyData );\n\tlet stemmedWord = word;\n\tif ( outputAfterCheckingPatterns ) {\n\t\tif ( outputAfterCheckingPatterns.rootFound === true ) {\n\t\t\treturn outputAfterCheckingPatterns;\n\t\t}\n\t\t// Word: اعدجص\n\t\tstemmedWord = outputAfterCheckingPatterns.word;\n\t}\n\t// Remove affixes and check if the stemmed word is a root\n\tconst outputAfterProcessingSuffix = processWordWithSuffix( stemmedWord, morphologyData );\n\tif ( outputAfterProcessingSuffix ) {\n\t\treturn outputAfterProcessingSuffix;\n\t}\n\tconst outputAfterRemovingPrefix = processWordWithPrefix( stemmedWord, morphologyData );\n\tif ( outputAfterRemovingPrefix ) {\n\t\treturn outputAfterRemovingPrefix;\n\t}\n\n\tif ( stemmedWord !== word ) {\n\t\treturn { word: stemmedWord, rootFound: false };\n\t}\n};\n\n/**\n * Search for and remove a definite article and try to get the root of the word. If the root was not found, but the word\n * was modified inside the checkPatterns function, returns the modified word. If the definite article was removed and the\n * stemmed word is longer than three letters, but the root was not found, returns the stemmed word. Otherwise, if the root\n * was not found, returns null.\n *\n * Example: الجدولين -> جدول (word with definite article ال and suffix ين ).\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null}\tAn object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t    the word is not modified and no root is found.\n */\nconst processWordWithDefiniteArticle = function( word, morphologyData ) {\n\t// Search for and remove the definite article.\n\tconst wordAfterRemovingDefiniteArticle = removePrefix( word, morphologyData.externalStemmer.definiteArticles );\n\t// If a definite article was removed, try to find the root.\n\tif ( wordAfterRemovingDefiniteArticle !== word ) {\n\t\t/**\n\t\t * If definite article was removed, try to find root by checking whether the word is a root, matching with a pattern, and/or\n\t\t * searching for and removing prefixes.\n\t\t */\n\t\tconst outputAfterTryingToFindRoot = findRoot( wordAfterRemovingDefiniteArticle, morphologyData );\n\t\tif ( outputAfterTryingToFindRoot  ) {\n\t\t\treturn outputAfterTryingToFindRoot;\n\t\t}\n\n\t\t// Return it even if no root was found.\n\t\treturn { word: wordAfterRemovingDefiniteArticle, rootFound: false };\n\t}\n};\n\n/**\n * Searches for prefix waw (و) and removes it if found, then tries to find the root. If the root is still not found, removes\n * affixes and tries to find the root again. If the root is not found, the function returns null, with one exception: it\n * is possible that in the checkPatterns function that is ran inside of this one, the word is modified but no root is found.\n * In this case, the function returns the modified word.\n *\n * Example: وتمثّل -> مثل (word with prefix waw which matches a pattern after removing the prefix).\n *\n * @param {string}\tword\t\t\tThe word to check.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {Object|null}\tAn object with the root/modified word and information about whether the root was found, or null if\n * \t\t\t\t\t\t    the word is not modified and no root is found.\n */\nconst processWordWithPrefixWaw = function( word, morphologyData ) {\n\tlet wordAfterRemovingWaw = \"\";\n\tif ( word.length > 3 && word.startsWith( morphologyData.externalStemmer.characters.waw ) ) {\n\t\twordAfterRemovingWaw = word.substring( 1 );\n\t\t/*\n\t\t * If the prefix waw was removed, try to find the root by checking whether the word is a root, matching with a pattern,\n\t\t * and/or searching for and removing prefixes.\n\t\t */\n\t\tconst outputAfterTryingToFindRoot = findRoot( wordAfterRemovingWaw, morphologyData );\n\n\t\tif ( outputAfterTryingToFindRoot ) {\n\t\t\treturn outputAfterTryingToFindRoot;\n\t\t}\n\t}\n};\n\n/**\n * Stems Arabic words.\n *\n * @param {string}\tword\t\t\tThe word to stem.\n * @param {Object}\tmorphologyData\tThe Arabic morphology data.\n *\n * @returns {string}\tThe stemmed word.\n */\nexport default function stem( word, morphologyData ) {\n\t// Remove diacritics that serve as phonetic guides and are not usually used in regular writing.\n\tconst regexRemovingDiacritics = morphologyData.externalStemmer.regexRemovingDiacritics;\n\tword.replace( new RegExp( regexRemovingDiacritics ), \"\" );\n\n\tconst root = checkIfWordIsRoot( word, morphologyData );\n\tif ( root ) {\n\t\treturn root;\n\t}\n\t// If the root still hasn't been found, check if the word matches a pattern and get its root if it does.\n\tconst outputAfterCheckingPatterns = checkPatterns( word, morphologyData );\n\tif ( outputAfterCheckingPatterns ) {\n\t\t// Return the root if it was found in the checkPatterns function\n\t\tif ( outputAfterCheckingPatterns.rootFound === true ) {\n\t\t\treturn outputAfterCheckingPatterns.word;\n\t\t}\n\t\t// If the checkPatterns function modified the word but did not find the root, replace the word with the modified word.\n\t\tword = outputAfterCheckingPatterns.word;\n\t}\n\n\t// If the root still hasn't been found, remove the definite article and try to find the root.\n\tconst outputAfterProcessingDefiniteArticle = processWordWithDefiniteArticle( word, morphologyData );\n\tif ( outputAfterProcessingDefiniteArticle ) {\n\t\t// Return the root if it was found after removing the definite article.\n\t\tif ( outputAfterProcessingDefiniteArticle.rootFound === true ) {\n\t\t\treturn outputAfterProcessingDefiniteArticle.word;\n\t\t}\n\t\t// If the definite article was removed but the root was not found, replace the word with the stemmed word.\n\n\t\tword = outputAfterProcessingDefiniteArticle.word;\n\t}\n\n\t// If the root still hasn't been found, remove the prefix waw and try to find the root.\n\tconst outputAfterProcessingPrefixWaw = processWordWithPrefixWaw( word, morphologyData );\n\tif ( outputAfterProcessingPrefixWaw ) {\n\t\tif ( outputAfterProcessingPrefixWaw.rootFound === true ) {\n\t\t\treturn outputAfterProcessingPrefixWaw.word;\n\t\t}\n\t\t// If the checkPatterns function modified the word but did not find the root, replace the word with the modified word.\n\t\tword = outputAfterProcessingPrefixWaw.word;\n\t}\n\t// If the root still hasn't been found, remove a suffix and try to find the root.\n\tconst outputAfterProcessingSuffix = processWordWithSuffix( word, morphologyData );\n\tif ( outputAfterProcessingSuffix ) {\n\t\treturn outputAfterProcessingSuffix.word;\n\t}\n\n\t// If the root still hasn't been found, remove a prefix and try to find the root.\n\tconst wordAfterProcessingPrefix = processWordWithPrefix( word, morphologyData );\n\tif ( wordAfterProcessingPrefix ) {\n\t\treturn wordAfterProcessingPrefix.word;\n\t}\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;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMA,wBAAwB,GAAG,SAAAA,CAAUC,IAAI,EAAEC,mBAAmB,EAAG;EACtE,OAAOD,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAEF,mBAAmB,CAAE,CAAC,CAAG,CAAC,EAC1DA,mBAAmB,CAAE,CAAC,CAAG,CAAC;AAC5B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,+BAA+B,GAAG,SAAAA,CAAUJ,IAAI,EAAEK,cAAc,EAAG;EACxE,MAAMC,eAAe,GAAGD,cAAc,CAACC,eAAe;EACtD,MAAMC,UAAU,GAAGD,eAAe,CAACC,UAAU;EAE7C,IAAKD,eAAe,CAACE,wBAAwB,CAACC,QAAQ,CAAET,IAAK,CAAC,EAAG;IAChE,OAAOA,IAAI,GAAGO,UAAU,CAACG,IAAI;EAC9B;EACA,IAAKJ,eAAe,CAACK,yBAAyB,CAACF,QAAQ,CAAET,IAAK,CAAC,EAAG;IACjE,OAAOA,IAAI,GAAGO,UAAU,CAACK,gBAAgB;EAC1C;EACA,IAAKN,eAAe,CAACO,2BAA2B,CAACJ,QAAQ,CAAET,IAAK,CAAC,EAAG;IACnE,OAAOA,IAAI,GAAGO,UAAU,CAACO,YAAY;EACtC;EACA,IAAKR,eAAe,CAACS,uBAAuB,CAACN,QAAQ,CAAET,IAAK,CAAC,EAAG;IAC/D,OAAOA,IAAI,GAAGO,UAAU,CAACS,GAAG;EAC7B;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,gCAAgC,GAAG,SAAAA,CAAUjB,IAAI,EAAEK,cAAc,EAAG;EACzE,MAAMC,eAAe,GAAGD,cAAc,CAACC,eAAe;EACtD,MAAMC,UAAU,GAAGD,eAAe,CAACC,UAAU;EAE7C,IAAKD,eAAe,CAACY,wBAAwB,CAACT,QAAQ,CAAET,IAAK,CAAC,EAAG;IAChE,OAAOO,UAAU,CAACY,GAAG,GAAGnB,IAAI;EAC7B;EACA,IAAKM,eAAe,CAACc,wBAAwB,CAACX,QAAQ,CAAET,IAAK,CAAC,EAAG;IAChE,OAAOO,UAAU,CAACS,GAAG,GAAGhB,IAAI;EAC7B;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMqB,iCAAiC,GAAG,SAAAA,CAAUrB,IAAI,EAAEK,cAAc,EAAG;EAC1E,MAAMC,eAAe,GAAGD,cAAc,CAACC,eAAe;EACtD,MAAMC,UAAU,GAAGD,eAAe,CAACC,UAAU;EAE7C,IAAKD,eAAe,CAACgB,yBAAyB,CAACb,QAAQ,CAAET,IAAK,CAAC,EAAG;IACjE,OAAOA,IAAI,CAAE,CAAC,CAAE,GAAGO,UAAU,CAACY,GAAG,GAAGnB,IAAI,CAAE,CAAC,CAAE;EAC9C;EACA,IAAKM,eAAe,CAACiB,yBAAyB,CAACd,QAAQ,CAAET,IAAK,CAAC,EAAG;IACjE,OAAOA,IAAI,CAAE,CAAC,CAAE,GAAGO,UAAU,CAACS,GAAG,GAAGhB,IAAI,CAAE,CAAC,CAAE;EAC9C;AACD,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMwB,qBAAqB,GAAG,SAAAA,CAAUxB,IAAI,EAAEK,cAAc,EAAG;EAC9D;EACA,IAAKA,cAAc,CAACC,eAAe,CAACmB,+BAA+B,CAAChB,QAAQ,CAAET,IAAK,CAAC,EAAG;IACtF,OAAOA,IAAI,GAAGA,IAAI,CAAC0B,SAAS,CAAE,CAAE,CAAC;EAClC;EACA;EACA,MAAMC,wBAAwB,GAAGvB,+BAA+B,CAAEJ,IAAI,EAAEK,cAAe,CAAC;EACxF,IAAKsB,wBAAwB,EAAG;IAC/B,OAAOA,wBAAwB;EAChC;EACA,MAAMC,yBAAyB,GAAGX,gCAAgC,CAAEjB,IAAI,EAAEK,cAAe,CAAC;EAC1F,IAAKuB,yBAAyB,EAAG;IAChC,OAAOA,yBAAyB;EACjC;EACA,MAAMC,0BAA0B,GAAGR,iCAAiC,CAAErB,IAAI,EAAEK,cAAe,CAAC;EAC5F,IAAKwB,0BAA0B,EAAG;IACjC,OAAOA,0BAA0B;EAClC;EAEA,OAAO7B,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM8B,4CAA4C,GAAG,SAAAA,CAAU9B,IAAI,EAAEK,cAAc,EAAE0B,kBAAkB,EAAEC,sBAAsB,EAAG;EACjI;EACA,MAAMC,kCAAkC,GAAGjC,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAE4B,kBAAkB,CAAE,CAAC,CAAG,CAAC,EAC7FA,kBAAkB,CAAE,CAAC,CAAG,CAAC;EAC1B,IAAKE,kCAAkC,KAAKjC,IAAI,EAAG;IAClD;AACF;AACA;AACA;IACE,OAAOgC,sBAAsB,CAAEC,kCAAkC,EAAE5B,cAAe,CAAC;EACpF;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM6B,uBAAuB,GAAG,SAAAA,CAAUlC,IAAI,EAAEK,cAAc,EAAG;EAChE,MAAME,UAAU,GAAGF,cAAc,CAACC,eAAe,CAACC,UAAU;;EAE5D;EACA,IAAKF,cAAc,CAACC,eAAe,CAAC6B,gBAAgB,CAAC1B,QAAQ,CAAET,IAAK,CAAC,EAAG;IACvE,OAAOA,IAAI;EACZ;EACA;EACA,IAAKA,IAAI,CAAE,CAAC,CAAE,KAAKO,UAAU,CAACG,IAAI,IAAIV,IAAI,CAAE,CAAC,CAAE,KAAKO,UAAU,CAAC6B,SAAS,IACtEpC,IAAI,CAAE,CAAC,CAAE,KAAKO,UAAU,CAAC8B,SAAS,EAAG;IACtCrC,IAAI,GAAGO,UAAU,CAACK,gBAAgB,GAAGZ,IAAI,CAACsC,KAAK,CAAE,CAAE,CAAC;EACrD;;EAEA;EACA,MAAMC,mCAAmC,GAAGT,4CAA4C,CAAE9B,IAAI,EAAEK,cAAc,EAC7GA,cAAc,CAACC,eAAe,CAACkC,gCAAgC,EAAEpC,+BAAgC,CAAC;EACnG,IAAKmC,mCAAmC,EAAG;IAC1C,OAAOA,mCAAmC;EAC3C;;EAEA;EACA,MAAME,qCAAqC,GAAGX,4CAA4C,CAAE9B,IAAI,EAAEK,cAAc,EAC/GA,cAAc,CAACC,eAAe,CAACoC,kCAAkC,EAAErB,iCAAkC,CAAC;EACvG,IAAKoB,qCAAqC,EAAG;IAC5C,OAAOA,qCAAqC;EAC7C;EAEA,MAAME,gCAAgC,GAAGtC,cAAc,CAACC,eAAe,CAACqC,gCAAgC;EACxG,MAAMC,yCAAyC,GAAGvC,cAAc,CAACC,eAAe,CAACsC,yCAAyC;;EAE1H;EACA,MAAMC,sCAAsC,GAAG7C,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAEwC,gCAAgC,CAAE,CAAC,CAAG,CAAC,EAC/GA,gCAAgC,CAAE,CAAC,CAAG,CAAC;EACxC,IAAKE,sCAAsC,KAAK7C,IAAI,EAAG;IACtD;IACAA,IAAI,GAAGA,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAEyC,yCAAyC,CAAE,CAAC,CAAG,CAAC,EAChFA,yCAAyC,CAAE,CAAC,CAAG,CAAC;EAClD,CAAC,MAAM;IACN5C,IAAI,GAAG6C,sCAAsC;EAC9C;EACA;EACA,MAAMC,uCAAuC,GAAGzC,cAAc,CAACC,eAAe,CAACwC,uCAAuC;EACtH9C,IAAI,GAAGA,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAE2C,uCAAuC,CAAE,CAAC,CAAG,CAAC,EAC9EA,uCAAuC,CAAE,CAAC,CAAG,CAAC;EAE/C,OAAO9C,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM+C,2BAA2B,GAAG,SAAAA,CAAU/C,IAAI,EAAEgD,iBAAiB,EAAE3C,cAAc,EAAG;EACvF,IAAKL,IAAI,CAACiD,MAAM,KAAK,CAAC,IAAIjD,IAAI,CAAE,CAAC,CAAE,KAAKA,IAAI,CAAE,CAAC,CAAE,IAAIgD,iBAAiB,KAAK,CAAC,EAAG;IAC9E,OAAOd,uBAAuB,CAAElC,IAAI,CAAC0B,SAAS,CAAE,CAAC,EAAE,CAAE,CAAC,EAAErB,cAAe,CAAC;EACzE;EACA,OAAOL,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMkD,4BAA4B,GAAG,SAAAA,CAAUlD,IAAI,EAAEmD,OAAO,EAAEH,iBAAiB,EAAE3C,cAAc,EAAG;EACjG,MAAME,UAAU,GAAGF,cAAc,CAACC,eAAe,CAACC,UAAU;EAC5D;EACA,IAAKP,IAAI,CAACiD,MAAM,GAAG,CAAC,IAAID,iBAAiB,EAAG;IAC3C,IAAII,IAAI,GAAG,EAAE;IACb,KAAM,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGrD,IAAI,CAACiD,MAAM,EAAEI,CAAC,EAAE,EAAG;MACvC,IAAKF,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAAC+C,GAAG,IACnCH,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAACgD,GAAG,IAC/BJ,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAACiD,GAAG,EAAG;QAClCJ,IAAI,GAAGA,IAAI,CAACK,MAAM,CAAEzD,IAAI,CAAEqD,CAAC,CAAG,CAAC;MAChC;IACD;IAEA,OAAOnB,uBAAuB,CAAEkB,IAAI,EAAE/C,cAAe,CAAC;EACvD;EACA,OAAOL,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM0D,uCAAuC,GAAG,SAAAA,CAAU1D,IAAI,EAAEmD,OAAO,EAAE9C,cAAc,EAAG;EACzF,MAAME,UAAU,GAAGF,cAAc,CAACC,eAAe,CAACC,UAAU;EAE5D,IAAIyC,iBAAiB,GAAG,CAAC;EACzB,KAAM,IAAIK,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGrD,IAAI,CAACiD,MAAM,EAAEI,CAAC,EAAE,EAAG;IACvC,IAAKF,OAAO,CAAEE,CAAC,CAAE,KAAKrD,IAAI,CAAEqD,CAAC,CAAE,IAC9BF,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAAC+C,GAAG,IAC/BH,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAACgD,GAAG,IAC/BJ,OAAO,CAAEE,CAAC,CAAE,KAAK9C,UAAU,CAACiD,GAAG,EAAG;MAClCR,iBAAiB,EAAE;IACpB;EACD;EACA,OAAOA,iBAAiB;AACzB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMW,aAAa,GAAG,SAAAA,CAAU3D,IAAI,EAAEK,cAAc,EAAG;EACtD;EACA,MAAMuD,qBAAqB,GAAG7D,wBAAwB,CAAEC,IAAI,EAAEK,cAAc,CAACC,eAAe,CAACuD,8BAA+B,CAAC;;EAE7H;EACA,KAAM,MAAMV,OAAO,IAAI9C,cAAc,CAACC,eAAe,CAACwD,QAAQ,EAAG;IAChE,IAAKX,OAAO,CAACF,MAAM,KAAKW,qBAAqB,CAACX,MAAM,EAAG;MACtD;MACA,MAAMD,iBAAiB,GAAGU,uCAAuC,CAAEE,qBAAqB,EAAET,OAAO,EAAE9C,cAAe,CAAC;MAEnH,MAAM0D,6BAA6B,GAAGhB,2BAA2B,CAAEa,qBAAqB,EAAEZ,iBAAiB,EAAE3C,cAAe,CAAC;MAC7H,IAAK0D,6BAA6B,KAAKH,qBAAqB,EAAG;QAC9D,OAAO;UAAE5D,IAAI,EAAE+D,6BAA6B;UAAEC,SAAS,EAAE;QAAK,CAAC;MAChE;MAEA,MAAMC,8BAA8B,GAAGf,4BAA4B,CAAEU,qBAAqB,EAAET,OAAO,EAAEH,iBAAiB,EAAE3C,cAAe,CAAC;MACxI,IAAK4D,8BAA8B,KAAKL,qBAAqB,EAAG;QAC/D,OAAO;UAAE5D,IAAI,EAAEiE,8BAA8B;UAAED,SAAS,EAAE;QAAK,CAAC;MACjE;IACD;EACD;;EAEA;EACA,IAAKJ,qBAAqB,KAAK5D,IAAI,EAAG;IACrC,OAAO;MAAEA,IAAI,EAAE4D,qBAAqB;MAAEI,SAAS,EAAE;IAAM,CAAC;EACzD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,iBAAiB,GAAG,SAAAA,CAAUlE,IAAI,EAAEK,cAAc,EAAG;EAC1D;EACA,IAAKL,IAAI,CAACiD,MAAM,KAAK,CAAC,EAAG;IACxB,OAAOzB,qBAAqB,CAAExB,IAAI,EAAEK,cAAe,CAAC;EACrD;EACA;EACA,IAAKL,IAAI,CAACiD,MAAM,KAAK,CAAC,EAAG;IACxB,OAAOf,uBAAuB,CAAElC,IAAI,EAAEK,cAAe,CAAC;EACvD;EACA;EACA,IAAKL,IAAI,CAACiD,MAAM,KAAK,CAAC,EAAG;IACxB,IAAK5C,cAAc,CAACC,eAAe,CAAC6D,eAAe,CAAC1D,QAAQ,CAAET,IAAK,CAAC,EAAG;MACtE,OAAOA,IAAI;IACZ;EACD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMoE,YAAY,GAAG,SAAAA,CAAUpE,IAAI,EAAEqE,QAAQ,EAAG;EAC/C,KAAM,MAAMC,MAAM,IAAID,QAAQ,EAAG;IAChC,IAAKrE,IAAI,CAACuE,QAAQ,CAAED,MAAO,CAAC,EAAG;MAC9B,OAAOtE,IAAI,CAACsC,KAAK,CAAE,CAAC,EAAE,CAACgC,MAAM,CAACrB,MAAO,CAAC;IACvC;EACD;EACA,OAAOjD,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMwE,YAAY,GAAG,SAAAA,CAAUxE,IAAI,EAAEyE,QAAQ,EAAG;EAC/C,KAAM,MAAMC,MAAM,IAAID,QAAQ,EAAG;IAChC,IAAKzE,IAAI,CAAC2E,UAAU,CAAED,MAAO,CAAC,EAAG;MAChC,OAAO1E,IAAI,CAAC0B,SAAS,CAAEgD,MAAM,CAACzB,MAAM,EAAEjD,IAAI,CAACiD,MAAO,CAAC;IACpD;EACD;EACA,OAAOjD,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM4E,qBAAqB,GAAG,SAAAA,CAAU5E,IAAI,EAAEK,cAAc,EAAG;EAC9D;EACA,MAAMwE,uBAAuB,GAAGT,YAAY,CAAEpE,IAAI,EAAEK,cAAc,CAACC,eAAe,CAAC+D,QAAS,CAAC;EAC7F,IAAKQ,uBAAuB,KAAK7E,IAAI,EAAG;IACvC;IACA,MAAMoD,IAAI,GAAGc,iBAAiB,CAAEW,uBAAuB,EAAExE,cAAe,CAAC;IACzE,IAAK+C,IAAI,EAAG;MACX,OAAO;QAAEpD,IAAI,EAAEoD,IAAI;QAAEY,SAAS,EAAE;MAAK,CAAC;IACvC;IACA;IACA,MAAMc,2BAA2B,GAAGnB,aAAa,CAAEkB,uBAAuB,EAAExE,cAAe,CAAC;IAC5F,IAAKyE,2BAA2B,EAAG;MAClC,OAAOA,2BAA2B;IACnC;EACD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,qBAAqB,GAAG,SAAAA,CAAU/E,IAAI,EAAEK,cAAc,EAAG;EAC9D;EACA,IAAI2E,uBAAuB,GAAGR,YAAY,CAAExE,IAAI,EAAEK,cAAc,CAACC,eAAe,CAACmE,QAAS,CAAC;EAC3F,IAAKO,uBAAuB,KAAKhF,IAAI,EAAG;IACvC;IACA,MAAMoD,IAAI,GAAGc,iBAAiB,CAAEc,uBAAuB,EAAE3E,cAAe,CAAC;IACzE,IAAK+C,IAAI,EAAG;MACX,OAAO;QAAEpD,IAAI,EAAEoD,IAAI;QAAEY,SAAS,EAAE;MAAK,CAAC;IACvC;IACA;IACA,MAAMc,2BAA2B,GAAGnB,aAAa,CAAEqB,uBAAuB,EAAE3E,cAAe,CAAC;IAC5F,IAAKyE,2BAA2B,EAAG;MAClC,IAAKA,2BAA2B,CAACd,SAAS,KAAK,IAAI,EAAG;QACrD,OAAOc,2BAA2B;MACnC;MACAE,uBAAuB,GAAGF,2BAA2B,CAAC9E,IAAI;IAC3D;IACA;IACA,MAAMiF,8BAA8B,GAAGL,qBAAqB,CAAEI,uBAAuB,EAAE3E,cAAe,CAAC;IACvG,IAAK4E,8BAA8B,EAAG;MACrC,OAAOA,8BAA8B;IACtC;EACD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,QAAQ,GAAG,SAAAA,CAAUlF,IAAI,EAAEK,cAAc,EAAG;EACjD;EACA,MAAM+C,IAAI,GAAGc,iBAAiB,CAAElE,IAAI,EAAEK,cAAe,CAAC;EACtD,IAAK+C,IAAI,EAAG;IACX,OAAO;MAAEpD,IAAI,EAAEoD,IAAI;MAAEY,SAAS,EAAE;IAAK,CAAC;EACvC;;EAEA;EACA,MAAMc,2BAA2B,GAAGnB,aAAa,CAAE3D,IAAI,EAAEK,cAAe,CAAC;EACzE,IAAI8E,WAAW,GAAGnF,IAAI;EACtB,IAAK8E,2BAA2B,EAAG;IAClC,IAAKA,2BAA2B,CAACd,SAAS,KAAK,IAAI,EAAG;MACrD,OAAOc,2BAA2B;IACnC;IACA;IACAK,WAAW,GAAGL,2BAA2B,CAAC9E,IAAI;EAC/C;EACA;EACA,MAAMoF,2BAA2B,GAAGR,qBAAqB,CAAEO,WAAW,EAAE9E,cAAe,CAAC;EACxF,IAAK+E,2BAA2B,EAAG;IAClC,OAAOA,2BAA2B;EACnC;EACA,MAAMC,yBAAyB,GAAGN,qBAAqB,CAAEI,WAAW,EAAE9E,cAAe,CAAC;EACtF,IAAKgF,yBAAyB,EAAG;IAChC,OAAOA,yBAAyB;EACjC;EAEA,IAAKF,WAAW,KAAKnF,IAAI,EAAG;IAC3B,OAAO;MAAEA,IAAI,EAAEmF,WAAW;MAAEnB,SAAS,EAAE;IAAM,CAAC;EAC/C;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMsB,8BAA8B,GAAG,SAAAA,CAAUtF,IAAI,EAAEK,cAAc,EAAG;EACvE;EACA,MAAMkF,gCAAgC,GAAGf,YAAY,CAAExE,IAAI,EAAEK,cAAc,CAACC,eAAe,CAACkF,gBAAiB,CAAC;EAC9G;EACA,IAAKD,gCAAgC,KAAKvF,IAAI,EAAG;IAChD;AACF;AACA;AACA;IACE,MAAMyF,2BAA2B,GAAGP,QAAQ,CAAEK,gCAAgC,EAAElF,cAAe,CAAC;IAChG,IAAKoF,2BAA2B,EAAI;MACnC,OAAOA,2BAA2B;IACnC;;IAEA;IACA,OAAO;MAAEzF,IAAI,EAAEuF,gCAAgC;MAAEvB,SAAS,EAAE;IAAM,CAAC;EACpE;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM0B,wBAAwB,GAAG,SAAAA,CAAU1F,IAAI,EAAEK,cAAc,EAAG;EACjE,IAAIsF,oBAAoB,GAAG,EAAE;EAC7B,IAAK3F,IAAI,CAACiD,MAAM,GAAG,CAAC,IAAIjD,IAAI,CAAC2E,UAAU,CAAEtE,cAAc,CAACC,eAAe,CAACC,UAAU,CAACY,GAAI,CAAC,EAAG;IAC1FwE,oBAAoB,GAAG3F,IAAI,CAAC0B,SAAS,CAAE,CAAE,CAAC;IAC1C;AACF;AACA;AACA;IACE,MAAM+D,2BAA2B,GAAGP,QAAQ,CAAES,oBAAoB,EAAEtF,cAAe,CAAC;IAEpF,IAAKoF,2BAA2B,EAAG;MAClC,OAAOA,2BAA2B;IACnC;EACD;AACD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASG,IAAIA,CAAE5F,IAAI,EAAEK,cAAc,EAAG;EACpD;EACA,MAAMwF,uBAAuB,GAAGxF,cAAc,CAACC,eAAe,CAACuF,uBAAuB;EACtF7F,IAAI,CAACE,OAAO,CAAE,IAAIC,MAAM,CAAE0F,uBAAwB,CAAC,EAAE,EAAG,CAAC;EAEzD,MAAMzC,IAAI,GAAGc,iBAAiB,CAAElE,IAAI,EAAEK,cAAe,CAAC;EACtD,IAAK+C,IAAI,EAAG;IACX,OAAOA,IAAI;EACZ;EACA;EACA,MAAM0B,2BAA2B,GAAGnB,aAAa,CAAE3D,IAAI,EAAEK,cAAe,CAAC;EACzE,IAAKyE,2BAA2B,EAAG;IAClC;IACA,IAAKA,2BAA2B,CAACd,SAAS,KAAK,IAAI,EAAG;MACrD,OAAOc,2BAA2B,CAAC9E,IAAI;IACxC;IACA;IACAA,IAAI,GAAG8E,2BAA2B,CAAC9E,IAAI;EACxC;;EAEA;EACA,MAAM8F,oCAAoC,GAAGR,8BAA8B,CAAEtF,IAAI,EAAEK,cAAe,CAAC;EACnG,IAAKyF,oCAAoC,EAAG;IAC3C;IACA,IAAKA,oCAAoC,CAAC9B,SAAS,KAAK,IAAI,EAAG;MAC9D,OAAO8B,oCAAoC,CAAC9F,IAAI;IACjD;IACA;;IAEAA,IAAI,GAAG8F,oCAAoC,CAAC9F,IAAI;EACjD;;EAEA;EACA,MAAM+F,8BAA8B,GAAGL,wBAAwB,CAAE1F,IAAI,EAAEK,cAAe,CAAC;EACvF,IAAK0F,8BAA8B,EAAG;IACrC,IAAKA,8BAA8B,CAAC/B,SAAS,KAAK,IAAI,EAAG;MACxD,OAAO+B,8BAA8B,CAAC/F,IAAI;IAC3C;IACA;IACAA,IAAI,GAAG+F,8BAA8B,CAAC/F,IAAI;EAC3C;EACA;EACA,MAAMoF,2BAA2B,GAAGR,qBAAqB,CAAE5E,IAAI,EAAEK,cAAe,CAAC;EACjF,IAAK+E,2BAA2B,EAAG;IAClC,OAAOA,2BAA2B,CAACpF,IAAI;EACxC;;EAEA;EACA,MAAMgG,yBAAyB,GAAGjB,qBAAqB,CAAE/E,IAAI,EAAEK,cAAe,CAAC;EAC/E,IAAK2F,yBAAyB,EAAG;IAChC,OAAOA,yBAAyB,CAAChG,IAAI;EACtC;EAEA,OAAOA,IAAI;AACZ","ignoreList":[]}

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

@@ -1,15 +1,8 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = isPassiveSentence;
-var _passiveVerbsWithLongVowel = _interopRequireDefault(require("../config/internal/passiveVerbsWithLongVowel"));
-var _index = require("../../../index");
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+import getPassiveVerbs from "../config/internal/passiveVerbsWithLongVowel";
+import { languageProcessing } from "../../../../index.js";
 const {
   getWords
-} = _index.languageProcessing;
+} = languageProcessing;
 
 /**
  * Checks the passed sentence to see if it contains Arabic passive verb-forms.
@@ -18,7 +11,7 @@ const {
  *
  * @returns {Boolean} Whether the sentence contains Arabic passive voice.
  */
-function isPassiveSentence(sentence) {
+export default function isPassiveSentence(sentence) {
   const arabicPrepositionalPrefix = 'و';
   const words = getWords(sentence);
   const passiveVerbs = [];
@@ -32,7 +25,7 @@ function isPassiveSentence(sentence) {
     if (word.length >= 2) {
       wordWithDamma = word[1].search('\u064F');
     }
-    if (wordWithDamma !== -1 || _passiveVerbsWithLongVowel.default.includes(word)) {
+    if (wordWithDamma !== -1 || getPassiveVerbs.includes(word)) {
       passiveVerbs.push(word);
     }
   }

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

@@ -1 +1 @@
-{"version":3,"file":"isPassiveSentence.js","names":["_passiveVerbsWithLongVowel","_interopRequireDefault","require","_index","e","__esModule","default","getWords","languageProcessing","isPassiveSentence","sentence","arabicPrepositionalPrefix","words","passiveVerbs","word","startsWith","slice","wordWithDamma","length","search","getPassiveVerbs","includes","push"],"sources":["../../../../../src/languageProcessing/languages/ar/helpers/isPassiveSentence.js"],"sourcesContent":["import getPassiveVerbs from '../config/internal/passiveVerbsWithLongVowel';\nimport {languageProcessing} from '../../../index';\nconst {getWords} = languageProcessing;\n\n/**\n * Checks the passed sentence to see if it contains Arabic passive verb-forms.\n *\n * @param {string} sentence     The sentence to match against.\n *\n * @returns {Boolean} Whether the sentence contains Arabic passive voice.\n */\nexport default function isPassiveSentence(sentence) {\n  const arabicPrepositionalPrefix = 'و';\n  const words = getWords(sentence);\n  const passiveVerbs = [];\n\n  for (let word of words) {\n    // Check if the word starts with prefix و\n    if (word.startsWith(arabicPrepositionalPrefix)) {\n      word = word.slice(1);\n    }\n    let wordWithDamma = -1;\n    // Check if the first character has a damma or if the word is in the list of Arabic passive verbs\n    if (word.length >= 2) {\n      wordWithDamma = word[1].search('\\u064F');\n    }\n    if (wordWithDamma !== -1 || getPassiveVerbs.includes(word)) {\n      passiveVerbs.push(word);\n    }\n  }\n\n  return passiveVerbs.length !== 0;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,0BAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,MAAA,GAAAD,OAAA;AAAkD,SAAAD,uBAAAG,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAClD,MAAM;EAACG;AAAQ,CAAC,GAAGC,yBAAkB;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASC,iBAAiBA,CAACC,QAAQ,EAAE;EAClD,MAAMC,yBAAyB,GAAG,GAAG;EACrC,MAAMC,KAAK,GAAGL,QAAQ,CAACG,QAAQ,CAAC;EAChC,MAAMG,YAAY,GAAG,EAAE;EAEvB,KAAK,IAAIC,IAAI,IAAIF,KAAK,EAAE;IACtB;IACA,IAAIE,IAAI,CAACC,UAAU,CAACJ,yBAAyB,CAAC,EAAE;MAC9CG,IAAI,GAAGA,IAAI,CAACE,KAAK,CAAC,CAAC,CAAC;IACtB;IACA,IAAIC,aAAa,GAAG,CAAC,CAAC;IACtB;IACA,IAAIH,IAAI,CAACI,MAAM,IAAI,CAAC,EAAE;MACpBD,aAAa,GAAGH,IAAI,CAAC,CAAC,CAAC,CAACK,MAAM,CAAC,QAAQ,CAAC;IAC1C;IACA,IAAIF,aAAa,KAAK,CAAC,CAAC,IAAIG,kCAAe,CAACC,QAAQ,CAACP,IAAI,CAAC,EAAE;MAC1DD,YAAY,CAACS,IAAI,CAACR,IAAI,CAAC;IACzB;EACF;EAEA,OAAOD,YAAY,CAACK,MAAM,KAAK,CAAC;AAClC","ignoreList":[]}
+{"version":3,"file":"isPassiveSentence.js","names":["getPassiveVerbs","languageProcessing","getWords","isPassiveSentence","sentence","arabicPrepositionalPrefix","words","passiveVerbs","word","startsWith","slice","wordWithDamma","length","search","includes","push"],"sources":["../../../../../src/languageProcessing/languages/ar/helpers/isPassiveSentence.js"],"sourcesContent":["import getPassiveVerbs from '../config/internal/passiveVerbsWithLongVowel';\nimport {languageProcessing} from '@axyseo/index.js';\nconst {getWords} = languageProcessing;\n\n/**\n * Checks the passed sentence to see if it contains Arabic passive verb-forms.\n *\n * @param {string} sentence     The sentence to match against.\n *\n * @returns {Boolean} Whether the sentence contains Arabic passive voice.\n */\nexport default function isPassiveSentence(sentence) {\n  const arabicPrepositionalPrefix = 'و';\n  const words = getWords(sentence);\n  const passiveVerbs = [];\n\n  for (let word of words) {\n    // Check if the word starts with prefix و\n    if (word.startsWith(arabicPrepositionalPrefix)) {\n      word = word.slice(1);\n    }\n    let wordWithDamma = -1;\n    // Check if the first character has a damma or if the word is in the list of Arabic passive verbs\n    if (word.length >= 2) {\n      wordWithDamma = word[1].search('\\u064F');\n    }\n    if (wordWithDamma !== -1 || getPassiveVerbs.includes(word)) {\n      passiveVerbs.push(word);\n    }\n  }\n\n  return passiveVerbs.length !== 0;\n}\n"],"mappings":"AAAA,OAAOA,eAAe;AACtB,SAAQC,kBAAkB;AAC1B,MAAM;EAACC;AAAQ,CAAC,GAAGD,kBAAkB;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASE,iBAAiBA,CAACC,QAAQ,EAAE;EAClD,MAAMC,yBAAyB,GAAG,GAAG;EACrC,MAAMC,KAAK,GAAGJ,QAAQ,CAACE,QAAQ,CAAC;EAChC,MAAMG,YAAY,GAAG,EAAE;EAEvB,KAAK,IAAIC,IAAI,IAAIF,KAAK,EAAE;IACtB;IACA,IAAIE,IAAI,CAACC,UAAU,CAACJ,yBAAyB,CAAC,EAAE;MAC9CG,IAAI,GAAGA,IAAI,CAACE,KAAK,CAAC,CAAC,CAAC;IACtB;IACA,IAAIC,aAAa,GAAG,CAAC,CAAC;IACtB;IACA,IAAIH,IAAI,CAACI,MAAM,IAAI,CAAC,EAAE;MACpBD,aAAa,GAAGH,IAAI,CAAC,CAAC,CAAC,CAACK,MAAM,CAAC,QAAQ,CAAC;IAC1C;IACA,IAAIF,aAAa,KAAK,CAAC,CAAC,IAAIX,eAAe,CAACc,QAAQ,CAACN,IAAI,CAAC,EAAE;MAC1DD,YAAY,CAACQ,IAAI,CAACP,IAAI,CAAC;IACzB;EACF;EAEA,OAAOD,YAAY,CAACK,MAAM,KAAK,CAAC;AAClC","ignoreList":[]}

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

@@ -1,27 +1,20 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
-var _index = require("../../../index");
-var _transitionWords = _interopRequireDefault(require("./config/transitionWords"));
-var _twoPartTransitionWords = _interopRequireDefault(require("./config/twoPartTransitionWords"));
-var _sentenceLength = _interopRequireDefault(require("./config/sentenceLength"));
-var _getStemmer = _interopRequireDefault(require("./helpers/getStemmer"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+import { languageProcessing } from "../../../index.js";
 const {
   AbstractResearcher
-} = _index.languageProcessing;
+} = languageProcessing;
 
 // All config
+import transitionWords from "./config/transitionWords";
+import twoPartTransitionWords from "./config/twoPartTransitionWords";
+import sentenceLength from "./config/sentenceLength";
 
 // All helpers
+import getStemmer from "./helpers/getStemmer";
 
 /**
  * The researcher contains all the researches, helpers, data, and config.
  */
-class Researcher extends AbstractResearcher {
+export default class Researcher extends AbstractResearcher {
   /**
    * Constructor
    * @param {Paper} paper The Paper object that is needed within the researches.
@@ -39,14 +32,13 @@ class Researcher extends AbstractResearcher {
     Object.assign(this.config, {
       language: 'ca',
       functionWords: [],
-      transitionWords: _transitionWords.default,
-      twoPartTransitionWords: _twoPartTransitionWords.default,
-      sentenceLength: _sentenceLength.default
+      transitionWords,
+      twoPartTransitionWords,
+      sentenceLength
     });
     Object.assign(this.helpers, {
-      getStemmer: _getStemmer.default
+      getStemmer
     });
   }
 }
-exports.default = Researcher;
 //# sourceMappingURL=Researcher.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"Researcher.js","names":["_index","require","_transitionWords","_interopRequireDefault","_twoPartTransitionWords","_sentenceLength","_getStemmer","e","__esModule","default","AbstractResearcher","languageProcessing","Researcher","constructor","paper","defaultResearches","getFleschReadingScore","getPassiveVoiceResult","getSentenceBeginnings","functionWordsInKeyphrase","Object","assign","config","language","functionWords","transitionWords","twoPartTransitionWords","sentenceLength","helpers","getStemmer","exports"],"sources":["../../../../src/languageProcessing/languages/ca/Researcher.js"],"sourcesContent":["import {languageProcessing} from '../../../index';\nconst {AbstractResearcher} = languageProcessing;\n\n// All config\nimport transitionWords from './config/transitionWords';\nimport twoPartTransitionWords from './config/twoPartTransitionWords';\nimport sentenceLength from './config/sentenceLength';\n\n// All helpers\nimport getStemmer from './helpers/getStemmer';\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    // Deletes researches that are currently not available in Catalan.\n    // When the research is available, this line should be removed.\n    delete this.defaultResearches.getFleschReadingScore;\n    delete this.defaultResearches.getPassiveVoiceResult;\n    delete this.defaultResearches.getSentenceBeginnings;\n    delete this.defaultResearches.functionWordsInKeyphrase;\n\n    Object.assign(this.config, {\n      language: 'ca',\n      functionWords: [],\n      transitionWords,\n      twoPartTransitionWords,\n      sentenceLength\n    });\n\n    Object.assign(this.helpers, {\n      getStemmer\n    });\n  }\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAIA,IAAAC,gBAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,uBAAA,GAAAD,sBAAA,CAAAF,OAAA;AACA,IAAAI,eAAA,GAAAF,sBAAA,CAAAF,OAAA;AAGA,IAAAK,WAAA,GAAAH,sBAAA,CAAAF,OAAA;AAA8C,SAAAE,uBAAAI,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAR9C,MAAM;EAACG;AAAkB,CAAC,GAAGC,yBAAkB;;AAE/C;;AAKA;;AAGA;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;IACA,OAAO,IAAI,CAACC,iBAAiB,CAACC,qBAAqB;IACnD,OAAO,IAAI,CAACD,iBAAiB,CAACE,qBAAqB;IACnD,OAAO,IAAI,CAACF,iBAAiB,CAACG,qBAAqB;IACnD,OAAO,IAAI,CAACH,iBAAiB,CAACI,wBAAwB;IAEtDC,MAAM,CAACC,MAAM,CAAC,IAAI,CAACC,MAAM,EAAE;MACzBC,QAAQ,EAAE,IAAI;MACdC,aAAa,EAAE,EAAE;MACjBC,eAAe,EAAfA,wBAAe;MACfC,sBAAsB,EAAtBA,+BAAsB;MACtBC,cAAc,EAAdA;IACF,CAAC,CAAC;IAEFP,MAAM,CAACC,MAAM,CAAC,IAAI,CAACO,OAAO,EAAE;MAC1BC,UAAU,EAAVA;IACF,CAAC,CAAC;EACJ;AACF;AAACC,OAAA,CAAArB,OAAA,GAAAG,UAAA","ignoreList":[]}
+{"version":3,"file":"Researcher.js","names":["languageProcessing","AbstractResearcher","transitionWords","twoPartTransitionWords","sentenceLength","getStemmer","Researcher","constructor","paper","defaultResearches","getFleschReadingScore","getPassiveVoiceResult","getSentenceBeginnings","functionWordsInKeyphrase","Object","assign","config","language","functionWords","helpers"],"sources":["../../../../src/languageProcessing/languages/ca/Researcher.js"],"sourcesContent":["import {languageProcessing} from '@axyseo/index.js';\nconst {AbstractResearcher} = languageProcessing;\n\n// All config\nimport transitionWords from './config/transitionWords';\nimport twoPartTransitionWords from './config/twoPartTransitionWords';\nimport sentenceLength from './config/sentenceLength';\n\n// All helpers\nimport getStemmer from './helpers/getStemmer';\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    // Deletes researches that are currently not available in Catalan.\n    // When the research is available, this line should be removed.\n    delete this.defaultResearches.getFleschReadingScore;\n    delete this.defaultResearches.getPassiveVoiceResult;\n    delete this.defaultResearches.getSentenceBeginnings;\n    delete this.defaultResearches.functionWordsInKeyphrase;\n\n    Object.assign(this.config, {\n      language: 'ca',\n      functionWords: [],\n      transitionWords,\n      twoPartTransitionWords,\n      sentenceLength\n    });\n\n    Object.assign(this.helpers, {\n      getStemmer\n    });\n  }\n}\n"],"mappings":"AAAA,SAAQA,kBAAkB;AAC1B,MAAM;EAACC;AAAkB,CAAC,GAAGD,kBAAkB;;AAE/C;AACA,OAAOE,eAAe;AACtB,OAAOC,sBAAsB;AAC7B,OAAOC,cAAc;;AAErB;AACA,OAAOC,UAAU;;AAEjB;AACA;AACA;AACA,eAAe,MAAMC,UAAU,SAASL,kBAAkB,CAAC;EACzD;AACF;AACA;AACA;AACA;EACEM,WAAWA,CAACC,KAAK,EAAE;IACjB,KAAK,CAACA,KAAK,CAAC;;IAEZ;IACA;IACA,OAAO,IAAI,CAACC,iBAAiB,CAACC,qBAAqB;IACnD,OAAO,IAAI,CAACD,iBAAiB,CAACE,qBAAqB;IACnD,OAAO,IAAI,CAACF,iBAAiB,CAACG,qBAAqB;IACnD,OAAO,IAAI,CAACH,iBAAiB,CAACI,wBAAwB;IAEtDC,MAAM,CAACC,MAAM,CAAC,IAAI,CAACC,MAAM,EAAE;MACzBC,QAAQ,EAAE,IAAI;MACdC,aAAa,EAAE,EAAE;MACjBhB,eAAe;MACfC,sBAAsB;MACtBC;IACF,CAAC,CAAC;IAEFU,MAAM,CAACC,MAAM,CAAC,IAAI,CAACI,OAAO,EAAE;MAC1Bd;IACF,CAAC,CAAC;EACJ;AACF","ignoreList":[]}

package/build/languageProcessing/languages/ca/config/sentenceLength.js

@@ -1,10 +1,4 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
-var _default = exports.default = {
+export default {
   recommendedLength: 25
 };
 //# sourceMappingURL=sentenceLength.js.map

package/build/languageProcessing/languages/ca/config/sentenceLength.js.map

@@ -1 +1 @@
-{"version":3,"file":"sentenceLength.js","names":["recommendedLength"],"sources":["../../../../../src/languageProcessing/languages/ca/config/sentenceLength.js"],"sourcesContent":["export default {\n\trecommendedLength: 25,\n};\n"],"mappings":";;;;;;iCAAe;EACdA,iBAAiB,EAAE;AACpB,CAAC","ignoreList":[]}
+{"version":3,"file":"sentenceLength.js","names":["recommendedLength"],"sources":["../../../../../src/languageProcessing/languages/ca/config/sentenceLength.js"],"sourcesContent":["export default {\n\trecommendedLength: 25,\n};\n"],"mappings":"AAAA,eAAe;EACdA,iBAAiB,EAAE;AACpB,CAAC","ignoreList":[]}

package/build/languageProcessing/languages/ca/config/transitionWords.js

@@ -1,13 +1,7 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.singleWords = exports.multipleWords = exports.default = exports.allWords = void 0;
 /** @module config/transitionWords */
 
-const singleWords = exports.singleWords = ["abans", "així", "alhora", "aleshores", "altrament", "anteriorment", "breument", "bàsicament", "contràriament", "després", "doncs", "efectivament", "endemés", "especialment", "evidentment", "finalment", "fins a", "fins que", "generalment", "igualment", "malgrat", "mentre", "mentrestant", "parallelament", "paral·lelament", "però", "perquè", "quan", "primerament", "resumidament", "resumint", "segurament", "segons això", "sens dubte", "sinó", "sobretot", "també", "tanmateix"];
-const multipleWords = exports.multipleWords = ["a banda d'això", "a continuació", "a diferència de", "a fi de", "a fi que", "a força de", "a manera de resum", "a més", "a partir d'aquí", "a partir d'ara", "a tall d'exemple", "a tall de recapitulació", "a tall de resum", "al capdavall", "al contrari", "al mateix temps", "amb relació a", "tot plegat", "ara bé", "atès que", "com a conseqüència", "com a exemple", "com a resultat", "com a resum", "com que", "comptat i debatut", "considerant que", "convé destacar", "convé recalcar", "convé ressaltar que", "d'altra banda", "d’una banda", "d’una forma breu", "de la mateixa manera", "de manera parallela", "de manera paral·lela", "de manera que", "de tota manera", "degut a", "deixant de banda", "dit d'una altra manera", "donat que", "en a resum", "en lloc de", "en altres paraules", "en aquest sentit", "en canvi", "en conclusió", "en conjunt", "en conseqüència", "encara que", "en darrer lloc", "en darrer terme", "en definitiva", "en efecte", "en general", "en particular", "en pocs mots", "en poques paraules", "en primer lloc", "en relació amb", "en resum", "en segon lloc", "en síntesi", "en suma", "en tercer lloc", "en últim terme", "és a dir", "és més", "és per això que", "fins i tot", "gràcies a", "gràcies de", "igual com", "igual que", "ja que", "llevat que", "més aviat", "més tard", "més endavant", "no obstant", "o sia", "o sigui", "òbviament", "pel fet que", "pel general", "pel que", "per acabar", "per això", "per altra banda", "per aquest motiu", "per causa de", "per causa que", "per cert", "per començar", "per concloure", "per concretar", "per contra", "per exemple", "per illustrar", "per il·lustrar", "per l'altra part", "per l'altre cantó", "per la qual cosa", "per mitjà de", "per posar un exemple", "per raó de", "per raó que", "per tal de", "per tal que", "per tant", "per últim", "per un cantó", "per un costat", "per una altra banda", "per una part", "quant a", "recapitulant", "respecte de", "s'ha de tenir en compte que", "sempre que", "tal com s’ha dit", "tan bon punt", "tan aviat com", "tenint en compte que", "tot i", "tot seguit", "val a dir", "val la pena dir que", "vist que"];
-const allWords = exports.allWords = singleWords.concat(multipleWords);
-var _default = exports.default = allWords;
+export const singleWords = ["abans", "així", "alhora", "aleshores", "altrament", "anteriorment", "breument", "bàsicament", "contràriament", "després", "doncs", "efectivament", "endemés", "especialment", "evidentment", "finalment", "fins a", "fins que", "generalment", "igualment", "malgrat", "mentre", "mentrestant", "parallelament", "paral·lelament", "però", "perquè", "quan", "primerament", "resumidament", "resumint", "segurament", "segons això", "sens dubte", "sinó", "sobretot", "també", "tanmateix"];
+export const multipleWords = ["a banda d'això", "a continuació", "a diferència de", "a fi de", "a fi que", "a força de", "a manera de resum", "a més", "a partir d'aquí", "a partir d'ara", "a tall d'exemple", "a tall de recapitulació", "a tall de resum", "al capdavall", "al contrari", "al mateix temps", "amb relació a", "tot plegat", "ara bé", "atès que", "com a conseqüència", "com a exemple", "com a resultat", "com a resum", "com que", "comptat i debatut", "considerant que", "convé destacar", "convé recalcar", "convé ressaltar que", "d'altra banda", "d’una banda", "d’una forma breu", "de la mateixa manera", "de manera parallela", "de manera paral·lela", "de manera que", "de tota manera", "degut a", "deixant de banda", "dit d'una altra manera", "donat que", "en a resum", "en lloc de", "en altres paraules", "en aquest sentit", "en canvi", "en conclusió", "en conjunt", "en conseqüència", "encara que", "en darrer lloc", "en darrer terme", "en definitiva", "en efecte", "en general", "en particular", "en pocs mots", "en poques paraules", "en primer lloc", "en relació amb", "en resum", "en segon lloc", "en síntesi", "en suma", "en tercer lloc", "en últim terme", "és a dir", "és més", "és per això que", "fins i tot", "gràcies a", "gràcies de", "igual com", "igual que", "ja que", "llevat que", "més aviat", "més tard", "més endavant", "no obstant", "o sia", "o sigui", "òbviament", "pel fet que", "pel general", "pel que", "per acabar", "per això", "per altra banda", "per aquest motiu", "per causa de", "per causa que", "per cert", "per començar", "per concloure", "per concretar", "per contra", "per exemple", "per illustrar", "per il·lustrar", "per l'altra part", "per l'altre cantó", "per la qual cosa", "per mitjà de", "per posar un exemple", "per raó de", "per raó que", "per tal de", "per tal que", "per tant", "per últim", "per un cantó", "per un costat", "per una altra banda", "per una part", "quant a", "recapitulant", "respecte de", "s'ha de tenir en compte que", "sempre que", "tal com s’ha dit", "tan bon punt", "tan aviat com", "tenint en compte que", "tot i", "tot seguit", "val a dir", "val la pena dir que", "vist que"];
+export const allWords = singleWords.concat(multipleWords);
+export default allWords;
 //# sourceMappingURL=transitionWords.js.map

package/build/languageProcessing/languages/ca/config/transitionWords.js.map

@@ -1 +1 @@
-{"version":3,"file":"transitionWords.js","names":["singleWords","exports","multipleWords","allWords","concat","_default","default"],"sources":["../../../../../src/languageProcessing/languages/ca/config/transitionWords.js"],"sourcesContent":["/** @module config/transitionWords */\n\nexport const singleWords = [ \"abans\", \"així\", \"alhora\", \"aleshores\", \"altrament\", \"anteriorment\", \"breument\", \"bàsicament\",\n\t\"contràriament\", \"després\", \"doncs\", \"efectivament\", \"endemés\", \"especialment\", \"evidentment\", \"finalment\", \"fins a\",\n\t\"fins que\", \"generalment\", \"igualment\", \"malgrat\", \"mentre\", \"mentrestant\", \"parallelament\", \"paral·lelament\", \"però\",\n\t\"perquè\", \"quan\", \"primerament\", \"resumidament\", \"resumint\", \"segurament\", \"segons això\", \"sens dubte\", \"sinó\",\n\t\"sobretot\", \"també\", \"tanmateix\" ];\n\nexport const multipleWords = [ \"a banda d'això\", \"a continuació\", \"a diferència de\", \"a fi de\", \"a fi que\", \"a força de\",\n\t\"a manera de resum\", \"a més\", \"a partir d'aquí\", \"a partir d'ara\",\n\t\"a tall d'exemple\", \"a tall de recapitulació\", \"a tall de resum\", \"al capdavall\", \"al contrari\", \"al mateix temps\",\n\t\"amb relació a\", \"tot plegat\", \"ara bé\", \"atès que\", \"com a conseqüència\", \"com a exemple\", \"com a resultat\",\n\t\"com a resum\", \"com que\", \"comptat i debatut\", \"considerant que\", \"convé destacar\", \"convé recalcar\",\n\t\"convé ressaltar que\", \"d'altra banda\", \"d’una banda\", \"d’una forma breu\", \"de la mateixa manera\", \"de manera parallela\",\n\t\"de manera paral·lela\", \"de manera que\", \"de tota manera\", \"degut a\", \"deixant de banda\", \"dit d'una altra manera\",\n\t\"donat que\", \"en a resum\", \"en lloc de\", \"en altres paraules\", \"en aquest sentit\", \"en canvi\", \"en conclusió\", \"en conjunt\",\n\t\"en conseqüència\", \"encara que\", \"en darrer lloc\", \"en darrer terme\", \"en definitiva\", \"en efecte\", \"en general\",\n\t\"en particular\", \"en pocs mots\", \"en poques paraules\", \"en primer lloc\", \"en relació amb\", \"en resum\", \"en segon lloc\",\n\t\"en síntesi\", \"en suma\", \"en tercer lloc\", \"en últim terme\", \"és a dir\", \"és més\", \"és per això que\", \"fins i tot\",\n\t\"gràcies a\", \"gràcies de\", \"igual com\", \"igual que\", \"ja que\", \"llevat que\", \"més aviat\", \"més tard\", \"més endavant\",\n\t\"no obstant\", \"o sia\", \"o sigui\", \"òbviament\", \"pel fet que\", \"pel general\", \"pel que\", \"per acabar\", \"per això\",\n\t\"per altra banda\", \"per aquest motiu\", \"per causa de\", \"per causa que\", \"per cert\", \"per començar\", \"per concloure\",\n\t\"per concretar\", \"per contra\", \"per exemple\", \"per illustrar\", \"per il·lustrar\", \"per l'altra part\", \"per l'altre cantó\",\n\t\"per la qual cosa\", \"per mitjà de\", \"per posar un exemple\", \"per raó de\", \"per raó que\", \"per tal de\", \"per tal que\", \"per tant\",\n\t\"per últim\", \"per un cantó\", \"per un costat\", \"per una altra banda\", \"per una part\", \"quant a\", \"recapitulant\",\n\t\"respecte de\", \"s'ha de tenir en compte que\", \"sempre que\", \"tal com s’ha dit\", \"tan bon punt\", \"tan aviat com\",\n\t\"tenint en compte que\", \"tot i\", \"tot seguit\", \"val a dir\", \"val la pena dir que\", \"vist que\" ];\n\nexport const allWords = singleWords.concat( multipleWords );\n\nexport default allWords;\n"],"mappings":";;;;;;AAAA;;AAEO,MAAMA,WAAW,GAAAC,OAAA,CAAAD,WAAA,GAAG,CAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EACzH,eAAe,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,cAAc,EAAE,aAAa,EAAE,WAAW,EAAE,QAAQ,EACpH,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,aAAa,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,EACrH,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,EAC9G,UAAU,EAAE,OAAO,EAAE,WAAW,CAAE;AAE5B,MAAME,aAAa,GAAAD,OAAA,CAAAC,aAAA,GAAG,CAAE,gBAAgB,EAAE,eAAe,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY,EACvH,mBAAmB,EAAE,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EACjE,kBAAkB,EAAE,yBAAyB,EAAE,iBAAiB,EAAE,cAAc,EAAE,aAAa,EAAE,iBAAiB,EAClH,eAAe,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,oBAAoB,EAAE,eAAe,EAAE,gBAAgB,EAC5G,aAAa,EAAE,SAAS,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,gBAAgB,EACpG,qBAAqB,EAAE,eAAe,EAAE,aAAa,EAAE,kBAAkB,EAAE,sBAAsB,EAAE,qBAAqB,EACxH,sBAAsB,EAAE,eAAe,EAAE,gBAAgB,EAAE,SAAS,EAAE,kBAAkB,EAAE,wBAAwB,EAClH,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,UAAU,EAAE,cAAc,EAAE,YAAY,EAC3H,iBAAiB,EAAE,YAAY,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,eAAe,EAAE,WAAW,EAAE,YAAY,EAChH,eAAe,EAAE,cAAc,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,UAAU,EAAE,eAAe,EACtH,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ,EAAE,iBAAiB,EAAE,YAAY,EAClH,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,cAAc,EACpH,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,EAChH,iBAAiB,EAAE,kBAAkB,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,EAAE,cAAc,EAAE,eAAe,EACnH,eAAe,EAAE,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,mBAAmB,EACxH,kBAAkB,EAAE,cAAc,EAAE,sBAAsB,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAChI,WAAW,EAAE,cAAc,EAAE,eAAe,EAAE,qBAAqB,EAAE,cAAc,EAAE,SAAS,EAAE,cAAc,EAC9G,aAAa,EAAE,6BAA6B,EAAE,YAAY,EAAE,kBAAkB,EAAE,cAAc,EAAE,eAAe,EAC/G,sBAAsB,EAAE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,qBAAqB,EAAE,UAAU,CAAE;AAEzF,MAAMC,QAAQ,GAAAF,OAAA,CAAAE,QAAA,GAAGH,WAAW,CAACI,MAAM,CAAEF,aAAc,CAAC;AAAC,IAAAG,QAAA,GAAAJ,OAAA,CAAAK,OAAA,GAE7CH,QAAQ","ignoreList":[]}
+{"version":3,"file":"transitionWords.js","names":["singleWords","multipleWords","allWords","concat"],"sources":["../../../../../src/languageProcessing/languages/ca/config/transitionWords.js"],"sourcesContent":["/** @module config/transitionWords */\n\nexport const singleWords = [ \"abans\", \"així\", \"alhora\", \"aleshores\", \"altrament\", \"anteriorment\", \"breument\", \"bàsicament\",\n\t\"contràriament\", \"després\", \"doncs\", \"efectivament\", \"endemés\", \"especialment\", \"evidentment\", \"finalment\", \"fins a\",\n\t\"fins que\", \"generalment\", \"igualment\", \"malgrat\", \"mentre\", \"mentrestant\", \"parallelament\", \"paral·lelament\", \"però\",\n\t\"perquè\", \"quan\", \"primerament\", \"resumidament\", \"resumint\", \"segurament\", \"segons això\", \"sens dubte\", \"sinó\",\n\t\"sobretot\", \"també\", \"tanmateix\" ];\n\nexport const multipleWords = [ \"a banda d'això\", \"a continuació\", \"a diferència de\", \"a fi de\", \"a fi que\", \"a força de\",\n\t\"a manera de resum\", \"a més\", \"a partir d'aquí\", \"a partir d'ara\",\n\t\"a tall d'exemple\", \"a tall de recapitulació\", \"a tall de resum\", \"al capdavall\", \"al contrari\", \"al mateix temps\",\n\t\"amb relació a\", \"tot plegat\", \"ara bé\", \"atès que\", \"com a conseqüència\", \"com a exemple\", \"com a resultat\",\n\t\"com a resum\", \"com que\", \"comptat i debatut\", \"considerant que\", \"convé destacar\", \"convé recalcar\",\n\t\"convé ressaltar que\", \"d'altra banda\", \"d’una banda\", \"d’una forma breu\", \"de la mateixa manera\", \"de manera parallela\",\n\t\"de manera paral·lela\", \"de manera que\", \"de tota manera\", \"degut a\", \"deixant de banda\", \"dit d'una altra manera\",\n\t\"donat que\", \"en a resum\", \"en lloc de\", \"en altres paraules\", \"en aquest sentit\", \"en canvi\", \"en conclusió\", \"en conjunt\",\n\t\"en conseqüència\", \"encara que\", \"en darrer lloc\", \"en darrer terme\", \"en definitiva\", \"en efecte\", \"en general\",\n\t\"en particular\", \"en pocs mots\", \"en poques paraules\", \"en primer lloc\", \"en relació amb\", \"en resum\", \"en segon lloc\",\n\t\"en síntesi\", \"en suma\", \"en tercer lloc\", \"en últim terme\", \"és a dir\", \"és més\", \"és per això que\", \"fins i tot\",\n\t\"gràcies a\", \"gràcies de\", \"igual com\", \"igual que\", \"ja que\", \"llevat que\", \"més aviat\", \"més tard\", \"més endavant\",\n\t\"no obstant\", \"o sia\", \"o sigui\", \"òbviament\", \"pel fet que\", \"pel general\", \"pel que\", \"per acabar\", \"per això\",\n\t\"per altra banda\", \"per aquest motiu\", \"per causa de\", \"per causa que\", \"per cert\", \"per començar\", \"per concloure\",\n\t\"per concretar\", \"per contra\", \"per exemple\", \"per illustrar\", \"per il·lustrar\", \"per l'altra part\", \"per l'altre cantó\",\n\t\"per la qual cosa\", \"per mitjà de\", \"per posar un exemple\", \"per raó de\", \"per raó que\", \"per tal de\", \"per tal que\", \"per tant\",\n\t\"per últim\", \"per un cantó\", \"per un costat\", \"per una altra banda\", \"per una part\", \"quant a\", \"recapitulant\",\n\t\"respecte de\", \"s'ha de tenir en compte que\", \"sempre que\", \"tal com s’ha dit\", \"tan bon punt\", \"tan aviat com\",\n\t\"tenint en compte que\", \"tot i\", \"tot seguit\", \"val a dir\", \"val la pena dir que\", \"vist que\" ];\n\nexport const allWords = singleWords.concat( multipleWords );\n\nexport default allWords;\n"],"mappings":"AAAA;;AAEA,OAAO,MAAMA,WAAW,GAAG,CAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EACzH,eAAe,EAAE,SAAS,EAAE,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,cAAc,EAAE,aAAa,EAAE,WAAW,EAAE,QAAQ,EACpH,UAAU,EAAE,aAAa,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,aAAa,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,EACrH,QAAQ,EAAE,MAAM,EAAE,aAAa,EAAE,cAAc,EAAE,UAAU,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,EAC9G,UAAU,EAAE,OAAO,EAAE,WAAW,CAAE;AAEnC,OAAO,MAAMC,aAAa,GAAG,CAAE,gBAAgB,EAAE,eAAe,EAAE,iBAAiB,EAAE,SAAS,EAAE,UAAU,EAAE,YAAY,EACvH,mBAAmB,EAAE,OAAO,EAAE,iBAAiB,EAAE,gBAAgB,EACjE,kBAAkB,EAAE,yBAAyB,EAAE,iBAAiB,EAAE,cAAc,EAAE,aAAa,EAAE,iBAAiB,EAClH,eAAe,EAAE,YAAY,EAAE,QAAQ,EAAE,UAAU,EAAE,oBAAoB,EAAE,eAAe,EAAE,gBAAgB,EAC5G,aAAa,EAAE,SAAS,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,gBAAgB,EACpG,qBAAqB,EAAE,eAAe,EAAE,aAAa,EAAE,kBAAkB,EAAE,sBAAsB,EAAE,qBAAqB,EACxH,sBAAsB,EAAE,eAAe,EAAE,gBAAgB,EAAE,SAAS,EAAE,kBAAkB,EAAE,wBAAwB,EAClH,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE,oBAAoB,EAAE,kBAAkB,EAAE,UAAU,EAAE,cAAc,EAAE,YAAY,EAC3H,iBAAiB,EAAE,YAAY,EAAE,gBAAgB,EAAE,iBAAiB,EAAE,eAAe,EAAE,WAAW,EAAE,YAAY,EAChH,eAAe,EAAE,cAAc,EAAE,oBAAoB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,UAAU,EAAE,eAAe,EACtH,YAAY,EAAE,SAAS,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,UAAU,EAAE,QAAQ,EAAE,iBAAiB,EAAE,YAAY,EAClH,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,cAAc,EACpH,YAAY,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,EAChH,iBAAiB,EAAE,kBAAkB,EAAE,cAAc,EAAE,eAAe,EAAE,UAAU,EAAE,cAAc,EAAE,eAAe,EACnH,eAAe,EAAE,YAAY,EAAE,aAAa,EAAE,eAAe,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,mBAAmB,EACxH,kBAAkB,EAAE,cAAc,EAAE,sBAAsB,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAChI,WAAW,EAAE,cAAc,EAAE,eAAe,EAAE,qBAAqB,EAAE,cAAc,EAAE,SAAS,EAAE,cAAc,EAC9G,aAAa,EAAE,6BAA6B,EAAE,YAAY,EAAE,kBAAkB,EAAE,cAAc,EAAE,eAAe,EAC/G,sBAAsB,EAAE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,qBAAqB,EAAE,UAAU,CAAE;AAEhG,OAAO,MAAMC,QAAQ,GAAGF,WAAW,CAACG,MAAM,CAAEF,aAAc,CAAC;AAE3D,eAAeC,QAAQ","ignoreList":[]}

package/build/languageProcessing/languages/ca/config/twoPartTransitionWords.js

@@ -1,13 +1,8 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
 /** @module config/twoPartTransitionWords */
+
 /**
  * Returns an array with two-part transition words to be used by the assessments.
  * @returns {Array} The array filled with two-part transition words.
  */
-var _default = exports.default = [["ara", "ara"], ["ni", "ni"]];
+export default [["ara", "ara"], ["ni", "ni"]];
 //# sourceMappingURL=twoPartTransitionWords.js.map

package/build/languageProcessing/languages/ca/config/twoPartTransitionWords.js.map

@@ -1 +1 @@
-{"version":3,"file":"twoPartTransitionWords.js","names":["_default","exports","default"],"sources":["../../../../../src/languageProcessing/languages/ca/config/twoPartTransitionWords.js"],"sourcesContent":["/** @module config/twoPartTransitionWords */\n\n/**\n * Returns an array with two-part transition words to be used by the assessments.\n * @returns {Array} The array filled with two-part transition words.\n */\nexport default [ [ \"ara\", \"ara\" ], [ \"ni\", \"ni\" ] ];\n"],"mappings":";;;;;;AAAA;AAEA;AACA;AACA;AACA;AAHA,IAAAA,QAAA,GAAAC,OAAA,CAAAC,OAAA,GAIe,CAAE,CAAE,KAAK,EAAE,KAAK,CAAE,EAAE,CAAE,IAAI,EAAE,IAAI,CAAE,CAAE","ignoreList":[]}
+{"version":3,"file":"twoPartTransitionWords.js","names":[],"sources":["../../../../../src/languageProcessing/languages/ca/config/twoPartTransitionWords.js"],"sourcesContent":["/** @module config/twoPartTransitionWords */\n\n/**\n * Returns an array with two-part transition words to be used by the assessments.\n * @returns {Array} The array filled with two-part transition words.\n */\nexport default [ [ \"ara\", \"ara\" ], [ \"ni\", \"ni\" ] ];\n"],"mappings":"AAAA;;AAEA;AACA;AACA;AACA;AACA,eAAe,CAAE,CAAE,KAAK,EAAE,KAAK,CAAE,EAAE,CAAE,IAAI,EAAE,IAAI,CAAE,CAAE","ignoreList":[]}

package/build/languageProcessing/languages/ca/helpers/getStemmer.js

@@ -1,20 +1,14 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = getStemmer;
-var _index = require("../../../index");
+import { languageProcessing } from "../../../../index.js";
 const {
   baseStemmer
-} = _index.languageProcessing;
+} = languageProcessing;
 
 /**
  * Returns the stemmer for a researcher.
  *
  * @returns {Function} The stemmer.
  */
-function getStemmer() {
+export default function getStemmer() {
   return baseStemmer;
 }
 //# sourceMappingURL=getStemmer.js.map

package/build/languageProcessing/languages/ca/helpers/getStemmer.js.map

@@ -1 +1 @@
-{"version":3,"file":"getStemmer.js","names":["_index","require","baseStemmer","languageProcessing","getStemmer"],"sources":["../../../../../src/languageProcessing/languages/ca/helpers/getStemmer.js"],"sourcesContent":["import {languageProcessing} from '../../../index';\nconst {baseStemmer} = languageProcessing;\n\n/**\n * Returns the stemmer for a researcher.\n *\n * @returns {Function} The stemmer.\n */\nexport default function getStemmer() {\n  return baseStemmer;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AACA,MAAM;EAACC;AAAW,CAAC,GAAGC,yBAAkB;;AAExC;AACA;AACA;AACA;AACA;AACe,SAASC,UAAUA,CAAA,EAAG;EACnC,OAAOF,WAAW;AACpB","ignoreList":[]}
+{"version":3,"file":"getStemmer.js","names":["languageProcessing","baseStemmer","getStemmer"],"sources":["../../../../../src/languageProcessing/languages/ca/helpers/getStemmer.js"],"sourcesContent":["import {languageProcessing} from '@axyseo/index.js';\nconst {baseStemmer} = languageProcessing;\n\n/**\n * Returns the stemmer for a researcher.\n *\n * @returns {Function} The stemmer.\n */\nexport default function getStemmer() {\n  return baseStemmer;\n}\n"],"mappings":"AAAA,SAAQA,kBAAkB;AAC1B,MAAM;EAACC;AAAW,CAAC,GAAGD,kBAAkB;;AAExC;AACA;AACA;AACA;AACA;AACA,eAAe,SAASE,UAAUA,CAAA,EAAG;EACnC,OAAOD,WAAW;AACpB","ignoreList":[]}

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

@@ -1,30 +1,23 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
-var _index = require("../../../index");
-var _firstWordExceptions = _interopRequireDefault(require("./config/firstWordExceptions"));
-var _stopWords = _interopRequireDefault(require("./config/stopWords"));
-var _functionWords = require("./config/functionWords");
-var _transitionWords = _interopRequireDefault(require("./config/transitionWords"));
-var _twoPartTransitionWords = _interopRequireDefault(require("./config/twoPartTransitionWords"));
-var _getClauses = _interopRequireDefault(require("./helpers/getClauses"));
-var _getStemmer = _interopRequireDefault(require("./helpers/getStemmer"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+import { languageProcessing } from "../../../index.js";
 const {
   AbstractResearcher
-} = _index.languageProcessing;
+} = languageProcessing;
 
 // All config
+import firstWordExceptions from "./config/firstWordExceptions";
+import stopWords from "./config/stopWords";
+import { all as functionWords } from "./config/functionWords";
+import transitionWords from "./config/transitionWords";
+import twoPartTransitionWords from "./config/twoPartTransitionWords";
 
 // All helpers
+import getClauses from "./helpers/getClauses";
+import getStemmer from "./helpers/getStemmer";
 
 /**
  * The researcher contains all the researches, helpers, data, and config.
  */
-class Researcher extends AbstractResearcher {
+export default class Researcher extends AbstractResearcher {
   /**
    * Constructor
    * @param {Paper} paper The Paper object that is needed within the researches.
@@ -36,17 +29,16 @@ class Researcher extends AbstractResearcher {
     Object.assign(this.config, {
       language: 'cs',
       passiveConstructionType: 'periphrastic',
-      firstWordExceptions: _firstWordExceptions.default,
-      stopWords: _stopWords.default,
-      functionWords: _functionWords.all,
-      transitionWords: _transitionWords.default,
-      twoPartTransitionWords: _twoPartTransitionWords.default
+      firstWordExceptions,
+      stopWords,
+      functionWords,
+      transitionWords,
+      twoPartTransitionWords
     });
     Object.assign(this.helpers, {
-      getClauses: _getClauses.default,
-      getStemmer: _getStemmer.default
+      getClauses,
+      getStemmer
     });
   }
 }
-exports.default = Researcher;
 //# sourceMappingURL=Researcher.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"Researcher.js","names":["_index","require","_firstWordExceptions","_interopRequireDefault","_stopWords","_functionWords","_transitionWords","_twoPartTransitionWords","_getClauses","_getStemmer","e","__esModule","default","AbstractResearcher","languageProcessing","Researcher","constructor","paper","defaultResearches","getFleschReadingScore","Object","assign","config","language","passiveConstructionType","firstWordExceptions","stopWords","functionWords","transitionWords","twoPartTransitionWords","helpers","getClauses","getStemmer","exports"],"sources":["../../../../src/languageProcessing/languages/cs/Researcher.js"],"sourcesContent":["import {languageProcessing} from '../../../index';\nconst {AbstractResearcher} = languageProcessing;\n\n// All config\nimport firstWordExceptions from './config/firstWordExceptions';\nimport stopWords from './config/stopWords';\nimport {all as functionWords} from './config/functionWords';\nimport transitionWords from './config/transitionWords';\nimport twoPartTransitionWords from './config/twoPartTransitionWords';\n\n// All helpers\nimport getClauses from './helpers/getClauses';\nimport getStemmer from './helpers/getStemmer';\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 this.defaultResearches.getFleschReadingScore;\n\n    Object.assign(this.config, {\n      language: 'cs',\n      passiveConstructionType: 'periphrastic',\n      firstWordExceptions,\n      stopWords,\n      functionWords,\n      transitionWords,\n      twoPartTransitionWords\n    });\n\n    Object.assign(this.helpers, {\n      getClauses,\n      getStemmer\n    });\n  }\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAIA,IAAAC,oBAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,UAAA,GAAAD,sBAAA,CAAAF,OAAA;AACA,IAAAI,cAAA,GAAAJ,OAAA;AACA,IAAAK,gBAAA,GAAAH,sBAAA,CAAAF,OAAA;AACA,IAAAM,uBAAA,GAAAJ,sBAAA,CAAAF,OAAA;AAGA,IAAAO,WAAA,GAAAL,sBAAA,CAAAF,OAAA;AACA,IAAAQ,WAAA,GAAAN,sBAAA,CAAAF,OAAA;AAA8C,SAAAE,uBAAAO,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAX9C,MAAM;EAACG;AAAkB,CAAC,GAAGC,yBAAkB;;AAE/C;;AAOA;;AAIA;AACA;AACA;AACe,MAAMC,UAAU,SAASF,kBAAkB,CAAC;EACzD;AACF;AACA;AACA;AACA;EACEG,WAAWA,CAACC,KAAK,EAAE;IACjB,KAAK,CAACA,KAAK,CAAC;IAEZ,OAAO,IAAI,CAACC,iBAAiB,CAACC,qBAAqB;IAEnDC,MAAM,CAACC,MAAM,CAAC,IAAI,CAACC,MAAM,EAAE;MACzBC,QAAQ,EAAE,IAAI;MACdC,uBAAuB,EAAE,cAAc;MACvCC,mBAAmB,EAAnBA,4BAAmB;MACnBC,SAAS,EAATA,kBAAS;MACTC,aAAa,EAAbA,kBAAa;MACbC,eAAe,EAAfA,wBAAe;MACfC,sBAAsB,EAAtBA;IACF,CAAC,CAAC;IAEFT,MAAM,CAACC,MAAM,CAAC,IAAI,CAACS,OAAO,EAAE;MAC1BC,UAAU,EAAVA,mBAAU;MACVC,UAAU,EAAVA;IACF,CAAC,CAAC;EACJ;AACF;AAACC,OAAA,CAAArB,OAAA,GAAAG,UAAA","ignoreList":[]}
+{"version":3,"file":"Researcher.js","names":["languageProcessing","AbstractResearcher","firstWordExceptions","stopWords","all","functionWords","transitionWords","twoPartTransitionWords","getClauses","getStemmer","Researcher","constructor","paper","defaultResearches","getFleschReadingScore","Object","assign","config","language","passiveConstructionType","helpers"],"sources":["../../../../src/languageProcessing/languages/cs/Researcher.js"],"sourcesContent":["import {languageProcessing} from '@axyseo/index.js';\nconst {AbstractResearcher} = languageProcessing;\n\n// All config\nimport firstWordExceptions from './config/firstWordExceptions';\nimport stopWords from './config/stopWords';\nimport {all as functionWords} from './config/functionWords';\nimport transitionWords from './config/transitionWords';\nimport twoPartTransitionWords from './config/twoPartTransitionWords';\n\n// All helpers\nimport getClauses from './helpers/getClauses';\nimport getStemmer from './helpers/getStemmer';\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 this.defaultResearches.getFleschReadingScore;\n\n    Object.assign(this.config, {\n      language: 'cs',\n      passiveConstructionType: 'periphrastic',\n      firstWordExceptions,\n      stopWords,\n      functionWords,\n      transitionWords,\n      twoPartTransitionWords\n    });\n\n    Object.assign(this.helpers, {\n      getClauses,\n      getStemmer\n    });\n  }\n}\n"],"mappings":"AAAA,SAAQA,kBAAkB;AAC1B,MAAM;EAACC;AAAkB,CAAC,GAAGD,kBAAkB;;AAE/C;AACA,OAAOE,mBAAmB;AAC1B,OAAOC,SAAS;AAChB,SAAQC,GAAG,IAAIC,aAAa;AAC5B,OAAOC,eAAe;AACtB,OAAOC,sBAAsB;;AAE7B;AACA,OAAOC,UAAU;AACjB,OAAOC,UAAU;;AAEjB;AACA;AACA;AACA,eAAe,MAAMC,UAAU,SAAST,kBAAkB,CAAC;EACzD;AACF;AACA;AACA;AACA;EACEU,WAAWA,CAACC,KAAK,EAAE;IACjB,KAAK,CAACA,KAAK,CAAC;IAEZ,OAAO,IAAI,CAACC,iBAAiB,CAACC,qBAAqB;IAEnDC,MAAM,CAACC,MAAM,CAAC,IAAI,CAACC,MAAM,EAAE;MACzBC,QAAQ,EAAE,IAAI;MACdC,uBAAuB,EAAE,cAAc;MACvCjB,mBAAmB;MACnBC,SAAS;MACTE,aAAa;MACbC,eAAe;MACfC;IACF,CAAC,CAAC;IAEFQ,MAAM,CAACC,MAAM,CAAC,IAAI,CAACI,OAAO,EAAE;MAC1BZ,UAAU;MACVC;IACF,CAAC,CAAC;EACJ;AACF","ignoreList":[]}

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

@@ -1,14 +1,8 @@
-"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 = [
+export default [
 // Definite articles:
 "ten",
 // Numbers 0-10, 100, 1000: