Skip to content

Computation and Language papers — page 15

cmp-lgBrowse archive

An Empirical Study of Smoothing Techniques for Language Modeling
We present an extensive empirical comparison of several smoothing techniques in the domain of language modeling, including those described by Jelinek and Mercer (1980), Katz (1987), and Church and…
Stanley F. Chen, Joshua T. GoodmanJun 11, 1996
Learn
An Information Structural Approach to Spoken Language Generation
This paper presents an architecture for the generation of spoken monologues with contextually appropriate intonation. A two-tiered information structure representation is used in the high-level…
Scott PrevostJun 10, 1996
Learn
Modularizing Contexted Constraints
This paper describes a method for compiling a constraint-based grammar into a potentially more efficient form for processing. This method takes dependent disjunctions within a constraint formula and…
John GriffithJun 8, 1996
Learn
Coordination as a Direct Process
We propose a treatment of coordination based on the concepts of functor, argument and subcategorization. Its formalization comprises two parts which are conceptually independent. On one hand, we have…
Augusta Mela, Christophe FouquereJun 8, 1996
Learn
Word Sense Disambiguation using Conceptual Density
This paper presents a method for the resolution of lexical ambiguity of nouns and its automatic evaluation over the Brown Corpus. The method relies on the use of the wide-coverage noun taxonomy of…
Eneko Agirre, German RigauJun 7, 1996
Learn
Coordination in Tree Adjoining Grammars: Formalization and Implementation
In this paper we show that an account for coordination can be constructed using the derivation structures in a lexicalized Tree Adjoining Grammar (LTAG). We present a notion of derivation in LTAGs…
Anoop Sarkar, Aravind JoshiJun 7, 1996
Learn
Part-of-Speech-Tagging using morphological information
This paper presents the results of an experiment to decide the question of authenticity of the supposedly spurious Rhesus - a attic tragedy sometimes credited to Euripides. The experiment involves…
Bernd LudwigJun 4, 1996
Learn
Classification in Feature-based Default Inheritance Hierarchies
Increasingly, inheritance hierarchies are being used to reduce redundancy in natural language processing lexicons. Systems that utilize inheritance hierarchies need to be able to insert words under…
Marc LightJun 4, 1996
Learn
Morphological Cues for Lexical Semantics
Most natural language processing tasks require lexical semantic information. Automated acquisition of this information would thus increase the robustness and portability of NLP systems. This paper…
Marc LightJun 4, 1996
Learn
Clustered Language Models with Context-Equivalent States
In this paper, a hierarchical context definition is added to an existing clustering algorithm in order to increase its robustness. The resulting algorithm, which clusters contexts and events…
J. P. Ueberla, I. R. GransdenJun 4, 1996
Learn
A Bayesian hybrid method for context-sensitive spelling correction
Two classes of methods have been shown to be useful for resolving lexical ambiguity. The first relies on the presence of particular words within some distance of the ambiguous target word; the second…
Andrew R. GoldingJun 3, 1996
Learn
Efficient Normal-Form Parsing for Combinatory Categorial Grammar
Under categorial grammars that have powerful rules like composition, a simple n-word sentence can have exponentially many parses. Generating all parses is inefficient and obscures whatever true…
Jason EisnerJun 2, 1996
Learn
Combining Trigram-based and Feature-based Methods for Context-Sensitive Spelling Correction
This paper addresses the problem of correcting spelling errors that result in valid, though unintended words (such as ``peace'' and ``piece'', or ``quiet'' and…
Andrew R. Golding, Yves SchabesMay 31, 1996
Learn
Parsing Algorithms and Metrics
Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algorithms, including…
Joshua GoodmanMay 30, 1996
Learn
Example-Based Optimization of Surface-Generation Tables
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 SamuelssonMay 29, 1996
Learn
Handling Sparse Data by Successive Abstraction
A general, practical method for handling sparse data that avoids held-out data and iterative reestimation is derived from first principles. It has been tested on a part-of-speech tagging task and…
Christer SamuelssonMay 29, 1996
Learn
Notes on LR Parser Design
The design of an LR parser based on interleaving the atomic symbol processing of a context-free backbone grammar with the full constraints of the underlying unification grammar is described. The…
Christer SamuelssonMay 29, 1996
Learn
Synchronous Models of Language
In synchronous rewriting, the productions of two rewriting systems are paired and applied synchronously in the derivation of a pair of strings. We present a new synchronous rewriting system and argue…
Owen Rambow, Giorgio SattaMay 27, 1996
Learn
Efficient Algorithms for Parsing the DOP Model? A Reply to Joshua Goodman
This note is a reply to Joshua Goodman's paper "Efficient Algorithms for Parsing the DOP Model" (Goodman, 1996; cmp-lg/9604008). In his paper, Goodman makes a number of claims about (my…
Rens BodMay 24, 1996
Learn
Incremental Centering and Center Ambiguity
In this paper, we present a model of anaphor resolution within the framework of the centering model. The consideration of an incremental processing mode introduces the need to manage structural…
Udo Hahn, Michael StrubeMay 16, 1996
Learn
Learning Word Association Norms Using Tree Cut Pair Models
We consider the problem of learning co-occurrence information between two word categories, or more in general between two discrete random variables taking values in a hierarchically classified…
Naoki Abe, Hang LiMay 16, 1996
Learn
Towards Understanding Spontaneous Speech: Word Accuracy vs. Concept Accuracy
In this paper we describe an approach to automatic evaluation of both the speech recognition and understanding capabilities of a spoken dialogue system for train time table information. We use word…
M. Boros, W. Eckert, F. Gallwitz et al.May 15, 1996
Learn
Restricted Parallelism in Object-Oriented Lexical Parsing
We present an approach to parallel natural language parsing which is based on a concurrent, object-oriented model of computation. A depth-first, yet incomplete parsing algorithm for a dependency…
Peter Neuhaus, Udo HahnMay 15, 1996
Learn
Trading off Completeness for Efficiency --- The ParseTalk Performance Grammar Approach to Real-World Text Parsing
We argue for a performance-based design of natural language grammars and their associated parsers in order to meet the constraints posed by real-world natural language understanding. This approach…
Peter Neuhaus, Udo HahnMay 15, 1996
Learn
A Conceptual Reasoning Approach to Textual Ellipsis
We present a hybrid text understanding methodology for the resolution of textual ellipsis. It integrates conceptual criteria (based on the well-formedness and conceptual strength of role chains in a…
Udo Hahn, Katja Markert, Michael StrubeMay 15, 1996
Learn
← PreviousPage 15Next →