Skip to content

Computation and Language papers — page 20

cmp-lgBrowse archive

On Constraint-Based Lambek Calculi
We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly…
Jochen Doerre, Suresh ManandharAug 15, 1995
Learn
A Dynamic Approach to Rhythm in Language: Toward a Temporal Phonology
It is proposed that the theory of dynamical systems offers appropriate tools to model many phonological aspects of both speech production and perception. A dynamic account of speech rhythm is shown…
Robert Port, Fred Cummins, Michael GasserAug 13, 1995
Learn
Bi-Lexical Rules for Multi-Lexeme Translation in Lexicalist MT
The paper presents a prototype lexicalist Machine Translation system (based on the so-called `Shake-and-Bake' approach of Whitelock (1992) consisting of an analysis component, a dynamic bilingual…
Arturo TrujilloAug 12, 1995
Learn
A Matching Technique in Example-Based Machine Translation
This paper addresses an important problem in Example-Based Machine Translation (EBMT), namely how to measure similarity between a sentence fragment and a set of stored examples. A new method is…
Lambros Cranias, Harris Papageorgiou, Stelios PiperidisAug 10, 1995
Learn
A Compositional Treatment of Polysemous Arguments in Categorial Grammar
We discuss an extension of the standard logical rules (functional application and abstraction) in Categorial Grammar (CG), in order to deal with some specific cases of polysemy. We borrow from…
Anne-Marie Mineur, Paul BuitelaarAug 2, 1995
Learn
Parsing English with a Link Grammar
We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link grammar. Although the…
Daniel D. K. Sleator, Davy TemperleyAug 2, 1995
Learn
A Robust Parsing Algorithm For Link Grammars
In this paper we present a robust parsing algorithm based on the link grammar formalism for parsing natural languages. Our algorithm is a natural extension of the original dynamic programming…
Dennis Grinberg, John Lafferty, Daniel SleatorAug 2, 1995
Learn
Bridging as Coercive Accommodation
In this paper we discuss the notion of "bridging" in Discourse Representation Theory as a tool to account for discourse referents that have only been established implicitly, through the…
Johan Bos, Paul Buitelaar, Anne-Marie MineurAug 2, 1995
Learn
Co-Indexing Labelled DRSs to Represent and Reason with Ambiguities
The paper addresses the problem of representing ambiguities in a way that allows for monotonic disambiguation and for direct deductive computation. The paper focuses on an extension of the formalism…
Uwe ReyleJul 25, 1995
Learn
Generalizing Case Frames Using a Thesaurus and the MDL Principle
We address the problem of automatically acquiring case-frame patterns from large corpus data. In particular, we view this problem as the problem of estimating a (conditional) distribution over a…
Hang Li, Naoki AbeJul 24, 1995
Learn
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms
We consider the problem of learning a certain type of lexical semantic knowledge that can be expressed as a binary relation between words, such as the so-called sub-categorization of verbs (a…
Naoki Abe, Hang Li, Atsuyoshi NakamuraJul 24, 1995
Learn
Indexed Languages and Unification Grammars
Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string…
Tore BurheimJul 24, 1995
Learn
A Grammar Formalism and Cross-Serial Dependencies
First we define a unification grammar formalism called the Tree Homomorphic Feature Structure Grammar. It is based on Lexical Functional Grammar (LFG), but has a strong restriction on the syntax of…
Tore BurheimJul 24, 1995
Learn
Specifying Logic Programs in Controlled Natural Language
Writing specifications for computer programs is not easy since one has to take into account the disparate conceptual worlds of the application domain and of software development. To bridge this…
Norbert E. Fuchs, Rolf SchwitterJul 21, 1995
Learn
A Constraint-based Case Frame Lexicon Architecture
In Turkish, (and possibly in many other languages) verbs often convey several meanings (some totally unrelated) when they are used with subjects, objects, oblique objects, adverbial adjuncts, with…
Kemal Oflazer, Okan YilmazJul 21, 1995
Learn
An Efficient Algorithm for Surface Generation
A method is given that "inverts" a logic grammar and displays it from the point of view of the logical form, rather than from that of the word string. LR-compiling techniques are used to…
Christer SamuelssonJul 21, 1995
Learn
Transfer in a Connectionist Model of the Acquisition of Morphology
The morphological systems of natural languages are replete with examples of the same devices used for multiple purposes: (1) the same type of morphological process (for example, suffixation for both…
Michael GasserJul 20, 1995
Learn
Comparative Ellipsis and Variable Binding
In this paper, we discuss the question whether phrasal comparatives should be given a direct interpretation, or require an analysis as elliptic constructions, and answer it with Yes and No. The most…
Jan Lerner, Manfred PinkalJul 19, 1995
Learn
GRAMPAL: A Morphological Processor for Spanish implemented in Prolog
A model for the full treatment of Spanish inflection for verbs, nouns and adjectives is presented. This model is based on feature unification and it relies upon a lexicon of allomorphs both for stems…
Antonio Moreno, José M. GoñiJul 18, 1995
Learn
Robust Processing of Natural Language
Previous approaches to robustness in natural language processing usually treat deviant input by relaxing grammatical constraints whenever a successful analysis cannot be provided by…
Wolfgang MenzelJul 13, 1995
Learn
A framework for lexical representation
In this paper we present a unification-based lexical platform designed for highly inflected languages (like Roman ones). A formalism is proposed for encoding a lemma-based lexical source, well suited…
José M. Goñi, José C. GonzálezJul 6, 1995
Learn
Constraint Categorial Grammars
Although unification can be used to implement a weak form of β-reduction, several linguistic phenomena are better handled by using some form of λ-calculus. In this paper we present a higher order…
Luis Damas, Nelma MoreiraJul 4, 1995
Learn
A Computational Approach to Aspectual Composition
In this paper, I argue, contrary to the prevailing opinion in the linguistics and philosophy literature, that a sortal approach to aspectual composition can indeed be explanatory. In support of this…
Michael WhiteJul 1, 1995
Learn
A Categorial Framework for Composition in Multiple Linguistic Domains
This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but…
Cem Bozsahin, Elvan GocmenJun 29, 1995
Learn
An Approach to Proper Name Tagging for German
This paper presents an incremental method for the tagging of proper names in German newspaper texts. The tagging is performed by the analysis of the syntactic and textual contexts of proper names…
Christine ThielenJun 28, 1995
Learn
← PreviousPage 20Next →