Abstract:
PROBLEM TO BE SOLVED: To facilitate registration of a new word and input of a keyword without being conscious of the contents of a voice recognition dictionary as far as possible in order to connect voice recognition to succeeding language processing or retrieval. SOLUTION: In the registration of a new word or the input of a keyword, "reading" is input by a user at first. The reading is converted from pronunciation into notation by the same language model as a language model for voice recognition, and thereby a Kana-Kanji notation is obtained. Then, the obtained Kana-Kanji notation is properly compared with a corrected word and an original character string to identify the unknown word of the voice recognition dictionary. A converted keyword can be used for retrieving retrieval data formed by voice recognition of a voice file. The unknown word portion can be properly registered in the voice recognition dictionary. COPYRIGHT: (C)2010,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To split interactive voice into utterance units by using recognition response. SOLUTION: An apparatus for splitting interactive voice into the utterance units is disclosed and the apparatus has: a word data base stored with description and pronunciation of a word; a grammar data base stored with grammar including connection information between words; a pause detection section for detecting a position of pause in a channel in which main utterance is performed regarding the interactive voice which has been input by at least two channels; a detection section for detecting a position of the recognition response of channels in which the main utterance is not performed; a border candidate extraction section for extracting a border candidate of the main utterance by extracting the pause which is present in a specified period before and after a position of the recognition response as a base point; and a recognition section for dividing the utterance split by the extracted border candidate into an optimum utterance unit by referring to the word data base and the grammar data base to output a word string. COPYRIGHT: (C)2008,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a vocabulary prediction method which can raise the accu racy of prediction. SOLUTION: Using string of a partial parse tree covering the word string to the time in each step of word prospect, the partial parse tree having a useful information is selected by the prospect of the next word. In other word, the accuracy of the prospect is improved by selecting the most useful word and/or word string for the prospect of the next word based upon the relation structure and the word string to be a history. Specifying the partial parse tree relating to a word to be prospected, thereafter, the next word is prospected from the partial parse tree, that is, the word and/or word string estimated to be a relation having the connection with the word of prospective object.
Abstract:
PURPOSE:To balance a necessary spatial cost and a retrieval cost by deciding a prefix part from a partial string where a small number of input characters are decided and retrieving 'TRIE' again. CONSTITUTION:A candidate character lattice is inputted from an input device 307 and is stored in a prescribed area on the main storage of a computer as a candidate character lattice 308 by a candidate character lattice storage means 302 with the control of an input means 301. The storage means 302 supplies the candidate character lattice 308 to reference or transfers it. The input means 301 stores the specified content of a file in a magnetic disk into the candidate character lattice 308 through the input device 307. A retrieval work quantity estimation means 303 calculates a retrieval start position from which the work quantity of dictionary retrieval can be expected to be small from the candidate character lattice and data 309 of the number of average branches, which is obtained at the time of generating a TRIE dictionary and is preserved in the magnetic disk.
Abstract:
PURPOSE: To provide a method which can evaluate the result of postprocessing of character recognition of a Japanese sentence by itself and inform an operator of the evaluation result. CONSTITUTION: Paths which are grammatically established are searched for on the basis of the result of the character recognition and the restrictions of Japanese, the costs accompanying the paths are calculated, and on the basis of the costs, candidate paths are selected. Then a conviction degree detecting means 7 finds the degree of conviction as to a candidate characters (REN) of a specific column the optimum candidate path with the best cost passes through from the cost accompanying the optimum candidate path and the cost accompanying a candidate path passing through a candidate character (UN) other than the candidate character, and replaces the candidate character or warns the operator according to the degree of conviction.
Abstract:
PURPOSE:To reduce the duplicate recursion formula calculation of templates having the same partial label sequence from the first by making plural templates into a tree structure dictionary corresponding to each access bus. CONSTITUTION:A tree structure dictionary 11 where each label corresponds to one node is generated from plural label sequences forming templates and is held in a storage device 12. A buffer area is reserved in the storage device with respect to the node of each label of the tree structure dictionary 11. Node selection 13 of the tree structure dictionary 11 is performed in the depthwise direction, and stage calculation execution 14 of the input label sequence is performed with respect to the label corresponding to the selected node, and the result is held in the buffer reserved for the selected node, and this operation is repeated. Thus, the duplicate recursion formula calculation of templates having the same partial label sequence from the first is reduced.
Abstract:
PROBLEM TO BE SOLVED: To provide an interactive processing device, an interaction processing method and a computer program, capable of extracting a necessary uttering section in a specified field from a conversation data, without requiring prior knowledge regarding the data and the application field. SOLUTION: The interactive processing device 1 comprises a processing object data extracting section 11 for extracting a plurality of processing object data, including a pattern adaptation section which is adapted to an utterance pattern that is an utterance structure, derived from a content of general conversation which does not depend on the field that is input by an utterance pattern input section 32, from among a plurality of utterance data in which a plurality of conversation contents, regarding one field that is input by an utterance data input section 31; a feature amount extracting section 12 for extracting feature amount which is common for the plurality of pattern adaptation sections by taking each of the pattern adaptation section from the plurality of extracted processing object data; and an essential data extracting section 15 for extracting a necessary data in one field which is included in the plurality of utterance data by using the extracted feature amount. COPYRIGHT: (C)2009,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To provide a model-setting function which is more suitable, relating to the removal of redundant word from the information obtained in user assignment or speaker registration. SOLUTION: A redundant word language model 322, specified as redundant words, is provided in addition to a versatile language model 320 as a language model 32a. The automatic deletion of the redundant words can be made, by using this redundant word language model 322.