* <li>{@link #addBadWord(String, boolean)} - Add a bad word and optionally apply it.
 * <li>{@link #deleteBadWord(String)} - Delete a bad word.
 * <li>{@link #addElevateWord(ElevateWord, boolean)} - Add an elevate word and optionally apply it.
 * <li>{@link #deleteElevateWord(String, boolean)} - Delete an elevate word and optionally apply it.

    /**
     * Sets whether to match the first word.
     * @param matchWordFirst True to match the first word, false otherwise.
     * @return This builder instance.
     */
    public SuggestRequestBuilder setMatchWordFirst(final boolean matchWordFirst) {
        request.setMatchWordFirst(matchWordFirst);
        return this;
    }

    /**
     * Sets whether to skip duplicate words.

            String[] words = text.trim().split("[\\s@#$.,!?;:()\\[\\]{}\"']+");

            int position = 0;
            int offset = 0;
            for (String word : words) {
                if (!word.isEmpty()) {
                    int startOffset = text.indexOf(word, offset);
                    int endOffset = startOffset + word.length();

                    // Handle decimal numbers

     */
    public PopularWordsRequestBuilder setWindowSize(final int windowSize) {
        request.setWindowSize(windowSize);
        return this;
    }

    /**
     * Adds an exclude word.
     * @param excludeWord The word to exclude.
     * @return This builder instance.
     */
    public PopularWordsRequestBuilder addExcludeWord(final String excludeWord) {
        request.addExcludeWord(excludeWord);

        mergedItem.emptySource = item2.emptySource;

        return mergedItem;
    }

    /**
     * Checks if the suggest item contains any of the given bad words.
     * @param badWords The array of bad words.
     * @return True if the item contains a bad word, false otherwise.
     */
    public boolean isBadWord(final String[] badWords) {
        for (final String badWord : badWords) {
            if (text.contains(badWord)) {

        SuggestItem item = new SuggestItem(text, readings, null, 0L, 0L, 1.0f, null, null, null, SuggestItem.Kind.QUERY);

        // Test with no bad words
        String[] badWords = { "spam", "illegal" };
        assertFalse(item.isBadWord(badWords));

        // Test with matching bad word
        String[] badWords2 = { "test", "bad" };
        assertTrue(item.isBadWord(badWords2));

        // Test with partial match

        }

        public MyToken(final String word, final int startOffset, final int endOffset, final int posInc) {
            this(word, startOffset, endOffset, posInc, Integer.MAX_VALUE); // Integer.MAX_VALUE for seq means unused
        }

        public MyToken(final String word, final int startOffset, final int endOffset, final int posInc, final int seq) {
            this.word = word;
            this.startOffset = startOffset;

        String word = "test word";
        float boost = 1.5f;
        List<String> readings = Arrays.asList("reading1");
        List<String> fields = Arrays.asList("field1");
        List<String> tags = Arrays.asList("tag1");
        List<String> roles = null;

        elevateWord = new ElevateWord(word, boost, readings, fields, tags, roles);

        assertEquals(word, elevateWord.getElevateWord());

          pertain to any part of the Derivative Works, in at least one
          of the following places: within a NOTICE text file distributed
          as part of the Derivative Works; within the Source form or
          documentation, if provided along with the Derivative Works; or,
          within a display generated by the Derivative Works, if and
          wherever such third-party notices normally appear. The contents

          pertain to any part of the Derivative Works, in at least one
          of the following places: within a NOTICE text file distributed
          as part of the Derivative Works; within the Source form or
          documentation, if provided along with the Derivative Works; or,
          within a display generated by the Derivative Works, if and
          wherever such third-party notices normally appear. The contents