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

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

Journal: :زبان و ادبیات عربی 0
دکتر رضایی دکتر رضایی یاری یاری

since the appearance of the knowledge of syntax the grammarians made an effort to develop the rules of arabic language, through which the quran was sent down. to do this they considered some principles:1 ) to develop the rules of syntax they only referred to the language of arab noble and eloquent tribes. 2) they developed the rules of syntax based on the widespread and prevalent language of ar...

Journal: :Annual Meeting of the Berkeley Linguistics Society 1997

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: :RAIRO. Informatique théorique 1983

2015
Gustavo Paetzold

Lexical Simplification is the task of modifying the lexical content of complex sentences in order to make them simpler. Due to the lack of reliable resources available for the task, most existing approaches have difficulties producing simplifications which are grammatical and that preserve the meaning of the original text. In order to improve on the state-of-the-art of this task, we propose use...

2008
Simon Mille Leo Wanner

Hardly any other kind of text structures is as notoriously difficult to read as patents – which is first of all due to their abstract vocabulary and their very complex syntactic constructions. Especially the claims in a patent are a challenge: in accordance with international patent writing regulations, each claim must be rendered in a single sentence. As a result, sentences with more than 200 ...

2012
Alexandre Decan Fabian Pijcke Jef Wijsen

An uncertain database db is defined as a database in which distinct tuples of the same relation can agree on their primary key. A repair (or possible world) of db is then obtained by selecting a maximal number of tuples without ever selecting two distinct tuples of the same relation that agree on their primary key. Given a query Q on db, the certain answer is the intersection of the answers to ...

Journal: :Communications of the ACM 1971

Journal: :Journal of Chemical Biology 2011

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

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