Projecting Semantic Information from a Language Independent Syntactic Model
First Claim
Patent Images
1. A method, comprising:
- creating a logical form (LF) model that provides a semantically non-ambiguous LF syntax tree from a rule expression, the semantically non-ambiguous LF syntax tree representing one or more anaphoric references in the rule expression;
analyzing a sentential structure of a rule expression for a plurality of clauses that include at least one expression and at least one rule using the LF model, the plurality of clauses including a plurality of conditional clauses;
translating the rule expression into a semantically non-ambiguous LF syntax tree based on the LF model, the translating includes adjoining the plurality of conditional clauses by resolving one or more anaphoric references; and
presenting the semantically non-ambiguous LF syntax tree.
2 Assignments
0 Petitions
Accused Products
Abstract
Embodiments for the conversion of Computational Independent Model (CIM) rule expressions into semantically non-ambiguous syntax trees are disclosed. In accordance with one embodiment, a method includes analyzing a sentential structure of a Computational Independent Model (CIM) rule expression for clauses. The clauses include at least one expression and at least one rule. The method further includes constructing a semantically non-ambiguous LF syntax tree from the CIM rule expression. The construction being implemented using a logical form (LF) model.
75 Citations
20 Claims
-
1. A method, comprising:
-
creating a logical form (LF) model that provides a semantically non-ambiguous LF syntax tree from a rule expression, the semantically non-ambiguous LF syntax tree representing one or more anaphoric references in the rule expression; analyzing a sentential structure of a rule expression for a plurality of clauses that include at least one expression and at least one rule using the LF model, the plurality of clauses including a plurality of conditional clauses; translating the rule expression into a semantically non-ambiguous LF syntax tree based on the LF model, the translating includes adjoining the plurality of conditional clauses by resolving one or more anaphoric references; and presenting the semantically non-ambiguous LF syntax tree. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A computer readable medium storing computer-executable instructions that, when executed, cause one or more processors to perform acts comprising:
-
analyzing a sentential structure of a Computational Independent Model (CIM) rule expression for a plurality of clauses that include at least one expression and at least one rule; constructing a semantically non-ambiguous LF syntax tree from the CIM rule expression using a logical form (LF) model; and presenting the semantically non-ambiguous LF syntax tree. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20)
-
-
19. A transformer, comprising:
-
an input component that receives a Computational Independent Model (CIM) rule expression, the CIM rule expression including at least one anaphoric reference, the at least one anaphoric reference being a pronominal link between an antecedent reference and one of a definite description or a pronoun; a logical form (LF) model that resolves the at least one anaphoric reference into a semantically disambiguated representation; an algorithm that generates a semantically non-ambiguous LF syntax tree from the CIM rule expression based on the LF model, the semantically non-ambiguous LF syntax tree including the semantically disambiguated representation; and an output component that present the semantically non-ambiguous LF syntax tree.
-
Specification