Method parse has a Cognitive Complexity of 18 (exceeds 5 allowed). Consider refactoring.

Open

    public final void parse(final File hypFile){
        final Path hypPath = hypFile.toPath();
        Level level = Level.NON_COMPOUND;
        charset = FileHelper.determineCharset(hypPath, -1);
        LOGGER.info(ParserManager.MARKER_APPLICATION, "The charset of the Hyphenation file is {}", charset.name());

• Read up
  Read up

Method applyAffixRules has a Cognitive Complexity of 17 (exceeds 5 allowed). Consider refactoring.

Open

    private List<Inflection> applyAffixRules(final DictionaryEntry dicEntry, final List<List<String>> allAffixes,
            final boolean isCompound, final RuleEntry overriddenRule) throws NoApplicableRuleException{
        final String circumfixFlag = affixData.getCircumfixFlag();
        final String forbiddenWordFlag = affixData.getForbiddenWordFlag();

• Read up
  Read up

Method parse has a Cognitive Complexity of 17 (exceeds 5 allowed). Consider refactoring.

Open

    @SuppressWarnings("OverlyBroadThrowsClause")
    public final void parse(final File affFile, final String configurationLanguage) throws IOException{
        clear();

        int index = 0;

• Read up
  Read up

Method extractAllAffixes has a Cognitive Complexity of 16 (exceeds 5 allowed). Consider refactoring.

Open

    private List<DictionaryEntry> extractAllAffixes(final DictionaryEntry dicEntry){
        final String word = dicEntry.getWord();
        final List<String> partOfSpeech = dicEntry.getMorphologicalFieldPartOfSpeech();

        final List<DictionaryEntry> originators = new ArrayList<>(0);

• Read up
  Read up

Method addData has a Cognitive Complexity of 16 (exceeds 5 allowed). Consider refactoring.

Open

    public final void addData(final String word, final Hyphenation hyphenation){
        if(hyphenation != null && !orthography.hasSyllabationErrors(hyphenation.getSyllabes())){
            final List<String> syllabes = hyphenation.getSyllabes();

            final int stressIndex = orthography.getStressedSyllabeIndexFromLast(syllabes);

• Read up
  Read up

Method extractDuplicates has a Cognitive Complexity of 16 (exceeds 5 allowed). Consider refactoring.

Open

    private Collection<List<Duplicate>> extractDuplicates(final BloomFilterInterface<String> duplicatesBloomFilter){
        final Map<String, List<Duplicate>> result = new HashMap<>(0);

        if(duplicatesBloomFilter.getAddedElements() > 0){
            resetProcessing("Extracting duplicates (step 2/3)");

• Read up
  Read up

Method unzipFile has a Cognitive Complexity of 16 (exceeds 5 allowed). Consider refactoring.

Open

    public static void unzipFile(final File zipFile, final Path destination){
        final byte[] buffer = new byte[1024];
        try(final ZipInputStream zis = new ZipInputStream(new FileInputStream(zipFile))){
            final File dest = destination.toFile();
            ZipEntry zipEntry = zis.getNextEntry();

• Read up
  Read up

Consider simplifying this complex logical expression.

Open

            if(chr == sb.charAt(i - 1) && Arrays.binarySearch(WordVEC.VOWELS_ARRAY, chr) < 0){
                final boolean starting1With = (i == 2 && ((chr = word.charAt(0)) == 'i' || chr == 'e'));
                final boolean starting2With = (i == 3 && word.charAt(0) == 'd' && ((chr = word.charAt(1)) == 'e' || chr == 'i'));
                final boolean endingWith = (i == sb.length() - 2 && ((chr = word.charAt(word.length() - 4)) == 'o' || chr == 'e')
                    && word.charAt(word.length() - 1) == 'e');

Method stressCheck has a Cognitive Complexity of 15 (exceeds 5 allowed). Consider refactoring.

Open

    private void stressCheck(final String subword, final Inflection inflection, final boolean lastSubword){
        if(!rulesLoader.containsValidStressedWords(subword)){
            final int stresses = WordVEC.countStresses(subword);
            if(!rulesLoader.isWordCanHaveMultipleStresses() && stresses > 1)
                throw new LinterException(MULTIPLE_STRESSES, inflection.getWord());

• Read up
  Read up

Method parse has a Cognitive Complexity of 15 (exceeds 5 allowed). Consider refactoring.

Open

    public final void parse(final ParsingContext context) throws EOFException{
        final Scanner scanner = context.getScanner();
        if(!NumberUtils.isCreatable(context.getFirstParameter()))
            throw new LinterException(BAD_FIRST_PARAMETER, context);
        final int numEntries = Integer.parseInt(context.getFirstParameter());

• Read up
  Read up

Method extractMinimalPairs has a Cognitive Complexity of 15 (exceeds 5 allowed). Consider refactoring.

Open

    private Map<String, List<String>> extractMinimalPairs(final File outputFile){
        final Charset charset = dicParser.getCharset();
        int totalPairs = 0;
        final Map<String, List<String>> minimalPairs = new HashMap<>(0);
        try(final BufferedReader sourceBR = Files.newBufferedReader(outputFile.toPath(), dicParser.getCharset())){

• Read up
  Read up

Method makeAdditionsDisjoint has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

    private static List<LineEntry> makeAdditionsDisjoint(final List<LineEntry> rules){
        //transform
        //    [rem=èra,add=[ereta, ara, era, iera, ièra, areta, iereta],cond=èra,from=…]
        //    [rem=èra,add=[ereta, ara, era, areta],cond=èra,from=…]
        //into

• Read up
  Read up

Method linearize has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

    private static int[] linearize(final FSAAbstract fsa){
        int[] linearized = new int[0];
        int last = 0;

        final BitSet visited = new BitSet();

• Read up
  Read up

Method composeCompound has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

    private List<DictionaryEntry> composeCompound(final int[] indexes, final List<List<Inflection>> entry, final StringBuffer sb){
        final String forbiddenWordFlag = affixData.getForbiddenWordFlag();
        final boolean forbidDifferentCasesInCompound = affixData.isForbidDifferentCasesInCompound();
        final boolean forbidTriples = affixData.isForbidTriplesInCompound();
        final boolean simplifyTriples = affixData.isSimplifyTriplesInCompound();

• Read up
  Read up

Method reduceGeminates has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

    private static String reduceGeminates(final CharSequence word){
        final StringBuilder sb = new StringBuilder(word);
        for(int i = 1; i < sb.length(); i ++){
            char chr = sb.charAt(i);
            if(chr == sb.charAt(i - 1) && Arrays.binarySearch(WordVEC.VOWELS_ARRAY, chr) < 0){

• Read up
  Read up

Method getLastUnstressedVowelIndex has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

    private static int getLastUnstressedVowelIndex(final CharSequence word, int lastLetterIndex){
        for(lastLetterIndex --; lastLetterIndex >= 0; lastLetterIndex --){
            final char chr = word.charAt(lastLetterIndex);
            if(Arrays.binarySearch(VOWELS_PLAIN_ARRAY, chr) >= 0){
                if(chr != 'i' && chr != 'u')

• Read up
  Read up

Method lookup has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

    public final List<WordData> lookup(String word){
        final byte separator = dictionary.metadata.getSeparator();

        if(!dictionary.metadata.getInputConversionPairs().isEmpty())
            word = applyReplacements(word, dictionary.metadata.getInputConversionPairs());

• Read up
  Read up

Method collectDuplicates has a Cognitive Complexity of 14 (exceeds 5 allowed). Consider refactoring.

Open

    private BloomFilterInterface<String> collectDuplicates(){
        final File dicFile = dicParser.getDicFile();
        final Charset charset = dicParser.getCharset();

        final BloomFilterInterface<String> bloomFilter = new ScalableInMemoryBloomFilter<>(charset, dictionaryBaseData);

• Read up
  Read up

Method calculateInflections has a Cognitive Complexity of 13 (exceeds 5 allowed). Consider refactoring.

Open

    private void calculateInflections(){
        final String language = parserManager.getLanguage();
        final String text = inputTextField.getText().trim();

        if(text.equals(formerInputText))

• Read up
  Read up

Method exactMatchSearch has a Cognitive Complexity of 13 (exceeds 5 allowed). Consider refactoring.

Open

    private int exactMatchSearch(final String key, final int position, int length, int nodeId){
        Objects.requireNonNull(key, "Key cannot be null");

        int result = -1;
        if(isInitialized()){

• Read up
  Read up