Language processing system

• US 20070055496A1
• Filed: 08/24/2006
• Published: 03/08/2007
• Est. Priority Date: 08/24/2005
• Status: Active Grant

• Current Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Original Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Inventors: Seto, Shigenobu
• Granted Patent: US 7,917,352 B2
• Time in Patent Office: Days
• US Class Current: 704/9
• CPC Class Codes: G06F 40/284 Lexical analysis, e.g. tokenisation or collocates
• CPC Class Codes: G06F 40/53 Processing of non-Latin text kana-to-kanji conversion G06F40/129; vowelisation G06F40/232
• CPC Class Codes: G10L 13/027 Concept to speech synthesisers; Generation of natural phrases from machine-based concepts generation of parameters for speech synthesis out of text G10L13/08

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.

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.

2. The language processing system according to claim 1, further comprising a mis-pronounced range instruction part that accepts instruction of a mis-pronounced word with different reading from the correct reading of the text in the estimated word sequence.

3. The language processing system according to claim 1, further comprising an instructed word estimator that performs a comparison between the reading of the estimated word sequence and the correct reading of the text, and extracts a mis-pronounced word with different reading from the correct reading from the estimated word sequence.

4. The language processing system according to claim 2, further comprising a forbidden word addition section that additionally stores the mis-pronounced word in the forbidden word memory part as the forbidden word.

5. The language processing system according to claim 3, further comprising a forbidden word addition section that additionally stores the mis-pronounced word in the forbidden word memory part as the forbidden word.

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.

7. The language processing system according to claim 6, further comprising a mis-pronounced range instruction part that accepts instruction of a mis-pronounced word with different reading from the correct reading of the text in the estimated word sequence.

8. The language processing system according to claim 6, further comprising an instructed word estimator that performs a comparison between the reading of the estimated word sequence and the correct reading of the text, and extracts a mis-pronounced word with different reading from the correct reading from the estimated word sequence.

9. The language processing system according to claim 7, further comprising a forbidden word addition section that additionally stores the mis-pronounced word in the forbidden word memory part as the forbidden word.

10. The language processing system according to claim 8, further comprising a forbidden word addition section that additionally stores the mis-pronounced word in the forbidden word memory part as the forbidden word.