Skip to content

Computation and Language papers — page 14

cmp-lgBrowse archive

Integrating Syntactic and Prosodic Information for the Efficient Detection of Empty Categories
We describe a number of experiments that demonstrate the usefulness of prosodic information for a processing module which parses spoken utterances with a feature-based grammar employing empty…
Anton Batliner, Anke Feldhaus, Stefan Geissler et al.Jul 2, 1996
Learn
Domain and Language Independent Feature Extraction for Statistical Text Categorization
A generic system for text categorization is presented which uses a representative text corpus to adapt the processing steps: feature extraction, dimension reduction, and classification. Feature…
Thomas Bayer, Ingrid Renz, Michael Stein et al.Jul 2, 1996
Learn
Inducing Constraint Grammars
Constraint Grammar rules are induced from corpora. A simple scheme based on local information, i.e., on lexical biases and next-neighbour contexts, extended through the use of barriers, reached 87.3…
Christer Samuelsson, Pasi Tapanainen, Atro VoutilainenJul 1, 1996
Learn
GramCheck: A Grammar and Style Checker
This paper presents a grammar and style checker demonstrator for Spanish and Greek native writers developed within the project GramCheck. Besides a brief grammar error typology for Spanish, a…
Flora Ramírez Bustamante, Fernando Sánchez LeónJul 1, 1996
Learn
Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach
In this paper, we present a new approach for word sense disambiguation (WSD) using an exemplar-based learning algorithm. This approach integrates a diverse set of knowledge sources to disambiguate…
Hwee Tou Ng, Hian Beng LeeJun 29, 1996
Learn
Research on Architectures for Integrated Speech/Language Systems in Verbmobil
The German joint research project Verbmobil (VM) aims at the development of a speech to speech translation system. This paper reports on research done in our group which belongs to Verbmobil's…
Günther Görz, Marcus Kesseler, Jörg Spilker et al.Jun 25, 1996
Learn
Minimizing Manual Annotation Cost In Supervised Training From Corpora
Corpus-based methods for natural language processing often use supervised training, requiring expensive manual annotation of training corpora. This paper investigates methods for reducing annotation…
Sean P. Engelson, Ido DaganJun 24, 1996
Learn
Directed Replacement
This paper introduces to the finite-state calculus a family of directed replace operators. In contrast to the simple replace expression, UPPER -> LOWER, defined in Karttunen (ACL-95), the new…
Lauri KarttunenJun 23, 1996
Learn
Linguistic Structure as Composition and Perturbation
This paper discusses the problem of learning language from unprocessed text and speech signals, concentrating on the problem of learning a lexicon. In particular, it argues for a representation of…
Carl de MarckenJun 21, 1996
Learn
Maximizing Top-down Constraints for Unification-based Systems
A left-corner parsing algorithm with top-down filtering has been reported to show very efficient performance for unification-based systems. However, due to the nontermination of parsing with…
Noriko TomuroJun 20, 1996
Learn
An Efficient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules…
Mehryar Mohri, Richard SproatJun 20, 1996
Learn
Two Sources of Control over the Generation of Software Instructions
This paper presents an analysis conducted on a corpus of software instructions in French in order to establish whether task structure elements (the procedural representation of the users' tasks)…
Anthony Hartley, Cecile ParisJun 19, 1996
Learn
A Data-Oriented Approach to Semantic Interpretation
In Data-Oriented Parsing (DOP), an annotated language corpus is used as a stochastic grammar. The most probable analysis of a new input sentence is constructed by combining sub-analyses from the…
Rens Bod, Remko Bonnema, Remko SchaJun 18, 1996
Learn
A Robust System for Natural Spoken Dialogue
This paper describes a system that leads us to believe in the feasibility of constructing natural spoken dialogue systems in task-oriented domains. It specifically addresses the issue of robust…
James F. Allen, Bradford W. Miller, Eric K. Ringger et al.Jun 18, 1996
Learn
Two Questions about Data-Oriented Parsing
In this paper I present ongoing work on the data-oriented parsing (DOP) model. In previous work, DOP was tested on a cleaned-up set of analyzed part-of-speech strings from the Penn Treebank,…
Rens BodJun 17, 1996
Learn
An Iterative Algorithm to Build Chinese Language Models
We present an iterative procedure to build a Chinese language model (LM). We segment Chinese text into words based on a word-based Chinese language model. However, the construction of a Chinese LM…
Xiaoqiang Luo, Salim RoukosJun 17, 1996
Learn
Computing Optimal Descriptions for Optimality Theory Grammars with Context-Free Position Structures
This paper describes an algorithm for computing optimal structural descriptions for Optimality Theory grammars with context-free position structures. This algorithm extends Tesar's dynamic…
Bruce TesarJun 17, 1996
Learn
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars and context-free grammars. It presents a proof that the following problems are NP-hard: computing…
Khalil Sima'anJun 17, 1996
Learn
Compilation of Weighted Finite-State Transducers from Decision Trees
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an input string, and…
Richard Sproat, Michael RileyJun 14, 1996
Learn
With raised eyebrows or the eyebrows raised ? A Neural Network Approach to Grammar Checking for Definiteness
In this paper, we use a feature model of the semantics of plural determiners to present an approach to grammar checking for definiteness. Using neural network techniques, a semantics -- morphological…
Gabriele SchelerJun 14, 1996
Learn
A Probabilistic Disambiguation Method Based on Psycholinguistic Principles
We address the problem of structural disambiguation in syntactic parsing. In psycholinguistics, a number of principles of disambiguation have been proposed, notably the Lexical Preference Rule (LPR),…
Hang LiJun 13, 1996
Learn
Relating Turing's Formula and Zipf's Law
An asymptote is derived from Turing's local reestimation formula for population frequencies, and a local reestimation formula is derived from Zipf's law for the asymptotic behavior of…
Christer SamuelssonJun 11, 1996
Learn
Stabilizing the Richardson Algorithm by Controlling Chaos
By viewing the operations of the Richardson purification algorithm as a discrete time dynamical process, we propose a method to overcome the instability of the algorithm by controlling chaos. We…
Song HeJun 11, 1996
Learn
Building Probabilistic Models for Natural Language
In this thesis, we investigate three problems involving the probabilistic modeling of language: smoothing n-gram models, statistical grammar induction, and bilingual sentence alignment. These three…
Stanley F. ChenJun 11, 1996
Learn
An Efficient Inductive Unsupervised Semantic Tagger
We report our development of a simple but fast and efficient inductive unsupervised semantic tagger for Chinese words. A POS hand-tagged corpus of 348,000 words is used. The corpus is being tagged in…
K T LuaJun 11, 1996
Learn
← PreviousPage 14Next →