This paper describes a system in PROLOG for the automatic transforination of a grammar, written in LFG formalism, into a DCG-based parser. It demonstrates the main principles of the transformation, the representation of f-structures and constraints, the treatment of long-distance dependencies, and left rccursion. Finally some problem areas of the system and possibilities for overcoming them are...

This paper presents the design and implementation of an intelligent document understanding and reproduction system. The system analyses a printed document to create an electronic document. The electronic document is written in a standard type-setting language (L w), and is thus human usable. The output from processing the electronic document closely resembles the original printed document. A ne...

The sentential theory of propositional attitudes is very attractive to AI workers, but it is difficult to use such a theory to assign semantics to English sentences about attitudes. The problem is that a compositional semantics cannot easily build the logical forms that the theory requires. We present a new notation for a sentential theory, and a unification grammar that builds logical forms in...

The aim of this paper is to describe a technique for identifying the sources of several types of syntactic ambiguity in Arabic Sentences with a single parse only. Normally, any sentence with two or more structural representations is said to be syntactically ambiguous. However, Arabic sentences with only one structural representation may be ambiguous. Our technique for identifying Syntactic Ambi...

This paper proposes a generation method for feature-structured)ased unification grammars. As comlx~red with fixed ~rity term notation, feature structure notation is more tlexible for representing knowledge needed to generate idiom~ttic structures as well as genem~l constructions. The method enables feature strncture retrieval via nmltiple indices. The indexing mechanism, when used with a semant...

The paper presents an algorithm, written in PROLOG, for processing English sentences which contain either Gapping, Right Node Raising (RNR) or Reduced Conjunction (RC). The DCG (Definite Clause Grammar) formalism (Pereira & Warren 80) is adopted. The algorithm is highly efficient and capable of processing a full range of coordinate constructions containing any number of coordinate conjunctions ...

This paper presents an information retrieval system for the NTCIR-7 information retrieval for question answering task. This system is composed by three parts: (1) Query processing (2) Retrieval model (3) Re-rank module. Query processing filters stop-words and selects query terms to generate a required term set for further retrieval. Threes retrieval models from two famous retrieval systems are ...

By generalizing the notion of location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous constituents of non-configurational languages. These discontinuous constituents can be described by a variant of definite clause grammars, and these grammars can be used in conjunction with a proof procedure to create a parser for non-configurational languages.