Skip to content

Computation and Language papers — page 23

cmp-lgBrowse archive

Acquiring a Lexicon from Unsegmented Speech
We present work-in-progress on the machine acquisition of a lexicon from sentences that are each an unsegmented phone sequence paired with a primitive representation of meaning. A simple exploratory…
Carl de MarckenMay 8, 1995
Learn
Robust Parsing of Spoken Dialogue Using Contextual Knowledge and Recognition Probabilities
In this paper we describe the linguistic processor of a spoken dialogue system. The parser receives a word graph from the recognition module as its input. Its task is to find the best path through…
Gerhard Hanrieder, Guenther GoerzMay 8, 1995
Learn
A Pattern Matching method for finding Noun and Proper Noun Translations from Noisy Parallel Corpora
We present a pattern matching method for compiling a bilingual lexicon of nouns and proper nouns from unaligned, noisy parallel texts of Asian/Indo-European language pairs. Tagging information of one…
Pascale FungMay 6, 1995
Learn
Efficient Analysis of Complex Diagrams using Constraint-Based Parsing
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the data make it possible…
Robert P. Futrelle, Nikos NikolakisMay 5, 1995
Learn
Compositionality for Presuppositions over Tableaux
Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value…
Pablo GervasMay 5, 1995
Learn
Utilizing Statistical Dialogue Act Processing in Verbmobil
In this paper, we present a statistical approach for dialogue act processing in the dialogue component of the speech-to-speech translation system . Statistics in dialogue processing is used to…
Norbert Reithinger, Elisabeth MaierMay 5, 1995
Learn
A Symbolic and Surgical Acquisition of Terms through Variation
Terminological acquisition is an important issue in learning for NLP due to the constant terminological renewal through technological changes. Terms play a key role in several NLP-activities such as…
Christian JacqueminMay 4, 1995
Learn
Evaluation of Semantic Clusters
Semantic clusters of a domain form an important feature that can be useful for performing syntactic and semantic disambiguation. Several attempts have been made to extract the semantic clusters of a…
Rajeev AgarwalMay 4, 1995
Learn
Tagset Reduction Without Information Loss
A technique for reducing a tagset used for n-gram part-of-speech disambiguation is introduced and evaluated in an experiment. The technique ensures that all information that is provided by the…
Thorsten BrantsMay 3, 1995
Learn
Compilation of HPSG to TAG
We present an implemented compilation algorithm that translates HPSG into lexicalized feature-based TAG, relating concepts of the two theories. While HPSG has a more elaborated principle-based theory…
Robert Kasper, Bernd Kiefer, Klaus Netter et al.May 3, 1995
Learn
Conciseness through Aggregation in Text Generation
Aggregating different pieces of similar information is necessary to generate concise and easy to understand reports in technical domains. This paper presents a general algorithm that combines similar…
James ShawMay 3, 1995
Learn
Parsing a Flexible Word Order Language
A logic formalism is presented which increases the expressive power of the ID/LP format of GPSG by enlarging the inventory of ordering relations and extending the domain of their application to…
Vladimir Pericliev, Alexander GrigorovMay 3, 1995
Learn
Treating Coordination with Datalog Grammars
In previous work we studied a new type of DCGs, Datalog grammars, which are inspired on database theory. Their efficiency was shown to be better than that of their DCG counterparts under…
Veronica Dahl, Paul Tarau, Lidia Moreno et al.May 3, 1995
Learn
Learning Syntactic Rules and Tags with Genetic Algorithms for Information Retrieval and Filtering: An Empirical Basis for Grammatical Rules
The grammars of natural languages may be learned by using genetic algorithms that reproduce and mutate grammatical rules and part-of-speech tags, improving the quality of later generations of…
Robert M. LoseeMay 2, 1995
Learn
DATR Theories and DATR Models
Evans and Gazdar introduced DATR as a simple, non-monotonic language for representing natural language lexicons. Although a number of implementations of DATR exist, the full language has until now…
Bill KellerMay 2, 1995
Learn
Compiling HPSG type constraints into definite clause programs
We present a new approach to HPSG processing: compiling HPSG grammars expressed as type constraints into definite clause programs. This provides a clear and computationally useful correspondence…
Thilo Goetz, Walt Detmar MeurersMay 2, 1995
Learn
New Techniques for Context Modeling
We introduce three new techniques for statistical language models: extension modeling, nonmonotonic contexts, and the divergence heuristic. Together these techniques result in language models that…
Eric Sven Ristad, Robert G. ThomasMay 1, 1995
Learn
Response Generation in Collaborative Negotiation
In collaborative planning activities, since the agents are autonomous and heterogeneous, it is inevitable that conflicts arise in their beliefs during the planning process. In cases where such…
Jennifer Chu-Carroll, Sandra CarberryMay 1, 1995
Learn
Bayesian Grammar Induction for Language Modeling
We describe a corpus-based induction algorithm for probabilistic context-free grammars. The algorithm employs a greedy heuristic search within a Bayesian framework, and a post-pass using the…
Stanley F. ChenMay 1, 1995
Learn
The Replace Operator
This paper introduces to the calculus of regular expressions a replace operator, ->, and defines a set of replacement expressions that concisely encode several alternate variations of the operation.…
Lauri Karttunen, Rank Xerox Research CentreApr 29, 1995
Learn
Error-tolerant Finite State Recognition with Applications to Morphological Analysis and Spelling Correction
Error-tolerant recognition enables the recognition of strings that deviate mildly from any string in the regular set recognized by the underlying finite state recognizer. Such recognition has…
Kemal OflazerApr 29, 1995
Learn
Statistical Decision-Tree Models for Parsing
Syntactic natural language parsers have shown themselves to be inadequate for processing highly-ambiguous large-vocabulary text, as is evidenced by their poor performance on domains like the Wall…
David M. MagermanApr 29, 1995
Learn
Quantifiers, Anaphora, and Intensionality
The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semantic interpretations can be expressed directly in a fragment of linear…
Mary Dalrymple, John Lamping, Fernando Pereira et al.Apr 28, 1995
Learn
Corpus Statistics Meet the Noun Compound: Some Empirical Results
A variety of statistical methods for noun compound analysis are implemented and compared. The results support two main conclusions. First, the use of conceptual association not only enables a broad…
Mark LauerApr 28, 1995
Learn
An Efficient Generation Algorithm for Lexicalist MT
The lexicalist approach to Machine Translation offers significant advantages in the development of linguistic descriptions. However, the Shake-and-Bake generation algorithm of (Whitelock, COLING-92)…
Victor Poznanski, John L. Beaven, Pete WhitelockApr 28, 1995
Learn
← PreviousPage 23Next →