id stringlengths 9 16 | title stringlengths 4 278 | categories stringlengths 5 104 | abstract stringlengths 6 4.09k |
|---|---|---|---|
cs/9905001 | 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... |
cs/9905003 | Collective Choice Theory in Collaborative Computing | cs.MA cs.DC | This paper presents some fundamental collective choice theory for information
system designers, particularly those working in the field of computer-supported
cooperative work. This paper is focused on a presentation of Arrow's
Possibility and Impossibility theorems which form the fundamental boundary on
the efficacy ... |
cs/9905004 | Using Collective Intelligence to Route Internet Traffic | cs.LG adap-org cond-mat.stat-mech cs.DC cs.NI nlin.AO | A COllective INtelligence (COIN) is a set of interacting reinforcement
learning (RL) algorithms designed in an automated fashion so that their
collective behavior optimizes a global utility function. We summarize the
theory of COINs, then present experiments using that theory to design COINs to
control internet traff... |
cs/9905005 | General Principles of Learning-Based Multi-Agent Systems | cs.MA adap-org cond-mat.stat-mech cs.DC cs.LG nlin.AO | We consider the problem of how to design large decentralized multi-agent
systems (MAS's) in an automated fashion, with little or no hand-tuning. Our
approach has each agent run a reinforcement learning algorithm. This converts
the problem into one of how to automatically set/update the reward functions
for each of th... |
cs/9905007 | An Efficient, Probabilistically Sound Algorithm for Segmentation and
Word Discovery | cs.CL cs.LG | This paper presents a model-based, unsupervised algorithm for recovering word
boundaries in a natural-language text from which they have been deleted. The
algorithm is derived from a probability model of the source that generated the
text. The fundamental structure of the model is specified abstractly so that
the det... |
cs/9905008 | Inducing a Semantically Annotated Lexicon via EM-Based Clustering | cs.CL cs.AI cs.LG | We present a technique for automatic induction of slot annotations for
subcategorization frames, based on induction of hidden classes in the EM
framework of statistical estimation. The models are empirically evalutated by a
general decision test. Induction of slot labeling for subcategorization frames
is accomplished... |
cs/9905009 | Inside-Outside Estimation of a Lexicalized PCFG for German | cs.CL cs.LG | The paper describes an extensive experiment in inside-outside estimation of a
lexicalized probabilistic context free grammar for German verb-final clauses.
Grammar and formalism features which make the experiment feasible are
described. Successive models are evaluated on precision and recall of phrase
markup.
|
cs/9905010 | Statistical Inference and Probabilistic Modelling for Constraint-Based
NLP | cs.CL cs.LG | We present a probabilistic model for constraint-based grammars and a method
for estimating the parameters of such models from incomplete, i.e., unparsed
data. Whereas methods exist to estimate the parameters of probabilistic
context-free grammars from incomplete data (Baum 1970), so far for
probabilistic grammars inv... |
cs/9905011 | Ensembles of Radial Basis Function Networks for Spectroscopic Detection
of Cervical Pre-Cancer | cs.NE cs.LG q-bio | The mortality related to cervical cancer can be substantially reduced through
early detection and treatment. However, current detection techniques, such as
Pap smear and colposcopy, fail to achieve a concurrently high sensitivity and
specificity.
In vivo fluorescence spectroscopy is a technique which quickly,
non-i... |
cs/9905012 | Linear and Order Statistics Combiners for Pattern Classification | cs.NE cs.LG | Several researchers have experimentally shown that substantial improvements
can be obtained in difficult pattern recognition problems by combining or
integrating the outputs of multiple classifiers. This chapter provides an
analytical framework to quantify the improvements in classification results due
to combining. ... |
cs/9905013 | Robust Combining of Disparate Classifiers through Order Statistics | cs.LG cs.CV cs.NE | Integrating the outputs of multiple classifiers via combiners or
meta-learners has led to substantial improvements in several difficult pattern
recognition problems. In the typical setting investigated till now, each
classifier is trained on data taken or resampled from a common data set, or
(almost) randomly selecte... |
cs/9905014 | Hierarchical Reinforcement Learning with the MAXQ Value Function
Decomposition | cs.LG | This paper presents the MAXQ approach to hierarchical reinforcement learning
based on decomposing the target Markov decision process (MDP) into a hierarchy
of smaller MDPs and decomposing the value function of the target MDP into an
additive combination of the value functions of the smaller MDPs. The paper
defines th... |
cs/9905015 | State Abstraction in MAXQ Hierarchical Reinforcement Learning | cs.LG | Many researchers have explored methods for hierarchical reinforcement
learning (RL) with temporal abstractions, in which abstract actions are defined
that can perform many primitive actions before terminating. However, little is
known about learning with state abstractions, in which aspects of the state
space are ign... |
cs/9905016 | Programs with Stringent Performance Objectives Will Often Exhibit
Chaotic Behavior | cs.CE cs.CC | Software for the resolution of certain kind of problems, those that rate high
in the Stringent Performance Objectives adjustment factor (IFPUG scheme), can
be described using a combination of game theory and autonomous systems. From
this description it can be shown that some of those problems exhibit chaotic
behavior... |
cs/9906001 | On Bounded-Weight Error-Correcting Codes | cs.IT math.IT | This paper computationally obtains optimal bounded-weight, binary,
error-correcting codes for a variety of distance bounds and dimensions. We
compare the sizes of our codes to the sizes of optimal constant-weight, binary,
error-correcting codes, and evaluate the differences.
|
cs/9906002 | The Symbol Grounding Problem | cs.AI | How can the semantic interpretation of a formal symbol system be made
intrinsic to the system, rather than just parasitic on the meanings in our
heads? How can the meanings of the meaningless symbol tokens, manipulated
solely on the basis of their (arbitrary) shapes, be grounded in anything but
other meaningless symb... |
cs/9906003 | 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. P... |
cs/9906004 | Cascaded Grammatical Relation Assignment | cs.CL cs.LG | In this paper we discuss cascaded Memory-Based grammatical relations
assignment. In the first stages of the cascade, we find chunks of several types
(NP,VP,ADJP,ADVP,PP) and label them with their adverbial function (e.g. local,
temporal). In the last stage, we assign grammatical relations to pairs of
chunks. We studi... |
cs/9906005 | Memory-Based Shallow Parsing | cs.CL cs.LG | We present a memory-based learning (MBL) approach to shallow parsing in which
POS tagging, chunking, and identification of syntactic relations are formulated
as memory-based modules. The experiments reported in this paper show
competitive results, the F-value for the Wall Street Journal (WSJ) treebank is:
93.8% for N... |
cs/9906006 | Learning Efficient Disambiguation | cs.CL cs.AI | This dissertation analyses the computational properties of current
performance-models of natural language parsing, in particular Data Oriented
Parsing (DOP), points out some of their major shortcomings and suggests
suitable solutions. It provides proofs that various problems of probabilistic
disambiguation are NP-Com... |
cs/9906009 | 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 ... |
cs/9906010 | Predicate Logic with Definitions | cs.LO cs.AI | Predicate Logic with Definitions (PLD or D-logic) is a modification of
first-order logic intended mostly for practical formalization of mathematics.
The main syntactic constructs of D-logic are terms, formulas and definitions. A
definition is a definition of variables, a definition of constants, or a
composite defini... |
cs/9906011 | A Newton method without evaluation of nonlinear function values | cs.CE cs.NA math.NA | The present author recently proposed and proved a relationship theorem
between nonlinear polynomial equations and the corresponding Jacobian matrix.
By using this theorem, this paper derives a Newton iterative formula without
requiring the evaluation of nonlinear function values in the solution of
nonlinear polynomia... |
cs/9906012 | The application of special matrix product to differential quadrature
solution of geometrically nonlinear bending of orthotropic rectangular plates | cs.CE cs.NA math.NA | The Hadamard and SJT product of matrices are two types of special matrix
product. The latter was first defined by Chen. In this study, they are applied
to the differential quadrature (DQ) solution of geometrically nonlinear bending
of isotropic and orthotropic rectangular plates. By using the Hadamard product,
the no... |
cs/9906014 | 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... |
cs/9906015 | 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 ou... |
cs/9906016 | Automatically Selecting Useful Phrases for Dialogue Act Tagging | cs.AI cs.LG | We present an empirical investigation of various ways to automatically
identify phrases in a tagged corpus that are useful for dialogue act tagging.
We found that a new method (which measures a phrase's deviation from an
optimally-predictive phrase), enhanced with a lexical filtering mechanism,
produces significantly... |
cs/9906019 | Resolving Part-of-Speech Ambiguity in the Greek Language Using Learning
Techniques | cs.CL cs.AI | This article investigates the use of Transformation-Based Error-Driven
learning for resolving part-of-speech ambiguity in the Greek language. The aim
is not only to study the performance, but also to examine its dependence on
different thematic domains. Results are presented here for two different test
cases: a corpu... |
cs/9906020 | 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 l... |
cs/9906025 | 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 candi... |
cs/9906026 | 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 ... |
cs/9906027 | Human-Computer Conversation | cs.CL cs.HC | The article surveys a little of the history of the technology, sets out the
main current theoretical approaches in brief, and discusses the on-going
opposition between theoretical and empirical approaches. It illustrates the
situation with some discussion of CONVERSE, a system that won the Loebner prize
in 1997 and w... |
cs/9906029 | Events in Property Patterns | cs.SE cs.AI cs.CL cs.SC | A pattern-based approach to the presentation, codification and reuse of
property specifications for finite-state verification was proposed by Dwyer and
his collegues. The patterns enable non-experts to read and write formal
specifications for realistic systems and facilitate easy conversion of
specifications between ... |
cs/9906034 | 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.
|
cs/9907003 | 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
discours... |
cs/9907004 | MAP Lexicon is useful for segmentation and word discovery in
child-directed speech | cs.CL cs.LG | Because of rather fundamental changes to the underlying model proposed in the
paper, it has been withdrawn from the archive.
|
cs/9907006 | 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 represen... |
cs/9907007 | 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 s... |
cs/9907008 | 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 whi... |
cs/9907009 | Designing and Mining Multi-Terabyte Astronomy Archives: The Sloan
Digital Sky Survey | cs.DB cs.DL | The next-generation astronomy digital archives will cover most of the
universe at fine resolution in many wave-lengths, from X-rays to ultraviolet,
optical, and infrared. The archives will be stored at diverse geographical
locations. One of the first of these projects, the Sloan Digital Sky Survey
(SDSS) will create ... |
cs/9907010 | 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 c... |
cs/9907012 | 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-directe... |
cs/9907013 | 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 b... |
cs/9907016 | Microsoft TerraServer: A Spatial Data Warehouse | cs.DB cs.DL | The TerraServer stores aerial, satellite, and topographic images of the earth
in a SQL database available via the Internet. It is the world's largest online
atlas, combining five terabytes of image data from the United States Geological
Survey (USGS) and SPIN-2. This report describes the system-redesign based on
our ... |
cs/9907017 | 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 re... |
cs/9907020 | Generalized linearization in nonlinear modeling of data | cs.CE cs.NA math.NA | The principal innovative idea in this paper is to transform the original
complex nonlinear modeling problem into a combination of linear problem and
very simple nonlinear problems. The key step is the generalized linearization
of nonlinear terms. This paper only presents the introductory strategy of this
methodology.... |
cs/9907021 | 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... |
cs/9907026 | Mixing representation levels: The hybrid approach to automatic text
generation | cs.CL cs.AI | Natural language generation systems (NLG) map non-linguistic representations
into strings of words through a number of steps using intermediate
representations of various levels of abstraction. Template based systems, by
contrast, tend to use only one representation level, i.e. fixed strings, which
are combined, poss... |
cs/9907032 | Clausal Temporal Resolution | cs.LO cs.AI | In this article, we examine how clausal resolution can be applied to a
specific, but widely used, non-classical logic, namely discrete linear temporal
logic. Thus, we first define a normal form for temporal formulae and show how
arbitrary temporal formulae can be translated into the normal form, while
preserving sati... |
cs/9907042 | Raising Reliability of Web Search Tool Research through Replication and
Chaos Theory | cs.IR cs.DL | Because the World Wide Web is a dynamic collection of information, the Web
search tools (or "search engines") that index the Web are dynamic. Traditional
information retrieval evaluation techniques may not provide reliable results
when applied to the Web search tools. This study is the result of ten
replications of t... |
cs/9907043 | A simple C++ library for manipulating scientific data sets as structured
data | cs.CE cs.DB | Representing scientific data sets efficiently on external storage usually
involves converting them to a byte string representation using specialized
reader/writer routines. The resulting storage files are frequently difficult to
interpret without these specialized routines as they do not contain information
about the... |
cs/9908001 | 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 biparti... |
cs/9908004 | Extending the Stable Model Semantics with More Expressive Rules | cs.LO cs.AI | The rules associated with propositional logic programs and the stable model
semantics are not expressive enough to let one write concise programs. This
problem is alleviated by introducing some new types of propositional rules.
Together with a decision procedure that has been used as a base for an
efficient implement... |
cs/9908013 | Collective Intelligence for Control of Distributed Dynamical Systems | cs.LG adap-org cond-mat cs.AI cs.DC cs.MA nlin.AO | We consider the El Farol bar problem, also known as the minority game (W. B.
Arthur, ``The American Economic Review'', 84(2): 406--411 (1994), D. Challet
and Y.C. Zhang, ``Physica A'', 256:514 (1998)). We view it as an instance of
the general problem of how to configure the nodal elements of a distributed
dynamical s... |
cs/9908014 | An Introduction to Collective Intelligence | cs.LG adap-org cond-mat cs.DC cs.MA nlin.AO | This paper surveys the emerging science of how to design a ``COllective
INtelligence'' (COIN). A COIN is a large multi-agent system where:
(i) There is little to no centralized communication or control; and
(ii) There is a provided world utility function that rates the possible
histories of the full system.
In ... |
cs/9908015 | Representing Scholarly Claims in Internet Digital Libraries: A Knowledge
Modelling Approach | cs.DL cs.AI cs.HC cs.IR | This paper is concerned with tracking and interpreting scholarly documents in
distributed research communities. We argue that current approaches to document
description, and current technological infrastructures particularly over the
World Wide Web, provide poor support for these tasks. We describe the design of
a di... |
cs/9908017 | A Differential Invariant for Zooming | cs.CV | This paper presents an invariant under scaling and linear brightness change.
The invariant is based on differentials and therefore is a local feature.
Rotationally invariant 2-d differential Gaussian operators up to third order
are proposed for the implementation of the invariant. The performance is
analyzed by simul... |
cs/9909002 | 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 i... |
cs/9909003 | Iterative Deepening Branch and Bound | cs.AI | In tree search problem the best-first search algorithm needs too much of
space . To remove such drawbacks of these algorithms the IDA* was developed
which is both space and time cost efficient. But again IDA* can give an optimal
solution for real valued problems like Flow shop scheduling, Travelling
Salesman and 0/1 ... |
cs/9909009 | The Rough Guide to Constraint Propagation | cs.AI cs.PL | We provide here a simple, yet very general framework that allows us to
explain several constraint propagation algorithms in a systematic way. In
particular, using the notions commutativity and semi-commutativity, we show how
the well-known AC-3, PC-2, DAC and DPC algorithms are instances of a single
generic algorithm... |
cs/9909010 | Automatic Generation of Constraint Propagation Algorithms for Small
Finite Domains | cs.AI cs.PL | We study here constraint satisfaction problems that are based on predefined,
explicitly given finite constraints. To solve them we propose a notion of rule
consistency that can be expressed in terms of rules derived from the explicit
representation of the initial constraints.
This notion of local consistency is wea... |
cs/9909014 | Reasoning About Common Knowledge with Infinitely Many Agents | cs.LO cs.AI | Complete axiomatizations and exponential-time decision procedures are
provided for reasoning about knowledge and common knowledge when there are
infinitely many agents. The results show that reasoning about knowledge and
common knowledge with infinitely many agents is no harder than when there are
finitely many agent... |
cs/9909016 | Least expected cost query optimization: an exercise in utility | cs.DB | We identify two unreasonable, though standard, assumptions made by database
query optimizers that can adversely affect the quality of the chosen evaluation
plans. One assumption is that it is enough to optimize for the expected
case---that is, the case where various parameters (like available memory) take
on their ex... |
cs/9909019 | Knowledge in Multi-Agent Systems: Initial Configurations and Broadcast | cs.LO cs.AI | The semantic framework for the modal logic of knowledge due to Halpern and
Moses provides a way to ascribe knowledge to agents in distributed and
multi-agent systems. In this paper we study two special cases of this
framework: full systems and hypercubes. Both model static situations in which
no agent has any informa... |
cs/9910011 | A statistical model for word discovery in child directed speech | cs.CL cs.LG | A statistical model for segmentation and word discovery in child directed
speech is presented. An incremental unsupervised learning algorithm to infer
word boundaries based on this model is described and results of empirical tests
showing that the algorithm is competitive with other models that have been used
for sim... |
cs/9910015 | PIPE: Personalizing Recommendations via Partial Evaluation | cs.IR cs.AI | It is shown that personalization of web content can be advantageously viewed
as a form of partial evaluation --- a technique well known in the programming
languages community. The basic idea is to model a recommendation space as a
program, then partially evaluate this program with respect to user preferences
(and fea... |
cs/9910016 | Probabilistic Agent Programs | cs.AI | Agents are small programs that autonomously take actions based on changes in
their environment or ``state.'' Over the last few years, there have been an
increasing number of efforts to build agents that can interact and/or
collaborate with other agents. In one of these efforts, Eiter, Subrahmanian amd
Pick (AIJ, 108(... |
cs/9910019 | Consistent Checkpointing in Distributed Databases: Towards a Formal
Approach | cs.DB cs.DC | Whether it is for audit or for recovery purposes, data checkpointing is an
important problem of distributed database systems. Actually, transactions
establish dependence relations on data checkpoints taken by data object
managers. So, given an arbitrary set of data checkpoints (including at least a
single data checkp... |
cs/9910020 | 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 ... |
cs/9910021 | Efficient and Extensible Algorithms for Multi Query Optimization | cs.DB | Complex queries are becoming commonplace, with the growing use of decision
support systems. These complex queries often have a lot of common
sub-expressions, either within a single query, or across multiple such queries
run as a batch. Multi-query optimization aims at exploiting common
sub-expressions to reduce evalu... |
cs/9910022 | 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... |
cs/9911006 | 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.
|
cs/9911011 | 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, sin... |
cs/9911012 | Cox's Theorem Revisited | cs.AI | The assumptions needed to prove Cox's Theorem are discussed and examined.
Various sets of assumptions under which a Cox-style theorem can be proved are
provided, although all are rather strong and, arguably, not natural.
|
cs/9912002 | A Geometric Model for Information Retrieval Systems | cs.IR cs.CC cs.DL | This decade has seen a great deal of progress in the development of
information retrieval systems. Unfortunately, we still lack a systematic
understanding of the behavior of the systems and their relationship with
documents. In this paper we present a completely new approach towards the
understanding of the informati... |
cs/9912003 | 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 an... |
cs/9912004 | 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... |
cs/9912005 | 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... |
cs/9912006 | 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
resolutio... |
cs/9912007 | 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 use... |
cs/9912008 | New Error Bounds for Solomonoff Prediction | cs.AI cs.LG | Solomonoff sequence prediction is a scheme to predict digits of binary
strings without knowing the underlying probability distribution. We call a
prediction scheme informed when it knows the true probability distribution of
the sequence. Several new relations between universal Solomonoff sequence
prediction and infor... |
cs/9912009 | 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 d... |
cs/9912011 | Adaptivity in Agent-Based Routing for Data Networks | cs.MA adap-org cs.NI nlin.AO | Adaptivity, both of the individual agents and of the interaction structure
among the agents, seems indispensable for scaling up multi-agent systems
(MAS's) in noisy environments. One important consideration in designing
adaptive agents is choosing their action spaces to be as amenable as possible
to machine learning ... |
cs/9912012 | Avoiding Braess' Paradox through Collective Intelligence | cs.DC adap-org cs.MA cs.NI nlin.AO | In an Ideal Shortest Path Algorithm (ISPA), at each moment each router in a
network sends all of its traffic down the path that will incur the lowest cost
to that traffic. In the limit of an infinitesimally small amount of traffic for
a particular router, its routing that traffic via an ISPA is optimal, as far as
cos... |
cs/9912015 | Comparative Analysis of Five XML Query Languages | cs.DB | XML is becoming the most relevant new standard for data representation and
exchange on the WWW. Novel languages for extracting and restructuring the XML
content have been proposed, some in the tradition of database query languages
(i.e. SQL, OQL), others more closely inspired by XML. No standard for XML query
languag... |
cs/9912016 | HMM Specialization with Selective Lexicalization | cs.CL cs.LG | We present a technique which complements Hidden Markov Models by
incorporating some lexicalized states representing syntactically uncommon
words. Our approach examines the distribution of transitions, selects the
uncommon words, and makes lexicalized states for the words. We performed a
part-of-speech tagging experim... |
cs/9912017 | 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 lo... |
cs/9912021 | Seeing the Forest in the Tree: Applying VRML to Mathematical Problems in
Number Theory | cs.MS cs.CE | We show how VRML (Virtual Reality Modeling Language) can provide potentially
powerful insight into the 3x + 1 problem via the introduction of a unique
geometrical object, called the 'G-cell', akin to a fractal generator. We
present an example of a VRML world developed programmatically with the G-cell.
The role of VRM... |
hep-lat/0003009 | Data storage issues in lattice QCD calculations | hep-lat cs.DB | I describe some of the data management issues in lattice Quantum
Chromodynamics calculations. I focus on the experience of the UKQCD
collaboration. I describe an attempt to use a relational database to store part
of the data produced by a lattice QCD calculation.
|
hep-lat/0505005 | Parallel Programming with Matrix Distributed Processing | hep-lat cs.CE physics.comp-ph | Matrix Distributed Processing (MDP) is a C++ library for fast development of
efficient parallel algorithms. It constitues the core of FermiQCD. MDP enables
programmers to focus on algorithms, while parallelization is dealt with
automatically and transparently. Here we present a brief overview of MDP and
examples of a... |
hep-lat/9808001 | Genetic Algorithm for SU(N) gauge theory on a lattice | hep-lat cs.NE | An Algorithm is proposed for the simulation of pure SU(N) lattice gauge
theories based on Genetic Algorithms(GAs). Main difference between GAs and
Metropolis methods(MPs) is that GAs treat a population of points at once, while
MPs treat only one point in the searching space. This provides GAs with
information about t... |
hep-lat/9809068 | Genetic Algorithm for SU(2) Gauge Theory on a 2-dimensional Lattice | hep-lat cs.NE | An algorithm is proposed for the simulation of pure SU(N) lattice gauge
theories based on Genetic Algorithms(GAs). We apply GAs to SU(2) pure gauge
theory on a 2 dimensional lattice and show the results, the action per
plaquette and Wilson loops, are consistent with those by Metropolis method(MP)s
and Heatbath method... |
math-ph/0211067 | Method of Additional Structures on the Objects of a Monoidal Kleisli
Category as a Background for Information Transformers Theory | math-ph cs.MA math.CT math.MP | Category theory provides a compact method of encoding mathematical structures
in a uniform way, thereby enabling the use of general theorems on, for example,
equivalence and universal constructions. In this article we develop the method
of additional structures on the objects of a monoidal Kleisli category. It is
pro... |
math-ph/0512026 | MIMO Channel Correlation in General Scattering Environments | math-ph cs.IT math.IT math.MP | This paper presents an analytical model for the fading channel correlation in
general scattering environments. In contrast to the existing correlation
models, our new approach treats the scattering environment as non-separable and
it is modeled using a bi-angular power distribution. The bi-angular power
distribution ... |
math-ph/9903036 | Numerically Invariant Signature Curves | math-ph cs.CV math.MP | Corrected versions of the numerically invariant expressions for the affine
and Euclidean signature of a planar curve proposed by E.Calabi et. al are
presented. The new formulas are valid for fine but otherwise arbitrary
partitions of the curve. We also give numerically invariant expressions for the
four differential ... |
math/0005058 | An information-spectrum approach to joint source-channel coding | math.PR cs.IT math.IT | Given a general source $\sV=\{V^n\}\noi$ with {\em countably infinite} source
alphabet and a general channel $\sW=\{W^n\}\noi$ with arbitrary {\em abstract}
channel input and output alphabets, we study the joint source-channel coding
problem from the information-spectrum point of view. First, we generalize
Feinstein'... |
math/0005281 | Connections between Linear Systems and Convolutional Codes | math.OC cs.IT math.IT | The article reviews different definitions for a convolutional code which can
be found in the literature. The algebraic differences between the definitions
are worked out in detail. It is shown that bi-infinite support systems are dual
to finite-support systems under Pontryagin duality. In this duality the dual of
a c... |
math/0006233 | Algorithmic Statistics | math.ST cs.IT cs.LG math.IT math.PR physics.data-an stat.TH | While Kolmogorov complexity is the accepted absolute measure of information
content of an individual finite object, a similarly absolute notion is needed
for the relation between an individual data sample and an individual model
summarizing the information in the data, for example, a finite set (or
probability distri... |
math/0009018 | Critical Behavior in Lossy Source Coding | math.PR cs.IT math.IT | The following critical phenomenon was recently discovered. When a memoryless
source is compressed using a variable-length fixed-distortion code, the fastest
convergence rate of the (pointwise) compression ratio to the optimal $R(D)$
bits/symbol is either $O(\sqrt{n})$ or $O(\log n)$. We show it is always
$O(\sqrt{n})... |
math/0010173 | Hot-pressing process modeling for medium density fiberboard (MDF) | math.NA cs.CE | In this paper we present a numerical solution for the mathematical modeling
of the hot-pressing process applied to medium density fiberboard. The model is
based in the work of Humphrey[82], Humphrey and Bolton[89] and Carvalho and
Costa[98], with some modifications and extensions in order to take into account
mainly ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.