Sciweavers

1269 search results - page 72 / 254
» Learning Correction Grammars
Sort
View
AMAI
1998
Springer
15 years 15 days ago
Generalization and Specialization Strategies for Learning r.e. Languages
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...
Sanjay Jain, Arun Sharma
ACL
2006
15 years 2 months ago
Trimming CFG Parse Trees for Sentence Compression Using Machine Learning Approaches
Sentence compression is a task of creating a short grammatical sentence by removing extraneous words or phrases from an original sentence while preserving its meaning. Existing me...
Yuya Unno, Takashi Ninomiya, Yusuke Miyao, Jun-ich...
JMLR
2010
134views more  JMLR 2010»
14 years 7 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
86
Voted
PODS
2004
ACM
86views Database» more  PODS 2004»
16 years 27 days ago
Frontiers of Tractability for Typechecking Simple XML Transformations
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
Wim Martens, Frank Neven
GPCE
2007
Springer
15 years 7 months ago
Repleo: a syntax-safe template engine
Templates are a very common solution to generate code. They are used for different tasks like rendering webpages, creating Java Beans and so on. Most template systems have no noti...
Jeroen Arnoldus, Jeanot Bijpost, Mark van den Bran...