nltk.sem.chat80.Concept

class documentation

class Concept(object): (source)

Constructor: Concept(prefLabel, arity, altLabels, closures, extension)

View In Hierarchy

A Concept class, loosely based on SKOS (http://www.w3.org/TR/swbp-skos-core-guide/).

Method __init__ @keyword altLabels: other (related) labels :type altLabels: list @keyword closures: closure properties of the extension (list items can be symmetric, reflexive, transitive) :type closures: list @keyword extension: the extensional value of the concept :type extension: set...
Method __repr__ Undocumented
Method __str__ Undocumented
Method augment Add more data to the Concept's extension set.
Method close Close a binary relation in the Concept's extension set.
Instance Variable altLabels Undocumented
Instance Variable arity Undocumented
Instance Variable closures Undocumented
Instance Variable extension Undocumented
Instance Variable prefLabel Undocumented
Method _make_graph Convert a set of pairs into an adjacency linked list encoding of a graph.
Method _make_pairs Convert an adjacency linked list back into a set of pairs.
Method _transclose Compute the transitive closure of a graph represented as a linked list.
Instance Variable _extension Undocumented
def __init__(self, prefLabel, arity, altLabels=[], closures=[], extension=set()): (source)

@keyword altLabels: other (related) labels :type altLabels: list @keyword closures: closure properties of the extension (list items can be symmetric, reflexive, transitive) :type closures: list @keyword extension: the extensional value of the concept :type extension: set

Parameters
prefLabel:strthe preferred label for the concept
arity:intthe arity of the concept
altLabelsUndocumented
closuresUndocumented
extensionUndocumented
def __repr__(self): (source)

Undocumented

def __str__(self): (source)

Undocumented

def augment(self, data): (source)

Add more data to the Concept's extension set.

Parameters
data:string or pair of stringsa new semantic value
Returns
setUndocumented
def close(self): (source)

Close a binary relation in the Concept's extension set.

Returns
a new extension for the Concept in which the relation is closed under a given property
altLabels = (source)

Undocumented

arity = (source)

Undocumented

closures = (source)

Undocumented

extension = (source)

Undocumented

prefLabel = (source)

Undocumented

def _make_graph(self, s): (source)

Convert a set of pairs into an adjacency linked list encoding of a graph.

def _make_pairs(self, g): (source)

Convert an adjacency linked list back into a set of pairs.

def _transclose(self, g): (source)

Compute the transitive closure of a graph represented as a linked list.

_extension = (source)

Undocumented