Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
14,502 | 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 learnin... | computer science |
14,503 | 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 against... | computer science |
14,504 | 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 su... | computer science |
14,505 | 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, especi... | computer science |
14,506 | 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 observ... | computer science |
14,507 | A Bit of Progress in Language Modeling | cs.CL | In the past several years, a number of different language modeling
improvements over simple trigram models have been found, including caching,
higher-order n-grams, skipping, interpolated Kneser-Ney smoothing, and
clustering. We present explorations of variations on, or of the limits of, each
of these techniques, inclu... | computer science |
14,508 | Classes for Fast Maximum Entropy Training | cs.CL | Maximum entropy models are considered by many to be one of the most promising
avenues of language modeling research. Unfortunately, long training times make
maximum entropy research difficult. We present a novel speedup technique: we
change the form of the model to use classes. Our speedup works by creating two
maximum... | computer science |
14,509 | Portability of Syntactic Structure for Language Modeling | cs.CL | The paper presents a study on the portability of statistical syntactic
knowledge in the framework of the structured language model (SLM). We
investigate the impact of porting SLM statistics from the Wall Street Journal
(WSJ) to the Air Travel Information System (ATIS) domain. We compare this
approach to applying the Mi... | computer science |
14,510 | Anaphora and Discourse Structure | cs.CL | We argue in this paper that many common adverbial phrases generally taken to
signal a discourse relation between syntactically connected units within
discourse structure, instead work anaphorically to contribute relational
meaning, with only indirect dependence on discourse structure. This allows a
simpler discourse st... | computer science |
14,511 | Boosting Trees for Anti-Spam Email Filtering | cs.CL | This paper describes a set of comparative experiments for the problem of
automatically filtering unwanted electronic mail messages. Several variants of
the AdaBoost algorithm with confidence-rated predictions [Schapire & Singer,
99] have been applied, which differ in the complexity of the base learners
considered. Two ... | computer science |
14,512 | Modelling Semantic Association and Conceptual Inheritance for Semantic
Analysis | cs.CL | Allowing users to interact through language borders is an interesting
challenge for information technology. For the purpose of a computer assisted
language learning system, we have chosen icons for representing meaning on the
input interface, since icons do not depend on a particular language. However, a
key limitation... | computer science |
14,513 | Learning class-to-class selectional preferences | cs.CL | Selectional preference learning methods have usually focused on word-to-class
relations, e.g., a verb selects as its subject a given nominal class. This
papers extends previous statistical models to class-to-class preferences, and
presents a model that learns selectional preferences for classes of verbs. The
motivation... | computer science |
14,514 | Knowledge Sources for Word Sense Disambiguation | cs.CL | Two kinds of systems have been defined during the long history of WSD:
principled systems that define which knowledge types are useful for WSD, and
robust systems that use the information sources at hand, such as, dictionaries,
light-weight ontologies or hand-tagged corpora. This paper tries to systematize
the relation... | computer science |
14,515 | Enriching WordNet concepts with topic signatures | cs.CL | This paper explores the possibility of enriching the content of existing
ontologies. The overall goal is to overcome the lack of topical links among
concepts in WordNet. Each concept is to be associated to a topic signature,
i.e., a set of related words with associated weights. The signatures can be
automatically const... | computer science |
14,516 | Testing for Mathematical Lineation in Jim Crace's "Quarantine" and T. S.
Eliot's "Four Quartets" | cs.CL | The mathematical distinction between prose and verse may be detected in
writings that are not apparently lineated, for example in T. S. Eliot's "Burnt
Norton", and Jim Crace's "Quarantine". In this paper we offer comments on
appropriate statistical methods for such work, and also on the nature of formal
innovation in t... | computer science |
14,517 | Richer Syntactic Dependencies for Structured Language Modeling | cs.CL | The paper investigates the use of richer syntactic dependencies in the
structured language model (SLM). We present two simple methods of enriching the
dependencies in the syntactic parse trees used for intializing the SLM. We
evaluate the impact of both methods on the perplexity (PPL) and
word-error-rate(WER, N-best re... | computer science |
14,518 | Part-of-Speech Tagging with Two Sequential Transducers | cs.CL | We present a method of constructing and using a cascade consisting of a left-
and a right-sequential finite-state transducer (FST), T1 and T2, for
part-of-speech (POS) disambiguation. Compared to an HMM, this FST cascade has
the advantage of significantly higher processing speed, but at the cost of
slightly lower accur... | computer science |
14,519 | What is the minimal set of fragments that achieves maximal parse
accuracy? | 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,520 | Combining semantic and syntactic structure for language modeling | cs.CL | Structured language models for speech recognition have been shown to remedy
the weaknesses of n-gram models. All current structured language models are,
however, limited in that they do not take into account dependencies between
non-headwords. We show that non-headword dependencies contribute to
significantly improved ... | computer science |
14,521 | A procedure for unsupervised lexicon learning | cs.CL | We describe an incremental unsupervised procedure to learn words from
transcribed continuous speech. The algorithm is based on a conservative and
traditional statistical model, and results of empirical tests show that it is
competitive with other algorithms that have been proposed recently for this
task. | computer science |
14,522 | A Statistical Model for Word Discovery in Transcribed Speech | cs.CL | A statistical model for segmentation and word discovery in continuous speech
is presented. An incremental unsupervised learning algorithm to infer word
boundaries based on this model is described. Results of empirical tests showing
that the algorithm is competitive with other models that have been used for
similar task... | computer science |
14,523 | Using a Support-Vector Machine for Japanese-to-English Translation of
Tense, Aspect, and Modality | cs.CL | This paper describes experiments carried out using a variety of
machine-learning methods, including the k-nearest neighborhood method that was
used in a previous study, for the translation of tense, aspect, and modality.
It was found that the support-vector machine method was the most precise of all
the methods tested. | computer science |
14,524 | Part of Speech Tagging in Thai Language Using Support Vector Machine | cs.CL | The elastic-input neuro tagger and hybrid tagger, combined with a neural
network and Brill's error-driven learning, have already been proposed for the
purpose of constructing a practical tagger using as little training data as
possible. When a small Thai corpus is used for training, these taggers have
tagging accuracie... | computer science |
14,525 | Universal Model for Paraphrasing -- Using Transformation Based on a
Defined Criteria -- | cs.CL | This paper describes a universal model for paraphrasing that transforms
according to defined criteria. We showed that by using different criteria we
could construct different kinds of paraphrasing systems including one for
answering questions, one for compressing sentences, one for polishing up, and
one for transformin... | computer science |
14,526 | Blind Normalization of Speech From Different Channels and Speakers | cs.CL | This paper describes representations of time-dependent signals that are
invariant under any invertible time-independent transformation of the signal
time series. Such a representation is created by rescaling the signal in a
non-linear dynamic manner that is determined by recently encountered signal
levels. This techniq... | computer science |
14,527 | An Integrated Framework for Treebanks and Multilayer Annotations | cs.CL | Treebank formats and associated software tools are proliferating rapidly,
with little consideration for interoperability. We survey a wide variety of
treebank structures and operations, and show how they can be mapped onto the
annotation graph model, and leading to an integrated framework encompassing
tree and non-tree... | computer science |
14,528 | Annotation Graphs and Servers and Multi-Modal Resources: Infrastructure
for Interdisciplinary Education, Research and Development | cs.CL | Annotation graphs and annotation servers offer infrastructure to support the
analysis of human language resources in the form of time-series data such as
text, audio and video. This paper outlines areas of common need among empirical
linguists and computational linguists. After reviewing examples of data and
tools used... | computer science |
14,529 | Computational Phonology | cs.CL | Phonology, as it is practiced, is deeply computational. Phonological analysis
is data-intensive and the resulting models are nothing other than specialized
data structures and algorithms. In the past, phonological computation -
managing data and developing analyses - was done manually with pencil and
paper. Increasingl... | computer science |
14,530 | Phonology | cs.CL | Phonology is the systematic study of the sounds used in language, their
internal structure, and their composition into syllables, words and phrases.
Computational phonology is the application of formal and computational
techniques to the representation and processing of phonological information.
This chapter will prese... | computer science |
14,531 | Integrating selectional preferences in WordNet | cs.CL | Selectional preference learning methods have usually focused on word-to-class
relations, e.g., a verb selects as its subject a given nominal class. This
paper extends previous statistical models to class-to-class preferences, and
presents a model that learns selectional preferences for classes of verbs,
together with a... | computer science |
14,532 | Decision Lists for English and Basque | cs.CL | In this paper we describe the systems we developed for the English (lexical
and all-words) and Basque tasks. They were all supervised systems based on
Yarowsky's Decision Lists. We used Semcor for training in the English all-words
task. We defined different feature sets for each language. For Basque, in order
to extrac... | computer science |
14,533 | The Basque task: did systems perform in the upperbound? | cs.CL | In this paper we describe the Senseval 2 Basque lexical-sample task. The task
comprised 40 words (15 nouns, 15 verbs and 10 adjectives) selected from Euskal
Hiztegia, the main Basque dictionary. Most examples were taken from the
Egunkaria newspaper. The method used to hand-tag the examples produced low
inter-tagger agr... | computer science |
14,534 | Memory-Based Shallow Parsing | cs.CL | We present memory-based learning approaches to shallow parsing and apply
these to five tasks: base noun phrase identification, arbitrary base phrase
recognition, clause detection, noun phrase parsing and full parsing. We use
feature selection techniques and system combination methods for improving the
performance of th... | computer science |
14,535 | Unsupervised discovery of morphologically related words based on
orthographic and semantic similarity | cs.CL | We present an algorithm that takes an unannotated corpus as its input, and
returns a ranked list of probable morphologically related pairs as its output.
The algorithm tries to discover morphologically related pairs by looking for
pairs that are both orthographically and semantically similar, where
orthographic similar... | computer science |
14,536 | Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences | cs.CL | Given the lack of word delimiters in written Japanese, word segmentation is
generally considered a crucial first step in processing Japanese texts. Typical
Japanese segmentation algorithms rely either on a lexicon and syntactic
analysis or on pre-segmented data; but these are labor-intensive, and the
lexico-syntactic t... | computer science |
14,537 | Ellogon: A New Text Engineering Platform | cs.CL | This paper presents Ellogon, a multi-lingual, cross-platform, general-purpose
text engineering environment. Ellogon was designed in order to aid both
researchers in natural language processing, as well as companies that produce
language engineering systems for the end-user. Ellogon provides a powerful
TIPSTER-based inf... | computer science |
14,538 | A variable-free dynamic semantics | cs.CL | I propose a variable-free treatment of dynamic semantics. By "dynamic
semantics" I mean analyses of donkey sentences ("Every farmer who owns a donkey
beats it") and other binding and anaphora phenomena in natural language where
meanings of constituents are updates to information states, for instance as
proposed by Groe... | computer science |
14,539 | NLTK: The Natural Language Toolkit | cs.CL | NLTK, the Natural Language Toolkit, is a suite of open source program
modules, tutorials and problem sets, providing ready-to-use computational
linguistics courseware. NLTK covers symbolic and statistical natural language
processing, and is interfaced to annotated corpora. Students augment and
replace existing componen... | computer science |
14,540 | Unsupervised Discovery of Morphemes | cs.CL | We present two methods for unsupervised segmentation of words into
morpheme-like units. The model utilized is especially suited for languages with
a rich morphology, such as Finnish. The first method is based on the Minimum
Description Length (MDL) principle and works online. In the second method,
Maximum Likelihood (M... | computer science |
14,541 | Bootstrapping Lexical Choice via Multiple-Sequence Alignment | cs.CL | An important component of any generation system is the mapping dictionary, a
lexicon of elementary semantic expressions and corresponding natural language
realizations. Typically, labor-intensive knowledge-based methods are used to
construct the dictionary. We instead propose to acquire it automatically via a
novel mul... | computer science |
14,542 | Evaluating the Effectiveness of Ensembles of Decision Trees in
Disambiguating Senseval Lexical Samples | cs.CL | This paper presents an evaluation of an ensemble--based system that
participated in the English and Spanish lexical sample tasks of Senseval-2. The
system combines decision trees of unigrams, bigrams, and co--occurrences into a
single classifier. The analysis is extended to include the Senseval-1 data. | computer science |
14,543 | Assessing System Agreement and Instance Difficulty in the Lexical Sample
Tasks of Senseval-2 | cs.CL | This paper presents a comparative evaluation among the systems that
participated in the Spanish and English lexical sample tasks of Senseval-2. The
focus is on pairwise comparisons among systems to assess the degree to which
they agree, and on measuring the difficulty of the test instances included in
these tasks. | computer science |
14,544 | Machine Learning with Lexical Features: The Duluth Approach to
Senseval-2 | cs.CL | This paper describes the sixteen Duluth entries in the Senseval-2 comparative
exercise among word sense disambiguation systems. There were eight pairs of
Duluth systems entered in the Spanish and English lexical sample tasks. These
are all based on standard machine learning algorithms that induce classifiers
from sense... | computer science |
14,545 | A Method for Open-Vocabulary Speech-Driven Text Retrieval | cs.CL | While recent retrieval techniques do not limit the number of index terms,
out-of-vocabulary (OOV) words are crucial in speech recognition. Aiming at
retrieving information with spoken queries, we fill the gap between speech
recognition and text retrieval in terms of the vocabulary size. Given a spoken
query, we generat... | computer science |
14,546 | Japanese/English Cross-Language Information Retrieval: Exploration of
Query Translation and Transliteration | cs.CL | Cross-language information retrieval (CLIR), where queries and documents are
in different languages, has of late become one of the major topics within the
information retrieval community. This paper proposes a Japanese/English CLIR
system, where we combine a query translation and retrieval modules. We
currently target ... | computer science |
14,547 | A Probabilistic Method for Analyzing Japanese Anaphora Integrating Zero
Pronoun Detection and Resolution | cs.CL | This paper proposes a method to analyze Japanese anaphora, in which zero
pronouns (omitted obligatory cases) are used to refer to preceding entities
(antecedents). Unlike the case of general coreference resolution, zero pronouns
have to be detected prior to resolution because they are not expressed in
discourse. Our me... | computer science |
14,548 | Applying a Hybrid Query Translation Method to Japanese/English
Cross-Language Patent Retrieval | cs.CL | This paper applies an existing query translation method to cross-language
patent retrieval. In our method, multiple dictionaries are used to derive all
possible translations for an input query, and collocational statistics are used
to resolve translation ambiguity. We used Japanese/English parallel patent
abstracts to ... | computer science |
14,549 | PRIME: A System for Multi-lingual Patent Retrieval | cs.CL | Given the growing number of patents filed in multiple countries, users are
interested in retrieving patents across languages. We propose a multi-lingual
patent retrieval system, which translates a user query into the target
language, searches a multilingual database for patents relevant to the query,
and improves the b... | computer science |
14,550 | Language Modeling for Multi-Domain Speech-Driven Text Retrieval | cs.CL | We report experimental results associated with speech-driven text retrieval,
which facilitates retrieving information in multiple domains with spoken
queries. Since users speak contents related to a target collection, we produce
language models used for speech recognition based on the target collection, so
as to improv... | computer science |
14,551 | Speech-Driven Text Retrieval: Using Target IR Collections for
Statistical Language Model Adaptation in Speech Recognition | cs.CL | Speech recognition has of late become a practical technology for real world
applications. Aiming at speech-driven text retrieval, which facilitates
retrieving information with spoken queries, we propose a method to integrate
speech recognition and retrieval methods. Since users speak contents related to
a target collec... | computer science |
14,552 | Using eigenvectors of the bigram graph to infer morpheme identity | cs.CL | This paper describes the results of some experiments exploring statistical
methods to infer syntactic behavior of words and morphemes from a raw corpus in
an unsupervised fashion. It shares certain points in common with Brown et al
(1992) and work that has grown out of that: it employs statistical techniques
to analyze... | computer science |
14,553 | Analysis of Titles and Readers For Title Generation Centered on the
Readers | cs.CL | The title of a document has two roles, to give a compact summary and to lead
the reader to read the document. Conventional title generation focuses on
finding key expressions from the author's wording in the document to give a
compact summary and pays little attention to the reader's interest. To make the
title play it... | computer science |
14,554 | Efficient Deep Processing of Japanese | cs.CL | We present a broad coverage Japanese grammar written in the HPSG formalism
with MRS semantics. The grammar is created for use in real world applications,
such that robustness and performance issues play an important role. It is
connected to a POS tagging and word segmentation tool. This grammar is being
developed in a ... | computer science |
14,555 | Using the DIFF Command for Natural Language Processing | cs.CL | Diff is a software program that detects differences between two data sets and
is useful in natural language processing. This paper shows several examples of
the application of diff. They include the detection of differences between two
different datasets, extraction of rewriting rules, merging of two different
datasets... | computer science |
14,556 | Evaluation of Coreference Rules on Complex Narrative Texts | cs.CL | This article studies the problem of assessing relevance to each of the rules
of a reference resolution system. The reference solver described here stems
from a formal model of reference and is integrated in a reference processing
workbench. Evaluation of the reference resolution is essential, as it enables
differential... | computer science |
14,557 | Three New Methods for Evaluating Reference Resolution | cs.CL | Reference resolution on extended texts (several thousand references) cannot
be evaluated manually. An evaluation algorithm has been proposed for the MUC
tests, using equivalence classes for the coreference relation. However, we show
here that this algorithm is too indulgent, yielding good scores even for poor
resolutio... | computer science |
14,558 | Cooperation between Pronoun and Reference Resolution for Unrestricted
Texts | cs.CL | Anaphora resolution is envisaged in this paper as part of the reference
resolution process. A general open architecture is proposed, which can be
particularized and configured in order to simulate some classic anaphora
resolution methods. With the aim of improving pronoun resolution, the system
takes advantage of eleme... | computer science |
14,559 | Reference Resolution Beyond Coreference: a Conceptual Frame and its
Application | cs.CL | A model for reference use in communication is proposed, from a
representationist point of view. Both the sender and the receiver of a message
handle representations of their common environment, including mental
representations of objects. Reference resolution by a computer is viewed as the
construction of object repres... | computer science |
14,560 | A Chart-Parsing Algorithm for Efficient Semantic Analysis | cs.CL | In some contexts, well-formed natural language cannot be expected as input to
information or communication systems. In these contexts, the use of
grammar-independent input (sequences of uninflected semantic units like e.g.
language-independent icons) can be an answer to the users' needs. A semantic
analysis can be perf... | computer science |
14,561 | Rerendering Semantic Ontologies: Automatic Extensions to UMLS through
Corpus Analytics | cs.CL | In this paper, we discuss the utility and deficiencies of existing ontology
resources for a number of language processing applications. We describe a
technique for increasing the semantic type coverage of a specific ontology, the
National Library of Medicine's UMLS, with the use of robust finite state
methods used in c... | computer science |
14,562 | Introduction to the CoNLL-2002 Shared Task: Language-Independent Named
Entity Recognition | cs.CL | We describe the CoNLL-2002 shared task: language-independent named entity
recognition. We give background information on the data sets and the evaluation
method, present a general overview of the systems that have taken part in the
task and discuss their performance. | computer science |
14,563 | Probabilistic Parsing Strategies | cs.CL | We present new results on the relation between purely symbolic context-free
parsing strategies and their probabilistic counter-parts. Such parsing
strategies are seen as constructions of push-down devices from grammars. We
show that preservation of probability distribution is possible under two
conditions, viz. the cor... | computer science |
14,564 | Answering Subcognitive Turing Test Questions: A Reply to French | cs.CL | Robert French has argued that a disembodied computer is incapable of passing
a Turing Test that includes subcognitive questions. Subcognitive questions are
designed to probe the network of cultural and perceptual associations that
humans naturally develop as we live, embodied and embedded in the world. In
this paper, I... | computer science |
14,565 | An Algorithm for Aligning Sentences in Bilingual Corpora Using Lexical
Information | cs.CL | In this paper we describe an algorithm for aligning sentences with their
translations in a bilingual corpus using lexical information of the languages.
Existing efficient algorithms ignore word identities and consider only the
sentence lengths (Brown, 1991; Gale and Church, 1993). For a sentence in the
source language ... | computer science |
14,566 | Empirical Methods for Compound Splitting | cs.CL | Compounded words are a challenge for NLP applications such as machine
translation (MT). We introduce methods to learn splitting rules from
monolingual and parallel corpora. We evaluate them against a gold standard and
measure their impact on performance of statistical MT systems. Results show
accuracy of 99.1% and perf... | computer science |
14,567 | About compression of vocabulary in computer oriented languages | cs.CL | The author uses the entropy of the ideal Bose-Einstein gas to minimize losses
in computer-oriented languages. | computer science |
14,568 | Glottochronology and problems of protolanguage reconstruction | cs.CL | A method of languages genealogical trees construction is proposed. | computer science |
14,569 | Learning to Paraphrase: An Unsupervised Approach Using Multiple-Sequence
Alignment | cs.CL | We address the text-to-text generation problem of sentence-level paraphrasing
-- a phenomenon distinct from and more difficult than word- or phrase-level
paraphrasing. Our approach applies multiple-sequence alignment to sentences
gathered from unannotated comparable corpora: it learns a set of paraphrasing
patterns rep... | computer science |
14,570 | Blind Normalization of Speech From Different Channels | cs.CL | We show how to construct a channel-independent representation of speech that
has propagated through a noisy reverberant channel. This is done by blindly
rescaling the cepstral time series by a non-linear function, with the form of
this scale function being determined by previously encountered cepstra from
that channel.... | computer science |
14,571 | Glottochronologic Retrognostic of Language System | cs.CL | A glottochronologic retrognostic of language system is proposed | computer science |
14,572 | "I'm sorry Dave, I'm afraid I can't do that": Linguistics, Statistics,
and Natural Language Processing circa 2001 | cs.CL | A brief, general-audience overview of the history of natural language
processing, focusing on data-driven approaches.Topics include "Ambiguity and
language analysis", "Firth things first", "A 'C' change", and "The empiricists
strike back". | computer science |
14,573 | An XML based Document Suite | cs.CL | We report about the current state of development of a document suite and its
applications. This collection of tools for the flexible and robust processing
of documents in German is based on the use of XML as unifying formalism for
encoding input and output data as well as process information. It is organized
in modules... | computer science |
14,574 | Exploiting Sublanguage and Domain Characteristics in a Bootstrapping
Approach to Lexicon and Ontology Creation | cs.CL | It is very costly to build up lexical resources and domain ontologies.
Especially when confronted with a new application domain lexical gaps and a
poor coverage of domain concepts are a problem for the successful exploitation
of natural language document analysis systems that need and exploit such
knowledge sources. In... | computer science |
14,575 | An Approach for Resource Sharing in Multilingual NLP | cs.CL | In this paper we describe an approach for the analysis of documents in German
and English with a shared pool of resources. For the analysis of German
documents we use a document suite, which supports the user in tasks like
information retrieval and information extraction. The core of the document
suite is based on our ... | computer science |
14,576 | Factorization of Language Models through Backing-Off Lattices | cs.CL | Factorization of statistical language models is the task that we resolve the
most discriminative model into factored models and determine a new model by
combining them so as to provide better estimate. Most of previous works mainly
focus on factorizing models of sequential events, each of which allows only one
factoriz... | computer science |
14,577 | Introduction to the CoNLL-2003 Shared Task: Language-Independent Named
Entity Recognition | cs.CL | We describe the CoNLL-2003 shared task: language-independent named entity
recognition. We give background information on the data sets (English and
German) and the evaluation method, present a general overview of the systems
that have taken part in the task and discuss their performance. | computer science |
14,578 | Learning to Order Facts for Discourse Planning in Natural Language
Generation | cs.CL | This paper presents a machine learning approach to discourse planning in
natural language generation. More specifically, we address the problem of
learning the most natural ordering of facts in discourse plans for a specific
domain. We discuss our methodology and how it was instantiated using two
different machine lear... | computer science |
14,579 | An Improved k-Nearest Neighbor Algorithm for Text Categorization | cs.CL | k is the most important parameter in a text categorization system based on
k-Nearest Neighbor algorithm (kNN).In the classification process, k nearest
documents to the test one in the training set are determined firstly. Then, the
predication can be made according to the category distribution among these k
nearest neig... | computer science |
14,580 | Issues in Communication Game | cs.CL | As interaction between autonomous agents, communication can be analyzed in
game-theoretic terms. Meaning game is proposed to formalize the core of
intended communication in which the sender sends a message and the receiver
attempts to infer its meaning intended by the sender. Basic issues involved in
the game of natura... | computer science |
14,581 | Parsing and Generation with Tabulation and Compilation | cs.CL | The standard tabulation techniques for logic programming presuppose fixed
order of computation. Some data-driven control should be introduced in order to
deal with diverse contexts. The present paper describes a data-driven method of
constraint transformation with a sort of compilation which subsumes
accessibility chec... | computer science |
14,582 | The Linguistic DS: Linguisitic Description in MPEG-7 | cs.CL | MPEG-7 (Moving Picture Experts Group Phase 7) is an XML-based international
standard on semantic description of multimedia content. This document discusses
the Linguistic DS and related tools. The linguistic DS is a tool, based on the
GDA tag set (http://i-content.org/GDA/tagset.html), for semantic annotation of
lingui... | computer science |
14,583 | Collaborative Creation of Digital Content in Indian Languages | cs.CL | The world is passing through a major revolution called the information
revolution, in which information and knowledge is becoming available to people
in unprecedented amounts wherever and whenever they need it. Those societies
which fail to take advantage of the new technology will be left behind, just
like in the indu... | computer science |
14,584 | Information Revolution | cs.CL | The world is passing through a major revolution called the information
revolution, in which information and knowledge is becoming available to people
in unprecedented amounts wherever and whenever they need it. Those societies
which fail to take advantage of the new technology will be left behind, just
like in the indu... | computer science |
14,585 | Anusaaraka: Overcoming the Language Barrier in India | cs.CL | The anusaaraka system makes text in one Indian language accessible in another
Indian language. In the anusaaraka approach, the load is so divided between man
and computer that the language load is taken by the machine, and the
interpretation of the text is left to the man. The machine presents an image of
the source te... | computer science |
14,586 | Language Access: An Information Based Approach | cs.CL | The anusaaraka system (a kind of machine translation system) makes text in
one Indian language accessible through another Indian language. The machine
presents an image of the source text in a language close to the target
language. In the image, some constructions of the source language (which do not
have equivalents i... | computer science |
14,587 | LERIL : Collaborative Effort for Creating Lexical Resources | cs.CL | The paper reports on efforts taken to create lexical resources pertaining to
Indian languages, using the collaborative model. The lexical resources being
developed are: (1) Transfer lexicon and grammar from English to several Indian
languages. (2) Dependencey tree bank of annotated corpora for several Indian
languages.... | computer science |
14,588 | Building a Test Collection for Speech-Driven Web Retrieval | cs.CL | This paper describes a test collection (benchmark data) for retrieval systems
driven by spoken queries. This collection was produced in the subtask of the
NTCIR-3 Web retrieval task, which was performed in a TREC-style evaluation
workshop. The search topics and document collection for the Web retrieval task
were used t... | computer science |
14,589 | A Cross-media Retrieval System for Lecture Videos | cs.CL | We propose a cross-media lecture-on-demand system, in which users can
selectively view specific segments of lecture videos by submitting text
queries. Users can easily formulate queries by using the textbook associated
with a target lecture, even if they cannot come up with effective keywords. Our
system extracts the a... | computer science |
14,590 | Effective XML Representation for Spoken Language in Organisations | cs.CL | Spoken Language can be used to provide insights into organisational
processes, unfortunately transcription and coding stages are very time
consuming and expensive. The concept of partial transcription and coding is
proposed in which spoken language is indexed prior to any subsequent
processing. The functional linguisti... | computer science |
14,591 | Application Architecture for Spoken Language Resources in Organisational
Settings | cs.CL | Special technologies need to be used to take advantage of, and overcome, the
challenges associated with acquiring, transforming, storing, processing, and
distributing spoken language resources in organisations. This paper introduces
an application architecture consisting of tools and supporting utilities for
indexing a... | computer science |
14,592 | The Rank-Frequency Analysis for the Functional Style Corpora in the
Ukrainian Language | cs.CL | We use the rank-frequency analysis for the estimation of Kernel Vocabulary
size within specific corpora of Ukrainian. The extrapolation of high-rank
behaviour is utilized for estimation of the total vocabulary size. | computer science |
14,593 | Measuring the Functional Load of Phonological Contrasts | cs.CL | Frequency counts are a measure of how much use a language makes of a
linguistic unit, such as a phoneme or word. However, what is often important is
not the units themselves, but the contrasts between them. A measure is
therefore needed for how much use a language makes of a contrast, i.e. the
functional load (FL) of t... | computer science |
14,594 | Lexical Base as a Compressed Language Model of the World (on the
material of the Ukrainian language) | cs.CL | In the article the fact is verified that the list of words selected by formal
statistical methods (frequency and functional genre unrestrictedness) is not a
conglomerate of non-related words. It creates a system of interrelated items
and it can be named "lexical base of language". This selected list of words
covers all... | computer science |
14,595 | Polarity sensitivity and evaluation order in type-logical grammar | cs.CL | We present a novel, type-logical analysis of_polarity sensitivity_: how
negative polarity items (like "any" and "ever") or positive ones (like "some")
are licensed or prohibited. It takes not just scopal relations but also linear
order into account, using the programming-language notions of delimited
continuations and ... | computer science |
14,596 | Tabular Parsing | cs.CL | This is a tutorial on tabular parsing, on the basis of tabulation of
nondeterministic push-down automata. Discussed are Earley's algorithm, the
Cocke-Kasami-Younger algorithm, tabular LR parsing, the construction of parse
trees, and further issues. | computer science |
14,597 | Test Collections for Patent-to-Patent Retrieval and Patent Map
Generation in NTCIR-4 Workshop | cs.CL | This paper describes the Patent Retrieval Task in the Fourth NTCIR Workshop,
and the test collections produced in this task. We perform the invalidity
search task, in which each participant group searches a patent collection for
the patents that can invalidate the demand in an existing claim. We also
perform the automa... | computer science |
14,598 | A Probabilistic Model of Machine Translation | cs.CL | A probabilistic model for computer-based generation of a machine translation
system on the basis of English-Russian parallel text corpora is suggested. The
model is trained using parallel text corpora with pre-aligned source and target
sentences. The training of the model results in a bilingual dictionary of words
and ... | computer science |
14,599 | Catching the Drift: Probabilistic Content Models, with Applications to
Generation and Summarization | cs.CL | We consider the problem of modeling the content structure of texts within a
specific domain, in terms of the topics the texts address and the order in
which these topics appear. We first present an effective knowledge-lean method
for learning content models from un-annotated documents, utilizing a novel
adaptation of a... | computer science |
14,600 | A Public Reference Implementation of the RAP Anaphora Resolution
Algorithm | cs.CL | This paper describes a standalone, publicly-available implementation of the
Resolution of Anaphora Procedure (RAP) given by Lappin and Leass (1994). The
RAP algorithm resolves third person pronouns, lexical anaphors, and identifies
pleonastic pronouns. Our implementation, JavaRAP, fills a current need in
anaphora resol... | computer science |
14,601 | Building a linguistic corpus from bee dance data | cs.CL | This paper discusses the problems and possibility of collecting bee dance
data in a linguistic \textit{corpus} and use linguistic instruments such as
Zipf's law and entropy statistics to decide on the question whether the dance
carries information of any kind. We describe this against the historical
background of attem... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.