Patent US5386556A successfully refreshed from Google Patents.
US5386556A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Natural language analyzing apparatus and method
Assignee: International Business Machines Corp
•
Filing: 1992-12-23
•
Granted: 1995-01-31
•
Expires: 2012-12-23
Abstract
Abstract A natural language (NL) analyzing system is provided with the capability to analyze NL expressions and to resolve ambiguities and present them to the user for verification of correct interpretation. A conceptual model of the system, relevant to the application in which the invention is implemented, is created (customizing the system) by the user, and is stored as a conceptual schema. The schema is built of logical facts representing entities (concepts) and relationships between entities, forming a description of the universe of discourse or object system in question. The entities of the schema have at least one external connection, namely to natural language terms in a vocabulary. The schema itself is completely language independent, though the components of it may have "names" expressed in a natural language such as English. There may be a second connection to the entities, namely where the system is used in a query system for relational data bases. In this case the entities of the schema represent objects in the data base, and thus there is a connection between the entities and those objects of the data base. The actual analysis of NL expressions is performed by a natural language engine (NLE) in cooperation with an analysis grammar and the schema. The analysis results in an intermediate, language-independent logic form representation of the input, which is paraphrased back to NL for verification. If the input is a query, there is a translation into a query language such as SQL.
Inventors
- 👤 Erik B. Hedin
- 👤 Gregor I. Jonsson
- 👤 Lars E. Olsson
- 👤 Mohammad A. Sanamrad
- 👤 Sven O. G. Westling
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-23 20:59
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/24; G06F16/245; G06F16/2452; G06F16/24526; G06F40/00; G06F40/30; G06F16/24522; G06F16/30; G06F16/33; G06F16/3331; G06F16/334; G06F16/3344; G06F40/20; G06F40/205; G06F40/211; G06F40/253; G06F40/268; G06F40/40; G06F40/42; G06F40/47; G06F40/55; G06F40/56; G06F40/58; Y; Y10; Y10S; Y10S706/00; Y10S706/902; Y10S706/934; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99934
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
375 words
A natural language analyzing apparatus comprising: a data base store comprising a data base containing tables; a grammar store comprising a grammar for a natural language comprising a set of language dependent syntax rules for the natural language, at least one syntax rule having one or more associated semantic routines; a vocabulary store comprising a vocabulary containing terms of the natural language, definitions of the terms, and morphological information about the terms; a conceptual model store comprising a conceptual model having (i) a set of language independent records of information defining entities, each entity having a connection to at least one term in the vocabulary, at least one entity having a connection to the data base tables, and each term in the vocabulary being defined by at least one entity, and (ii) a set of records identifying relationships between different entities; means for inputting a series of words based in the natural language; parsing means for generating one or more syntactically valid parse trees for the input series of words based on the vocabulary and the syntax rules, and for building, for each parse tree, an executable set of semantic routines based on one or more semantic routines associated with one or more of the syntax rules used to generate the parse tree; generator means for executing the set of semantic routines generated by the parser to create a language independent representation of the input series of words, wherein executing the semantic routine comprises checking groups of one or more words in the parse trees against the conceptual model for conceptual validity; output means for producing, from said language independent representation of the input series of words, a natural language output series of words in the same language as the input series of words, said output series of words representing a paraphrase of the input series of words; confirmation means for requesting confirmation of the conceptual accuracy of the output series of words with reject to the input series of words and for receiving a confirmation from the user if the user determines that the output series of words conceptually matches the input series of words; and query generator means responsive to the confirmation for producing a data base query from the language independent representation.
Claim 2
Dependent Claim
375 words
A natural language analyzing apparatus comprising: a data base store comprising a data base containing tables; a grammar store comprising a grammar for a natural language comprising a set of language dependent syntax rules for the natural language, at least one syntax rule having one or more associated semantic routines; a vocabulary store comprising a vocabulary containing terms of the natural language, definitions of the terms, and morphological information about the terms; a conceptual model store comprising a conceptual model having (i) a set of language independent records of information defining entities, each entity having a connection to at least one term in the vocabulary, at least one entity having a connection to the data base tables, and each term in the vocabulary being defined by at least one entity, and (ii) a set of records identifying relationships between different entities; means for inputting a series of words based in the natural language; parsing means for generating one or more syntactically valid parse trees for the input series of words based on the vocabulary and the syntax rules, and for building, for each parse tree, an executable set of semantic routines based on one or more semantic routines associated with one or more of the syntax rules used to generate the parse tree; generator means for executing the set of semantic routines generated by the parser to create a language independent representation of the input series of words, wherein executing the semantic routine comprises checking groups of one or more words in the parse trees against the conceptual model for conceptual validity; output means for producing, from said language independent representation of the input series of words, a natural language output series of words in the same language as the input series of words, said output series of words representing a paraphrase of the input series of words; confirmation means for requesting confirmation of the conceptual accuracy of the output series of words with reject to the input series of words and for receiving a confirmation from the user if the user determines that the output series of words conceptually matches the input series of words; and query generator means responsive to the confirmation for producing a data base query from the language independent representation.
Claim 3
Dependent Claim
16 words
An apparatus as claimed in claim 1, wherein the data base is a relational data base.
Claim 4
Dependent Claim
25 words
The apparatus as claimed in claim 2, further comprising means responsive to the query generating means for producing a response to the data base query.
Claim 5
Dependent Claim
66 words
An apparatus as claimed in claim 3, comprising means for storing a previous query, and means for storing for the previous query a corresponding answer set, said answer set comprising a query statement, a specification of how much of the data in the data base tables is to be presented to a user of the apparatus, and information on a mode of presentation of the data.
Claim 6
Independent Claim
335 words
A method of querying an information store comprising the steps of: generating a computer-readable input representing an input series of words in a natural language; parsing an input expression to generate one or more syntactically valid parse trees for the input series of words based on a vocabulary containing terms of the natural language, definitions of the terms, and morphological information about the terms, and based on syntax rules of a grammar for the natural language, at least one syntax rule having one or more associated semantic routines; building, for each parse tree, an executable set of semantic routines based on the one or more semantic routines associates with the at least one syntax rules having one or more associated semantic routines and used to generate the parse tree; executing the executable set of semantic routines to create a language independent representation of the input series of words based on a conceptual model having (i) a set of language independent records of information defining entities, each entity having a connection to at least one term in the vocabulary, at least one entity having a connection to a data base table, and each term in the vocabulary being defined by at least one entity, and (ii) a set of records identifying relationships between different entities, wherein executing the semantic routine comprises checking groups of one or more words in the parse trees against the conceptual model for conceptual validity; producing, from said language independent representation of the input series of words, a natural language output series of words in the same language as the input series of words, said output series of words representing a paraphrase of the input series of words; requesting confirmation of the conceptual accuracy of the output series of words with respect to the input series of words, and producing a confirmation if the output series of words is conceptually correct; and if the confirmation is produced, producing, in response to the confirmation, a data base query from the language independent representation.
Claim 7
Independent Claim
335 words
A method of querying an information store comprising the steps of: generating a computer-readable input representing an input series of words in a natural language; parsing an input expression to generate one or more syntactically valid parse trees for the input series of words based on a vocabulary containing terms of the natural language, definitions of the terms, and morphological information about the terms, and based on syntax rules of a grammar for the natural language, at least one syntax rule having one or more associated semantic routines; building, for each parse tree, an executable set of semantic routines based on the one or more semantic routines associates with the at least one syntax rules having one or more associated semantic routines and used to generate the parse tree; executing the executable set of semantic routines to create a language independent representation of the input series of words based on a conceptual model having (i) a set of language independent records of information defining entities, each entity having a connection to at least one term in the vocabulary, at least one entity having a connection to a data base table, and each term in the vocabulary being defined by at least one entity, and (ii) a set of records identifying relationships between different entities, wherein executing the semantic routine comprises checking groups of one or more words in the parse trees against the conceptual model for conceptual validity; producing, from said language independent representation of the input series of words, a natural language output series of words in the same language as the input series of words, said output series of words representing a paraphrase of the input series of words; requesting confirmation of the conceptual accuracy of the output series of words with respect to the input series of words, and producing a confirmation if the output series of words is conceptually correct; and if the confirmation is produced, producing, in response to the confirmation, a data base query from the language independent representation.
Claim 8
Dependent Claim
18 words
The method as claimed in claim 5, further comprising querying a data base with the data base query.
Claim 9
Dependent Claim
41 words
A method as claimed in claim 6, wherein if an answer cannot directly be retrieved from-the data base tables in one single query statement, temporary tables are created and filed with data, said temporary tables being queried for a final answer.
Claim 10
Dependent Claim
20 words
A method as claimed in claim 7, wherein the data is ordered by ascending or descending value; of the data.
Claim 11
Dependent Claim
23 words
A method as claimed in claim 8, wherein only a selected portion of the data is presented to a user of the method.
Claim 12
Dependent Claim
45 words
A method as claimed in claim 9, wherein an answer set comprising an instruction to create and fill the temporary tables, together with the query and a range of data to be selected from the temporary tables, is stored in a log for later use.
Claim 13
Dependent Claim
26 words
A method as claimed in claim 10, wherein the stored answer set is copied into an input field of a query panel of a query program.
References Cited (Backward Citations)
US4706212A
Cited
GB2096374A
Cited
EP0091317A2
Cited
US4688195A
Cited
EP0168814A2
Cited
US5091876A
Cited
US4821230A
Cited
US4931935A
Cited
US4914590A
Cited
US5197005A
Cited
US5237502A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-01-30 | 1998-08-01 | 1999-01-31 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-01-30 | 2002-08-01 | 2003-01-31 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-01-30 | 2006-08-01 | 2007-01-31 | $7700.00 | Window Closed / Lapsed |