Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
14,402 | Information Extraction from Broadcast News | cs.CL | This paper discusses the development of trainable statistical models for
extracting content from television and radio news broadcasts. In particular we
concentrate on statistical finite state models for identifying proper names and
other named entities in broadcast speech. Two models are presented: the first
represents... | computer science |
14,403 | Looking at discourse in a corpus: The role of lexical cohesion | cs.CL | This paper is aimed at reporting on the development and application of a
computer model for discourse analysis through segmentation. Segmentation refers
to the principled division of texts into contiguous constituents. Other studies
have looked at the application of a number of models to the analysis of
discourse by co... | computer science |
14,404 | A Simple Approach to Building Ensembles of Naive Bayesian Classifiers
for Word Sense Disambiguation | cs.CL | This paper presents a corpus-based approach to word sense disambiguation that
builds an ensemble of Naive Bayesian classifiers, each of which is based on
lexical features that represent co--occurring words in varying sized windows of
context. Despite the simplicity of this approach, empirical results
disambiguating the... | computer science |
14,405 | Noun Phrase Recognition by System Combination | cs.CL | The performance of machine learning algorithms can be improved by combining
the output of different systems. In this paper we apply this idea to the
recognition of noun phrases.We generate different classifiers by using
different representations of the data. By combining the results with voting
techniques described in ... | computer science |
14,406 | Improving Testsuites via Instrumentation | cs.CL | This paper explores the usefulness of a technique from software engineering,
namely code instrumentation, for the development of large-scale natural
language grammars. Information about the usage of grammar rules in test
sentences is used to detect untested rules, redundant test sentences, and
likely causes of overgene... | computer science |
14,407 | On the Scalability of the Answer Extraction System "ExtrAns" | cs.CL | This paper reports on the scalability of the answer extraction system
ExtrAns. An answer extraction system locates the exact phrases in the documents
that contain the explicit answers to the user queries. Answer extraction
systems are therefore more convenient than document retrieval systems in
situations where the use... | computer science |
14,408 | Finite-State Reduplication in One-Level Prosodic Morphology | cs.CL | Reduplication, a central instance of prosodic morphology, is particularly
challenging for state-of-the-art computational morphology, since it involves
copying of some part of a phonological string. In this paper I advocate a
finite-state method that combines enriched lexical representations via
intersection to implemen... | computer science |
14,409 | Ranking suspected answers to natural language questions using predictive
annotation | cs.CL | In this paper, we describe a system to rank suspected answers to natural
language questions. We process both corpus and query using a new technique,
predictive annotation, which augments phrases in texts with labels anticipating
their being targets of certain kinds of questions. Given a natural language
question, an IR... | computer science |
14,410 | Exploiting Diversity in Natural Language Processing: Combining Parsers | cs.CL | Three state-of-the-art statistical parsers are combined to produce more
accurate parses, as well as new bounds on achievable Treebank parsing accuracy.
Two general approaches are presented and two combination techniques are
described for each approach. Both parametric and non-parametric models are
explored. The resulti... | computer science |
14,411 | Bagging and Boosting a Treebank Parser | cs.CL | Bagging and boosting, two effective machine learning techniques, are applied
to natural language parsing. Experiments using these techniques with a
trainable statistical parser are described. The best resulting system provides
roughly as large of a gain in F-measure as doubling the corpus size. Error
analysis of the re... | computer science |
14,412 | Exploiting Diversity for Natural Language Parsing | cs.CL | The popularity of applying machine learning methods to computational
linguistics problems has produced a large supply of trainable natural language
processing systems. Most problems of interest have an array of off-the-shelf
products or downloadable code implementing solutions using various techniques.
Where these solu... | computer science |
14,413 | Turning Speech Into Scripts | cs.CL | We describe an architecture for implementing spoken natural language dialogue
interfaces to semi-autonomous systems, in which the central idea is to
transform the input speech signal through successive levels of representation
corresponding roughly to linguistic knowledge, dialogue knowledge, and domain
knowledge. The ... | computer science |
14,414 | A Compact Architecture for Dialogue Management Based on Scripts and
Meta-Outputs | cs.CL | We describe an architecture for spoken dialogue interfaces to semi-autonomous
systems that transforms speech signals through successive representations of
linguistic, dialogue, and domain knowledge. Each step produces an output, and a
meta-output describing the transformation, with an executable program in a
simple scr... | computer science |
14,415 | A Comparison of the XTAG and CLE Grammars for English | cs.CL | When people develop something intended as a large broad-coverage grammar,
they usually have a more specific goal in mind. Sometimes this goal is covering
a corpus; sometimes the developers have theoretical ideas they wish to
investigate; most often, work is driven by a combination of these two main
types of goal. What ... | computer science |
14,416 | Compiling Language Models from a Linguistically Motivated Unification
Grammar | cs.CL | Systems now exist which are able to compile unification grammars into
language models that can be included in a speech recognizer, but it is so far
unclear whether non-trivial linguistically principled grammars can be used for
this purpose. We describe a series of experiments which investigate the
question empirically,... | computer science |
14,417 | Dialogue Act Modeling for Automatic Tagging and Recognition of
Conversational Speech | cs.CL | We describe a statistical approach for modeling dialogue acts in
conversational speech, i.e., speech-act-like units such as Statement, Question,
Backchannel, Agreement, Disagreement, and Apology. Our model detects and
predicts dialogue acts based on lexical, collocational, and prosodic cues, as
well as on the discourse... | computer science |
14,418 | Can Prosody Aid the Automatic Classification of Dialog Acts in
Conversational Speech? | cs.CL | Identifying whether an utterance is a statement, question, greeting, and so
forth is integral to effective automatic understanding of natural dialog.
Little is known, however, about how such dialog acts (DAs) can be automatically
classified in truly natural conversation. This study asks whether current
approaches, whic... | computer science |
14,419 | Entropy-based Pruning of Backoff Language Models | cs.CL | A criterion for pruning parameters from N-gram backoff language models is
developed, based on the relative entropy between the original and the pruned
model. It is shown that the relative entropy resulting from pruning a single
N-gram can be computed exactly and efficiently for backoff models. The relative
entropy meas... | computer science |
14,420 | Trainable Methods for Surface Natural Language Generation | cs.CL | We present three systems for surface natural language generation that are
trainable from annotated corpora. The first two systems, called NLG1 and NLG2,
require a corpus marked only with domain-specific semantic attributes, while
the last system, called NLG3, requires a corpus marked with both semantic
attributes and s... | computer science |
14,421 | Prosody-Based Automatic Segmentation of Speech into Sentences and Topics | cs.CL | A crucial step in processing speech audio data for information extraction,
topic detection, or browsing/playback is to segment the input into sentence and
topic units. Speech segmentation is challenging, since the cues typically
present for segmenting text (headers, paragraphs, punctuation) are absent in
spoken languag... | computer science |
14,422 | Approximation and Exactness in Finite State Optimality Theory | cs.CL | Previous work (Frank and Satta 1998; Karttunen, 1998) has shown that
Optimality Theory with gradient constraints generally is not finite state. A
new finite-state treatment of gradient constraints is presented which improves
upon the approximation of Karttunen (1998). The method turns out to be exact,
and very compact,... | computer science |
14,423 | Finite-State Non-Concatenative Morphotactics | cs.CL | Finite-state morphology in the general tradition of the Two-Level and Xerox
implementations has proved very successful in the production of robust
morphological analyzer-generators, including many large-scale commercial
systems. However, it has long been recognized that these implementations have
serious limitations in... | computer science |
14,424 | Incremental construction of minimal acyclic finite-state automata | cs.CL | In this paper, we describe a new method for constructing minimal,
deterministic, acyclic finite-state automata from a set of strings. Traditional
methods consist of two phases: the first to construct a trie, the second one to
minimize it. Our approach is to construct a minimal automaton in a single phase
by adding new ... | computer science |
14,425 | Bootstrapping a Tagged Corpus through Combination of Existing
Heterogeneous Taggers | cs.CL | This paper describes a new method, Combi-bootstrap, to exploit existing
taggers and lexical resources for the annotation of corpora with new tagsets.
Combi-bootstrap uses existing resources as features for a second level machine
learning module, that is trained to make the mapping to the new tagset on a
very small samp... | computer science |
14,426 | ATLAS: A flexible and extensible architecture for linguistic annotation | cs.CL | We describe a formal model for annotating linguistic artifacts, from which we
derive an application programming interface (API) to a suite of tools for
manipulating these annotations. The abstract logical model provides for a range
of storage formats and promotes the reuse of tools that interact through this
API. We fo... | computer science |
14,427 | Many uses, many annotations for large speech corpora: Switchboard and
TDT as case studies | cs.CL | This paper discusses the challenges that arise when large speech corpora
receive an ever-broadening range of diverse and distinct annotations. Two case
studies of this process are presented: the Switchboard Corpus of telephone
conversations and the TDT2 corpus of broadcast news. Switchboard has undergone
two independen... | computer science |
14,428 | Parameter-free Model of Rank Polysemantic Distribution | cs.CL | A model of rank polysemantic distribution with a minimal number of fitting
parameters is offered. In an ideal case a parameter-free description of the
dependence on the basis of one or several immediate features of the
distribution is possible. | computer science |
14,429 | Mapping WordNets Using Structural Information | cs.CL | We present a robust approach for linking already existing lexical/semantic
hierarchies. We used a constraint satisfaction algorithm (relaxation labeling)
to select --among a set of candidates-- the node in a target taxonomy that
bests matches each node in a source taxonomy. In particular, we use it to map
the nominal p... | computer science |
14,430 | Language identification of controlled systems: Modelling, control and
anomaly detection | cs.CL | Formal language techniques have been used in the past to study autonomous
dynamical systems. However, for controlled systems, new features are needed to
distinguish between information generated by the system and input control. We
show how the modelling framework for controlled dynamical systems leads
naturally to a fo... | computer science |
14,431 | Interfacing Constraint-Based Grammars and Generation Algorithms | cs.CL | Constraint-based grammars can, in principle, serve as the major linguistic
knowledge source for both parsing and generation. Surface generation starts
from input semantics representations that may vary across grammars. For many
declarative grammars, the concept of derivation implicitly built in is that of
parsing. They... | computer science |
14,432 | Comparing two trainable grammatical relations finders | cs.CL | Grammatical relationships (GRs) form an important level of natural language
processing, but different sets of GRs are useful for different purposes.
Therefore, one may often only have time to obtain a small training corpus with
the desired GR annotations. On such a small training corpus, we compare two
systems. They us... | computer science |
14,433 | More accurate tests for the statistical significance of result
differences | cs.CL | Statistical significance testing of differences in values of metrics like
recall, precision and balanced F-score is a necessary part of empirical natural
language processing. Unfortunately, we find in a set of experiments that many
commonly used tests often underestimate the significance and so are less likely
to detec... | computer science |
14,434 | Tagger Evaluation Given Hierarchical Tag Sets | cs.CL | We present methods for evaluating human and automatic taggers that extend
current practice in three ways. First, we show how to evaluate taggers that
assign multiple tags to each test instance, even if they do not assign
probabilities. Second, we show how to accommodate a common property of manually
constructed ``gold ... | computer science |
14,435 | Applying System Combination to Base Noun Phrase Identification | cs.CL | We use seven machine learning algorithms for one task: identifying base noun
phrases. The results have been processed by different system combination
methods and all of these outperformed the best individual result. We have
applied the seven learners with the best combinator, a majority vote of the top
five systems, to... | computer science |
14,436 | Meta-Learning for Phonemic Annotation of Corpora | cs.CL | We apply rule induction, classifier combination and meta-learning (stacked
classifiers) to the problem of bootstrapping high accuracy automatic annotation
of corpora with pronunciation information. The task we address in this paper
consists of generating phonemic representations reflecting the Flemish and
Dutch pronunc... | computer science |
14,437 | Aspects of Pattern-Matching in Data-Oriented Parsing | cs.CL | Data-Oriented Parsing (dop) ranks among the best parsing schemes, pairing
state-of-the art parsing accuracy to the psycholinguistic insight that larger
chunks of syntactic structures are relevant grammatical and probabilistic
units. Parsing with the dop-model, however, seems to involve a lot of CPU
cycles and a conside... | computer science |
14,438 | Temiar Reduplication in One-Level Prosodic Morphology | cs.CL | Temiar reduplication is a difficult piece of prosodic morphology. This paper
presents the first computational analysis of Temiar reduplication, using the
novel finite-state approach of One-Level Prosodic Morphology originally
developed by Walther (1999b, 2000). After reviewing both the data and the basic
tenets of One-... | computer science |
14,439 | Efficient probabilistic top-down and left-corner parsing | cs.CL | This paper examines efficient predictive broad-coverage parsing without
dynamic programming. In contrast to bottom-up methods, depth-first top-down
parsing produces partial parses that are fully connected trees spanning the
entire left context, from which any kind of non-local dependency or partial
semantic interpretat... | computer science |
14,440 | Compact non-left-recursive grammars using the selective left-corner
transform and factoring | cs.CL | The left-corner transform removes left-recursion from (probabilistic)
context-free grammars and unification grammars, permitting simple top-down
parsing techniques to be used. Unfortunately the grammars produced by the
standard left-corner transform are usually much larger than the original. The
selective left-corner t... | computer science |
14,441 | Selectional Restrictions in HPSG | cs.CL | Selectional restrictions are semantic sortal constraints imposed on the
participants of linguistic constructions to capture contextually-dependent
constraints on interpretation. Despite their limitations, selectional
restrictions have proven very useful in natural language applications, where
they have been used freque... | computer science |
14,442 | Estimation of Stochastic Attribute-Value Grammars using an Informative
Sample | cs.CL | We argue that some of the computational complexity associated with estimation
of stochastic attribute-value grammars can be reduced by training upon an
informative subset of the full training set. Results using the parsed Wall
Street Journal corpus show that in some circumstances, it is possible to obtain
better estima... | computer science |
14,443 | Noun-phrase co-occurrence statistics for semi-automatic semantic lexicon
construction | cs.CL | Generating semantic lexicons semi-automatically could be a great time saver,
relative to creating them by hand. In this paper, we present an algorithm for
extracting potential entries for a category from an on-line corpus, based upon
a small set of exemplars. Our algorithm finds more correct terms and fewer
incorrect o... | computer science |
14,444 | Measuring efficiency in high-accuracy, broad-coverage statistical
parsing | cs.CL | Very little attention has been paid to the comparison of efficiency between
high accuracy statistical parsers. This paper proposes one machine-independent
metric that is general enough to allow comparisons across very different
parsing architectures. This metric, which we call ``events considered'',
measures the number... | computer science |
14,445 | Estimators for Stochastic ``Unification-Based'' Grammars | cs.CL | Log-linear models provide a statistically sound framework for Stochastic
``Unification-Based'' Grammars (SUBGs) and stochastic versions of other kinds
of grammars. We describe two computationally-tractable ways of estimating the
parameters of such grammars from a training corpus of syntactic analyses, and
apply these t... | computer science |
14,446 | Exploiting auxiliary distributions in stochastic unification-based
grammars | cs.CL | This paper describes a method for estimating conditional probability
distributions over the parses of ``unification-based'' grammars which can
utilize auxiliary distributions that are estimated by other means. We show how
this can be used to incorporate information about lexical selectional
preferences gathered from ot... | computer science |
14,447 | Metonymy Interpretation Using X NO Y Examples | cs.CL | We developed on example-based method of metonymy interpretation. One
advantages of this method is that a hand-built database of metonymy is not
necessary because it instead uses examples in the form ``Noun X no Noun Y (Noun
Y of Noun X).'' Another advantage is that we will be able to interpret
newly-coined metonymic se... | computer science |
14,448 | Bunsetsu Identification Using Category-Exclusive Rules | cs.CL | This paper describes two new bunsetsu identification methods using supervised
learning. Since Japanese syntactic analysis is usually done after bunsetsu
identification, bunsetsu identification is important for analyzing Japanese
sentences. In experiments comparing the four previously available
machine-learning methods ... | computer science |
14,449 | Japanese Probabilistic Information Retrieval Using Location and Category
Information | cs.CL | Robertson's 2-poisson information retrieve model does not use location and
category information. We constructed a framework using location and category
information in a 2-poisson model. We submitted two systems based on this
framework to the IREX contest, Japanese language information retrieval contest
held in Japan in... | computer science |
14,450 | Temporal Expressions in Japanese-to-English Machine Translation | cs.CL | This paper describes in outline a method for translating Japanese temporal
expressions into English. We argue that temporal expressions form a special
subset of language that is best handled as a special module in machine
translation. The paper deals with problems of lexical idiosyncrasy as well as
the choice of articl... | computer science |
14,451 | Lexicalized Stochastic Modeling of Constraint-Based Grammars using
Log-Linear Measures and EM Training | cs.CL | We present a new approach to stochastic modeling of constraint-based grammars
that is based on log-linear models and uses EM for estimation from unannotated
data. The techniques are applied to an LFG grammar for German. Evaluation on an
exact match task yields 86% precision for an ambiguity rate of 5.4, and 90%
precisi... | computer science |
14,452 | Using a Probabilistic Class-Based Lexicon for Lexical Ambiguity
Resolution | cs.CL | This paper presents the use of probabilistic class-based lexica for
disambiguation in target-word selection. Our method employs minimal but precise
contextual information for disambiguation. That is, only information provided
by the target-verb, enriched by the condensed information of a probabilistic
class-based lexic... | computer science |
14,453 | Probabilistic Constraint Logic Programming. Formal Foundations of
Quantitative and Statistical Inference in Constraint-Based Natural Language
Processing | cs.CL | In this thesis, we present two approaches to a rigorous mathematical and
algorithmic foundation of quantitative and statistical inference in
constraint-based natural language processing. The first approach, called
quantitative constraint logic programming, is conceptualized in a clear logical
framework, and presents a ... | computer science |
14,454 | Automatic Extraction of Subcategorization Frames for Czech | cs.CL | We present some novel machine learning techniques for the identification of
subcategorization information for verbs in Czech. We compare three different
statistical techniques applied to this problem. We show how the learning
algorithm can be used to discover previously unknown subcategorization frames
from the Czech P... | computer science |
14,455 | Introduction to the CoNLL-2000 Shared Task: Chunking | cs.CL | We describe the CoNLL-2000 shared task: dividing text into syntactically
related non-overlapping groups of words, so-called text chunking. 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. | computer science |
14,456 | Anaphora Resolution in Japanese Sentences Using Surface Expressions and
Examples | cs.CL | Anaphora resolution is one of the major problems in natural language
processing. It is also one of the important tasks in machine translation and
man/machine dialogue. We solve the problem by using surface expressions and
examples. Surface expressions are the words in sentences which provide clues
for anaphora resoluti... | computer science |
14,457 | A Tableaux Calculus for Ambiguous Quantification | cs.CL | Coping with ambiguity has recently received a lot of attention in natural
language processing. Most work focuses on the semantic representation of
ambiguous expressions. In this paper we complement this work in two ways.
First, we provide an entailment relation for a language with ambiguous
expressions. Second, we give... | computer science |
14,458 | Parsing with the Shortest Derivation | cs.CL | Common wisdom has it that the bias of stochastic grammars in favor of shorter
derivations of a sentence is harmful and should be redressed. We show that the
common wisdom is wrong for stochastic grammars that use elementary trees
instead of context-free rules, such as Stochastic Tree-Substitution Grammars
used by Data-... | computer science |
14,459 | An improved parser for data-oriented lexical-functional analysis | cs.CL | We present an LFG-DOP parser which uses fragments from LFG-annotated
sentences to parse new sentences. Experiments with the Verbmobil and Homecentre
corpora show that (1) Viterbi n best search performs about 100 times faster
than Monte Carlo search while both achieve the same accuracy; (2) the DOP
hypothesis which stat... | computer science |
14,460 | Finding consensus in speech recognition: word error minimization and
other applications of confusion networks | cs.CL | We describe a new framework for distilling information from word lattices to
improve the accuracy of speech recognition and obtain a more perspicuous
representation of a set of alternative hypotheses. In the standard MAP decoding
approach the recognizer outputs the string of words corresponding to the path
with the hig... | computer science |
14,461 | Using existing systems to supplement small amounts of annotated
grammatical relations training data | cs.CL | Grammatical relationships (GRs) form an important level of natural language
processing, but different sets of GRs are useful for different purposes.
Therefore, one may often only have time to obtain a small training corpus with
the desired GR annotations. To boost the performance from using such a small
training corpus... | computer science |
14,462 | Exploring automatic word sense disambiguation with decision lists and
the Web | cs.CL | The most effective paradigm for word sense disambiguation, supervised
learning, seems to be stuck because of the knowledge acquisition bottleneck. In
this paper we take an in-depth study of the performance of decision lists on
two publicly available corpora and an additional corpus automatically acquired
from the Web, ... | computer science |
14,463 | Extraction of semantic relations from a Basque monolingual dictionary
using Constraint Grammar | cs.CL | This paper deals with the exploitation of dictionaries for the semi-automatic
construction of lexicons and lexical knowledge bases. The final goal of our
research is to enrich the Basque Lexical Database with semantic information
such as senses, definitions, semantic relations, etc., extracted from a Basque
monolingual... | computer science |
14,464 | Enriching very large ontologies using the WWW | cs.CL | This paper explores the possibility to exploit text on the world wide web in
order to enrich the concepts in existing ontologies. First, a method to
retrieve documents from the WWW related to a concept is described. These
document collections are used 1) to construct topic signatures (lists of
topically related words) ... | computer science |
14,465 | One Sense per Collocation and Genre/Topic Variations | cs.CL | This paper revisits the one sense per collocation hypothesis using
fine-grained sense distinctions and two different corpora. We show that the
hypothesis is weaker for fine-grained sense distinctions (70% vs. 99% reported
earlier on 2-way ambiguities). We also show that one sense per collocation does
hold across corpor... | computer science |
14,466 | Reduction of Intermediate Alphabets in Finite-State Transducer Cascades | cs.CL | This article describes an algorithm for reducing the intermediate alphabets
in cascades of finite-state transducers (FSTs). Although the method modifies
the component FSTs, there is no change in the overall relation described by the
whole cascade. No additional information or special algorithm, that could
decelerate th... | computer science |
14,467 | Utilizing the World Wide Web as an Encyclopedia: Extracting Term
Descriptions from Semi-Structured Texts | cs.CL | In this paper, we propose a method to extract descriptions of technical terms
from Web pages in order to utilize the World Wide Web as an encyclopedia. We
use linguistic patterns and HTML text structures to extract text fragments
containing term descriptions. We also use a language model to discard
extraneous descripti... | computer science |
14,468 | A Novelty-based Evaluation Method for Information Retrieval | cs.CL | In information retrieval research, precision and recall have long been used
to evaluate IR systems. However, given that a number of retrieval systems
resembling one another are already available to the public, it is valuable to
retrieve novel relevant documents, i.e., documents that cannot be retrieved by
those existin... | computer science |
14,469 | Applying Machine Translation to Two-Stage Cross-Language Information
Retrieval | cs.CL | Cross-language information retrieval (CLIR), where queries and documents are
in different languages, needs a translation of queries and/or documents, so as
to standardize both of them into a common representation. For this purpose, the
use of machine translation is an effective approach. However, computational
cost is ... | computer science |
14,470 | The Use of Instrumentation in Grammar Engineering | cs.CL | This paper explores the usefulness of a technique from software engineering,
code instrumentation, for the development of large-scale natural language
grammars. Information about the usage of grammar rules in test and corpus
sentences is used to improve grammar and testsuite, as well as adapting a
grammar to a specific... | computer science |
14,471 | Semantic interpretation of temporal information by abductive inference | cs.CL | Besides temporal information explicitly available in verbs and adjuncts, the
temporal interpretation of a text also depends on general world knowledge and
default assumptions. We will present a theory for describing the relation
between, on the one hand, verbs, their tenses and adjuncts and, on the other,
the eventuali... | computer science |
14,472 | Abductive reasoning with temporal information | cs.CL | Texts in natural language contain a lot of temporal information, both
explicit and implicit. Verbs and temporal adjuncts carry most of the explicit
information, but for a full understanding general world knowledge and default
assumptions have to be taken into account. We will present a theory for
describing the relatio... | computer science |
14,473 | Do All Fragments Count? | cs.CL | We aim at finding the minimal set of fragments which achieves maximal parse
accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street
Journal treebank show that counts of almost arbitrary fragments within parse
trees are important, leading to improved parse accuracy over previous models
tested on this tr... | computer science |
14,474 | Multi-Syllable Phonotactic Modelling | cs.CL | This paper describes a novel approach to constructing phonotactic models. The
underlying theoretical approach to phonological description is the
multisyllable approach in which multiple syllable classes are defined that
reflect phonotactically idiosyncratic syllable subcategories. A new
finite-state formalism, OFS Mode... | computer science |
14,475 | Taking Primitive Optimality Theory Beyond the Finite State | cs.CL | Primitive Optimality Theory (OTP) (Eisner, 1997a; Albro, 1998), a
computational model of Optimality Theory (Prince and Smolensky, 1993), employs
a finite state machine to represent the set of active candidates at each stage
of an Optimality Theoretic derivation, as well as weighted finite state
machines to represent th... | computer science |
14,476 | Finite-State Phonology: Proceedings of the 5th Workshop of the ACL
Special Interest Group in Computational Phonology (SIGPHON) | cs.CL | Home page of the workshop proceedings, with pointers to the individually
archived papers. Includes front matter from the printed version of the
proceedings. | computer science |
14,477 | Mathematical Model of Word Length on the Basis of the Cebanov-Fucks
Distribution with Uniform Parameter Distribution | cs.CL | The data on 13 typologically different languages have been processed using a
two-parameter word length model, based on 1-displaced uniform Poisson
distribution. Statistical dependencies of the 2nd parameter on the 1st one are
revealed for the German texts and genre of letters. | computer science |
14,478 | 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. | computer science |
14,479 | 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. Th... | computer science |
14,480 | 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 ph... | computer science |
14,481 | 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
applications ... | computer science |
14,482 | 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. The ... | computer science |
14,483 | 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 av... | computer science |
14,484 | 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-numera... | computer science |
14,485 | 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. Experimen... | computer science |
14,486 | 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 desc... | computer science |
14,487 | 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 g... | computer science |
14,488 | 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 direction... | computer science |
14,489 | 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 mappin... | computer science |
14,490 | 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 distri... | computer science |
14,491 | 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 s... | computer science |
14,492 | 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 adopted... | computer science |
14,493 | 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 fi... | computer science |
14,494 | 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. | computer science |
14,495 | 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
recognizer,... | computer science |
14,496 | 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
extracte... | computer science |
14,497 | 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 re... | computer science |
14,498 | 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, an... | computer science |
14,499 | 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 o... | computer science |
14,500 | 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 se... | computer science |
14,501 | 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. | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.