Skip to content

Computation and Language papers — page 4

cmp-lgBrowse archive

A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation
This paper presents a new context-free parsing algorithm based on a bidirectional strictly horizontal strategy which incorporates strong top-down predictions (derivations and adjacencies). From a…
Jose F. QuesadaJan 26, 1998
Learn
Modularity in inductively-learned word pronunciation systems
In leading morpho-phonological theories and state-of-the-art text-to-speech systems it is assumed that word pronunciation cannot be learned or performed without in-between analyses at several…
Antal van den Bosch, Ton Weijters, Walter DaelemansJan 26, 1998
Learn
Do not forget: Full memory in memory-based learning of word pronunciation
Memory-based learning, keeping full memory of learning material, appears a viable approach to learning NLP tasks, and is often superior in generalisation accuracy to eager learning approaches that…
Antal van den Bosch, Walter DaelemansJan 26, 1998
Learn
Hierarchical Non-Emitting Markov Models
We describe a simple variant of the interpolated Markov model with non-emitting state transitions and prove that it is strictly more powerful than any Markov model. More importantly, the non-emitting…
Eric Sven Ristad, Robert G. ThomasJan 20, 1998
Learn
Identifying Discourse Markers in Spoken Dialog
In this paper, we present a method for identifying discourse marker usage in spontaneous speech based on machine learning. Discourse markers are denoted by special POS tags, and thus the process of…
Peter A. Heeman, Donna Byron, James F. AllenJan 17, 1998
Learn
Orthographic Structuring of Human Speech and Texts: Linguistic Application of Recurrence Quantification Analysis
A methodology based upon recurrence quantification analysis is proposed for the study of orthographic structure of written texts. Five different orthographic data sets (20th century Italian poems,…
F. Orsucci, K. Walter, A. Giuliani et al.Dec 24, 1997
Learn
Speech Repairs, Intonational Boundaries and Discourse Markers: Modeling Speakers' Utterances in Spoken Dialog
In this thesis, we present a statistical language model for resolving speech repairs, intonational boundaries and discourse markers. Rather than finding the best word interpretation for an acoustic…
Peter A. HeemanDec 23, 1997
Learn
What is word sense disambiguation good for?
Word sense disambiguation has developed as a sub-area of natural language processing, as if, like parsing, it was a well-defined task which was a pre-requisite to a wide range of…
Adam KilgarriffDec 23, 1997
Learn
Foreground and Background Lexicons and Word Sense Disambiguation for Information Extraction
Lexicon acquisition from machine-readable dictionaries and corpora is currently a dynamic field of research, yet it is often not clear how lexical information so acquired can be used, or how it…
Adam KilgarriffDec 23, 1997
Learn
"I don't believe in word senses"
Word sense disambiguation assumes word senses. Within the lexicography and linguistics literature, they are known to be very slippery entities. The paper looks at problems with existing accounts of…
Adam KilgarriffDec 23, 1997
Learn
Topic Graph Generation for Query Navigation: Use of Frequency Classes for Topic Extraction
To make an interactive guidance mechanism for document retrieval systems, we developed a user-interface which presents users the visualized map of topics at each stage of retrieval process. Topic…
Yoshiki Niwa, Shingo Nishioka, Makoto Iwayama et al.Dec 12, 1997
Learn
Machine Learning of User Profiles: Representational Issues
As more information becomes available electronically, tools for finding information of interest to users becomes increasingly important. The goal of the research described here is to build a system…
Eric Bloedorn, Inderjeet Mani, T. Richard MacMillanDec 11, 1997
Learn
Multi-document Summarization by Graph Search and Matching
We describe a new method for summarizing similarities and differences in a pair of related documents using a graph representation for text. Concepts denoted by words, phrases, and proper names in the…
Inderjeet Mani, Eric BloedornDec 10, 1997
Learn
Context as a Spurious Concept
I take issue with AI formalizations of context, primarily the formalization by McCarthy and Buvac, that regard context as an undefined primitive whose formalization can be the same in many different…
Graeme HirstDec 9, 1997
Learn
Applying Explanation-based Learning to Control and Speeding-up Natural Language Generation
This paper presents a method for the automatic extraction of subgrammars to control and speeding-up natural language generation NLG. The method is based on explanation-based learning (EBL). The main…
Guenter NeumannDec 8, 1997
Learn
Type-driven semantic interpretation and feature dependencies in R-LFG
Once one has enriched LFG's formal machinery with the linear logic mechanisms needed for semantic interpretation as proposed by Dalrymple et. al., it is natural to ask whether these make any…
Mark JohnsonNov 21, 1997
Learn
The effect of alternative tree representations on tree bank grammars
The performance of PCFGs estimated from tree banks is sensitive to the particular way in which linguistic constructions are represented as trees in the tree bank. This paper presents a theoretical…
Mark JohnsonNov 21, 1997
Learn
Features as Resources in R-LFG
This paper introduces a non-unification-based version of LFG called R-LFG (Resource-based Lexical Functional Grammar), which combines elements from both LFG and Linear Logic. The paper argues that a…
Mark JohnsonNov 20, 1997
Learn
Proof Nets and the Complexity of Processing Center-Embedded Constructions
This paper shows how proof nets can be used to formalize the notion of ``incomplete dependency'' used in psycholinguistic theories of the unacceptability of center-embedded constructions.…
Mark JohnsonNov 20, 1997
Learn
Application-driven automatic subgrammar extraction
The space and run-time requirements of broad coverage grammars appear for many applications unreasonably large in relation to the relative simplicity of the task at hand. On the other hand,…
Renate Henschel, John A. BatemanNov 19, 1997
Learn
Towards an Improved Performance Measure for Language Models
In this paper a first attempt at deriving an improved performance measure for language models, the probability ratio measure (PRM) is described. In a proof of concept experiment, it is shown that PRM…
Joerg P. UeberlaNov 19, 1997
Learn
On the use of expectations for detecting and repairing human-machine miscommunication
In this paper I describe how miscommunication problems are dealt with in the spoken language system DIALOGOS. The dialogue module of the system exploits dialogic expectations in a twofold way: to…
Morena DanieliNov 19, 1997
Learn
Language Modelling For Task-Oriented Domains
This paper is focused on the language modelling for task-oriented domains and presents an accurate analysis of the utterances acquired by the Dialogos spoken dialogue system. Dialogos allows access…
Cosmin Popovici, Paolo BaggiaNov 19, 1997
Learn
Contextual Information and Specific Language Models for Spoken Language Understanding
In this paper we explain how contextual expectations are generated and used in the task-oriented spoken language understanding system Dialogos. The hard task of recognizing spontaneous speech on the…
Paolo Baggia, Morena Danieli, Elisabetta Gerbino et al.Nov 19, 1997
Learn
Some apparently disjoint aims and requirements for grammar development environments: the case of natural language generation
Grammar development environments (GDE's) for analysis and for generation have not yet come together. Despite the fact that analysis-oriented GDE's (such as ALEP) may include some possibility…
John A. BatemanNov 19, 1997
Learn
← PreviousPage 4Next →