نتایج جستجو برای: simplification

تعداد نتایج: 10094  

2014
Angrosh Mandya Tadashi Nomoto Advaith Siddharthan

We describe two systems for text simplification using typed dependency structures, one that performs lexical and syntactic simplification, and another that performs sentence compression optimised to satisfy global text constraints such as lexical density, the ratio of difficult words, and text length. We report a substantial evaluation that demonstrates the superiority of our systems, individua...

2015
Dominique Brunato Felice Dell'Orletta Giulia Venturi Simonetta Montemagni

In this paper, we present design and construction of the first Italian corpus for automatic and semi–automatic text simplification. In line with current approaches, we propose a new annotation scheme specifically conceived to identify the typology of changes an original sentence undergoes when it is manually simplified. Such a scheme has been applied to two aligned Italian corpora, containing o...

2012
D.Venkata Subramanian Angelina Geetha

Knowledge Sharing portals are the primary gateways for users to access all the information they need for their activity with adequate safety, security and in the best quality. The usability of a Knowledge Sharing Portal plays an important role in every organization and higher learning institutions, as it helps to increase the user satisfaction, reuse of knowledge assets, consistency of informat...

2015
Evelina Rennes Arne Jönsson

We present a rule based automatic text simplification tool for Swedish. The tool is designed to facilitate experimentation with various simplification techniques. The architecture of the tool is inspired by and partly built on a previous text simplification tool for Swedish, CogFLUX. New functionality, new operation types, and new simplification operations were added.

2013
Goran Glavas Sanja Stajner

Newswire text is often linguistically complex and stylistically decorated, hence very difficult to comprehend for people with reading disabilities. Acknowledging that events represent the most important information in news, we propose an eventcentered approach to news simplification. Our method relies on robust extraction of factual events and elimination of surplus information which is not par...

Journal: :Procesamiento del Lenguaje Natural 2013
Sanja Stajner Horacio Saggion

We investigate sentence deletion and split decisions in Spanish text simplification for two different corpora aimed at different groups of users. We analyse sentence transformations in two parallel corpora of original and manually simplified texts for two different types of users and then conduct two classification experiments: classifying between those sentences to be deleted and those to be k...

2016
Nuria Gala Johannes Ziegler

Lexical complexity plays a central role in readability, particularly for dyslexic children and poor readers because of their slow and laborious decoding and word recognition skills. Although some features to aid readability may be common to many languages (e.g., the majority of ’easy’ words are of low frequency), we believe that lexical complexity is mainly language-specific. In this paper, we ...

2012
Marilisa Amoia Massimo Romanelli

In this paper, we describe the system we submitted to the SemEval-2012 Lexical Simplification Task. Our system (mmSystem) combines word frequency with decompositional semantics criteria based on syntactic structure in order to rank candidate substitutes of lexical forms of arbitrary syntactic complexity (oneword, multi-word, etc.) in descending order of (cognitive) simplicity. We believe that t...

2012
Sanja Stajner Ruslan Mitkov

A syntactically complex text may represent a problem for both comprehension by humans and various NLP tasks. A large number of studies in text simplification are concerned with this problem and their aim is to transform the given text into a simplified form in order to make it accessible to the wider audience. In this study, we were investigating what the natural tendency of texts is in 20th ce...

Journal: :Fundam. Inform. 1998
Christopher Lynch Christelle Scharff

We give a new simplification method, called E-cycle Simplification, for Basic Completion inference systems. We prove the completeness of Basic Completion with E-cycle Simplification. We prove that E-cycle Simplification is strictly stronger than the only previously known complete simplification method for Basic Completion, Basic Simplification, in the sense that every derivation involving Basic...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید