Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
14,602 | Annotating Predicate-Argument Structure for a Parallel Treebank | cs.CL | We report on a recently initiated project which aims at building a
multi-layered parallel treebank of English and German. Particular attention is
devoted to a dedicated predicate-argument layer which is used for aligning
translationally equivalent sentences of the two languages. We describe both our
conceptual decision... | computer science |
14,603 | Statistical Machine Translation by Generalized Parsing | cs.CL | Designers of statistical machine translation (SMT) systems have begun to
employ tree-structured translation models. Systems involving tree-structured
translation models tend to be complex. This article aims to reduce the
conceptual complexity of such systems, in order to make them easier to design,
implement, debug, us... | computer science |
14,604 | Summarizing Encyclopedic Term Descriptions on the Web | cs.CL | We are developing an automatic method to compile an encyclopedic corpus from
the Web. In our previous work, paragraph-style descriptions for a term are
extracted from Web pages and organized based on domains. However, these
descriptions are independent and do not comprise a condensed text as in
hand-crafted encyclopedi... | computer science |
14,605 | Unsupervised Topic Adaptation for Lecture Speech Retrieval | cs.CL | We are developing a cross-media information retrieval system, in which users
can view specific segments of lecture videos by submitting text queries. To
produce a text index, the audio track is extracted from a lecture video and a
transcription is generated by automatic speech recognition. In this paper, to
improve the... | computer science |
14,606 | Effects of Language Modeling on Speech-driven Question Answering | cs.CL | We integrate automatic speech recognition (ASR) and question answering (QA)
to realize a speech-driven QA system, and evaluate its performance. We adapt an
N-gram language model to natural language questions, so that the input of our
system can be recognized with a high accuracy. We target WH-questions which
consist of... | computer science |
14,607 | A Bimachine Compiler for Ranked Tagging Rules | cs.CL | This paper describes a novel method of compiling ranked tagging rules into a
deterministic finite-state device called a bimachine. The rules are formulated
in the framework of regular rewrite operations and allow unrestricted regular
expressions in both left and right rule contexts. The compiler is illustrated
by an ap... | computer science |
14,608 | Application of the Double Metaphone Algorithm to Amharic Orthography | cs.CL | The Metaphone algorithm applies the phonetic encoding of orthographic
sequences to simplify words prior to comparison. While Metaphone has been
highly successful for the English language, for which it was designed, it may
not be applied directly to Ethiopian languages. The paper details how the
principles of Metaphone ... | computer science |
14,609 | Proofing Tools Technology at Neurosoft S.A. | cs.CL | The aim of this paper is to present the R&D activities carried out at
Neurosoft S.A. regarding the development of proofing tools for Modern Greek.
Firstly, we focus on infrastructure issues that we faced during our initial
steps. Subsequently, we describe the most important insights of three proofing
tools developed by... | computer science |
14,610 | Verbal chunk extraction in French using limited resources | cs.CL | A way of extracting French verbal chunks, inflected and infinitive, is
explored and tested on effective corpus. Declarative morphological and local
grammar rules specifying chunks and some simple contextual structures are used,
relying on limited lexical information and some simple heuristic/statistic
properties obtain... | computer science |
14,611 | An electronic dictionary as a basis for NLP tools: The Greek case | cs.CL | The existence of a Dictionary in electronic form for Modern Greek (MG) is
mandatory if one is to process MG at the morphological and syntactic levels
since MG is a highly inflectional language with marked stress and a spelling
system with many characteristics carried over from Ancient Greek. Moreover,
such a tool becom... | computer science |
14,612 | A Model for Fine-Grained Alignment of Multilingual Texts | cs.CL | While alignment of texts on the sentential level is often seen as being too
coarse, and word alignment as being too fine-grained, bi- or multilingual texts
which are aligned on a level in-between are a useful resource for many
purposes. Starting from a number of examples of non-literal translations, which
tend to make ... | computer science |
14,613 | A Sentimental Education: Sentiment Analysis Using Subjectivity
Summarization Based on Minimum Cuts | cs.CL | Sentiment analysis seeks to identify the viewpoint(s) underlying a text span;
an example application is classifying a movie review as "thumbs up" or "thumbs
down". To determine this sentiment polarity, we propose a novel
machine-learning method that applies text-categorization techniques to just the
subjective portions... | computer science |
14,614 | A Tutorial on the Expectation-Maximization Algorithm Including
Maximum-Likelihood Estimation and EM Training of Probabilistic Context-Free
Grammars | cs.CL | The paper gives a brief review of the expectation-maximization algorithm
(Dempster 1977) in the comprehensible framework of discrete mathematics. In
Section 2, two prominent estimation methods, the relative-frequency estimation
and the maximum-likelihood estimation are presented. Section 3 is dedicated to
the expectati... | computer science |
14,615 | Inside-Outside Estimation Meets Dynamic EM | cs.CL | We briefly review the inside-outside and EM algorithm for probabilistic
context-free grammars. As a result, we formally prove that inside-outside
estimation is a dynamic-programming variant of EM. This is interesting in its
own right, but even more when considered in a theoretical context since the
well-known convergen... | computer science |
14,616 | State of the Art, Evaluation and Recommendations regarding "Document
Processing and Visualization Techniques" | cs.CL | Several Networks of Excellence have been set up in the framework of the
European FP5 research program. Among these Networks of Excellence, the NEMIS
project focuses on the field of Text Mining.
Within this field, document processing and visualization was identified as
one of the key topics and the WG1 working group w... | computer science |
14,617 | Thematic Annotation: extracting concepts out of documents | cs.CL | Contrarily to standard approaches to topic annotation, the technique used in
this work does not centrally rely on some sort of -- possibly statistical --
keyword extraction. In fact, the proposed annotation algorithm uses a large
scale semantic database -- the EDR Electronic Dictionary -- that provides a
concept hierar... | computer science |
14,618 | Multi-document Biography Summarization | cs.CL | In this paper we describe a biography summarization system using sentence
classification and ideas from information retrieval. Although the individual
techniques are not new, assembling and applying them to generate multi-document
biographies is new. Our system was evaluated in DUC2004. It is among the top
performers i... | computer science |
14,619 | A Matter of Opinion: Sentiment Analysis and Business Intelligence
(position paper) | cs.CL | A general-audience introduction to the area of "sentiment analysis", the
computational treatment of subjective, opinion-oriented language (an example
application is determining whether a review is "thumbs up" or "thumbs down").
Some challenges, applications to business-intelligence tasks, and potential
future direction... | computer science |
14,620 | Word sense disambiguation criteria: a systematic study | cs.CL | This article describes the results of a systematic in-depth study of the
criteria used for word sense disambiguation. Our study is based on 60 target
words: 20 nouns, 20 adjectives and 20 verbs. Our results are not always in line
with some practices in the field. For example, we show that omitting
non-content words dec... | computer science |
14,621 | Using phonetic constraints in acoustic-to-articulatory inversion | cs.CL | The goal of this work is to recover articulatory information from the speech
signal by acoustic-to-articulatory inversion. One of the main difficulties with
inversion is that the problem is underdetermined and inversion methods
generally offer no guarantee on the phonetical realism of the inverse
solutions. A way to ad... | computer science |
14,622 | An elitist approach for extracting automatically well-realized speech
sounds with high confidence | cs.CL | This paper presents an "elitist approach" for extracting automatically
well-realized speech sounds with high confidence. The elitist approach uses a
speech recognition system based on Hidden Markov Models (HMM). The HMM are
trained on speech sounds which are systematically well-detected in an iterative
procedure. The r... | computer science |
14,623 | Statistical Parameters of the Novel "Perekhresni stezhky" ("The
Cross-Paths") by Ivan Franko | cs.CL | In the paper, a complex statistical characteristics of a Ukrainian novel is
given for the first time. The distribution of word-forms with respect to their
size is studied. The linguistic laws by Zipf-Mandelbrot and Altmann-Menzerath
are analyzed. | computer science |
14,624 | Analyzing language development from a network approach | cs.CL | In this paper we propose some new measures of language development using
network analyses, which is inspired by the recent surge of interests in network
studies of many real-world systems. Children's and care-takers' speech data
from a longitudinal study are represented as a series of networks, word forms
being taken a... | computer science |
14,625 | Unification of multi-lingual scientific terminological resources using
the ISO 16642 standard. The TermSciences initiative | cs.CL | This paper presents the TermSciences portal, which deals with the
implementation of a conceptual model that uses the recent ISO 16642 standard
(Terminological Markup Framework). This standard turns out to be suitable for
concept modeling since it allowed for organizing the original resources by
concepts and to associat... | computer science |
14,626 | Foundations of Modern Language Resource Archives | cs.CL | A number of serious reasons will convince an increasing amount of researchers
to store their relevant material in centers which we will call "language
resource archives". They combine the duty of taking care of long-term
preservation as well as the task to give access to their material to different
user groups. Access ... | computer science |
14,627 | Building a resource for studying translation shifts | cs.CL | This paper describes an interdisciplinary approach which brings together the
fields of corpus linguistics and translation studies. It presents ongoing work
on the creation of a corpus resource in which translation shifts are explicitly
annotated. Translation shifts denote departures from formal correspondence
between s... | computer science |
14,628 | Raisonner avec des diagrammes : perspectives cognitives et
computationnelles | cs.CL | Diagrammatic, analogical or iconic representations are often contrasted with
linguistic or logical representations, in which the shape of the symbols is
arbitrary. The aim of this paper is to make a case for the usefulness of
diagrams in inferential knowledge representation systems. Although commonly
used, diagrams hav... | computer science |
14,629 | Improving Term Extraction with Terminological Resources | cs.CL | Studies of different term extractors on a corpus of the biomedical domain
revealed decreasing performances when applied to highly technical texts. The
difficulty or impossibility of customising them to new domains is an additional
limitation. In this paper, we propose to use external terminologies to
influence generic ... | computer science |
14,630 | Challenging the principle of compositionality in interpreting natural
language texts | cs.CL | The paper aims at emphasizing that, even relaxed, the hypothesis of
compositionality has to face many problems when used for interpreting natural
language texts. Rather than fixing these problems within the compositional
framework, we believe that a more radical change is necessary, and propose
another approach. | computer science |
14,631 | The role of time in considering collections | cs.CL | The paper concerns the understanding of plurals in the framework of
Artificial Intelligence and emphasizes the role of time. The construction of
collection(s) and their evolution across time is often crucial and has to be
accounted for. The paper contrasts a "de dicto" collection where the collection
can be considered ... | computer science |
14,632 | The JRC-Acquis: A multilingual aligned parallel corpus with 20+
languages | cs.CL | We present a new, unique and freely available parallel corpus containing
European Union (EU) documents of mostly legal nature. It is available in all 20
official EUanguages, with additional documents being available in the languages
of the EU candidate countries. The corpus consists of almost 8,000 documents
per langua... | computer science |
14,633 | Un modèle générique d'organisation de corpus en ligne: application
à la FReeBank | cs.CL | The few available French resources for evaluating linguistic models or
algorithms on other linguistic levels than morpho-syntax are either
insufficient from quantitative as well as qualitative point of view or not
freely accessible. Based on this fact, the FREEBANK project intends to create
French corpora constructed u... | computer science |
14,634 | Scaling Construction Grammar up to Production Systems: the SCIM | cs.CL | While a great effort has concerned the development of fully integrated
modular understanding systems, few researches have focused on the problem of
unifying existing linguistic formalisms with cognitive processing models. The
Situated Constructional Interpretation Model is one of these attempts. In this
model, the noti... | computer science |
14,635 | An Anthological Review of Research Utilizing MontyLingua, a Python-Based
End-to-End Text Processor | cs.CL | MontyLingua, an integral part of ConceptNet which is currently the largest
commonsense knowledge base, is an English text processor developed using Python
programming language in MIT Media Lab. The main feature of MontyLingua is the
coverage for all aspects of English text processing from raw input text to
semantic mea... | computer science |
14,636 | Complex networks and human language | cs.CL | This paper introduces how human languages can be studied in light of recent
development of network theories. There are two directions of exploration. One
is to study networks existing in the language system. Various lexical networks
can be built based on different relationships between words, being semantic or
syntacti... | computer science |
14,637 | A Note on Local Ultrametricity in Text | cs.CL | High dimensional, sparsely populated data spaces have been characterized in
terms of ultrametric topology. This implies that there are natural, not
necessarily unique, tree or hierarchy structures defined by the ultrametric
topology. In this note we study the extent of local ultrametric topology in
texts, with the aim ... | computer science |
14,638 | Menzerath-Altmann Law for Syntactic Structures in Ukrainian | cs.CL | In the paper, the definition of clause suitable for an automated processing
of a Ukrainian text is proposed. The Menzerath-Altmann law is verified on the
sentence level and the parameters for the dependences of the clause length
counted in words and syllables on the sentence length counted in clauses are
calculated for... | computer science |
14,639 | Random Sentences from a Generalized Phrase-Structure Grammar Interpreter | cs.CL | In numerous domains in cognitive science it is often useful to have a source
for randomly generated corpora. These corpora may serve as a foundation for
artificial stimuli in a learning experiment (e.g., Ellefson & Christiansen,
2000), or as input into computational models (e.g., Christiansen & Dale, 2001).
The followi... | computer science |
14,640 | International Standard for a Linguistic Annotation Framework | cs.CL | This paper describes the Linguistic Annotation Framework under development
within ISO TC37 SC4 WG1. The Linguistic Annotation Framework is intended to
serve as a basis for harmonizing existing language resources as well as
developing new ones. | computer science |
14,641 | A Formal Model of Dictionary Structure and Content | cs.CL | We show that a general model of lexical information conforms to an abstract
model that reflects the hierarchy of information found in a typical dictionary
entry. We show that this model can be mapped into a well-formed XML document,
and how the XSL transformation language can be used to implement a semantics
defined ov... | computer science |
14,642 | Learning Phonotactics Using ILP | cs.CL | This paper describes experiments on learning Dutch phonotactic rules using
Inductive Logic Programming, a machine learning discipline based on inductive
logical operators. Two different ways of approaching the problem are
experimented with, and compared against each other as well as with related work
on the task. The r... | computer science |
14,643 | Bootstrapping Deep Lexical Resources: Resources for Courses | cs.CL | We propose a range of deep lexical acquisition methods which make use of
morphological, syntactic and ontological language resources to model word
similarity and bootstrap from a seed lexicon. The different methods are
deployed in learning lexical items for a precision grammar, and shown to each
have strengths and weak... | computer science |
14,644 | Framework and Resources for Natural Language Parser Evaluation | cs.CL | Because of the wide variety of contemporary practices used in the automatic
syntactic parsing of natural languages, it has become necessary to analyze and
evaluate the strengths and weaknesses of different approaches. This research is
all the more necessary because there are currently no genre- and
domain-independent p... | computer science |
14,645 | Robustness Evaluation of Two CCG, a PCFG and a Link Grammar Parsers | cs.CL | Robustness in a parser refers to an ability to deal with exceptional
phenomena. A parser is robust if it deals with phenomena outside its normal
range of inputs. This paper reports on a series of robustness evaluations of
state-of-the-art parsers in which we concentrated on one aspect of robustness:
its ability to pars... | computer science |
14,646 | Methods to integrate a language model with semantic information for a
word prediction component | cs.CL | Most current word prediction systems make use of n-gram language models (LM)
to estimate the probability of the following word in a phrase. In the past
years there have been many attempts to enrich such language models with further
syntactic or semantic information. We want to explore the predictive powers of
Latent Se... | computer science |
14,647 | Some properties of the Ukrainian writing system | cs.CL | We investigate the grapheme-phoneme relation in Ukrainian and some properties
of the Ukrainian version of the Cyrillic alphabet. | computer science |
14,648 | Effects of High-Order Co-occurrences on Word Semantic Similarities | cs.CL | A computational model of the construction of word meaning through exposure to
texts is built in order to simulate the effects of co-occurrence values on word
semantic similarities, paragraph by paragraph. Semantic similarity is here
viewed as association. It turns out that the similarity between two words W1
and W2 str... | computer science |
14,649 | Feature Unification in TAG Derivation Trees | cs.CL | The derivation trees of a tree adjoining grammar provide a first insight into
the sentence semantics, and are thus prime targets for generation systems. We
define a formalism, feature-based regular tree grammars, and a translation from
feature based tree adjoining grammars into this new formalism. The translation
prese... | computer science |
14,650 | Graph Algorithms for Improving Type-Logical Proof Search | cs.CL | Proof nets are a graph theoretical representation of proofs in various
fragments of type-logical grammar. In spite of this basis in graph theory,
there has been relatively little attention to the use of graph theoretic
algorithms for type-logical proof search. In this paper we will look at several
ways in which standar... | computer science |
14,651 | A toolkit for a generative lexicon | cs.CL | In this paper we describe the conception of a software toolkit designed for
the construction, maintenance and collaborative use of a Generative Lexicon. In
order to ease its portability and spreading use, this tool was built with free
and open source products. We eventually tested the toolkit and showed it
filters the ... | computer science |
14,652 | Computational Representation of Linguistic Structures using
Domain-Specific Languages | cs.CL | We describe a modular system for generating sentences from formal definitions
of underlying linguistic structures using domain-specific languages. The system
uses Java in general, Prolog for lexical entries and custom domain-specific
languages based on Functional Grammar and Functional Discourse Grammar
notation, imple... | computer science |
14,653 | Exploring a type-theoretic approach to accessibility constraint
modelling | cs.CL | The type-theoretic modelling of DRT that [degroote06] proposed features
continuations for the management of the context in which a clause has to be
interpreted. This approach, while keeping the standard definitions of
quantifier scope, translates the rules of the accessibility constraints of
discourse referents inside ... | computer science |
14,654 | A semantic space for modeling children's semantic memory | cs.CL | The goal of this paper is to present a model of children's semantic memory,
which is based on a corpus reproducing the kinds of texts children are exposed
to. After presenting the literature in the development of the semantic memory,
a preliminary French corpus of 3.2 million words is described. Similarities in
the res... | computer science |
14,655 | Textual Entailment Recognizing by Theorem Proving Approach | cs.CL | In this paper we present two original methods for recognizing textual
inference. First one is a modified resolution method such that some linguistic
considerations are introduced in the unification of two atoms. The approach is
possible due to the recent methods of transforming texts in logic formulas.
Second one is ba... | computer science |
14,656 | A chain dictionary method for Word Sense Disambiguation and applications | cs.CL | A large class of unsupervised algorithms for Word Sense Disambiguation (WSD)
is that of dictionary-based methods. Various algorithms have as the root Lesk's
algorithm, which exploits the sense definitions in the dictionary directly. Our
approach uses the lexical base WordNet for a new algorithm originated in
Lesk's, na... | computer science |
14,657 | Computational Approaches to Measuring the Similarity of Short Contexts :
A Review of Applications and Methods | cs.CL | Measuring the similarity of short written contexts is a fundamental problem
in Natural Language Processing. This article provides a unifying framework by
which short context problems can be categorized both by their intended
application and proposed solution. The goal is to show that various problems
and methodologies ... | computer science |
14,658 | About the creation of a parallel bilingual corpora of web-publications | cs.CL | The algorithm of the creation texts parallel corpora was presented. The
algorithm is based on the use of "key words" in text documents, and on the
means of their automated translation. Key words were singled out by means of
using Russian and Ukrainian morphological dictionaries, as well as dictionaries
of the translati... | computer science |
14,659 | TuLiPA: Towards a Multi-Formalism Parsing Environment for Grammar
Engineering | cs.CL | In this paper, we present an open-source parsing environment (Tuebingen
Linguistic Parsing Architecture, TuLiPA) which uses Range Concatenation Grammar
(RCG) as a pivot formalism, thus opening the way to the parsing of several
mildly context-sensitive formalisms. This environment currently supports
tree-based grammars ... | computer science |
14,660 | Using descriptive mark-up to formalize translation quality assessment | cs.CL | The paper deals with using descriptive mark-up to emphasize translation
mistakes. The author postulates the necessity to develop a standard and formal
XML-based way of describing translation mistakes. It is considered to be
important for achieving impersonal translation quality assessment. Marked-up
translations can be... | computer science |
14,661 | UNL-French deconversion as transfer & generation from an interlingua
with possible quality enhancement through offline human interaction | cs.CL | We present the architecture of the UNL-French deconverter, which "generates"
from the UNL interlingua by first"localizing" the UNL form for French, within
UNL, and then applying slightly adapted but classical transfer and generation
techniques, implemented in GETA's Ariane-G5 environment, supplemented by some
UNL-speci... | computer science |
14,662 | The Application of Fuzzy Logic to Collocation Extraction | cs.CL | Collocations are important for many tasks of Natural language processing such
as information retrieval, machine translation, computational lexicography etc.
So far many statistical methods have been used for collocation extraction.
Almost all the methods form a classical crisp set of collocation. We propose a
fuzzy log... | computer science |
14,663 | Statistical analysis of the Indus script using $n$-grams | cs.CL | The Indus script is one of the major undeciphered scripts of the ancient
world. The small size of the corpus, the absence of bilingual texts, and the
lack of definite knowledge of the underlying language has frustrated efforts at
decipherment since the discovery of the remains of the Indus civilisation.
Recently, some ... | computer science |
14,664 | Google distance between words | cs.CL | Cilibrasi and Vitanyi have demonstrated that it is possible to extract the
meaning of words from the world-wide web. To achieve this, they rely on the
number of webpages that are found through a Google search containing a given
word and they associate the page count to the probability that the word appears
on a webpage... | computer science |
14,665 | New Confidence Measures for Statistical Machine Translation | cs.CL | A confidence measure is able to estimate the reliability of an hypothesis
provided by a machine translation system. The problem of confidence measure can
be seen as a process of testing : we want to decide whether the most probable
sequence of words provided by the machine translation system is correct or not.
In the f... | computer science |
14,666 | What's in a Message? | cs.CL | In this paper we present the first step in a larger series of experiments for
the induction of predicate/argument structures. The structures that we are
inducing are very similar to the conceptual structures that are used in Frame
Semantics (such as FrameNet). Those structures are called messages and they
were previous... | computer science |
14,667 | Syntactic variation of support verb constructions | cs.CL | We report experiments about the syntactic variations of support verb
constructions, a special type of multiword expressions (MWEs) containing
predicative nouns. In these expressions, the noun can occur with or without the
verb, with no clear-cut semantic difference. We extracted from a large French
corpus a set of exam... | computer science |
14,668 | Acquisition of morphological families and derivational series from a
machine readable dictionary | cs.CL | The paper presents a linguistic and computational model aiming at making the
morphological structure of the lexicon emerge from the formal and semantic
regularities of the words it contains. The model is word-based. The proposed
morphological structure consists of (1) binary relations that connect each
headword with wo... | computer science |
14,669 | Multiple Retrieval Models and Regression Models for Prior Art Search | cs.CL | This paper presents the system called PATATRAS (PATent and Article Tracking,
Retrieval and AnalysiS) realized for the IP track of CLEF 2009. Our approach
presents three main characteristics: 1. The usage of multiple retrieval models
(KL, Okapi) and term index definitions (lemma, phrase, concept) for the three
languages... | computer science |
14,670 | An OLAC Extension for Dravidian Languages | cs.CL | OLAC was founded in 2000 for creating online databases of language resources.
This paper intends to review the bottom-up distributed character of the project
and proposes an extension of the architecture for Dravidian languages. An
ontological structure is considered for effective natural language processing
(NLP) and ... | computer science |
14,671 | A New Computational Schema for Euphonic Conjunctions in Sanskrit
Processing | cs.CL | Automated language processing is central to the drive to enable facilitated
referencing of increasingly available Sanskrit E texts. The first step towards
processing Sanskrit text involves the handling of Sanskrit compound words that
are an integral part of Sanskrit texts. This firstly necessitates the
processing of eu... | computer science |
14,672 | ANN-based Innovative Segmentation Method for Handwritten text in
Assamese | cs.CL | Artificial Neural Network (ANN) s has widely been used for recognition of
optically scanned character, which partially emulates human thinking in the
domain of the Artificial Intelligence. But prior to recognition, it is
necessary to segment the character from the text to sentences, words etc.
Segmentation of words int... | computer science |
14,673 | A Discourse-based Approach in Text-based Machine Translation | cs.CL | This paper presents a theoretical research based approach to ellipsis
resolution in machine translation. The formula of discourse is applied in order
to resolve ellipses. The validity of the discourse formula is analyzed by
applying it to the real world text, i.e., newspaper fragments. The source text
is converted into... | computer science |
14,674 | Resolution of Unidentified Words in Machine Translation | cs.CL | This paper presents a mechanism of resolving unidentified lexical units in
Text-based Machine Translation (TBMT). In a Machine Translation (MT) system it
is unlikely to have a complete lexicon and hence there is intense need of a new
mechanism to handle the problem of unidentified words. These unknown words
could be ab... | computer science |
14,675 | Standards for Language Resources | cs.CL | The goal of this paper is two-fold: to present an abstract data model for
linguistic annotations and its implementation using XML, RDF and related
standards; and to outline the work of a newly formed committee of the
International Standards Organization (ISO), ISO/TC 37/SC 4 Language Resource
Management, which will use... | computer science |
14,676 | A New Look at the Classical Entropy of Written English | cs.CL | A simple method for finding the entropy and redundancy of a reasonable long
sample of English text by direct computer processing and from first principles
according to Shannon theory is presented. As an example, results on the entropy
of the English language have been obtained based on a total of 20.3 million
character... | computer science |
14,677 | Standardization of the formal representation of lexical information for
NLP | cs.CL | A survey of dictionary models and formats is presented as well as a
presentation of corresponding recent standardisation activities. | computer science |
14,678 | Parsing of part-of-speech tagged Assamese Texts | cs.CL | A natural language (or ordinary language) is a language that is spoken,
written, or signed by humans for general-purpose communication, as
distinguished from formal languages (such as computer-programming languages or
the "languages" used in the study of formal logic). The computational
activities required for enabling... | computer science |
14,679 | Representing human and machine dictionaries in Markup languages | cs.CL | In this chapter we present the main issues in representing machine readable
dictionaries in XML, and in particular according to the Text Encoding
Dictionary (TEI) guidelines. | computer science |
14,680 | Étude et traitement automatique de l'anglais du XVIIe siècle :
outils morphosyntaxiques et dictionnaires | cs.CL | In this article, we record the main linguistic differences or singularities
of 17th century English, analyse them morphologically and syntactically and
propose equivalent forms in contemporary English. We show how 17th century
texts may be transcribed into modern English, combining the use of electronic
dictionaries wi... | computer science |
14,681 | "Mind your p's and q's": or the peregrinations of an apostrophe in 17th
Century English | cs.CL | If the use of the apostrophe in contemporary English often marks the Saxon
genitive, it may also indicate the omission of one or more let-ters. Some
writers (wrongly?) use it to mark the plural in symbols or abbreviations,
visual-ised thanks to the isolation of the morpheme "s". This punctuation mark
was imported from ... | computer science |
14,682 | Recognition and translation Arabic-French of Named Entities: case of the
Sport places | cs.CL | The recognition of Arabic Named Entities (NE) is a problem in different
domains of Natural Language Processing (NLP) like automatic translation.
Indeed, NE translation allows the access to multilingual in-formation. This
translation doesn't always lead to expected result especially when NE contains
a person name. For t... | computer science |
14,683 | Morphological study of Albanian words, and processing with NooJ | cs.CL | We are developing electronic dictionaries and transducers for the automatic
processing of the Albanian Language. We will analyze the words inside a linear
segment of text. We will also study the relationship between units of sense and
units of form. The composition of words takes different forms in Albanian. We
have fo... | computer science |
14,684 | Approximations to the MMI criterion and their effect on lattice-based
MMI | cs.CL | Maximum mutual information (MMI) is a model selection criterion used for
hidden Markov model (HMM) parameter estimation that was developed more than
twenty years ago as a discriminative alternative to the maximum likelihood
criterion for HMM-based speech recognition. It has been shown in the speech
recognition literatu... | computer science |
14,685 | On Event Structure in the Torn Dress | cs.CL | Using Pustejovsky's "The Syntax of Event Structure" and Fong's "On Mending a
Torn Dress" we give a glimpse of a Pustejovsky-like analysis to some example
sentences in Fong. We attempt to give a framework for semantics to the noun
phrases and adverbs as appropriate as well as the lexical entries for all words
in the exa... | computer science |
14,686 | Towards a Heuristic Categorization of Prepositional Phrases in English
with WordNet | cs.CL | This document discusses an approach and its rudimentary realization towards
automatic classification of PPs; the topic, that has not received as much
attention in NLP as NPs and VPs. The approach is a rule-based heuristics
outlined in several levels of our research. There are 7 semantic categories of
PPs considered in ... | computer science |
14,687 | Thai Rhetorical Structure Analysis | cs.CL | Rhetorical structure analysis (RSA) explores discourse relations among
elementary discourse units (EDUs) in a text. It is very useful in many text
processing tasks employing relationships among EDUs such as text understanding,
summarization, and question-answering. Thai language with its distinctive
linguistic characte... | computer science |
14,688 | Co-channel Interference Cancellation for Space-Time Coded OFDM Systems
Using Adaptive Beamforming and Null Deepening | cs.CL | Combined with space-time coding, the orthogonal frequency division
multiplexing (OFDM) system explores space diversity. It is a potential scheme
to offer spectral efficiency and robust high data rate transmissions over
frequency-selective fading channel. However, space-time coding impairs the
system ability to suppress... | computer science |
14,689 | SLAM : Solutions lexicales automatique pour métaphores | cs.CL | This article presents SLAM, an Automatic Solver for Lexical Metaphors like
?d\'eshabiller* une pomme? (to undress* an apple). SLAM calculates a
conventional solution for these productions. To carry on it, SLAM has to
intersect the paradigmatic axis of the metaphorical verb ?d\'eshabiller*?,
where ?peler? (?to peel?) co... | computer science |
14,690 | Displacement Calculus | cs.CL | The Lambek calculus provides a foundation for categorial grammar in the form
of a logic of concatenation. But natural language is characterized by
dependencies which may also be discontinuous. In this paper we introduce the
displacement calculus, a generalization of Lambek calculus, which preserves its
good proof-theor... | computer science |
14,691 | Morphonette: a morphological network of French | cs.CL | This paper describes in details the first version of Morphonette, a new
French morphological resource and a new radically lexeme-based method of
morphological analysis. This research is grounded in a paradigmatic conception
of derivational morphology where the morphological structure is a structure of
the entire lexico... | computer science |
14,692 | The Lambek-Grishin calculus is NP-complete | cs.CL | The Lambek-Grishin calculus LG is the symmetric extension of the
non-associative Lambek calculus NL. In this paper we prove that the
derivability problem for LG is NP-complete. | computer science |
14,693 | Quantitative parametrization of texts written by Ivan Franko: An attempt
of the project | cs.CL | In the article, the project of quantitative parametrization of all texts by
Ivan Franko is manifested. It can be made only by using modern computer
techniques after the frequency dictionaries for all Franko's works are
compiled. The paper describes the application spheres, methodology, stages,
principles and peculiarit... | computer science |
14,694 | A generic tool to generate a lexicon for NLP from Lexicon-Grammar tables | cs.CL | Lexicon-Grammar tables constitute a large-coverage syntactic lexicon but they
cannot be directly used in Natural Language Processing (NLP) applications
because they sometimes rely on implicit information. In this paper, we
introduce LGExtract, a generic tool for generating a syntactic lexicon for NLP
from the Lexicon-G... | computer science |
14,695 | Ivan Franko's novel Dlja domashnjoho ohnyshcha (For the Hearth) in the
light of the frequency dictionary | cs.CL | In the article, the methodology and the principles of the compilation of the
Frequency dictionary for Ivan Franko's novel Dlja domashnjoho ohnyshcha (For
the Hearth) are described. The following statistical parameters of the novel
vocabulary are obtained: variety, exclusiveness, concentration indexes,
correlation betwe... | computer science |
14,696 | Offline Arabic Handwriting Recognition Using Artificial Neural Network | cs.CL | The ambition of a character recognition system is to transform a text
document typed on paper into a digital format that can be manipulated by word
processor software Unlike other languages, Arabic has unique features, while
other language doesn't have, from this language these are seven or eight
language such as ordo,... | computer science |
14,697 | Fuzzy Modeling and Natural Language Processing for Panini's Sanskrit
Grammar | cs.CL | Indian languages have long history in World Natural languages. Panini was the
first to define Grammar for Sanskrit language with about 4000 rules in fifth
century. These rules contain uncertainty information. It is not possible to
Computer processing of Sanskrit language with uncertain information. In this
paper, fuzzy... | computer science |
14,698 | Complete Complementary Results Report of the MARF's NLP Approach to the
DEFT 2010 Competition | cs.CL | This companion paper complements the main DEFT'10 article describing the MARF
approach (arXiv:0905.1235) to the DEFT'10 NLP challenge (described at
http://www.groupes.polymtl.ca/taln2010/deft.php in French). This paper is aimed
to present the complete result sets of all the conducted experiments and their
settings in t... | computer science |
14,699 | Testing SDRT's Right Frontier | cs.CL | The Right Frontier Constraint (RFC), as a constraint on the attachment of new
constituents to an existing discourse structure, has important implications for
the interpretation of anaphoric elements in discourse and for Machine Learning
(ML) approaches to learning discourse structures. In this paper we provide
strong e... | computer science |
14,700 | Constructions définitoires des tables du Lexique-Grammaire | cs.CL | Lexicon-Grammar tables are a very rich syntactic lexicon for the French
language. This linguistic database is nevertheless not directly suitable for
use by computer programs, as it is incomplete and lacks consistency. Tables are
defined on the basis of features which are not explicitly recorded in the
lexicon. These fe... | computer science |
14,701 | Tableaux for the Lambek-Grishin calculus | cs.CL | Categorial type logics, pioneered by Lambek, seek a proof-theoretic
understanding of natural language syntax by identifying categories with
formulas and derivations with proofs. We typically observe an intuitionistic
bias: a structural configuration of hypotheses (a constituent) derives a single
conclusion (the categor... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.