nltk.sem.drt.DrtConcatenation

class documentation

class DrtConcatenation(DrtBooleanExpression): (source)

Constructor: DrtConcatenation(first, second, consequent)

View In Hierarchy

DRS of the form '(DRS + DRS)'

Method __eq__ Defines equality modulo alphabetic variance. If we are comparing x.M and y.N, then check equality of M and N[x/y].
Method __init__ Undocumented
Method __ne__ Undocumented
Method __str__ Undocumented
Method eliminate_equality Undocumented
Method fol Undocumented
Method get_refs No summary
Method getOp Undocumented
Method replace Replace all instances of variable v with expression E in self, where v is free in self.
Method simplify No summary
Method visit No summary
Instance Variable consequent Undocumented
Method _pretty Undocumented
Method _pretty_subex Undocumented
Method _str_subex Undocumented

Inherited from DrtBinaryExpression (via DrtBooleanExpression):

Static Method _assemble_pretty Undocumented

Inherited from DrtExpression (via DrtBooleanExpression, DrtBinaryExpression):

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 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 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

Inherited from BooleanExpression (via DrtBooleanExpression, DrtBinaryExpression, DrtExpression):

Method _set_type :see Expression._set_type()

Inherited from BinaryExpression (via DrtBooleanExpression, DrtBinaryExpression, DrtExpression, BooleanExpression):

Method findtype :see Expression.findtype()
Instance Variable first Undocumented
Instance Variable second Undocumented

Inherited from Expression (via DrtBooleanExpression, DrtBinaryExpression, DrtExpression, BooleanExpression, BinaryExpression):

Method __call__ Undocumented
Method __hash__ Undocumented
Method __lt__ Undocumented
Method __repr__ Undocumented
Method constants Return a set of individual constants (non-predicates). :return: set of Variable objects
Method free Return a set of all the free (non-bound) variables. This includes both individual and predicate variables, but not constants. :return: set of Variable objects
Method negate If this is a negated expression, remove the negation. Otherwise add a negation.
Method normalize Rename auto-generated unique variables
Method predicates Return a set of predicates (constants, not variables). :return: set of Variable objects
Method substitute_bindings No summary
Method variables Return a set of all the variables for binding substitution. The variables returned include all free (non-bound) individual variables and any variable starting with '?' or '@'. :return: set of Variable objects...
Method visit_structured Recursively visit subexpressions. Apply 'function' to each subexpression and pass the result of each function application to the 'combinator' for aggregation. The combinator must have the same signature as the constructor...
Class Variable _logic_parser Undocumented
Class Variable _type_checking_logic_parser Undocumented
def __eq__(self, other): (source)
overrides nltk.sem.logic.BinaryExpression.__eq__

Defines equality modulo alphabetic variance. If we are comparing x.M and y.N, then check equality of M and N[x/y].

def __init__(self, first, second, consequent=None): (source)
overrides nltk.sem.logic.BinaryExpression.__init__

Undocumented

def __ne__(self, other): (source)
overrides nltk.sem.logic.BinaryExpression.__ne__

Undocumented

def __str__(self): (source)
overrides nltk.sem.logic.BinaryExpression.__str__

Undocumented

def eliminate_equality(self): (source)
overrides nltk.sem.drt.DrtExpression.eliminate_equality

Undocumented

def fol(self): (source)

Undocumented

def get_refs(self, recursive=False): (source)
overrides nltk.sem.drt.DrtBinaryExpression.get_refs
See Also
AbstractExpression.get_refs()
def getOp(self): (source)

Undocumented

def replace(self, variable, expression, replace_bound=False, alpha_convert=True): (source)
overrides nltk.sem.logic.Expression.replace

Replace all instances of variable v with expression E in self, where v is free in self.

def simplify(self): (source)
overrides nltk.sem.logic.Expression.simplify
Returns
beta-converted version of this expression
def visit(self, function, combinator): (source)
overrides nltk.sem.logic.BinaryExpression.visit
See Also
Expression.visit()
consequent = (source)

Undocumented

def _pretty(self): (source)
overrides nltk.sem.drt.DrtBinaryExpression._pretty

Undocumented

def _pretty_subex(self, subex): (source)
overrides nltk.sem.drt.DrtBinaryExpression._pretty_subex

Undocumented

def _str_subex(self, subex): (source)
overrides nltk.sem.logic.BinaryExpression._str_subex

Undocumented