Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
33,904 | Temporal Relations: Reference or Discourse Coherence? | cs.CL | The temporal relations that hold between events described by successive
utterances are often left implicit or underspecified. We address the role of
two phenomena with respect to the recovery of these relations: (1) the
referential properties of tense, and (2) the role of temporal constraints
imposed by coherence relat... | computer science |
33,905 | Some Bibliographical References on Intonation and Intonational Meaning | cs.CL | A by-no-means-complete collection of references for those interested in
intonational meaning, with other miscellaneous references on intonation
included. Additional references are welcome, and should be sent to
julia@research.att.com. | computer science |
33,906 | Syntactic-Head-Driven Generation | cs.CL | The previously proposed semantic-head-driven generation methods run into
problems if none of the daughter constituents in the syntacto-semantic rule
schemata of a grammar fits the definition of a semantic head given in Shieber
et al. 1990. This is the case for the semantic analysis rules of certain
constraint-based sem... | computer science |
33,907 | Pearl: A Probabilistic Chart Parser | cs.CL | This paper describes a natural language parsing algorithm for unrestricted
text which uses a probability-based scoring function to select the "best" parse
of a sentence. The parser, Pearl, is a time-asynchronous bottom-up chart parser
with Earley-type top-down prediction which pursues the highest-scoring theory
in the ... | computer science |
33,908 | Efficiency, Robustness, and Accuracy in Picky Chart Parsing | cs.CL | This paper describes Picky, a probabilistic agenda-based chart parsing
algorithm which uses a technique called {\em probabilistic prediction} to
predict which grammar rules are likely to lead to an acceptable parse of the
input. Using a suboptimal search method, Picky significantly reduces the number
of edges produced ... | computer science |
33,909 | Towards History-based Grammars: Using Richer Models for Probabilistic
Parsing | cs.CL | We describe a generative probabilistic model of natural language, which we
call HBG, that takes advantage of detailed linguistic information to resolve
ambiguity. HBG incorporates lexical, syntactic, semantic, and structural
information from the parse tree into the disambiguation process in a novel way.
We use a corpus... | computer science |
33,910 | A Stochastic Finite-State Word-Segmentation Algorithm for Chinese | cs.CL | 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 class-based model in its treatment
of personal names. We also evaluate the system's performance, taking into
account the ... | computer science |
33,911 | Natural Language Parsing as Statistical Pattern Recognition | cs.CL | 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 disambiguation process, first
hypothesizing rules which dictate constituent categories and relationships
among words in ambiguou... | computer science |
33,912 | Common Topics and Coherent Situations: Interpreting Ellipsis in the
Context of Discourse Inference | cs.CL | It is claimed that a variety of facts concerning ellipsis, event reference,
and interclausal coherence can be explained by two features of the linguistic
form in question: (1) whether the form leaves behind an empty constituent in
the syntax, and (2) whether the form is anaphoric in the semantics. It is
proposed that t... | computer science |
33,913 | A Plan-Based Model for Response Generation in Collaborative
Task-Oriented Dialogues | cs.CL | 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) disagree. Our work contributes
to an overall system for collaborative problem-solving by providing a
plan-based framework that... | computer science |
33,914 | Integration Of Visual Inter-word Constraints And Linguistic Knowledge In
Degraded Text Recognition | cs.CL | 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 used to select a decision from
the candidate set for each word image. In this paper, we propose that visual
inter-word co... | computer science |
33,915 | Collaboration on reference to objects that are not mutually known | cs.CL | 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. In making a reference, an agent
uses the most salient attributes of the referent. In understanding a reference,
an agent... | computer science |
33,916 | Classifying Cue Phrases in Text and Speech Using Machine Learning | cs.CL | 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 use of machine learning for
classifying cue phrases as discourse or sentential. Two machine learning
programs (Cgrendel and... | computer science |
33,917 | Intention-based Segmentation: Human Reliability and Correlation with
Linguistic Cues | cs.CL | 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 constrained by many phenomena.
However, there is weak consensus on the nature of segments and the criteria for
recognizi... | computer science |
33,918 | Precise n-gram Probabilities from Stochastic Context-free Grammars | cs.CL | 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 sparse data, lack of
linguistic structure, among others). The method operates via the computation of
substring expectati... | computer science |
33,919 | Best-first Model Merging for Hidden Markov Model Induction | cs.CL | 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 a maximum likelihood HMM that
directly encodes the training data. Successively more general models are
produced by merging H... | computer science |
33,920 | Memory-Based Lexical Acquisition and Processing | cs.CL | 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 results in severe complexity,
acquisition and reusability bottlenecks. As an alternative, we propose a
particular performance... | computer science |
33,921 | Determination of referential property and number of nouns in Japanese
sentences for machine translation into English | cs.CL | 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 difficult problem we classified the
referential property and the number of nouns into three types respectively.
This pap... | computer science |
33,922 | Capturing CFLs with Tree Adjoining Grammars | cs.CL | 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 considerably less restriction on
the form of the grammars. The class provides a normal form for TAGs that
generate local... | computer science |
33,923 | Generating Precondition Expressions in Instructional Text | cs.CL | 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 instructional texts. \ig, an
instructional text generation system based on this analysis, is presented,
particularly with referenc... | computer science |
33,924 | Grammar Specialization through Entropy Thresholds | cs.CL | 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 rate, at the price of a small loss
in coverage. Previously, it has been necessary to specify the tree-cutting
criteria (or ... | computer science |
33,925 | An Integrated Heuristic Scheme for Partial Parse Evaluation | cs.CL | 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 parser returns a collection of
parses that correspond to maximal, or close to maximal, parsable subsets of the
original inpu... | computer science |
33,926 | Abductive Equivalential Translation and its application to Natural
Language Database Interfacing | cs.CL | 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 string and their representations as
``literal'' logical forms: the focus of interest will be the question of
relating ``literal'... | computer science |
33,927 | An Optimal Tabular Parsing Algorithm | cs.CL | 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 parallel algorithm. We show
that these algorithms are based on the same underlying ideas. By relating
existing ideas, we hope ... | computer science |
33,928 | An Extended Theory of Head-Driven Parsing | cs.CL | 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... | computer science |
33,929 | Acquiring Receptive Morphology: A Connectionist Model | cs.CL | 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... | computer science |
33,930 | Semantics of Complex Sentences in Japanese | cs.CL | 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... | computer science |
33,931 | Structural Tags, Annealing and Automatic Word Classification | cs.CL | 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... | computer science |
33,932 | Priority Union and Generalization in Discourse Grammars | cs.CL | 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... | computer science |
33,933 | An Attributive Logic of Set Descriptions and Set Operations | cs.CL | 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 ... | computer science |
33,934 | Modularity in a Connectionist Model of Morphology Acquisition | cs.CL | 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... | computer science |
33,935 | Relating Complexity to Practical Performance in Parsing with
Wide-Coverage Unification Grammars | cs.CL | 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... | computer science |
33,936 | Extracting Noun Phrases from Large-Scale Texts: A Hybrid Approach and
Its Automatic Evaluation | cs.CL | 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... | computer science |
33,937 | Dual-Coding Theory and Connectionist Lexical Selection | cs.CL | 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... | computer science |
33,938 | Intentions and Information in Discourse | cs.CL | 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... | computer science |
33,939 | Speech Dialogue with Facial Displays: Multimodal Human-Computer
Conversation | cs.CL | 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... | computer science |
33,940 | A Learning Approach to Natural Language Understanding | cs.CL | 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... | computer science |
33,941 | Towards a Principled Representation of Discourse Plans | cs.CL | 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... | computer science |
33,942 | Word-Sense Disambiguation Using Decomposable Models | cs.CL | 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... | computer science |
33,943 | Detecting and Correcting Speech Repairs | cs.CL | 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... | computer science |
33,944 | Aligning a Parallel English-Chinese Corpus Statistically with Lexical
Criteria | cs.CL | 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... | computer science |
33,945 | Parsing Turkish with the Lexical Functional Grammar Formalism | cs.CL | 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 ... | computer science |
33,946 | Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on
Derivations | cs.CL | 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... | computer science |
33,947 | Some Advances in Transformation-Based Part of Speech Tagging | cs.CL | 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... | computer science |
33,948 | Exploring the Statistical Derivation of Transformational Rule Sequences
for Part-of-Speech Tagging | cs.CL | 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 ... | computer science |
33,949 | Self-Organizing Machine Translation: Example-Driven Induction of
Transfer Functions | cs.CL | 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... | computer science |
33,950 | Graded Unification: A Framework for Interactive Processing | cs.CL | 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. | computer science |
33,951 | A Hybrid Reasoning Model for Indirect Answers | cs.CL | 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... | computer science |
33,952 | Statistical Augmentation of a Chinese Machine-Readable Dictionary | cs.CL | 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... | computer science |
33,953 | Corpus-Driven Knowledge Acquisition for Discourse Analysis | cs.CL | 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... | computer science |
33,954 | An Automatic Method of Finding Topic Boundaries | cs.CL | 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... | computer science |
33,955 | TDL--- A Type Description Language for Constraint-Based Grammars | cs.CL | 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... | computer science |
33,956 | A Complete and Recursive Feature Theory | cs.CL | 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... | computer science |
33,957 | DPOCL: A Principled Approach to Discourse Planning | cs.CL | 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 ... | computer science |
33,958 | A symbolic description of punning riddles and its computer
implementation | cs.CL | 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... | computer science |
33,959 | An implemented model of punning riddles | cs.CL | 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... | computer science |
33,960 | A Spanish Tagset for the CRATER Project | cs.CL | 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... | computer science |
33,961 | Learning Fault-tolerant Speech Parsing with SCREEN | cs.CL | 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... | computer science |
33,962 | Emergent Parsing and Generation with Generalized Chart | cs.CL | 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... | computer science |
33,963 | The Very Idea of Dynamic Semantics | cs.CL | "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... | computer science |
33,964 | Analyzing and Improving Statistical Language Models for Speech
Recognition | cs.CL | 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... | computer science |
33,965 | Resolution of Syntactic Ambiguity: the Case of New Subjects | cs.CL | 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.... | computer science |
33,966 | A Computational Model of Syntactic Processing: Ambiguity Resolution from
Interpretation | cs.CL | 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... | computer science |
33,967 | The complexity of normal form rewrite sequences for Associativity | cs.CL | 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... | computer science |
33,968 | A Psycholinguistically Motivated Parser for CCG | cs.CL | 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... | computer science |
33,969 | Anytime Algorithms for Speech Parsing? | cs.CL | 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... | computer science |
33,970 | Verb Semantics and Lexical Selection | cs.CL | 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... | computer science |
33,971 | Decision Lists for Lexical Ambiguity Resolution: Application to Accent
Restoration in Spanish and French | cs.CL | 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... | computer science |
33,972 | DISCO---An HPSG-based NLP System and its Application for Appointment
Scheduling (Project Note) | cs.CL | 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 ... | computer science |
33,973 | Text Analysis Tools in Spoken Language Processing | cs.CL | This submission contains the postscript of the final version of the slides
used in our ACL-94 tutorial. | computer science |
33,974 | Multi-Paragraph Segmentation of Expository Text | cs.CL | 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... | computer science |
33,975 | An Empirical Model of Acknowledgment for Spoken-Language Systems | cs.CL | 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... | computer science |
33,976 | Three studies of grammar-based surface-syntactic parsing of unrestricted
English text. A summary and orientation | cs.CL | 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... | computer science |
33,977 | Learning unification-based grammars using the Spoken English Corpus | cs.CL | 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... | computer science |
33,978 | Morphology with a Null-Interface | cs.CL | 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... | computer science |
33,979 | Syntactic Analysis by Local Grammars Automata: an Efficient Algorithm | cs.CL | 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. | computer science |
33,980 | Compact Representations by Finite-State Transducers | cs.CL | 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... | computer science |
33,981 | Japanese word sense disambiguation based on examples of synonyms | cs.CL | (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. | computer science |
33,982 | A Corrective Training Algorithm for Adaptive Learning in Bag Generation | cs.CL | 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... | computer science |
33,983 | Interleaving Syntax and Semantics in an Efficient Bottom-Up Parser | cs.CL | 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 ... | computer science |
33,984 | GEMINI: A Natural Language System for Spoken-Language Understanding | cs.CL | 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... | computer science |
33,985 | Tricolor DAGs for Machine Translation | cs.CL | 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... | computer science |
33,986 | Estimating Performance of Pipelined Spoken Language Translation Systems | cs.CL | 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 ... | computer science |
33,987 | Combining Knowledge Sources to Reorder N-Best Speech Hypothesis Lists | cs.CL | 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... | computer science |
33,988 | Discourse Obligations in Dialogue Processing | cs.CL | 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... | computer science |
33,989 | Phoneme Recognition Using Acoustic Events | cs.CL | 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... | computer science |
33,990 | The Acquisition of a Lexicon from Paired Phoneme Sequences and Semantic
Representations | cs.CL | 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... | computer science |
33,991 | Abstract Machine for Typed Feature Structures | cs.CL | 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... | computer science |
33,992 | Specifying Intonation from Context for Speech Synthesis | cs.CL | 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... | computer science |
33,993 | The Role of Cognitive Modeling in Achieving Communicative Intentions | cs.CL | 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... | computer science |
33,994 | Generating Context-Appropriate Word Orders in Turkish | cs.CL | 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 ... | computer science |
33,995 | Generating Multilingual Documents from a Knowledge Base: The TECHDOC
Project | cs.CL | 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... | computer science |
33,996 | Tracking Point of View in Narrative | cs.CL | 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... | computer science |
33,997 | A Sequential Algorithm for Training Text Classifiers | cs.CL | 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... | computer science |
33,998 | K-vec: A New Approach for Aligning Parallel Texts | cs.CL | 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... | computer science |
33,999 | Comparative Discourse Analysis of Parallel Texts | cs.CL | 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... | computer science |
34,000 | PACE: Pattern Accurate Computationally Efficient Bootstrapping for
Timely Discovery of Cyber-Security Concepts | cs.IR | Public disclosure of important security information, such as knowledge of
vulnerabilities or exploits, often occurs in blogs, tweets, mailing lists, and
other online sources months before proper classification into structured
databases. In order to facilitate timely discovery of such knowledge, we
propose a novel semi-... | computer science |
34,001 | Automatic Labeling for Entity Extraction in Cyber Security | cs.IR | Timely analysis of cyber-security information necessitates automated
information extraction from unstructured text. While state-of-the-art
extraction methods produce extremely accurate results, they require ample
training data, which is generally unavailable for specialized applications,
such as detecting security rela... | computer science |
34,002 | A proposal for a Chinese keyboard for cellphones, smartphones, ipads and
tablets | cs.HC | In this paper, we investigate the possibility to use two tilings of the
hyperbolic plane as basic frame for devising a way to input texts in Chinese
characters into messages of cellphones, smartphones, ipads and tablets. | computer science |
34,003 | One-Pass, One-Hash n-Gram Statistics Estimation | cs.DB | In multimedia, text or bioinformatics databases, applications query sequences
of n consecutive symbols called n-grams. Estimating the number of distinct
n-grams is a view-size estimation problem. While view sizes can be estimated by
sampling under statistical assumptions, we desire an unassuming algorithm with
universa... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.