This paper describes a deterministic method for generating natural language suited to being part of a machine translation system with meaning representations as the level for language transfer. Starting from Davidsonian/Penman meaning representations, syntactic trees are built following the Penn Parsed Corpus of Modern British English, from which the yield (i.e., the words) can be taken. The no...

Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application areas like verification, diagnosis, planning, and design. Without clause learning, however, DPLL loses most of its effectiveness on real world problems. Recently there has been some work on obtaining a deeper understa...

An aspect of the Generalized Phrase Structure Grammar formalism proposed by Gazdar, et al. is the introduction of the notion of "slashed categories" to handle the parsing of structures, such as relative clauses, which involve unbounded dependencies. This has been implemented in Definite Clause Grammars through the technique of gap threading, in which a difference list of extracted noun phrases ...

The programming language PROLOG has proved to be an excellent tool for implementing natural language processing systems. Its built-in resolution and unification mechanisms are well suited to both accept and generate sentences of artificial and natural languages. Although supporting many different linguistic formalisms, its straightforwardness and elegance have perhaps best been demonstrated wit...

Natural language processing is a prompt research area across the country. Parsing is one of the very crucial tool in language analysis system which aims to forecast the structural relationship among the words in a given sentence. Many researchers have already developed so many language tools but the accuracy is not meet out the human expectation level, thus the research is still exists. Machine...

Conjunctive Normal Form (CNF) Boolean formulas generated from resolution or solution enumeration often have much redundancy. It is desirable to have an efficient algorithm to simplify and compact such CNF formulas on the fly. Given a clause in a CNF formula, if a subset of its literals constitutes another clause in the formula, then the first clause is said to be subsumed by the second clause. ...

This study provides evidence that resumptive pronouns (RPs) can facilitate the processing of long-distance subject relative clause (RC) dependencies during second language (L2) sentence comprehension, even where they are disallowed in both first (L1) and target language. A test group 29 L1-Korean L2 learners (L2ers) English a control 25 native speakers completed an online self-paced reading tas...

Abstract The Tangut language is of particular importance to the field Sino­Tibetan Studies, notably because its morphological conservatism, which unexpectedly correlated with a simplification syllable structure, consequence process Miyake (2012) called “compression”. Such conservatism evident in qualities reconstructed, sometimes reflect proto­ Tangut’s ancient derivational processes. Verbs als...

Gibson’s Dependency Locality Theory (DLT) [Gibson, E. 1998. Linguistic complexity: locality of syntactic dependencies. Cognition, 68, 1–76; Gibson, E. 2000. The dependency locality theory: A distance-based theory of linguistic complexity. In A. Marantz, Y. Miyashita, & W. O’Neil (Eds.), Image, Language, Brain (pp. 95–126). Cambridge, MA: MIT Press.] proposes that the processing complexity of a ...

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the s...