import org.lastaflute.web.validation.Required;

/**
 * The download form for protected words dictionary.
 * This form is used for downloading protected words dictionary files from the admin interface.
 *
 */
public class DownloadForm {

    /**
     * Dictionary ID for identifying the protected words dictionary to download.
     */
    @Required
    public String dictId;

    /**

		if !isSpace(r) {
			break
		}
	}
	// Scan until space, marking end of word.
	for width, i := 0, start; i < len(data); i += width {
		var r rune
		r, width = utf8.DecodeRune(data[i:])
		if isSpace(r) {
			return i + width, data[start:i], nil
		}
	}
	// If we're at EOF, we have a final, non-empty, non-terminated word. Return it.
	if atEOF && len(data) > start {
		return len(data), data[start:], nil
	}

—
－
，
。
、
：
；
！
·
？
“
”
）
（
【
】
［
］
●
# the line below contains an IDEOGRAPHIC SPACE character (Used as a space in Chinese)
　

# English Stop Words

import org.lastaflute.web.validation.Required;

/**
 * The download form for stop words dictionary.
 * This form is used for downloading stop words dictionary files from the admin interface.
 *
 */
public class DownloadForm {

    /**
     * Dictionary ID for identifying the stop words dictionary to download.
     */
    @Required
    public String dictId;

    /**
     * Default constructor.

            return FormatType.LABEL;
        }
        if ("popular-words".equals(type)) {
            return FormatType.POPULARWORD;
        }
        if ("favorites".equals(type)) {
            return FormatType.FAVORITES;
        }
        if ("health".equals(type)) {
            return FormatType.PING;
        }
        if ("suggest-words".equals(type)) {
            return FormatType.SUGGEST;
        }

—
－
，
。
、
：
；
！
·
？
“
”
）
（
【
】
［
］
●
# the line below contains an IDEOGRAPHIC SPACE character (Used as a space in Chinese)
　

# English Stop Words

    Comparator<byte[]> comparator2 = UnsignedBytes.lexicographicalComparatorJavaImpl();

    /*
     * These arrays are set up to test that the comparator compares bytes within a word in the
     * correct order—in order words, that it doesn't mix up big-endian and little-endian. The first
     * array has a smaller element at one index, and then the second array has a smaller element at
     * the next.
     */

    }

    /**
     * Returns the total number of words in the suggestion index.
     * @return The total number of words.
     */
    public long getAllWordsNum() {
        return getNum(QueryBuilders.matchAllQuery());
    }

    /**
     * Returns the number of document words in the suggestion index.
     * @return The number of document words.
     */
    public long getDocumentWordsNum() {

     * Returns the language field name.
     * @return The language field name.
     */
    public String getLangFieldName() {
        return langFieldName;
    }

    /**
     * Returns the bad words array.
     * @return The bad words array.
     */
    public String[] getBadWords() {
        return badWords;
    }

Only keep parentheses if they exist in the source text. Do not add parentheses to terms that do not have them.

### Avoiding Repetition in Translation

When translating sentences, avoid unnecessary repetition of words or phrases that are implied in context.
- Merge repeated words naturally while keeping the meaning.