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

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

Hossein Abedini Mahmoud Reza Pishvaie, Ramin Bozorgmehry Boozarjomehry

For large and complex reacting systems, computational efficiency becomes a critical issue in process simulation, optimization and model-based control. Mechanism simplification is often a necessity to improve computational speed. We present a novel approach to simplification of reaction networks that formulates the model reduction problem as an optimization problem and solves it using geneti...

2012
Lucia Specia Sujay Kumar Jauhar Rada Mihalcea

We describe the English Lexical Simplification task at SemEval-2012. This is the first time such a shared task has been organized and its goal is to provide a framework for the evaluation of systems for lexical simplification and foster research on context-aware lexical simplification approaches. The task requires that annotators and systems rank a number of alternative substitutes – all deemed...

2015
Victoria Yaneva

This paper presents initial research into the use of easy-read articles written for people with cognitive disabilities as a gold standard for the evaluation of the output of text simplification systems. We investigate the compliance of the easyread documents available on the Web with guidelines for development of easyread material, as well as their suitability as a gold standard for simple docu...

2014
Gintare Grigonyte Maria Kvist Sumithra Velupillai Mats Wirén

This paper describes part of an ongoing effort to improve the readability of Swedish electronic health records (EHRs). An EHR contains systematic documentation of a single patient’s medical history across time, entered by healthcare professionals with the purpose of enabling safe and informed care. Linguistically, medical records exemplify a highly specialised domain, which can be superficially...

2012
Violeta Seretan

Text simplification is the process of reducing the lexical and syntactic complexity of a text while attempting to preserve (most of) its information content. It has recently emerged as an important research area, which holds promise for enhancing the text readability for the benefit of a broader audience as well as for increasing the performance of other applications. Our work focuses on syntac...

2016
John Lee Wenlong Zhao Wenxiu Xie

We present a browser-based editor for simplifying English text. Given an input sentence, the editor performs both syntactic and lexical simplification. It splits a complex sentence into shorter ones, and suggests word substitutions in drop-down lists. The user can choose the best substitution from the list, undo any inappropriate splitting, and further edit the sentence as necessary. A signific...

2005
Anton L. Fuhrmann Eike Umlauf Stephan Mantler

Models of large forest scenes are of a geometric complexity that surpasses even the capabilities of current high end graphics hardware. We propose an extreme simplification method which allows us to render such scenes in realtime. Our work is an extension of the image based-simplification method of Billboard Clouds. We automatically generate tree model representations of 15-50 textured polygons...

2013
Gustavo Paetzold Lucia Specia

Lexical and syntactic simplification aim to make texts more accessible to certain audiences. Syntactic simplification uses either hand-crafted linguistic rules for deep syntactic transformations, or machine learning techniques to model simpler transformations. Lexical simplification performs a lookup for synonyms followed by context and/or frequency-based models. In this paper we investigate mo...

2015
Goran Glavas Sanja Stajner

Simplification of lexically complex texts, by replacing complex words with their simpler synonyms, helps non-native speakers, children, and language-impaired people understand text better. Recent lexical simplification methods rely on manually simplified corpora, which are expensive and time-consuming to build. We present an unsupervised approach to lexical simplification that makes use of the ...

Journal: :Graphical Models 2012
Shervin Daneshpajouh Mohammad Ghodsi Alireza Zarei

In this paper, we consider the restricted version of the well-known 2D line simplification problem under area measures and for restricted version. We first propose a unified definition for both of sum-area and difference-area measures that can be used on a general path of n vertices. The optimal simplification runs in O(n) under both of these measures. Under sum-area measure and for a realistic...

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

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