nltk.sem.drt.DrtExpression

class documentation

class DrtExpression(object): (source)

Known subclasses: nltk.sem.drt.DRS, nltk.sem.drt.DrtAbstractVariableExpression, nltk.sem.drt.DrtApplicationExpression, nltk.sem.drt.DrtBinaryExpression, nltk.sem.drt.DrtLambdaExpression, nltk.sem.drt.DrtNegatedExpression, nltk.sem.drt.DrtProposition, nltk.sem.drt.PossibleAntecedents

View In Hierarchy

This is the base abstract DRT Expression from which every DRT Expression extends.

Class Method	`fromstring`	Undocumented
Method	`__add__`	Undocumented
Method	`__and__`	Undocumented
Method	`__gt__`	Undocumented
Method	`__neg__`	Undocumented
Method	`__or__`	Undocumented
Method	`applyto`	Undocumented
Method	`draw`	Undocumented
Method	`eliminate_equality`	Undocumented
Method	`equiv`	Check for logical equivalence. Pass the expression (self <-> other) to the theorem prover. If the prover says it is valid, then the self and other are equal.
Method	`get_refs`	Return the set of discourse referents in this DRS. :param recursive: bool Also find discourse referents in subterms? :return: list of `Variable` objects
Method	`is_pronoun_function`	Is self of the form "PRO(x)"?
Method	`make_EqualityExpression`	Undocumented
Method	`make_VariableExpression`	Undocumented
Method	`pretty_format`	Draw the DRS :return: the pretty print string
Method	`pretty_print`	Undocumented
Method	`resolve_anaphora`	Undocumented
Method	`typecheck`	Undocumented
Property	`type`	Undocumented
Class Variable	`_drt_parser`	Undocumented

@classmethod
def fromstring(cls, s): (source) ¶

Undocumented

def __add__(self, other): (source) ¶

Undocumented

def __and__(self, other): (source) ¶

Undocumented

def __gt__(self, other): (source) ¶

Undocumented

def __neg__(self): (source) ¶

Undocumented

def __or__(self, other): (source) ¶

Undocumented

def applyto(self, other): (source) ¶

Undocumented

def draw(self): (source) ¶

Undocumented

def eliminate_equality(self): (source) ¶

overridden in nltk.sem.drt.DRS, nltk.sem.drt.DrtAbstractVariableExpression, nltk.sem.drt.DrtConcatenation, nltk.sem.drt.DrtProposition

Undocumented

def equiv(self, other, prover=None): (source) ¶

Check for logical equivalence. Pass the expression (self <-> other) to the theorem prover. If the prover says it is valid, then the self and other are equal.

Parameters
other	an `DrtExpression` to check equality against
prover	a `nltk.inference.api.Prover`

def get_refs(self, recursive=False): (source) ¶

overridden in nltk.sem.drt.DRS, nltk.sem.drt.DrtAbstractVariableExpression, nltk.sem.drt.DrtApplicationExpression, nltk.sem.drt.DrtBinaryExpression, nltk.sem.drt.DrtNegatedExpression, nltk.sem.drt.DrtProposition

Return the set of discourse referents in this DRS. :param recursive: bool Also find discourse referents in subterms? :return: list of Variable objects

def is_pronoun_function(self): (source) ¶

Is self of the form "PRO(x)"?

def make_EqualityExpression(self, first, second): (source) ¶

Undocumented

def make_VariableExpression(self, variable): (source) ¶

Undocumented

def pretty_format(self): (source) ¶

Draw the DRS :return: the pretty print string

def pretty_print(self): (source) ¶

Undocumented

def resolve_anaphora(self): (source) ¶

Undocumented

def typecheck(self, signature=None): (source) ¶

Undocumented

@property
type = (source) ¶

Undocumented

_drt_parser = (source) ¶

Undocumented