摘要:
An information retrieval system stores and retrieves documents using particles and a particle-based language model. A set of particles for a collection of documents in a particular language is constructed from training documents such that a perplexity of the particle-based language model is substantially lower than the perplexity of a word-based language model constructed from the same training documents. The documents can then be converted to document particle graphs from which particle-based keys are extracted to form an index to the documents. Users can then retrieve relevant documents using queries also in the form of particle graphs.
摘要:
An indexing apparatus and method are described for use in identifying portions of data in a database for comparison with a query. In an embodiment, the index includes a key which comprises a sequence of phoneme classifications derived from the input query by classifying each of the phonemes in the input query with a number of phoneme classes, with the phonemes in each class being defined as those that are confusable with the other phonemes in the same class.
摘要:
Indexing, searching, and retrieving the content of speech documents (including but not limited to recorded books, audio broadcasts, recorded conversations) is accomplished by finding and retrieving speech documents that are related to a query term at a conceptual level, even if the speech documents does not contain the spoken (or textual) query terms. Concept-based cross-media information retrieval is used. A term-phoneme/document matrix is constructed from a training set of documents. Documents are then added to the matrix constructed from the training data. Singular Value Decomposition is used to compute a vector space from the term-phoneme/document matrix. The result is a lower-dimensional numerical space where term-phoneme and document vectors are related conceptually as nearest neighbors. A query engine computes a cosine value between the query vector and all other vectors in the space and returns a list of those term-phonemes and/or documents with the highest cosine value.
摘要:
A system is provided for matching two or more sequences of phonemes both or all of which may be generated from text or speech. A dynamic programming matching technique is preferably used having constraints which depend upon whether or not the two sequences are generated from text or speech and in which the scoring of the dynamic programming paths is weighted by phoneme confusion scores, phoneme insertion scores and phoneme deletion scores where appropriate.
摘要:
A method indexes and retrieves documents stored in a database. A document feature vector is extracted from each document and the documents are then indexed according to the feature vectors. A spoken query is converted to an intermediate representation representing likelihoods of possible sequential combinations of terms in the spoken query. A query certainty vector is generated from the intermediate representation. Other information is acquired. The other information is combined with the query certainty vector. The query vector and the other information are then compared to each of the document feature vectors to retrieve a ranked result set of documents.
摘要:
A system is provided for matching two or more sequences of phonemes both or all of which may be generated from text or speech. A dynamic programming matching technique is preferably used having constraints which depend upon whether or not the two sequences are generated from text or speech and in which the scoring of the dynamic programming paths is weighted by phoneme confusion scores, phoneme insertion scores and phoneme deletion scores where appropriate.
摘要:
A computer method is disclosed for ranking word similarities which is applicable to a variety of dictionary applications such as synonym generation, linguistic analysis, document characterization, etc. The method is based upon transforming an input word string into a key word which is invariant for certain types of errors in the input word, such as the doubling of letters, consonant/vowel transpositions, consonant/consonant transpositions. The specific mapping technique is a morphological mapping which generates keys which will have similarities that can be detected during a subsequent ranking procedure. The mapping is defined such that unique consonants of the input word are listed in their original order followed by the unique vowels for the input words, also in their original order. The keys thus generated will be invariant for consonant/vowel transpositions or doubled letters. The utility of the keys is further improved by arranging the consonants in the keys in alphabetical order followed by arranging the vowels in the keys in alphabetical order. The resultant mapping is insensitive to consonant/consonant transpositions, as well as consonant/vowel transpositions and doubled letters. The method then continues by applying a ranking technique which makes use of a compound measure of similarity for ranking the key words. By first measuring the number of basic operations needed to convert an input-derived key word into a dictionary-derived key word (the higher the number, the less similar are the words) and then secondly measuring the length of identical character segments in each pair of key words being matched (the longer the length, the greater the similarity), there is developed a scoring system for ranking the similarity of an input word to dictionary-derived key words, which ignores misspellings in the input word
摘要:
An information retrieval system stores and retrieves documents using particles and a particle-based language model. A set of particles for a collection of documents in a particular language is constructed from training documents such that a perplexity of the particle-based language model is substantially lower than the perplexity of a word-based language model constructed from the same training documents. The documents can then be converted to document particle graphs from which particle-based keys are extracted to form an index to the documents. Users can then retrieve relevant documents using queries also in the form of particle graphs.
摘要:
A method and system is provided for generating a group of phonetically similar masked data. The present application provides a method and system for generating a group of phonetically similar masked data; comprises preprocessing of input dataset values comprising a list of fictitious data values to be used as masked data; determining a plurality of groups of phonetically similar data values present in the dataset list; and deriving metaphone for each input data value to be masked; generating a first numeric code from derived metaphone value of input data value to be masked; selecting one group of phonetically similar data values out of the plurality of groups of phonetically similar data values based on the generated first numeric code; and generating a second numeric code from input data value for selecting a masked value from a plurality of fictitious data group.