public class ForwardEntailer extends java.lang.Object implements java.util.function.BiFunction<SemanticGraph,java.lang.Boolean,ForwardEntailerSearchProblem>
| Modifier and Type | Field and Description |
|---|---|
int |
maxResults
The maximum number of results to return from a single search.
|
int |
maxTicks
The maximum number of ticks top search for.
|
NaturalLogicWeights |
weights
The weights to use for entailment.
|
| Constructor and Description |
|---|
ForwardEntailer(int maxResults,
int maxTicks,
NaturalLogicWeights weights)
Create a new searcher with the specified parameters.
|
ForwardEntailer(int maxResults,
NaturalLogicWeights weights) |
ForwardEntailer(NaturalLogicWeights weights) |
| Modifier and Type | Method and Description |
|---|---|
ForwardEntailerSearchProblem |
apply(SemanticGraph parseTree,
java.lang.Boolean truthOfPremise)
Create a new search problem instance, given a sentence (possibly fragment), and the corresponding
parse tree.
|
public final int maxTicks
public final int maxResults
public final NaturalLogicWeights weights
public ForwardEntailer(int maxResults,
int maxTicks,
NaturalLogicWeights weights)
maxResults - The maximum number of results to return from a single search.maxTicks - The maximum number of ticks to search for.weights - The natural logic weights to use for the searches.public ForwardEntailer(int maxResults,
NaturalLogicWeights weights)
public ForwardEntailer(NaturalLogicWeights weights)
public ForwardEntailerSearchProblem apply(SemanticGraph parseTree, java.lang.Boolean truthOfPremise)
apply in interface java.util.function.BiFunction<SemanticGraph,java.lang.Boolean,ForwardEntailerSearchProblem>parseTree - The original tree of the sentence we are beginning withtruthOfPremise - The truth of the premise. In most applications, this will just be true.