Skip to content

Computation and Language papers — page 35

cmp-lgBrowse archive

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…
John CarrollMay 31, 1994
Learn
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…
Michael GasserMay 30, 1994
Learn
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,…
Suresh ManandharMay 30, 1994
Learn
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…
Claire Grover, Chris Brew, Suresh Manandhar et al.May 30, 1994
Learn
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…
John McMahon, F. J. SmithMay 30, 1994
Learn
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…
Hiroshi Nakagawa, Shin'ichiro NishizawaMay 28, 1994
Learn
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…
Michael GasserMay 27, 1994
Learn
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…
Mark-Jan Nederhof, Giorgio SattaMay 26, 1994
Learn
An Optimal Tabular Parsing Algorithm
In this paper we relate a number of parsing algorithms which have been developed in very different areas of parsing theory, and which include deterministic algorithms, tabular algorithms, and a…
Mark-Jan NederhofMay 26, 1994
Learn
Abductive Equivalential Translation and its application to Natural Language Database Interfacing
The thesis describes a logical formalization of natural-language database interfacing. We assume the existence of a ``natural language engine'' capable of mediating between surface linguistic…
Manny RaynerMay 26, 1994
Learn
An Integrated Heuristic Scheme for Partial Parse Evaluation
GLR* is a recently developed robust version of the Generalized LR Parser, that can parse almost ANY input sentence by ignoring unrecognizable parts of the sentence. On a given input sentence, the…
Alon LavieMay 26, 1994
Learn
Grammar Specialization through Entropy Thresholds
Explanation-based generalization is used to extract a specialized grammar from the original one using a training corpus of parse trees. This allows very much faster parsing and gives a lower error…
Christer SamuelssonMay 25, 1994
Learn
Capturing CFLs with Tree Adjoining Grammars
We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LCFGs of Schabes and Waters but with…
James RogersMay 24, 1994
Learn
Generating Precondition Expressions in Instructional Text
This study employs a knowledge intensive corpus analysis to identify the elements of the communicative context which can be used to determine the appropriate lexical and grammatical form of…
Keith Vander LindenMay 24, 1994
Learn
Determination of referential property and number of nouns in Japanese sentences for machine translation into English
When translating Japanese nouns into English, we face the problem of articles and numbers which the Japanese language does not have, but which are necessary for the English composition. To solve this…
Masaki Murata, Makoto NagaoMay 19, 1994
Learn
Memory-Based Lexical Acquisition and Processing
Current approaches to computational lexicology in language technology are knowledge-based (competence-oriented) and try to abstract away from specific formalisms, domains, and applications. This…
Walter DaelemansMay 16, 1994
Learn
Precise n-gram Probabilities from Stochastic Context-free Grammars
We present an algorithm for computing n-gram probabilities from stochastic context-free grammars, a procedure that can alleviate some of the standard problems associated with n-grams (estimation from…
Andreas Stolcke, Jonathan SegalMay 10, 1994
Learn
Best-first Model Merging for Hidden Markov Model Induction
This report describes a new technique for inducing the structure of Hidden Markov Models from data which is based on the general `model merging' strategy (Omohundro 1992). The process begins with…
Andreas Stolcke, Stephen M. OmohundroMay 10, 1994
Learn
Intention-based Segmentation: Human Reliability and Correlation with Linguistic Cues
Certain spans of utterances in a discourse, referred to here as segments, are widely assumed to form coherent units. Further, the segmental structure of discourse has been claimed to constrain and be…
Rebecca J. Passonneau, Diane J. LitmanMay 9, 1994
Learn
Classifying Cue Phrases in Text and Speech Using Machine Learning
Cue phrases may be used in a discourse sense to explicitly signal discourse structure, but also in a sentential sense to convey semantic rather than structural information. This paper explores the…
Diane J. LitmanMay 9, 1994
Learn
Collaboration on reference to objects that are not mutually known
In conversation, a person sometimes has to refer to an object that is not previously known to the other participant. We present a plan-based model of how agents collaborate on reference of this sort.…
Philip G. EdmondsMay 6, 1994
Learn
Integration Of Visual Inter-word Constraints And Linguistic Knowledge In Degraded Text Recognition
Degraded text recognition is a difficult task. Given a noisy text image, a word recognizer can be applied to generate several candidates for each word image. High-level knowledge sources can then be…
Tao HongMay 6, 1994
Learn
A Plan-Based Model for Response Generation in Collaborative Task-Oriented Dialogues
This paper presents a plan-based architecture for response generation in collaborative consultation dialogues, with emphasis on cases in which the system (consultant) and user (executing agent)…
Jennifer Chu-Carroll, Sandra CarberryMay 5, 1994
Learn
A Stochastic Finite-State Word-Segmentation Algorithm for Chinese
We present a stochastic finite-state model for segmenting Chinese text into dictionary entries and productively derived words, and providing pronunciations for these words; the method incorporates a…
Richard Sproat, Chilin Shih, William Gale et al.May 3, 1994
Learn
Natural Language Parsing as Statistical Pattern Recognition
Traditional natural language parsers are based on rewrite rule systems developed in an arduous, time-consuming manner by grammarians. A majority of the grammarian's efforts are devoted to the…
David M. MagermanMay 3, 1994
Learn
← PreviousPage 35Next →