• Corpus ID: 21332824

Mapping Dependency Relationships into Semantic Frame Relationships

@inproceedings{Silva2013MappingDR,
  title={Mapping Dependency Relationships into Semantic Frame Relationships},
  author={Nisansa de Silva and C. S. N. J. Fernando and M. K. D. T. Maldeniya and D. N. C. Wijeratne and Amal Perera and Ben Goertzel},
  year={2013}
}
We describe the refactoring process of the RelEx2Frame component of OpenCog AGI Framework, a method for expanding concept variables used in RelEx and automatic generation of a common sense knowledge base specifically with relation to concept relationships. The wellknown Drools rule engine is used instead of hand-coded rules; an asynchronous concurrent architecture and an indexing mechanism are designed to gain performance of re-factored RelEx2Frame. WordNet aided supervised learning mechanism… 

Figures and Tables from this paper

References

SHOWING 1-9 OF 9 REFERENCES
Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach
TLDR
This approach integrates a diverse set of knowledge sources to disambiguate word sense, including part of speech of neighboring words, morphological form, the unordered set of surrounding words, local collocations, and verb-object syntactic relation.
Semantic Similarity Based on Corpus Statistics and Lexical Taxonomy
This paper presents a new approach for measuring semantic similarity/distance between words and concepts. It combines a lexical taxonomy structure with corpus statistical information so that the
Word Independent Context Pair Classification Model for Word Sense Disambiguation
TLDR
This paper presents a weakly supervised learning approach to WSD based on learning a word independent context pair classification model that achieves state-of-the-art performance in the unsupervised learning category, and performs comparably with the supervised Naive Bayes system.
Mining strong affinity association patterns in data sets with skewed support distribution
TLDR
The concept of hyperclique pattern is proposed, which uses an objective measure called h-confidence to identify strong affinity patterns and the novel concept of cross-support property for eliminating patterns involving items with substantially different support levels.
Incrementally fast updated frequent pattern trees
TLDR
A fast updated FP-tree (FUFP- tree) structure is proposed, which makes the tree update process become easier and an incremental FUFP-tree maintenance algorithm is also proposed for reducing the execution time in reconstructing the tree when new transactions are inserted.
Mining frequent patterns without candidate generation
TLDR
This study proposes a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develops an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth.
Statistical Word Learning Based on Cross-Situational Observation
One way young children could learn words is by pairing spoken words with co-occurring possible referents in the extralinguistic environment, collecting multiple such pairs, and then figuring out the
Drools Expert Documentation
  • [Online]. Available: http://downloads.jboss.com/drools/docs/5.1.1.34858.FINAL/droolsexpert/html/index.html [Accessed: 15-Nov-2010]
  • 2010
“ Drools Expert Documentation , ” [ Online ]
  • 2006