axyseo 2.0.0-alpha.2 → 2.1.0

package/build/languageProcessing/languages/de/helpers/internal/detectAndStemRegularParticiple.js.map

@@ -1 +1 @@
-{"version":3,"file":"detectAndStemRegularParticiple.js","names":["_exceptionsParticiplesActive","_interopRequireDefault","require","_passiveVoiceRegex","e","__esModule","default","detectAndStemParticiplesWithoutPrefixes","morphologyDataVerbs","word","geStemTParticipleRegex","RegExp","participleStemmingClasses","regex","geStemEtParticipleRegex","test","slice","length","detectAndStemParticiplePerPrefixClass","prefixes","regexPart","startStem","endStem","currentPrefix","participleRegex","wordWithoutPrefix","wordWithoutParticipleAffixes","detectAndStemParticiplesWithPrefixes","prefixesSeparableOrInseparable","separableOrInseparable","participleClass","separable","inseparable","stem","detectAndStemRegularParticiple","exceptions","exceptionsParticiplesActive","includes"],"sources":["../../../../../../src/languageProcessing/languages/de/helpers/internal/detectAndStemRegularParticiple.js"],"sourcesContent":["import exceptionsParticiplesActive from \"../../config/internal/exceptionsParticiplesActive\";\nimport exceptions from \"../../config/internal/passiveVoiceRegex\";\n\n/**\n * Detects whether a word is a regular participle without a prefix and if so, returns the stem.\n *\n * @param {Object}  morphologyDataVerbs The German morphology data for verbs.\n * @param {string}  word                The word (not stemmed) to check.\n *\n * @returns {string|null} The stem or null if no participle was matched.\n */\nconst detectAndStemParticiplesWithoutPrefixes = function( morphologyDataVerbs, word ) {\n\tconst geStemTParticipleRegex = new RegExp( \"^\" + morphologyDataVerbs.participleStemmingClasses[ 1 ].regex );\n\tconst geStemEtParticipleRegex = new RegExp( \"^\" + morphologyDataVerbs.participleStemmingClasses[ 0 ].regex );\n\n\t/*\n\t * Check if it's a ge + stem ending in d/t + et participle.\n\t * As this is the more specific regex, it needs to be checked before the ge + stem + t regex.\n\t */\n\tif ( geStemEtParticipleRegex.test( word ) ) {\n\t\t// Remove the two-letter prefix and the two-letter suffix.\n\t\treturn ( word.slice( 2, word.length - 2 ) );\n\t}\n\n\t// Check if it's a ge + stem + t participle.\n\tif ( geStemTParticipleRegex.test( word ) ) {\n\t\t// Remove the two-letter prefix and the one-letter suffix.\n\t\treturn ( word.slice( 2, word.length - 1 ) );\n\t}\n\n\treturn null;\n};\n\n/**\n * Determines whether a given participle pattern combined with prefixes from a given class applies to a given word\n * and if so, returns the stem.\n *\n * @param {string}      word        The word (not stemmed) to check.\n * @param {string[]}    prefixes    The prefixes of a certain prefix class.\n * @param {string}      regexPart   The regex part for a given class (completed to a full regex within the function).\n * @param {number}      startStem   Where to start cutting off the de-prefixed word.\n * @param {number}      endStem     Where to end cutting off the de-prefixed word (from the end index).\n *\n * @returns {string|null} The stem or null if no prefixed participle was matched.\n */\nconst detectAndStemParticiplePerPrefixClass = function( word, prefixes, regexPart, startStem, endStem ) {\n\tfor ( const currentPrefix of prefixes ) {\n\t\tconst participleRegex = new RegExp( \"^\" + currentPrefix + regexPart );\n\n\t\tif ( participleRegex.test( word ) ) {\n\t\t\tconst wordWithoutPrefix = word.slice( currentPrefix.length - word.length );\n\t\t\tconst wordWithoutParticipleAffixes = wordWithoutPrefix.slice( startStem, wordWithoutPrefix.length - endStem );\n\n\t\t\treturn ( currentPrefix + wordWithoutParticipleAffixes );\n\t\t}\n\t}\n\n\treturn null;\n};\n\n/**\n * Detects whether a word is a regular participle with a prefix and if so, returns the stem.\n *\n * @param {Object}  morphologyDataVerbs The German morphology data for verbs.\n * @param {string}  word                The word (not stemmed) to check.\n *\n * @returns {string|null} The stem or null if no participle with prefix was matched.\n */\nconst detectAndStemParticiplesWithPrefixes = function( morphologyDataVerbs, word ) {\n\tconst prefixesSeparableOrInseparable = morphologyDataVerbs.prefixes.separableOrInseparable;\n\n\t/*\n\t * It's important to preserve order here, since the ge + stem ending in d/t + et regex is more specific than\n\t * the ge + stem + t regex, and therefore must be checked first.\n\t */\n\tfor ( const participleClass of morphologyDataVerbs.participleStemmingClasses ) {\n\t\tconst regex = participleClass.regex;\n\t\tconst startStem = participleClass.startStem;\n\t\tconst endStem = participleClass.endStem;\n\t\tconst separable = participleClass.separable;\n\n\t\tconst prefixes = separable\n\t\t\t? morphologyDataVerbs.prefixes.separable\n\t\t\t: morphologyDataVerbs.prefixes.inseparable;\n\n\t\tlet stem = detectAndStemParticiplePerPrefixClass( word, prefixes, regex, startStem, endStem );\n\n\t\tif ( stem ) {\n\t\t\treturn stem;\n\t\t}\n\n\t\tstem = detectAndStemParticiplePerPrefixClass( word, prefixesSeparableOrInseparable, regex, startStem, endStem );\n\n\t\tif ( stem ) {\n\t\t\treturn stem;\n\t\t}\n\t}\n\n\treturn null;\n};\n\n/**\n * Detects whether a word is a regular participle and if so, returns the stem.\n *\n * @param {Object}  morphologyDataVerbs The German morphology data for verbs.\n * @param {string}  word                The word (not stemmed) to check.\n *\n * @returns {string|null} The participle stem or null if no regular participle was matched.\n */\nexport function detectAndStemRegularParticiple( morphologyDataVerbs, word ) {\n\tif ( exceptions( word ).length > 0 || exceptionsParticiplesActive.includes( word ) ) {\n\t\treturn \"\";\n\t}\n\n\tlet stem = detectAndStemParticiplesWithoutPrefixes( morphologyDataVerbs, word );\n\n\tif ( stem ) {\n\t\treturn stem;\n\t}\n\n\tstem = detectAndStemParticiplesWithPrefixes( morphologyDataVerbs, word );\n\n\tif ( stem ) {\n\t\treturn stem;\n\t}\n\n\treturn null;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,4BAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,kBAAA,GAAAF,sBAAA,CAAAC,OAAA;AAAiE,SAAAD,uBAAAG,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAEjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMG,uCAAuC,GAAG,SAAAA,CAAUC,mBAAmB,EAAEC,IAAI,EAAG;EACrF,MAAMC,sBAAsB,GAAG,IAAIC,MAAM,CAAE,GAAG,GAAGH,mBAAmB,CAACI,yBAAyB,CAAE,CAAC,CAAE,CAACC,KAAM,CAAC;EAC3G,MAAMC,uBAAuB,GAAG,IAAIH,MAAM,CAAE,GAAG,GAAGH,mBAAmB,CAACI,yBAAyB,CAAE,CAAC,CAAE,CAACC,KAAM,CAAC;;EAE5G;AACD;AACA;AACA;EACC,IAAKC,uBAAuB,CAACC,IAAI,CAAEN,IAAK,CAAC,EAAG;IAC3C;IACA,OAASA,IAAI,CAACO,KAAK,CAAE,CAAC,EAAEP,IAAI,CAACQ,MAAM,GAAG,CAAE,CAAC;EAC1C;;EAEA;EACA,IAAKP,sBAAsB,CAACK,IAAI,CAAEN,IAAK,CAAC,EAAG;IAC1C;IACA,OAASA,IAAI,CAACO,KAAK,CAAE,CAAC,EAAEP,IAAI,CAACQ,MAAM,GAAG,CAAE,CAAC;EAC1C;EAEA,OAAO,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,qCAAqC,GAAG,SAAAA,CAAUT,IAAI,EAAEU,QAAQ,EAAEC,SAAS,EAAEC,SAAS,EAAEC,OAAO,EAAG;EACvG,KAAM,MAAMC,aAAa,IAAIJ,QAAQ,EAAG;IACvC,MAAMK,eAAe,GAAG,IAAIb,MAAM,CAAE,GAAG,GAAGY,aAAa,GAAGH,SAAU,CAAC;IAErE,IAAKI,eAAe,CAACT,IAAI,CAAEN,IAAK,CAAC,EAAG;MACnC,MAAMgB,iBAAiB,GAAGhB,IAAI,CAACO,KAAK,CAAEO,aAAa,CAACN,MAAM,GAAGR,IAAI,CAACQ,MAAO,CAAC;MAC1E,MAAMS,4BAA4B,GAAGD,iBAAiB,CAACT,KAAK,CAAEK,SAAS,EAAEI,iBAAiB,CAACR,MAAM,GAAGK,OAAQ,CAAC;MAE7G,OAASC,aAAa,GAAGG,4BAA4B;IACtD;EACD;EAEA,OAAO,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,oCAAoC,GAAG,SAAAA,CAAUnB,mBAAmB,EAAEC,IAAI,EAAG;EAClF,MAAMmB,8BAA8B,GAAGpB,mBAAmB,CAACW,QAAQ,CAACU,sBAAsB;;EAE1F;AACD;AACA;AACA;EACC,KAAM,MAAMC,eAAe,IAAItB,mBAAmB,CAACI,yBAAyB,EAAG;IAC9E,MAAMC,KAAK,GAAGiB,eAAe,CAACjB,KAAK;IACnC,MAAMQ,SAAS,GAAGS,eAAe,CAACT,SAAS;IAC3C,MAAMC,OAAO,GAAGQ,eAAe,CAACR,OAAO;IACvC,MAAMS,SAAS,GAAGD,eAAe,CAACC,SAAS;IAE3C,MAAMZ,QAAQ,GAAGY,SAAS,GACvBvB,mBAAmB,CAACW,QAAQ,CAACY,SAAS,GACtCvB,mBAAmB,CAACW,QAAQ,CAACa,WAAW;IAE3C,IAAIC,IAAI,GAAGf,qCAAqC,CAAET,IAAI,EAAEU,QAAQ,EAAEN,KAAK,EAAEQ,SAAS,EAAEC,OAAQ,CAAC;IAE7F,IAAKW,IAAI,EAAG;MACX,OAAOA,IAAI;IACZ;IAEAA,IAAI,GAAGf,qCAAqC,CAAET,IAAI,EAAEmB,8BAA8B,EAAEf,KAAK,EAAEQ,SAAS,EAAEC,OAAQ,CAAC;IAE/G,IAAKW,IAAI,EAAG;MACX,OAAOA,IAAI;IACZ;EACD;EAEA,OAAO,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAASC,8BAA8BA,CAAE1B,mBAAmB,EAAEC,IAAI,EAAG;EAC3E,IAAK,IAAA0B,0BAAU,EAAE1B,IAAK,CAAC,CAACQ,MAAM,GAAG,CAAC,IAAImB,oCAA2B,CAACC,QAAQ,CAAE5B,IAAK,CAAC,EAAG;IACpF,OAAO,EAAE;EACV;EAEA,IAAIwB,IAAI,GAAG1B,uCAAuC,CAAEC,mBAAmB,EAAEC,IAAK,CAAC;EAE/E,IAAKwB,IAAI,EAAG;IACX,OAAOA,IAAI;EACZ;EAEAA,IAAI,GAAGN,oCAAoC,CAAEnB,mBAAmB,EAAEC,IAAK,CAAC;EAExE,IAAKwB,IAAI,EAAG;IACX,OAAOA,IAAI;EACZ;EAEA,OAAO,IAAI;AACZ","ignoreList":[]}
+{"version":3,"file":"detectAndStemRegularParticiple.js","names":["exceptionsParticiplesActive","exceptions","detectAndStemParticiplesWithoutPrefixes","morphologyDataVerbs","word","geStemTParticipleRegex","RegExp","participleStemmingClasses","regex","geStemEtParticipleRegex","test","slice","length","detectAndStemParticiplePerPrefixClass","prefixes","regexPart","startStem","endStem","currentPrefix","participleRegex","wordWithoutPrefix","wordWithoutParticipleAffixes","detectAndStemParticiplesWithPrefixes","prefixesSeparableOrInseparable","separableOrInseparable","participleClass","separable","inseparable","stem","detectAndStemRegularParticiple","includes"],"sources":["../../../../../../src/languageProcessing/languages/de/helpers/internal/detectAndStemRegularParticiple.js"],"sourcesContent":["import exceptionsParticiplesActive from \"../../config/internal/exceptionsParticiplesActive\";\nimport exceptions from \"../../config/internal/passiveVoiceRegex\";\n\n/**\n * Detects whether a word is a regular participle without a prefix and if so, returns the stem.\n *\n * @param {Object}  morphologyDataVerbs The German morphology data for verbs.\n * @param {string}  word                The word (not stemmed) to check.\n *\n * @returns {string|null} The stem or null if no participle was matched.\n */\nconst detectAndStemParticiplesWithoutPrefixes = function( morphologyDataVerbs, word ) {\n\tconst geStemTParticipleRegex = new RegExp( \"^\" + morphologyDataVerbs.participleStemmingClasses[ 1 ].regex );\n\tconst geStemEtParticipleRegex = new RegExp( \"^\" + morphologyDataVerbs.participleStemmingClasses[ 0 ].regex );\n\n\t/*\n\t * Check if it's a ge + stem ending in d/t + et participle.\n\t * As this is the more specific regex, it needs to be checked before the ge + stem + t regex.\n\t */\n\tif ( geStemEtParticipleRegex.test( word ) ) {\n\t\t// Remove the two-letter prefix and the two-letter suffix.\n\t\treturn ( word.slice( 2, word.length - 2 ) );\n\t}\n\n\t// Check if it's a ge + stem + t participle.\n\tif ( geStemTParticipleRegex.test( word ) ) {\n\t\t// Remove the two-letter prefix and the one-letter suffix.\n\t\treturn ( word.slice( 2, word.length - 1 ) );\n\t}\n\n\treturn null;\n};\n\n/**\n * Determines whether a given participle pattern combined with prefixes from a given class applies to a given word\n * and if so, returns the stem.\n *\n * @param {string}      word        The word (not stemmed) to check.\n * @param {string[]}    prefixes    The prefixes of a certain prefix class.\n * @param {string}      regexPart   The regex part for a given class (completed to a full regex within the function).\n * @param {number}      startStem   Where to start cutting off the de-prefixed word.\n * @param {number}      endStem     Where to end cutting off the de-prefixed word (from the end index).\n *\n * @returns {string|null} The stem or null if no prefixed participle was matched.\n */\nconst detectAndStemParticiplePerPrefixClass = function( word, prefixes, regexPart, startStem, endStem ) {\n\tfor ( const currentPrefix of prefixes ) {\n\t\tconst participleRegex = new RegExp( \"^\" + currentPrefix + regexPart );\n\n\t\tif ( participleRegex.test( word ) ) {\n\t\t\tconst wordWithoutPrefix = word.slice( currentPrefix.length - word.length );\n\t\t\tconst wordWithoutParticipleAffixes = wordWithoutPrefix.slice( startStem, wordWithoutPrefix.length - endStem );\n\n\t\t\treturn ( currentPrefix + wordWithoutParticipleAffixes );\n\t\t}\n\t}\n\n\treturn null;\n};\n\n/**\n * Detects whether a word is a regular participle with a prefix and if so, returns the stem.\n *\n * @param {Object}  morphologyDataVerbs The German morphology data for verbs.\n * @param {string}  word                The word (not stemmed) to check.\n *\n * @returns {string|null} The stem or null if no participle with prefix was matched.\n */\nconst detectAndStemParticiplesWithPrefixes = function( morphologyDataVerbs, word ) {\n\tconst prefixesSeparableOrInseparable = morphologyDataVerbs.prefixes.separableOrInseparable;\n\n\t/*\n\t * It's important to preserve order here, since the ge + stem ending in d/t + et regex is more specific than\n\t * the ge + stem + t regex, and therefore must be checked first.\n\t */\n\tfor ( const participleClass of morphologyDataVerbs.participleStemmingClasses ) {\n\t\tconst regex = participleClass.regex;\n\t\tconst startStem = participleClass.startStem;\n\t\tconst endStem = participleClass.endStem;\n\t\tconst separable = participleClass.separable;\n\n\t\tconst prefixes = separable\n\t\t\t? morphologyDataVerbs.prefixes.separable\n\t\t\t: morphologyDataVerbs.prefixes.inseparable;\n\n\t\tlet stem = detectAndStemParticiplePerPrefixClass( word, prefixes, regex, startStem, endStem );\n\n\t\tif ( stem ) {\n\t\t\treturn stem;\n\t\t}\n\n\t\tstem = detectAndStemParticiplePerPrefixClass( word, prefixesSeparableOrInseparable, regex, startStem, endStem );\n\n\t\tif ( stem ) {\n\t\t\treturn stem;\n\t\t}\n\t}\n\n\treturn null;\n};\n\n/**\n * Detects whether a word is a regular participle and if so, returns the stem.\n *\n * @param {Object}  morphologyDataVerbs The German morphology data for verbs.\n * @param {string}  word                The word (not stemmed) to check.\n *\n * @returns {string|null} The participle stem or null if no regular participle was matched.\n */\nexport function detectAndStemRegularParticiple( morphologyDataVerbs, word ) {\n\tif ( exceptions( word ).length > 0 || exceptionsParticiplesActive.includes( word ) ) {\n\t\treturn \"\";\n\t}\n\n\tlet stem = detectAndStemParticiplesWithoutPrefixes( morphologyDataVerbs, word );\n\n\tif ( stem ) {\n\t\treturn stem;\n\t}\n\n\tstem = detectAndStemParticiplesWithPrefixes( morphologyDataVerbs, word );\n\n\tif ( stem ) {\n\t\treturn stem;\n\t}\n\n\treturn null;\n}\n"],"mappings":"AAAA,OAAOA,2BAA2B;AAClC,OAAOC,UAAU;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,uCAAuC,GAAG,SAAAA,CAAUC,mBAAmB,EAAEC,IAAI,EAAG;EACrF,MAAMC,sBAAsB,GAAG,IAAIC,MAAM,CAAE,GAAG,GAAGH,mBAAmB,CAACI,yBAAyB,CAAE,CAAC,CAAE,CAACC,KAAM,CAAC;EAC3G,MAAMC,uBAAuB,GAAG,IAAIH,MAAM,CAAE,GAAG,GAAGH,mBAAmB,CAACI,yBAAyB,CAAE,CAAC,CAAE,CAACC,KAAM,CAAC;;EAE5G;AACD;AACA;AACA;EACC,IAAKC,uBAAuB,CAACC,IAAI,CAAEN,IAAK,CAAC,EAAG;IAC3C;IACA,OAASA,IAAI,CAACO,KAAK,CAAE,CAAC,EAAEP,IAAI,CAACQ,MAAM,GAAG,CAAE,CAAC;EAC1C;;EAEA;EACA,IAAKP,sBAAsB,CAACK,IAAI,CAAEN,IAAK,CAAC,EAAG;IAC1C;IACA,OAASA,IAAI,CAACO,KAAK,CAAE,CAAC,EAAEP,IAAI,CAACQ,MAAM,GAAG,CAAE,CAAC;EAC1C;EAEA,OAAO,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,qCAAqC,GAAG,SAAAA,CAAUT,IAAI,EAAEU,QAAQ,EAAEC,SAAS,EAAEC,SAAS,EAAEC,OAAO,EAAG;EACvG,KAAM,MAAMC,aAAa,IAAIJ,QAAQ,EAAG;IACvC,MAAMK,eAAe,GAAG,IAAIb,MAAM,CAAE,GAAG,GAAGY,aAAa,GAAGH,SAAU,CAAC;IAErE,IAAKI,eAAe,CAACT,IAAI,CAAEN,IAAK,CAAC,EAAG;MACnC,MAAMgB,iBAAiB,GAAGhB,IAAI,CAACO,KAAK,CAAEO,aAAa,CAACN,MAAM,GAAGR,IAAI,CAACQ,MAAO,CAAC;MAC1E,MAAMS,4BAA4B,GAAGD,iBAAiB,CAACT,KAAK,CAAEK,SAAS,EAAEI,iBAAiB,CAACR,MAAM,GAAGK,OAAQ,CAAC;MAE7G,OAASC,aAAa,GAAGG,4BAA4B;IACtD;EACD;EAEA,OAAO,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,oCAAoC,GAAG,SAAAA,CAAUnB,mBAAmB,EAAEC,IAAI,EAAG;EAClF,MAAMmB,8BAA8B,GAAGpB,mBAAmB,CAACW,QAAQ,CAACU,sBAAsB;;EAE1F;AACD;AACA;AACA;EACC,KAAM,MAAMC,eAAe,IAAItB,mBAAmB,CAACI,yBAAyB,EAAG;IAC9E,MAAMC,KAAK,GAAGiB,eAAe,CAACjB,KAAK;IACnC,MAAMQ,SAAS,GAAGS,eAAe,CAACT,SAAS;IAC3C,MAAMC,OAAO,GAAGQ,eAAe,CAACR,OAAO;IACvC,MAAMS,SAAS,GAAGD,eAAe,CAACC,SAAS;IAE3C,MAAMZ,QAAQ,GAAGY,SAAS,GACvBvB,mBAAmB,CAACW,QAAQ,CAACY,SAAS,GACtCvB,mBAAmB,CAACW,QAAQ,CAACa,WAAW;IAE3C,IAAIC,IAAI,GAAGf,qCAAqC,CAAET,IAAI,EAAEU,QAAQ,EAAEN,KAAK,EAAEQ,SAAS,EAAEC,OAAQ,CAAC;IAE7F,IAAKW,IAAI,EAAG;MACX,OAAOA,IAAI;IACZ;IAEAA,IAAI,GAAGf,qCAAqC,CAAET,IAAI,EAAEmB,8BAA8B,EAAEf,KAAK,EAAEQ,SAAS,EAAEC,OAAQ,CAAC;IAE/G,IAAKW,IAAI,EAAG;MACX,OAAOA,IAAI;IACZ;EACD;EAEA,OAAO,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,SAASC,8BAA8BA,CAAE1B,mBAAmB,EAAEC,IAAI,EAAG;EAC3E,IAAKH,UAAU,CAAEG,IAAK,CAAC,CAACQ,MAAM,GAAG,CAAC,IAAIZ,2BAA2B,CAAC8B,QAAQ,CAAE1B,IAAK,CAAC,EAAG;IACpF,OAAO,EAAE;EACV;EAEA,IAAIwB,IAAI,GAAG1B,uCAAuC,CAAEC,mBAAmB,EAAEC,IAAK,CAAC;EAE/E,IAAKwB,IAAI,EAAG;IACX,OAAOA,IAAI;EACZ;EAEAA,IAAI,GAAGN,oCAAoC,CAAEnB,mBAAmB,EAAEC,IAAK,CAAC;EAExE,IAAKwB,IAAI,EAAG;IACX,OAAOA,IAAI;EACZ;EAEA,OAAO,IAAI;AACZ","ignoreList":[]}

package/build/languageProcessing/languages/de/helpers/internal/determineStem.js

@@ -1,17 +1,11 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = determineStem;
-var _lodash = require("lodash");
-var _index = require("../../../index");
-var _detectAndStemRegularParticiple = require("./detectAndStemRegularParticiple");
-var _stem = _interopRequireDefault(require("./stem"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+import { flatten } from 'lodash';
+import { languageProcessing } from "../../../../../index.js";
 const {
   flattenSortLength
-} = _index.languageProcessing;
+} = languageProcessing;
+import { detectAndStemRegularParticiple } from "./detectAndStemRegularParticiple";
+import stem from "./stem";
+
 /**
  * Returns a stem for a word that appears on the noun exception lists.
  *
@@ -80,7 +74,7 @@ const findStemOnVerbExceptionList = function (morphologyDataVerbs, stemmedWord)
   }
   for (const strongOrIrregularVerbParadigm of strongAndIrregularVerbStems) {
     let stems = strongOrIrregularVerbParadigm.stems;
-    stems = (0, _lodash.flatten)(Object.values(stems));
+    stems = flatten(Object.values(stems));
     if (stems.includes(wordToCheck)) {
       if (matchedPrefix) {
         // The present tense stem is returned as a default stem.
@@ -100,14 +94,14 @@ const findStemOnVerbExceptionList = function (morphologyDataVerbs, stemmedWord)
  *
  * @returns {string} Stemmed form of the word.
  */
-function determineStem(word, morphologyDataGerman) {
+export default function determineStem(word, morphologyDataGerman) {
   const verbData = morphologyDataGerman.verbs;
-  const stemmedWord = (0, _stem.default)(verbData, word);
+  const stemmedWord = stem(verbData, word);
 
   /*
    * Goes through the stem exception functions from left to right, returns the first stem it finds.
    * If no stem has been found, return the original, programmatically created, stem.
    */
-  return findStemOnNounExceptionList(morphologyDataGerman.nouns, stemmedWord) || findStemOnAdjectiveExceptionList(morphologyDataGerman.adjectives, stemmedWord) || findStemOnVerbExceptionList(verbData, stemmedWord) || (0, _detectAndStemRegularParticiple.detectAndStemRegularParticiple)(verbData, word) || stemmedWord;
+  return findStemOnNounExceptionList(morphologyDataGerman.nouns, stemmedWord) || findStemOnAdjectiveExceptionList(morphologyDataGerman.adjectives, stemmedWord) || findStemOnVerbExceptionList(verbData, stemmedWord) || detectAndStemRegularParticiple(verbData, word) || stemmedWord;
 }
 //# sourceMappingURL=determineStem.js.map

package/build/languageProcessing/languages/de/helpers/internal/determineStem.js.map

@@ -1 +1 @@
-{"version":3,"file":"determineStem.js","names":["_lodash","require","_index","_detectAndStemRegularParticiple","_stem","_interopRequireDefault","e","__esModule","default","flattenSortLength","languageProcessing","findStemOnNounExceptionList","morphologyDataNouns","stemmedWord","exceptionStems","exceptionStemSet","matchedStem","find","exceptionStem","endsWith","precedingLexicalMaterial","slice","length","findStemOnAdjectiveExceptionList","morphologyDataAdjectives","adjectiveExceptionClasses","exceptions","key","Object","keys","includes","findStemOnVerbExceptionList","morphologyDataVerbs","wordToCheck","strongAndIrregularVerbStems","strongAndIrregularVerbs","stems","prefixes","matchedPrefix","prefix","startsWith","wordWithoutPrefix","strongOrIrregularVerbParadigm","flatten","values","present","determineStem","word","morphologyDataGerman","verbData","verbs","stem","nouns","adjectives","detectAndStemRegularParticiple"],"sources":["../../../../../../src/languageProcessing/languages/de/helpers/internal/determineStem.js"],"sourcesContent":["import {flatten} from 'lodash';\nimport {languageProcessing} from '../../../index';\nconst {flattenSortLength} = languageProcessing;\n\nimport {detectAndStemRegularParticiple} from './detectAndStemRegularParticiple';\n\nimport stem from './stem';\n\n/**\n * Returns a stem for a word that appears on the noun exception lists.\n *\n * @param {Object}  morphologyDataNouns The German morphology data for nouns.\n * @param {string}  stemmedWord         The stem to check.\n *\n * @returns {string|null} The stemmed word or null if none was found.\n */\nconst findStemOnNounExceptionList = function(morphologyDataNouns, stemmedWord) {\n  const exceptionStems = morphologyDataNouns.exceptionStems;\n\n  for (const exceptionStemSet of exceptionStems) {\n    const matchedStem = exceptionStemSet.find(exceptionStem => stemmedWord.endsWith(exceptionStem));\n\n    if (matchedStem) {\n      const precedingLexicalMaterial = stemmedWord.slice(\n        0,\n        stemmedWord.length - matchedStem.length\n      );\n\n      return precedingLexicalMaterial + exceptionStemSet[0];\n    }\n  }\n\n  return null;\n};\n\n/**\n * Returns a stem for a word that appears on the adjective exception lists.\n *\n * @param {Object}  morphologyDataAdjectives    The German morphology data for adjectives.\n * @param {string}  stemmedWord                 The stem to check.\n *\n * @returns {string|null} The stemmed word or null if none was found.\n */\nconst findStemOnAdjectiveExceptionList = function(morphologyDataAdjectives, stemmedWord) {\n  const adjectiveExceptionClasses = morphologyDataAdjectives.exceptions;\n\n  for (const key of Object.keys(adjectiveExceptionClasses)) {\n    const exceptionStems = adjectiveExceptionClasses[key];\n\n    for (const exceptionStemSet of exceptionStems) {\n      if (exceptionStemSet.includes(stemmedWord)) {\n        return exceptionStemSet[0];\n      }\n    }\n  }\n\n  return null;\n};\n\n/**\n * Returns a stem for a word that appears on the verb exception lists.\n *\n * @param {Object}  morphologyDataVerbs The German morphology data for verbs.\n * @param {string}  stemmedWord         The stem to check.\n *\n * @returns {string|null} The stemmed word or null if none was found.\n */\nconst findStemOnVerbExceptionList = function(morphologyDataVerbs, stemmedWord) {\n  let wordToCheck = stemmedWord;\n  const strongAndIrregularVerbStems = morphologyDataVerbs.strongAndIrregularVerbs.stems;\n  const prefixes = flattenSortLength(morphologyDataVerbs.prefixes);\n\n  let matchedPrefix = prefixes.find(prefix => stemmedWord.startsWith(prefix));\n\n  if (matchedPrefix) {\n    const wordWithoutPrefix = wordToCheck.slice(matchedPrefix.length, wordToCheck.length);\n\n    /* At least 3 characters so that e.g. \"be\" is not found in the stem \"berg\". A minimum length of 3 was chosen\n     * as a safe option, since 2-letter verb stems are highly unlikely to impossible.\n     */\n    if (wordWithoutPrefix.length > 2) {\n      wordToCheck = wordWithoutPrefix;\n    } else {\n      matchedPrefix = null;\n    }\n  }\n\n  for (const strongOrIrregularVerbParadigm of strongAndIrregularVerbStems) {\n    let stems = strongOrIrregularVerbParadigm.stems;\n    stems = flatten(Object.values(stems));\n\n    if (stems.includes(wordToCheck)) {\n      if (matchedPrefix) {\n        // The present tense stem is returned as a default stem.\n        return matchedPrefix + strongOrIrregularVerbParadigm.stems.present;\n      }\n\n      return strongOrIrregularVerbParadigm.stems.present;\n    }\n  }\n\n  return null;\n};\n\n/**\n * Returns the stem for a given German input word.\n *\n * @param   {string} word                   The word to get the stem for.\n * @param   {Object} morphologyDataGerman   The German morphology data.\n *\n * @returns {string} Stemmed form of the word.\n */\nexport default function determineStem(word, morphologyDataGerman) {\n  const verbData = morphologyDataGerman.verbs;\n  const stemmedWord = stem(verbData, word);\n\n  /*\n   * Goes through the stem exception functions from left to right, returns the first stem it finds.\n   * If no stem has been found, return the original, programmatically created, stem.\n   */\n  return (\n    findStemOnNounExceptionList(morphologyDataGerman.nouns, stemmedWord) ||\n    findStemOnAdjectiveExceptionList(morphologyDataGerman.adjectives, stemmedWord) ||\n    findStemOnVerbExceptionList(verbData, stemmedWord) ||\n    detectAndStemRegularParticiple(verbData, word) ||\n    stemmedWord\n  );\n}\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AACA,IAAAC,MAAA,GAAAD,OAAA;AAGA,IAAAE,+BAAA,GAAAF,OAAA;AAEA,IAAAG,KAAA,GAAAC,sBAAA,CAAAJ,OAAA;AAA0B,SAAAI,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAJ1B,MAAM;EAACG;AAAiB,CAAC,GAAGC,yBAAkB;AAM9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,2BAA2B,GAAG,SAAAA,CAASC,mBAAmB,EAAEC,WAAW,EAAE;EAC7E,MAAMC,cAAc,GAAGF,mBAAmB,CAACE,cAAc;EAEzD,KAAK,MAAMC,gBAAgB,IAAID,cAAc,EAAE;IAC7C,MAAME,WAAW,GAAGD,gBAAgB,CAACE,IAAI,CAACC,aAAa,IAAIL,WAAW,CAACM,QAAQ,CAACD,aAAa,CAAC,CAAC;IAE/F,IAAIF,WAAW,EAAE;MACf,MAAMI,wBAAwB,GAAGP,WAAW,CAACQ,KAAK,CAChD,CAAC,EACDR,WAAW,CAACS,MAAM,GAAGN,WAAW,CAACM,MACnC,CAAC;MAED,OAAOF,wBAAwB,GAAGL,gBAAgB,CAAC,CAAC,CAAC;IACvD;EACF;EAEA,OAAO,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMQ,gCAAgC,GAAG,SAAAA,CAASC,wBAAwB,EAAEX,WAAW,EAAE;EACvF,MAAMY,yBAAyB,GAAGD,wBAAwB,CAACE,UAAU;EAErE,KAAK,MAAMC,GAAG,IAAIC,MAAM,CAACC,IAAI,CAACJ,yBAAyB,CAAC,EAAE;IACxD,MAAMX,cAAc,GAAGW,yBAAyB,CAACE,GAAG,CAAC;IAErD,KAAK,MAAMZ,gBAAgB,IAAID,cAAc,EAAE;MAC7C,IAAIC,gBAAgB,CAACe,QAAQ,CAACjB,WAAW,CAAC,EAAE;QAC1C,OAAOE,gBAAgB,CAAC,CAAC,CAAC;MAC5B;IACF;EACF;EAEA,OAAO,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMgB,2BAA2B,GAAG,SAAAA,CAASC,mBAAmB,EAAEnB,WAAW,EAAE;EAC7E,IAAIoB,WAAW,GAAGpB,WAAW;EAC7B,MAAMqB,2BAA2B,GAAGF,mBAAmB,CAACG,uBAAuB,CAACC,KAAK;EACrF,MAAMC,QAAQ,GAAG5B,iBAAiB,CAACuB,mBAAmB,CAACK,QAAQ,CAAC;EAEhE,IAAIC,aAAa,GAAGD,QAAQ,CAACpB,IAAI,CAACsB,MAAM,IAAI1B,WAAW,CAAC2B,UAAU,CAACD,MAAM,CAAC,CAAC;EAE3E,IAAID,aAAa,EAAE;IACjB,MAAMG,iBAAiB,GAAGR,WAAW,CAACZ,KAAK,CAACiB,aAAa,CAAChB,MAAM,EAAEW,WAAW,CAACX,MAAM,CAAC;;IAErF;AACJ;AACA;IACI,IAAImB,iBAAiB,CAACnB,MAAM,GAAG,CAAC,EAAE;MAChCW,WAAW,GAAGQ,iBAAiB;IACjC,CAAC,MAAM;MACLH,aAAa,GAAG,IAAI;IACtB;EACF;EAEA,KAAK,MAAMI,6BAA6B,IAAIR,2BAA2B,EAAE;IACvE,IAAIE,KAAK,GAAGM,6BAA6B,CAACN,KAAK;IAC/CA,KAAK,GAAG,IAAAO,eAAO,EAACf,MAAM,CAACgB,MAAM,CAACR,KAAK,CAAC,CAAC;IAErC,IAAIA,KAAK,CAACN,QAAQ,CAACG,WAAW,CAAC,EAAE;MAC/B,IAAIK,aAAa,EAAE;QACjB;QACA,OAAOA,aAAa,GAAGI,6BAA6B,CAACN,KAAK,CAACS,OAAO;MACpE;MAEA,OAAOH,6BAA6B,CAACN,KAAK,CAACS,OAAO;IACpD;EACF;EAEA,OAAO,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASC,aAAaA,CAACC,IAAI,EAAEC,oBAAoB,EAAE;EAChE,MAAMC,QAAQ,GAAGD,oBAAoB,CAACE,KAAK;EAC3C,MAAMrC,WAAW,GAAG,IAAAsC,aAAI,EAACF,QAAQ,EAAEF,IAAI,CAAC;;EAExC;AACF;AACA;AACA;EACE,OACEpC,2BAA2B,CAACqC,oBAAoB,CAACI,KAAK,EAAEvC,WAAW,CAAC,IACpEU,gCAAgC,CAACyB,oBAAoB,CAACK,UAAU,EAAExC,WAAW,CAAC,IAC9EkB,2BAA2B,CAACkB,QAAQ,EAAEpC,WAAW,CAAC,IAClD,IAAAyC,8DAA8B,EAACL,QAAQ,EAAEF,IAAI,CAAC,IAC9ClC,WAAW;AAEf","ignoreList":[]}
+{"version":3,"file":"determineStem.js","names":["flatten","languageProcessing","flattenSortLength","detectAndStemRegularParticiple","stem","findStemOnNounExceptionList","morphologyDataNouns","stemmedWord","exceptionStems","exceptionStemSet","matchedStem","find","exceptionStem","endsWith","precedingLexicalMaterial","slice","length","findStemOnAdjectiveExceptionList","morphologyDataAdjectives","adjectiveExceptionClasses","exceptions","key","Object","keys","includes","findStemOnVerbExceptionList","morphologyDataVerbs","wordToCheck","strongAndIrregularVerbStems","strongAndIrregularVerbs","stems","prefixes","matchedPrefix","prefix","startsWith","wordWithoutPrefix","strongOrIrregularVerbParadigm","values","present","determineStem","word","morphologyDataGerman","verbData","verbs","nouns","adjectives"],"sources":["../../../../../../src/languageProcessing/languages/de/helpers/internal/determineStem.js"],"sourcesContent":["import {flatten} from 'lodash';\nimport {languageProcessing} from '@axyseo/index.js';\nconst {flattenSortLength} = languageProcessing;\n\nimport {detectAndStemRegularParticiple} from './detectAndStemRegularParticiple';\n\nimport stem from './stem';\n\n/**\n * Returns a stem for a word that appears on the noun exception lists.\n *\n * @param {Object}  morphologyDataNouns The German morphology data for nouns.\n * @param {string}  stemmedWord         The stem to check.\n *\n * @returns {string|null} The stemmed word or null if none was found.\n */\nconst findStemOnNounExceptionList = function(morphologyDataNouns, stemmedWord) {\n  const exceptionStems = morphologyDataNouns.exceptionStems;\n\n  for (const exceptionStemSet of exceptionStems) {\n    const matchedStem = exceptionStemSet.find(exceptionStem => stemmedWord.endsWith(exceptionStem));\n\n    if (matchedStem) {\n      const precedingLexicalMaterial = stemmedWord.slice(\n        0,\n        stemmedWord.length - matchedStem.length\n      );\n\n      return precedingLexicalMaterial + exceptionStemSet[0];\n    }\n  }\n\n  return null;\n};\n\n/**\n * Returns a stem for a word that appears on the adjective exception lists.\n *\n * @param {Object}  morphologyDataAdjectives    The German morphology data for adjectives.\n * @param {string}  stemmedWord                 The stem to check.\n *\n * @returns {string|null} The stemmed word or null if none was found.\n */\nconst findStemOnAdjectiveExceptionList = function(morphologyDataAdjectives, stemmedWord) {\n  const adjectiveExceptionClasses = morphologyDataAdjectives.exceptions;\n\n  for (const key of Object.keys(adjectiveExceptionClasses)) {\n    const exceptionStems = adjectiveExceptionClasses[key];\n\n    for (const exceptionStemSet of exceptionStems) {\n      if (exceptionStemSet.includes(stemmedWord)) {\n        return exceptionStemSet[0];\n      }\n    }\n  }\n\n  return null;\n};\n\n/**\n * Returns a stem for a word that appears on the verb exception lists.\n *\n * @param {Object}  morphologyDataVerbs The German morphology data for verbs.\n * @param {string}  stemmedWord         The stem to check.\n *\n * @returns {string|null} The stemmed word or null if none was found.\n */\nconst findStemOnVerbExceptionList = function(morphologyDataVerbs, stemmedWord) {\n  let wordToCheck = stemmedWord;\n  const strongAndIrregularVerbStems = morphologyDataVerbs.strongAndIrregularVerbs.stems;\n  const prefixes = flattenSortLength(morphologyDataVerbs.prefixes);\n\n  let matchedPrefix = prefixes.find(prefix => stemmedWord.startsWith(prefix));\n\n  if (matchedPrefix) {\n    const wordWithoutPrefix = wordToCheck.slice(matchedPrefix.length, wordToCheck.length);\n\n    /* At least 3 characters so that e.g. \"be\" is not found in the stem \"berg\". A minimum length of 3 was chosen\n     * as a safe option, since 2-letter verb stems are highly unlikely to impossible.\n     */\n    if (wordWithoutPrefix.length > 2) {\n      wordToCheck = wordWithoutPrefix;\n    } else {\n      matchedPrefix = null;\n    }\n  }\n\n  for (const strongOrIrregularVerbParadigm of strongAndIrregularVerbStems) {\n    let stems = strongOrIrregularVerbParadigm.stems;\n    stems = flatten(Object.values(stems));\n\n    if (stems.includes(wordToCheck)) {\n      if (matchedPrefix) {\n        // The present tense stem is returned as a default stem.\n        return matchedPrefix + strongOrIrregularVerbParadigm.stems.present;\n      }\n\n      return strongOrIrregularVerbParadigm.stems.present;\n    }\n  }\n\n  return null;\n};\n\n/**\n * Returns the stem for a given German input word.\n *\n * @param   {string} word                   The word to get the stem for.\n * @param   {Object} morphologyDataGerman   The German morphology data.\n *\n * @returns {string} Stemmed form of the word.\n */\nexport default function determineStem(word, morphologyDataGerman) {\n  const verbData = morphologyDataGerman.verbs;\n  const stemmedWord = stem(verbData, word);\n\n  /*\n   * Goes through the stem exception functions from left to right, returns the first stem it finds.\n   * If no stem has been found, return the original, programmatically created, stem.\n   */\n  return (\n    findStemOnNounExceptionList(morphologyDataGerman.nouns, stemmedWord) ||\n    findStemOnAdjectiveExceptionList(morphologyDataGerman.adjectives, stemmedWord) ||\n    findStemOnVerbExceptionList(verbData, stemmedWord) ||\n    detectAndStemRegularParticiple(verbData, word) ||\n    stemmedWord\n  );\n}\n"],"mappings":"AAAA,SAAQA,OAAO,QAAO,QAAQ;AAC9B,SAAQC,kBAAkB;AAC1B,MAAM;EAACC;AAAiB,CAAC,GAAGD,kBAAkB;AAE9C,SAAQE,8BAA8B;AAEtC,OAAOC,IAAI;;AAEX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,2BAA2B,GAAG,SAAAA,CAASC,mBAAmB,EAAEC,WAAW,EAAE;EAC7E,MAAMC,cAAc,GAAGF,mBAAmB,CAACE,cAAc;EAEzD,KAAK,MAAMC,gBAAgB,IAAID,cAAc,EAAE;IAC7C,MAAME,WAAW,GAAGD,gBAAgB,CAACE,IAAI,CAACC,aAAa,IAAIL,WAAW,CAACM,QAAQ,CAACD,aAAa,CAAC,CAAC;IAE/F,IAAIF,WAAW,EAAE;MACf,MAAMI,wBAAwB,GAAGP,WAAW,CAACQ,KAAK,CAChD,CAAC,EACDR,WAAW,CAACS,MAAM,GAAGN,WAAW,CAACM,MACnC,CAAC;MAED,OAAOF,wBAAwB,GAAGL,gBAAgB,CAAC,CAAC,CAAC;IACvD;EACF;EAEA,OAAO,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMQ,gCAAgC,GAAG,SAAAA,CAASC,wBAAwB,EAAEX,WAAW,EAAE;EACvF,MAAMY,yBAAyB,GAAGD,wBAAwB,CAACE,UAAU;EAErE,KAAK,MAAMC,GAAG,IAAIC,MAAM,CAACC,IAAI,CAACJ,yBAAyB,CAAC,EAAE;IACxD,MAAMX,cAAc,GAAGW,yBAAyB,CAACE,GAAG,CAAC;IAErD,KAAK,MAAMZ,gBAAgB,IAAID,cAAc,EAAE;MAC7C,IAAIC,gBAAgB,CAACe,QAAQ,CAACjB,WAAW,CAAC,EAAE;QAC1C,OAAOE,gBAAgB,CAAC,CAAC,CAAC;MAC5B;IACF;EACF;EAEA,OAAO,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMgB,2BAA2B,GAAG,SAAAA,CAASC,mBAAmB,EAAEnB,WAAW,EAAE;EAC7E,IAAIoB,WAAW,GAAGpB,WAAW;EAC7B,MAAMqB,2BAA2B,GAAGF,mBAAmB,CAACG,uBAAuB,CAACC,KAAK;EACrF,MAAMC,QAAQ,GAAG7B,iBAAiB,CAACwB,mBAAmB,CAACK,QAAQ,CAAC;EAEhE,IAAIC,aAAa,GAAGD,QAAQ,CAACpB,IAAI,CAACsB,MAAM,IAAI1B,WAAW,CAAC2B,UAAU,CAACD,MAAM,CAAC,CAAC;EAE3E,IAAID,aAAa,EAAE;IACjB,MAAMG,iBAAiB,GAAGR,WAAW,CAACZ,KAAK,CAACiB,aAAa,CAAChB,MAAM,EAAEW,WAAW,CAACX,MAAM,CAAC;;IAErF;AACJ;AACA;IACI,IAAImB,iBAAiB,CAACnB,MAAM,GAAG,CAAC,EAAE;MAChCW,WAAW,GAAGQ,iBAAiB;IACjC,CAAC,MAAM;MACLH,aAAa,GAAG,IAAI;IACtB;EACF;EAEA,KAAK,MAAMI,6BAA6B,IAAIR,2BAA2B,EAAE;IACvE,IAAIE,KAAK,GAAGM,6BAA6B,CAACN,KAAK;IAC/CA,KAAK,GAAG9B,OAAO,CAACsB,MAAM,CAACe,MAAM,CAACP,KAAK,CAAC,CAAC;IAErC,IAAIA,KAAK,CAACN,QAAQ,CAACG,WAAW,CAAC,EAAE;MAC/B,IAAIK,aAAa,EAAE;QACjB;QACA,OAAOA,aAAa,GAAGI,6BAA6B,CAACN,KAAK,CAACQ,OAAO;MACpE;MAEA,OAAOF,6BAA6B,CAACN,KAAK,CAACQ,OAAO;IACpD;EACF;EAEA,OAAO,IAAI;AACb,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASC,aAAaA,CAACC,IAAI,EAAEC,oBAAoB,EAAE;EAChE,MAAMC,QAAQ,GAAGD,oBAAoB,CAACE,KAAK;EAC3C,MAAMpC,WAAW,GAAGH,IAAI,CAACsC,QAAQ,EAAEF,IAAI,CAAC;;EAExC;AACF;AACA;AACA;EACE,OACEnC,2BAA2B,CAACoC,oBAAoB,CAACG,KAAK,EAAErC,WAAW,CAAC,IACpEU,gCAAgC,CAACwB,oBAAoB,CAACI,UAAU,EAAEtC,WAAW,CAAC,IAC9EkB,2BAA2B,CAACiB,QAAQ,EAAEnC,WAAW,CAAC,IAClDJ,8BAA8B,CAACuC,QAAQ,EAAEF,IAAI,CAAC,IAC9CjC,WAAW;AAEf","ignoreList":[]}

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

@@ -1,18 +1,11 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = _default;
-var _lodash = require("lodash");
-var _index = require("../../../index");
-var _passiveVoiceRegex = _interopRequireDefault(require("../../config/internal/passiveVoiceRegex.js"));
-var _passiveVoiceIrregulars = _interopRequireDefault(require("../../config/internal/passiveVoiceIrregulars.js"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+import { forEach } from 'lodash';
+import { languageProcessing } from "../../../../../index.js";
 const {
   getWords
-} = _index.languageProcessing;
-const regexFunction = (0, _passiveVoiceRegex.default)();
+} = languageProcessing;
+import regexFunctionFactory from "../../config/internal/passiveVoiceRegex.js";
+const regexFunction = regexFunctionFactory();
+import irregularParticiples from "../../config/internal/passiveVoiceIrregulars.js";
 const verbsBeginningWithErVerEntBeZerHerUber = regexFunction.verbsBeginningWithErVerEntBeZerHerUber;
 const verbsBeginningWithGe = regexFunction.verbsBeginningWithGe;
 const verbsWithGeInMiddle = regexFunction.verbsWithGeInMiddle;
@@ -26,11 +19,11 @@ const verbsEndingWithIert = regexFunction.verbsEndingWithIert;
  *
  * @returns {Array} The array with the German participles found.
  */
-function _default(clauseText) {
+export default function (clauseText) {
   const words = getWords(clauseText);
   const foundParticiples = [];
-  (0, _lodash.forEach)(words, function (word) {
-    if (verbsBeginningWithGe(word).length !== 0 || verbsWithGeInMiddle(word).length !== 0 || verbsBeginningWithErVerEntBeZerHerUber(word).length !== 0 || verbsWithErVerEntBeZerHerUberInMiddle(word).length !== 0 || verbsEndingWithIert(word).length !== 0 || _passiveVoiceIrregulars.default.includes(word)) {
+  forEach(words, function (word) {
+    if (verbsBeginningWithGe(word).length !== 0 || verbsWithGeInMiddle(word).length !== 0 || verbsBeginningWithErVerEntBeZerHerUber(word).length !== 0 || verbsWithErVerEntBeZerHerUberInMiddle(word).length !== 0 || verbsEndingWithIert(word).length !== 0 || irregularParticiples.includes(word)) {
       foundParticiples.push(word);
     }
   });

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

@@ -1 +1 @@
-{"version":3,"file":"getParticiples.js","names":["_lodash","require","_index","_passiveVoiceRegex","_interopRequireDefault","_passiveVoiceIrregulars","e","__esModule","default","getWords","languageProcessing","regexFunction","regexFunctionFactory","verbsBeginningWithErVerEntBeZerHerUber","verbsBeginningWithGe","verbsWithGeInMiddle","verbsWithErVerEntBeZerHerUberInMiddle","verbsEndingWithIert","_default","clauseText","words","foundParticiples","forEach","word","length","irregularParticiples","includes","push"],"sources":["../../../../../../src/languageProcessing/languages/de/helpers/internal/getParticiples.js"],"sourcesContent":["import {forEach} from 'lodash';\nimport {languageProcessing} from '../../../index';\nconst {getWords} = languageProcessing;\n\nimport regexFunctionFactory from '../../config/internal/passiveVoiceRegex.js';\nconst regexFunction = regexFunctionFactory();\nimport irregularParticiples from '../../config/internal/passiveVoiceIrregulars.js';\n\nconst verbsBeginningWithErVerEntBeZerHerUber = regexFunction.verbsBeginningWithErVerEntBeZerHerUber;\nconst verbsBeginningWithGe = regexFunction.verbsBeginningWithGe;\nconst verbsWithGeInMiddle = regexFunction.verbsWithGeInMiddle;\nconst verbsWithErVerEntBeZerHerUberInMiddle = regexFunction.verbsWithErVerEntBeZerHerUberInMiddle;\nconst verbsEndingWithIert = regexFunction.verbsEndingWithIert;\n\n/**\n * Creates German participles array for the participles found in a clause.\n *\n * @param {string} clauseText The clause to finds participles in.\n *\n * @returns {Array} The array with the German participles found.\n */\nexport default function(clauseText) {\n  const words = getWords(clauseText);\n\n  const foundParticiples = [];\n\n  forEach(words, function(word) {\n    if (\n      verbsBeginningWithGe(word).length !== 0 ||\n      verbsWithGeInMiddle(word).length !== 0 ||\n      verbsBeginningWithErVerEntBeZerHerUber(word).length !== 0 ||\n      verbsWithErVerEntBeZerHerUberInMiddle(word).length !== 0 ||\n      verbsEndingWithIert(word).length !== 0 ||\n      irregularParticiples.includes(word)\n    ) {\n      foundParticiples.push(word);\n    }\n  });\n  return foundParticiples;\n}\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AACA,IAAAC,MAAA,GAAAD,OAAA;AAGA,IAAAE,kBAAA,GAAAC,sBAAA,CAAAH,OAAA;AAEA,IAAAI,uBAAA,GAAAD,sBAAA,CAAAH,OAAA;AAAmF,SAAAG,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAJnF,MAAM;EAACG;AAAQ,CAAC,GAAGC,yBAAkB;AAGrC,MAAMC,aAAa,GAAG,IAAAC,0BAAoB,EAAC,CAAC;AAG5C,MAAMC,sCAAsC,GAAGF,aAAa,CAACE,sCAAsC;AACnG,MAAMC,oBAAoB,GAAGH,aAAa,CAACG,oBAAoB;AAC/D,MAAMC,mBAAmB,GAAGJ,aAAa,CAACI,mBAAmB;AAC7D,MAAMC,qCAAqC,GAAGL,aAAa,CAACK,qCAAqC;AACjG,MAAMC,mBAAmB,GAAGN,aAAa,CAACM,mBAAmB;;AAE7D;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAAAC,SAASC,UAAU,EAAE;EAClC,MAAMC,KAAK,GAAGX,QAAQ,CAACU,UAAU,CAAC;EAElC,MAAME,gBAAgB,GAAG,EAAE;EAE3B,IAAAC,eAAO,EAACF,KAAK,EAAE,UAASG,IAAI,EAAE;IAC5B,IACET,oBAAoB,CAACS,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACvCT,mBAAmB,CAACQ,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACtCX,sCAAsC,CAACU,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACzDR,qCAAqC,CAACO,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACxDP,mBAAmB,CAACM,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACtCC,+BAAoB,CAACC,QAAQ,CAACH,IAAI,CAAC,EACnC;MACAF,gBAAgB,CAACM,IAAI,CAACJ,IAAI,CAAC;IAC7B;EACF,CAAC,CAAC;EACF,OAAOF,gBAAgB;AACzB","ignoreList":[]}
+{"version":3,"file":"getParticiples.js","names":["forEach","languageProcessing","getWords","regexFunctionFactory","regexFunction","irregularParticiples","verbsBeginningWithErVerEntBeZerHerUber","verbsBeginningWithGe","verbsWithGeInMiddle","verbsWithErVerEntBeZerHerUberInMiddle","verbsEndingWithIert","clauseText","words","foundParticiples","word","length","includes","push"],"sources":["../../../../../../src/languageProcessing/languages/de/helpers/internal/getParticiples.js"],"sourcesContent":["import {forEach} from 'lodash';\nimport {languageProcessing} from '@axyseo/index.js';\nconst {getWords} = languageProcessing;\n\nimport regexFunctionFactory from '../../config/internal/passiveVoiceRegex.js';\nconst regexFunction = regexFunctionFactory();\nimport irregularParticiples from '../../config/internal/passiveVoiceIrregulars.js';\n\nconst verbsBeginningWithErVerEntBeZerHerUber = regexFunction.verbsBeginningWithErVerEntBeZerHerUber;\nconst verbsBeginningWithGe = regexFunction.verbsBeginningWithGe;\nconst verbsWithGeInMiddle = regexFunction.verbsWithGeInMiddle;\nconst verbsWithErVerEntBeZerHerUberInMiddle = regexFunction.verbsWithErVerEntBeZerHerUberInMiddle;\nconst verbsEndingWithIert = regexFunction.verbsEndingWithIert;\n\n/**\n * Creates German participles array for the participles found in a clause.\n *\n * @param {string} clauseText The clause to finds participles in.\n *\n * @returns {Array} The array with the German participles found.\n */\nexport default function(clauseText) {\n  const words = getWords(clauseText);\n\n  const foundParticiples = [];\n\n  forEach(words, function(word) {\n    if (\n      verbsBeginningWithGe(word).length !== 0 ||\n      verbsWithGeInMiddle(word).length !== 0 ||\n      verbsBeginningWithErVerEntBeZerHerUber(word).length !== 0 ||\n      verbsWithErVerEntBeZerHerUberInMiddle(word).length !== 0 ||\n      verbsEndingWithIert(word).length !== 0 ||\n      irregularParticiples.includes(word)\n    ) {\n      foundParticiples.push(word);\n    }\n  });\n  return foundParticiples;\n}\n"],"mappings":"AAAA,SAAQA,OAAO,QAAO,QAAQ;AAC9B,SAAQC,kBAAkB;AAC1B,MAAM;EAACC;AAAQ,CAAC,GAAGD,kBAAkB;AAErC,OAAOE,oBAAoB;AAC3B,MAAMC,aAAa,GAAGD,oBAAoB,CAAC,CAAC;AAC5C,OAAOE,oBAAoB;AAE3B,MAAMC,sCAAsC,GAAGF,aAAa,CAACE,sCAAsC;AACnG,MAAMC,oBAAoB,GAAGH,aAAa,CAACG,oBAAoB;AAC/D,MAAMC,mBAAmB,GAAGJ,aAAa,CAACI,mBAAmB;AAC7D,MAAMC,qCAAqC,GAAGL,aAAa,CAACK,qCAAqC;AACjG,MAAMC,mBAAmB,GAAGN,aAAa,CAACM,mBAAmB;;AAE7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,UAASC,UAAU,EAAE;EAClC,MAAMC,KAAK,GAAGV,QAAQ,CAACS,UAAU,CAAC;EAElC,MAAME,gBAAgB,GAAG,EAAE;EAE3Bb,OAAO,CAACY,KAAK,EAAE,UAASE,IAAI,EAAE;IAC5B,IACEP,oBAAoB,CAACO,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACvCP,mBAAmB,CAACM,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACtCT,sCAAsC,CAACQ,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACzDN,qCAAqC,CAACK,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACxDL,mBAAmB,CAACI,IAAI,CAAC,CAACC,MAAM,KAAK,CAAC,IACtCV,oBAAoB,CAACW,QAAQ,CAACF,IAAI,CAAC,EACnC;MACAD,gBAAgB,CAACI,IAAI,CAACH,IAAI,CAAC;IAC7B;EACF,CAAC,CAAC;EACF,OAAOD,gBAAgB;AACzB","ignoreList":[]}

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

@@ -1,9 +1,3 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = stem;
 /**
  * @file German stemming algorithm. Adapted from:
  * @author: Joder Illi
@@ -183,7 +177,7 @@ const stemIrregularVerbs = function (morphologyDataVerbs, word) {
  *
  * @returns {string} The stemmed word.
  */
-function stem(morphologyDataVerbs, word) {
+export default function stem(morphologyDataVerbs, word) {
   // Check if word is a very irregular verb, and if so, return its stem.
   const veryIrregularVerbStem = stemIrregularVerbs(morphologyDataVerbs, word);
   if (veryIrregularVerbStem) {

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

@@ -1 +1 @@
-{"version":3,"file":"stem.js","names":["determineR1","word","r1Index","search","findSuffixStep1","a1Index","b1Index","c1Index","optionUsed1","index1","findSuffixStep2","a2Index","b2Index","index2","deleteSuffix1","substring","length","deleteSuffix2","stemIrregularVerbs","morphologyDataVerbs","irregularVerbs","veryIrregularVerbs","matchedParadigm","find","paradigm","forms","includes","stem","veryIrregularVerbStem","replace"],"sources":["../../../../../../src/languageProcessing/languages/de/helpers/internal/stem.js"],"sourcesContent":["/**\n * @file German stemming algorithm. Adapted from:\n * @author: Joder Illi\n * @copyright (c) 2010, FormBlitz AG\n * All rights reserved.\n * Implementation of the stemming algorithm from http://snowball.tartarus.org/algorithms/german/stemmer.html\n * Copyright of the algorithm is: Copyright (c) 2001, Dr Martin Porter and can be found at http://snowball.tartarus.org/license.php\n *\n * Redistribution and use in source and binary forms, with or without modification, is covered by the standard BSD license.\n */\n/**\n * Determines the start index of the R1 region.\n * R1 is the region after the first non-vowel following a vowel. It should include at least 3 letters.\n *\n * @param {string} word The word for which to determine the R1 region.\n * @returns {number} The start index of the R1 region.\n */\nconst determineR1 = function( word ) {\n\t// Start with matching first vowel and non-vowel.\n\tlet r1Index = word.search( /[aeiouyäöü][^aeiouyäöü]/ );\n\t// Then add 2 since the R1 index is the index after the first vowel & non-vowel matched with the regex.\n\tif ( r1Index !== -1 ) {\n\t\tr1Index += 2;\n\t}\n\n\t// Adjust R1 so that the region preceding it includes at least 3 letters.\n\tif ( r1Index !== -1 && r1Index < 3 ) {\n\t\tr1Index = 3;\n\t}\n\n\treturn r1Index;\n};\n\n/**\n * Search for the longest among the following suffixes,\n * (a) em   ern   er\n * (b) e   en   es\n * (c) s (preceded by a valid s-ending)\n * Define a valid s-ending as one of b, d, f, g, h, k, l, m, n, r or t.\n *\n * @param {string} word The word to check for the suffix.\n * @returns {{index1: number, optionUsed1: string}} The index of the suffix and the kind of suffix used.\n */\nconst findSuffixStep1 = function( word ) {\n\tconst a1Index = word.search( /(em|ern|er)$/g );\n\tconst b1Index = word.search( /(e|en|es)$/g );\n\tlet c1Index = word.search( /([bdfghklmnrt]s)$/g );\n\t// Exclude the s-ending before the s.\n\tif ( c1Index !== -1 ) {\n\t\tc1Index++;\n\t}\n\tlet optionUsed1 = \"\";\n\tlet index1 = 10000;\n\tif ( a1Index !== -1 ) {\n\t\toptionUsed1 = \"a\";\n\t\tindex1 = a1Index;\n\n\t\treturn { index1, optionUsed1 };\n\t} else if ( b1Index !== -1 ) {\n\t\toptionUsed1 = \"b\";\n\t\tindex1 = b1Index;\n\n\t\treturn { index1, optionUsed1 };\n\t} else if ( c1Index !== -1 ) {\n\t\toptionUsed1 = \"c\";\n\t\tindex1 = c1Index;\n\n\t\treturn { index1, optionUsed1 };\n\t}\n\n\treturn { index1, optionUsed1 };\n};\n\n/**\n * Search for the longest among the following suffixes,\n * (a) en   er   est\n * (b) st (preceded by a valid st-ending, itself preceded by at least 3 letters)\n * Define a valid st-ending as one of b, d, f, g, h, k, l, m, n or t.\n *\n * @param {string} word The word to check for the suffix.\n * @returns {number} The index of the suffix.\n */\nconst findSuffixStep2 = function( word ) {\n\tconst a2Index = word.search( /(en|er|est)$/g );\n\tlet b2Index = word.search( /(.{3}[bdfghklmnt]st)$/g );\n\t// Exclude the st-ending and the preceding 3 letters.\n\tif ( b2Index !== -1 ) {\n\t\tb2Index += 4;\n\t}\n\tlet index2 = 10000;\n\tif ( a2Index !== -1 ) {\n\t\tindex2 = a2Index;\n\t} else if ( b2Index !== -1  ) {\n\t\tindex2 = b2Index;\n\t}\n\n\treturn index2;\n};\n\n/**\n * Delete the suffix found in step 1 if in R1. (The letter of the valid s-ending is not necessarily in R1.)\n * If an ending of group (b) is deleted, and the ending is preceded by niss, delete the final s.\n * (For example, äckern -> äck, ackers -> acker, armes -> arm, bedürfnissen -> bedürfnis).\n *\n * @param {string} word         The word for which to delete the suffix.\n * @param {number} index1       The index of the suffix found in step 1.\n * @param {string} optionUsed1  The type of the suffix found in step 1.\n * @param {number} r1Index      The R1 index.\n *\n * @returns {string} The word with the deleted suffix.\n */\nconst deleteSuffix1 = function( word, index1, optionUsed1, r1Index ) {\n\tif ( index1 !== 10000 && r1Index !== -1 ) {\n\t\tif ( index1 >= r1Index ) {\n\t\t\tword = word.substring( 0, index1 );\n\t\t\tif ( optionUsed1 === \"b\" ) {\n\t\t\t\tif ( word.search( /niss$/ ) !== -1 ) {\n\t\t\t\t\tword = word.substring( 0, word.length - 1 );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn word;\n};\n\n/**\n * Delete the suffix found in step 2 if in R1.\n * (For example, derbsten -> derbst by step 1, and derbst -> derb by step 2,\n * since b is a valid st-ending, and is preceded by just 3 letters).\n *\n * @param {string} word     The word for which to delete the suffix.\n * @param {number} index2   The index of the suffix found in step 2.\n * @param {number} r1Index  The R1 index.\n *\n * @returns {string} The word with the deleted suffix.\n */\nconst deleteSuffix2 = function( word, index2, r1Index ) {\n\tif ( index2 !== 10000 && r1Index !== -1 ) {\n\t\tif ( index2 >= r1Index ) {\n\t\t\tword = word.substring( 0, index2 );\n\t\t}\n\t}\n\treturn word;\n};\n\n\n/**\n * Stems irregular verbs.\n *\n * @param {Object} morphologyDataVerbs  The German morphology data for verbs.\n * @param {string} word                 The word to stem.\n *\n * @returns {string} The stemmed word.\n */\nconst stemIrregularVerbs = function( morphologyDataVerbs, word ) {\n\tconst irregularVerbs = morphologyDataVerbs.veryIrregularVerbs;\n\n\tconst matchedParadigm = irregularVerbs.find( paradigm => {\n\t\tconst forms = paradigm.forms;\n\t\treturn forms.includes( word );\n\t} );\n\n\tif ( matchedParadigm ) {\n\t\treturn matchedParadigm.stem;\n\t}\n\n\treturn null;\n};\n\n/**\n * Stems German words.\n *\n * @param {Object} morphologyDataVerbs  The German morphology data for verbs.\n * @param {string} word                 The word to stem.\n *\n * @returns {string} The stemmed word.\n */\nexport default function stem( morphologyDataVerbs, word ) {\n\t// Check if word is a very irregular verb, and if so, return its stem.\n\tconst veryIrregularVerbStem = stemIrregularVerbs( morphologyDataVerbs, word );\n\n\tif ( veryIrregularVerbStem ) {\n\t\treturn veryIrregularVerbStem;\n\t}\n\n\t// Put u and y between vowels into upper case.\n\tword = word.replace( /([aeiouyäöü])u([aeiouyäöü])/g, \"$1U$2\" );\n\tword = word.replace( /([aeiouyäöü])y([aeiouyäöü])/g, \"$1Y$2\" );\n\tword = word.replace( /([aeiouyäöü])i([aeiouyäöü])/g, \"$1I$2\" );\n\tword = word.replace( /([aeiouyäöü])e([aeiouyäöü])/g, \"$1E$2\" );\n\n\t// Find the start index of the R1 region.\n\tconst r1Index = determineR1( word );\n\n\t// Find suffixes as defined in step 1.\n\tconst index1 = findSuffixStep1( word ).index1;\n\tconst optionUsed1 = findSuffixStep1( word ).optionUsed1;\n\n\t// Delete the suffix found in step 1.\n\tword = deleteSuffix1( word, index1, optionUsed1, r1Index );\n\n\t// Find suffixes as defined in step 2.\n\tconst index2 = findSuffixStep2( word );\n\n\t// Delete the suffix found in step 2.\n\tword = deleteSuffix2( word, index2, r1Index );\n\n\t// Turn U and Y back into lower case.\n\tword = word.replace( /U/g, \"u\" );\n\tword = word.replace( /Y/g, \"y\" );\n\tword = word.replace( /I/g, \"i\" );\n\tword = word.replace( /E/g, \"e\" );\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,MAAMA,WAAW,GAAG,SAAAA,CAAUC,IAAI,EAAG;EACpC;EACA,IAAIC,OAAO,GAAGD,IAAI,CAACE,MAAM,CAAE,yBAA0B,CAAC;EACtD;EACA,IAAKD,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBA,OAAO,IAAI,CAAC;EACb;;EAEA;EACA,IAAKA,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,GAAG,CAAC,EAAG;IACpCA,OAAO,GAAG,CAAC;EACZ;EAEA,OAAOA,OAAO;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,eAAe,GAAG,SAAAA,CAAUH,IAAI,EAAG;EACxC,MAAMI,OAAO,GAAGJ,IAAI,CAACE,MAAM,CAAE,eAAgB,CAAC;EAC9C,MAAMG,OAAO,GAAGL,IAAI,CAACE,MAAM,CAAE,aAAc,CAAC;EAC5C,IAAII,OAAO,GAAGN,IAAI,CAACE,MAAM,CAAE,oBAAqB,CAAC;EACjD;EACA,IAAKI,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBA,OAAO,EAAE;EACV;EACA,IAAIC,WAAW,GAAG,EAAE;EACpB,IAAIC,MAAM,GAAG,KAAK;EAClB,IAAKJ,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBG,WAAW,GAAG,GAAG;IACjBC,MAAM,GAAGJ,OAAO;IAEhB,OAAO;MAAEI,MAAM;MAAED;IAAY,CAAC;EAC/B,CAAC,MAAM,IAAKF,OAAO,KAAK,CAAC,CAAC,EAAG;IAC5BE,WAAW,GAAG,GAAG;IACjBC,MAAM,GAAGH,OAAO;IAEhB,OAAO;MAAEG,MAAM;MAAED;IAAY,CAAC;EAC/B,CAAC,MAAM,IAAKD,OAAO,KAAK,CAAC,CAAC,EAAG;IAC5BC,WAAW,GAAG,GAAG;IACjBC,MAAM,GAAGF,OAAO;IAEhB,OAAO;MAAEE,MAAM;MAAED;IAAY,CAAC;EAC/B;EAEA,OAAO;IAAEC,MAAM;IAAED;EAAY,CAAC;AAC/B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,eAAe,GAAG,SAAAA,CAAUT,IAAI,EAAG;EACxC,MAAMU,OAAO,GAAGV,IAAI,CAACE,MAAM,CAAE,eAAgB,CAAC;EAC9C,IAAIS,OAAO,GAAGX,IAAI,CAACE,MAAM,CAAE,wBAAyB,CAAC;EACrD;EACA,IAAKS,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBA,OAAO,IAAI,CAAC;EACb;EACA,IAAIC,MAAM,GAAG,KAAK;EAClB,IAAKF,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBE,MAAM,GAAGF,OAAO;EACjB,CAAC,MAAM,IAAKC,OAAO,KAAK,CAAC,CAAC,EAAI;IAC7BC,MAAM,GAAGD,OAAO;EACjB;EAEA,OAAOC,MAAM;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,aAAa,GAAG,SAAAA,CAAUb,IAAI,EAAEQ,MAAM,EAAED,WAAW,EAAEN,OAAO,EAAG;EACpE,IAAKO,MAAM,KAAK,KAAK,IAAIP,OAAO,KAAK,CAAC,CAAC,EAAG;IACzC,IAAKO,MAAM,IAAIP,OAAO,EAAG;MACxBD,IAAI,GAAGA,IAAI,CAACc,SAAS,CAAE,CAAC,EAAEN,MAAO,CAAC;MAClC,IAAKD,WAAW,KAAK,GAAG,EAAG;QAC1B,IAAKP,IAAI,CAACE,MAAM,CAAE,OAAQ,CAAC,KAAK,CAAC,CAAC,EAAG;UACpCF,IAAI,GAAGA,IAAI,CAACc,SAAS,CAAE,CAAC,EAAEd,IAAI,CAACe,MAAM,GAAG,CAAE,CAAC;QAC5C;MACD;IACD;EACD;EACA,OAAOf,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMgB,aAAa,GAAG,SAAAA,CAAUhB,IAAI,EAAEY,MAAM,EAAEX,OAAO,EAAG;EACvD,IAAKW,MAAM,KAAK,KAAK,IAAIX,OAAO,KAAK,CAAC,CAAC,EAAG;IACzC,IAAKW,MAAM,IAAIX,OAAO,EAAG;MACxBD,IAAI,GAAGA,IAAI,CAACc,SAAS,CAAE,CAAC,EAAEF,MAAO,CAAC;IACnC;EACD;EACA,OAAOZ,IAAI;AACZ,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMiB,kBAAkB,GAAG,SAAAA,CAAUC,mBAAmB,EAAElB,IAAI,EAAG;EAChE,MAAMmB,cAAc,GAAGD,mBAAmB,CAACE,kBAAkB;EAE7D,MAAMC,eAAe,GAAGF,cAAc,CAACG,IAAI,CAAEC,QAAQ,IAAI;IACxD,MAAMC,KAAK,GAAGD,QAAQ,CAACC,KAAK;IAC5B,OAAOA,KAAK,CAACC,QAAQ,CAAEzB,IAAK,CAAC;EAC9B,CAAE,CAAC;EAEH,IAAKqB,eAAe,EAAG;IACtB,OAAOA,eAAe,CAACK,IAAI;EAC5B;EAEA,OAAO,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACe,SAASA,IAAIA,CAAER,mBAAmB,EAAElB,IAAI,EAAG;EACzD;EACA,MAAM2B,qBAAqB,GAAGV,kBAAkB,CAAEC,mBAAmB,EAAElB,IAAK,CAAC;EAE7E,IAAK2B,qBAAqB,EAAG;IAC5B,OAAOA,qBAAqB;EAC7B;;EAEA;EACA3B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,8BAA8B,EAAE,OAAQ,CAAC;EAC9D5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,8BAA8B,EAAE,OAAQ,CAAC;EAC9D5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,8BAA8B,EAAE,OAAQ,CAAC;EAC9D5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,8BAA8B,EAAE,OAAQ,CAAC;;EAE9D;EACA,MAAM3B,OAAO,GAAGF,WAAW,CAAEC,IAAK,CAAC;;EAEnC;EACA,MAAMQ,MAAM,GAAGL,eAAe,CAAEH,IAAK,CAAC,CAACQ,MAAM;EAC7C,MAAMD,WAAW,GAAGJ,eAAe,CAAEH,IAAK,CAAC,CAACO,WAAW;;EAEvD;EACAP,IAAI,GAAGa,aAAa,CAAEb,IAAI,EAAEQ,MAAM,EAAED,WAAW,EAAEN,OAAQ,CAAC;;EAE1D;EACA,MAAMW,MAAM,GAAGH,eAAe,CAAET,IAAK,CAAC;;EAEtC;EACAA,IAAI,GAAGgB,aAAa,CAAEhB,IAAI,EAAEY,MAAM,EAAEX,OAAQ,CAAC;;EAE7C;EACAD,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,IAAI,EAAE,GAAI,CAAC;EAChC5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,IAAI,EAAE,GAAI,CAAC;EAChC5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,IAAI,EAAE,GAAI,CAAC;EAChC5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,IAAI,EAAE,GAAI,CAAC;EAEhC,OAAO5B,IAAI;AACZ","ignoreList":[]}
+{"version":3,"file":"stem.js","names":["determineR1","word","r1Index","search","findSuffixStep1","a1Index","b1Index","c1Index","optionUsed1","index1","findSuffixStep2","a2Index","b2Index","index2","deleteSuffix1","substring","length","deleteSuffix2","stemIrregularVerbs","morphologyDataVerbs","irregularVerbs","veryIrregularVerbs","matchedParadigm","find","paradigm","forms","includes","stem","veryIrregularVerbStem","replace"],"sources":["../../../../../../src/languageProcessing/languages/de/helpers/internal/stem.js"],"sourcesContent":["/**\n * @file German stemming algorithm. Adapted from:\n * @author: Joder Illi\n * @copyright (c) 2010, FormBlitz AG\n * All rights reserved.\n * Implementation of the stemming algorithm from http://snowball.tartarus.org/algorithms/german/stemmer.html\n * Copyright of the algorithm is: Copyright (c) 2001, Dr Martin Porter and can be found at http://snowball.tartarus.org/license.php\n *\n * Redistribution and use in source and binary forms, with or without modification, is covered by the standard BSD license.\n */\n/**\n * Determines the start index of the R1 region.\n * R1 is the region after the first non-vowel following a vowel. It should include at least 3 letters.\n *\n * @param {string} word The word for which to determine the R1 region.\n * @returns {number} The start index of the R1 region.\n */\nconst determineR1 = function( word ) {\n\t// Start with matching first vowel and non-vowel.\n\tlet r1Index = word.search( /[aeiouyäöü][^aeiouyäöü]/ );\n\t// Then add 2 since the R1 index is the index after the first vowel & non-vowel matched with the regex.\n\tif ( r1Index !== -1 ) {\n\t\tr1Index += 2;\n\t}\n\n\t// Adjust R1 so that the region preceding it includes at least 3 letters.\n\tif ( r1Index !== -1 && r1Index < 3 ) {\n\t\tr1Index = 3;\n\t}\n\n\treturn r1Index;\n};\n\n/**\n * Search for the longest among the following suffixes,\n * (a) em   ern   er\n * (b) e   en   es\n * (c) s (preceded by a valid s-ending)\n * Define a valid s-ending as one of b, d, f, g, h, k, l, m, n, r or t.\n *\n * @param {string} word The word to check for the suffix.\n * @returns {{index1: number, optionUsed1: string}} The index of the suffix and the kind of suffix used.\n */\nconst findSuffixStep1 = function( word ) {\n\tconst a1Index = word.search( /(em|ern|er)$/g );\n\tconst b1Index = word.search( /(e|en|es)$/g );\n\tlet c1Index = word.search( /([bdfghklmnrt]s)$/g );\n\t// Exclude the s-ending before the s.\n\tif ( c1Index !== -1 ) {\n\t\tc1Index++;\n\t}\n\tlet optionUsed1 = \"\";\n\tlet index1 = 10000;\n\tif ( a1Index !== -1 ) {\n\t\toptionUsed1 = \"a\";\n\t\tindex1 = a1Index;\n\n\t\treturn { index1, optionUsed1 };\n\t} else if ( b1Index !== -1 ) {\n\t\toptionUsed1 = \"b\";\n\t\tindex1 = b1Index;\n\n\t\treturn { index1, optionUsed1 };\n\t} else if ( c1Index !== -1 ) {\n\t\toptionUsed1 = \"c\";\n\t\tindex1 = c1Index;\n\n\t\treturn { index1, optionUsed1 };\n\t}\n\n\treturn { index1, optionUsed1 };\n};\n\n/**\n * Search for the longest among the following suffixes,\n * (a) en   er   est\n * (b) st (preceded by a valid st-ending, itself preceded by at least 3 letters)\n * Define a valid st-ending as one of b, d, f, g, h, k, l, m, n or t.\n *\n * @param {string} word The word to check for the suffix.\n * @returns {number} The index of the suffix.\n */\nconst findSuffixStep2 = function( word ) {\n\tconst a2Index = word.search( /(en|er|est)$/g );\n\tlet b2Index = word.search( /(.{3}[bdfghklmnt]st)$/g );\n\t// Exclude the st-ending and the preceding 3 letters.\n\tif ( b2Index !== -1 ) {\n\t\tb2Index += 4;\n\t}\n\tlet index2 = 10000;\n\tif ( a2Index !== -1 ) {\n\t\tindex2 = a2Index;\n\t} else if ( b2Index !== -1  ) {\n\t\tindex2 = b2Index;\n\t}\n\n\treturn index2;\n};\n\n/**\n * Delete the suffix found in step 1 if in R1. (The letter of the valid s-ending is not necessarily in R1.)\n * If an ending of group (b) is deleted, and the ending is preceded by niss, delete the final s.\n * (For example, äckern -> äck, ackers -> acker, armes -> arm, bedürfnissen -> bedürfnis).\n *\n * @param {string} word         The word for which to delete the suffix.\n * @param {number} index1       The index of the suffix found in step 1.\n * @param {string} optionUsed1  The type of the suffix found in step 1.\n * @param {number} r1Index      The R1 index.\n *\n * @returns {string} The word with the deleted suffix.\n */\nconst deleteSuffix1 = function( word, index1, optionUsed1, r1Index ) {\n\tif ( index1 !== 10000 && r1Index !== -1 ) {\n\t\tif ( index1 >= r1Index ) {\n\t\t\tword = word.substring( 0, index1 );\n\t\t\tif ( optionUsed1 === \"b\" ) {\n\t\t\t\tif ( word.search( /niss$/ ) !== -1 ) {\n\t\t\t\t\tword = word.substring( 0, word.length - 1 );\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn word;\n};\n\n/**\n * Delete the suffix found in step 2 if in R1.\n * (For example, derbsten -> derbst by step 1, and derbst -> derb by step 2,\n * since b is a valid st-ending, and is preceded by just 3 letters).\n *\n * @param {string} word     The word for which to delete the suffix.\n * @param {number} index2   The index of the suffix found in step 2.\n * @param {number} r1Index  The R1 index.\n *\n * @returns {string} The word with the deleted suffix.\n */\nconst deleteSuffix2 = function( word, index2, r1Index ) {\n\tif ( index2 !== 10000 && r1Index !== -1 ) {\n\t\tif ( index2 >= r1Index ) {\n\t\t\tword = word.substring( 0, index2 );\n\t\t}\n\t}\n\treturn word;\n};\n\n\n/**\n * Stems irregular verbs.\n *\n * @param {Object} morphologyDataVerbs  The German morphology data for verbs.\n * @param {string} word                 The word to stem.\n *\n * @returns {string} The stemmed word.\n */\nconst stemIrregularVerbs = function( morphologyDataVerbs, word ) {\n\tconst irregularVerbs = morphologyDataVerbs.veryIrregularVerbs;\n\n\tconst matchedParadigm = irregularVerbs.find( paradigm => {\n\t\tconst forms = paradigm.forms;\n\t\treturn forms.includes( word );\n\t} );\n\n\tif ( matchedParadigm ) {\n\t\treturn matchedParadigm.stem;\n\t}\n\n\treturn null;\n};\n\n/**\n * Stems German words.\n *\n * @param {Object} morphologyDataVerbs  The German morphology data for verbs.\n * @param {string} word                 The word to stem.\n *\n * @returns {string} The stemmed word.\n */\nexport default function stem( morphologyDataVerbs, word ) {\n\t// Check if word is a very irregular verb, and if so, return its stem.\n\tconst veryIrregularVerbStem = stemIrregularVerbs( morphologyDataVerbs, word );\n\n\tif ( veryIrregularVerbStem ) {\n\t\treturn veryIrregularVerbStem;\n\t}\n\n\t// Put u and y between vowels into upper case.\n\tword = word.replace( /([aeiouyäöü])u([aeiouyäöü])/g, \"$1U$2\" );\n\tword = word.replace( /([aeiouyäöü])y([aeiouyäöü])/g, \"$1Y$2\" );\n\tword = word.replace( /([aeiouyäöü])i([aeiouyäöü])/g, \"$1I$2\" );\n\tword = word.replace( /([aeiouyäöü])e([aeiouyäöü])/g, \"$1E$2\" );\n\n\t// Find the start index of the R1 region.\n\tconst r1Index = determineR1( word );\n\n\t// Find suffixes as defined in step 1.\n\tconst index1 = findSuffixStep1( word ).index1;\n\tconst optionUsed1 = findSuffixStep1( word ).optionUsed1;\n\n\t// Delete the suffix found in step 1.\n\tword = deleteSuffix1( word, index1, optionUsed1, r1Index );\n\n\t// Find suffixes as defined in step 2.\n\tconst index2 = findSuffixStep2( word );\n\n\t// Delete the suffix found in step 2.\n\tword = deleteSuffix2( word, index2, r1Index );\n\n\t// Turn U and Y back into lower case.\n\tword = word.replace( /U/g, \"u\" );\n\tword = word.replace( /Y/g, \"y\" );\n\tword = word.replace( /I/g, \"i\" );\n\tword = word.replace( /E/g, \"e\" );\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,MAAMA,WAAW,GAAG,SAAAA,CAAUC,IAAI,EAAG;EACpC;EACA,IAAIC,OAAO,GAAGD,IAAI,CAACE,MAAM,CAAE,yBAA0B,CAAC;EACtD;EACA,IAAKD,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBA,OAAO,IAAI,CAAC;EACb;;EAEA;EACA,IAAKA,OAAO,KAAK,CAAC,CAAC,IAAIA,OAAO,GAAG,CAAC,EAAG;IACpCA,OAAO,GAAG,CAAC;EACZ;EAEA,OAAOA,OAAO;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,eAAe,GAAG,SAAAA,CAAUH,IAAI,EAAG;EACxC,MAAMI,OAAO,GAAGJ,IAAI,CAACE,MAAM,CAAE,eAAgB,CAAC;EAC9C,MAAMG,OAAO,GAAGL,IAAI,CAACE,MAAM,CAAE,aAAc,CAAC;EAC5C,IAAII,OAAO,GAAGN,IAAI,CAACE,MAAM,CAAE,oBAAqB,CAAC;EACjD;EACA,IAAKI,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBA,OAAO,EAAE;EACV;EACA,IAAIC,WAAW,GAAG,EAAE;EACpB,IAAIC,MAAM,GAAG,KAAK;EAClB,IAAKJ,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBG,WAAW,GAAG,GAAG;IACjBC,MAAM,GAAGJ,OAAO;IAEhB,OAAO;MAAEI,MAAM;MAAED;IAAY,CAAC;EAC/B,CAAC,MAAM,IAAKF,OAAO,KAAK,CAAC,CAAC,EAAG;IAC5BE,WAAW,GAAG,GAAG;IACjBC,MAAM,GAAGH,OAAO;IAEhB,OAAO;MAAEG,MAAM;MAAED;IAAY,CAAC;EAC/B,CAAC,MAAM,IAAKD,OAAO,KAAK,CAAC,CAAC,EAAG;IAC5BC,WAAW,GAAG,GAAG;IACjBC,MAAM,GAAGF,OAAO;IAEhB,OAAO;MAAEE,MAAM;MAAED;IAAY,CAAC;EAC/B;EAEA,OAAO;IAAEC,MAAM;IAAED;EAAY,CAAC;AAC/B,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,eAAe,GAAG,SAAAA,CAAUT,IAAI,EAAG;EACxC,MAAMU,OAAO,GAAGV,IAAI,CAACE,MAAM,CAAE,eAAgB,CAAC;EAC9C,IAAIS,OAAO,GAAGX,IAAI,CAACE,MAAM,CAAE,wBAAyB,CAAC;EACrD;EACA,IAAKS,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBA,OAAO,IAAI,CAAC;EACb;EACA,IAAIC,MAAM,GAAG,KAAK;EAClB,IAAKF,OAAO,KAAK,CAAC,CAAC,EAAG;IACrBE,MAAM,GAAGF,OAAO;EACjB,CAAC,MAAM,IAAKC,OAAO,KAAK,CAAC,CAAC,EAAI;IAC7BC,MAAM,GAAGD,OAAO;EACjB;EAEA,OAAOC,MAAM;AACd,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,aAAa,GAAG,SAAAA,CAAUb,IAAI,EAAEQ,MAAM,EAAED,WAAW,EAAEN,OAAO,EAAG;EACpE,IAAKO,MAAM,KAAK,KAAK,IAAIP,OAAO,KAAK,CAAC,CAAC,EAAG;IACzC,IAAKO,MAAM,IAAIP,OAAO,EAAG;MACxBD,IAAI,GAAGA,IAAI,CAACc,SAAS,CAAE,CAAC,EAAEN,MAAO,CAAC;MAClC,IAAKD,WAAW,KAAK,GAAG,EAAG;QAC1B,IAAKP,IAAI,CAACE,MAAM,CAAE,OAAQ,CAAC,KAAK,CAAC,CAAC,EAAG;UACpCF,IAAI,GAAGA,IAAI,CAACc,SAAS,CAAE,CAAC,EAAEd,IAAI,CAACe,MAAM,GAAG,CAAE,CAAC;QAC5C;MACD;IACD;EACD;EACA,OAAOf,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMgB,aAAa,GAAG,SAAAA,CAAUhB,IAAI,EAAEY,MAAM,EAAEX,OAAO,EAAG;EACvD,IAAKW,MAAM,KAAK,KAAK,IAAIX,OAAO,KAAK,CAAC,CAAC,EAAG;IACzC,IAAKW,MAAM,IAAIX,OAAO,EAAG;MACxBD,IAAI,GAAGA,IAAI,CAACc,SAAS,CAAE,CAAC,EAAEF,MAAO,CAAC;IACnC;EACD;EACA,OAAOZ,IAAI;AACZ,CAAC;;AAGD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMiB,kBAAkB,GAAG,SAAAA,CAAUC,mBAAmB,EAAElB,IAAI,EAAG;EAChE,MAAMmB,cAAc,GAAGD,mBAAmB,CAACE,kBAAkB;EAE7D,MAAMC,eAAe,GAAGF,cAAc,CAACG,IAAI,CAAEC,QAAQ,IAAI;IACxD,MAAMC,KAAK,GAAGD,QAAQ,CAACC,KAAK;IAC5B,OAAOA,KAAK,CAACC,QAAQ,CAAEzB,IAAK,CAAC;EAC9B,CAAE,CAAC;EAEH,IAAKqB,eAAe,EAAG;IACtB,OAAOA,eAAe,CAACK,IAAI;EAC5B;EAEA,OAAO,IAAI;AACZ,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,SAASA,IAAIA,CAAER,mBAAmB,EAAElB,IAAI,EAAG;EACzD;EACA,MAAM2B,qBAAqB,GAAGV,kBAAkB,CAAEC,mBAAmB,EAAElB,IAAK,CAAC;EAE7E,IAAK2B,qBAAqB,EAAG;IAC5B,OAAOA,qBAAqB;EAC7B;;EAEA;EACA3B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,8BAA8B,EAAE,OAAQ,CAAC;EAC9D5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,8BAA8B,EAAE,OAAQ,CAAC;EAC9D5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,8BAA8B,EAAE,OAAQ,CAAC;EAC9D5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,8BAA8B,EAAE,OAAQ,CAAC;;EAE9D;EACA,MAAM3B,OAAO,GAAGF,WAAW,CAAEC,IAAK,CAAC;;EAEnC;EACA,MAAMQ,MAAM,GAAGL,eAAe,CAAEH,IAAK,CAAC,CAACQ,MAAM;EAC7C,MAAMD,WAAW,GAAGJ,eAAe,CAAEH,IAAK,CAAC,CAACO,WAAW;;EAEvD;EACAP,IAAI,GAAGa,aAAa,CAAEb,IAAI,EAAEQ,MAAM,EAAED,WAAW,EAAEN,OAAQ,CAAC;;EAE1D;EACA,MAAMW,MAAM,GAAGH,eAAe,CAAET,IAAK,CAAC;;EAEtC;EACAA,IAAI,GAAGgB,aAAa,CAAEhB,IAAI,EAAEY,MAAM,EAAEX,OAAQ,CAAC;;EAE7C;EACAD,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,IAAI,EAAE,GAAI,CAAC;EAChC5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,IAAI,EAAE,GAAI,CAAC;EAChC5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,IAAI,EAAE,GAAI,CAAC;EAChC5B,IAAI,GAAGA,IAAI,CAAC4B,OAAO,CAAE,IAAI,EAAE,GAAI,CAAC;EAEhC,OAAO5B,IAAI;AACZ","ignoreList":[]}

package/build/languageProcessing/languages/de/helpers/memoizedSentenceTokenizer.js

@@ -1,12 +1,6 @@
-"use strict";
+import { memoize } from "lodash";
+import SentenceTokenizer from "./internal/SentenceTokenizer";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
-var _lodash = require("lodash");
-var _SentenceTokenizer = _interopRequireDefault(require("./internal/SentenceTokenizer"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
 /**
  * Returns the sentences from a certain text.
  *
@@ -16,7 +10,7 @@ function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e
  * @returns {Array<string>} The list of sentences in the text.
  */
 function getSentenceTokenizer(text, trimSentences = true) {
-  const sentenceTokenizer = new _SentenceTokenizer.default();
+  const sentenceTokenizer = new SentenceTokenizer();
   const {
     tokenizer,
     tokens
@@ -33,5 +27,5 @@ function getSentenceTokenizer(text, trimSentences = true) {
  * We want to re-run the getSentenceTokenizer function also when only the second argument changes to prevent cache collisions.
  * @see https://lodash.com/docs/4.17.15#memoize
  */
-var _default = exports.default = (0, _lodash.memoize)(getSentenceTokenizer, (...args) => JSON.stringify(args));
+export default memoize(getSentenceTokenizer, (...args) => JSON.stringify(args));
 //# sourceMappingURL=memoizedSentenceTokenizer.js.map

package/build/languageProcessing/languages/de/helpers/memoizedSentenceTokenizer.js.map

@@ -1 +1 @@
-{"version":3,"file":"memoizedSentenceTokenizer.js","names":["_lodash","require","_SentenceTokenizer","_interopRequireDefault","e","__esModule","default","getSentenceTokenizer","text","trimSentences","sentenceTokenizer","SentenceTokenizer","tokenizer","tokens","createTokenizer","tokenize","length","getSentencesFromTokens","_default","exports","memoize","args","JSON","stringify"],"sources":["../../../../../src/languageProcessing/languages/de/helpers/memoizedSentenceTokenizer.js"],"sourcesContent":["import { memoize } from \"lodash\";\nimport SentenceTokenizer from \"./internal/SentenceTokenizer\";\n\n/**\n * Returns the sentences from a certain text.\n *\n * @param {string} text \t\t\t\t\tThe text to retrieve sentences from.\n * @param {boolean} [trimSentences=true] \tWhether to trim whitespace from the beginning and end of the sentences or not.\n *\n * @returns {Array<string>} The list of sentences in the text.\n */\nfunction getSentenceTokenizer( text, trimSentences = true ) {\n\tconst sentenceTokenizer = new SentenceTokenizer();\n\tconst { tokenizer, tokens } = sentenceTokenizer.createTokenizer();\n\tsentenceTokenizer.tokenize( tokenizer, text );\n\n\treturn ( tokens.length === 0 ? [] : sentenceTokenizer.getSentencesFromTokens( tokens, trimSentences ) );\n}\n\n/*\n * The second argument to the memoize function is a so-called resolver function.\n * It creates a cache key consisting of a combination of all arguments to a function.\n * This is needed because by default, only the first argument to a function is used as the map cache key by the memoize function.\n * This means that a function is only re-run if the value of the first argument changes.\n * We want to re-run the getSentenceTokenizer function also when only the second argument changes to prevent cache collisions.\n * @see https://lodash.com/docs/4.17.15#memoize\n */\nexport default memoize( getSentenceTokenizer, ( ...args ) => JSON.stringify( args ) );\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AACA,IAAAC,kBAAA,GAAAC,sBAAA,CAAAF,OAAA;AAA6D,SAAAE,uBAAAC,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAE7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASG,oBAAoBA,CAAEC,IAAI,EAAEC,aAAa,GAAG,IAAI,EAAG;EAC3D,MAAMC,iBAAiB,GAAG,IAAIC,0BAAiB,CAAC,CAAC;EACjD,MAAM;IAAEC,SAAS;IAAEC;EAAO,CAAC,GAAGH,iBAAiB,CAACI,eAAe,CAAC,CAAC;EACjEJ,iBAAiB,CAACK,QAAQ,CAAEH,SAAS,EAAEJ,IAAK,CAAC;EAE7C,OAASK,MAAM,CAACG,MAAM,KAAK,CAAC,GAAG,EAAE,GAAGN,iBAAiB,CAACO,sBAAsB,CAAEJ,MAAM,EAAEJ,aAAc,CAAC;AACtG;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAPA,IAAAS,QAAA,GAAAC,OAAA,CAAAb,OAAA,GAQe,IAAAc,eAAO,EAAEb,oBAAoB,EAAE,CAAE,GAAGc,IAAI,KAAMC,IAAI,CAACC,SAAS,CAAEF,IAAK,CAAE,CAAC","ignoreList":[]}
+{"version":3,"file":"memoizedSentenceTokenizer.js","names":["memoize","SentenceTokenizer","getSentenceTokenizer","text","trimSentences","sentenceTokenizer","tokenizer","tokens","createTokenizer","tokenize","length","getSentencesFromTokens","args","JSON","stringify"],"sources":["../../../../../src/languageProcessing/languages/de/helpers/memoizedSentenceTokenizer.js"],"sourcesContent":["import { memoize } from \"lodash\";\nimport SentenceTokenizer from \"./internal/SentenceTokenizer\";\n\n/**\n * Returns the sentences from a certain text.\n *\n * @param {string} text \t\t\t\t\tThe text to retrieve sentences from.\n * @param {boolean} [trimSentences=true] \tWhether to trim whitespace from the beginning and end of the sentences or not.\n *\n * @returns {Array<string>} The list of sentences in the text.\n */\nfunction getSentenceTokenizer( text, trimSentences = true ) {\n\tconst sentenceTokenizer = new SentenceTokenizer();\n\tconst { tokenizer, tokens } = sentenceTokenizer.createTokenizer();\n\tsentenceTokenizer.tokenize( tokenizer, text );\n\n\treturn ( tokens.length === 0 ? [] : sentenceTokenizer.getSentencesFromTokens( tokens, trimSentences ) );\n}\n\n/*\n * The second argument to the memoize function is a so-called resolver function.\n * It creates a cache key consisting of a combination of all arguments to a function.\n * This is needed because by default, only the first argument to a function is used as the map cache key by the memoize function.\n * This means that a function is only re-run if the value of the first argument changes.\n * We want to re-run the getSentenceTokenizer function also when only the second argument changes to prevent cache collisions.\n * @see https://lodash.com/docs/4.17.15#memoize\n */\nexport default memoize( getSentenceTokenizer, ( ...args ) => JSON.stringify( args ) );\n"],"mappings":"AAAA,SAASA,OAAO,QAAQ,QAAQ;AAChC,OAAOC,iBAAiB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAASC,oBAAoBA,CAAEC,IAAI,EAAEC,aAAa,GAAG,IAAI,EAAG;EAC3D,MAAMC,iBAAiB,GAAG,IAAIJ,iBAAiB,CAAC,CAAC;EACjD,MAAM;IAAEK,SAAS;IAAEC;EAAO,CAAC,GAAGF,iBAAiB,CAACG,eAAe,CAAC,CAAC;EACjEH,iBAAiB,CAACI,QAAQ,CAAEH,SAAS,EAAEH,IAAK,CAAC;EAE7C,OAASI,MAAM,CAACG,MAAM,KAAK,CAAC,GAAG,EAAE,GAAGL,iBAAiB,CAACM,sBAAsB,CAAEJ,MAAM,EAAEH,aAAc,CAAC;AACtG;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAeJ,OAAO,CAAEE,oBAAoB,EAAE,CAAE,GAAGU,IAAI,KAAMC,IAAI,CAACC,SAAS,CAAEF,IAAK,CAAE,CAAC","ignoreList":[]}

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

@@ -1,19 +1,9 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
-var _lodash = require("lodash");
-var _index = require("../../../index");
-var _getParticiples = _interopRequireDefault(require("../helpers/internal/getParticiples"));
-var _exceptionsParticiplesActive = _interopRequireDefault(require("../config/internal/exceptionsParticiplesActive.js"));
-var _passiveVoiceAuxiliaries = require("../config/internal/passiveVoiceAuxiliaries.js");
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+import { includes, map } from 'lodash';
+import { languageProcessing } from "../../../../index.js";
 const {
   indices,
   values
-} = _index.languageProcessing;
+} = languageProcessing;
 const {
   getIndicesByWord,
   getIndicesByWordList
@@ -21,6 +11,9 @@ const {
 const {
   Clause
 } = values;
+import getParticiples from "../helpers/internal/getParticiples";
+import exceptionsParticiplesActive from "../config/internal/exceptionsParticiplesActive.js";
+import { participleLike as participleLikeAuxiliaries } from "../config/internal/passiveVoiceAuxiliaries.js";
 const exceptionsRegex = /\S+(apparat|arbeit|dienst|haft|halt|keit|kraft|not|pflicht|schaft|schrift|tät|wert|zeit)($|[ \n\r\t.,'()"+-;!?:/»«‹›<>])/gi;
 
 /**
@@ -37,7 +30,7 @@ class GermanClause extends Clause {
    */
   constructor(clauseText, auxiliaries) {
     super(clauseText, auxiliaries);
-    this._participles = (0, _getParticiples.default)(this.getClauseText());
+    this._participles = getParticiples(this.getClauseText());
     this.checkParticiples();
   }
 
@@ -49,7 +42,7 @@ class GermanClause extends Clause {
    */
   checkParticiples() {
     const foundParticiples = this.getParticiples().filter(participle => {
-      return !this.hasNounSuffix(participle) && !(0, _lodash.includes)(_exceptionsParticiplesActive.default, participle) && !this.hasHabenSeinException(participle) && !(0, _lodash.includes)(_passiveVoiceAuxiliaries.participleLike, participle);
+      return !this.hasNounSuffix(participle) && !includes(exceptionsParticiplesActive, participle) && !this.hasHabenSeinException(participle) && !includes(participleLikeAuxiliaries, participle);
     });
     this.setPassive(foundParticiples.length > 0);
   }
@@ -82,10 +75,10 @@ class GermanClause extends Clause {
     if (participleIndices.length === 0 || habenSeinIndices.length === 0) {
       return false;
     }
-    habenSeinIndices = (0, _lodash.map)(habenSeinIndices, 'index');
+    habenSeinIndices = map(habenSeinIndices, 'index');
     const currentParticiple = participleIndices[0];
-    return (0, _lodash.includes)(habenSeinIndices, currentParticiple.index + currentParticiple.match.length + 1);
+    return includes(habenSeinIndices, currentParticiple.index + currentParticiple.match.length + 1);
   }
 }
-var _default = exports.default = GermanClause;
+export default GermanClause;
 //# sourceMappingURL=Clause.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"Clause.js","names":["_lodash","require","_index","_getParticiples","_interopRequireDefault","_exceptionsParticiplesActive","_passiveVoiceAuxiliaries","e","__esModule","default","indices","values","languageProcessing","getIndicesByWord","getIndicesByWordList","Clause","exceptionsRegex","GermanClause","constructor","clauseText","auxiliaries","_participles","getParticiples","getClauseText","checkParticiples","foundParticiples","filter","participle","hasNounSuffix","includes","exceptionsParticiplesActive","hasHabenSeinException","participleLikeAuxiliaries","setPassive","length","match","participleIndices","habenSeinIndices","map","currentParticiple","index","_default","exports"],"sources":["../../../../../src/languageProcessing/languages/de/values/Clause.js"],"sourcesContent":["import {includes, map} from 'lodash';\nimport {languageProcessing} from '../../../index';\nconst {indices, values} = languageProcessing;\nconst {getIndicesByWord, getIndicesByWordList} = indices;\nconst {Clause} = values;\n\nimport getParticiples from '../helpers/internal/getParticiples';\nimport exceptionsParticiplesActive from '../config/internal/exceptionsParticiplesActive.js';\nimport {participleLike as participleLikeAuxiliaries} from '../config/internal/passiveVoiceAuxiliaries.js';\n\nconst exceptionsRegex = /\\S+(apparat|arbeit|dienst|haft|halt|keit|kraft|not|pflicht|schaft|schrift|tät|wert|zeit)($|[ \\n\\r\\t.,'()\"+-;!?:/»«‹›<>])/gi;\n\n/**\n * Creates a Clause object for the German language.\n */\nclass GermanClause extends Clause {\n  /**\n   * Constructor.\n   *\n   * @param {string} clauseText   The text of the clause.\n   * @param {Array} auxiliaries   The auxiliaries.\n   *\n   * @constructor\n   */\n  constructor(clauseText, auxiliaries) {\n    super(clauseText, auxiliaries);\n    this._participles = getParticiples(this.getClauseText());\n    this.checkParticiples();\n  }\n\n  /**\n   * Checks if any exceptions are applicable to this participle that would result in the clause not being passive.\n   * If no exceptions are found, the clause is passive.\n   *\n   * @returns {void}\n   */\n  checkParticiples() {\n    const foundParticiples = this.getParticiples().filter(participle => {\n      return (\n        !this.hasNounSuffix(participle) &&\n        !includes(exceptionsParticiplesActive, participle) &&\n        !this.hasHabenSeinException(participle) &&\n        !includes(participleLikeAuxiliaries, participle)\n      );\n    });\n\n    this.setPassive(foundParticiples.length > 0);\n  }\n\n  /**\n   * Checks whether a found participle ends in a noun suffix.\n   * If a word ends in a noun suffix from the exceptionsRegex, it isn't a participle.\n   *\n   * @param {string} participle   The participle to check.\n   *\n   * @returns {boolean} Returns true if it ends in a noun suffix, otherwise returns false.\n   */\n  hasNounSuffix(participle) {\n    return participle.match(exceptionsRegex) !== null;\n  }\n\n  /**\n   * Checks whether a participle is followed by 'haben' or 'sein'.\n   * If a participle is followed by one of these, the clause is not passive.\n   *\n   * @param {string} participle   The participle to check.\n   *\n   * @returns {boolean} Returns true if it is an exception, otherwise returns false.\n   */\n  hasHabenSeinException(participle) {\n    const participleIndices = getIndicesByWord(participle, this.getClauseText());\n    let habenSeinIndices = getIndicesByWordList(['haben', 'sein'], this.getClauseText());\n\n    // Don't check further if there is no participle or no haben/sein.\n    if (participleIndices.length === 0 || habenSeinIndices.length === 0) {\n      return false;\n    }\n\n    habenSeinIndices = map(habenSeinIndices, 'index');\n    const currentParticiple = participleIndices[0];\n    return includes(habenSeinIndices, currentParticiple.index + currentParticiple.match.length + 1);\n  }\n}\n\nexport default GermanClause;\n"],"mappings":";;;;;;AAAA,IAAAA,OAAA,GAAAC,OAAA;AACA,IAAAC,MAAA,GAAAD,OAAA;AAKA,IAAAE,eAAA,GAAAC,sBAAA,CAAAH,OAAA;AACA,IAAAI,4BAAA,GAAAD,sBAAA,CAAAH,OAAA;AACA,IAAAK,wBAAA,GAAAL,OAAA;AAA0G,SAAAG,uBAAAG,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAN1G,MAAM;EAACG,OAAO;EAAEC;AAAM,CAAC,GAAGC,yBAAkB;AAC5C,MAAM;EAACC,gBAAgB;EAAEC;AAAoB,CAAC,GAAGJ,OAAO;AACxD,MAAM;EAACK;AAAM,CAAC,GAAGJ,MAAM;AAMvB,MAAMK,eAAe,GAAG,4HAA4H;;AAEpJ;AACA;AACA;AACA,MAAMC,YAAY,SAASF,MAAM,CAAC;EAChC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEG,WAAWA,CAACC,UAAU,EAAEC,WAAW,EAAE;IACnC,KAAK,CAACD,UAAU,EAAEC,WAAW,CAAC;IAC9B,IAAI,CAACC,YAAY,GAAG,IAAAC,uBAAc,EAAC,IAAI,CAACC,aAAa,CAAC,CAAC,CAAC;IACxD,IAAI,CAACC,gBAAgB,CAAC,CAAC;EACzB;;EAEA;AACF;AACA;AACA;AACA;AACA;EACEA,gBAAgBA,CAAA,EAAG;IACjB,MAAMC,gBAAgB,GAAG,IAAI,CAACH,cAAc,CAAC,CAAC,CAACI,MAAM,CAACC,UAAU,IAAI;MAClE,OACE,CAAC,IAAI,CAACC,aAAa,CAACD,UAAU,CAAC,IAC/B,CAAC,IAAAE,gBAAQ,EAACC,oCAA2B,EAAEH,UAAU,CAAC,IAClD,CAAC,IAAI,CAACI,qBAAqB,CAACJ,UAAU,CAAC,IACvC,CAAC,IAAAE,gBAAQ,EAACG,uCAAyB,EAAEL,UAAU,CAAC;IAEpD,CAAC,CAAC;IAEF,IAAI,CAACM,UAAU,CAACR,gBAAgB,CAACS,MAAM,GAAG,CAAC,CAAC;EAC9C;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEN,aAAaA,CAACD,UAAU,EAAE;IACxB,OAAOA,UAAU,CAACQ,KAAK,CAACnB,eAAe,CAAC,KAAK,IAAI;EACnD;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEe,qBAAqBA,CAACJ,UAAU,EAAE;IAChC,MAAMS,iBAAiB,GAAGvB,gBAAgB,CAACc,UAAU,EAAE,IAAI,CAACJ,aAAa,CAAC,CAAC,CAAC;IAC5E,IAAIc,gBAAgB,GAAGvB,oBAAoB,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,IAAI,CAACS,aAAa,CAAC,CAAC,CAAC;;IAEpF;IACA,IAAIa,iBAAiB,CAACF,MAAM,KAAK,CAAC,IAAIG,gBAAgB,CAACH,MAAM,KAAK,CAAC,EAAE;MACnE,OAAO,KAAK;IACd;IAEAG,gBAAgB,GAAG,IAAAC,WAAG,EAACD,gBAAgB,EAAE,OAAO,CAAC;IACjD,MAAME,iBAAiB,GAAGH,iBAAiB,CAAC,CAAC,CAAC;IAC9C,OAAO,IAAAP,gBAAQ,EAACQ,gBAAgB,EAAEE,iBAAiB,CAACC,KAAK,GAAGD,iBAAiB,CAACJ,KAAK,CAACD,MAAM,GAAG,CAAC,CAAC;EACjG;AACF;AAAC,IAAAO,QAAA,GAAAC,OAAA,CAAAjC,OAAA,GAEcQ,YAAY","ignoreList":[]}
+{"version":3,"file":"Clause.js","names":["includes","map","languageProcessing","indices","values","getIndicesByWord","getIndicesByWordList","Clause","getParticiples","exceptionsParticiplesActive","participleLike","participleLikeAuxiliaries","exceptionsRegex","GermanClause","constructor","clauseText","auxiliaries","_participles","getClauseText","checkParticiples","foundParticiples","filter","participle","hasNounSuffix","hasHabenSeinException","setPassive","length","match","participleIndices","habenSeinIndices","currentParticiple","index"],"sources":["../../../../../src/languageProcessing/languages/de/values/Clause.js"],"sourcesContent":["import {includes, map} from 'lodash';\nimport {languageProcessing} from '@axyseo/index.js';\nconst {indices, values} = languageProcessing;\nconst {getIndicesByWord, getIndicesByWordList} = indices;\nconst {Clause} = values;\n\nimport getParticiples from '../helpers/internal/getParticiples';\nimport exceptionsParticiplesActive from '../config/internal/exceptionsParticiplesActive.js';\nimport {participleLike as participleLikeAuxiliaries} from '../config/internal/passiveVoiceAuxiliaries.js';\n\nconst exceptionsRegex = /\\S+(apparat|arbeit|dienst|haft|halt|keit|kraft|not|pflicht|schaft|schrift|tät|wert|zeit)($|[ \\n\\r\\t.,'()\"+-;!?:/»«‹›<>])/gi;\n\n/**\n * Creates a Clause object for the German language.\n */\nclass GermanClause extends Clause {\n  /**\n   * Constructor.\n   *\n   * @param {string} clauseText   The text of the clause.\n   * @param {Array} auxiliaries   The auxiliaries.\n   *\n   * @constructor\n   */\n  constructor(clauseText, auxiliaries) {\n    super(clauseText, auxiliaries);\n    this._participles = getParticiples(this.getClauseText());\n    this.checkParticiples();\n  }\n\n  /**\n   * Checks if any exceptions are applicable to this participle that would result in the clause not being passive.\n   * If no exceptions are found, the clause is passive.\n   *\n   * @returns {void}\n   */\n  checkParticiples() {\n    const foundParticiples = this.getParticiples().filter(participle => {\n      return (\n        !this.hasNounSuffix(participle) &&\n        !includes(exceptionsParticiplesActive, participle) &&\n        !this.hasHabenSeinException(participle) &&\n        !includes(participleLikeAuxiliaries, participle)\n      );\n    });\n\n    this.setPassive(foundParticiples.length > 0);\n  }\n\n  /**\n   * Checks whether a found participle ends in a noun suffix.\n   * If a word ends in a noun suffix from the exceptionsRegex, it isn't a participle.\n   *\n   * @param {string} participle   The participle to check.\n   *\n   * @returns {boolean} Returns true if it ends in a noun suffix, otherwise returns false.\n   */\n  hasNounSuffix(participle) {\n    return participle.match(exceptionsRegex) !== null;\n  }\n\n  /**\n   * Checks whether a participle is followed by 'haben' or 'sein'.\n   * If a participle is followed by one of these, the clause is not passive.\n   *\n   * @param {string} participle   The participle to check.\n   *\n   * @returns {boolean} Returns true if it is an exception, otherwise returns false.\n   */\n  hasHabenSeinException(participle) {\n    const participleIndices = getIndicesByWord(participle, this.getClauseText());\n    let habenSeinIndices = getIndicesByWordList(['haben', 'sein'], this.getClauseText());\n\n    // Don't check further if there is no participle or no haben/sein.\n    if (participleIndices.length === 0 || habenSeinIndices.length === 0) {\n      return false;\n    }\n\n    habenSeinIndices = map(habenSeinIndices, 'index');\n    const currentParticiple = participleIndices[0];\n    return includes(habenSeinIndices, currentParticiple.index + currentParticiple.match.length + 1);\n  }\n}\n\nexport default GermanClause;\n"],"mappings":"AAAA,SAAQA,QAAQ,EAAEC,GAAG,QAAO,QAAQ;AACpC,SAAQC,kBAAkB;AAC1B,MAAM;EAACC,OAAO;EAAEC;AAAM,CAAC,GAAGF,kBAAkB;AAC5C,MAAM;EAACG,gBAAgB;EAAEC;AAAoB,CAAC,GAAGH,OAAO;AACxD,MAAM;EAACI;AAAM,CAAC,GAAGH,MAAM;AAEvB,OAAOI,cAAc;AACrB,OAAOC,2BAA2B;AAClC,SAAQC,cAAc,IAAIC,yBAAyB;AAEnD,MAAMC,eAAe,GAAG,4HAA4H;;AAEpJ;AACA;AACA;AACA,MAAMC,YAAY,SAASN,MAAM,CAAC;EAChC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEO,WAAWA,CAACC,UAAU,EAAEC,WAAW,EAAE;IACnC,KAAK,CAACD,UAAU,EAAEC,WAAW,CAAC;IAC9B,IAAI,CAACC,YAAY,GAAGT,cAAc,CAAC,IAAI,CAACU,aAAa,CAAC,CAAC,CAAC;IACxD,IAAI,CAACC,gBAAgB,CAAC,CAAC;EACzB;;EAEA;AACF;AACA;AACA;AACA;AACA;EACEA,gBAAgBA,CAAA,EAAG;IACjB,MAAMC,gBAAgB,GAAG,IAAI,CAACZ,cAAc,CAAC,CAAC,CAACa,MAAM,CAACC,UAAU,IAAI;MAClE,OACE,CAAC,IAAI,CAACC,aAAa,CAACD,UAAU,CAAC,IAC/B,CAACtB,QAAQ,CAACS,2BAA2B,EAAEa,UAAU,CAAC,IAClD,CAAC,IAAI,CAACE,qBAAqB,CAACF,UAAU,CAAC,IACvC,CAACtB,QAAQ,CAACW,yBAAyB,EAAEW,UAAU,CAAC;IAEpD,CAAC,CAAC;IAEF,IAAI,CAACG,UAAU,CAACL,gBAAgB,CAACM,MAAM,GAAG,CAAC,CAAC;EAC9C;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEH,aAAaA,CAACD,UAAU,EAAE;IACxB,OAAOA,UAAU,CAACK,KAAK,CAACf,eAAe,CAAC,KAAK,IAAI;EACnD;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEY,qBAAqBA,CAACF,UAAU,EAAE;IAChC,MAAMM,iBAAiB,GAAGvB,gBAAgB,CAACiB,UAAU,EAAE,IAAI,CAACJ,aAAa,CAAC,CAAC,CAAC;IAC5E,IAAIW,gBAAgB,GAAGvB,oBAAoB,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,IAAI,CAACY,aAAa,CAAC,CAAC,CAAC;;IAEpF;IACA,IAAIU,iBAAiB,CAACF,MAAM,KAAK,CAAC,IAAIG,gBAAgB,CAACH,MAAM,KAAK,CAAC,EAAE;MACnE,OAAO,KAAK;IACd;IAEAG,gBAAgB,GAAG5B,GAAG,CAAC4B,gBAAgB,EAAE,OAAO,CAAC;IACjD,MAAMC,iBAAiB,GAAGF,iBAAiB,CAAC,CAAC,CAAC;IAC9C,OAAO5B,QAAQ,CAAC6B,gBAAgB,EAAEC,iBAAiB,CAACC,KAAK,GAAGD,iBAAiB,CAACH,KAAK,CAACD,MAAM,GAAG,CAAC,CAAC;EACjG;AACF;AAEA,eAAeb,YAAY","ignoreList":[]}

package/build/languageProcessing/languages/el/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 _transitionWords = _interopRequireDefault(require("./config/transitionWords"));
-var _twoPartTransitionWords = _interopRequireDefault(require("./config/twoPartTransitionWords"));
-var _functionWords = _interopRequireDefault(require("./config/functionWords"));
-var _getStemmer = _interopRequireDefault(require("./helpers/getStemmer"));
-var _getClauses = _interopRequireDefault(require("./helpers/getClauses"));
-var _isPassiveSentence = _interopRequireDefault(require("./helpers/isPassiveSentence"));
-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 transitionWords from "./config/transitionWords";
+import twoPartTransitionWords from "./config/twoPartTransitionWords";
+import functionWords from "./config/functionWords";
 
 // All helpers
+import getStemmer from "./helpers/getStemmer";
+import getClauses from "./helpers/getClauses";
+import isPassiveSentence from "./helpers/isPassiveSentence";
 
 /**
  * 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.
@@ -37,19 +30,18 @@ class Researcher extends AbstractResearcher {
     delete this.defaultResearches.getFleschReadingScore;
     Object.assign(this.config, {
       language: 'el',
-      functionWords: _functionWords.default,
+      functionWords,
       passiveConstructionType: 'morphologicalAndPeriphrastic',
-      transitionWords: _transitionWords.default,
-      twoPartTransitionWords: _twoPartTransitionWords.default,
-      firstWordExceptions: _firstWordExceptions.default.firstWords,
-      secondWordExceptions: _firstWordExceptions.default.secondWords
+      transitionWords,
+      twoPartTransitionWords,
+      firstWordExceptions: firstWordExceptions.firstWords,
+      secondWordExceptions: firstWordExceptions.secondWords
     });
     Object.assign(this.helpers, {
-      getStemmer: _getStemmer.default,
-      getClauses: _getClauses.default,
-      isPassiveSentence: _isPassiveSentence.default
+      getStemmer,
+      getClauses,
+      isPassiveSentence
     });
   }
 }
-exports.default = Researcher;
 //# sourceMappingURL=Researcher.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"Researcher.js","names":["_index","require","_firstWordExceptions","_interopRequireDefault","_transitionWords","_twoPartTransitionWords","_functionWords","_getStemmer","_getClauses","_isPassiveSentence","e","__esModule","default","AbstractResearcher","languageProcessing","Researcher","constructor","paper","defaultResearches","getFleschReadingScore","Object","assign","config","language","functionWords","passiveConstructionType","transitionWords","twoPartTransitionWords","firstWordExceptions","firstWords","secondWordExceptions","secondWords","helpers","getStemmer","getClauses","isPassiveSentence","exports"],"sources":["../../../../src/languageProcessing/languages/el/Researcher.js"],"sourcesContent":["import {languageProcessing} from '../../../index';\nconst {AbstractResearcher} = languageProcessing;\n\n// All config\nimport firstWordExceptions from './config/firstWordExceptions';\nimport transitionWords from './config/transitionWords';\nimport twoPartTransitionWords from './config/twoPartTransitionWords';\nimport functionWords from './config/functionWords';\n\n// All helpers\nimport getStemmer from './helpers/getStemmer';\nimport getClauses from './helpers/getClauses';\nimport isPassiveSentence from './helpers/isPassiveSentence';\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 not available for languages that we haven't supported yet.\n    delete this.defaultResearches.getFleschReadingScore;\n\n    Object.assign(this.config, {\n      language: 'el',\n      functionWords,\n      passiveConstructionType: 'morphologicalAndPeriphrastic',\n      transitionWords,\n      twoPartTransitionWords,\n      firstWordExceptions: firstWordExceptions.firstWords,\n      secondWordExceptions: firstWordExceptions.secondWords\n    });\n\n    Object.assign(this.helpers, {\n      getStemmer,\n      getClauses,\n      isPassiveSentence\n    });\n  }\n}\n"],"mappings":";;;;;;AAAA,IAAAA,MAAA,GAAAC,OAAA;AAIA,IAAAC,oBAAA,GAAAC,sBAAA,CAAAF,OAAA;AACA,IAAAG,gBAAA,GAAAD,sBAAA,CAAAF,OAAA;AACA,IAAAI,uBAAA,GAAAF,sBAAA,CAAAF,OAAA;AACA,IAAAK,cAAA,GAAAH,sBAAA,CAAAF,OAAA;AAGA,IAAAM,WAAA,GAAAJ,sBAAA,CAAAF,OAAA;AACA,IAAAO,WAAA,GAAAL,sBAAA,CAAAF,OAAA;AACA,IAAAQ,kBAAA,GAAAN,sBAAA,CAAAF,OAAA;AAA4D,SAAAE,uBAAAO,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAX5D,MAAM;EAACG;AAAkB,CAAC,GAAGC,yBAAkB;;AAE/C;;AAMA;;AAKA;AACA;AACA;AACe,MAAMC,UAAU,SAASF,kBAAkB,CAAC;EACzD;AACF;AACA;AACA;AACA;EACEG,WAAWA,CAACC,KAAK,EAAE;IACjB,KAAK,CAACA,KAAK,CAAC;;IAEZ;IACA,OAAO,IAAI,CAACC,iBAAiB,CAACC,qBAAqB;IAEnDC,MAAM,CAACC,MAAM,CAAC,IAAI,CAACC,MAAM,EAAE;MACzBC,QAAQ,EAAE,IAAI;MACdC,aAAa,EAAbA,sBAAa;MACbC,uBAAuB,EAAE,8BAA8B;MACvDC,eAAe,EAAfA,wBAAe;MACfC,sBAAsB,EAAtBA,+BAAsB;MACtBC,mBAAmB,EAAEA,4BAAmB,CAACC,UAAU;MACnDC,oBAAoB,EAAEF,4BAAmB,CAACG;IAC5C,CAAC,CAAC;IAEFX,MAAM,CAACC,MAAM,CAAC,IAAI,CAACW,OAAO,EAAE;MAC1BC,UAAU,EAAVA,mBAAU;MACVC,UAAU,EAAVA,mBAAU;MACVC,iBAAiB,EAAjBA;IACF,CAAC,CAAC;EACJ;AACF;AAACC,OAAA,CAAAxB,OAAA,GAAAG,UAAA","ignoreList":[]}
+{"version":3,"file":"Researcher.js","names":["languageProcessing","AbstractResearcher","firstWordExceptions","transitionWords","twoPartTransitionWords","functionWords","getStemmer","getClauses","isPassiveSentence","Researcher","constructor","paper","defaultResearches","getFleschReadingScore","Object","assign","config","language","passiveConstructionType","firstWords","secondWordExceptions","secondWords","helpers"],"sources":["../../../../src/languageProcessing/languages/el/Researcher.js"],"sourcesContent":["import {languageProcessing} from '@axyseo/index.js';\nconst {AbstractResearcher} = languageProcessing;\n\n// All config\nimport firstWordExceptions from './config/firstWordExceptions';\nimport transitionWords from './config/transitionWords';\nimport twoPartTransitionWords from './config/twoPartTransitionWords';\nimport functionWords from './config/functionWords';\n\n// All helpers\nimport getStemmer from './helpers/getStemmer';\nimport getClauses from './helpers/getClauses';\nimport isPassiveSentence from './helpers/isPassiveSentence';\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 not available for languages that we haven't supported yet.\n    delete this.defaultResearches.getFleschReadingScore;\n\n    Object.assign(this.config, {\n      language: 'el',\n      functionWords,\n      passiveConstructionType: 'morphologicalAndPeriphrastic',\n      transitionWords,\n      twoPartTransitionWords,\n      firstWordExceptions: firstWordExceptions.firstWords,\n      secondWordExceptions: firstWordExceptions.secondWords\n    });\n\n    Object.assign(this.helpers, {\n      getStemmer,\n      getClauses,\n      isPassiveSentence\n    });\n  }\n}\n"],"mappings":"AAAA,SAAQA,kBAAkB;AAC1B,MAAM;EAACC;AAAkB,CAAC,GAAGD,kBAAkB;;AAE/C;AACA,OAAOE,mBAAmB;AAC1B,OAAOC,eAAe;AACtB,OAAOC,sBAAsB;AAC7B,OAAOC,aAAa;;AAEpB;AACA,OAAOC,UAAU;AACjB,OAAOC,UAAU;AACjB,OAAOC,iBAAiB;;AAExB;AACA;AACA;AACA,eAAe,MAAMC,UAAU,SAASR,kBAAkB,CAAC;EACzD;AACF;AACA;AACA;AACA;EACES,WAAWA,CAACC,KAAK,EAAE;IACjB,KAAK,CAACA,KAAK,CAAC;;IAEZ;IACA,OAAO,IAAI,CAACC,iBAAiB,CAACC,qBAAqB;IAEnDC,MAAM,CAACC,MAAM,CAAC,IAAI,CAACC,MAAM,EAAE;MACzBC,QAAQ,EAAE,IAAI;MACdZ,aAAa;MACba,uBAAuB,EAAE,8BAA8B;MACvDf,eAAe;MACfC,sBAAsB;MACtBF,mBAAmB,EAAEA,mBAAmB,CAACiB,UAAU;MACnDC,oBAAoB,EAAElB,mBAAmB,CAACmB;IAC5C,CAAC,CAAC;IAEFP,MAAM,CAACC,MAAM,CAAC,IAAI,CAACO,OAAO,EAAE;MAC1BhB,UAAU;MACVC,UAAU;MACVC;IACF,CAAC,CAAC;EACJ;AACF","ignoreList":[]}

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

@@ -1,9 +1,3 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
 /**
  * Returns an array with exceptions for the sentence beginning research.
  * @type {Array} The array filled with exceptions.
@@ -26,7 +20,7 @@ const firstWords = [
 const secondWords = [
 // Definite articles and relative pronouns
 "o", "του", "τον ", "ο", "των", "τους", "η", "της", "την", "τις", "το", "τα", "που", "τον", "οι"];
-var _default = exports.default = {
+export default {
   firstWords: firstWords,
   secondWords: secondWords
 };

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

@@ -1 +1 @@
-{"version":3,"file":"firstWordExceptions.js","names":["firstWords","secondWords","_default","exports","default"],"sources":["../../../../../src/languageProcessing/languages/el/config/firstWordExceptions.js"],"sourcesContent":["/**\n * Returns an array with exceptions for the sentence beginning research.\n * @type {Array} The array filled with exceptions.\n */\nconst firstWords = [\n\t// Definite articles:\n\t\"o\", \"του\", \"τον \", \"ο\", \"των\", \"τους\", \"η\", \"της\", \"την\", \"τις\", \"το\", \"τα\",\n\t// Indefinite articles:\n\t\"ένας\", \"ενός\", \"έναν\", \"μία\", \"μίας\", \"μία\", \"ένα\", \"μια\", \"μιας\", \"μια\",\n\t// Numbers 1-10:\n\t\"ένα\", \"δύο\", \"τρία\", \"τέσσερα\", \"πέντε \", \"έξι\", \"επτά\", \"εφτά\", \"οκτώ\", \"οχτώ\", \"εννέα\", \"εννιά\", \"δέκα\",\n\t// Demonstratives:\n\t\"αυτός\", \"αυτού\", \"αυτόν\", \"αυτοί\", \"αυτών\", \"αυτούς\", \"αυτή\", \"αυτής\", \"αυτή\", \"αυτό\", \"αυτά\", \"εκείνος\", \"εκείνου\",\n\t\"εκείνον\", \"εκείνοι\", \"εκείνων\", \"εκείνη\", \"εκείνης\", \"εκείνη\", \"εκείνες\", \"εκείνο\", \"εκείνα\", \"τέτοιος\", \"τέτοιου\",\n\t\"τέτοιον\", \"τέτοιοι\", \"τέτοιων\", \"τέτοιους\", \"τέτοια\", \"τέτοιας\", \"τέτοιαν\", \"τέτοιες\", \"τέτοιο\", \"τέτοια\", \"τόσος\",\n\t\"τόσου\", \"τόσον\", \"τόσοι\", \"τόσων\", \"τόσους\", \"τόση\", \"τόσης\", \"τόσες\", \"τόσο\", \"τόσα\", \"τούτος\", \"τούτου\", \"τούτον\",\n\t\"τούτοι\", \"τούτων\", \"τούτους\", \"τούτη \", \"τούτης\", \"τούτην \", \"τούτες\", \"τούτο\", \"τούτα\", \"εδώ\", \"εκεί\",\n];\n\n/**\n * Returns an array of words that can occur after demonstrative pronouns.\n *\n * @type {string[]} The array filled with exceptions.\n */\nconst secondWords = [\n\t// Definite articles and relative pronouns\n\t\"o\",\n\t\"του\",\n\t\"τον \",\n\t\"ο\",\n\t\"των\",\n\t\"τους\",\n\t\"η\",\n\t\"της\",\n\t\"την\",\n\t\"τις\",\n\t\"το\",\n\t\"τα\",\n\t\"που\",\n\t\"τον\",\n\t\"οι\",\n];\n\nexport default {\n\tfirstWords: firstWords,\n\tsecondWords: secondWords,\n};\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AACA,MAAMA,UAAU,GAAG;AAClB;AACA,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI;AAC5E;AACA,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK;AACzE;AACA,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM;AAC1G;AACA,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EACpH,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EACnH,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EACnH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EACpH,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CACvG;;AAED;AACA;AACA;AACA;AACA;AACA,MAAMC,WAAW,GAAG;AACnB;AACA,GAAG,EACH,KAAK,EACL,MAAM,EACN,GAAG,EACH,KAAK,EACL,MAAM,EACN,GAAG,EACH,KAAK,EACL,KAAK,EACL,KAAK,EACL,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,KAAK,EACL,IAAI,CACJ;AAAC,IAAAC,QAAA,GAAAC,OAAA,CAAAC,OAAA,GAEa;EACdJ,UAAU,EAAEA,UAAU;EACtBC,WAAW,EAAEA;AACd,CAAC","ignoreList":[]}
+{"version":3,"file":"firstWordExceptions.js","names":["firstWords","secondWords"],"sources":["../../../../../src/languageProcessing/languages/el/config/firstWordExceptions.js"],"sourcesContent":["/**\n * Returns an array with exceptions for the sentence beginning research.\n * @type {Array} The array filled with exceptions.\n */\nconst firstWords = [\n\t// Definite articles:\n\t\"o\", \"του\", \"τον \", \"ο\", \"των\", \"τους\", \"η\", \"της\", \"την\", \"τις\", \"το\", \"τα\",\n\t// Indefinite articles:\n\t\"ένας\", \"ενός\", \"έναν\", \"μία\", \"μίας\", \"μία\", \"ένα\", \"μια\", \"μιας\", \"μια\",\n\t// Numbers 1-10:\n\t\"ένα\", \"δύο\", \"τρία\", \"τέσσερα\", \"πέντε \", \"έξι\", \"επτά\", \"εφτά\", \"οκτώ\", \"οχτώ\", \"εννέα\", \"εννιά\", \"δέκα\",\n\t// Demonstratives:\n\t\"αυτός\", \"αυτού\", \"αυτόν\", \"αυτοί\", \"αυτών\", \"αυτούς\", \"αυτή\", \"αυτής\", \"αυτή\", \"αυτό\", \"αυτά\", \"εκείνος\", \"εκείνου\",\n\t\"εκείνον\", \"εκείνοι\", \"εκείνων\", \"εκείνη\", \"εκείνης\", \"εκείνη\", \"εκείνες\", \"εκείνο\", \"εκείνα\", \"τέτοιος\", \"τέτοιου\",\n\t\"τέτοιον\", \"τέτοιοι\", \"τέτοιων\", \"τέτοιους\", \"τέτοια\", \"τέτοιας\", \"τέτοιαν\", \"τέτοιες\", \"τέτοιο\", \"τέτοια\", \"τόσος\",\n\t\"τόσου\", \"τόσον\", \"τόσοι\", \"τόσων\", \"τόσους\", \"τόση\", \"τόσης\", \"τόσες\", \"τόσο\", \"τόσα\", \"τούτος\", \"τούτου\", \"τούτον\",\n\t\"τούτοι\", \"τούτων\", \"τούτους\", \"τούτη \", \"τούτης\", \"τούτην \", \"τούτες\", \"τούτο\", \"τούτα\", \"εδώ\", \"εκεί\",\n];\n\n/**\n * Returns an array of words that can occur after demonstrative pronouns.\n *\n * @type {string[]} The array filled with exceptions.\n */\nconst secondWords = [\n\t// Definite articles and relative pronouns\n\t\"o\",\n\t\"του\",\n\t\"τον \",\n\t\"ο\",\n\t\"των\",\n\t\"τους\",\n\t\"η\",\n\t\"της\",\n\t\"την\",\n\t\"τις\",\n\t\"το\",\n\t\"τα\",\n\t\"που\",\n\t\"τον\",\n\t\"οι\",\n];\n\nexport default {\n\tfirstWords: firstWords,\n\tsecondWords: secondWords,\n};\n"],"mappings":"AAAA;AACA;AACA;AACA;AACA,MAAMA,UAAU,GAAG;AAClB;AACA,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI;AAC5E;AACA,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK;AACzE;AACA,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM;AAC1G;AACA,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EACpH,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EACnH,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EACnH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EACpH,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CACvG;;AAED;AACA;AACA;AACA;AACA;AACA,MAAMC,WAAW,GAAG;AACnB;AACA,GAAG,EACH,KAAK,EACL,MAAM,EACN,GAAG,EACH,KAAK,EACL,MAAM,EACN,GAAG,EACH,KAAK,EACL,KAAK,EACL,KAAK,EACL,IAAI,EACJ,IAAI,EACJ,KAAK,EACL,KAAK,EACL,IAAI,CACJ;AAED,eAAe;EACdD,UAAU,EAAEA,UAAU;EACtBC,WAAW,EAAEA;AACd,CAAC","ignoreList":[]}

package/build/languageProcessing/languages/el/config/functionWords.js

@@ -1,12 +1,6 @@
-"use strict";
+import { singleWords as transitionWords } from "./transitionWords";
+import transformWordsWithHyphens from "../../../helpers/transform/transformWordsWithHyphens";
 
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = exports.all = void 0;
-var _transitionWords = require("./transitionWords");
-var _transformWordsWithHyphens = _interopRequireDefault(require("../../../helpers/transform/transformWordsWithHyphens"));
-function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
 /**
  * Returns an array of Greek function words.
  *
@@ -42,6 +36,6 @@ const recipeWords = ["γραμ.", "γραμμ.", "γραμμάρια", "κ/γ",
 const timeWords = ["δευτερόλεπτο", "δευτερόλεπτα", "δεύτερα", "ώρα", "ώρας", "τέταρτο", "μισάωρο", "ώρες", "μέρα", "μέρας", "μέρες", "ημέρα", "ημέρες", "σήμερα", "αύριο", "εχθές", "χθές", "βδομάδα", "βδομάδες", "βδομάδας", "εβδομάδα", "εβδομάδες", "μισαωράκι", "τεταρτάκι", "δεκάλεπτο", "πεντάλεπτο", "φέτος", "πέρσι", "χρόνος", "πέρυσι", "χρόνου", "πρόπερσι", "προχθές"];
 const vagueNouns = ["πράγμα", "πράγματα", "υπόθεση", "περίπτωση", "πρόβλημα", "προβλήματα", "αντικείμενο", "αντικείμενα", "θέμα", "θέματα", "περίσταση", "συνθήκες", "περιστάσεις", "ζήτημα", "ζητήματα", "ζητημάτων", "υποθέσεις", "γεγονός", "γεγονότα", "κατάσταση", "καταστάσεις", "ουσία", "τρόπος", "μέθοδος", "παράγοντας", "παράγοντες", "αιτία", "επίπτωση", "αιτίες", "επιπτώσεις", "μέρος", "μέρη", "άποψη", "απόψεις", "γνώμη", "γνώμες", "άτομο", "άτομα", "ομάδα", "πραγματικότητα", "διαφορά", "διαφορές", "ομοιότητες"];
 const titles = ["δεσποινίς", "καθηγητής", "διδάκτωρ", "κύριος", "κύριοι", "κυρίες", "καθηγ", "κυρία", "διδα", "καθ", "κος", "δρ", "κα"];
-const all = exports.all = (0, _transformWordsWithHyphens.default)([].concat(articles, cardinalNumbers, otherNumbers, fractions, personalPronouns, demonstrativePronouns, interrogatives, interrogativeAdverbs, quantifiers, reflexivePronouns, possessivePronouns, indefinitePronouns, prepositions, particles, conjuntions, interviewVerbs, intensifiers, auxiliariesAndDelexicalizedVerbs, generalAdjectivesAdverbs, interjections, recipeWords, timeWords, vagueNouns, titles, _transitionWords.singleWords));
-var _default = exports.default = all;
+export const all = transformWordsWithHyphens([].concat(articles, cardinalNumbers, otherNumbers, fractions, personalPronouns, demonstrativePronouns, interrogatives, interrogativeAdverbs, quantifiers, reflexivePronouns, possessivePronouns, indefinitePronouns, prepositions, particles, conjuntions, interviewVerbs, intensifiers, auxiliariesAndDelexicalizedVerbs, generalAdjectivesAdverbs, interjections, recipeWords, timeWords, vagueNouns, titles, transitionWords));
+export default all;
 //# sourceMappingURL=functionWords.js.map