Prolog

Marcus' original deterministic parsing included almost no part-of-speech ambiguity. In this paper, the addition of part-of-speech ambiguity to a deterministic parser written in Prolog is described. To handle this ambiguity, …...

This paper describes a system that attempts to interpret descriptive texts without the uJe of complex grammars. The purpose of the system is to transform the descriptions to a standard …...

This paper analyzes the requirements for adding a temporal reasoning component to a natural language database query system, and proposes a computational model that satisfies those requirements. A prelim- Inary …...

This report outlines a machine translation system whose linguistic component is based on principles of Government and Binding. A "universal grammar" is defined, together with pal-ameters of variation for specific …...

CRITAC (CRITiquing using ACcumulated knowledge) is an experimental expert system for proofreading Japanese text. It detects mistypes, Kana-to-Kanji misconversions, and stylistic errors. This system combines Prolog-coded heuristic knowledge with conventional …...

: Semantic processing is one of the important tasks for natural language processing. Basic to semantic processing is descriptions of lexical items. The most frequently used form of description of …...

This paper discusses a system for producing English descriptions (or "paraphrases") of tile content of formal relational calculus (RC) formulae expressing a database (DB) query. It explains the underlying design …...

This paper describes the SDC PUNDIT, (Prolog UNDerstands Integrated Text), system for processing natural language messages. 1 PUNDIT , written in Prolog, is a highly modular system consisting of distinct …...

This paper addresses the problems of movement transformation in Prolog-based bottom-up parsing system. Three principles of Government-Binding theory are employed to deal with these problems. They are Empty Category Principle, …...

We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOG programs are derived by an off-line compilation process: a parser …...

An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Nor- mat Form (GNF) for context-free grammars. The …...

We present a constraint-based morpholog- ical disambiguation system in which indi- vidual constraints vote on matching mor- phological parses, and disambiguation of all the tokens in a sentence is performed …...

In this paper we deal with several kinds of anaphora in unrestricted texts. These kinds of anaphora are pronominal references, surface- count anaphora and one-anaphora. In order to solve these …...

This paper presents a new bottom-up chart parsing algorithm for Prolog along with a compilation procedure that reduces the amount of copying at run-time to a con- stant number (2) …...

Documents are typically marked up to enable ren- dering and to facilitate reuse. However, retargetting a document often requires pervasive changes to the markup. Power et al. have proposed a …...

. This paper presents an implementation of a gramar of Dynamic Syntax for Japanese. Dynamic Syntax is a grammar formalism which enables a parser to process a sentence in an …...

AbstractThe main goal of the CLT Cloud project is to equip lexica, morphological processors, parsers and other software components developed within CLT (Centre of Language Technology) with so called web …...