System for recognizing sentence patterns and a system for recognizing sentence patterns and grammatical cases

• US 5,418,716 A
• Filed: 07/26/1990
• Issued: 05/23/1995
• Est. Priority Date: 07/26/1990
• Status: Expired due to Fees

• Current Assignee: NEC Corporation
• Original Assignee: NEC Corporation
• Inventors: Suematsu, Hiroshi
• Primary Examiner(s): Weinhardt, Robert A.
• Assistant Examiner(s): BODENDORF, ANDREW
• Application Number:
  US07/557,833
• Time in Patent Office: 1,762 Days
• Field of Search: 364/419, 364/419.01, 364/419.04, 364/419.08
• US Class Current: 704/9
• CPC Class Codes: G06F 40/253 Grammatical analysis; Style critique

Abstract

A slot table contains (1) all possible sentence patterns (VPs), arranged in rows, which a predicate in an input sentence can take, and (2) arguments of the VPs expressed as slot conditions in slots positioned in a finite number of positions. A grammatical case pattern table contains columns corresponding to respective grammatical cases of the basic patterns arranged in the order in which the cases appear in a basic pattern before shifting; all the grammatical case patterns are expressed as binary values representing existing/non-existing ones of the respective grammatical cases in respective rows corresponding to the grammatical case patterns. The binary values are added up to numbers of the position information in the basic pattern, and the grammatical cases, which correspond to columns that correspond to the last number among numbers of the binary values, are treated as grammatical cases for arguments of the VP. One position on the slot table is selected with respect to candidates for arguments of VPs in the input sentence, and a candidate'"'"'s features are compared with the slot conditions of all possible VPs in slots in the same position. Plural VPs are processed in parallel by recognizing as being appropriate only those VPs with slots whose slot conditions match the candidate'"'"'s features, and only the grammatical cases that have been described in the slots of such recognized VPs are recognized as appropriate. Because a finite number of positions is set on the slot table, comparison of slot conditions, in positions other than the specific position, with candidate'"'"'s features is unnecessary.

Claims

1. A natural language processing system for recognizing sentence patterns (VPs) and grammatical cases comprising:

means for providing a slot table which contains all VPs available to a predicate in an input sentence arranged in plural rows, and which contains arguments of the VPs expressed as slot conditions in slots positioned in a finite number of positions;

a grammatical case pattern table which contains columns corresponding to grammatical cases that are arranged in the objective word-order found among grammatical cases in declarative sentences, and which contains all grammatical case patterns expressed as binary representations of existing/non-existing ones of grammatical cases in the rows corresponding to the grammatical case patterns;

means for converting position information for arguments of a VP to grammatical cases on the grammatical case pattern table, which includes means for adding up numerical values, representing existing/non-existing ones of grammatical cases for the grammatical case patterns corresponding to VPs, until the sum of the numerical values adds up to the number of the position information in a basic pattern, and which treats as grammatical cases of the arguments of the VP only those grammatical cases corresponding to columns that correspond to the last number among the numerical values that have been added up; and

means for processing a plurality of VPs in parallel, which includes means for comparing features of a candidate for arguments of VPs in the input sentence with corresponding slot conditions of the slots which belong to a selected position on the slot table through all available VPs, which recognizes as matched VPs only VPs that have a slot where each of all compared slot conditions shares the same value with the corresponding feature of the candidate, and which recognizes as matched grammatical cases only grammatical cases that have been described in the slots of the matched VPs.

2. A natural language processing system for recognizing sentence pattern (VPs) and grammatical cases as claimed in claim 1, wherein the positions on the slot table are set by the locations of arguments in relation to the predicate.

3. A natural language processing system for recognizing sentence patterns (VPs) and grammatical cases as claimed in claim 1, wherein the positions on the slot table are set by case markers.

4. A natural language processing system for recognizing sentence patterns (VPs) and grammatical cases as claimed in claim 1, wherein the means for providing the slot table comprises means for extracting all VPs available to a predicate in an input sentence, a slot table template, and means for converting information on the VPs for the predicate to slot conditions on a slot table by using the slot table template.

5. A natural language processing system for recognizing sentence patterns (VPs) and grammatical cases as claimed in claim 1, wherein the means for comparing the candidate'"'"'s features with the slot conditions of all available VPs in slots in a selected position comprises means for handling the slot table by slot table handling functions.

6. A natural language processing system for recognizing sentence patterns (VPs) and grammatical cases as claimed in claim 1, wherein existing/non-existing grammatical cases are expressed as 1/0, respectively.