Increasing the efficiency of Prolog Lexical databases with N-gram Boolean cubes

Authors:
Richard Rankin
Affiliations:
Department of Computer Science, University of Arkansas
Venue:
SIGSMALL '88 Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES
Year:
1988

Citing 6
Cited 0

Extending the capabilities of word processing software through Horn clause lexical databases

AFIPS Conference Proceedings; vol. 55 1986 National Computer Conference
A logical framework for the correction of spelling errors in electronic documents

Information Processing and Management: an International Journal
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
A technique for computer detection and correction of spelling errors

Communications of the ACM
Spelling verification in prolog

ACM SIGPLAN Notices
Metamorphosis Grammars

Natural Language Communication with Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

PROLOG has been shown to be an effective tool for expressing the logic of many problems dealing with parsing, natural language processing, and spelling verification [1,7,8,9,12]. As a class, these problems deal with the manipulation of lexical databases as Horn clauses. Since PROLOG does not generally differentiate between program clauses and data clauses, the internal representation and manipulation of data may not be optimal for a particular application. This paper discusses an alternative method of representing and manipulating lexical databases through the use of N-gram analysis, prefiltering, and integration with another high level language.