kb

Class ConceptManager

Object

kb.ConceptManager

public class ConceptManager
extends Object

Manages the interface between CRAFT and the conceptual graphs of CharGer. Responsible for locating and organizing concepts from CharGer graphs that might be needed by CRAFT.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	ConceptManager.ConceptsToInclude Which concepts are to be included in the relation table.

Field Summary

Fields

Modifier and Type	Field and Description
(package private) static int	col
static int	COL_CONCEPT_1
static int	COL_CONCEPT_2
static int	COL_CONCEPT_LABEL_1
static int	COL_CONCEPT_LABEL_2
static int	COL_RELATION
static int	COL_RELATION_LABEL
static int	COL_SENTENCE_LABEL
static int	COL_SUBGRAPH
(package private) static JTable	conceptTable
static ArrayList	conceptTypeList
static Action	makeTypeHierarchyAction An action for augmenting a CharGer type hierarchy, suitable for adding to menus and buttons.
static TypeLabel	top

Constructor Summary

Constructors

Constructor and Description
ConceptManager()

Method Summary

Modifier and Type	Method and Description
private static void	addNewTypeLabels(Graph g) Adds any new type labels (i.e., not already in the type label graph) to the given type hierarchy graph.
static String	binaryRelationTableEntryToHTML(ArrayList tableEntry) Creates html TD tags that must be enclosed in TR and TABLE tags somewhere else.
static String	convertTriplesToHTMLtable(ArrayList triples, String summary) Converts a ArrayList of tableEntry's to an HTML work sheet (usable for manual analysis of the relations), with a summary.
private static void	fillInGlossaryDefinitions(Graph g) Fills in a hierarchy graph with definitions found from any source.
static TypeLabel[]	findBySynset(net.didion.jwnl.data.Synset s, Graph g) Seeks out nodes one of whose type descriptors contains the synset given.
static AbstractTypeDescriptor	findLongestTermAlreadyDefined(ArrayList wordlist, int startWord) Starting with the word at the startWord position, find the longest term that has a definition somewhere in the set of repertory grids.
static ArrayList	getAll(GraphObject pattern) Finds all instances of the given kind of object in all available graphs.
static Vector	getAllConcepts(ConceptManager.ConceptsToInclude selector) Prepares a vector of (concept label, filename, concept object ) from all open graphs.
static ArrayList<BinaryTuple>	getAllRelationTuples(ConceptManager.ConceptsToInclude selector) Prepares a list each of whose entries is a (nested) arraylist as described in makeTableEntryArrayList.
static ArrayList<BinaryTuple>	getBinaryRelationTuples(ConceptManager.ConceptsToInclude selector) Prepares a list each of whose entries is a (nested) liat as described in makeTableEntryArrayList.
static ArrayList<BinaryTuple>	getBinaryRelationTuples(Graph g, ConceptManager.ConceptsToInclude selector) Gathers together all the binary relation tuples in a given graph.
static TableModel	getBinaryTupleModel(ConceptManager.ConceptsToInclude selector) A triple is a set of concept-relation-concept tuples.
static JTable	getBinaryTupleTable(ConceptManager.ConceptsToInclude selector) A triple is a set of concept-relation-concept tuples.
static Vector	getConceptColumnLabels()
static JTable	getConceptTable() Gather all concepts - same as getConceptTable( ALL )
static JTable	getConceptTable(ConceptManager.ConceptsToInclude selector) Gather all concepts according to the selector.
static AbstractTypeDescriptor[]	getSensesFromPhrase(String phrase, WordnetManager wnmgr) Try to establish senses for the attribute phrase for a given row of the repertory grid table.
static void	linkHypernyms(TypeLabel t, net.didion.jwnl.data.Synset s, Graph h) Looks for type labels possessing synsets that are hypernyms (either direct or indirect) of the given synset.
static void	linkTypeLabels(Graph h)
static String	makeSentence(Concept c1, GNode rel, Concept c2) Makes a matching schemme suitable for matching binary relations with the target graph.
static String	makeSentenceOLD(Concept c1, GNode rel, Concept c2)
protected static ArrayList	makeTableEntryArrayList(Concept c1, GNode rel, Concept c2, ConceptManager.ConceptsToInclude selector) Constructs a single table entry from a charger concept-relation-concept set.
static String	makeTerm(ArrayList _words, int startWord, int endWord) create a sub-term by taking the words from startWord to endWord - 1
static Graph	makeTypeHierarchy() Create a graph in a window that reflects the inferred type hierarchy.
private static boolean	okayToAddTypeLabel(Concept c, ArrayList typelabelvector) Determine whether a given concept's type label should be added to a type hierarchy.
private static boolean	swapBinaryRelation(Concept c1, GNode rel, Concept c2) Decides heuristically whether to exchange the sense of the relationship, regardless of the arrow direction.

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

conceptTable

static JTable conceptTable

col

static int col

COL_SENTENCE_LABEL

public static final int COL_SENTENCE_LABEL

COL_CONCEPT_LABEL_1

public static final int COL_CONCEPT_LABEL_1

COL_RELATION_LABEL

public static final int COL_RELATION_LABEL

COL_CONCEPT_LABEL_2

public static final int COL_CONCEPT_LABEL_2

COL_CONCEPT_1

public static final int COL_CONCEPT_1

COL_RELATION

public static final int COL_RELATION

COL_CONCEPT_2

public static final int COL_CONCEPT_2

COL_SUBGRAPH

public static final int COL_SUBGRAPH

conceptTypeList

public static ArrayList conceptTypeList

top

public static TypeLabel top

makeTypeHierarchyAction

public static Action makeTypeHierarchyAction

An action for augmenting a CharGer type hierarchy, suitable for adding to menus and buttons. Really just a wrapper for makeTypeHierarchy. Returns the Action.NAME Hub.strs( "MakeTypeHierarchyLabel" ).

See Also:

Global.strs(java.lang.String), makeTypeHierarchy()

Constructor Detail

ConceptManager

public ConceptManager()

Method Detail

getConceptTable

public static JTable getConceptTable()

Gather all concepts - same as getConceptTable( ALL )

getBinaryTupleTable

public static JTable getBinaryTupleTable(ConceptManager.ConceptsToInclude selector)

A triple is a set of concept-relation-concept tuples.

Parameters:

selector - whether to gather all concepts or just generic ones

• ALL - for all concepts
• GENERIC_ONLY - for just concepts without referents

See Also:

getConceptTable(), getBinaryRelationTuples(charger.obj.Graph, kb.ConceptManager.ConceptsToInclude)

getBinaryTupleModel

public static TableModel getBinaryTupleModel(ConceptManager.ConceptsToInclude selector)

A triple is a set of concept-relation-concept tuples.

Parameters:

selector - whether to gather all concepts or just generic ones

• ALL - for all concepts
• GENERIC_ONLY - for just concepts without referents

See Also:

getConceptTable(), getBinaryRelationTuples(charger.obj.Graph, kb.ConceptManager.ConceptsToInclude)

getConceptTable

public static JTable getConceptTable(ConceptManager.ConceptsToInclude selector)

Gather all concepts according to the selector.

Parameters:

selector - tells which collection of concepts to gather: one of GENERIC_ONLY or ALL

See Also:

getAllConcepts(kb.ConceptManager.ConceptsToInclude)

getConceptColumnLabels

public static Vector getConceptColumnLabels()

getAll

public static ArrayList getAll(GraphObject pattern)

Finds all instances of the given kind of object in all available graphs.

Parameters:

pattern - An empty instance indicating the class (or superclass) of the objects to be collected.

Returns:

A list of the objects desired. Any filtering has to be done afterward (yes, it's inefficient!).

getAllConcepts

public static Vector getAllConcepts(ConceptManager.ConceptsToInclude selector)

Prepares a vector of (concept label, filename, concept object ) from all open graphs.

Parameters:

selector - one of GENERIC_ONLY or ALL

Returns:

a vector, where each component of the vector is a nested vector containing the concept label, ownerframe title (if any) and concept object.

getBinaryRelationTuples

public static ArrayList<BinaryTuple> getBinaryRelationTuples(Graph g,
                                                             ConceptManager.ConceptsToInclude selector)

Gathers together all the binary relation tuples in a given graph.

Parameters:

g - The charger graph whose relations are to be examined.

selector - Which concepts to gather.

Returns:

a vector of Table Entry vectors

See Also:

makeTableEntryArrayList(charger.obj.Concept, charger.obj.GNode, charger.obj.Concept, kb.ConceptManager.ConceptsToInclude)

getBinaryRelationTuples

public static ArrayList<BinaryTuple> getBinaryRelationTuples(ConceptManager.ConceptsToInclude selector)

Prepares a list each of whose entries is a (nested) liat as described in makeTableEntryArrayList. Tuples are obtained from every visible graph.

Parameters:

selector - Which concepts to gather.

See Also:

getConceptTable(), makeTableEntryArrayList(charger.obj.Concept, charger.obj.GNode, charger.obj.Concept, kb.ConceptManager.ConceptsToInclude)

getAllRelationTuples

public static ArrayList<BinaryTuple> getAllRelationTuples(ConceptManager.ConceptsToInclude selector)

Prepares a list each of whose entries is a (nested) arraylist as described in makeTableEntryArrayList. Tuples are obtained from every visible graph.

Parameters:

selector - Which concepts to gather.

See Also:

getConceptTable(), makeTableEntryArrayList(charger.obj.Concept, charger.obj.GNode, charger.obj.Concept, kb.ConceptManager.ConceptsToInclude)

makeTableEntryArrayList

protected static ArrayList makeTableEntryArrayList(Concept c1,
                                                   GNode rel,
                                                   Concept c2,
                                                   ConceptManager.ConceptsToInclude selector)

Constructs a single table entry from a charger concept-relation-concept set.

Returns:

a single vector containing:

• element 0 - phrase,
• element 1 - concept label,
• element 2 - relation label,
• element 3 - concept label,
• element 4 - actual 1st (CharGer) concept
• element 5 - actual (CharGer) relation
• element 6 - actual 2nd (CharGer) concept

convertTriplesToHTMLtable

public static String convertTriplesToHTMLtable(ArrayList triples,
                                               String summary)

Converts a ArrayList of tableEntry's to an HTML work sheet (usable for manual analysis of the relations), with a summary.

Parameters:

triples - a ArrayList of binary relation table entries.

summary - string used to identify the table in HTML, but not otherwise displayed.

See Also:

makeTableEntryArrayList(charger.obj.Concept, charger.obj.GNode, charger.obj.Concept, kb.ConceptManager.ConceptsToInclude)

binaryRelationTableEntryToHTML

public static String binaryRelationTableEntryToHTML(ArrayList tableEntry)

Creates html TD tags that must be enclosed in TR and TABLE tags somewhere else.

See Also:

makeTableEntryArrayList(charger.obj.Concept, charger.obj.GNode, charger.obj.Concept, kb.ConceptManager.ConceptsToInclude)

swapBinaryRelation

private static boolean swapBinaryRelation(Concept c1,
                                          GNode rel,
                                          Concept c2)

Decides heuristically whether to exchange the sense of the relationship, regardless of the arrow direction. Looks at the relation's label and if it's one of a few selected ones, returns true.

makeSentence

public static String makeSentence(Concept c1,
                                  GNode rel,
                                  Concept c2)

Makes a matching schemme suitable for matching binary relations with the target graph.

makeSentenceOLD

public static String makeSentenceOLD(Concept c1,
                                     GNode rel,
                                     Concept c2)

getSensesFromPhrase

public static AbstractTypeDescriptor[] getSensesFromPhrase(String phrase,
                                                           WordnetManager wnmgr)

Try to establish senses for the attribute phrase for a given row of the repertory grid table. NEEDS a way to bring in defaults; for now, we just do a search of all the available type descriptors and hope something turns up.

makeTerm

public static String makeTerm(ArrayList _words,
                              int startWord,
                              int endWord)

create a sub-term by taking the words from startWord to endWord - 1

findLongestTermAlreadyDefined

public static AbstractTypeDescriptor findLongestTermAlreadyDefined(ArrayList wordlist,
                                                                   int startWord)

Starting with the word at the startWord position, find the longest term that has a definition somewhere in the set of repertory grids.

Returns:

the descriptor of the longest term found; null if none found.

See Also:

KnowledgeManager.findTypeDescriptor(java.lang.String, boolean)

makeTypeHierarchy

public static Graph makeTypeHierarchy()

Create a graph in a window that reflects the inferred type hierarchy. Looks among the known knowledge sources for a graph that contains type labels and picks one arbitrarily that will have new types and glossary text possibly added to it. If the graph is already in a window, then a refresh of that window should reveal the augmented hierarchy.

Returns:

The graph (typically consisting of type labels only) with as many definitions filled in as possible.

See Also:

KnowledgeManager.findGraphsWithTypeHierarchy()

fillInGlossaryDefinitions

private static void fillInGlossaryDefinitions(Graph g)

Fills in a hierarchy graph with definitions found from any source.

addNewTypeLabels

private static void addNewTypeLabels(Graph g)

Adds any new type labels (i.e., not already in the type label graph) to the given type hierarchy graph. If a new type label is found in some concept, that concept's label and type descriptor(s) (if any) are assigned to a new type label, which is inserted into graph g using a crude heuristic for layout. If the type hierarchy graph is actually changed (i.e., if there are really any new type labels added) then its ownerframe (if any) is marked as changed and brought to the front. NEED a routine to first find multi-word phrases and turn them into their own types. NEED to also check relations!!

Parameters:

g - original graph to be modified in-place.

okayToAddTypeLabel

private static boolean okayToAddTypeLabel(Concept c,
                                          ArrayList typelabelvector)

Determine whether a given concept's type label should be added to a type hierarchy. If the concept's type is already in the hierarchy, then don't add it.

linkTypeLabels

public static void linkTypeLabels(Graph h)

linkHypernyms

public static void linkHypernyms(TypeLabel t,
                                 net.didion.jwnl.data.Synset s,
                                 Graph h)

Looks for type labels possessing synsets that are hypernyms (either direct or indirect) of the given synset. If any are found, appropriate links are created. If it's possible to link to a type label, there's no further looking upward from that type label.

Parameters:

t - original (possible subtype)

s - t's synset to begin with, or a recursively-obtained one

h - the graph to restrict searching

See Also:

linkTypeLabels(charger.obj.Graph)

findBySynset

public static TypeLabel[] findBySynset(net.didion.jwnl.data.Synset s,
                                       Graph g)

Seeks out nodes one of whose type descriptors contains the synset given.

Parameters:

s - the synset whose GNode is sought.

g - the graph where the type label search is * limited; null if we want all type labels from all graphs.

Returns:

the set of non-duplicated nodes with that synset