Semantic matching using predicate-argument structure
First Claim
1. A system that processes text intervals, comprising:
- a preprocessing module configured to;
extract a first proposition from a first text interval;
a generation module configured to;
generate a first proposition tree from the first proposition, wherein the first proposition tree comprises a set of nodes and a set of edges, and wherein each edge includes a semantic relationship between nodes of the first proposition tree; and
a matching module configured to;
determine a first similarity value between the first text interval and a second text interval based on a comparison of the first proposition tree and a second proposition tree corresponding to the second text interval, and selectively output the second text interval based on the first similarity value.
5 Assignments
0 Petitions
Accused Products
Abstract
The invention relates to topic classification systems in which text intervals are represented as proposition trees. Free-text queries and candidate responses are transformed into proposition trees, and a particular candidate response can be matched to a free-text query by transforming the proposition trees of the free-text query into the proposition trees of the candidate responses. Because proposition trees are able to capture semantic information of text intervals, the topic classification system accounts for the relative importance of topic words, for paraphrases and re-wordings, and for omissions and additions. Redundancy of two text intervals can also be identified.
-
Citations
25 Claims
-
1. A system that processes text intervals, comprising:
-
a preprocessing module configured to; extract a first proposition from a first text interval; a generation module configured to; generate a first proposition tree from the first proposition, wherein the first proposition tree comprises a set of nodes and a set of edges, and wherein each edge includes a semantic relationship between nodes of the first proposition tree; and a matching module configured to; determine a first similarity value between the first text interval and a second text interval based on a comparison of the first proposition tree and a second proposition tree corresponding to the second text interval, and selectively output the second text interval based on the first similarity value. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A method of processing text intervals, comprising:
-
extracting a first proposition from a first text interval; generating a first proposition tree from the first proposition, wherein the first proposition tree comprises a set of nodes and a set of edges, and wherein each edge includes a semantic relationship between nodes of the first proposition tree; determining a first similarity value between the first text interval and a second text interval based on a comparison of the first proposition tree and a second proposition tree corresponding to the second text interval; and selectively outputting the second text interval based the first similarity value. - View Dependent Claims (19, 20, 21, 22, 23, 24, 25)
-
Specification