Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-06T19:49:08.759Z Has data issue: false hasContentIssue false

Interactive Text Graph Mining with a Prolog-Based Dialog Engine

Published online by Cambridge University Press:  07 October 2020

PAUL TARAU
Affiliation:
Department of Computer Science and Engineering, University of North Texas, 1155 Union Circle, Denton, Texas 76203, USA, (e-mails: paul.tarau@unt.edu, eduardo.blanco@unt.edu)
EDUARDO BLANCO
Affiliation:
Department of Computer Science and Engineering, University of North Texas, 1155 Union Circle, Denton, Texas 76203, USA, (e-mails: paul.tarau@unt.edu, eduardo.blanco@unt.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

On top of a neural network-based dependency parser and a graph-based natural language processing module, we design a Prolog-based dialog engine that explores interactively a ranked fact database extracted from a text document. We reorganize dependency graphs to focus on the most relevant content elements of a sentence and integrate sentence identifiers as graph nodes. Additionally, after ranking the graph, we take advantage of the implicit semantic information that dependency links and WordNet bring in the form of subject–verb–object, “is-a” and “part-of” relations. Working on the Prolog facts and their inferred consequences, the dialog engine specializes the text graph with respect to a query and reveals interactively the document’s most relevant content elements. The open-source code of the integrated system is available at https://github.com/ptarau/DeepRank.

Information

Type
Rapid Communication
Copyright
© The Author(s), 2020. Published by Cambridge University Press