Parallel Inference on a Linguistic Knowledge Base

Authors:
Sanda M. Harabagiu;Dan I. Moldovan
Affiliations:
-;-
Venue:
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Year:
1997

Citing 5
Cited 0

WordNet: a lexical database for English

Communications of the ACM
Integrating Marker Passing and Problem Solving: A Spreading Activation Approach to Improved Choice in Planning

Integrating Marker Passing and Problem Solving: A Spreading Activation Approach to Improved Choice in Planning
SNAP: A Market-Propagation Architecture for Knowledge Processing

IEEE Transactions on Parallel and Distributed Systems
A Parallel Algorithm for Text Inference

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a possible solution for the text inference problem - extracting information unstated in a text, but implied. The inference algorithm consists of a set of highly parallel search methods that when applied to the knowledge base find contexts of sentences that reveal information relevant to the text. Implementation, results and parallelism analysis are discussed.