9,819 Hits in 4.3 sec

Automatic induction of rules for text simplification

R Chandrasekar, B Srinivas
1997 Knowledge-Based Systems  
doi:10.1016/s0950-7051(97)00029-4 fatcat:cfguckz6xbcflmscj4xh65ww3e

An Analysis of Crowdsourced Text Simplifications

Marcelo Amancio, Lucia Specia
2014 Proceedings of the 3rd Workshop on Predicting and Improving Text Readability for Target Reader Populations (PITR)  
The aim is to understand whether a complex-simple parallel corpus involving this version of Wikipedia is appropriate as data source to induce simplification rules, and whether we can automatically categorise  ...  We present a study on the text simplification operations undertaken collaboratively by Simple English Wikipedia contributors.  ...  Instead of handcrafted rules, recent methodologies are mostly data-driven, i.e., based on the induction of simplification rules from parallel corpora of complex segments and their corresponding simpler  ... 
doi:10.3115/v1/w14-1214 dblp:conf/acl-pitr/AmancioS14 fatcat:sxe5l6o3jvavrn2hldyfjd7dpa

Programming and Proving [chapter]

Tobias Nipkow, Gerwin Klein
2014 Concrete Semantics  
Acknowledgements I wish to thank the following people for their comments on this text: Florian Haftmann, René Thiemann and Christian Sternagel.  ...  Simplification rules The attribute simp declares theorems to be simplification rules, which the simplifier will use automatically.  ...  Definitions are not declared as simplification rules automatically! Nearly any theorem can become a simplification rule. The simplifier will try to transform it into an equation.  ... 
doi:10.1007/978-3-319-10542-0_6 fatcat:3grttoue4req5oaphdj6qv4t2q

Page 555 of The Philosophical Review Vol. 66, Issue 4 [page]

1957 The Philosophical Review  
Nor does the ability to apply certain rules require or automatically produce any under- standing of the justification for those rules.  ...  In this text the basic concepts required for a discussion of deduction and induction are first defined in psychological terms.  ... 

Page 262 of Computational Linguistics Vol. 25, Issue 2 [page]

1999 Computational Linguistics  
Automatic induction of rules for text simplification. Knowledge-based Systems, 10:183-190. Chandrasekar, R. and B. Srinivas. 1997b.  ...  Automatic grammar induction and parsing free text: A transformation-based approach. In Proceedings of the 31st Annual Meeting, Columbus, OH. Association for Computational Linguistics.  ... 

Algebraic Model Checking

Peter Padawitz
2010 Electronic Communications of the EASST  
Besides realizing and integrating state-of-the-art proof and computation rules the system admits the co/algebraic specification of the models to be checked in terms of rewrite rules and functional-logic  ...  It also offers flexible features for visualizing and even animating models and computations. This paper does not present purely theoretical work.  ...  For reducing the danger of non-termination Expander2 applies expansion rules only to formulas that lack redices for other simplification rules.  ... 
doi:10.14279/tuj.eceasst.26.359 dblp:journals/eceasst/Padawitz10 fatcat:zcjxkwkhbzad7iikbnytzzr5ru

Case-Analysis for Rippling and Inductive Proof [chapter]

Moa Johansson, Lucas Dixon, Alan Bundy
2010 Lecture Notes in Computer Science  
We find that this leads to a significant improvement in the coverage of inductive theorem proving.  ...  The main limitations of the extended prover are identified, highlight the need for advances in the treatment of assumptions during rippling and when conjecturing lemmas. 7  ...  Given the difficulty of automating inductive proofs, it is then sometimes surprising that informal mathematical texts present many proofs simply as "by induction".  ... 
doi:10.1007/978-3-642-14052-5_21 fatcat:njjk37j6t5gnboei52wohrjfaa

Sentence Simplification as Tree Transduction

Dan Feblowitz, David Kauchak
2013 Workshop on Predicting and Improving Text Readability for Target Reader Populations  
Our new approach performs significantly better than T3, similarly to human simplifications for both simplicity and fluency, and better than the phrasebased simplifiers for most of the evaluation metrics  ...  We compare our approach to T3 (Cohn and Lapata, 2009), a recent STSG implementation, as well as two state-of-the-art phrase-based sentence simplifiers on a corpus of aligned sentences from English and  ...  T3 was developed for the related problem of text compression, though it supports the full range of transformation operations required for simplification.  ... 
dblp:conf/acl-pitr/FeblowitzK13 fatcat:2p7gcunekngqloiss24duszwaa

A Survey of Automated Text Simplification

Matthew Shardlow
2014 International Journal of Advanced Computer Science and Applications  
Text simplification modifies syntax and lexicon to improve the understandability of language for an end user.  ...  This survey gives an overview of contemporary research whilst taking into account the history that has brought text simplification to its current state.  ...  Year Title Notes 1997 Automatic Induction of Rules for Text Simplification [3] Seminal work in field. 1998 Practical Simplification of English Newspaper Text to Assist Aphasic Readers (PSET)  ... 
doi:10.14569/specialissue.2014.040109 fatcat:fbskuhircjgo3nykcfbnir7gwi

Tutorial: Data-driven text simplification

Horacio Saggion, Sanja Štajner
2019 Zenodo  
We will describe and explain all the most influential methods used for automatic simplification of texts so far, with the emphasis on their strengths and weaknesses noticed in a direct comparison of systems  ...  , we aim to provide an extensive overview of automatic text simplification systems proposed so far, the methods they used and discuss the strengths and shortcomings of each of them, providing direct comparison  ...  Auto- matic induction of rules for text simplification. Knowledge-Based Systems, 10:183-190, 1997. [Chandrasekar et al.(1996)Chandrasekar, Doran, and Srinivas] R.  ... 
doi:10.5281/zenodo.2593328 fatcat:jqzdbcgskveorcml7ogqwkzuue

Discovering Textual Structures: Generative Grammar Induction using Template Trees [article]

Thomas Winters, Luc De Raedt
2020 arXiv   pre-print
Natural language generation provides designers with methods for automatically generating text, e.g. for creating summaries, chatbots and game content.  ...  In this paper, we introduce a novel grammar induction algorithm for learning interpretable grammars for generative purposes, called Gitta.  ...  Acknowledgments Thomas Winters is a fellow of the Research Foundation-Flanders (FWO-Vlaanderen).  ... 
arXiv:2009.04530v1 fatcat:xtvbirdoi5ebjksnjzzxj2bueq

Data-Driven Sentence Simplification: Survey and Benchmark

Fernando Alva-Manchego, Carolina Scarton, Lucia Specia
2020 Computational Linguistics  
Sentence Simplification (SS) aims to modify a sentence in order to make it easier to read and understand.  ...  We expect that this survey will serve as a starting point for researchers interested in the task and help spark new ideas for future developments.  ...  Using these transformation rules, grammar-induction-based models then decide, given an original sentence, which rule(s) to apply and how to generate the final simplification output (often referred to as  ... 
doi:10.1162/coli_a_00370 fatcat:k7mlggplrreudk5pgq62x2fmva

Controllable Sentence Simplification: Employing Syntactic and Lexical Constraints [article]

Jonathan Mallinson, Mirella Lapata
2019 arXiv   pre-print
control both the level of simplicity and the type of the simplification.  ...  Sentence simplification aims to make sentences easier to read and understand.  ...  For Newsela, when using the complex list, we include approximately 29% of the rules. Whereas for WikiLarge we include approximately 13% of the rules.  ... 
arXiv:1910.04387v1 fatcat:za4pvg4vh5emrnxtctye4dv2se

Learning to Simplify Sentences with Quasi-Synchronous Grammar and Integer Programming

Kristian Woodsend, Mirella Lapata
2011 Conference on Empirical Methods in Natural Language Processing  
Text simplification aims to rewrite text into simpler versions, and thus make information accessible to a broader audience.  ...  We describe how such a grammar can be induced from Wikipedia and propose an integer linear programming model for selecting the most appropriate simplification from the space of possible rewrites generated  ...  We would also like to thank the members of the Probabilistic Models of Language group at the School of Informatics for valuable discussions and comments.  ... 
dblp:conf/emnlp/WoodsendL11 fatcat:5pm3pwjvijhbje77cq2p3fqfye

A decision-tree-based symbolic rule induction system for text categorization

D. E. Johnson, F. J. Oles, T. Zhang, T. Goetz
2002 IBM Systems Journal  
We present a decision-tree-based symbolic rule induction system for categorizing text documents automatically.  ...  Our method for rule induction involves the novel combination of (1) a fast decision tree induction algorithm especially suited to text data and (2) a new method for converting a decision tree to a rule  ... 
doi:10.1147/sj.413.0428 fatcat:i4ssi2ctobdapjtwmzfpkddjlq
« Previous Showing results 1 — 15 out of 9,819 results