Skip to content

Computation and Language papers — page 16

cmp-lgBrowse archive

Using Terminological Knowledge Representation Languages to Manage Linguistic Resources
I examine how terminological languages can be used to manage linguistic data during NL research and development. In particular, I consider the lexical semantics task of characterizing semantic verb…
Pamela W. JordanMay 14, 1996
Learn
A Simple Transformation for Offline-Parsable Grammars and its Termination Properties
We present, in easily reproducible terms, a simple transformation for offline-parsable grammars which results in a provably terminating parsing program directly top-down interpretable in Prolog. The…
Marc DymetmanMay 14, 1996
Learn
Processing Complex Sentences in the Centering Framework
We extend the centering model for the resolution of intra-sentential anaphora and specify how to handle complex sentences. An empirical evaluation indicates that the functional information structure…
Michael StrubeMay 14, 1996
Learn
Functional Centering
Based on empirical evidence from a free word order language (German) we propose a fundamental revision of the principles guiding the ordering of discourse entities in the forward-looking centers…
Michael Strube, Udo HahnMay 14, 1996
Learn
Where Defaults Don't Help: the Case of the German Plural System
The German plural system has become a focal point for conflicting theories of language, both linguistic and cognitive. We present simulation results with three simple classifiers - an ordinary…
Ramin Charles Nakisa, Ulrike HahnMay 13, 1996
Learn
Noun-Phrase Analysis in Unrestricted Text for Information Retrieval
Information retrieval is an important application area of natural-language processing where one encounters the genuine challenge of processing large quantities of unrestricted natural-language text.…
David A. Evans, Chengxiang ZhaiMay 13, 1996
Learn
Efficient Tabular LR Parsing
We give a new treatment of tabular LR parsing, which is an alternative to Tomita's generalized LR algorithm. The advantage is twofold. Firstly, our treatment is conceptually more attractive…
Mark-Jan Nederhof, Giorgio SattaMay 13, 1996
Learn
Learning Dependencies between Case Frame Slots
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we propose a method of learning dependencies between case frame…
Hang Li, Naoki AbeMay 12, 1996
Learn
Clustering Words with the MDL Principle
We address the problem of automatically constructing a thesaurus (hierarchically clustering words) based on corpus data. We view the problem of clustering words as that of estimating a joint…
Hang Li, Naoki AbeMay 12, 1996
Learn
A Chart Generator for Shake and Bake Machine Translation
A generation algorithm based on an active chart parsing algorithm is introduced which can be used in conjunction with a Shake and Bake machine translation system. A concise Prolog implementation of…
Fred PopowichMay 10, 1996
Learn
Parsing for Semidirectional Lambek Grammar is NP-Complete
We study the computational complexity of the parsing problem of a variant of Lambek Categorial Grammar that we call semidirectional. In semidirectional Lambek calculus there is an…
Jochen DoerreMay 10, 1996
Learn
Adapting the Core Language Engine to French and Spanish
We describe how substantial domain-independent language-processing systems for French and Spanish were quickly developed by manually adapting an existing English-language system, the SRI Core…
Manny Rayner, David Carter, Pierrette BouillonMay 10, 1996
Learn
Counting Coordination Categorially
This paper presents a way of reducing the complexity of parsing free coordination. It lives on the Coordinative Count Invariant, a property of derivable sequences in occurrence-sensitive categorial…
Crit Cremers, Maarten HijzelendoornMay 6, 1996
Learn
A New Statistical Parser Based on Bigram Lexical Dependencies
This paper describes a new statistical parser which is based on probabilities of dependencies between head-words in the parse tree. Standard bigram probability estimation techniques are extended to…
Michael CollinsMay 6, 1996
Learn
Best-First Surface Realization
Current work in surface realization concentrates on the use of general, abstract algorithms that interpret large, reversible grammars. Only little attention has been paid so far to the many small and…
Stephan BusemannMay 6, 1996
Learn
Learning similarity-based word sense disambiguation from sparse data
We describe a method for automatic word sense disambiguation using a text corpus and a machine-readable dictionary (MRD). The method is based on word similarity and context similarity measures. Words…
Yael Karov, Shimon EdelmanMay 5, 1996
Learn
Tactical Generation in a Free Constituent Order Language
This paper describes tactical generation in Turkish, a free constituent order language, in which the order of the constituents may change according to the information structure of the sentences to be…
Dilek Zeynep Hakkani, Kemal Oflazer, Ilyas CicekliMay 5, 1996
Learn
Resolving Anaphors in Embedded Sentences
We propose an algorithm to resolve anaphors, tackling mainly the problem of intrasentential antecedents. We base our methodology on the fact that such antecedents are likely to occur in embedded…
Saliha AzzamMay 4, 1996
Learn
Active Constraints for a Direct Interpretation of HPSG
In this paper, we characterize the properties of a direct interpretation of HPSG and present the advantages of this approach. High-level programming languages constitute in this perspective an…
Philippe Blache, Jean-Louis PaquelinMay 3, 1996
Learn
Focus and Higher-Order Unification
Pulman has shown that Higher--Order Unification (HOU) can be used to model the interpretation of focus. In this paper, we extend the unification--based approach to cases which are often seen as a…
Claire Gardent, Michael KohlhaseMay 2, 1996
Learn
Higher-Order Coloured Unification and Natural Language Semantics
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interface between the…
Claire Gardent, Michael KohlhaseMay 2, 1996
Learn
Yet Another Paper about Partial Verb Phrase Fronting in German
I describe a very simple HPSG analysis for partial verb phrase fronting. I will argue that the presented account is more adequate than others made during the past years because it allows the…
Stefan MüllerMay 2, 1996
Learn
Building Natural-Language Generation Systems
This is a very short paper that briefly discusses some of the tasks that NLG systems perform. It is of no research interest, but I have occasionally found it useful as a way of introducing NLG to…
Ehud ReiterMay 2, 1996
Learn
Compiling a Partition-Based Two-Level Formalism
This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alternative to the standard…
Edmund Grimley-Evans, George Anton Kiraz, Stephen G. PulmanMay 2, 1996
Learn
Towards a Workbench for Acquisition of Domain Knowledge from Natural Language
In this paper we describe an architecture and functionality of main components of a workbench for an acquisition of domain knowledge from large text corpora. The workbench supports an incremental…
Andrei Mikheev, Steven FinchApr 30, 1996
Learn
← PreviousPage 16Next →