Unnamed: 0 int64 0 41k | title stringlengths 4 274 | category stringlengths 5 18 | summary stringlengths 22 3.66k | theme stringclasses 8
values |
|---|---|---|---|---|
14,802 | Une grammaire formelle du créole martiniquais pour la génération
automatique | cs.CL | In this article, some first elements of a computational modelling of the
grammar of the Martiniquese French Creole dialect are presented. The sources of
inspiration for the modelling is the functional description given by Damoiseau
(1984), and Pinalie's & Bernabe's (1999) grammar manual. Based on earlier works
in text ... | computer science |
14,803 | A Layered Grammar Model: Using Tree-Adjoining Grammars to Build a Common
Syntactic Kernel for Related Dialects | cs.CL | This article describes the design of a common syntactic description for the
core grammar of a group of related dialects. The common description does not
rely on an abstract sub-linguistic structure like a metagrammar: it consists in
a single FS-LTAG where the actual specific language is included as one of the
attribute... | computer science |
14,804 | Empowering OLAC Extension using Anusaaraka and Effective text processing
using Double Byte coding | cs.CL | The paper reviews the hurdles while trying to implement the OLAC extension
for Dravidian / Indian languages. The paper further explores the possibilities
which could minimise or solve these problems. In this context, the Chinese
system of text processing and the anusaaraka system are scrutinised. | computer science |
14,805 | Implementation of Rule Based Algorithm for Sandhi-Vicheda Of Compound
Hindi Words | cs.CL | Sandhi means to join two or more words to coin new word. Sandhi literally
means `putting together' or combining (of sounds), It denotes all combinatory
sound-changes effected (spontaneously) for ease of pronunciation.
Sandhi-vicheda describes [5] the process by which one letter (whether single or
cojoined) is broken to... | computer science |
14,806 | Reference Resolution within the Framework of Cognitive Grammar | cs.CL | Following the principles of Cognitive Grammar, we concentrate on a model for
reference resolution that attempts to overcome the difficulties previous
approaches, based on the fundamental assumption that all reference (independent
on the type of the referring expression) is accomplished via access to and
restructuring o... | computer science |
14,807 | Marking-up multiple views of a Text: Discourse and Reference | cs.CL | We describe an encoding scheme for discourse structure and reference, based
on the TEI Guidelines and the recommendations of the Corpus Encoding
Specification (CES). A central feature of the scheme is a CES-based data
architecture enabling the encoding of and access to multiple views of a
marked-up document. We describ... | computer science |
14,808 | A Common XML-based Framework for Syntactic Annotations | cs.CL | It is widely recognized that the proliferation of annotation schemes runs
counter to the need to re-use language resources, and that standards for
linguistic annotation are becoming increasingly mandatory. To answer this need,
we have developed a framework comprised of an abstract model for a variety of
different annot... | computer science |
14,809 | Standards for Language Resources | cs.CL | This paper presents 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 this work as its
starting ... | computer science |
14,810 | Language Models for Handwritten Short Message Services | cs.CL | Handwriting is an alternative method for entering texts composing Short
Message Services. However, a whole new language features the texts which are
produced. They include for instance abbreviations and other consonantal writing
which sprung up for time saving and fashion. We have collected and processed a
significant ... | computer science |
14,811 | Vers la reconnaissance de mini-messages manuscrits | cs.CL | Handwriting is an alternative method for entering texts which composed Short
Message Services. However, a whole new language features the texts which are
produced. They include for instance abbreviations and other consonantal writing
which sprung up for time saving and fashion. We have collected and processed a
signifi... | computer science |
14,812 | Analyse en dépendances à l'aide des grammaires d'interaction | cs.CL | This article proposes a method to extract dependency structures from
phrase-structure level parsing with Interaction Grammars. Interaction Grammars
are a formalism which expresses interactions among words using a polarity
system. Syntactical composition is led by the saturation of polarities.
Interactions take place be... | computer science |
14,813 | Grouping Synonyms by Definitions | cs.CL | We present a method for grouping the synonyms of a lemma according to its
dictionary senses. The senses are defined by a large machine readable
dictionary for French, the TLFi (Tr\'esor de la langue fran\c{c}aise
informatis\'e) and the synonyms are given by 5 synonym dictionaries (also for
French). To evaluate the prop... | computer science |
14,814 | Mathematics, Recursion, and Universals in Human Languages | cs.CL | There are many scientific problems generated by the multiple and conflicting
alternative definitions of linguistic recursion and human recursive processing
that exist in the literature. The purpose of this article is to make available
to the linguistic community the standard mathematical definition of recursion
and to ... | computer science |
14,815 | Towards Multimodal Content Representation | cs.CL | Multimodal interfaces, combining the use of speech, graphics, gestures, and
facial expressions in input and output, promise to provide new possibilities to
deal with information in more effective and efficient ways, supporting for
instance: - the understanding of possibly imprecise, partial or ambiguous
multimodal inpu... | computer science |
14,816 | On the origin of ambiguity in efficient communication | cs.CL | This article studies the emergence of ambiguity in communication through the
concept of logical irreversibility and within the framework of Shannon's
information theory. This leads us to a precise and general expression of the
intuition behind Zipf's vocabulary balance in terms of a symmetry equation
between the comple... | computer science |
14,817 | Notes on Electronic Lexicography | cs.CL | These notes are a continuation of topics covered by V. Selegej in his article
"Electronic Dictionaries and Computational lexicography". How can an electronic
dictionary have as its object the description of closely related languages?
Obviously, such a question allows multiple answers. | computer science |
14,818 | Fence - An Efficient Parser with Ambiguity Support for Model-Driven
Language Specification | cs.CL | Model-based language specification has applications in the implementation of
language processors, the design of domain-specific languages, model-driven
software development, data integration, text mining, natural language
processing, and corpus-based induction of models. Model-based language
specification decouples lan... | computer science |
14,819 | A Semantic Relatedness Measure Based on Combined Encyclopedic,
Ontological and Collocational Knowledge | cs.CL | We describe a new semantic relatedness measure combining the Wikipedia-based
Explicit Semantic Analysis measure, the WordNet path measure and the mixed
collocation index. Our measure achieves the currently highest results on the
WS-353 test: a Spearman rho coefficient of 0.79 (vs. 0.75 in (Gabrilovich and
Markovitch, 2... | computer science |
14,820 | Design of Arabic Diacritical Marks | cs.CL | Diacritical marks play a crucial role in meeting the criteria of usability of
typographic text, such as: homogeneity, clarity and legibility. To change the
diacritic of a letter in a word could completely change its semantic. The
situation is very complicated with multilingual text. Indeed, the problem of
design become... | computer science |
14,821 | Use Pronunciation by Analogy for text to speech system in Persian
language | cs.CL | The interest in text to speech synthesis increased in the world .text to
speech have been developed formany popular languages such as English, Spanish
and French and many researches and developmentshave been applied to those
languages. Persian on the other hand, has been given little attentioncompared
to other language... | computer science |
14,822 | NEMO: Extraction and normalization of organization names from PubMed
affiliation strings | cs.CL | We propose NEMO, a system for extracting organization names in the
affiliation and normalizing them to a canonical organization name. Our parsing
process involves multi-layered rule matching with multiple dictionaries. The
system achieves more than 98% f-score in extracting organization names. Our
process of normalizat... | computer science |
14,823 | BioSimplify: an open source sentence simplification engine to improve
recall in automatic biomedical information extraction | cs.CL | BioSimplify is an open source tool written in Java that introduces and
facilitates the use of a novel model for sentence simplification tuned for
automatic discourse analysis and information extraction (as opposed to sentence
simplification for improving human readability). The model is based on a
"shot-gun" approach t... | computer science |
14,824 | An Effective Approach to Biomedical Information Extraction with Limited
Training Data | cs.CL | Overall, the two main contributions of this work include the application of
sentence simplification to association extraction as described above, and the
use of distributional semantics for concept extraction. The proposed work on
concept extraction amalgamates for the first time two diverse research areas
-distributio... | computer science |
14,825 | Boundary identification of events in clinical named entity recognition | cs.CL | The problem of named entity recognition in the medical/clinical domain has
gained increasing attention do to its vital role in a wide range of clinical
decision support applications. The identification of complete and correct term
span is vital for further knowledge synthesis (e.g., coding/mapping concepts
thesauruses ... | computer science |
14,826 | Logical analysis of natural language semantics to solve the problem of
computer understanding | cs.CL | An object--oriented approach to create a natural language understanding
system is considered. The understanding program is a formal system built on the
base of predicative calculus. Horn's clauses are used as well--formed formulas.
An inference is based on the principle of resolution. Sentences of natural
language are ... | computer science |
14,827 | Hidden Structure and Function in the Lexicon | cs.CL | How many words are needed to define all the words in a dictionary?
Graph-theoretic analysis reveals that about 10% of a dictionary is a unique
Kernel of words that define one another and all the rest, but this is not the
smallest such subset. The Kernel consists of one huge strongly connected
component (SCC), about hal... | computer science |
14,828 | B(eo)W(u)LF: Facilitating recurrence analysis on multi-level language | cs.CL | Discourse analysis may seek to characterize not only the overall composition
of a given text but also the dynamic patterns within the data. This technical
report introduces a data format intended to facilitate multi-level
investigations, which we call the by-word long-form or B(eo)W(u)LF. Inspired by
the long-form data... | computer science |
14,829 | Consensus Sequence Segmentation | cs.CL | In this paper we introduce a method to detect words or phrases in a given
sequence of alphabets without knowing the lexicon. Our linear time unsupervised
algorithm relies entirely on statistical relationships among alphabets in the
input sequence to detect location of word boundaries. We compare our algorithm
to previo... | computer science |
14,830 | An Investigation of the Sampling-Based Alignment Method and Its
Contributions | cs.CL | By investigating the distribution of phrase pairs in phrase translation
tables, the work in this paper describes an approach to increase the number of
n-gram alignments in phrase translation tables output by a sampling-based
alignment method. This approach consists in enforcing the alignment of n-grams
in distinct tran... | computer science |
14,831 | A Literature Review: Stemming Algorithms for Indian Languages | cs.CL | Stemming is the process of extracting root word from the given inflection
word. It also plays significant role in numerous application of Natural
Language Processing (NLP). The stemming problem has addressed in many contexts
and by researchers in many disciplines. This expository paper presents survey
of some of the la... | computer science |
14,832 | Linear models and linear mixed effects models in R with linguistic
applications | cs.CL | This text is a conceptual introduction to mixed effects modeling with
linguistic applications, using the R programming environment. The reader is
introduced to linear modeling and assumptions, as well as to mixed
effects/multilevel modeling, including a discussion of random intercepts,
random slopes and likelihood rati... | computer science |
14,833 | NRC-Canada: Building the State-of-the-Art in Sentiment Analysis of
Tweets | cs.CL | In this paper, we describe how we created two state-of-the-art SVM
classifiers, one to detect the sentiment of messages such as tweets and SMS
(message-level task) and one to detect the sentiment of a term within a
submissions stood first in both tasks on tweets, obtaining an F-score of 69.02
in the message-level task ... | computer science |
14,834 | Crowdsourcing a Word-Emotion Association Lexicon | cs.CL | Even though considerable attention has been given to the polarity of words
(positive and negative) and the creation of large polarity lexicons, research
in emotion analysis has had to rely on limited and small emotion lexicons. In
this paper we show how the combined strength and wisdom of the crowds can be
used to gene... | computer science |
14,835 | Computing Lexical Contrast | cs.CL | Knowing the degree of semantic contrast between words has widespread
application in natural language processing, including machine translation,
information retrieval, and dialogue systems. Manually-created lexicons focus on
opposites, such as {\rm hot} and {\rm cold}. Opposites are of many kinds such
as antipodals, com... | computer science |
14,836 | DepAnn - An Annotation Tool for Dependency Treebanks | cs.CL | DepAnn is an interactive annotation tool for dependency treebanks, providing
both graphical and text-based annotation interfaces. The tool is aimed for
semi-automatic creation of treebanks. It aids the manual inspection and
correction of automatically created parses, making the annotation process
faster and less error-... | computer science |
14,837 | Dependency Treebanks: Methods, Annotation Schemes and Tools | cs.CL | In this paper, current dependencybased treebanks are introduced and analyzed.
The methods used for building the resources, the annotation schemes applied,
and the tools used (such as POS taggers, parsers and annotation software) are
discussed. | computer science |
14,838 | Mathematical Model for Transformation of Sentences from Active Voice to
Passive Voice | cs.CL | Formal work in linguistics has both produced and used important mathematical
tools. Motivated by a survey of models for context and word meaning, syntactic
categories, phrase structure rules and trees, an attempt is being made in the
present paper to present a mathematical model for structuring of sentences from
active... | computer science |
14,839 | Encoding models for scholarly literature | cs.CL | We examine the issue of digital formats for document encoding, archiving and
publishing, through the specific example of "born-digital" scholarly journal
articles. We will begin by looking at the traditional workflow of journal
editing and publication, and how these practices have made the transition into
the online do... | computer science |
14,840 | Without a 'doubt'? Unsupervised discovery of downward-entailing
operators | cs.CL | An important part of textual inference is making deductions involving
monotonicity, that is, determining whether a given assertion entails
restrictions or relaxations of that assertion. For instance, the statement 'We
know the epidemic spread quickly' does not entail 'We know the epidemic spread
quickly via fleas', but... | computer science |
14,841 | Non-Parametric Bayesian Areal Linguistics | cs.CL | We describe a statistical model over linguistic areas and phylogeny.
Our model recovers known areas and identifies a plausible hierarchy of areal
features. The use of areas improves genetic reconstruction of languages both
qualitatively and quantitatively according to a variety of metrics. We model
linguistic areas b... | computer science |
14,842 | A Bayesian Model for Discovering Typological Implications | cs.CL | A standard form of analysis for linguistic typology is the universal
implication. These implications state facts about the range of extant
languages, such as ``if objects come after verbs, then adjectives come after
nouns.'' Such implications are typically discovered by painstaking hand
analysis over a small sample of ... | computer science |
14,843 | Induction of Word and Phrase Alignments for Automatic Document
Summarization | cs.CL | Current research in automatic single document summarization is dominated by
two effective, yet naive approaches: summarization by sentence extraction, and
headline generation via bag-of-words models. While successful in some tasks,
neither of these models is able to adequately capture the large set of
linguistic device... | computer science |
14,844 | A Noisy-Channel Model for Document Compression | cs.CL | We present a document compression system that uses a hierarchical
noisy-channel model of text production. Our compression system first
automatically derives the syntactic structure of each sentence and the overall
discourse structure of the text given as input. The system then uses a
statistical hierarchical model of t... | computer science |
14,845 | A Large-Scale Exploration of Effective Global Features for a Joint
Entity Detection and Tracking Model | cs.CL | Entity detection and tracking (EDT) is the task of identifying textual
mentions of real-world entities in documents, extending the named entity
detection and coreference resolution task by considering mentions other than
names (pronouns, definite descriptions, etc.). Like NE tagging and coreference
resolution, most sol... | computer science |
14,846 | Pattern Based Term Extraction Using ACABIT System | cs.CL | In this paper, we propose a pattern-based term extraction approach for
Japanese, applying ACABIT system originally developed for French. The proposed
approach evaluates termhood using morphological patterns of basic terms and
term variants. After extracting term candidates, ACABIT system filters out
non-terms from the ... | computer science |
14,847 | Un système modulaire d'acquisition automatique de traductions à
partir du Web | cs.CL | We present a method of automatic translation (French/English) of Complex
Lexical Units (CLU) for aiming at extracting a bilingual lexicon. Our modular
system is based on linguistic properties (compositionality, polysemy, etc.).
Different aspects of the multilingual Web are used to validate candidate
translations and co... | computer science |
14,848 | A Note On Higher Order Grammar | cs.CL | Both syntax-phonology and syntax-semantics interfaces in Higher Order Grammar
(HOG) are expressed as axiomatic theories in higher-order logic (HOL), i.e. a
language is defined entirely in terms of provability in the single logical
system. An important implication of this elegant architecture is that the
meaning of a va... | computer science |
14,849 | Ludics and its Applications to natural Language Semantics | cs.CL | Proofs, in Ludics, have an interpretation provided by their counter-proofs,
that is the objects they interact with. We follow the same idea by proposing
that sentence meanings are given by the counter-meanings they are opposed to in
a dialectical interaction. The conception is at the intersection of a
proof-theoretic a... | computer science |
14,850 | Evaluation of Hindi to Punjabi Machine Translation System | cs.CL | Machine Translation in India is relatively young. The earliest efforts date
from the late 80s and early 90s. The success of every system is judged from its
evaluation experimental results. Number of machine translation systems has been
started for development but to the best of author knowledge, no high quality
system ... | computer science |
14,851 | Speech Recognition by Machine, A Review | cs.CL | This paper presents a brief survey on Automatic Speech Recognition and
discusses the major themes and advances made in the past 60 years of research,
so as to provide a technological perspective and an appreciation of the
fundamental progress that has been accomplished in this important area of
speech communication. Af... | computer science |
14,852 | Sentence Simplification Aids Protein-Protein Interaction Extraction | cs.CL | Accurate systems for extracting Protein-Protein Interactions (PPIs)
automatically from biomedical articles can help accelerate biomedical research.
Biomedical Informatics researchers are collaborating to provide metaservices
and advance the state-of-art in PPI extraction. One problem often neglected by
current Natural ... | computer science |
14,853 | Towards Effective Sentence Simplification for Automatic Processing of
Biomedical Text | cs.CL | The complexity of sentences characteristic to biomedical articles poses a
challenge to natural language parsers, which are typically trained on
large-scale corpora of non-technical text. We propose a text simplification
process, bioSimplify, that seeks to reduce the complexity of sentences in
biomedical abstracts in or... | computer science |
14,854 | A probabilistic top-down parser for minimalist grammars | cs.CL | This paper describes a probabilistic top-down parser for minimalist grammars.
Top-down parsers have the great advantage of having a certain predictive power
during the parsing, which takes place in a left-to-right reading of the
sentence. Such parsers have already been well-implemented and studied in the
case of Contex... | computer science |
14,855 | Learning Taxonomy for Text Segmentation by Formal Concept Analysis | cs.CL | In this paper the problems of deriving a taxonomy from a text and
concept-oriented text segmentation are approached. Formal Concept Analysis
(FCA) method is applied to solve both of these linguistic problems. The
proposed segmentation method offers a conceptual view for text segmentation,
using a context-driven cluster... | computer science |
14,856 | Geometric representations for minimalist grammars | cs.CL | We reformulate minimalist grammars as partial functions on term algebras for
strings and trees. Using filler/role bindings and tensor product
representations, we construct homomorphisms for these data structures into
geometric vector spaces. We prove that the structure-building functions as well
as simple processors fo... | computer science |
14,857 | Developing a New Approach for Arabic Morphological Analysis and
Generation | cs.CL | Arabic morphological analysis is one of the essential stages in Arabic
Natural Language Processing. In this paper we present an approach for Arabic
morphological analysis. This approach is based on Arabic morphological
automaton (AMAUT). The proposed technique uses a morphological database
realized using XMODEL languag... | computer science |
14,858 | Polarized Montagovian Semantics for the Lambek-Grishin calculus | cs.CL | Grishin proposed enriching the Lambek calculus with multiplicative
disjunction (par) and coresiduals. Applications to linguistics were discussed
by Moortgat, who spoke of the Lambek-Grishin calculus (LG). In this paper, we
adapt Girard's polarity-sensitive double negation embedding for classical logic
to extract a comp... | computer science |
14,859 | Materials to the Russian-Bulgarian Comparative Dictionary "EAD" | cs.CL | This article presents a fragment of a new comparative dictionary "A
comparative dictionary of names of expansive action in Russian and Bulgarian
languages". Main features of the new web-based comparative dictionary are
placed, the principles of its formation are shown, primary links between the
word-matches are classif... | computer science |
14,860 | A Universal Part-of-Speech Tagset | cs.CL | To facilitate future research in unsupervised induction of syntactic
structure and to standardize best-practices, we propose a tagset that consists
of twelve universal part-of-speech categories. In addition to the tagset, we
develop a mapping from 25 different treebank tagsets to this universal set. As
a result, when c... | computer science |
14,861 | Seeking Meaning in a Space Made out of Strokes, Radicals, Characters and
Compounds | cs.CL | Chinese characters can be compared to a molecular structure: a character is
analogous to a molecule, radicals are like atoms, calligraphic strokes
correspond to elementary particles, and when characters form compounds, they
are like molecular structures. In chemistry the conjunction of all of these
structural levels pr... | computer science |
14,862 | Performance Evaluation of Statistical Approaches for Text Independent
Speaker Recognition Using Source Feature | cs.CL | This paper introduces the performance evaluation of statistical approaches
for TextIndependent speaker recognition system using source feature. Linear
prediction LP residual is used as a representation of excitation information in
speech. The speaker-specific information in the excitation of voiced speech is
captured u... | computer science |
14,863 | Gender identity and lexical variation in social media | cs.CL | We present a study of the relationship between gender, linguistic style, and
social networks, using a novel corpus of 14,000 Twitter users. Prior
quantitative work on gender often treats this social variable as a female/male
binary; we argue for a more nuanced approach. By clustering Twitter users, we
find a natural de... | computer science |
14,864 | A Lightweight Stemmer for Gujarati | cs.CL | Gujarati is a resource poor language with almost no language processing tools
being available. In this paper we have shown an implementation of a rule based
stemmer of Gujarati. We have shown the creation of rules for stemming and the
richness in morphology that Gujarati possesses. We have also evaluated our
results by... | computer science |
14,865 | Design of English-Hindi Translation Memory for Efficient Translation | cs.CL | Developing parallel corpora is an important and a difficult activity for
Machine Translation. This requires manual annotation by Human Translators.
Translating same text again is a useless activity. There are tools available to
implement this for European Languages, but no such tool is available for Indian
Languages. I... | computer science |
14,866 | Extraction of domain-specific bilingual lexicon from comparable corpora:
compositional translation and ranking | cs.CL | This paper proposes a method for extracting translations of morphologically
constructed terms from comparable corpora. The method is based on compositional
translation and exploits translation equivalences at the morpheme-level, which
allows for the generation of "fertile" translations (translation pairs in which
the t... | computer science |
14,867 | Classification Analysis Of Authorship Fiction Texts in The Space Of
Semantic Fields | cs.CL | The use of naive Bayesian classifier (NB) and the classifier by the k nearest
neighbors (kNN) in classification semantic analysis of authors' texts of
English fiction has been analysed. The authors' works are considered in the
vector space the basis of which is formed by the frequency characteristics of
semantic fields... | computer science |
14,868 | The Hangulphabet: A Descriptive Alphabet | cs.CL | This paper describes the Hangulphabet, a new writing system that should prove
useful in a number of contexts. Using the Hangulphabet, a user can instantly
see voicing, manner and place of articulation of any phoneme found in human
language. The Hangulphabet places consonant graphemes on a grid with the x-axis
represent... | computer science |
14,869 | Large Scale Language Modeling in Automatic Speech Recognition | cs.CL | Large language models have been proven quite beneficial for a variety of
automatic speech recognition tasks in Google. We summarize results on Voice
Search and a few YouTube speech transcription tasks to highlight the impact
that one can expect from increasing both the amount of training data, and the
size of the langu... | computer science |
14,870 | Comparing and Combining Sentiment Analysis Methods | cs.CL | Several messages express opinions about events, products, and services,
political views or even their author's emotional state and mood. Sentiment
analysis has been used in several applications including analysis of the
repercussions of events in social networks, analysis of opinions about products
and services, and si... | computer science |
14,871 | A Semantic Approach to Summarization | cs.CL | Sentence extraction based summarization methods has some limitations as it
doesn't go into the semantics of the document. Also, it lacks the capability of
sentence generation which is intuitive to humans. Here we present a novel
method to summarize text documents taking the process to semantic levels with
the use of Wo... | computer science |
14,872 | The Best Templates Match Technique For Example Based Machine Translation | cs.CL | It has been proved that large scale realistic Knowledge Based Machine
Translation applications require acquisition of huge knowledge about language
and about the world. This knowledge is encoded in computational grammars,
lexicons and domain models. Another approach which avoids the need for
collecting and analyzing ma... | computer science |
14,873 | Basis Identification for Automatic Creation of Pronunciation Lexicon for
Proper Names | cs.CL | Development of a proper names pronunciation lexicon is usually a manual
effort which can not be avoided. Grapheme to phoneme (G2P) conversion modules,
in literature, are usually rule based and work best for non-proper names in a
particular language. Proper names are foreign to a G2P module. We follow an
optimization ap... | computer science |
14,874 | Toward verbalizing ontologies in isiZulu | cs.CL | IsiZulu is one of the eleven official languages of South Africa and roughly
half the population can speak it. It is the first (home) language for over 10
million people in South Africa. Only a few computational resources exist for
isiZulu and its related Nguni languages, yet the imperative for tool
development exists. ... | computer science |
14,875 | How Easy is it to Learn a Controlled Natural Language for Building a
Knowledge Base? | cs.CL | Recent developments in controlled natural language editors for knowledge
engineering (KE) have given rise to expectations that they will make KE tasks
more accessible and perhaps even enable non-engineers to build knowledge bases.
This exploratory research focussed on novices and experts in knowledge
engineering during... | computer science |
14,876 | Controlled Natural Language Generation from a Multilingual
FrameNet-based Grammar | cs.CL | This paper presents a currently bilingual but potentially multilingual
FrameNet-based grammar library implemented in Grammatical Framework. The
contribution of this paper is two-fold. First, it offers a methodological
approach to automatically generate the grammar based on semantico-syntactic
valence patterns extracted... | computer science |
14,877 | A Brief State of the Art for Ontology Authoring | cs.CL | One of the main challenges for building the Semantic web is Ontology
Authoring. Controlled Natural Languages CNLs offer a user friendly means for
non-experts to author ontologies. This paper provides a snapshot of the
state-of-the-art for the core CNLs for ontology authoring and reviews their
respective evaluations. | computer science |
14,878 | Are Style Guides Controlled Languages? The Case of Koenig & Bauer AG | cs.CL | Controlled natural languages for industrial application are often regarded as
a response to the challenges of translation and multilingual communication.
This paper presents a quite different approach taken by Koenig & Bauer AG,
where the main goal was the improvement of the authoring process for technical
documentatio... | computer science |
14,879 | Question Answering with Subgraph Embeddings | cs.CL | This paper presents a system which learns to answer questions on a broad
range of topics from a knowledge base using few hand-crafted features. Our
model learns low-dimensional embeddings of words and knowledge base
constituents; these representations are used to score natural language
questions against candidate answe... | computer science |
14,880 | Translation Of Telugu-Marathi and Vice-Versa using Rule Based Machine
Translation | cs.CL | In todays digital world automated Machine Translation of one language to
another has covered a long way to achieve different kinds of success stories.
Whereas Babel Fish supports a good number of foreign languages and only Hindi
from Indian languages, the Google Translator takes care of about 10 Indian
languages. Thoug... | computer science |
14,881 | Handling non-compositionality in multilingual CNLs | cs.CL | In this paper, we describe methods for handling multilingual
non-compositional constructions in the framework of GF. We specifically look at
methods to detect and extract non-compositional phrases from parallel texts and
propose methods to handle such constructions in GF grammars. We expect that the
methods to handle n... | computer science |
14,882 | Towards an Error Correction Memory to Enhance Technical Texts Authoring
in LELIE | cs.CL | In this paper, we investigate and experiment the notion of error correction
memory applied to error correction in technical texts. The main purpose is to
induce relatively generic correction patterns associated with more contextual
correction recommendations, based on previously memorized and analyzed
corrections. The ... | computer science |
14,883 | Embedded Controlled Languages | cs.CL | Inspired by embedded programming languages, an embedded CNL (controlled
natural language) is a proper fragment of an entire natural language (its host
language), but it has a parser that recognizes the entire host language. This
makes it possible to process out-of-CNL input and give useful feedback to
users, instead of... | computer science |
14,884 | Mapping the Economic Crisis: Some Preliminary Investigations | cs.CL | In this paper we describe our contribution to the PoliInformatics 2014
Challenge on the 2007-2008 financial crisis. We propose a state of the art
technique to extract information from texts and provide different
representations, giving first a static overview of the domain and then a
dynamic representation of its main ... | computer science |
14,885 | A survey on phrase structure learning methods for text classification | cs.CL | Text classification is a task of automatic classification of text into one of
the predefined categories. The problem of text classification has been widely
studied in different communities like natural language processing, data mining
and information retrieval. Text classification is an important constituent in
many in... | computer science |
14,886 | FrameNet Resource Grammar Library for GF | cs.CL | In this paper we present an ongoing research investigating the possibility
and potential of integrating frame semantics, particularly FrameNet, in the
Grammatical Framework (GF) application grammar development. An important
component of GF is its Resource Grammar Library (RGL) that encapsulates the
low-level linguistic... | computer science |
14,887 | Jabalin: a Comprehensive Computational Model of Modern Standard Arabic
Verbal Morphology Based on Traditional Arabic Prosody | cs.CL | The computational handling of Modern Standard Arabic is a challenge in the
field of natural language processing due to its highly rich morphology.
However, several authors have pointed out that the Arabic morphological system
is in fact extremely regular. The existing Arabic morphological analyzers have
exploited this ... | computer science |
14,888 | Inter-rater Agreement on Sentence Formality | cs.CL | Formality is one of the most important dimensions of writing style variation.
In this study we conducted an inter-rater reliability experiment for assessing
sentence formality on a five-point Likert scale, and obtained good agreement
results as well as different rating distributions for different sentence
categories. W... | computer science |
14,889 | Building Ontologies to Understand Spoken Tunisian Dialect | cs.CL | This paper presents a method to understand spoken Tunisian dialect based on
lexical semantic. This method takes into account the specificity of the
Tunisian dialect which has no linguistic processing tools. This method is
ontology-based which allows exploiting the ontological concepts for semantic
annotation and ontolo... | computer science |
14,890 | LexRank: Graph-based Lexical Centrality as Salience in Text
Summarization | cs.CL | We introduce a stochastic graph-based method for computing relative
importance of textual units for Natural Language Processing. We test the
technique on the problem of Text Summarization (TS). Extractive TS relies on
the concept of sentence salience to identify the most important sentences in a
document or set of docu... | computer science |
14,891 | Combining Knowledge- and Corpus-based Word-Sense-Disambiguation Methods | cs.CL | In this paper we concentrate on the resolution of the lexical ambiguity that
arises when a given word has several different meanings. This specific task is
commonly referred to as word sense disambiguation (WSD). The task of WSD
consists of assigning the correct sense to words using an electronic dictionary
as the sour... | computer science |
14,892 | Learning Content Selection Rules for Generating Object Descriptions in
Dialogue | cs.CL | A fundamental requirement of any task-oriented dialogue system is the ability
to generate object descriptions that refer to objects in the task domain. The
subproblem of content selection for object descriptions in task-oriented
dialogue has been the focus of much previous work and a large number of models
have been pr... | computer science |
14,893 | A Probabilistic Approach to Pronunciation by Analogy | cs.CL | The relationship between written and spoken words is convoluted in languages
with a deep orthography such as English and therefore it is difficult to devise
explicit rules for generating the pronunciations for unseen words.
Pronunciation by analogy (PbA) is a data-driven method of constructing
pronunciations for novel ... | computer science |
14,894 | Automatic transcription of 17th century English text in Contemporary
English with NooJ: Method and Evaluation | cs.CL | Since 2006 we have undertaken to describe the differences between 17th
century English and contemporary English thanks to NLP software. Studying a
corpus spanning the whole century (tales of English travellers in the Ottoman
Empire in the 17th century, Mary Astell's essay A Serious Proposal to the
Ladies and other lite... | computer science |
14,895 | Object-oriented semantics of English in natural language understanding
system | cs.CL | A new approach to the problem of natural language understanding is proposed.
The knowledge domain under consideration is the social behavior of people.
English sentences are translated into set of predicates of a semantic database,
which describe persons, occupations, organizations, projects, actions, events,
messages,... | computer science |
14,896 | Rule-weighted and terminal-weighted context-free grammars have identical
expressivity | cs.CL | Two formalisms, both based on context-free grammars, have recently been
proposed as a basis for a non-uniform random generation of combinatorial
objects. The former, introduced by Denise et al, associates weights with
letters, while the latter, recently explored by Weinberg et al in the context
of random generation, as... | computer science |
14,897 | Parsing of Myanmar sentences with function tagging | cs.CL | This paper describes the use of Naive Bayes to address the task of assigning
function tags and context free grammar (CFG) to parse Myanmar sentences. 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. Fun... | computer science |
14,898 | A Model-Driven Probabilistic Parser Generator | cs.CL | Existing probabilistic scanners and parsers impose hard constraints on the
way lexical and syntactic ambiguities can be resolved. Furthermore, traditional
grammar-based parsing tools are limited in the mechanisms they allow for taking
context into account. In this paper, we propose a model-driven tool that allows
for s... | computer science |
14,899 | Arabic Language Learning Assisted by Computer, based on Automatic Speech
Recognition | cs.CL | This work consists of creating a system of the Computer Assisted Language
Learning (CALL) based on a system of Automatic Speech Recognition (ASR) for the
Arabic language using the tool CMU Sphinx3 [1], based on the approach of HMM.
To this work, we have constructed a corpus of six hours of speech recordings
with a numb... | computer science |
14,900 | Task-specific Word-Clustering for Part-of-Speech Tagging | cs.CL | While the use of cluster features became ubiquitous in core NLP tasks, most
cluster features in NLP are based on distributional similarity. We propose a
new type of clustering criteria, specific to the task of part-of-speech
tagging. Instead of distributional similarity, these clusters are based on the
beha vior of a b... | computer science |
14,901 | Precision-biased Parsing and High-Quality Parse Selection | cs.CL | We introduce precision-biased parsing: a parsing task which favors precision
over recall by allowing the parser to abstain from decisions deemed uncertain.
We focus on dependency-parsing and present an ensemble method which is capable
of assigning parents to 84% of the text tokens while being over 96% accurate on
these... | computer science |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.