Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
14,302 | On the Reconstruction Risk of Convolutional Sparse Dictionary Learning | math.ST | Sparse dictionary learning (SDL) has become a popular method for adaptively
identifying parsimonious representations of a dataset, a fundamental problem in
machine learning and signal processing. While most work on SDL assumes a
training dataset of independent and identically distributed samples, a variant
known as con... | computer science |
14,303 | User-friendly guarantees for the Langevin Monte Carlo with inaccurate
gradient | math.ST | In this paper, we revisit the recently established theoretical guarantees for
the convergence of the Langevin Monte Carlo algorithm of sampling from a smooth
and (strongly) log-concave density. We improve, in terms of constants, the
existing results when the accuracy of sampling is measured in the Wasserstein
distance ... | computer science |
14,304 | Decentralized Online Learning with Kernels | math.OC | We consider multi-agent stochastic optimization problems over reproducing
kernel Hilbert spaces (RKHS). In this setting, a network of interconnected
agents aims to learn decision functions, i.e., nonlinear statistical models,
that are optimal in terms of a global convex functional that aggregates data
across the networ... | computer science |
14,305 | Concentration of Multilinear Functions of the Ising Model with
Applications to Network Data | math.PR | We prove near-tight concentration of measure for polynomial functions of the
Ising model under high temperature. For any degree $d$, we show that a
degree-$d$ polynomial of a $n$-spin Ising model exhibits exponential tails that
scale as $\exp(-r^{2/d})$ at radius $r=\tilde{\Omega}_d(n^{d/2})$. Our
concentration radius ... | computer science |
14,306 | Optimal Rates for Learning with Nyström Stochastic Gradient Methods | stat.ML | In the setting of nonparametric regression, we propose and study a
combination of stochastic gradient methods with Nystr\"om subsampling, allowing
multiple passes over the data and mini-batches. Generalization error bounds for
the studied algorithm are provided. Particularly, optimal learning rates are
derived consider... | computer science |
14,307 | Approximating Continuous Functions by ReLU Nets of Minimal Width | stat.ML | This article concerns the expressive power of depth in deep feed-forward
neural nets with ReLU activations. Specifically, we answer the following
question: for a fixed $d_{in}\geq 1,$ what is the minimal width $w$ so that
neural nets with ReLU activations, input dimension $d_{in}$, hidden layer
widths at most $w,$ and ... | computer science |
14,308 | Approximate Gradient Coding via Sparse Random Graphs | stat.ML | Distributed algorithms are often beset by the straggler effect, where the
slowest compute nodes in the system dictate the overall running time.
Coding-theoretic techniques have been recently proposed to mitigate stragglers
via algorithmic redundancy. Prior work in coded computation and gradient coding
has mainly focuse... | computer science |
14,309 | Implicit Regularization in Nonconvex Statistical Estimation: Gradient
Descent Converges Linearly for Phase Retrieval, Matrix Completion and Blind
Deconvolution | cs.LG | Recent years have seen a flurry of activities in designing provably efficient
nonconvex procedures for solving statistical estimation problems. Due to the
highly nonconvex nature of the empirical loss, state-of-the-art procedures
often require proper regularization (e.g. trimming, regularized cost,
projection) in order... | computer science |
14,310 | Privacy-Preserving Adversarial Networks | cs.IT | We propose a data-driven framework for optimizing privacy-preserving data
release mechanisms toward the information-theoretically optimal tradeoff
between minimizing distortion of useful data and concealing sensitive
information. Our approach employs adversarially-trained neural networks to
implement randomized mechani... | computer science |
14,311 | Necessary and Sufficient Null Space Condition for Nuclear Norm
Minimization in Low-Rank Matrix Recovery | math.OC | Low-rank matrix recovery has found many applications in science and
engineering such as machine learning, signal processing, collaborative
filtering, system identification, and Euclidean embedding. But the low-rank
matrix recovery problem is an NP hard problem and thus challenging. A commonly
used heuristic approach is... | computer science |
14,312 | Minimax Distribution Estimation in Wasserstein Distance | math.ST | The Wasserstein metric is an important measure of distance between
probability distributions, with several applications in machine learning,
statistics, probability theory, and data analysis. In this paper, we upper and
lower bound minimax rates for the problem of estimating a probability
distribution under Wasserstein... | computer science |
14,313 | Breaking the $1/\sqrt{n}$ Barrier: Faster Rates for Permutation-based
Models in Polynomial Time | stat.ML | Many applications, including rank aggregation and crowd-labeling, can be
modeled in terms of a bivariate isotonic matrix with unknown permutations
acting on its rows and columns. We consider the problem of estimating such a
matrix based on noisy observations of a subset of its entries, and design and
analyze polynomial... | computer science |
14,314 | False Discovery Rate Control via Debiased Lasso | stat.ME | We consider the problem of variable selection in high-dimensional statistical
models where the goal is to report a set of variables, out of many predictors
$X_1, \dotsc, X_p$, that are relevant to a response of interest. For linear
high-dimensional model, where the number of parameters exceeds the number of
samples $(p... | computer science |
14,315 | Hidden Integrality of SDP Relaxation for Sub-Gaussian Mixture Models | stat.ML | We consider the problem of estimating the discrete clustering structures
under Sub-Gaussian Mixture Models. Our main results establish a hidden
integrality property of a semidefinite programming (SDP) relaxation for this
problem: while the optimal solutions to the SDP are not integer-valued in
general, their estimation... | computer science |
14,316 | Adversarial Generalized Method of Moments | econ.EM | We provide an approach for learning deep neural net representations of models
described via conditional moment restrictions. Conditional moment restrictions
are widely used, as they are the language by which social scientists describe
the assumptions they make to enable causal inference. We formulate the problem
of est... | computer science |
14,317 | The Leave-one-out Approach for Matrix Completion: Primal and Dual
Analysis | stat.ML | In this paper, we introduce a powerful technique, Leave-One-Out, to the
analysis of low-rank matrix completion problems. Using this technique, we
develop a general approach for obtaining fine-grained, entry-wise bounds on
iterative stochastic procedures. We demonstrate the power of this approach in
analyzing two of the... | computer science |
14,318 | Gradient Descent with Random Initialization: Fast Global Convergence for
Nonconvex Phase Retrieval | stat.ML | This paper considers the problem of solving systems of quadratic equations,
namely, recovering an object of interest
$\mathbf{x}^{\natural}\in\mathbb{R}^{n}$ from $m$ quadratic equations/samples
$y_{i}=(\mathbf{a}_{i}^{\top}\mathbf{x}^{\natural})^{2}$, $1\leq i\leq m$. This
problem, also dubbed as phase retrieval, span... | computer science |
14,319 | A Bayesian Reflection on Surfaces | cs.CV | The topic of this paper is a novel Bayesian continuous-basis field
representation and inference framework. Within this paper several problems are
solved: The maximally informative inference of continuous-basis fields, that is
where the basis for the field is itself a continuous object and not
representable in a finite ... | computer science |
14,320 | Entropy And Vision | math.PR | In vector quantization the number of vectors used to construct the codebook
is always an undefined problem, there is always a compromise between the number
of vectors and the quantity of information lost during the compression. In this
text we present a minimum of Entropy principle that gives solution to this
compromis... | computer science |
14,321 | Penalty Decomposition Methods for $L0$-Norm Minimization | math.OC | In this paper we consider general l0-norm minimization problems, that is, the
problems with l0-norm appearing in either objective function or constraint. In
particular, we first reformulate the l0-norm constrained problem as an
equivalent rank minimization problem and then apply the penalty decomposition
(PD) method pr... | computer science |
14,322 | Robust Subjective Visual Property Prediction from Crowdsourced Pairwise
Labels | cs.CV | The problem of estimating subjective visual properties from image and video
has attracted increasing interest. A subjective visual property is useful
either on its own (e.g. image and video interestingness) or as an intermediate
representation for visual recognition (e.g. a relative attribute). Due to its
ambiguous nat... | computer science |
14,323 | Proceedings of the third "international Traveling Workshop on
Interactions between Sparse models and Technology" (iTWIST'16) | cs.NA | The third edition of the "international - Traveling Workshop on Interactions
between Sparse models and Technology" (iTWIST) took place in Aalborg, the 4th
largest city in Denmark situated beautifully in the northern part of the
country, from the 24th to 26th of August 2016. The workshop venue was at the
Aalborg Univers... | computer science |
14,324 | The Cyborg Astrobiologist: First Field Experience | cs.CV | We present results from the first geological field tests of the `Cyborg
Astrobiologist', which is a wearable computer and video camcorder system that
we are using to test and train a computer-vision system towards having some of
the autonomous decision-making capabilities of a field-geologist and
field-astrobiologist. ... | computer science |
14,325 | The Cyborg Astrobiologist: Scouting Red Beds for Uncommon Features with
Geological Significance | cs.CV | The `Cyborg Astrobiologist' (CA) has undergone a second geological field
trial, at a red sandstone site in northern Guadalajara, Spain, near Riba de
Santiuste. The Cyborg Astrobiologist is a wearable computer and video camera
system that has demonstrated a capability to find uncommon interest points in
geological image... | computer science |
14,326 | The Cyborg Astrobiologist: Porting from a wearable computer to the
Astrobiology Phone-cam | cs.CV | We have used a simple camera phone to significantly improve an `exploration
system' for astrobiology and geology. This camera phone will make it much
easier to develop and test computer-vision algorithms for future planetary
exploration. We envision that the `Astrobiology Phone-cam' exploration system
can be fruitfully... | computer science |
14,327 | Linear Segmentation and Segment Significance | cs.CL | We present a new method for discovering a segmental discourse structure of a
document while categorizing segment function. We demonstrate how retrieval of
noun phrases and pronominal forms, along with a zero-sum weighting scheme,
determines topicalized segmentation. Futhermore, we use term distribution to
aid in identi... | computer science |
14,328 | Modelling Users, Intentions, and Structure in Spoken Dialog | cs.CL | We outline how utterances in dialogs can be interpreted using a partial first
order logic. We exploit the capability of this logic to talk about the truth
status of formulae to define a notion of coherence between utterances and
explain how this coherence relation can serve for the construction of AND/OR
trees that rep... | computer science |
14,329 | A Lexicalized Tree Adjoining Grammar for English | cs.CL | This document describes a sizable grammar of English written in the TAG
formalism and implemented for use with the XTAG system. This report and the
grammar described herein supersedes the TAG grammar described in an earlier
1995 XTAG technical report. The English grammar described in this report is
based on the TAG for... | computer science |
14,330 | Prefix Probabilities from Stochastic Tree Adjoining Grammars | cs.CL | Language models for speech recognition typically use a probability model of
the form Pr(a_n | a_1, a_2, ..., a_{n-1}). Stochastic grammars, on the other
hand, are typically used to assign structure to utterances. A language model of
the above form is constructed from such grammars by computing the prefix
probability Su... | computer science |
14,331 | Conditions on Consistency of Probabilistic Tree Adjoining Grammars | cs.CL | Much of the power of probabilistic methods in modelling language comes from
their ability to compare several derivations for the same string in the
language. An important starting point for the study of such cross-derivational
properties is the notion of _consistency_. The probability model defined by a
probabilistic g... | computer science |
14,332 | Separating Dependency from Constituency in a Tree Rewriting System | cs.CL | In this paper we present a new tree-rewriting formalism called Link-Sharing
Tree Adjoining Grammar (LSTAG) which is a variant of synchronous TAGs. Using
LSTAG we define an approach towards coordination where linguistic dependency is
distinguished from the notion of constituency. Such an approach towards
coordination th... | computer science |
14,333 | Incremental Parser Generation for Tree Adjoining Grammars | cs.CL | This paper describes the incremental generation of parse tables for the
LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented
handles modifications to the input grammar by updating the parser generated so
far. In this paper, a lazy generation of LR-type parsers for TALs is defined in
which parse t... | computer science |
14,334 | A Freely Available Morphological Analyzer, Disambiguator and Context
Sensitive Lemmatizer for German | cs.CL | In this paper we present Morphy, an integrated tool for German morphology,
part-of-speech tagging and context-sensitive lemmatization. Its large lexicon
of more than 320,000 word forms plus its ability to process German compound
nouns guarantee a wide morphological coverage. Syntactic ambiguities can be
resolved with a... | computer science |
14,335 | Processing Unknown Words in HPSG | cs.CL | The lexical acquisition system presented in this paper incrementally updates
linguistic properties of unknown words inferred from their surrounding context
by parsing sentences with an HPSG grammar for German. We employ a gradual,
information-based concept of ``unknownness'' providing a uniform treatment for
the range ... | computer science |
14,336 | Computing Declarative Prosodic Morphology | cs.CL | This paper describes a computational, declarative approach to prosodic
morphology that uses inviolable constraints to denote small finite candidate
sets which are filtered by a restrictive incremental optimization mechanism.
The new approach is illustrated with an implemented fragment of Modern Hebrew
verbs couched in ... | computer science |
14,337 | On the Evaluation and Comparison of Taggers: The Effect of Noise in
Testing Corpora | cs.CL | This paper addresses the issue of {\sc pos} tagger evaluation. Such
evaluation is usually performed by comparing the tagger output with a reference
test corpus, which is assumed to be error-free. Currently used corpora contain
noise which causes the obtained performance to be a distortion of the real
value. We analyze ... | computer science |
14,338 | Improving Tagging Performance by Using Voting Taggers | cs.CL | We present a bootstrapping method to develop an annotated corpus, which is
specially useful for languages with few available resources. The method is
being applied to develop a corpus of Spanish of over 5Mw. The method consists
on taking advantage of the collaboration of two different POS taggers. The
cases in which bo... | computer science |
14,339 | Resources for Evaluation of Summarization Techniques | cs.CL | We report on two corpora to be used in the evaluation of component systems
for the tasks of (1) linear segmentation of text and (2) summary-directed
sentence extraction. We present characteristics of the corpora, methods used in
the collection of user judgments, and an overview of the application of the
corpora to eval... | computer science |
14,340 | Restrictions on Tree Adjoining Languages | cs.CL | Several methods are known for parsing languages generated by Tree Adjoining
Grammars (TAGs) in O(n^6) worst case running time. In this paper we investigate
which restrictions on TAGs and TAG derivations are needed in order to lower
this O(n^6) time complexity, without introducing large runtime constants, and
without lo... | computer science |
14,341 | Translating near-synonyms: Possibilities and preferences in the
interlingua | cs.CL | This paper argues that an interlingual representation must explicitly
represent some parts of the meaning of a situation as possibilities (or
preferences), not as necessary or definite components of meaning (or
constraints). Possibilities enable the analysis and generation of nuance,
something required for faithful tra... | computer science |
14,342 | Choosing the Word Most Typical in Context Using a Lexical Co-occurrence
Network | cs.CL | This paper presents a partial solution to a component of the problem of
lexical choice: choosing the synonym most typical, or expected, in context. We
apply a new statistical approach to representing the context of a word through
lexical co-occurrence networks. The implementation was trained and evaluated on
a large co... | computer science |
14,343 | Comparing a statistical and a rule-based tagger for German | cs.CL | In this paper we present the results of comparing a statistical tagger for
German based on decision trees and a rule-based Brill-Tagger for German. We
used the same training corpus (and therefore the same tag-set) to train both
taggers. We then applied the taggers to the same test corpus and compared their
respective b... | computer science |
14,344 | Expoiting Syntactic Structure for Language Modeling | cs.CL | The paper presents a language model that develops syntactic structure and
uses it to extract meaningful information from the word history, thus enabling
the use of long distance dependencies. The model assigns probability to every
joint sequence of words--binary-parse-structure with headword annotation and
operates in ... | computer science |
14,345 | A Structured Language Model | cs.CL | The paper presents a language model that develops syntactic structure and
uses it to extract meaningful information from the word history, thus enabling
the use of long distance dependencies. The model assigns probability to every
joint sequence of words - binary-parse-structure with headword annotation. The
model, its... | computer science |
14,346 | A Probabilistic Approach to Lexical Semantic Knowledge Acquisition and S
tructural Disambiguation | cs.CL | In this thesis, I address the problem of automatically acquiring lexical
semantic knowledge, especially that of case frame patterns, from large corpus
data and using the acquired knowledge in structural disambiguation. The
approach I adopt has the following characteristics: (1) dividing the problem
into three subproble... | computer science |
14,347 | Optimal Multi-Paragraph Text Segmentation by Dynamic Programming | cs.CL | There exist several methods of calculating a similarity curve, or a sequence
of similarity values, representing the lexical cohesion of successive text
constituents, e.g., paragraphs. Methods for deciding the locations of fragment
boundaries are, however, scarce. We propose a fragmentation method based on
dynamic progr... | computer science |
14,348 | A Flexible Shallow Approach to Text Generation | cs.CL | In order to support the efficient development of NL generation systems, two
orthogonal methods are currently pursued with emphasis: (1) reusable, general,
and linguistically motivated surface realization components, and (2) simple,
task-oriented template-based techniques. In this paper we argue that, from an
applicatio... | computer science |
14,349 | An Empirical Approach to Temporal Reference Resolution (journal version) | cs.CL | Scheduling dialogs, during which people negotiate the times of appointments,
are common in everyday life. This paper reports the results of an in-depth
empirical investigation of resolving explicit temporal references in scheduling
dialogs. There are four phases of this work: data annotation and evaluation,
model devel... | computer science |
14,350 | Compacting the Penn Treebank Grammar | cs.CL | Treebanks, such as the Penn Treebank (PTB), offer a simple approach to
obtaining a broad coverage grammar: one can simply read the grammar off the
parse trees in the treebank. While such a grammar is easy to obtain, a
square-root rate of growth of the rule set with corpus size suggests that the
derived grammar is far f... | computer science |
14,351 | The "Fodor"-FODOR fallacy bites back | cs.CL | The paper argues that Fodor and Lepore are misguided in their attack on
Pustejovsky's Generative Lexicon, largely because their argument rests on a
traditional, but implausible and discredited, view of the lexicon on which it
is effectively empty of content, a view that stands in the long line of
explaining word meanin... | computer science |
14,352 | Is Word Sense Disambiguation just one more NLP task? | cs.CL | This paper compares the tasks of part-of-speech (POS) tagging and
word-sense-tagging or disambiguation (WSD), and argues that the tasks are not
related by fineness of grain or anything like that, but are quite different
kinds of task, particularly becuase there is nothing in POS corresponding to
sense novelty. The pape... | computer science |
14,353 | A Formal Framework for Linguistic Annotation | cs.CL | `Linguistic annotation' covers any descriptive or analytic notations applied
to raw language data. The basic data may be in the form of time functions --
audio, video and/or physiological recordings -- or it may be textual. The added
notations may include transcriptions of all sorts (from phonetic features to
discourse... | computer science |
14,354 | Empirically Evaluating an Adaptable Spoken Dialogue System | cs.CL | Recent technological advances have made it possible to build real-time,
interactive spoken dialogue systems for a wide variety of applications.
However, when users do not respect the limitations of such systems, performance
typically degrades. Although users differ with respect to their knowledge of
system limitations,... | computer science |
14,355 | Transducers from Rewrite Rules with Backreferences | cs.CL | Context sensitive rewrite rules have been widely used in several areas of
natural language processing, including syntax, morphology, phonology and speech
processing. Kaplan and Kay, Karttunen, and Mohri & Sproat have given various
algorithms to compile such rewrite rules into finite-state transducers. The
present paper... | computer science |
14,356 | An ascription-based approach to speech acts | cs.CL | The two principal areas of natural language processing research in pragmatics
are belief modelling and speech act processing. Belief modelling is the
development of techniques to represent the mental attitudes of a dialogue
participant. The latter approach, speech act processing, based on speech act
theory, involves vi... | computer science |
14,357 | A Computational Memory and Processing Model for Processing | cs.CL | This paper links prosody to the information in a text and how it is processed
by the speaker. It describes the operation and output of LOQ, a text-to-speech
implementation that includes a model of limited attention and working memory.
Attentional limitations are key. Varying the attentional parameter in the
simulations... | computer science |
14,358 | Supervised Grammar Induction Using Training Data with Limited
Constituent Information | cs.CL | Corpus-based grammar induction generally relies on hand-parsed training data
to learn the structure of the language. Unfortunately, the cost of building
large annotated corpora is prohibitively expensive. This work aims to improve
the induction strategy when there are few labels in the training data. We show
that the m... | computer science |
14,359 | The syntactic processing of particles in Japanese spoken language | cs.CL | Particles fullfill several distinct central roles in the Japanese language.
They can mark arguments as well as adjuncts, can be functional or have semantic
funtions. There is, however, no straightforward matching from particles to
functions, as, e.g., GA can mark the subject, the object or an adjunct of a
sentence. Par... | computer science |
14,360 | Cascaded Markov Models | cs.CL | This paper presents a new approach to partial parsing of context-free
structures. The approach is based on Markov Models. Each layer of the resulting
structure is represented by its own Markov Model, and output of a lower layer
is passed as input to the next higher layer. An empirical evaluation of the
method yields ve... | computer science |
14,361 | Evaluation of the NLP Components of the OVIS2 Spoken Dialogue System | cs.CL | The NWO Priority Programme Language and Speech Technology is a 5-year
research programme aiming at the development of spoken language information
systems. In the Programme, two alternative natural language processing (NLP)
modules are developed in parallel: a grammar-based (conventional, rule-based)
module and a data-o... | computer science |
14,362 | Learning Transformation Rules to Find Grammatical Relations | cs.CL | Grammatical relationships are an important level of natural language
processing. We present a trainable approach to find these relationships through
transformation sequences and error-driven learning. Our approach finds
grammatical relationships between core syntax groups and bypasses much of the
parsing phase. On our ... | computer science |
14,363 | Temporal Meaning Representations in a Natural Language Front-End | cs.CL | Previous work in the context of natural language querying of temporal
databases has established a method to map automatically from a large subset of
English time-related questions to suitable expressions of a temporal logic-like
language, called TOP. An algorithm to translate from TOP to the TSQL2 temporal
database lan... | computer science |
14,364 | Mapping Multilingual Hierarchies Using Relaxation Labeling | cs.CL | This paper explores the automatic construction of a multilingual Lexical
Knowledge Base from pre-existing lexical resources. We present a new and robust
approach for linking already existing lexical/semantic hierarchies. We used a
constraint satisfaction algorithm (relaxation labeling) to select --among all
the candida... | computer science |
14,365 | Robust Grammatical Analysis for Spoken Dialogue Systems | cs.CL | We argue that grammatical analysis is a viable alternative to concept
spotting for processing spoken input in a practical spoken dialogue system. We
discuss the structure of the grammar, and a model for robust parsing which
combines linguistic sources of information and statistical sources of
information. We discuss te... | computer science |
14,366 | A Unified Example-Based and Lexicalist Approach to Machine Translation | cs.CL | We present an approach to Machine Translation that combines the ideas and
methodologies of the Example-Based and Lexicalist theoretical frameworks. The
approach has been implemented in a multilingual Machine Translation system. | computer science |
14,367 | Annotation graphs as a framework for multidimensional linguistic data
analysis | cs.CL | In recent work we have presented a formal framework for linguistic annotation
based on labeled acyclic digraphs. These `annotation graphs' offer a simple yet
powerful method for representing complex annotation structures incorporating
hierarchy and overlap. Here, we motivate and illustrate our approach using
discourse-... | computer science |
14,368 | Representing Text Chunks | cs.CL | Dividing sentences in chunks of words is a useful preprocessing step for
parsing, information extraction and information retrieval. (Ramshaw and Marcus,
1995) have introduced a "convenient" data representation for chunking by
converting it to a tagging task. In this paper we will examine seven different
data representa... | computer science |
14,369 | Cross-Language Information Retrieval for Technical Documents | cs.CL | This paper proposes a Japanese/English cross-language information retrieval
(CLIR) system targeting technical documents. Our system first translates a
given query containing technical terms into the target language, and then
retrieves documents relevant to the translated query. The translation of
technical terms is sti... | computer science |
14,370 | Explanation-based Learning for Machine Translation | cs.CL | In this paper we present an application of explanation-based learning (EBL)
in the parsing module of a real-time English-Spanish machine translation system
designed to translate closed captions. We discuss the efficiency/coverage
trade-offs available in EBL and introduce the techniques we use to increase
coverage while... | computer science |
14,371 | Language Identification With Confidence Limits | cs.CL | A statistical classification algorithm and its application to language
identification from noisy input are described. The main innovation is to
compute confidence limits on the classification, so that the algorithm
terminates when enough evidence to make a clear decision has been made, and so
avoiding problems with cat... | computer science |
14,372 | Selective Magic HPSG Parsing | cs.CL | We propose a parser for constraint-logic grammars implementing HPSG that
combines the advantages of dynamic bottom-up and advanced top-down control. The
parser allows the user to apply magic compilation to specific constraints in a
grammar which as a result can be processed dynamically in a bottom-up and
goal-directed ... | computer science |
14,373 | Corpus Annotation for Parser Evaluation | cs.CL | We describe a recently developed corpus annotation scheme for evaluating
parsers that avoids shortcomings of current methods. The scheme encodes
grammatical relations between heads and dependents, and has been used to mark
up a new public-domain corpus of naturally occurring English text. We show how
the corpus can be ... | computer science |
14,374 | A Bootstrap Approach to Automatically Generating Lexical Transfer Rules | cs.CL | We describe a method for automatically generating Lexical Transfer Rules
(LTRs) from word equivalences using transfer rule templates. Templates are
skeletal LTRs, unspecified for words. New LTRs are created by instantiating a
template with words, provided that the words belong to the appropriate lexical
categories requ... | computer science |
14,375 | Architectural Considerations for Conversational Systems -- The
Verbmobil/INTARC Experience | cs.CL | The paper describes the speech to speech translation system INTARC, developed
during the first phase of the Verbmobil project. The general design goals of
the INTARC system architecture were time synchronous processing as well as
incrementality and interactivity as a means to achieve a higher degree of
robustness and s... | computer science |
14,376 | Detecting Sub-Topic Correspondence through Bipartite Term Clustering | cs.CL | This paper addresses a novel task of detecting sub-topic correspondence in a
pair of text fragments, enhancing common notions of text similarity. This task
is addressed by coupling corresponding term subsets through bipartite
clustering. The paper presents a cost-based clustering scheme and compares it
with a bipartite... | computer science |
14,377 | Semantic robust parsing for noun extraction from natural language
queries | cs.CL | This paper describes how robust parsing techniques can be fruitful applied
for building a query generation module which is part of a pipelined NLP
architecture aimed at process natural language queries in a restricted domain.
We want to show that semantic robustness represents a key issue in those NLP
systems where it ... | computer science |
14,378 | Selective Sampling for Example-based Word Sense Disambiguation | cs.CL | This paper proposes an efficient example sampling method for example-based
word sense disambiguation systems. To construct a database of practical size, a
considerable overhead for manual sense disambiguation (overhead for
supervision) is required. In addition, the time complexity of searching a
large-sized database po... | computer science |
14,379 | Practical experiments with regular approximation of context-free
languages | cs.CL | Several methods are discussed that construct a finite automaton given a
context-free grammar, including both methods that lead to subsets and those
that lead to supersets of the original context-free language. Some of these
methods of regular approximation are new, and some others are presented here in
a more refined f... | computer science |
14,380 | Question Answering System Using Syntactic Information | cs.CL | Question answering task is now being done in TREC8 using English documents.
We examined question answering task in Japanese sentences. Our method selects
the answer by matching the question sentence with knowledge-based data written
in natural language. We use syntactic information to obtain highly accurate
answers. | computer science |
14,381 | One-Level Prosodic Morphology | cs.CL | Recent developments in theoretical linguistics have lead to a widespread
acceptance of constraint-based analyses of prosodic morphology phenomena such
as truncation, infixation, floating morphemes and reduplication. Of these,
reduplication is particularly challenging for state-of-the-art computational
morphology, since... | computer science |
14,382 | Resolution of Indirect Anaphora in Japanese Sentences Using Examples 'X
no Y (Y of X)' | cs.CL | A noun phrase can indirectly refer to an entity that has already been
mentioned. For example, ``I went into an old house last night. The roof was
leaking badly and ...'' indicates that ``the roof'' is associated with `` an
old house}'', which was mentioned in the previous sentence. This kind of
reference (indirect anap... | computer science |
14,383 | Pronoun Resolution in Japanese Sentences Using Surface Expressions and
Examples | cs.CL | In this paper, we present a method of estimating referents of demonstrative
pronouns, personal pronouns, and zero pronouns in Japanese sentences using
examples, surface expressions, topics and foci. Unlike conventional work which
was semantic markers for semantic constraints, we used examples for semantic
constraints a... | computer science |
14,384 | An Estimate of Referent of Noun Phrases in Japanese Sentences | cs.CL | In machine translation and man-machine dialogue, it is important to clarify
referents of noun phrases. We present a method for determining the referents of
noun phrases in Japanese sentences by using the referential properties,
modifiers, and possessors of noun phrases. Since the Japanese language has no
articles, it i... | computer science |
14,385 | Resolution of Verb Ellipsis in Japanese Sentence using Surface
Expressions and Examples | cs.CL | Verbs are sometimes omitted in Japanese sentences. It is necessary to recover
omitted verbs for purposes of language understanding, machine translation, and
conversational processing. This paper describes a practical way to recover
omitted verbs by using surface expressions and examples. We experimented the
resolution ... | computer science |
14,386 | An Example-Based Approach to Japanese-to-English Translation of Tense,
Aspect, and Modality | cs.CL | We have developed a new method for Japanese-to-English translation of tense,
aspect, and modality that uses an example-based method. In this method the
similarity between input and example sentences is defined as the degree of
semantic matching between the expressions at the ends of the sentences. Our
method also uses ... | computer science |
14,387 | Deduction over Mixed-Level Logic Representations for Text Passage
Retrieval | cs.CL | A system is described that uses a mixed-level representation of (part of)
meaning of natural language documents (based on standard Horn Clause Logic) and
a variable-depth search strategy that distinguishes between the different
levels of abstraction in the knowledge representation to locate specific
passages in the doc... | computer science |
14,388 | Mixed-Level Knowledge Representation and Variable-Depth Inference in
Natural Language Processing | cs.CL | A system is described that uses a mixed-level knowledge representation based
on standard Horn Clause Logic to represent (part of) the meaning of natural
language documents. A variable-depth search strategy is outlined that
distinguishes between the different levels of abstraction in the knowledge
representation to loca... | computer science |
14,389 | A Real World Implementation of Answer Extraction | cs.CL | In this paper we describe ExtrAns, an answer extraction system. Answer
extraction (AE) aims at retrieving those exact passages of a document that
directly answer a given user question. AE is more ambitious than information
retrieval and information extraction in that the retrieval results are phrases,
not entire docume... | computer science |
14,390 | Measures of Distributional Similarity | cs.CL | We study distributional similarity measures for the purpose of improving
probability estimation for unseen cooccurrences. Our contributions are
three-fold: an empirical comparison of a broad range of measures; a
classification of similarity functions based on the information that they
incorporate; and the introduction ... | computer science |
14,391 | Exploiting Syntactic Structure for Natural Language Modeling | cs.CL | The thesis presents an attempt at using the syntactic structure in natural
language for improved language models for speech recognition. The structured
language model merges techniques in automatic parsing and language modeling
using an original probabilistic parameterization of a shift-reduce parser. A
maximum likelih... | computer science |
14,392 | Refinement of a Structured Language Model | cs.CL | A new language model for speech recognition inspired by linguistic analysis
is presented. The model develops hidden hierarchical structure incrementally
and uses it to extract meaningful information from the word history - thus
enabling the use of extended distance dependencies - in an attempt to
complement the localit... | computer science |
14,393 | Recognition Performance of a Structured Language Model | cs.CL | A new language model for speech recognition inspired by linguistic analysis
is presented. The model develops hidden hierarchical structure incrementally
and uses it to extract meaningful information from the word history - thus
enabling the use of extended distance dependencies - in an attempt to
complement the localit... | computer science |
14,394 | Structured Language Modeling for Speech Recognition | cs.CL | A new language model for speech recognition is presented. The model develops
hidden hierarchical syntactic-like structure incrementally and uses it to
extract meaningful information from the word history, thus complementing the
locality of currently used trigram models. The structured language model (SLM)
and its perfo... | computer science |
14,395 | Requirements of Text Processing Lexicons | cs.CL | As text processing systems expand in scope, they will require ever larger
lexicons along with a parsing capability for discriminating among many senses
of a word. Existing systems do not incorporate such subtleties in meaning for
their lexicons. Ordinary dictionaries contain such information, but are largely
untapped. ... | computer science |
14,396 | An Usage Measure Based on Psychophysical Relations | cs.CL | A new word usage measure is proposed. It is based on psychophysical relations
and allows to reveal words by its degree of "importance" for making basic
dictionaries of sublanguages. | computer science |
14,397 | TnT - A Statistical Part-of-Speech Tagger | cs.CL | Trigrams'n'Tags (TnT) is an efficient statistical part-of-speech tagger.
Contrary to claims found elsewhere in the literature, we argue that a tagger
based on Markov models performs at least as well as other current approaches,
including the Maximum Entropy framework. A recent comparison has even shown
that TnT perform... | computer science |
14,398 | Message Classification in the Call Center | cs.CL | Customer care in technical domains is increasingly based on e-mail
communication, allowing for the reproduction of approved solutions. Identifying
the customer's problem is often time-consuming, as the problem space changes if
new products are launched. This paper describes a new approach to the
classification of e-mai... | computer science |
14,399 | A Finite State and Data-Oriented Method for Grapheme to Phoneme
Conversion | cs.CL | A finite-state method, based on leftmost longest-match replacement, is
presented for segmenting words into graphemes, and for converting graphemes
into phonemes. A small set of hand-crafted conversion rules for Dutch achieves
a phoneme accuracy of over 93%. The accuracy of the system is further improved
by using transf... | computer science |
14,400 | Variable Word Rate N-grams | cs.CL | The rate of occurrence of words is not uniform but varies from document to
document. Despite this observation, parameters for conventional n-gram language
models are usually derived using the assumption of a constant word rate. In
this paper we investigate the use of variable word rate assumption, modelled by
a Poisson... | computer science |
14,401 | Advances in domain independent linear text segmentation | cs.CL | This paper describes a method for linear text segmentation which is twice as
accurate and over seven times as fast as the state-of-the-art (Reynar, 1998).
Inter-sentence similarity is replaced by rank in the local context. Boundary
locations are discovered by divisive clustering. | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.