Skip to content

Computation and Language papers — page 33

cmp-lgBrowse archive

Tricolor DAGs for Machine Translation
Machine translation (MT) has recently been formulated in terms of constraint-based knowledge representation and unification theories, but it is becoming more and more evident that it is not possible…
Koichi TakedaJul 6, 1994
Learn
A Corrective Training Algorithm for Adaptive Learning in Bag Generation
The sampling problem in training corpus is one of the major sources of errors in corpus-based applications. This paper proposes a corrective training algorithm to best-fit the run-time context domain…
Hsin-Hsi Chen, Yue-Shi LeeJul 6, 1994
Learn
GEMINI: A Natural Language System for Spoken-Language Understanding
Gemini is a natural language understanding system developed for spoken language applications. The paper describes the architecture of Gemini, paying particular attention to resolving the tension…
John Dowding, Jean Mark Gawron, Doug Appelt et al.Jul 5, 1994
Learn
Interleaving Syntax and Semantics in an Efficient Bottom-Up Parser
We describe an efficient bottom-up parser that interleaves syntactic and semantic structure building. Two techniques are presented for reducing search by reducing local ambiguity: Limited…
John Dowding, Robert Moore, Francois Andry et al.Jul 5, 1994
Learn
Japanese word sense disambiguation based on examples of synonyms
(This is not the abstract): The language is Japanese. If your printer does not have fonts for Japases characters, the characters in figures will not be printed out correctly. Dissertation for…
Mitsutaka MatsumotoJul 5, 1994
Learn
Compact Representations by Finite-State Transducers
Finite-state transducers give efficient representations of many Natural Language phenomena. They allow to account for complex lexicon restrictions encountered, without involving the use of a large…
Mehryar MohriJul 4, 1994
Learn
Syntactic Analysis by Local Grammars Automata: an Efficient Algorithm
Local grammars can be represented in a very convenient way by automata. This paper describes and illustrates an efficient algorithm for the application of local grammars put in this form to…
Mehryar MohriJul 4, 1994
Learn
Morphology with a Null-Interface
We present an integrated architecture for word-level and sentence-level processing in a unification-based paradigm. The core of the system is a CLP implementation of a unification engine for feature…
Harald Trost, Johannes MatiasekJul 4, 1994
Learn
Learning unification-based grammars using the Spoken English Corpus
This paper describes a grammar learning system that combines model-based and data-driven learning within a single framework. Our results from learning grammars using the Spoken English Corpus (SEC)…
Miles Osborne, Derek BridgeJun 28, 1994
Learn
Three studies of grammar-based surface-syntactic parsing of unrestricted English text. A summary and orientation
The dissertation addresses the design of parsing grammars for automatic surface-syntactic analysis of unconstrained English text. It consists of a summary and three articles. Morphological…
Atro VoutilainenJun 27, 1994
Learn
An Empirical Model of Acknowledgment for Spoken-Language Systems
We refine and extend prior views of the description, purposes, and contexts-of-use of acknowledgment acts through empirical examination of the use of acknowledgments in task-based conversation. We…
David G. Novick, Stephen SuttonJun 27, 1994
Learn
DISCO---An HPSG-based NLP System and its Application for Appointment Scheduling (Project Note)
The natural language system DISCO is described. It combines o a powerful and flexible grammar development system; o linguistic competence for German including morphology, syntax and semantics; o new…
Hans Uszkoreit, Rolf Backofen, Stephan Busemann et al.Jun 23, 1994
Learn
Multi-Paragraph Segmentation of Expository Text
This paper describes TextTiling, an algorithm for partitioning expository texts into coherent multi-paragraph discourse units which reflect the subtopic structure of the texts. The algorithm uses…
Marti A. HearstJun 23, 1994
Learn
Text Analysis Tools in Spoken Language Processing
This submission contains the postscript of the final version of the slides used in our ACL-94 tutorial.
Michael Riley, Richard SproatJun 23, 1994
Learn
Decision Lists for Lexical Ambiguity Resolution: Application to Accent Restoration in Spanish and French
This paper presents a statistical decision procedure for lexical ambiguity resolution. The algorithm exploits both local syntactic patterns and more distant collocational evidence, generating an…
David YarowskyJun 23, 1994
Learn
Verb Semantics and Lexical Selection
This paper will focus on the semantic representation of verbs in computer systems and its impact on lexical selection problems in machine translation (MT). Two groups of English and Chinese verbs are…
Zhibiao Wu, Martha PalmerJun 22, 1994
Learn
Anytime Algorithms for Speech Parsing?
This paper discusses to which extent the concept of ``anytime algorithms'' can be applied to parsing algorithms with feature unification. We first try to give a more precise definition of…
Guenther Goerz, Marcus KesselerJun 21, 1994
Learn
A Psycholinguistically Motivated Parser for CCG
Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose interpretation is the…
Michael NivJun 20, 1994
Learn
The complexity of normal form rewrite sequences for Associativity
The complexity of a particular term-rewrite system is considered: the rule of associativity (x*y)*z --> x*(y*z). Algorithms and exact calculations are given for the longest and shortest sequences of…
Michael NivJun 20, 1994
Learn
A Computational Model of Syntactic Processing: Ambiguity Resolution from Interpretation
Syntactic ambiguity abounds in natural language, yet humans have no difficulty coping with it. In fact, the process of ambiguity resolution is almost always unconscious. But it is not infallible,…
Michael NivJun 20, 1994
Learn
Resolution of Syntactic Ambiguity: the Case of New Subjects
I review evidence for the claim that syntactic ambiguities are resolved on the basis of the meaning of the competing analyses, not their structure. I identify a collection of ambiguities that do not…
Michael NivJun 20, 1994
Learn
Analyzing and Improving Statistical Language Models for Speech Recognition
In many current speech recognizers, a statistical language model is used to indicate how likely it is that a certain word will be spoken next, given the words recognized so far. How can statistical…
Joerg P. UeberlaJun 17, 1994
Learn
The Very Idea of Dynamic Semantics
"Natural languages are programming languages for minds." Can we or should we take this slogan seriously? If so, how? Can answers be found by looking at the various "dynamic"…
David IsraelJun 17, 1994
Learn
Emergent Parsing and Generation with Generalized Chart
A new, flexible inference method for Horn logic program is proposed, which is a drastic generalization of chart parsing, partial instantiations of clauses in a program roughly corresponding to arcs…
HASIDA KoitiJun 16, 1994
Learn
Learning Fault-tolerant Speech Parsing with SCREEN
This paper describes a new approach and a system SCREEN for fault-tolerant speech parsing. SCREEEN stands for Symbolic Connectionist Robust EnterprisE for Natural language. Speech parsing describes…
Stefan Wermter, Volker WeberJun 16, 1994
Learn
← PreviousPage 33Next →