Skip to content

Computation and Language papers — page 24

cmp-lgBrowse archive

Memoization of Coroutined Constraints
Some linguistic constraints cannot be effectively resolved during parsing at the location in which they are most naturally introduced. This paper shows how constraints can be propagated in a…
Mark Johnson, Jochen DörreApr 28, 1995
Learn
The intersection of Finite State Automata and Definite Clause Grammars
Bernard Lang defines parsing as the calculation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with some approaches…
Gertjan van NoordApr 28, 1995
Learn
A Morphographemic Model for Error Correction in Nonconcatenative Strings
This paper introduces a spelling correction system which integrates seamlessly with morphological analysis using a multi-tape formalism. Handling of various Semitic error problems is illustrated,…
Tanya Bowden, George Anton KirazApr 27, 1995
Learn
Discourse Processing of Dialogues with Multiple Threads
In this paper we will present our ongoing work on a plan-based discourse processor developed in the context of the Enthusiast Spanish to English translation system as part of the JANUS multi-lingual…
Carolyn Penstein Rose', Barbara Di Eugenio, Lori S. Levin et al.Apr 27, 1995
Learn
TAKTAG: Two-phase learning method for hybrid statistical/rule-based part-of-speech disambiguation
Both statistical and rule-based approaches to part-of-speech (POS) disambiguation have their own advantages and limitations. Especially for Korean, the narrow windows provided by hidden markov model…
Geunbae Lee, Jong-Hyeok Lee, Sanghyun ShinApr 26, 1995
Learn
Constraints, Exceptions and Representations
This paper shows that default-based phonologies have the potential to capture morphophonological generalisations which cannot be captured by non-defaul theories. In achieving this result, I offer a…
T. Mark EllisonApr 26, 1995
Learn
Phonological Derivation in Optimality Theory
Optimality Theory is a constraint-based theory of phonology which allows constraints to be violated. Consequently, implementing the theory presents problems for declarative constraint-based…
T. Mark EllisonApr 26, 1995
Learn
Computational Interpretations of the Gricean Maxims in the Generation of Referring Expressions
We examine the problem of generating definite noun phrases that are appropriate referring expressions; i.e, noun phrases that (1) successfully identify the intended referent to the hearer whilst (2)…
Robert Dale, Ehud ReiterApr 26, 1995
Learn
A Formalism and an Algorithm for Computing Pragmatic Inferences and Detecting Infelicities
Since Austin introduced the term ``infelicity'', the linguistic literature has been flooded with its use, but no formal or computational explanation has been given for it. This thesis…
Daniel MarcuApr 26, 1995
Learn
An Implemented Formalism for Computing Linguistic Presuppositions and Existential Commitments
We rely on the strength of linguistic and philosophical perspectives in constructing a framework that offers a unified explanation for presuppositions and existential commitment. We use a rich…
Daniel Marcu, Graeme HirstApr 26, 1995
Learn
A Uniform Treatment of Pragmatic Inferences in Simple and Complex Utterances and Sequences of Utterances
Drawing appropriate defeasible inferences has been proven to be one of the most pervasive puzzles of natural language processing and a recurrent problem in pragmatics. This paper provides a…
Daniel Marcu, Graeme HirstApr 26, 1995
Learn
Memoization of Top Down Parsing
This paper discusses the relationship between memoized top-down recognizers and chart parsers. It presents a version of memoization suitable for continuation-passing style programs. When applied to a…
Mark JohnsonApr 25, 1995
Learn
Estimating Lexical Priors for Low-Frequency Syncretic Forms
Given a previously unseen form that is morphologically n-ways ambiguous, what is the best estimator for the lexical prior probabilities for the various functions of the form? We argue that the best…
Harald Baayen, Richard SproatApr 24, 1995
Learn
LexGram - a practical categorial grammar formalism -
We present the LexGram system, an amalgam of (Lambek) categorial grammar and Head Driven Phrase Structure Grammar (HPSG), and show that the grammar formalism it implements is a well-structured and…
Esther KoenigApr 24, 1995
Learn
NLG vs. Templates
One of the most important questions in applied NLG is what benefits (or `value-added', in business-speak) NLG technology offers over template-based approaches. Despite the importance of this…
Ehud ReiterApr 23, 1995
Learn
Linear Logic for Meaning Assembly
Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the meanings of their…
Mary Dalrymple, John Lamping, Fernando Pereira et al.Apr 18, 1995
Learn
A Processing Model for Free Word Order Languages
Like many verb-final languages, Germn displays considerable word-order freedom: there is no syntactic constraint on the ordering of the nominal arguments of a verb, as long as the verb remains in…
Owen Rambow, Aravind K. JoshiApr 15, 1995
Learn
MAXIMUM LIKELIHOOD AND MINIMUM ENTROPY IDENTIFICATION OF GRAMMARS
Using the Thermodynamic Formalism, we introduce a Gibbsian model for the identification of regular grammars based only on positive evidence. This model mimics the natural language acquisition…
P. Collet, A. Galves, A. LopesApr 13, 1995
Learn
Abstract Machine for Typed Feature Structures
This paper describes 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…
Shuly Wintner, Nissim FrancezApr 13, 1995
Learn
SKOPE: A connectionist/symbolic architecture of spoken Korean processing
Spoken language processing requires speech and natural language integration. Moreover, spoken Korean calls for unique processing methodology due to its linguistic characteristics. This paper presents…
Geunbae Lee, Jong-Hyeok LeeApr 7, 1995
Learn
Mixed Initiative in Dialogue: An Investigation into Discourse Segmentation
Conversation between two people is usually of mixed-initiative, with control over the conversation being transferred from one person to another. We apply a set of rules for the transfer of control to…
Marilyn Walker, Steve WhittakerApr 5, 1995
Learn
Cues and control in Expert-Client Dialogues
We conducted an empirical analysis into the relation between control and discourse structure. We applied control criteria to four dialogues and identified 3 levels of discourse structure. We…
Steve Whittaker, Phil StentonApr 5, 1995
Learn
Constraint Logic Programming for Natural Language Processing
This paper proposes an evaluation of the adequacy of the constraint logic programming paradigm for natural language processing. Theoretical aspects of this question have been discussed in several…
Philippe Blache, Nabil HathoutApr 5, 1995
Learn
A Computational Treatment of HPSG Lexical Rules as Covariation in Lexical Entries
We describe a compiler which translates a set of HPSG lexical rules and their interaction into definite relations used to constrain lexical entries. The compiler ensures automatic transfer of…
Walt Detmar Meurers, Guido MinnenApr 4, 1995
Learn
Collaborating on Referring Expressions
This paper presents a computational model of how conversational participants collaborate in order to make a referring action successful. The model is based on the view of language as goal-directed…
Peter A. Heeman, Graeme HirstApr 4, 1995
Learn
← PreviousPage 24Next →