Language processing system
First Claim
Patent Images
1. A language processing system comprising:
- a forbidden word memory part that stores a forbidden word;
a sequence candidate generator that generates a plurality of word sequence candidates where each words are described separately from plain text; and
a word sequence estimator that reads the forbidden word from the forbidden word memory part, excludes the word sequence candidate containing the forbidden word from the plurality of word sequence candidates, and selects an estimated word sequence with the highest concatenation possibility of the words from among the plurality of word sequence candidates.
1 Assignment
0 Petitions
Accused Products
Abstract
A language processing system including: a forbidden word memory part that stores a forbidden word; a sequence candidate generator that generates a plurality of word sequence candidates where each words are described separately from plain text; and a word sequence estimator that reads the forbidden word from the forbidden word memory part, excludes the word sequence candidate containing the forbidden word from the plurality of word sequence candidates, and selects an estimated word sequence with the highest concatenation possibility of the words from among the plurality of word sequence candidates.
-
Citations
10 Claims
-
1. A language processing system comprising:
-
a forbidden word memory part that stores a forbidden word;
a sequence candidate generator that generates a plurality of word sequence candidates where each words are described separately from plain text; and
a word sequence estimator that reads the forbidden word from the forbidden word memory part, excludes the word sequence candidate containing the forbidden word from the plurality of word sequence candidates, and selects an estimated word sequence with the highest concatenation possibility of the words from among the plurality of word sequence candidates. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A language processing system comprising:
-
a forbidden word memory part that stores a forbidden word;
a sequence candidate generator that reads the forbidden word stored in the forbidden word memory part, prohibits use of the forbidden word, and generates a plurality of word sequence candidates where each words are described separately from plain text; and
a word sequence estimator that selects an estimated word sequence with the highest concatenation possibility of the words from among the plurality of word sequence candidates. - View Dependent Claims (7, 8, 9, 10)
-
Specification