Patent US5966686A successfully refreshed from Google Patents.
US5966686A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for computing semantic logical forms from syntax trees
Assignee: Microsoft Technology Licensing LLC
•
Filing: 1996-06-28
•
Granted: 1999-10-12
•
Expires: 2016-06-28
Abstract
Abstract Methods and computer systems for semantically analyzing natural language sentences. The natural language processing subsystems for morphological and syntactic analysis transform an input sentence into a syntax parse tree. Semantic analysis applies three sets of semantic rules to create a skeletal logical form graph from a syntax parse tree. Semantic analysis then applies two additional sets of semantic rules to provide semantically meaningful labels for the links of the logical form graph, to create additional logical form graph nodes for missing elements, and to unify redundant elements. The final logical form graph represents the complete semantic analysis of an input sentence.
Inventors
- 👤 George Heidorn
- 👤 Karen Jensen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 14:52
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/205; G06F40/211; G06F40/253; G06F40/30; Y; Y10; Y10S; Y10S707/00; Y10S707/99941; Y10S707/99944; Y10S707/99945; Y10S707/99948
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
153 words
A method in a computer system for generating a logical form graph for a phrase of words specified in a natural language, the natural language having a grammar specifying syntax of the natural language, the computer system having a memory the method comprising: generating in the memory all initial syntax parse tree of the phrase based on the grammar of the natural language, the initial syntax parse tree containing nodes representing syntactic construct of the words of the phrase; adjusting the initial syntax parse tree to complete syntactic analysis for syntactic constructs that arc implicit in the phrase; generating in the memory a skeletal logical form graph for the adjusted syntax parse tree, the skeletal logical form graph being represented in a data structure that is independent of a data structure of the syntax parse tree; and adjusting the skeletal logical form graph to identify semantic constructs to complete the logical form graph.
Claim 2
Independent Claim
153 words
A method in a computer system for generating a logical form graph for a phrase of words specified in a natural language, the natural language having a grammar specifying syntax of the natural language, the computer system having a memory the method comprising: generating in the memory all initial syntax parse tree of the phrase based on the grammar of the natural language, the initial syntax parse tree containing nodes representing syntactic construct of the words of the phrase; adjusting the initial syntax parse tree to complete syntactic analysis for syntactic constructs that arc implicit in the phrase; generating in the memory a skeletal logical form graph for the adjusted syntax parse tree, the skeletal logical form graph being represented in a data structure that is independent of a data structure of the syntax parse tree; and adjusting the skeletal logical form graph to identify semantic constructs to complete the logical form graph.
Claim 3
Dependent Claim
34 words
The method of claim 1 wherein the step of adjusting the initial syntax parse tree includes adding syntactic roles to the syntax parse tree for any syntactic constructs that are implicit in the phrase.
Claim 4
Dependent Claim
26 words
The method of claim 1 wherein the step of adjusting the skeletal logical form graph includes adding semantic labels to the generated skeletal logical form graph.
Claim 5
Dependent Claim
172 words
A computer-readable medium containing instructions for causing a computer system to generate a logical form graph for a sentence specified in a natural language, the natural language having a grammar specifying syntax of the natural language, the computer system having an initial syntax parse tree of the sentence that represents a parse of the sentence based on the grammar of the natural language, the initial syntax parse tree containing nodes representing syntactic construct of words of the sentence, the initial syntax parse tree being stored in memory of the computer system by: adjusting the initial syntax parse tree to complete syntactic analysis for syntactic constructs that are implicit in the sentence; generating in memory of The computer system a skeletal logical form graph for the adjusted syntax parse tree, the skeletal logical form graph being represented in a data structure that is independent of a data structure of the syntax parse tree; and adjusting the skelctal logical form graph to identify semantic constructs to complete the logical form graph for the sentence.
Claim 6
Dependent Claim
172 words
A computer-readable medium containing instructions for causing a computer system to generate a logical form graph for a sentence specified in a natural language, the natural language having a grammar specifying syntax of the natural language, the computer system having an initial syntax parse tree of the sentence that represents a parse of the sentence based on the grammar of the natural language, the initial syntax parse tree containing nodes representing syntactic construct of words of the sentence, the initial syntax parse tree being stored in memory of the computer system by: adjusting the initial syntax parse tree to complete syntactic analysis for syntactic constructs that are implicit in the sentence; generating in memory of The computer system a skeletal logical form graph for the adjusted syntax parse tree, the skeletal logical form graph being represented in a data structure that is independent of a data structure of the syntax parse tree; and adjusting the skelctal logical form graph to identify semantic constructs to complete the logical form graph for the sentence.
Claim 7
Dependent Claim
34 words
The computer-readable medium of claim 4 wherein the adjusting of the initial syntax parse tree includes adding syntactic roles to the syntax parse tree for any syntactic constructs that are implicit in the sentence.
Claim 8
Dependent Claim
25 words
The computer-readable medium of claim 4 wherein adjusting of the skeletal logical form graph includes adding semantic labels to the generated skeletal logical form graph.
Claim 9
Independent Claim
133 words
A method in a computer system for processing input text representing a phrase or sentence of a natural language in order to represent in the computer system at least one meaning of the input text that a human speaker of the natural language would understand the input text to represent, the method comprising the steps of: generating in memory of the computer system a first data structure for a syntax parse tree from the input text to represent a syntactic analysis of the input text; and generating in memory of the computer system a second data structure for a logical form graph to represent a semantic analysis of the input text, the second data structure being generated from the syntax parse tree but being a separate data structure from the first data structure.
Claim 10
Independent Claim
133 words
A method in a computer system for processing input text representing a phrase or sentence of a natural language in order to represent in the computer system at least one meaning of the input text that a human speaker of the natural language would understand the input text to represent, the method comprising the steps of: generating in memory of the computer system a first data structure for a syntax parse tree from the input text to represent a syntactic analysis of the input text; and generating in memory of the computer system a second data structure for a logical form graph to represent a semantic analysis of the input text, the second data structure being generated from the syntax parse tree but being a separate data structure from the first data structure.
Claim 11
Dependent Claim
142 words
A computer system for processing input text representing a phrase or sentence of a natural language in order to represent in the computer system at least one meaning of the input text that a human speaker of the natural language would understand the input text to represent, the system comprising: a component that generates in memory of the computer system a syntax parse tree from the input text to represent a syntactic analysis of the input text; and a component that generates in memory of the computer system a logical form graph to represent a semantic analysis of the input text, the logical form graph being stored in a data structure that is separate from a data structure in which the generated syntax parse tree is stored, the logical form graph being generated based in part on the generated syntax parse tree.
Claim 12
Dependent Claim
142 words
A computer system for processing input text representing a phrase or sentence of a natural language in order to represent in the computer system at least one meaning of the input text that a human speaker of the natural language would understand the input text to represent, the system comprising: a component that generates in memory of the computer system a syntax parse tree from the input text to represent a syntactic analysis of the input text; and a component that generates in memory of the computer system a logical form graph to represent a semantic analysis of the input text, the logical form graph being stored in a data structure that is separate from a data structure in which the generated syntax parse tree is stored, the logical form graph being generated based in part on the generated syntax parse tree.
Claim 13
Dependent Claim
66 words
The system of claim 8 wherein the component that generates a separate logical form graph comprises the following sub-components: a first sub-component that generates an initial skeletal logical form graph; and a second sub-component that identifies semantic roles for the nodes of the skeletal logical form graph and labels the directed links of the skeletal logical form graph to produce a final, complete logical form graph.
References Cited (Backward Citations)
US5111398A
Cited
US5386556A
Cited
EP0413132A2
Cited
US5146406A
Cited
US5424947A
Cited
US5406480A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-10-11 | 2003-04-12 | 2003-10-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-10-11 | 2007-04-12 | 2007-10-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-10-11 | 2011-04-12 | 2011-10-12 | $7700.00 | Window Closed / Lapsed |