95 results about "Lexical database" patented technology

A computer program product for controlling the computer's processor to perform responsive actions a natural language input has: (1) vocabulary, phrase and concept databases of words, phrase and concepts, respectively, that can be recognized in the inputted communication, wherein each of these database elements is representable by a designated semantic symbol, (2) means for searching the inputted communication to identify the words in the communication that are contained within the vocabulary database, (3) means for expressing the communication in terms of the word semantic symbols that correspond to each of the words identified in the inputted communication, (4) means for searching the communication when expressed in terms of its corresponding word semantic symbols so as to identify the phrases in the communication that are contained within the phrase database, (5) means for expressing the communication in terms of the phrase semantic symbols that correspond to each of the phrases identified in the communication, (6) means for searching the communication when expressed in terms of its corresponding phrase semantic symbols so as to identify the concepts in the communication that are contained within the concept database, and (7) means for expressing the communication in terms of the concept semantic symbols that correspond to each of the concepts identified in the inputted communication, wherein these concept semantic symbols are recognizable by the processor and can cause the processor to take action responsive to the inputted communication.

The present invention involves the dynamic loading and unloading of relatively small text-string vocabularies within a speech recognition system. In one embodiment, sub-databases of high likelihood text strings are created and prioritized such that those text strings are made available within definable portions of computer-transcribed dictations as a first-pass vocabulary for text matches. Failing a match within the first-pass vocabulary, the voice recognition software attempts to match the speech input to text strings within a more general vocabulary. In another embodiment, the first-pass text string vocabularies are organized and prioritized and loaded in relation to specific fields within an electronic form, specific users of the system and/or other general context-based, interrelationships of the data that provide a higher probability of text string matches then those otherwise provided by commercially available speech recognition systems and their general vocabulary databases.

The invention relates to a method and an apparatus for recognising speech, more particularly to a speech recognition system and method utilising a speech recognition dictionary supplemented by a lexicon containing frequently occurring word sequences (orthographies). In typical speech recognition systems, the process of speech recognition consists of scanning the vocabulary database or dictionary by using a fast match algorithm to find the top N candidates that potentially match the input speech. In a second pass the N candidates are re-scored using more precise likelihood computations. The novel method comprises the introduction of a step in the search stage that consists of forcing the insertion in the list of N candidates entries selected from a lexicon containing frequently used orthographies to increase the probability of occurrence of certain text combinations.

The present invention provides a method, system and computer program for naming a cluster, or a hierarchy of clusters, of words and phrases that have been extracted from a set of documents. The invention takes these clusters as the input and generates appropriate labels for the clusters using a lexical database. Naming involves first finding out all possible word senses for all the words in the cluster, using the lexical database; and then augmenting each word sense with words that are semantically similar to that word sense to form respective definition vectors. Thereafter, word sense disambiguation is done to find out the most relevant sense for each word. Definition vectors are clustered into groups. Each group represents a concept. These concepts are thereafter ranked based on their support. Finally, a pre-specified number of words and phrases from the definition vectors of the dominant concepts are selected as labels, based on their generality in the lexical database. Therefore, the labels may not necessarily consist of the original words in the cluster. A hierarchy of clusters is named in a recursive fashion starting from leaf clusters. Dominant concepts in child clusters are propagated into their parent to reduce the labeling complexity of parent clusters.

Techniques for relating data stored in one or more storage systems for an enterprise include managing information chunks in one or more storage systems. Each chunk comprises a unit of data for storage and retrieval operations. The techniques also include managing a vocabulary database. The vocabulary database includes data structures describing atomic concepts among names in an enterprise-specific vocabulary and data structures describing relationships among the atomic concepts. Content in a document is arranged based at least in part on data in the vocabulary database. The content is based at least in part on an information object or “chunk” in the storage system. Thus, content originally unrelated and authored over time by many different persons and organizations can be related using the business vocabulary concepts and relationships in the vocabulary database.

A virtual vocabulary database is provided for use with a with a particular user database as part of a speech recognition system. Vocabulary elements within the virtual database are imported from the user database and are tagged to include numerical data corresponding to the historical use of the vocabulary element within the user database. For each speech input, potential vocabulary element matches from the speech recognition system are provided to the virtual database software which creates virtual sub-vocabularies from the criteria according to predefined criteria templates. The software then applies vocabulary element weighting adjustments according to the virtual sub-vocabulary weightings and applies the adjustment to the default weighting provided by the speech recognition system. The modified weightings are returned with the associated vocabulary elements to the speech engine for selection of an appropriate match to the input speech.

An artificial intelligence problem is solved using an artificial intelligence memory graph data structure and a lexical database to identify supporting knowledge. A natural language input is received and classified into components. A starting node of an artificial intelligence memory graph data structure, which comprises one or more data nodes, is selected to begin a search for one or more supporting knowledge data nodes associated with the classified components. Starting at the starting node, the artificial intelligence memory graph data structure is searched using a lexical database to identify the one or more supporting knowledge data nodes. An artificial intelligence problem is identified and solved using the one or more identified supporting knowledge data nodes of the artificial intelligence memory graph data structure.

A speech recognition method and apparatus are provided for converting a voice stream into a digital voice stream representation. A method for performing speech recognition on a voice stream according to a first method embodiment includes the steps of determining one or more candidate transnemes in the voice stream, mapping the one or more candidate transnemes to a transneme table to convert the one or more candidate transnemes to one or more found transnemes, and mapping the one or more found transnemes to a transneme-to-vocabulary database to convert the one or more found transnemes to one or more speech units.

A method and system for conducting semantically weighted searches in a governed corpus of terms is provided. A search expression having a plurality of terms for performing a search in the governed corpus of terms is received. The governed corpus of terms comprises a plurality of corpus expressions each comprising a plurality of terms, each term within the governed corpus of terms being associated precisely with a single concept within a lexical database. At least one concept of the lexical database is assigned to each term in the search expression based on a syntactical analysis. A semantic similarity is calculated between pairs of concepts of the search expression and one of the corpus expressions. A total semantic similarity is calculated between the search expression and the one of the corpus expressions by aggregating the semantic similarities of the pairs of concepts based on an order of significance of the terms.

Methods, systems, and computer media implement a statistical spell checker for extracting suggested spell-check candidates for a query containing an unrecognized word. Vocabulary statistics are maintained, including recording a plurality of adjacent word sequences found in a document corpus. When a user query is received that contains a word not in the vocabulary database, i.e., an unrecognized word, the vocabulary statistics are consulted to find word sequences containing the same preceding word and/or succeeding word. The found word sequences may be returned in order based upon the conditional probability that given the recognized preceding and/or succeeding word(s), the unrecognized word is meant to be the suggested spell-checked word.

The invention relates to a method of building a character stock in a speech recognition system and a searching and comparing method thereof to solve the problem of calculating the same character repeatedly and reducing the whole operand. The method comprises the following steps of: 1) providing the data of polyphonic characters; 2) typing in the data; 3) building an acoustic model; 4) storing the data and the corresponding acoustic model thereof into the character stock. The character stock in the invention has the function of polyphonic characters recognition, so that the speech recognition system is closer to the pronunciation habit of the average users with human elements, therefore, enabling the users to follow the conventional pronunciation and to receive the correct recognition result.

An interactive method for composing an alphanumeric message by a caller using a telephone keypad includes storing (215) a lexical database (135) from which unigram probabilities, forward conditional probabilities, and backward conditional probabilities for a plurality of words can be recovered; storing a received sequence of key codes (405) representing a sequence in which keys on a telephone style keypad are keyed; generating a word trellis including candidate words (415) derived from the sequence and the lexical database; determining a most likely phrase (420) from the candidate words, the unigram probabilities, forward conditional probabilities, and backward conditional probabilities; generating a most likely message (425) from the most likely phrase and presenting the most likely message to the caller; and confirming that the most likely message is the alphanumeric message (430).

A succession Chinese character input method comprising the steps of: (a) inputting a Chinese character, and (b) fetching succession Chinese characters relative to the inputted Chinese character from a database of vocabulary of common succession Chinese characters and/or a database of vocabulary of self-edited succession Chinese characters, (c) and/or displaying fetched succession Chinese characters on a display screen, (d) selecting the desired succession Chinese character from the display screen for input. The database of vocabulary of common succession Chinese characters is prepared by collecting common succession Chinese characters subject to the characteristic that there is a successive relationship between every two concatenate Chinese characters in a Chinese sentence. The database of vocabulary of self-edited succession Chinese characters is prepared by collecting the inputted succession Chinese character which is automatically stored in the database of vocabulary of self-edited succession Chinese characters for further selection when no succession Chinese character was obtained from the database of vocabulary of common succession Chinese characters after input of one Chinese character. Whenever a Chinese character is inputted, the recently selected succession Chinese character of the same inputted Chinese character will be displayed on the first place. So as to increase the chance of inputting the Chinese characters by selecting Chinese characters from the display screen directly and to achieve a simple, convenient and fast input effect.