id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/0103007 | Two-parameter Model of Word Length "Language - Genre" | cs.CL | A two-parameter model of word length measured by the number of syllables
comprising it is proposed. The first parameter is dependent on language type,
the second one - on text genre and reflects the degree of completion of
synergetic processes of language optimization.
|
cs/0103010 | Magical Number Seven Plus or Minus Two: Syntactic Structure Recognition
in Japanese and English Sentences | cs.CL | George A. Miller said that human beings have only seven chunks in short-term
memory, plus or minus two. We counted the number of bunsetsus (phrases) whose
modifiees are undetermined in each step of an analysis of the dependency
structure of Japanese sentences, and which therefore must be stored in
short-term memory. ... |
cs/0103011 | A Machine-Learning Approach to Estimating the Referential Properties of
Japanese Noun Phrases | cs.CL | The referential properties of noun phrases in the Japanese language, which
has no articles, are useful for article generation in Japanese-English machine
translation and for anaphora resolution in Japanese noun phrases. They are
generally classified as generic noun phrases, definite noun phrases, and
indefinite noun ... |
cs/0103012 | Meaning Sort - Three examples: dictionary construction, tagged corpus
construction, and information presentation system | cs.CL | It is often useful to sort words into an order that reflects relations among
their meanings as obtained by using a thesaurus. In this paper, we introduce a
method of arranging words semantically by using several types of `{\sf is-a}'
thesauri and a multi-dimensional thesaurus. We also describe three major
application... |
cs/0103013 | CRL at Ntcir2 | cs.CL | We have developed systems of two types for NTCIR2. One is an enhenced version
of the system we developed for NTCIR1 and IREX. It submitted retrieval results
for JJ and CC tasks. A variety of parameters were tried with the system. It
used such characteristics of newspapers as locational information in the CC
tasks. Th... |
cs/0103015 | Fitness Uniform Selection to Preserve Genetic Diversity | cs.AI cs.DC cs.LG q-bio | In evolutionary algorithms, the fitness of a population increases with time
by mutating and recombining individuals and by a biased selection of more fit
individuals. The right selection pressure is critical in ensuring sufficient
optimization progress on the one hand and in preserving genetic diversity to be
able to... |
cs/0103020 | Belief Revision: A Critique | cs.AI cs.LO | We examine carefully the rationale underlying the approaches to belief change
taken in the literature, and highlight what we view as methodological problems.
We argue that to study belief change carefully, we must be quite explicit about
the ``ontology'' or scenario underlying the belief change process. This is
somet... |
cs/0103022 | Secure, Efficient Data Transport and Replica Management for
High-Performance Data-Intensive Computing | cs.DC cs.DB | An emerging class of data-intensive applications involve the geographically
dispersed extraction of complex scientific information from very large
collections of measured or computed data. Such applications arise, for example,
in experimental physics, where the data in question is generated by
accelerators, and in si... |
cs/0103026 | A Decision Tree of Bigrams is an Accurate Predictor of Word Sense | cs.CL | This paper presents a corpus-based approach to word sense disambiguation
where a decision tree assigns a sense to an ambiguous word based on the bigrams
that occur nearby. This approach is evaluated using the sense-tagged corpora
from the 1998 SENSEVAL word sense disambiguation exercise. It is more accurate
than the ... |
cs/0104005 | Bootstrapping Structure using Similarity | cs.LG cs.CL | In this paper a new similarity-based learning algorithm, inspired by string
edit-distance (Wagner and Fischer, 1974), is applied to the problem of
bootstrapping structure from scratch. The algorithm takes a corpus of
unannotated sentences as input and returns a corpus of bracketed sentences. The
method works on pairs... |
cs/0104006 | ABL: Alignment-Based Learning | cs.LG cs.CL | This paper introduces a new type of grammar learning algorithm, inspired by
string edit distance (Wagner and Fischer, 1974). The algorithm takes a corpus
of flat sentences as input and returns a corpus of labelled, bracketed
sentences. The method works on pairs of unstructured sentences that have one or
more words in... |
cs/0104007 | Bootstrapping Syntax and Recursion using Alignment-Based Learning | cs.LG cs.CL | This paper introduces a new type of unsupervised learning algorithm, based on
the alignment of sentences and Harris's (1951) notion of interchangeability.
The algorithm is applied to an untagged, unstructured corpus of natural
language sentences, resulting in a labelled, bracketed version of the corpus.
Firstly, the ... |
cs/0104008 | Event Indexing Systems for Efficient Selection and Analysis of HERA Data | cs.DB cs.IR | The design and implementation of two software systems introduced to improve
the efficiency of offline analysis of event data taken with the ZEUS Detector
at the HERA electron-proton collider at DESY are presented. Two different
approaches were made, one using a set of event directories and the other using
a tag datab... |
cs/0104009 | Evaluating Recommendation Algorithms by Graph Analysis | cs.IR cs.DM cs.DS | We present a novel framework for evaluating recommendation algorithms in
terms of the `jumps' that they make to connect people to artifacts. This
approach emphasizes reachability via an algorithm within the implicit graph
structure underlying a recommender dataset, and serves as a complement to
evaluation in terms of... |
cs/0104010 | Type Arithmetics: Computation based on the theory of types | cs.CL | The present paper shows meta-programming turn programming, which is rich
enough to express arbitrary arithmetic computations. We demonstrate a type
system that implements Peano arithmetics, slightly generalized to negative
numbers. Certain types in this system denote numerals. Arithmetic operations on
such types-nume... |
cs/0104011 | Potholes on the Royal Road | cs.NE nlin.AO | It is still unclear how an evolutionary algorithm (EA) searches a fitness
landscape, and on what fitness landscapes a particular EA will do well. The
validity of the building-block hypothesis, a major tenet of traditional genetic
algorithm theory, remains controversial despite its continued use to justify
claims abou... |
cs/0104013 | Shooting Over or Under the Mark: Towards a Reliable and Flexible
Anticipation in the Economy | cs.CE | The real monetary economy is grounded upon monetary flow equilibration or the
activity of actualizing monetary flow continuity at each economic agent except
for the central bank. Every update of monetary flow continuity at each agent
constantly causes monetary flow equilibration at the neighborhood agents. Every
mone... |
cs/0104014 | Tracing a Faint Fingerprint of the Invisible Hand? | cs.CE | Any economic agent constituting the monetary economy maintains the activity
of monetary flow equilibration for fulfilling the condition of monetary flow
continuity in the record, except at the central bank. At the same time,
monetary flow equilibration at one economic agent constantly induces at other
agents in the e... |
cs/0104017 | Local Search Techniques for Constrained Portfolio Selection Problems | cs.CE cs.AI | We consider the problem of selecting a portfolio of assets that provides the
investor a suitable balance of expected return and risk. With respect to the
seminal mean-variance model of Markowitz, we consider additional constraints on
the cardinality of the portfolio and on the quantity of individual shares. Such
cons... |
cs/0104018 | Several new domain-type and boundary-type numerical discretization
schemes with radial basis function | cs.NA cs.CE | This paper is concerned with a few novel RBF-based numerical schemes
discretizing partial differential equations. For boundary-type methods, we
derive the indirect and direct symmetric boundary knot methods (BKM). The
resulting interpolation matrix of both is always symmetric irrespective of
boundary geometry and con... |
cs/0104019 | Dynamic Nonlocal Language Modeling via Hierarchical Topic-Based
Adaptation | cs.CL | This paper presents a novel method of generating and applying hierarchical,
dynamic topic-based language models. It proposes and evaluates new cluster
generation, hierarchical smoothing and adaptive topic-probability estimation
techniques. These combined models help capture long-distance lexical
dependencies. Experim... |
cs/0104020 | Coaxing Confidences from an Old Friend: Probabilistic Classifications
from Transformation Rule Lists | cs.CL cs.AI | Transformation-based learning has been successfully employed to solve many
natural language processing problems. It has many positive features, but one
drawback is that it does not provide estimates of class membership
probabilities.
In this paper, we present a novel method for obtaining class membership
probabilit... |
cs/0104022 | Microplanning with Communicative Intentions: The SPUD System | cs.CL | The process of microplanning encompasses a range of problems in Natural
Language Generation (NLG), such as referring expression generation, lexical
choice, and aggregation, problems in which a generator must bridge underlying
domain-specific representations and general linguistic representations. In this
paper, we de... |
cs/0105001 | Correction of Errors in a Modality Corpus Used for Machine Translation
by Using Machine-learning Method | cs.CL | We performed corpus correction on a modality corpus for machine translation
by using such machine-learning methods as the maximum-entropy method. We thus
constructed a high-quality modality corpus based on corpus correction. We
compared several kinds of methods for corpus correction in our experiments and
developed a... |
cs/0105002 | Man [and Woman] vs. Machine: A Case Study in Base Noun Phrase Learning | cs.CL | A great deal of work has been done demonstrating the ability of machine
learning algorithms to automatically extract linguistic knowledge from
annotated corpora. Very little work has gone into quantifying the difference in
ability at this task between a person and a machine. This paper is a first step
in that directi... |
cs/0105003 | Rule Writing or Annotation: Cost-efficient Resource Usage for Base Noun
Phrase Chunking | cs.CL cs.AI | This paper presents a comprehensive empirical comparison between two
approaches for developing a base noun phrase chunker: human rule writing and
active learning using interactive real-time human annotation. Several novel
variations on active learning are investigated, and underlying cost models for
cross-modal machi... |
cs/0105004 | Parallel implementation of the TRANSIMS micro-simulation | cs.CE | This paper describes the parallel implementation of the TRANSIMS traffic
micro-simulation. The parallelization method is domain decomposition, which
means that each CPU of the parallel computer is responsible for a different
geographical area of the simulated region. We describe how information between
domains is exc... |
cs/0105005 | A Complete WordNet1.5 to WordNet1.6 Mapping | cs.CL | We describe a robust approach for linking already existing lexical/semantic
hierarchies. We use a constraint satisfaction algorithm (relaxation labelling)
to select --among a set of candidates-- the node in a target taxonomy that
bests matches each node in a source taxonomy. In this paper we present the
complete mapp... |
cs/0105012 | Joint and conditional estimation of tagging and parsing models | cs.CL | This paper compares two different ways of estimating statistical language
models. Many statistical NLP tagging and parsing models are estimated by
maximizing the (joint) likelihood of the fully-observed training data. However,
since these applications only require the conditional probability
distributions, these dist... |
cs/0105014 | Errata and supplements to: Orthonormal RBF Wavelet and Ridgelet-like
Series and Transforms for High-Dimensional Problems | cs.NA cs.CE | In recent years some attempts have been done to relate the RBF with wavelets
in handling high dimensional multiscale problems. To the author's knowledge,
however, the orthonormal and bi-orthogonal RBF wavelets are still missing in
the literature. By using the nonsingular general solution and singular
fundamental solu... |
cs/0105015 | The alldifferent Constraint: A Survey | cs.PL cs.AI | The constraint of difference is known to the constraint programming community
since Lauriere introduced Alice in 1978. Since then, several solving strategies
have been designed for this constraint. In this paper we give both a practical
overview and an abstract comparison of these different strategies.
|
cs/0105016 | Probabilistic top-down parsing and language modeling | cs.CL | This paper describes the functioning of a broad-coverage probabilistic
top-down parser, and its application to the problem of language modeling for
speech recognition. The paper first introduces key notions in language modeling
and probabilistic parsing, and briefly reviews some previous approaches to
using syntactic... |
cs/0105017 | Optimization Over Zonotopes and Training Support Vector Machines | cs.CG cs.AI | We make a connection between classical polytopes called zonotopes and Support
Vector Machine (SVM) classifiers. We combine this connection with the ellipsoid
method to give some new theoretical results on training SVMs. We also describe
some special properties of soft margin C-SVMs as parameter C goes to infinity.
|
cs/0105019 | Robust Probabilistic Predictive Syntactic Processing | cs.CL | This thesis presents a broad-coverage probabilistic top-down parser, and its
application to the problem of language modeling for speech recognition. The
parser builds fully connected derivations incrementally, in a single pass from
left-to-right across the string. We argue that the parsing approach that we
have adopt... |
cs/0105021 | Solving Composed First-Order Constraints from Discrete-Time Robust
Control | cs.LO cs.AI cs.CE | This paper deals with a problem from discrete-time robust control which
requires the solution of constraints over the reals that contain both universal
and existential quantifiers. For solving this problem we formulate it as a
program in a (fictitious) constraint logic programming language with explicit
quantifier no... |
cs/0105022 | Multi-Channel Parallel Adaptation Theory for Rule Discovery | cs.AI | In this paper, we introduce a new machine learning theory based on
multi-channel parallel adaptation for rule discovery. This theory is
distinguished from the familiar parallel-distributed adaptation theory of
neural networks in terms of channel-based convergence to the target rules. We
show how to realize this theor... |
cs/0105023 | Generating a 3D Simulation of a Car Accident from a Written Description
in Natural Language: the CarSim System | cs.CL | This paper describes a prototype system to visualize and animate 3D scenes
from car accident reports, written in French. The problem of generating such a
3D simulation can be divided into two subtasks: the linguistic analysis and the
virtual scene generation. As a means of communication between these two
modules, we ... |
cs/0105025 | Market-Based Reinforcement Learning in Partially Observable Worlds | cs.AI cs.LG cs.MA cs.NE | Unlike traditional reinforcement learning (RL), market-based RL is in
principle applicable to worlds described by partially observable Markov
Decision Processes (POMDPs), where an agent needs to learn short-term memories
of relevant previous events in order to execute optimal actions. Most previous
work, however, has... |
cs/0105026 | Toward Natural Gesture/Speech Control of a Large Display | cs.CV cs.HC | In recent years because of the advances in computer vision research, free
hand gestures have been explored as means of human-computer interaction (HCI).
Together with improved speech processing technology it is an important step
toward natural multimodal HCI. However, inclusion of non-predefined continuous
gestures i... |
cs/0105027 | Bounds on sample size for policy evaluation in Markov environments | cs.LG cs.AI cs.CC | Reinforcement learning means finding the optimal course of action in
Markovian environments without knowledge of the environment's dynamics.
Stochastic optimization algorithms used in the field rely on estimates of the
value of a policy. Typically, the value of a policy is estimated from results
of simulating that ve... |
cs/0105030 | The OLAC Metadata Set and Controlled Vocabularies | cs.CL cs.DL | As language data and associated technologies proliferate and as the language
resources community rapidly expands, it has become difficult to locate and
reuse existing resources. Are there any lexical resources for such-and-such a
language? What tool can work with transcripts in this particular format? What
is a good ... |
cs/0105032 | Learning to Cooperate via Policy Search | cs.LG cs.MA | Cooperative games are those in which both agents share the same payoff
structure. Value-based reinforcement-learning algorithms, such as variants of
Q-learning, have been applied to learning cooperative games, but they only
apply when the game state is completely observable to both agents. Policy
search methods are a... |
cs/0105035 | Historical Dynamics of Lexical System as Random Walk Process | cs.CL | It is offered to consider word meanings changes in diachrony as
semicontinuous random walk with reflecting and swallowing screens. The basic
characteristics of word life cycle are defined. Verification of the model has
been realized on the data of Russian words distribution on various age periods.
|
cs/0105036 | Disjunctive Logic Programs with Inheritance | cs.LO cs.AI | The paper proposes a new knowledge representation language, called DLP<,
which extends disjunctive logic programming (with strong negation) by
inheritance. The addition of inheritance enhances the knowledge modeling
features of the language providing a natural representation of default
reasoning with exceptions.
A ... |
cs/0105037 | Integrating Prosodic and Lexical Cues for Automatic Topic Segmentation | cs.CL | We present a probabilistic model that uses both prosodic and lexical cues for
the automatic segmentation of speech into topically coherent units. We propose
two methods for combining lexical and prosodic information using hidden Markov
models and decision trees. Lexical information is obtained from a speech
recognize... |
cs/0106003 | A note on radial basis function computing | cs.CE cs.CG | This note carries three purposes involving our latest advances on the radial
basis function (RBF) approach. First, we will introduce a new scheme employing
the boundary knot method (BKM) to nonlinear convection-diffusion problem. It is
stressed that the new scheme directly results in a linear BKM formulation of
nonli... |
cs/0106004 | Soft Scheduling | cs.AI cs.PL | Classical notions of disjunctive and cumulative scheduling are studied from
the point of view of soft constraint satisfaction. Soft disjunctive scheduling
is introduced as an instance of soft CSP and preferences included in this
problem are applied to generate a lower bound based on existing discrete
capacity resourc... |
cs/0106005 | The Representation of Legal Contracts | cs.AI cs.CY | The paper outlines ongoing research on logic-based tools for the analysis and
representation of legal contracts of the kind frequently encountered in
large-scale engineering projects and complex, long-term trading agreements. We
consider both contract formation and contract performance, in each case
identifying the r... |
cs/0106006 | A Constraint-Driven System for Contract Assembly | cs.AI | We present an approach for modelling the structure and coarse content of
legal documents with a view to providing automated support for the drafting of
contracts and contract database retrieval. The approach is designed to be
applicable where contract drafting is based on model-form contracts or on
existing examples ... |
cs/0106007 | Modelling Contractual Arguments | cs.AI | One influential approach to assessing the "goodness" of arguments is offered
by the Pragma-Dialectical school (p-d) (Eemeren & Grootendorst 1992). This can
be compared with Rhetorical Structure Theory (RST) (Mann & Thompson 1988), an
approach that originates in discourse analysis. In p-d terms an argument is
good if ... |
cs/0106008 | Computing Functional and Relational Box Consistency by Structured
Propagation in Atomic Constraint Systems | cs.PL cs.AI | Box consistency has been observed to yield exponentially better performance
than chaotic constraint propagation in the interval constraint system obtained
by decomposing the original expression into primitive constraints. The claim
was made that the improvement is due to avoiding decomposition. In this paper
we argue... |
cs/0106010 | Modelling Legal Contracts as Processes | cs.AI cs.LO | This paper concentrates on the representation of the legal relations that
obtain between parties once they have entered a contractual agreement and their
evolution as the agreement progresses through time. Contracts are regarded as
process and they are analysed in terms of the obligations that are active at
various p... |
cs/0106011 | Computational properties of environment-based disambiguation | cs.CL cs.HC | The standard pipeline approach to semantic processing, in which sentences are
morphologically and syntactically resolved to a single tree before they are
interpreted, is a poor fit for applications such as natural language
interfaces. This is because the environment information, in the form of the
objects and events ... |
cs/0106012 | Computational Properties of Metaquerying Problems | cs.DB cs.CC | Metaquerying is a datamining technology by which hidden dependencies among
several database relations can be discovered. This tool has already been
successfully applied to several real-world applications. Recent papers provide
only preliminary results about the complexity of metaquerying. In this paper we
define seve... |
cs/0106014 | L.T.Kuzin: Research Program | cs.DM cs.AI cs.SE | Lev T. Kuzin (1928--1997) is one of the founders of modern cybernetics and
information science in Russia. He was awarded and honored the USSR State Prize
for inspiring vision into the future of technical cybernetics and his invention
and innovation of key technologies.
The last years he interested in the computatio... |
cs/0106015 | Organizing Encyclopedic Knowledge based on the Web and its Application
to Question Answering | cs.CL | We propose a method to generate large-scale encyclopedic knowledge, which is
valuable for much NLP research, based on the Web. We first search the Web for
pages containing a term in question. Then we use linguistic patterns and HTML
structures to extract text fragments describing the term. Finally, we organize
extrac... |
cs/0106016 | File mapping Rule-based DBMS and Natural Language Processing | cs.CL cs.AI cs.DB cs.IR cs.LG cs.PL | This paper describes the system of storage, extract and processing of
information structured similarly to the natural language. For recursive
inference the system uses the rules having the same representation, as the
data. The environment of storage of information is provided with the File
Mapping (SHM) mechanism of ... |
cs/0106021 | Object-oriented solutions | cs.LO cs.DB cs.PL | In this paper are briefly outlined the motivations, mathematical ideas in
use, pre-formalization and assumptions, object-as-functor construction, `soft'
types and concept constructions, case study for concepts based on variable
domains, extracting a computational background, and examples of evaluations.
|
cs/0106023 | Object-oriented tools for advanced applications | cs.LO cs.DB cs.PL | This paper contains a brief discussion of the Application Development
Environment (ADE) that is used to build database applications involving the
graphical user interface (GUI). ADE computing separates the database access and
the user interface. The variety of applications may be generated that
communicate with diffe... |
cs/0106024 | Objects and their computational framework | cs.LO cs.DB cs.PL | Most of the object notions are embedded into a logical domain, especially
when dealing with a database theory. Thus, their properties within a
computational domain are not yet studied properly. The main topic of this paper
is to analyze different concepts of the distinct computational primitive frames
to extract the ... |
cs/0106025 | Information Integration and Computational Logic | cs.AI | Information Integration is a young and exciting field with enormous research
and commercial significance in the new world of the Information Society. It
stands at the crossroad of Databases and Artificial Intelligence requiring
novel techniques that bring together different methods from these fields.
Information from... |
cs/0106026 | Event Driven Computations for Relational Query Language | cs.LO cs.DB cs.PL | This paper deals with an extended model of computations which uses the
parameterized families of entities for data objects and reflects a preliminary
outline of this problem. Some topics are selected out, briefly analyzed and
arranged to cover a general problem. The authors intended more to discuss the
particular top... |
cs/0106027 | Event Driven Objects | cs.LO cs.DB cs.SE | A formal consideration in this paper is given for the essential notations to
characterize the object that is distinguished in a problem domain. The distinct
object is represented by another idealized object, which is a schematic
element. When the existence of an element is significant, then a class of these
partial e... |
cs/0106028 | Pricing Virtual Paths with Quality-of-Service Guarantees as Bundle
Derivatives | cs.NI cs.CE | We describe a model of a communication network that allows us to price
complex network services as financial derivative contracts based on the spot
price of the capacity in individual routers. We prove a theorem of a Girsanov
transform that is useful for pricing linear derivatives on underlying assets,
which can be u... |
cs/0106029 | Building Views with Description Logics in ADE: Application Development
Environment | cs.LO cs.DB cs.DS | Any of views is formally defined within description logics that were
established as a family of logics for modeling complex hereditary structures
and have a suitable expressive power. This paper considers the Application
Development Environment (ADE) over generalized variable concepts that are used
to build database ... |
cs/0106030 | Logic, Individuals and Concepts | cs.LO cs.DB cs.DM cs.SE | This extended abstract gives a brief outline of the connections between the
descriptions and variable concepts. Thus, the notion of a concept is extended
to include both the syntax and semantics features. The evaluation map in use is
parameterized by a kind of computational environment, the index, giving rise to
inde... |
cs/0106031 | Complexity Results and Practical Algorithms for Logics in Knowledge
Representation | cs.LO cs.AI | Description Logics (DLs) are used in knowledge-based systems to represent and
reason about terminological knowledge of the application domain in a
semantically well-defined manner. In this thesis, we establish a number of
novel complexity results and give practical algorithms for expressive DLs that
provide different... |
cs/0106033 | location.location.location: Internet Addresses as Evolving Property | cs.CY cs.HC cs.IR | I describe recent developments in the rules governing registration and
ownership of Internet and World Wide Web addresses or "domain names." I
consider the idea that "virtual" properties like domain names are more similar
to real estate than to trademarks. Therefore, it would be economically
efficient to grant domain... |
cs/0106034 | Solving equations in the relational algebra | cs.LO cs.DB | Enumerating all solutions of a relational algebra equation is a natural and
powerful operation which, when added as a query language primitive to the
nested relational algebra, yields a query language for nested relational
databases, equivalent to the well-known powerset algebra. We study
\emph{sparse} equations, whi... |
cs/0106035 | Polymorphic type inference for the relational algebra | cs.LO cs.DB | We give a polymorphic account of the relational algebra. We introduce a
formalism of ``type formulas'' specifically tuned for relational algebra
expressions, and present an algorithm that computes the ``principal'' type for
a given expression. The principal type of an expression is a formula that
specifies, in a clea... |
cs/0106036 | Convergence and Error Bounds for Universal Prediction of Nonbinary
Sequences | cs.LG cs.AI cs.CC math.PR | Solomonoff's uncomputable universal prediction scheme $\xi$ allows to predict
the next symbol $x_k$ of a sequence $x_1...x_{k-1}$ for any Turing computable,
but otherwise unknown, probabilistic environment $\mu$. This scheme will be
generalized to arbitrary environmental classes, which, among others, allows the
const... |
cs/0106039 | Iterative Residual Rescaling: An Analysis and Generalization of LSI | cs.CL cs.IR | We consider the problem of creating document representations in which
inter-document similarity measurements correspond to semantic similarity. We
first present a novel subspace-based framework for formalizing this task. Using
this framework, we derive a new analysis of Latent Semantic Indexing (LSI),
showing a preci... |
cs/0106040 | Stacking classifiers for anti-spam filtering of e-mail | cs.CL cs.AI | We evaluate empirically a scheme for combining classifiers, known as stacked
generalization, in the context of anti-spam filtering, a novel cost-sensitive
application of text categorization. Unsolicited commercial e-mail, or "spam",
floods mailboxes, causing frustration, wasting bandwidth, and exposing minors
to unsu... |
cs/0106043 | Using the Distribution of Performance for Studying Statistical NLP
Systems and Corpora | cs.CL | Statistical NLP systems are frequently evaluated and compared on the basis of
their performances on a single split of training and test data. Results
obtained using a single split are, however, subject to sampling noise. In this
paper we argue in favour of reporting a distribution of performance figures,
obtained by ... |
cs/0106044 | A Sequential Model for Multi-Class Classification | cs.AI cs.CL cs.LG | Many classification problems require decisions among a large number of
competing classes. These tasks, however, are not handled well by general
purpose learning methods and are usually addressed in an ad-hoc fashion. We
suggest a general approach -- a sequential learning model that utilizes
classifiers to sequentiall... |
cs/0106046 | Expressing the cone radius in the relational calculus with real
polynomial constraints | cs.DB cs.LO | We show that there is a query expressible in first-order logic over the reals
that returns, on any given semi-algebraic set A, for every point a radius
around which A is conical. We obtain this result by combining famous results
from calculus and real algebraic geometry, notably Sard's theorem and Thom's
first isotop... |
cs/0106047 | Modeling informational novelty in a conversational system with a hybrid
statistical and grammar-based approach to natural language generation | cs.CL | We present a hybrid statistical and grammar-based system for surface natural
language generation (NLG) that uses grammar rules, conditions on using those
grammar rules, and corpus statistics to determine the word order. We also
describe how this surface NLG module is implemented in a prototype
conversational system, ... |
cs/0106054 | Software Toolkit for Building Embedded and Distributed Knowledge-based
Systems | cs.AI cs.DC cs.MA | The paper discusses the basic principles and the architecture of the software
toolkit for constructing knowledge-based systems which can be used
cooperatively over computer networks and also embedded into larger software
systems in different ways. Presented architecture is based on frame knowledge
representation and ... |
cs/0106055 | A Seamless Integration of Association Rule Mining with Database Systems | cs.DB | The need for Knowledge and Data Discovery Management Systems (KDDMS) that
support ad hoc data mining queries has been long recognized. A significant
amount of research has gone into building tightly coupled systems that
integrate association rule mining with database systems. In this paper, we
describe a seamless int... |
cs/0106059 | CHR as grammar formalism. A first report | cs.PL cs.CL | Grammars written as Constraint Handling Rules (CHR) can be executed as
efficient and robust bottom-up parsers that provide a straightforward,
non-backtracking treatment of ambiguity. Abduction with integrity constraints
as well as other dynamic hypothesis generation techniques fit naturally into
such grammars and are... |
cs/0107002 | Enhancing Constraint Propagation with Composition Operators | cs.AI | Constraint propagation is a general algorithmic approach for pruning the
search space of a CSP. In a uniform way, K. R. Apt has defined a computation as
an iteration of reduction functions over a domain. He has also demonstrated the
need for integrating static properties of reduction functions (commutativity
and semi... |
cs/0107005 | The Role of Conceptual Relations in Word Sense Disambiguation | cs.CL | We explore many ways of using conceptual distance measures in Word Sense
Disambiguation, starting with the Agirre-Rigau conceptual density measure. We
use a generalized form of this measure, introducing many (parameterized)
refinements and performing an exhaustive evaluation of all meaningful
combinations. We finally... |
cs/0107006 | Looking Under the Hood : Tools for Diagnosing your Question Answering
Engine | cs.CL | In this paper we analyze two question answering tasks : the TREC-8 question
answering task and a set of reading comprehension exams. First, we show that
Q/A systems perform better when there are multiple answer opportunities per
question. Next, we analyze common approaches to two subproblems: term overlap
for answer ... |
cs/0107007 | The Risk Profile Problem for Stock Portfolio Optimization | cs.CE cs.DM cs.DS | This work initiates research into the problem of determining an optimal
investment strategy for investors with different attitudes towards the
trade-offs of risk and profit. The probability distribution of the return
values of the stocks that are considered by the investor are assumed to be
known, while the joint dis... |
cs/0107012 | Three-Stage Quantitative Neural Network Model of the Tip-of-the-Tongue
Phenomenon | cs.CL cs.AI q-bio.NC q-bio.QM | A new three-stage computer artificial neural network model of the
tip-of-the-tongue phenomenon is shortly described, and its stochastic nature
was demonstrated. A way to calculate strength and appearance probability of
tip-of-the-tongue states, neural network mechanism of feeling-of-knowing
phenomenon are proposed. T... |
cs/0107013 | The Logic Programming Paradigm and Prolog | cs.PL cs.AI | This is a tutorial on logic programming and Prolog appropriate for a course
on programming languages for students familiar with imperative programming.
|
cs/0107014 | Transformations of CCP programs | cs.PL cs.AI cs.LO | We introduce a transformation system for concurrent constraint programming
(CCP). We define suitable applicability conditions for the transformations
which guarantee that the input/output CCP semantics is preserved also when
distinguishing deadlocked computations from successful ones and when
considering intermediate... |
cs/0107016 | Introduction to the CoNLL-2001 Shared Task: Clause Identification | cs.CL | We describe the CoNLL-2001 shared task: dividing text into clauses. We give
background information on the data sets, present a general overview of the
systems that have taken part in the shared task and briefly discuss their
performance.
|
cs/0107017 | Learning Computational Grammars | cs.CL | This paper reports on the "Learning Computational Grammars" (LCG) project, a
postdoc network devoted to studying the application of machine learning
techniques to grammars suitable for computational use. We were interested in a
more systematic survey to understand the relevance of many factors to the
success of learn... |
cs/0107018 | Combining a self-organising map with memory-based learning | cs.CL | Memory-based learning (MBL) has enjoyed considerable success in corpus-based
natural language processing (NLP) tasks and is thus a reliable method of
getting a high-level of performance when building corpus-based NLP systems.
However there is a bottleneck in MBL whereby any novel testing item has to be
compared again... |
cs/0107019 | Applying Natural Language Generation to Indicative Summarization | cs.CL | The task of creating indicative summaries that help a searcher decide whether
to read a particular document is a difficult task. This paper examines the
indicative summarization task from a generation perspective, by first analyzing
its required content via published guidelines and corpus analysis. We show how
these ... |
cs/0107020 | Transformation-Based Learning in the Fast Lane | cs.CL | Transformation-based learning has been successfully employed to solve many
natural language processing problems. It achieves state-of-the-art performance
on many natural language processing tasks and does not overtrain easily.
However, it does have a serious drawback: the training time is often
intorelably long, espe... |
cs/0107021 | Multidimensional Transformation-Based Learning | cs.CL | This paper presents a novel method that allows a machine learning algorithm
following the transformation-based learning paradigm \cite{brill95:tagging} to
be applied to multiple classification tasks by training jointly and
simultaneously on all fields. The motivation for constructing such a system
stems from the obse... |
cs/0107026 | Annotated revision programs | cs.AI cs.LO | Revision programming is a formalism to describe and enforce updates of belief
sets and databases. That formalism was extended by Fitting who assigned
annotations to revision atoms. Annotations provide a way to quantify the
confidence (probability) that a revision atom holds. The main goal of our paper
is to reexamine... |
cs/0107027 | Fixed-parameter complexity of semantics for logic programs | cs.LO cs.AI | A decision problem is called parameterized if its input is a pair of strings.
One of these strings is referred to as a parameter. The problem: given a
propositional logic program P and a non-negative integer k, decide whether P
has a stable model of size no more than k, is an example of a parameterized
decision probl... |
cs/0107028 | Propositional satisfiability in answer-set programming | cs.AI cs.LO | We show that propositional logic and its extensions can support answer-set
programming in the same way stable logic programming and disjunctive logic
programming do. To this end, we introduce a logic based on the logic of
propositional schemata and on a version of the Closed World Assumption. We call
it the extended ... |
cs/0107029 | aspps --- an implementation of answer-set programming with propositional
schemata | cs.AI cs.LO | We present an implementation of an answer-set programming paradigm, called
aspps (short for answer-set programming with propositional schemata). The
system aspps is designed to process PS+ theories. It consists of two basic
modules. The first module, psgrnd, grounds an PS+ theory. The second module,
referred to as as... |
cs/0107032 | Coupled Clustering: a Method for Detecting Structural Correspondence | cs.LG cs.CL cs.IR | This paper proposes a new paradigm and computational framework for
identification of correspondences between sub-structures of distinct composite
systems. For this, we define and investigate a variant of traditional data
clustering, termed coupled clustering, which simultaneously identifies
corresponding clusters wit... |
cs/0107033 | Yet another zeta function and learning | cs.LG cs.DM math.PR | We study the convergence speed of the batch learning algorithm, and compare
its speed to that of the memoryless learning algorithm and of learning with
memory (as analyzed in joint work with N. Komarova). We obtain precise results
and show in particular that the batch learning algorithm is never worse than
the memory... |
cs/0108003 | The Partial Evaluation Approach to Information Personalization | cs.IR cs.PL | Information personalization refers to the automatic adjustment of information
content, structure, and presentation tailored to an individual user. By
reducing information overload and customizing information access,
personalization systems have emerged as an important segment of the Internet
economy. This paper prese... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.