Method and system for generating lexicon of cooccurrence relations in natural language
July 17, 2007. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesTranslation between natural languages Method and apparatus for analyzing the syntactic structure of a sentence Method for automatic translation between natural languages System of simultaneous translation into a plurality of languages with sentence forming capabilities System to achieve automatic recognition of linguistic strings Multiple-parts-of-speech disambiguating method and apparatus for machine translation system Natural-language interface generating system Language processing dictionary for bidirectionally retrieving morphemic and semantic expressions Method for separating glycine and L-serine from a solution containing same Method for automatically registering frequently used phrases Patent #: 4744050 InventorsAssigneeApplicationNo. 922889 filed on 10/24/1986US Classes:704/10, Dictionary building, modification, or prioritization704/9Natural languageExaminersPrimary: James, Andrew J.Assistant: Nguyen, Viet Q. Attorney, Agent or FirmForeign Patent References
International ClassG06F 015/38Foreign Application Priority Data1985-10-25 JPAbstractA method and an apparatus for generating/maintaining automatically or interactively a lexicon for storing information of cooccurrence relations utilized for determining whether or not a sequence of words in a given sentence described in a natural language is semantically correct with the aid of a memory, a data processor and a textual sentence file. A hypothesized cooccurrence relation table for storing hypothesized cooccurrence relations each having a high probabliity of being a valid cooccurrence relation is prepared by consulting the file. A hypothesis for the cooccurrence relation is previously established on the basis of a cooccurrence relation pattern indicating a probably acceptable conjunction by consulting the hypothesized cooccurrence relation table. Subsequently, a corresponding actual cooccurrence relation is derived from the textual file by parsing the relevant textual sentence and is tested to determine whether the cooccurrence relation is valid or not with reference to predetermined threshold conditions. On the basis of the results of the test, the information of the cooccurrence relation is correspondingly modified. The present method and apparatus can be utilized in a natural language parsing system and a machine translation system.Other References
| |
