-
Notifications
You must be signed in to change notification settings - Fork 0
Verb Reduction
For each prediction topk replacements
For each source verb
In the case of induce
it will look like as follows:
- Now we introduce a [threshold parameter]
$\lambda$ . We ignore the verb replacements that is lower than$\lambda$ :
induce: {produce, express, mediate, cause, induce, stimulate}
We repeat this process for all the verbs in the corpus:
induce: {produce, express, mediate, cause, induce, stimulate}
reveal: {'indicate, determine, display, show, exhibit, suggest, reveal, demonstrate, depict, confirm},
block: {block, inhibit, prevent}
...
Find the smallest subset so that at least one verb is selected from each list. This fits the HittingSet (NP-Complete) problem. We use a SAT algorithm to extract the subset.