Matsushita Electric Industrial Co., Ltd.

Anritsu Corporation

Yuji Kanno

Naohiko Noguchi

Mitsuaki Inaba

Mitsuhiro Sato

Kazuaki Kurachi

Masao Ito

Atsushi Ando

Yoshio Fukushige

Katsuhisa Iiyoshi

Takayuki Morikawa

Masako Nomoto

Ken Tsurubayashi

Hideo Zuinen

Hayashi Ito

Hideki Yasukawa

Yasuki Iizuka

Aki Nakagawa

Noboru Tamura

Tsutomu Hata

Koichi Tamari

If the character string is long, and when retrieving symbols containing characters of high frequency of appearance or character chain, high speed retrieval is possible up to infix matching, and a symbol dictionary of small capacity can be compiled. In the symbol dictionary compiling method of the invention, each symbol in symbol data is covered with shorter symbols called 'meta-symbols' for covering the symbol in the symbol data, and the information showing how each symbol is covered is obtained by preparing meta-symbol appearance information recorded in each meta-symbol, and therefore high speed retrieval including up to infix matching is possible, and a symbol dictionary of small capacity can be compiled.

Symbol dictionary compiling method and symbol dictionary retrieving method

A measuring section measures a digital multiplex signal divided into slot units, as a signal to be measured. A display control section displays, on a screen, a measured waveform of the signal. An analyzing section analyzes, in the slot units, information relating to the measured waveform of the signal. A storage section stores the information relating to the measured waveform of the signal which is analyzed in the slot units, as analyzed information of the slot unit. A marker display control section displays a slot marker to designate an arbitrary slot, in correspondence with the measured waveform of the signal which is displayed on the screen. A slot information display control section reads, from the storage section, the analyzed information of the slot unit corresponding to the slot designated by the slot marker displayed on the screen, and displays the analyzed information of the slot unit in correspondence with the slot marker.

Method for analyzing signal and signal analyzer having function for displaying slot information

In the present invention, a similar vector is searched from a several hundreds dimensional vector database at a high speed, by a single vector index, and in accordance with either measure of an inner product or a distance by designating a similarity search range and maximum obtained pieces number, vector index preparation is performed by decomposing each vector into a plurality of partial vectors and characterizing the vector by a norm division, belonging region and declination division to prepare an index, and similarity search is performed by obtaining a partial query vector and partial search range from a query vector and search range, performing similarity search in each partial space to accumulate a difference from the search range and to obtain an upper limit value, and obtaining a correct measure from a higher upper limit value to obtain a final similarity search result.

Vector index preparing method, similar vector searching method, and apparatuses for the methods

A storage stores data of plural function menus corresponding to plural function menu items composed of plural pages to be used in instruction of execution of mutually different plural functions to process tested data of an object displayed in a first region on a screen of a display section. A screen manager selectively reads out function menu data of one page corresponding to a specified function from data of plural function menus stored in the storage, in accordance with setting of a display state displayed on the screen, and displays in a second region different from the first region, corresponding to each of the plural function keys. A list display section reads out data of plural function menus of all pages corresponding to the specified function from data of plural function menus stored in the storage, depending on the operation of a list display key, and displays a list in a third region, different from the second region, including the first region.

Electronic measurement apparatus having a function to a display a function menu over a plurality of pages in a list and function menu display method

A method and system for generating a set of parameters for use in determining whether a given document belongs to a specified one of a plurality of predetermined categories. An evaluation sample selection screen enables an operator to interactively enter various command parameters for selecting documents for which the calculated membership scores are to be evaluated. In response to an input of one of the command parameters, information useful for the selection of documents is visually presented to the operator. An evaluation value input screen shows selected documents and permits the operator to enter an evaluation value to each of the displayed selected documents. The entered evaluation values are reflected to the reference vector of the specified category.

Text classifying parameter generator and a text classifier using the generated parameter

Three kinds of data, i.e., a keyword frequency-of-appearance, a document length, and a keyword weight, are produced. Then, a document profile vector and a keyword profile vector are calculated. Then, by independently performing the weighted principal component analysis considering the document length and the keyword weight, a document feature vector and a keyword feature vectors are obtained. Then, documents and keywords having higher similarity to the feature vectors calculated with reference to the retrieval and extracting conditions are obtained and displayed.

Apparatus for retrieving similar documents and apparatus for extracting relevant keywords

A high-speed document retrieval system creates a regular expression dictionary and a word index on the basis of a retrieval document and a word dictionary to conduct retrieval to a document through the regular expression dictionary and the word index at a high speed. A regular expression dictionary expressing a set of character strings having the same length is created from a word dictionary. In terms of a character string included in a retrieval document and matching with a regular expression in the regular expression dictionary, an index element is recorded in a word index when there is no different index element which allows an observing index element to be deducible, which eventually produces a word index capable of achieving a high-speed full-text retrieval without the noticeable increase in the index capacity.

Dictionary and index creating system and document retrieval system

A searching apparatus includes an index generation portion for generating an index to provide data of the number of documents including the key word and the number of appearances of the key word. Matching degrees between the key word and documents are calculated from the number of documents including the key word and the number of appearances of the key word. A portion of documents are arranged in order of the matching degree in a buffer which are outputted as the searching result. Lower rank documents regarding the matching degree are searched by comparing the lowest matching degree of the neighbour higher ranked document arranged in the buffer. At first time searching, data of the latest edition of the documents stored in a memory is detected and stored and is used to provide second time searching operation to eliminate inconsistency in the searching result between the editions at first and second time searching operations. The index is generated every field of each document. The matching degree of combined field is calculated by logical operation between the two fields. Moreover, an index of combined field may be generated and one of field of the combined field may be omitted. The matching degree of the other field is also obtained by another logical operation.

Document searching apparatus

A system for providing keywords to facilitate a search in a text retrieval system. For each of texts constituting a text base, the system creates a word ID of each of words used in the text and a word occurrence count of a corresponding word. The word occurrence count indicates a number of occurrences of a word in each text. For each of words used in any of the texts constituting the text base, the system creates a total word occurrence count and a containing text count indicative of the number of texts containing the word. For each of words contained in the selected texts, a degree of importance is calculated by using the word occurrence count, the total word occurrence count and the containing text count. The words contained in the selected texts are sorted in order of the degree of importance. At least a part of the sorted words are displayed as related keywords.

Keyword extracting system and text retrieval system using the same

A high-speed document retrieval system creates a regular expression dictionary and a word index on the basis of a retrieval document and a word dictionary to conduct retrieval to a document through the regular expression dictionary and the word index at a high speed. A regular expression dictionary expressing a set of character strings having the same length is created from a word dictionary. In terms of a character string included in a retrieval document and matching with a regular expression in the regular expression dictionary, an index element is recorded in a word index when there is no different index element which allows an observing index element to be deducible, which eventually produces a word index capable of achieving a high-speed full-text retrieval without the noticeable increase in the index capacity. The document retrieval system performs the retrieval of the retrieval document through the use of the word dictionary, the regular expression dictionary and the word index, so that a high-speed full-text retrieval is possible without the impairment of retrieval efficiency even if the retrieval character string is covered with words having a small number of characters and making less overlap.

A document retrieval system for searching a document coinciding with a retrieval request the user inputs and further ranking the document in accordance with the degree of coincidence between the document and the retrieval request. In the document retrieval system, a word frequency calculating section finds out the number of documents where a word appears, a frequency of occurrence of the word in a document and obtains a weighting parameter for the word, and a frequency score calculating section obtains a frequency score on the basis of the output of the word frequency calculating section. In addition, a word cooccurrence relation checking section checks word cooccurrence relations of the retrieval request and the document, and a cooccurrence score calculating section calculates a cooccurrence score from the degree of coincidence therebetween. A document score calculating section calculates a document score on the basis of the frequency score and the cooccurrence score. The documents are ranked in order of document score and displayed to the user.

Document retrieval system

A table of derivation elements and a state-transition table indicating applicable strings of derivation types are produced according to pronunciation expanding rules in a similar character string expanding apparatus. Each of the derivation elements is composed of a derived sound derived from a key sound placed at a key position of a question pronunciation character string, a sound position of the derived sound in each of character strings expanded from the question pronunciation character string and one or more derivation types indicating how the derived sound placed at the sound position is derived from the key sound placed at the key position. In a character string retrieving apparatus, strings of derivation types are produced one by one by arranging derivation types of the table of derivation elements in order of the sound position, and it is judged whether or not each of the strings of derivation types agrees with one of the applicable strings to judge whether or not each of the strings of derivation types satisfies the pronunciation expanding rules. Thereafter, trademark numbers corresponding to the strings of derivation types satisfying the pronunciation expanding rules are retrieved. Therefore, because any character strings similar in pronunciation to the question pronunciation character string is not directly used, the trademark numbers indicating trademarks similar to the question pronunciation character string can be retrieved at high speed.

Method and apparatus for expanding similar character strings

A document storing and managing system for storing plural electronic documents in each of folders according to classifications and managing the stored electronic documents in a unit of the folder has a folder managing means for managing attributes of the electronic documents included in each of the folders, a document version managing means for managing information as to version of the electronic documents included in each of the folder, and a folder version managing means for managing a correspondence relation between a version of the folder and a version of each of the electronic documents included in the folder. The document storing and managing system of this invention may set and manage a version of a folder while keeping adjustability with a version of each document.

Document storing and managing system

A new type of text search apparatus, capable of finding all occurrence positions of a search string that is an arbitrary character string, within a text which is written as a continous sequence of characters, utilizes for text position reference purposes in an index file, words which each occur (at least once within the text) as the maximum length word, referred to as an extension word, among a set of arbitrarily predefined dictionary words extending from a specific character position. Each such occurrence of a word as an extension word defines one of a set of text position elements, with that set covering all of the character positions of the text. The index file also includes a table which relates each of the extension words to the respective positions at which each of the partial character strings of the word occur within the word. Each occurrence of an arbitrary search string within the text can thereby be expressed as either a partial character string within a single text position element, or as a sequence of partial character strings within a set of sequentially occurring text position elements, so that all such occurrences can be found by utilizing the index file.

Full-text search apparatus utilizing two-stage index file to achieve

A constructing method of a finite state machine with failure transitions FFM is disclosed. The machine FFM is constructed from a nondeterministic finite-state machine and a string of external inputs. States &lt;p,q&gt; in the machine FFM is formed of a state set q included in the nondeterministic finite-state machine and a set p defined as a subset of the state set q, and the number of states &lt;p,q&gt; is finite. Also, an external input c takes the machine FFM from a current state s to a next state g(s,c) and an output .mu.(s) is output from the next state g(s,c) in cases where a value g(s,c) of a success function g is defined, and an external input c takes the machine FFM from the current state s to a state g(f(f...f(s)...)) determined by repeatedly calculating a value f(s) of a failure function f until a value g(f(f...f(s)...)) defined is found out in cases where the value g(s,c) of the success function g is not defined. Because all of transitions from the current state s for all external inputs c are not defined by the success function g, a storage capacity for storing the machine FFM is considerably reduced.

Growing community of inventors

Tokyo, Japan

Yuji Kanno