Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
14,702 | Stabilizing knowledge through standards - A perspective for the
humanities | cs.CL | It is usual to consider that standards generate mixed feelings among
scientists. They are often seen as not really reflecting the state of the art
in a given domain and a hindrance to scientific creativity. Still, scientists
should theoretically be at the best place to bring their expertise into
standard developments, ... | computer science |
14,703 | A PDTB-Styled End-to-End Discourse Parser | cs.CL | We have developed a full discourse parser in the Penn Discourse Treebank
(PDTB) style. Our trained parser first identifies all discourse and
non-discourse relations, locates and labels their arguments, and then
classifies their relation types. When appropriate, the attribution spans to
these relations are also determin... | computer science |
14,704 | Emoticonsciousness | cs.CL | A temporal analysis of emoticon use in Swedish, Italian, German and English
asynchronous electronic communication is reported. Emoticons are classified as
positive, negative and neutral. Postings to newsgroups over a 66 week period
are considered. The aggregate analysis of emoticon use in newsgroups for
science and pol... | computer science |
14,705 | Motifs de graphe pour le calcul de dépendances syntaxiques complètes | cs.CL | This article describes a method to build syntactical dependencies starting
from the phrase structure parsing process. The goal is to obtain all the
information needed for a detailled semantical analysis. Interaction Grammars
are used for parsing; the saturation of polarities which is the core of this
formalism can be m... | computer science |
14,706 | Opinion Polarity Identification through Adjectives | cs.CL | "What other people think" has always been an important piece of information
during various decision-making processes. Today people frequently make their
opinions available via the Internet, and as a result, the Web has become an
excellent source for gathering consumer opinions. There are now numerous Web
resources cont... | computer science |
14,707 | La réduction de termes complexes dans les langues de spécialité | cs.CL | Our study applies statistical methods to French and Italian corpora to
examine the phenomenon of multi-word term reduction in specialty languages.
There are two kinds of reduction: anaphoric and lexical. We show that anaphoric
reduction depends on the discourse type (vulgarization, pedagogical,
specialized) but is inde... | computer science |
14,708 | Annotated English | cs.CL | This document presents Annotated English, a system of diacritical symbols
which turns English pronunciation into a precise and unambiguous process. The
annotations are defined and located in such a way that the original English
text is not altered (not even a letter), thus allowing for a consistent reading
and learning... | computer science |
14,709 | Recognizing Uncertainty in Speech | cs.CL | We address the problem of inferring a speaker's level of certainty based on
prosodic information in the speech signal, which has application in
speech-based dialogue systems. We show that using phrase-level prosodic
features centered around the phrases causing uncertainty, in addition to
utterance-level prosodic featur... | computer science |
14,710 | Fitting Ranked English and Spanish Letter Frequency Distribution in U.S.
and Mexican Presidential Speeches | cs.CL | The limited range in its abscissa of ranked letter frequency distributions
causes multiple functions to fit the observed distribution reasonably well. In
order to critically compare various functions, we apply the statistical model
selections on ten functions, using the texts of U.S. and Mexican presidential
speeches i... | computer science |
14,711 | Codeco: A Grammar Notation for Controlled Natural Language in Predictive
Editors | cs.CL | Existing grammar frameworks do not work out particularly well for controlled
natural languages (CNL), especially if they are to be used in predictive
editors. I introduce in this paper a new grammar notation, called Codeco, which
is designed specifically for CNLs and predictive editors. Two different parsers
have been ... | computer science |
14,712 | English-Lithuanian-English Machine Translation lexicon and engine:
current state and future work | cs.CL | This article overviews the current state of the English-Lithuanian-English
machine translation system. The first part of the article describes the
problems that system poses today and what actions will be taken to solve them
in the future. The second part of the article tackles the main issue of the
translation process... | computer science |
14,713 | Multilingual lexicon design tool and database management system for MT | cs.CL | The paper presents the design and development of English-Lithuanian-English
dictionarylexicon tool and lexicon database management system for MT. The
system is oriented to support two main requirements: to be open to the user and
to describe much more attributes of speech parts as a regular dictionary that
are required... | computer science |
14,714 | A statistical learning algorithm for word segmentation | cs.CL | In natural speech, the speaker does not pause between words, yet a human
listener somehow perceives this continuous stream of phonemes as a series of
distinct words. The detection of boundaries between spoken words is an instance
of a general capability of the human neocortex to remember and to recognize
recurring sequ... | computer science |
14,715 | Computational Approach to Anaphora Resolution in Spanish Dialogues | cs.CL | This paper presents an algorithm for identifying noun-phrase antecedents of
pronouns and adjectival anaphors in Spanish dialogues. We believe that anaphora
resolution requires numerous sources of information in order to find the
correct antecedent of the anaphor. These sources can be of different kinds,
e.g., linguisti... | computer science |
14,716 | Acquiring Correct Knowledge for Natural Language Generation | cs.CL | Natural language generation (NLG) systems are computer software systems that
produce texts in English and other human languages, often from non-linguistic
input data. NLG systems, like most AI systems, need substantial amounts of
knowledge. However, our experience in two NLG projects suggests that it is
difficult to ac... | computer science |
14,717 | Entropy of Telugu | cs.CL | This paper presents an investigation of the entropy of the Telugu script.
Since this script is syllabic, and not alphabetic, the computation of entropy
is somewhat complicated. | computer science |
14,718 | Cross-moments computation for stochastic context-free grammars | cs.CL | In this paper we consider the problem of efficient computation of
cross-moments of a vector random variable represented by a stochastic
context-free grammar. Two types of cross-moments are discussed. The sample
space for the first one is the set of all derivations of the context-free
grammar, and the sample space for t... | computer science |
14,719 | Serialising the ISO SynAF Syntactic Object Model | cs.CL | This paper introduces, an XML format developed to serialise the object model
defined by the ISO Syntactic Annotation Framework SynAF. Based on widespread
best practices we adapt a popular XML format for syntactic annotation,
TigerXML, with additional features to support a variety of syntactic phenomena
including consti... | computer science |
14,720 | A Concise Query Language with Search and Transform Operations for
Corpora with Multiple Levels of Annotation | cs.CL | The usefulness of annotated corpora is greatly increased if there is an
associated tool that can allow various kinds of operations to be performed in a
simple way. Different kinds of annotation frameworks and many query languages
for them have been proposed, including some to deal with multiple layers of
annotation. We... | computer science |
14,721 | Using Inverse lambda and Generalization to Translate English to Formal
Languages | cs.CL | We present a system to translate natural language sentences to formulas in a
formal or a knowledge representation language. Our system uses two inverse
lambda-calculus operators and using them can take as input the semantic
representation of some words, phrases and sentences and from that derive the
semantic representa... | computer science |
14,722 | Language understanding as a step towards human level intelligence -
automatizing the construction of the initial dictionary from example
sentences | cs.CL | For a system to understand natural language, it needs to be able to take
natural language text and answer questions given in natural language with
respect to that text; it also needs to be able to follow instructions given in
natural language. To achieve this, a system must be able to process natural
language and be ab... | computer science |
14,723 | Query Expansion: Term Selection using the EWC Semantic Relatedness
Measure | cs.CL | This paper investigates the efficiency of the EWC semantic relatedness
measure in an ad-hoc retrieval task. This measure combines the Wikipedia-based
Explicit Semantic Analysis measure, the WordNet path measure and the mixed
collocation index. In the experiments, the open source search engine Terrier
was utilised as a ... | computer science |
14,724 | Minimalist Grammars and Minimalist Categorial Grammars, definitions
toward inclusion of generated languages | cs.CL | Stabler proposes an implementation of the Chomskyan Minimalist Program,
Chomsky 95 with Minimalist Grammars - MG, Stabler 97. This framework inherits a
long linguistic tradition. But the semantic calculus is more easily added if
one uses the Curry-Howard isomorphism. Minimalist Categorial Grammars - MCG,
based on an ex... | computer science |
14,725 | A Constraint-Satisfaction Parser for Context-Free Grammars | cs.CL | Traditional language processing tools constrain language designers to
specific kinds of grammars. In contrast, model-based language specification
decouples language design from language processing. As a consequence,
model-based language specification tools need general parsers able to parse
unrestricted context-free gr... | computer science |
14,726 | Data formats for phonological corpora | cs.CL | The goal of the present chapter is to explore the possibility of providing
the research (but also the industrial) community that commonly uses spoken
corpora with a stable portfolio of well-documented standardised formats that
allow a high re-use rate of annotated spoken resources and, as a consequence,
better interope... | computer science |
14,727 | NP Animacy Identification for Anaphora Resolution | cs.CL | In anaphora resolution for English, animacy identification can play an
integral role in the application of agreement restrictions between pronouns and
candidates, and as a result, can improve the accuracy of anaphora resolution
systems. In this paper, two methods for animacy identification are proposed and
evaluated us... | computer science |
14,728 | Ideogram Based Chinese Sentiment Word Orientation Computation | cs.CL | This paper presents a novel algorithm to compute sentiment orientation of
Chinese sentiment word. The algorithm uses ideograms which are a distinguishing
feature of Chinese language. The proposed algorithm can be applied to any
sentiment classification scheme. To compute a word's sentiment orientation
using the propose... | computer science |
14,729 | Individual and Domain Adaptation in Sentence Planning for Dialogue | cs.CL | One of the biggest challenges in the development and deployment of spoken
dialogue systems is the design of the spoken language generation module. This
challenge arises from the need for the generator to adapt to many features of
the dialogue domain, user population, and dialogue context. A promising
approach is traina... | computer science |
14,730 | ESLO: from transcription to speakers' personal information annotation | cs.CL | This paper presents the preliminary works to put online a French oral corpus
and its transcription. This corpus is the Socio-Linguistic Survey in Orleans,
realized in 1968. First, we numerized the corpus, then we handwritten
transcribed it with the Transcriber software adding different tags about
speakers, time, noise,... | computer science |
14,731 | Évaluation de lexiques syntaxiques par leur intégartion dans
l'analyseur syntaxiques FRMG | cs.CL | In this paper, we evaluate various French lexica with the parser FRMG: the
Lefff, LGLex, the lexicon built from the tables of the French Lexicon-Grammar,
the lexicon DICOVALENCE and a new version of the verbal entries of the Lefff,
obtained by merging with DICOVALENCE and partial manual validation. For this,
all these ... | computer science |
14,732 | Construction du lexique LGLex à partir des tables du Lexique-Grammaire
des verbes du grec moderne | cs.CL | In this paper, we summerize the work done on the resources of Modern Greek on
the Lexicon-Grammar of verbs. We detail the definitional features of each
table, and all changes made to the names of features to make them consistent.
Through the development of the table of classes, including all the features, we
have consi... | computer science |
14,733 | Extending the adverbial coverage of a NLP oriented resource for French | cs.CL | This paper presents a work on extending the adverbial entries of LGLex: a NLP
oriented syntactic resource for French. Adverbs were extracted from the
Lexicon-Grammar tables of both simple adverbs ending in -ment '-ly' (Molinier
and Levrier, 2000) and compound adverbs (Gross, 1986; 1990). This work relies
on the exploit... | computer science |
14,734 | Question Answering in a Natural Language Understanding System Based on
Object-Oriented Semantics | cs.CL | Algorithms of question answering in a computer system oriented on input and
logical processing of text information are presented. A knowledge domain under
consideration is social behavior of a person. A database of the system includes
an internal representation of natural language sentences and supplemental
information... | computer science |
14,735 | Rule based Part of speech Tagger for Homoeopathy Clinical realm | cs.CL | A tagger is a mandatory segment of most text scrutiny systems, as it
consigned a s yntax class (e.g., noun, verb, adjective, and adverb) to every
word in a sentence. In this paper, we present a simple part of speech tagger
for homoeopathy clinical language. This paper reports about the anticipated
part of speech tagger... | computer science |
14,736 | Exploring Twitter Hashtags | cs.CL | Twitter messages often contain so-called hashtags to denote keywords related
to them. Using a dataset of 29 million messages, I explore relations among
these hashtags with respect to co-occurrences. Furthermore, I present an
attempt to classify hashtags into five intuitive classes, using a
machine-learning approach. Th... | computer science |
14,737 | Formalization of semantic network of image constructions in electronic
content | cs.CL | A formal theory based on a binary operator of directional associative
relation is constructed in the article and an understanding of an associative
normal form of image constructions is introduced. A model of a commutative
semigroup, which provides a presentation of a sentence as three components of
an interrogative li... | computer science |
14,738 | Recognizing Bangla Grammar using Predictive Parser | cs.CL | We describe a Context Free Grammar (CFG) for Bangla language and hence we
propose a Bangla parser based on the grammar. Our approach is very much general
to apply in Bangla Sentences and the method is well accepted for parsing a
language of a grammar. The proposed parser is a predictive parser and we
construct the pars... | computer science |
14,739 | Wikipedia Arborification and Stratified Explicit Semantic Analysis | cs.CL | [This is the translation of paper "Arborification de Wikip\'edia et analyse
s\'emantique explicite stratifi\'ee" submitted to TALN 2012.]
We present an extension of the Explicit Semantic Analysis method by
Gabrilovich and Markovitch. Using their semantic relatedness measure, we weight
the Wikipedia categories graph. ... | computer science |
14,740 | The Horse Raced Past: Gardenpath Processing in Dynamical Systems | cs.CL | I pinpoint an interesting similarity between a recent account to rational
parsing and the treatment of sequential decisions problems in a dynamical
systems approach. I argue that expectation-driven search heuristics aiming at
fast computation resembles a high-risk decision strategy in favor of large
transition velociti... | computer science |
14,741 | Statistical Function Tagging and Grammatical Relations of Myanmar
Sentences | cs.CL | This paper describes a context free grammar (CFG) based grammatical relations
for Myanmar sentences which combine corpus-based function tagging system. Part
of the challenge of statistical function tagging for Myanmar sentences comes
from the fact that Myanmar has free-phrase-order and a complex morphological
system. F... | computer science |
14,742 | Distributional Measures of Semantic Distance: A Survey | cs.CL | The ability to mimic human notions of semantic distance has widespread
applications. Some measures rely only on raw text (distributional measures) and
some rely on knowledge sources such as WordNet. Although extensive studies have
been performed to compare WordNet-based measures with human judgment, the use
of distribu... | computer science |
14,743 | Distributional Measures as Proxies for Semantic Relatedness | cs.CL | The automatic ranking of word pairs as per their semantic relatedness and
ability to mimic human notions of semantic relatedness has widespread
applications. Measures that rely on raw data (distributional measures) and
those that use knowledge-rich ontologies both exist. Although extensive studies
have been performed t... | computer science |
14,744 | Fault detection system for Arabic language | cs.CL | The study of natural language, especially Arabic, and mechanisms for the
implementation of automatic processing is a fascinating field of study, with
various potential applications. The importance of tools for natural language
processing is materialized by the need to have applications that can
effectively treat the va... | computer science |
14,745 | Toward an example-based machine translation from written text to ASL
using virtual agent animation | cs.CL | Modern computational linguistic software cannot produce important aspects of
sign language translation. Using some researches we deduce that the majority of
automatic sign language translation systems ignore many aspects when they
generate animation; therefore the interpretation lost the truth information
meaning. Our ... | computer science |
14,746 | An Accurate Arabic Root-Based Lemmatizer for Information Retrieval
Purposes | cs.CL | In spite of its robust syntax, semantic cohesion, and less ambiguity, lemma
level analysis and generation does not yet focused in Arabic NLP literatures.
In the current research, we propose the first non-statistical accurate Arabic
lemmatizer algorithm that is suitable for information retrieval (IR) systems.
The propos... | computer science |
14,747 | Arabic Keyphrase Extraction using Linguistic knowledge and Machine
Learning Techniques | cs.CL | In this paper, a supervised learning technique for extracting keyphrases of
Arabic documents is presented. The extractor is supplied with linguistic
knowledge to enhance its efficiency instead of relying only on statistical
information such as term frequency and distance. During analysis, an annotated
Arabic corpus is ... | computer science |
14,748 | Reduplicated MWE (RMWE) helps in improving the CRF based Manipuri POS
Tagger | cs.CL | This paper gives a detail overview about the modified features selection in
CRF (Conditional Random Field) based Manipuri POS (Part of Speech) tagging.
Selection of features is so important in CRF that the better are the features
then the better are the outputs. This work is an attempt or an experiment to
make the prev... | computer science |
14,749 | Analysing Temporally Annotated Corpora with CAVaT | cs.CL | We present CAVaT, a tool that performs Corpus Analysis and Validation for
TimeML. CAVaT is an open source, modular checking utility for statistical
analysis of features specific to temporally-annotated natural language corpora.
It provides reporting, highlights salient links between a variety of general
and time-specif... | computer science |
14,750 | Using Signals to Improve Automatic Classification of Temporal Relations | cs.CL | Temporal information conveyed by language describes how the world around us
changes through time. Events, durations and times are all temporal elements
that can be viewed as intervals. These intervals are sometimes temporally
related in text. Automatically determining the nature of such relations is a
complex and unsol... | computer science |
14,751 | USFD2: Annotating Temporal Expresions and TLINKs for TempEval-2 | cs.CL | We describe the University of Sheffield system used in the TempEval-2
challenge, USFD2. The challenge requires the automatic identification of
temporal entities and relations in text. USFD2 identifies and anchors temporal
expressions, and also attempts two of the four temporal relation assignment
tasks. A rule-based sy... | computer science |
14,752 | An Annotation Scheme for Reichenbach's Verbal Tense Structure | cs.CL | In this paper we present RTMML, a markup language for the tenses of verbs and
temporal relations between verbs. There is a richness to tense in language that
is not fully captured by existing temporal annotation schemata. Following
Reichenbach we present an analysis of tense in terms of abstract time points,
with the a... | computer science |
14,753 | A Corpus-based Study of Temporal Signals | cs.CL | Automatic temporal ordering of events described in discourse has been of
great interest in recent years. Event orderings are conveyed in text via va
rious linguistic mechanisms including the use of expressions such as "before",
"after" or "during" that explicitly assert a temporal relation -- temporal
signals. In this ... | computer science |
14,754 | USFD at KBP 2011: Entity Linking, Slot Filling and Temporal Bounding | cs.CL | This paper describes the University of Sheffield's entry in the 2011 TAC KBP
entity linking and slot filling tasks. We chose to participate in the
monolingual entity linking task, the monolingual slot filling task and the
temporal slot filling tasks. We set out to build a framework for
experimentation with knowledge ba... | computer science |
14,755 | Massively Increasing TIMEX3 Resources: A Transduction Approach | cs.CL | Automatic annotation of temporal expressions is a research challenge of great
interest in the field of information extraction. Gold standard
temporally-annotated resources are limited in size, which makes research using
them difficult. Standards have also evolved over the past decade, so not all
temporally annotated da... | computer science |
14,756 | Post-Editing Error Correction Algorithm for Speech Recognition using
Bing Spelling Suggestion | cs.CL | ASR short for Automatic Speech Recognition is the process of converting a
spoken speech into text that can be manipulated by a computer. Although ASR has
several applications, it is still erroneous and imprecise especially if used in
a harsh surrounding wherein the input speech is of low quality. This paper
proposes a ... | computer science |
14,757 | ASR Context-Sensitive Error Correction Based on Microsoft N-Gram Dataset | cs.CL | At the present time, computers are employed to solve complex tasks and
problems ranging from simple calculations to intensive digital image processing
and intricate algorithmic optimization problems to computationally-demanding
weather forecasting problems. ASR short for Automatic Speech Recognition is yet
another type... | computer science |
14,758 | Tree Transducers, Machine Translation, and Cross-Language Divergences | cs.CL | Tree transducers are formal automata that transform trees into other trees.
Many varieties of tree transducers have been explored in the automata theory
literature, and more recently, in the machine translation literature. In this
paper I review T and xT transducers, situate them among related formalisms, and
show how ... | computer science |
14,759 | Roget's Thesaurus as a Lexical Resource for Natural Language Processing | cs.CL | WordNet proved that it is possible to construct a large-scale electronic
lexical database on the principles of lexical semantics. It has been accepted
and used extensively by computational linguists ever since it was released.
Inspired by WordNet's success, we propose as an alternative a similar resource,
based on the ... | computer science |
14,760 | Parallel Spell-Checking Algorithm Based on Yahoo! N-Grams Dataset | cs.CL | Spell-checking is the process of detecting and sometimes providing
suggestions for incorrectly spelled words in a text. Basically, the larger the
dictionary of a spell-checker is, the higher is the error detection rate;
otherwise, misspellings would pass undetected. Unfortunately, traditional
dictionaries suffer from o... | computer science |
14,761 | OCR Post-Processing Error Correction Algorithm using Google Online
Spelling Suggestion | cs.CL | With the advent of digital optical scanners, a lot of paper-based books,
textbooks, magazines, articles, and documents are being transformed into an
electronic version that can be manipulated by a computer. For this purpose,
OCR, short for Optical Character Recognition was developed to translate scanned
graphical text ... | computer science |
14,762 | Roget's Thesaurus and Semantic Similarity | cs.CL | We have implemented a system that measures semantic similarity using a
computerized 1987 Roget's Thesaurus, and evaluated it by performing a few
typical tests. We compare the results of these tests with those produced by
WordNet-based similarity measures. One of the benchmarks is Miller and Charles'
list of 30 noun pai... | computer science |
14,763 | Not As Easy As It Seems: Automating the Construction of Lexical Chains
Using Roget's Thesaurus | cs.CL | Morris and Hirst present a method of linking significant words that are about
the same topic. The resulting lexical chains are a means of identifying
cohesive regions in a text, with applications in many natural language
processing tasks, including text summarization. The first lexical chains were
constructed manually ... | computer science |
14,764 | Roget's Thesaurus: a Lexical Resource to Treasure | cs.CL | This paper presents the steps involved in creating an electronic lexical
knowledge base from the 1987 Penguin edition of Roget's Thesaurus. Semantic
relations are labelled with the help of WordNet. The two resources are compared
in a qualitative and quantitative manner. Differences in the organization of
the lexical ma... | computer science |
14,765 | Segmentation Similarity and Agreement | cs.CL | We propose a new segmentation evaluation metric, called segmentation
similarity (S), that quantifies the similarity between two segmentations as the
proportion of boundaries that are not transformed when comparing them using
edit distance, essentially using edit distance as a penalty function and
scaling penalties by s... | computer science |
14,766 | Indus script corpora, archaeo-metallurgy and Meluhha (Mleccha) | cs.CL | Jules Bloch's work on formation of the Marathi language has to be expanded
further to provide for a study of evolution and formation of Indian languages
in the Indian language union (sprachbund). The paper analyses the stages in the
evolution of early writing systems which began with the evolution of counting
in the an... | computer science |
14,767 | Context-sensitive Spelling Correction Using Google Web 1T 5-Gram
Information | cs.CL | In computing, spell checking is the process of detecting and sometimes
providing spelling suggestions for incorrectly spelled words in a text.
Basically, a spell checker is a computer program that uses a dictionary of
words to perform spell checking. The bigger the dictionary is, the higher is
the error detection rate.... | computer science |
14,768 | A Corpus-based Evaluation of a Domain-specific Text to Knowledge Mapping
Prototype | cs.CL | The aim of this paper is to evaluate a Text to Knowledge Mapping (TKM)
Prototype. The prototype is domain-specific, the purpose of which is to map
instructional text onto a knowledge domain. The context of the knowledge domain
is DC electrical circuit. During development, the prototype has been tested
with a limited da... | computer science |
14,769 | Adaptation of pedagogical resources description standard (LOM) with the
specificity of Arabic language | cs.CL | In this article we focus firstly on the principle of pedagogical indexing and
characteristics of Arabic language and secondly on the possibility of adapting
the standard for describing learning resources used (the LOM and its
Application Profiles) with learning conditions such as the educational levels
of students and ... | computer science |
14,770 | A Method for Selecting Noun Sense using Co-occurrence Relation in
English-Korean Translation | cs.CL | The sense analysis is still critical problem in machine translation system,
especially such as English-Korean translation which the syntactical different
between source and target languages is very great. We suggest a method for
selecting the noun sense using contextual feature in English-Korean
Translation. | computer science |
14,771 | More than Word Frequencies: Authorship Attribution via Natural Frequency
Zoned Word Distribution Analysis | cs.CL | With such increasing popularity and availability of digital text data,
authorships of digital texts can not be taken for granted due to the ease of
copying and parsing. This paper presents a new text style analysis called
natural frequency zoned word distribution analysis (NFZ-WDA), and then a basic
authorship attribut... | computer science |
14,772 | Recent Technological Advances in Natural Language Processing and
Artificial Intelligence | cs.CL | A recent advance in computer technology has permitted scientists to implement
and test algorithms that were known from quite some time (or not) but which
were computationally expensive. Two such projects are IBM's Jeopardy as a part
of its DeepQA project [1] and Wolfram's Wolframalpha[2]. Both these methods
implement n... | computer science |
14,773 | Introduction of the weight edition errors in the Levenshtein distance | cs.CL | In this paper, we present a new approach dedicated to correcting the spelling
errors of the Arabic language. This approach corrects typographical errors like
inserting, deleting, and permutation. Our method is inspired from the
Levenshtein algorithm, and allows a finer and better scheduling than
Levenshtein. The result... | computer science |
14,774 | Average word length dynamics as indicator of cultural changes in society | cs.CL | Dynamics of average length of words in Russian and English is analysed in the
article. Words belonging to the diachronic text corpus Google Books Ngram and
dated back to the last two centuries are studied. It was found out that average
word length slightly increased in the 19th century, and then it was growing
rapidly ... | computer science |
14,775 | Input Scheme for Hindi Using Phonetic Mapping | cs.CL | Written Communication on Computers requires knowledge of writing text for the
desired language using Computer. Mostly people do not use any other language
besides English. This creates a barrier. To resolve this issue we have
developed a scheme to input text in Hindi using phonetic mapping scheme. Using
this scheme we ... | computer science |
14,776 | Evaluation of Computational Grammar Formalisms for Indian Languages | cs.CL | Natural Language Parsing has been the most prominent research area since the
genesis of Natural Language Processing. Probabilistic Parsers are being
developed to make the process of parser development much easier, accurate and
fast. In Indian context, identification of which Computational Grammar
Formalism is to be use... | computer science |
14,777 | Identification of Fertile Translations in Medical Comparable Corpora: a
Morpho-Compositional Approach | cs.CL | This paper defines a method for lexicon in the biomedical domain from
comparable corpora. The method is based on compositional translation and
exploits morpheme-level translation equivalences. It can generate translations
for a large variety of morphologically constructed words and can also generate
'fertile' translati... | computer science |
14,778 | Natural Language Processing - A Survey | cs.CL | The utility and power of Natural Language Processing (NLP) seems destined to
change our technological society in profound and fundamental ways. However
there are, to date, few accessible descriptions of the science of NLP that have
been written for a popular audience, or even for an audience of intelligent,
but uniniti... | computer science |
14,779 | TEI and LMF crosswalks | cs.CL | The present paper explores various arguments in favour of making the Text
Encoding Initia-tive (TEI) guidelines an appropriate serialisation for ISO
standard 24613:2008 (LMF, Lexi-cal Mark-up Framework) . It also identifies the
issues that would have to be resolved in order to reach an appropriate
implementation of the... | computer science |
14,780 | SpeedRead: A Fast Named Entity Recognition Pipeline | cs.CL | Online content analysis employs algorithmic methods to identify entities in
unstructured text. Both machine learning and knowledge-base approaches lie at
the foundation of contemporary named entities extraction systems. However, the
progress in deploying these approaches on web-scale has been been hampered by
the compu... | computer science |
14,781 | The Manifold of Human Emotions | cs.CL | Sentiment analysis predicts the presence of positive or negative emotions in
a text document. In this paper, we consider higher dimensional extensions of
the sentiment concept, which represent a richer set of human emotions. Our
approach goes beyond previous work in that our model contains a continuous
manifold rather ... | computer science |
14,782 | Joint Space Neural Probabilistic Language Model for Statistical Machine
Translation | cs.CL | A neural probabilistic language model (NPLM) provides an idea to achieve the
better perplexity than n-gram language model and their smoothed language
models. This paper investigates application area in bilingual NLP, specifically
Statistical Machine Translation (SMT). We focus on the perspectives that NPLM
has potentia... | computer science |
14,783 | Efficient Estimation of Word Representations in Vector Space | cs.CL | We propose two novel model architectures for computing continuous vector
representations of words from very large data sets. The quality of these
representations is measured in a word similarity task, and the results are
compared to the previously best performing techniques based on different types
of neural networks. ... | computer science |
14,784 | Language learning from positive evidence, reconsidered: A
simplicity-based approach | cs.CL | Children learn their native language by exposure to their linguistic and
communicative environment, but apparently without requiring that their mistakes
are corrected. Such learning from positive evidence has been viewed as raising
logical problems for language acquisition. In particular, without correction,
how is the... | computer science |
14,785 | Extension of hidden markov model for recognizing large vocabulary of
sign language | cs.CL | Computers still have a long way to go before they can interact with users in
a truly natural fashion. From a users perspective, the most natural way to
interact with a computer would be through a speech and gesture interface.
Although speech recognition has made significant advances in the past ten
years, gesture recog... | computer science |
14,786 | Sentiment Analysis : A Literature Survey | cs.CL | Our day-to-day life has always been influenced by what people think. Ideas
and opinions of others have always affected our own opinions. The explosion of
Web 2.0 has led to increased activity in Podcasting, Blogging, Tagging,
Contributing to RSS, Social Bookmarking, and Social Networking. As a result
there has been an ... | computer science |
14,787 | Dealing with natural language interfaces in a geolocation context | cs.CL | In the geolocation field where high-level programs and low-level devices
coexist, it is often difficult to find a friendly user inter- face to configure
all the parameters. The challenge addressed in this paper is to propose
intuitive and simple, thus natural lan- guage interfaces to interact with
low-level devices. Su... | computer science |
14,788 | An Improved Approach for Word Ambiguity Removal | cs.CL | Word ambiguity removal is a task of removing ambiguity from a word, i.e.
correct sense of word is identified from ambiguous sentences. This paper
describes a model that uses Part of Speech tagger and three categories for word
sense disambiguation (WSD). Human Computer Interaction is very needful to
improve interactions... | computer science |
14,789 | TimeML-strict: clarifying temporal annotation | cs.CL | TimeML is an XML-based schema for annotating temporal information over
discourse. The standard has been used to annotate a variety of resources and is
followed by a number of tools, the creation of which constitute hundreds of
thousands of man-hours of research work. However, the current state of
resources is such that... | computer science |
14,790 | ManTIME: Temporal expression identification and normalization in the
TempEval-3 challenge | cs.CL | This paper describes a temporal expression identification and normalization
system, ManTIME, developed for the TempEval-3 challenge. The identification
phase combines the use of conditional random fields along with a
post-processing identification pipeline, whereas the normalization phase is
carried out using NorMA, an... | computer science |
14,791 | A framework for (under)specifying dependency syntax without overloading
annotators | cs.CL | We introduce a framework for lightweight dependency syntax annotation. Our
formalism builds upon the typical representation for unlabeled dependencies,
permitting a simple notation and annotation workflow. Moreover, the formalism
encourages annotators to underspecify parts of the syntax if doing so would
streamline the... | computer science |
14,792 | "Not not bad" is not "bad": A distributional account of negation | cs.CL | With the increasing empirical success of distributional models of
compositional semantics, it is timely to consider the types of textual logic
that such models are capable of capturing. In this paper, we address
shortcomings in the ability of current models to capture logical operations
such as negation. As a solution ... | computer science |
14,793 | Recurrent Convolutional Neural Networks for Discourse Compositionality | cs.CL | The compositionality of meaning extends beyond the single sentence. Just as
words combine to form the meaning of sentences, so do sentences combine to form
the meaning of paragraphs, dialogues and general discourse. We introduce both a
sentence model and a discourse model corresponding to the two levels of
compositiona... | computer science |
14,794 | Dialogue System: A Brief Review | cs.CL | A Dialogue System is a system which interacts with human in natural language.
At present many universities are developing the dialogue system in their
regional language. This paper will discuss about dialogue system, its
components, challenges and its evaluation. This paper helps the researchers for
getting info regard... | computer science |
14,795 | Competency Tracking for English as a Second or Foreign Language Learners | cs.CL | My system utilizes the outcomes feature found in Moodle and other learning
content management systems (LCMSs) to keep track of where students are in terms
of what language competencies they have mastered and the competencies they need
to get where they want to go. These competencies are based on the Common
European Fra... | computer science |
14,796 | On the role of autocorrelations in texts | cs.CL | The task of finding a criterion allowing to distinguish a text from an
arbitrary set of words is rather relevant in itself, for instance, in the
aspect of development of means for internet-content indexing or separating
signals and noise in communication channels. The Zipf law is currently
considered to be the most rel... | computer science |
14,797 | On the fractal nature of mutual relevance sequences in the Internet news
message flows | cs.CL | In the task of information retrieval the term relevance is taken to mean
formal conformity of a document given by the retrieval system to user's
information query. As a rule, the documents found by the retrieval system
should be submitted to the user in a certain order. Therefore, a retrieval
perceived as a selection o... | computer science |
14,798 | Generating models for temporal representations | cs.CL | We discuss the use of model building for temporal representations. We chose
Polish to illustrate our discussion because it has an interesting aspectual
system, but the points we wish to make are not language specific. Rather, our
goal is to develop theoretical and computational tools for temporal model
building tasks i... | computer science |
14,799 | Using Description Logics for Recognising Textual Entailment | cs.CL | The aim of this paper is to show how we can handle the Recognising Textual
Entailment (RTE) task by using Description Logics (DLs). To do this, we propose
a representation of natural language semantics in DLs inspired by existing
representations in first-order logic. But our most significant contribution is
the definit... | computer science |
14,800 | Some Reflections on the Task of Content Determination in the Context of
Multi-Document Summarization of Evolving Events | cs.CL | Despite its importance, the task of summarizing evolving events has received
small attention by researchers in the field of multi-document summariztion. In
a previous paper (Afantenos et al. 2007) we have presented a methodology for
the automatic summarization of documents, emitted by multiple sources, which
describe t... | computer science |
14,801 | Distribution of complexities in the Vai script | cs.CL | In the paper, we analyze the distribution of complexities in the Vai script,
an indigenous syllabic writing system from Liberia. It is found that the
uniformity hypothesis for complexities fails for this script. The models using
Poisson distribution for the number of components and hyper-Poisson
distribution for connec... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.