* when making decisions, they may crawl pages marked "hourly" less
     * frequently than that, and they may crawl pages marked "yearly" more
     * frequently than that. Crawlers may periodically crawl pages marked
     * "never" so that they can handle unexpected changes to those pages.
     */
    private String changefreq;

    /**

 * It applies each normalizer in the order they were added to the chain.
 *
 * <p>Usage example:</p>
 * <pre>
 * NormalizerChain chain = new NormalizerChain();
 * chain.add(new SomeNormalizer());
 * chain.add(new AnotherNormalizer());
 * String normalizedText = chain.normalize("input text", "field", "en");
 * </pre>
 *
 * <p>Methods:</p>
 * <ul>

                    || PRIORITY_ELEMENT.equals(qName)) {
                buf = new StringBuilder();
            }
        }

        @Override
        public void characters(final char[] ch, final int offset, final int length) {
            if (buf != null) {
                buf.append(new String(ch, offset, length));
            }
        }

        @Override

import java.util.List;
import java.util.Queue;

/**
 * A chain of {@link ReadingConverter} implementations that applies each converter in sequence to generate possible reading variations of a given text.
 * It maintains a list of ReadingConverter instances and iterates through them, applying each converter to the input text and accumulating the results.
 * The chain stops processing when the maximum number of readings is reached.
 */

            final char originalChar1 = sb.charAt(i);
            final char originalChar2 = sb.charAt(i + 1);
            final char margedChar = mergeChar(originalChar1, originalChar2);
            if (margedChar != originalChar1) {
                sb.setCharAt(i, margedChar);
                sb.deleteCharAt(i + 1);
            } else {

    public void test_convert() throws Exception {
        /*
         * TODO ReadingConverterChain chain = new ReadingConverterChain(); chain.addConverter(new KatakanaConverter());
         * chain.addConverter(new KatakanaToAlphabetConverter()); chain.init();
         *
         * List<String> list = chain.convert("検索"); assertTrue(list.contains("ケンサク"));
         * assertTrue(list.contains("kennsaku"));
         */
    }

        // Test that all methods return the builder instance for chaining
        String id = "chain-test";
        SuggestSettings settings = builder.setSettingsIndexName("CHAINED_INDEX")
                .addInitialSettings("chain.key1", "chainValue1")
                .addInitialSettings("chain.key2", "chainValue2")
                .scrollTimeout("11s")
                .searchTimeout("12s")

        final ReadingConverterChain chain = new ReadingConverterChain();
        chain.addConverter(new AnalyzerConverter(client, settings));
        chain.addConverter(new KatakanaToAlphabetConverter());
        return chain;
    }

    /**
     * Creates a default ReadingConverterChain with a KatakanaToAlphabetConverter.
     *

            normalizer = new LangAnalyzerNormalizer(null);
        } else {
            final NormalizerChain chain = new NormalizerChain();
            for (final String lang : langs) {
                chain.add(new LangAnalyzerNormalizer(lang));
            }
            normalizer = chain;
        }
        return normalizer.normalize(text, field);
    }

    /**
     * Language-specific analyzer normalizer.

        final char[] chars = new char[text.length()];
        for (int i = 0; i < chars.length; i++) {
            final char c = text.charAt(i);
            if (c >= 'ａ' && c <= 'ｚ') {
                chars[i] = (char) (c - 'ａ' + 'a');
            } else if (c >= 'Ａ' && c <= 'Ｚ') {
                chars[i] = (char) (c - 'Ａ' + 'A');
            } else if (c >= '１' && c <= '０') {