id
large_stringlengths
9
16
title
large_stringlengths
1
382
abstract
large_stringlengths
3
6.09k
publish_date
date32
update_date
date32
categories
large listlengths
1
13
authors
large_stringlengths
3
62.8k
cmp-lg/9408019
Building a Parser That can Afford to Interact with Semantics
Natural language understanding programs get bogged down by the multiplicity of possible syntactic structures while processing real world texts that human understanders do not have much difficulty with. In this work, I analyze the relationships between parsing strategies, the degree of local ambiguity encountered by the...
1994-08-31
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kavi Mahesh (Georgia Institute of Technology)
cmp-lg/9408018
Uniform Representations for Syntax-Semantics Arbitration
Psychological investigations have led to considerable insight into the working of the human language comprehension system. In this article, we look at a set of principles derived from psychological findings to argue for a particular organization of linguistic knowledge along with a particular processing strategy and pr...
1994-08-31
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kavi Mahesh and Kurt P. Eiselt (Georgia Institute of Technology)
cmp-lg/9408017
Reaping the Benefits of Interactive Syntax and Semantics
Semantic feedback is an important source of information that a parser could use to deal with local ambiguities in syntax. However, it is difficult to devise a systematic communication mechanism for interactive syntax and semantics. In this article, I propose a variant of left-corner parsing to define the points at whic...
1994-08-31
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kavi Mahesh (Georgia Institute of Technology)
cmp-lg/9408016
On Implementing an HPSG theory -- Aspects of the logical architecture, the formalization, and the implementation of head-driven phrase structure grammars
The paper presents some aspects involved in the formalization and implementation of HPSG theories. As basis, the logical setups of Carpenter (1992) and King (1989, 1994) are briefly compared regarding their usefulness as basis for HPSGII (Pollard and Sag 1994). The possibilities for expressing HPSG theories in the HPSG...
1994-08-31
2008-02-03
[ "cmp-lg", "cs.CL" ]
Walt Detmar Meurers (SFB 340/B4, University of Tuebingen, Germany)
cmp-lg/9408021
A Unified Process Model of Syntactic and Semantic Error Recovery in Sentence Understanding
The development of models of human sentence processing has traditionally followed one of two paths. Either the model posited a sequence of processing modules, each with its own task-specific knowledge (e.g., syntax and semantics), or it posited a single processor utilizing different types of knowledge inextricably inte...
1994-08-31
2008-02-03
[ "cmp-lg", "cs.CL" ]
Jennifer K. Holbrook (Dept. of Psychology, Albion College), Kurt P. Eiselt (College of Computing, Georgia Tech), and Kavi Mahesh (College of Computing, Georgia Tech)
cmp-lg/9408013
Training and Scaling Preference Functions for Disambiguation
We present an automatic method for weighting the contributions of preference functions used in disambiguation. Initial scaling factors are derived as the solution to a least-squares minimization problem, and improvements are then made by hill-climbing. The method is applied to disambiguating sentences in the ATIS (Air ...
1994-08-24
2008-02-03
[ "cmp-lg", "cs.CL" ]
Hiyan Alshawi (AT&T Bell Laboratories), David Carter (SRI International, Cambridge)
cmp-lg/9408014
Qualitative and Quantitative Models of Speech Translation
This paper compares a qualitative reasoning model of translation with a quantitative statistical model. We consider these models within the context of two hypothetical speech translation systems, starting with a logic-based design and pointing out which of its characteristics are best preserved or eliminated in moving ...
1994-08-24
2008-02-03
[ "cmp-lg", "cs.CL" ]
Hiyan Alshawi (AT&T Bell Laboratories)
cmp-lg/9408012
Approximate N-Gram Markov Model for Natural Language Generation
This paper proposes an Approximate n-gram Markov Model for bag generation. Directed word association pairs with distances are used to approximate (n-1)-gram and n-gram training tables. This model has parameters of word association model, and merits of both word association model and Markov Model. The training knowledge...
1994-08-24
2008-02-03
[ "cmp-lg", "cs.CL" ]
Hsin-Hsi Chen (National Taiwan University) and Yue-Shi Lee (National Taiwan University)
cmp-lg/9408015
Experimentally Evaluating Communicative Strategies: The Effect of the Task
Effective problem solving among multiple agents requires a better understanding of the role of communication in collaboration. In this paper we show that there are communicative strategies that greatly improve the performance of resource-bounded agents, but that these strategies are highly sensitive to the task require...
1994-08-24
2008-02-03
[ "cmp-lg", "cs.CL" ]
Marilyn A. Walker (Mitsubishi Electric Research Laboratories, Cambridge, Mass.)
cmp-lg/9408011
Distributional Clustering of English Words
We describe and experimentally evaluate a method for automatically clustering words according to their distribution in particular syntactic contexts. Deterministic annealing is used to find lowest distortion sets of clusters. As the annealing parameter increases, existing clusters become unstable and subdivide, yieldin...
1994-08-22
2008-02-03
[ "cmp-lg", "cs.CL" ]
Fernando Pereira (AT&T Bell Laboratories), Naftali Tishby (Hebrew University), Lillian Lee (Harvard University)
cmp-lg/9408010
On Using Selectional Restriction in Language Models for Speech Recognition
In this paper, we investigate the use of selectional restriction -- the constraints a predicate imposes on its arguments -- in a language model for speech recognition. We use an un-tagged corpus, followed by a public domain tagger and a very simple finite state machine to obtain verb-object pairs from unrestricted Engl...
1994-08-19
2008-02-03
[ "cmp-lg", "cs.CL" ]
Joerg P. Ueberla (Simon Fraser University, Vancouver, Canada)
cmp-lg/9408009
Tagging accurately -- Don't guess if you know
We discuss combining knowledge-based (or rule-based) and statistical part-of-speech taggers. We use two mature taggers, ENGCG and Xerox Tagger, to independently tag the same text and combine the results to produce a fully disambiguated text. In a 27000 word test sample taken from a previously unseen corpus we achieve 9...
1994-08-16
2008-02-03
[ "cmp-lg", "cs.CL" ]
Pasi Tapanainen (Rank Xerox Research Centre, Grenoble Laboratory), Atro Voutilainen (Research Unit for Computational Linguistics, University of Helsinki)
cmp-lg/9408008
Statistical versus symbolic parsing for captioned-information retrieval
We discuss implementation issues of MARIE-1, a mostly symbolic parser fully implemented, and MARIE-2, a more statistical parser partially implemented. They address a corpus of 100,000 picture captions. We argue that the mixed approach of MARIE-2 should be better for this corpus because its algorithms (not data) are sim...
1994-08-15
2008-02-03
[ "cmp-lg", "cs.CL" ]
Neil C. Rowe (Code CS/Rp, Department of Computer Science, Naval Postgraduate School, Monterey)
cmp-lg/9408007
Emergent Linguistic Rules from Inducing Decision Trees: Disambiguating Discourse Clue Words
We apply decision tree induction to the problem of discourse clue word sense disambiguation with a genetic algorithm. The automatic partitioning of the training set which is intrinsic to decision tree induction gives rise to linguistically viable rules.
1994-08-13
2008-02-03
[ "cmp-lg", "cs.CL" ]
Eric V. Siegel and Kathleen R. McKeown (Columbia University)
cmp-lg/9408006
LHIP: Extended DCGs for Configurable Robust Parsing
We present LHIP, a system for incremental grammar development using an extended DCG formalism. The system uses a robust island-based parsing method controlled by user-defined performance thresholds.
1994-08-03
2008-02-03
[ "cmp-lg", "cs.CL" ]
Afzal Ballim and Graham Russell (ISSCO, Geneva)
cmp-lg/9408003
Typed Feature Structures as Descriptions
A description is an entity that can be interpreted as true or false of an object, and using feature structures as descriptions accrues several computational benefits. In this paper, I create an explicit interpretation of a typed feature structure used as a description, define the notion of a satisfiable feature structu...
1994-08-02
2008-02-03
[ "cmp-lg", "cs.CL" ]
Paul John King (University of Tuebingen, Germany)
cmp-lg/9408005
A Modular and Flexible Architecture for an Integrated Corpus Query System
The paper describes the architecture of an integrated and extensible corpus query system developed at the University of Stuttgart and gives examples of some of the modules realized within this architecture. The modules form the core of a corpus workbench. Within the proposed architecture, information required for the e...
1994-08-02
2016-08-31
[ "cmp-lg", "cs.CL" ]
Oliver Christ (IMS Stuttgart, Germany)
cmp-lg/9408004
Parsing with Principles and Probabilities
This paper is an attempt to bring together two approaches to language analysis. The possible use of probabilistic information in principle-based grammars and parsers is considered, including discussion on some theoretical and computational problems that arise. Finally a partial implementation of these ideas is presente...
1994-08-02
2008-02-03
[ "cmp-lg", "cs.CL" ]
Andrew Fordham (Dept. of Sociology, University of Surrey, UK), and Matthew Crocker (Centre for Cognitive Science, University of Edinburgh, UK)
cmp-lg/9408002
Computational Analyses of Arabic Morphology
This paper demonstrates how a (multi-tape) two-level formalism can be used to write two-level grammars for Arabic non-linear morphology using a high level, but computationally tractable, notation. Three illustrative grammars are provided based on CV-, moraic- and affixational analyses. These are complemented by a propo...
1994-08-01
2008-02-03
[ "cmp-lg", "cs.CL" ]
George A. Kiraz
cmp-lg/9408001
The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures
In this paper, we argue that type inferencing incorrectly implements appropriateness specifications for typed feature structures, promote a combination of type resolution and unfilling as a correct and efficient alternative, and consider the expressive limits of this alternative approach. Throughout, we use feature coo...
1994-08-01
2008-02-03
[ "cmp-lg", "cs.CL" ]
Dale Gerdemann and Paul John King (University of Tuebingen, Germany)
cmp-lg/9407030
Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars
This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars in which the value of the sets consists of pairs of feature-theoretic categories. The algorithm preserves as much information from the grammars as possible, using negative restriction to define equival...
1994-07-30
2008-02-03
[ "cmp-lg", "cs.CL" ]
Arturo Trujillo (Computer Laboratory, University of Cambridge)
cmp-lg/9407029
Building a Large-Scale Knowledge Base for Machine Translation
Knowledge-based machine translation (KBMT) systems have achieved excellent results in constrained domains, but have not yet scaled up to newspaper text. The reason is that knowledge resources (lexicons, grammar rules, world models) must be painstakingly handcrafted from scratch. One of the hypotheses being tested in th...
1994-07-29
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kevin Knight (USC/Information Sciences Institute) and Steve K. Luk (USC/Information Sciences Institute)
cmp-lg/9407028
Automated Postediting of Documents
Large amounts of low- to medium-quality English texts are now being produced by machine translation (MT) systems, optical character readers (OCR), and non-native speakers of English. Most of this text must be postedited by hand before it sees the light of day. Improving text quality is tedious work, but its automation ...
1994-07-29
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kevin Knight (USC/Information Sciences Institute) and Ishwar Chander (USC/Information Sciences Institute)
cmp-lg/9407027
Parsing as Tree Traversal
This paper presents a unified approach to parsing, in which top-down, bottom-up and left-corner parsers are related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottom-up and left-corner parsers are left recursive and must be converted using an extended Greibach normal form. With fu...
1994-07-29
2008-02-03
[ "cmp-lg", "cs.CL" ]
Dale Gerdemann (University of Tuebingen, Germany)
cmp-lg/9407026
Tagging and Morphological Disambiguation of Turkish Text
Automatic text tagging is an important component in higher level analysis of text corpora, and its output can be used in many natural language processing applications. In languages like Turkish or Finnish, with agglutinative morphology, morphological disambiguation is a very crucial process in tagging, as the structure...
1994-07-29
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kemal Oflazer(Bilkent University, Ankara, Turkey), Ilker Kuruoz (Bilkent University, Ankara, Turkey)
cmp-lg/9407025
Recovering From Parser Failures: A Hybrid Statistical/Symbolic Approach
We describe an implementation of a hybrid statistical/symbolic approach to repairing parser failures in a speech-to-speech translation system. We describe a module which takes as input a fragmented parse and returns a repaired meaning representation. It negotiates with the speaker about what the complete meaning of the...
1994-07-28
2008-02-03
[ "cmp-lg", "cs.CL" ]
Carolyn Penstein Rose' (Carnegie Mellon University), and Alex Waibel (Carnegie Mellon University)
cmp-lg/9407024
PRINCIPAR---An Efficient, Broad-coverage, Principle-based Parser
We present an efficient, broad-coverage, principle-based parser for English. The parser has been implemented in C++ and runs on SUN Sparcstations with X-windows. It contains a lexicon with over 90,000 entries, constructed automatically by applying a set of extraction and conversion rules to entries from machine readabl...
1994-07-27
2009-09-25
[ "cmp-lg", "cs.CL" ]
Dekang Lin (Department of Computer Science, University of Manitoba)
cmp-lg/9407023
Multi-Tape Two-Level Morphology: A Case Study in Semitic Non-linear Morphology
This paper presents an implemented multi-tape two-level model capable of describing Semitic non-linear morphology. The computational framework behind the current work is motivated by Kay (1987); the formalism presented here is an extension to the formalism reported by Pulman and Hepple (1993). The objectives of the cur...
1994-07-26
2008-02-03
[ "cmp-lg", "cs.CL" ]
George Kiraz (University of Cambridge)
cmp-lg/9407022
Comparative Discourse Analysis of Parallel Texts
A quantitative representation of discourse structure can be computed by measuring lexical cohesion relations among adjacent blocks of text. These representations have been proposed to deal with sub-topic text segmentation. In a parallel corpus, similar representations can be derived for versions of a text in various la...
1994-07-26
2008-02-03
[ "cmp-lg", "cs.CL" ]
Pim van der Eijk (Digital Equipment Corporation)
cmp-lg/9407021
K-vec: A New Approach for Aligning Parallel Texts
Various methods have been proposed for aligning texts in two or more languages such as the Canadian Parliamentary Debates(Hansards). Some of these methods generate a bilingual lexicon as a by-product. We present an alternative alignment strategy which we call K-vec, that starts by estimating the lexicon. For example, i...
1994-07-25
2008-02-03
[ "cmp-lg", "cs.CL" ]
Pascale Fung (Columbia University), Kenneth Church (AT&T Bell Labs)
cmp-lg/9407020
A Sequential Algorithm for Training Text Classifiers
The ability to cheaply train text classifiers is critical to their use in information retrieval, content analysis, natural language processing, and other tasks involving data which is partly or fully textual. An algorithm for sequential sampling during machine learning of statistical classifiers was developed and teste...
1994-07-24
2008-02-03
[ "cmp-lg", "cs.CL" ]
David D. Lewis (AT&T Bell Labs) and William A. Gale (AT&T Bell Labs)
cmp-lg/9407019
Tracking Point of View in Narrative
Third-person fictional narrative text is composed not only of passages that objectively narrate events, but also of passages that present characters' thoughts, perceptions, and inner states. Such passages take a character's ``psychological point of view''. A language understander must determine the current psychologica...
1994-07-22
2008-02-03
[ "cmp-lg", "cs.CL" ]
Janyce M. Wiebe (New Mexico State University)
cmp-lg/9407018
Generating Multilingual Documents from a Knowledge Base: The TECHDOC Project
TECHDOC is an implemented system demonstrating the feasibility of generating multilingual technical documents on the basis of a language-independent knowledge base. Its application domain is user and maintenance instructions, which are produced from underlying plan structures representing the activities, the participat...
1994-07-21
2008-02-03
[ "cmp-lg", "cs.CL" ]
Dietmar R\"osner (FAW Ulm, Ulm, Germany), Manfred Stede (University of Toronto and FAW Ulm)
cmp-lg/9407017
Generating Context-Appropriate Word Orders in Turkish
Turkish has considerably freer word order than English. The interpretations of different word orders in Turkish rely on information that describes how a sentence relates to its discourse context. To capture the syntactic features of a free word order language, I present an adaptation of Combinatory Categorial Grammars ...
1994-07-20
2008-02-03
[ "cmp-lg", "cs.CL" ]
Beryl Hoffman (University of Pennsylvania)
cmp-lg/9407016
The Role of Cognitive Modeling in Achieving Communicative Intentions
A discourse planner for (task-oriented) dialogue must be able to make choices about whether relevant, but optional information (for example, the "satellites" in an RST-based planner) should be communicated. We claim that effective text planners must explicitly model aspects of the Hearer's cognitive state, such as what...
1994-07-19
2008-02-03
[ "cmp-lg", "cs.CL" ]
Marilyn Walker (Mitsubishi Electric Research Laboratories), Owen Rambow (Universite Paris 7 / CoGenTex, Inc)
cmp-lg/9407015
Specifying Intonation from Context for Speech Synthesis
This paper presents a theory and a computational implementation for generating prosodically appropriate synthetic speech in response to database queries. Proper distinctions of contrast and emphasis are expressed in an intonation contour that is synthesized by rule under the control of a grammar, a discourse model, and...
1994-07-18
2008-02-03
[ "cmp-lg", "cs.CL" ]
Scott Prevost (University of Pennsylvania), Mark Steedman (University of Pennsylvania)
cmp-lg/9407014
Abstract Machine for Typed Feature Structures
This paper describes a first step towards the definition of an abstract machine for linguistic formalisms that are based on typed feature structures, such as HPSG. The core design of the abstract machine is given in detail, including the compilation process from a high-level specification language to the abstract machi...
1994-07-17
2008-02-03
[ "cmp-lg", "cs.CL" ]
Shuly Wintner (Technion, Israel Institute of Technology) and Nissim Francez (Technion, Israel Institute of Technology)
cmp-lg/9407012
Phoneme Recognition Using Acoustic Events
This paper presents a new approach to phoneme recognition using nonsequential sub--phoneme units. These units are called acoustic events and are phonologically meaningful as well as recognizable from speech signals. Acoustic events form a phonologically incomplete representation as compared to distinctive features. Thi...
1994-07-15
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kai Huebener (University of Hamburg, Germany), Julie Carson-Berndsen (University of Bielefeld, Germany)
cmp-lg/9407013
The Acquisition of a Lexicon from Paired Phoneme Sequences and Semantic Representations
We present an algorithm that acquires words (pairings of phonological forms and semantic representations) from larger utterances of unsegmented phoneme sequences and semantic representations. The algorithm maintains from utterance to utterance only a single coherent dictionary, and learns in the presence of homonymy, s...
1994-07-15
2008-02-03
[ "cmp-lg", "cs.CL" ]
Carl de Marcken (MIT Artificial Intelligence Laboratory)
cmp-lg/9407011
Discourse Obligations in Dialogue Processing
We show that in modeling social interaction, particularly dialogue, the attitude of obligation can be a useful adjunct to the popularly considered attitudes of belief, goal, and intention and their mutual and shared counterparts. In particular, we show how discourse obligations can be used to account in a natural manne...
1994-07-14
2008-02-03
[ "cmp-lg", "cs.CL" ]
David R. Traum (University of Rochester) and James F. Allen (University of Rochester)
cmp-lg/9407010
Combining Knowledge Sources to Reorder N-Best Speech Hypothesis Lists
A simple and general method is described that can combine different knowledge sources to reorder N-best lists of hypotheses produced by a speech recognizer. The method is automatically trainable, acquiring information from both positive and negative examples. Experiments are described in which it was tested on a 1000-u...
1994-07-12
2008-02-03
[ "cmp-lg", "cs.CL" ]
Manny Rayner (SRI International), David Carter (SRI International), Vassilios Digalakis (SRI International) and Patti Price (SRI International)
cmp-lg/9407009
Estimating Performance of Pipelined Spoken Language Translation Systems
Most spoken language translation systems developed to date rely on a pipelined architecture, in which the main stages are speech recognition, linguistic analysis, transfer, generation and speech synthesis. When making projections of error rates for systems of this kind, it is natural to assume that the error rates for ...
1994-07-12
2008-02-03
[ "cmp-lg", "cs.CL" ]
Manny Rayner (SRI International), David Carter (SRI International), Patti Price (SRI International), and Bertil Lyberg (Telia Research AB)
cmp-lg/9407008
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 to design a practical MT system without an adequate method of handling mismatches between semantic representations in the...
1994-07-06
2008-02-03
[ "cmp-lg", "cs.CL" ]
Koichi Takeda (IBM Research, Tokyo Research Lab.)
cmp-lg/9407005
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 in the application of bag generation. It shows which objects to be adjusted and how to adjust their probabilities. The r...
1994-07-06
2008-02-03
[ "cmp-lg", "cs.CL" ]
Hsin-Hsi Chen (University of Taiwan) and Yue-Shi Lee (University of Taiwan)
cmp-lg/9407007
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 between robustness and overgeneration. Gemini features a broad-coverage unification-based grammar of English, fully interleav...
1994-07-05
2008-02-03
[ "cmp-lg", "cs.CL" ]
John Dowding, Jean Mark Gawron, Doug Appelt, John Bear, Lynn Cherny, Robert Moore, and Douglas Moran
cmp-lg/9407006
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 left-context constraints are used to reduce local syntactic ambiguity, and deferred sortal-constraint application is used to reduce ...
1994-07-05
2008-02-03
[ "cmp-lg", "cs.CL" ]
John Dowding, Robert Moore, Francois Andry, and Douglas Moran
cmp-lg/9407004
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 Bachelor's degree at Kyoto University(Nagao lab.),March 1994.
1994-07-05
2009-09-25
[ "cmp-lg", "cs.CL" ]
Mitsutaka Matsumoto (Kyoto University)
cmp-lg/9407001
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 structures supporting relational values. In this framework an HPSG-style grammar is implemented. Word-level processing us...
1994-07-04
2008-02-03
[ "cmp-lg", "cs.CL" ]
Harald Trost (Austrian Research Institute for Artificial Intelligence), Johannes Matiasek (Austrian Research Institute for Artificial Intelligence)
cmp-lg/9407002
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 lemmatized texts.
1994-07-04
2008-02-03
[ "cmp-lg", "cs.CL" ]
Mehryar Mohri (IGM-LADL, Paris, FRANCE)
cmp-lg/9407003
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 set of complex rules difficult to analyze. We here show that these representations can be made very compact, indicate how t...
1994-07-04
2008-02-03
[ "cmp-lg", "cs.CL" ]
Mehryar Mohri (IGM-Ladl, Paris, France)
cmp-lg/9406040
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) suggest that combined model-based and data-driven learning can produce a more plausible grammar than is the case when usin...
1994-06-28
2008-02-03
[ "cmp-lg", "cs.CL" ]
Miles Osborne (Dept. of Computer Science, University of York, York YO1 5DD, England) and Derek Bridge (Dept. of Computer Science, University of York, York, YO1 5DD, England)
cmp-lg/9406038
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 distinguish three broad classes of acknowledgments (other-->ackn, self-->other-->ackn, and self+ackn) and present a catalog...
1994-06-27
2008-02-03
[ "cmp-lg", "cs.CL" ]
David G. Novick (Oregon Graduate Institute), Stephen Sutton (Oregon Graduate Institute)
cmp-lg/9406039
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. {\it Morphological disambiguation} documents a grammar for morphological (or part-of-speech) disambiguation of English, done within the Constrain...
1994-06-27
2008-02-03
[ "cmp-lg", "cs.CL" ]
Atro Voutilainen (Research Unit for Computational Linguistics, University of Helsinki)
cmp-lg/9406035
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 methods for linguistic performance modelling on the basis of high-level competence grammars; o new methods for modelling ...
1994-06-23
2008-02-03
[ "cmp-lg", "cs.CL" ]
Hans Uszkoreit, Rolf Backofen, Stephan Busemann, Abdel Kader Diagne, Elizabeth A. Hinkelman, Walter Kasper, Bernd Kiefer, Hans-Ulrich Krieger, Klaus Netter, Guenter Neumann, Stephan Oepen, Stephen P. Spackman
cmp-lg/9406034
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 efficient, effective, and highly perspicuous recipe for resolving a given ambiguity. By identifying and utilizing only the si...
1994-06-23
2008-02-03
[ "cmp-lg", "cs.CL" ]
David Yarowsky (University of Pennsylvania)
cmp-lg/9406037
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 domain-independent lexical frequency and distribution information to recognize the interactions of multiple simultaneous the...
1994-06-23
2008-02-03
[ "cmp-lg", "cs.CL" ]
Marti A. Hearst (UC Berkeley and Xerox PARC)
cmp-lg/9406036
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.
1994-06-23
2009-09-25
[ "cmp-lg", "cs.CL" ]
Michael Riley, Richard Sproat (Linguistics Research Department, AT&T Bell Laboratories, Murray Hill, NJ)
cmp-lg/9406033
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 examined to show that lexical selection must be based on interpretation of the sentence as well as selection restriction...
1994-06-22
2008-02-03
[ "cmp-lg", "cs.CL" ]
Zhibiao Wu (National University of Singapore) and Martha Palmer (University of Pennsylvania)
cmp-lg/9406032
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 what an anytime algorithm is. We arque that parsing algorithms have to be classified as contract algorithms as opposed to (truly) in...
1994-06-21
2008-02-03
[ "cmp-lg", "cs.CL" ]
Guenther Goerz (University of Erlangen-Nuernberg, IMMD VIII) and Marcus Kesseler (University of Erlangen-Nuernberg, IMMD VIII)
cmp-lg/9406028
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 yet have a meaning-based account and propose one which is based on the interaction of discourse and grammatical function....
1994-06-20
2008-02-03
[ "cmp-lg", "cs.CL" ]
Michael Niv (University of Pennsylvania)
cmp-lg/9406030
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 applications of --> that result in normal form (NF). The shortest NF sequence for a term x is always n-drm(x), where n is...
1994-06-20
2008-02-03
[ "cmp-lg", "cs.CL" ]
Michael Niv (Technion)
cmp-lg/9406029
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, however, as example 1 demonstrates. 1. The horse raced past the barn fell. This sentence is perfectly grammatical, as is...
1994-06-20
2008-02-03
[ "cmp-lg", "cs.CL" ]
Michael Niv (University of Pennsylvania)
cmp-lg/9406031
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 most `sensible', one comes to the conclusion that interpretation, hence parsing take place incrementally, just about every w...
1994-06-20
2008-02-03
[ "cmp-lg", "cs.CL" ]
Michael Niv (Technion)
cmp-lg/9406027
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 language models be improved so that more complex speech recognition tasks can be tackled? Since the knowledge of the weakn...
1994-06-17
2008-02-03
[ "cmp-lg", "cs.CL" ]
Joerg P. Ueberla
cmp-lg/9406026
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" treatments of natural language developed over the last decade or so, mostly in response to problems associated with donkey anaphora? In Dynamic Lo...
1994-06-17
2008-02-03
[ "cmp-lg", "cs.CL" ]
David Israel (Artificial Intelligence Center, SRI)
cmp-lg/9406024
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 the syntactic and semantic analysis of spontaneous spoken language. The general approach is based on incremental immediate...
1994-06-16
2008-02-03
[ "cmp-lg", "cs.CL" ]
Stefan Wermter (Dept. of Computer Science, University of Hamburg, FRG) and Volker Weber (Dept. of Computer Science, University of Hamburg, FRG)
cmp-lg/9406025
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 in a chart. Chart-like parsing and semantic-head-driven generation emerge from this method. With a parsimonious instantiat...
1994-06-16
2008-02-03
[ "cmp-lg", "cs.CL" ]
HASIDA Koiti (Electrotechnical Laboratory)
cmp-lg/9406023
A Spanish Tagset for the CRATER Project
This working paper describes the Spanish tagset to be used in the context of CRATER, a CEC funded project aiming at the creation of a multilingual (English, French, Spanish) aligned corpus using the International Telecommunications Union corpus. In this respect, each version of the corpus will be (or is currently) tagg...
1994-06-14
2016-08-14
[ "cmp-lg", "cs.CL" ]
Fernando S\'anchez Le\'on (Laboratorio de Ling\"u\'istica Inform\'atica, Facultad de Filosof\'ia y Letras, Universidad Aut\'onoma de Madrid)
cmp-lg/9406022
An implemented model of punning riddles
In this paper, we discuss a model of simple question-answer punning, implemented in a program, JAPE, which generates riddles from humour-independent lexical entries. The model uses two main types of structure: schemata, which determine the relationships between key words in a joke, and templates, which produce the surf...
1994-06-13
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kim Binsted (Department of Artificial Intelligence, University of Edinburgh), Graeme Ritchie (Department of Artificial Intelligence, University of Edinburgh)
cmp-lg/9406021
A symbolic description of punning riddles and its computer implementation
Riddles based on simple puns can be classified according to the patterns of word, syllable or phrase similarity they depend upon. We have devised a formal model of the semantic and syntactic regularities underlying some of the simpler types of punning riddle. We have also implemented this preliminary theory in a comput...
1994-06-13
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kim Binsted (Department of Artificial Intelligence, University of Edinburgh), Graeme Ritchie (Department of Artificial Intelligence, University of Edinburgh)
cmp-lg/9406020
DPOCL: A Principled Approach to Discourse Planning
Research in discourse processing has identified two representational requirements for discourse planning systems. First, discourse plans must adequately represent the intentional structure of the utterances they produce in order to enable a computational discourse agent to respond effectively to communicative failures ...
1994-06-10
2008-02-03
[ "cmp-lg", "cs.CL" ]
R. Michael Young (Intelligent Systems Program, University of Pittsburgh) and Johanna D. Moore (Department of Computer Science and Learning Research and Development Center, University of Pittsburgh)
cmp-lg/9406019
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions considered in this paper are the possibly quantified first-order formulae obtained fr...
1994-06-10
2008-02-03
[ "cmp-lg", "cs.CL" ]
Rolf Backofen, Gert Smolka
cmp-lg/9406018
TDL--- A Type Description Language for Constraint-Based Grammars
This paper presents \tdl, a typed feature-based representation language and inference system. Type definitions in \tdl\ consist of type and feature constraints over the boolean connectives. \tdl\ supports open- and closed-world reasoning over types and allows for partitions and incompatible types. Working with partiall...
1994-06-08
2019-08-15
[ "cmp-lg", "cs.CL" ]
Hans-Ulrich Krieger, Ulrich Sch\"afer
cmp-lg/9406015
Statistical Augmentation of a Chinese Machine-Readable Dictionary
We describe a method of using statistically-collected Chinese character groups from a corpus to augment a Chinese dictionary. The method is particularly useful for extracting domain-specific and regional words not readily available in machine-readable dictionaries. Output was evaluated both using human evaluators and a...
1994-06-07
2008-02-03
[ "cmp-lg", "cs.CL" ]
Pascale Fung (Columbia University) and Dekai Wu (Hong Kong University of Science & Technology)
cmp-lg/9406014
A Hybrid Reasoning Model for Indirect Answers
This paper presents our implemented computational model for interpreting and generating indirect answers to Yes-No questions. Its main features are 1) a discourse-plan-based approach to implicature, 2) a reversible architecture for generation and interpretation, 3) a hybrid reasoning model that employs both plan infere...
1994-06-07
2008-02-03
[ "cmp-lg", "cs.CL" ]
Nancy Green (University of Delaware) and Sandra Carberry (University of Delaware and Visitor: IRCS, University of Pennsylvania)
cmp-lg/9406016
Corpus-Driven Knowledge Acquisition for Discourse Analysis
The availability of large on-line text corpora provides a natural and promising bridge between the worlds of natural language processing (NLP) and machine learning (ML). In recent years, the NLP community has been aggressively investigating statistical techniques to drive part-of-speech taggers, but application-specifi...
1994-06-07
2008-02-03
[ "cmp-lg", "cs.CL" ]
Stephen Soderland and Wendy Lehnert (University of Massachusetts)
cmp-lg/9406017
An Automatic Method of Finding Topic Boundaries
This article outlines a new method of locating discourse boundaries based on lexical cohesion and a graphical technique called dotplotting. The application of dotplotting to discourse segmentation can be performed either manually, by examining a graph, or automatically, using an optimization algorithm. The results of t...
1994-06-07
2008-02-03
[ "cmp-lg", "cs.CL" ]
Jeffrey C. Reynar (University of Pennsylvania)
cmp-lg/9406013
Graded Unification: A Framework for Interactive Processing
An extension to classical unification, called {\em graded unification} is presented. It is capable of combining contradictory information. An interactive processing paradigm and parser based on this new operator are also presented.
1994-06-05
2008-02-03
[ "cmp-lg", "cs.CL" ]
Albert Kim (University of Pennsylvania)
cmp-lg/9406011
Exploring the Statistical Derivation of Transformational Rule Sequences for Part-of-Speech Tagging
Eric Brill has recently proposed a simple and powerful corpus-based language modeling approach that can be applied to various tasks including part-of-speech tagging and building phrase structure trees. The method learns a series of symbolic transformational rules, which can then be applied in sequence to a test corpus ...
1994-06-03
2008-02-03
[ "cmp-lg", "cs.CL" ]
Lance A. Ramshaw (Univ. of Pennsylvania and Bowdoin College), and Mitchell P. Marcus (Univ. of Pennsylvania)
cmp-lg/9406012
Self-Organizing Machine Translation: Example-Driven Induction of Transfer Functions
With the advent of faster computers, the notion of doing machine translation from a huge stored database of translation examples is no longer unreasonable. This paper describes an attempt to merge the Example-Based Machine Translation (EBMT) approach with psycholinguistic principles. A new formalism for context- free g...
1994-06-03
2008-02-03
[ "cmp-lg", "cs.CL" ]
Patrick Juola (University of Colorado)
cmp-lg/9406008
Parsing Turkish with the Lexical Functional Grammar Formalism
This paper describes our work on parsing Turkish using the lexical-functional grammar formalism. This work represents the first significant effort for parsing Turkish. Our implementation is based on Tomita's parser developed at Carnegie-Mellon University Center for Machine Translation. The grammar covers a substantial ...
1994-06-02
2008-02-03
[ "cmp-lg", "cs.CL" ]
Zelal Gungordu (Center for Cognitive Science, Univ. of Edinburgh) and Kemal Oflazer (Dept of Computer Engineering, Bilkent University, Ankara)
cmp-lg/9406010
Some Advances in Transformation-Based Part of Speech Tagging
Most recent research in trainable part of speech taggers has explored stochastic tagging. While these taggers obtain high accuracy, linguistic information is captured indirectly, typically in tens of thousands of lexical and contextual probabilities. In [Brill92], a trainable rule-based tagger was described that obtain...
1994-06-02
2008-02-03
[ "cmp-lg", "cs.CL" ]
Eric Brill (MIT)
cmp-lg/9406009
Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multiset-valued feature structures in unification-based formalisms, while the latter is motivated by word order variation and by ``quasi-trees'', a generalization of trees. The tw...
1994-06-02
2008-02-03
[ "cmp-lg", "cs.CL" ]
Owen Rambow (Universite Paris 7)
cmp-lg/9406007
Aligning a Parallel English-Chinese Corpus Statistically with Lexical Criteria
We describe our experience with automatic alignment of sentences in parallel English-Chinese texts. Our report concerns three related topics: (1) progress on the HKUST English-Chinese Parallel Bilingual Corpus; (2) experiments addressing the applicability of Gale & Church's length-based statistical method to the ta...
1994-06-02
2016-08-31
[ "cmp-lg", "cs.CL" ]
Dekai Wu (Hong Kong University of Science & Technology)
cmp-lg/9406004
Towards a Principled Representation of Discourse Plans
We argue that discourse plans must capture the intended causal and decompositional relations between communicative actions. We present a planning algorithm, DPOCL, that builds plan structures that properly capture these relations, and show how these structures are used to solve the problems that plagued previous discou...
1994-06-01
2008-02-03
[ "cmp-lg", "cs.CL" ]
R. Michael Young (Intelligent Systems Program, University of Pittsburgh), Johanna D. Moore (Department of Computer Science and Learning Research and Development Center, University of Pittsburgh) and Martha E. Pollack (Department of Computer Science and Intelligent Systems Program, University of Pittsburgh)
cmp-lg/9406002
Speech Dialogue with Facial Displays: Multimodal Human-Computer Conversation
Human face-to-face conversation is an ideal model for human-computer dialogue. One of the major features of face-to-face communication is its multiplicity of communication channels that act on multiple modalities. To realize a natural multimodal dialogue, it is necessary to study how humans perceive information and det...
1994-06-01
2008-02-03
[ "cmp-lg", "cs.CL" ]
Katashi Nagao (Sony Computer Science Laboratory Inc.) and Akikazu Takeuchi (Sony Computer Science Laboratory Inc.)
cmp-lg/9405034
Extracting Noun Phrases from Large-Scale Texts: A Hybrid Approach and Its Automatic Evaluation
To acquire noun phrases from running texts is useful for many applications, such as word grouping,terminology indexing, etc. The reported literatures adopt pure probabilistic approach, or pure rule-based noun phrases grammar to tackle this problem. In this paper, we apply a probabilistic chunker to deciding the implici...
1994-06-01
2008-02-03
[ "cmp-lg", "cs.CL" ]
Kuang-hua Chen (National Taiwan University) and Hsin-Hsi Chen (National Taiwan University)
cmp-lg/9406001
Intentions and Information in Discourse
This paper is about the flow of inference between communicative intentions, discourse structure and the domain during discourse processing. We augment a theory of discourse interpretation with a theory of distinct mental attitudes and reasoning about them, in order to provide an account of how the attitudes interact wi...
1994-06-01
2008-02-03
[ "cmp-lg", "cs.CL" ]
Nicholas Asher (IRIT, Universite Paul Sabatier, Toulouse), Alex Lascarides (Department of Linguistics, Stanford University)
cmp-lg/9406006
Detecting and Correcting Speech Repairs
Interactive spoken dialog provides many new challenges for spoken language systems. One of the most critical is the prevalence of speech repairs. This paper presents an algorithm that detects and corrects speech repairs based on finding the repair pattern. The repair pattern is built by finding word matches and word re...
1994-06-01
2008-02-03
[ "cmp-lg", "cs.CL" ]
Peter Heeman (U of Rochester) and James Allen (U of Rochester)
cmp-lg/9406003
A Learning Approach to Natural Language Understanding
In this paper we propose a learning paradigm for the problem of understanding spoken language. The basis of the work is in a formalization of the understanding problem as a communication problem. This results in the definition of a stochastic model of the production of speech or text starting from the meaning of a sent...
1994-06-01
2008-02-03
[ "cmp-lg", "cs.CL" ]
Roberto Pieraccini (AT&T Bell Laboratories), Esther Levin (AT&T Bell Laboratories)
cmp-lg/9406005
Word-Sense Disambiguation Using Decomposable Models
Most probabilistic classifiers used for word-sense disambiguation have either been based on only one contextual feature or have used a model that is simply assumed to characterize the interdependencies among multiple contextual features. In this paper, a different approach to formulating a probabilistic model is presen...
1994-06-01
2008-02-03
[ "cmp-lg", "cs.CL" ]
Rebecca Bruce and Janyce Wiebe (New Mexico State University)
cmp-lg/9405035
Dual-Coding Theory and Connectionist Lexical Selection
We introduce the bilingual dual-coding theory as a model for bilingual mental representation. Based on this model, lexical selection neural networks are implemented for a connectionist transfer project in machine translation. This lexical selection approach has two advantages. First, it is learnable. Little human effor...
1994-05-31
2008-02-03
[ "cmp-lg", "cs.CL" ]
Ye-Yi Wang (Carnegie Mellon University)
cmp-lg/9405033
Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars
The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results imply that the study and optimisation of unification-based parsing must rely on empirical dat...
1994-05-31
2008-02-03
[ "cmp-lg", "cs.CL" ]
John Carroll (University of Cambridge, Computer Laboratory)
cmp-lg/9405029
Structural Tags, Annealing and Automatic Word Classification
This paper describes an automatic word classification system which uses a locally optimal annealing algorithm and average class mutual information. A new word-class representation, the structural tag is introduced and its advantages for use in statistical language modelling are presented. A summary of some results with...
1994-05-30
2008-02-03
[ "cmp-lg", "cs.CL" ]
John McMahon and F.J.Smith (Queen's University, Belfast)
cmp-lg/9405032
Modularity in a Connectionist Model of Morphology Acquisition
This paper describes a modular connectionist model of the acquisition of receptive inflectional morphology. The model takes inputs in the form of phones one at a time and outputs the associated roots and inflections. In its simplest version, the network consists of separate simple recurrent subnetworks for root and inf...
1994-05-30
2008-02-03
[ "cmp-lg", "cs.CL" ]
Michael Gasser (Indiana University)
cmp-lg/9405031
An Attributive Logic of Set Descriptions and Set Operations
This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted universal role quantifications, set union, intersection, subset and disjointness. A ...
1994-05-30
2008-02-03
[ "cmp-lg", "cs.CL" ]
Suresh Manandhar (HCRC Language Technology Group, The University of Edinburgh, UK)
cmp-lg/9405030
Priority Union and Generalization in Discourse Grammars
We describe an implementation in Carpenter's typed feature formalism, ALE, of a discourse grammar of the kind proposed by Scha, Polanyi, et al. We examine their method for resolving parallelism-dependent anaphora and show that there is a coherent feature-structural rendition of this type of grammar which uses the opera...
1994-05-30
2008-02-03
[ "cmp-lg", "cs.CL" ]
Claire Grover, Chris Brew, Suresh Manandhar, Marc Moens (HCRC Language Technology Group, University of Edinburgh)
cmp-lg/9405028
Semantics of Complex Sentences in Japanese
The important part of semantics of complex sentence is captured as relations among semantic roles in subordinate and main clause respectively. However if there can be relations between every pair of semantic roles, the amount of computation to identify the relations that hold in the given sentence is extremely large. I...
1994-05-28
2008-02-03
[ "cmp-lg", "cs.CL" ]
Hiroshi Nakagawa, and Shin'ichiro Nishizawa
cmp-lg/9405027
Acquiring Receptive Morphology: A Connectionist Model
This paper describes a modular connectionist model of the acquisition of receptive inflectional morphology. The model takes inputs in the form of phones one at a time and outputs the associated roots and inflections. Simulations using artificial language stimuli demonstrate the capacity of the model to learn suffixatio...
1994-05-27
2008-02-03
[ "cmp-lg", "cs.CL" ]
Michael Gasser
cmp-lg/9405026
An Extended Theory of Head-Driven Parsing
We show that more head-driven parsing algorithms can be formulated than those occurring in the existing literature. These algorithms are inspired by a family of left-to-right parsing algorithms from a recent publication. We further introduce a more advanced notion of ``head-driven parsing'' which allows more detailed s...
1994-05-26
2008-02-03
[ "cmp-lg", "cs.CL" ]
Mark-Jan Nederhof (University of Nijmegen) and Giorgio Satta (University of Padova)