Filters








18,884 Hits in 5.2 sec

P Systems on Hexagonal Picture Languages and Applications

S. James Immanuel, S. Jayasankar, D. Gnanaraj Thomas
2022 International Symposium on Artificial Intelligence and Mathematics  
Their systems yield languages of hexagons using parallel rewriting relations.  ...  The area of membrane computing, was initiated by Paun [15] introducing a new computability model, now called as P system, which is distributed highly parallel theoretical model inspired by the membrane  ...  One uses the Chomsky way of rewriting for computations, in a P system with string objects.  ... 
dblp:conf/isaim/ImmanuelJT22 fatcat:bdtt3t7v6zas7ftinjqu2ttxoa

A General Contextualized Rewriting Framework for Text Summarization [article]

Guangsheng Bao, Yue Zhang
2022 arXiv   pre-print
Results show that our approach significantly outperforms non-contextualized rewriting systems without requiring reinforcement learning, achieving strong improvements on ROUGE scores upon multiple extractors  ...  In this paper, we investigate contextualized rewriting, which consumes the entire document and considers the summary context.  ...  E j | E <j , X) P(Y j | E j , E <j , Y <j , X) Extractor Rewriter TABLE I : I Main results on CNN/DailyMail.  ... 
arXiv:2207.05948v1 fatcat:nikb2wvhzfgfxpkrs7ho6oaimq

Pre-Training for Query Rewriting in A Spoken Language Understanding System [article]

Zheng Chen, Xing Fan, Yuan Ling, Lambert Mathias, Chenlei Guo
2020 arXiv   pre-print
Our experiments show pre-training provides rich prior information and help the QR task achieve strong performance. We also show joint pre-training with NLU hypotheses has further benefit.  ...  Then, inspired by the wide success of pre-trained contextual language embeddings, and also as a way to compensate for insufficient QR training data, we propose a language-modeling (LM) based approach to  ...  "pretrain textNLU" has a further 2% gain in p@1 and 1% gain in p@5 over "pretrain text".  ... 
arXiv:2002.05607v1 fatcat:c5epqra7ine27dltbr3bz5kqvy

Contextualized Rewriting for Text Summarization [article]

Guangsheng Bao, Yue Zhang
2021 arXiv   pre-print
Results show that our approach significantly outperforms non-contextualized rewriting systems without requiring reinforcement learning, achieving strong improvements on ROUGE scores upon multiple extractive  ...  Extractive summarization suffers from irrelevance, redundancy and incoherence. Existing work shows that abstractive rewriting for extractive summaries can improve the conciseness and readability.  ...  Acknowledgments We would like to thank the anonymous reviewers for their valuable feedback and Wenyu Du for the inspiring discussion.  ... 
arXiv:2102.00385v2 fatcat:vjdaogwn55htzpm3xobawyde2u

Certifying Confluence of Quasi-Decreasing Strongly Deterministic Conditional Term Rewrite Systems [chapter]

Christian Sternagel, Thomas Sternagel
2017 Lecture Notes in Computer Science  
We further give the check function check-unfeasible and the accompanying soundness lemma: Lemma 10.  ...  Given a quasi-decreasing CTRS R, two variable-disjoint variants of rules ρ 1 : 1 → r 1 ⇐ c 1 and ρ 2 : 2 → r 2 ⇐ c 2 in R, an mgu μ of 1 | p and 2 for some position p, a set of conditions C such that C  ...  We thank Bertram Felgenhauer and Julian Nagele for fruitful discussions on the subject matter. Moreover, we would like to thank the anonymous reviewers for their constructive and helpful comments.  ... 
doi:10.1007/978-3-319-63046-5_26 fatcat:xfynwx3ddfbe5fo2ndsushokqq

Page 5482 of Mathematical Reviews Vol. , Issue 2003g [page]

2003 Mathematical Reviews  
Further, we show that bisimilarity is complete for contextual equivalence. “We show that the notion of a program context in the linear setting is non-trivial.  ...  In par- ticular, we consider how one can establish contextual equivalences in a linear theory with function types and tensor types by instead establishing bisimulations.  ... 

System Description: E 0.81 [chapter]

Stephan Schulz
2004 Lecture Notes in Computer Science  
We describe the latest version, E 0.81 Tumsong, with special emphasis on the important aspects that have changed compared to previously described versions.  ...  As a result, E is now more stable and powerful than ever, and we are confident that further improvements will follow in the future.  ...  Table 1 shows the results and notes on the introduction of the most important new features.  ... 
doi:10.1007/978-3-540-25984-8_15 fatcat:eqya64ncxjbvjg6tyvka7uypcy

Substance over Style: Document-Level Targeted Content Transfer [article]

Allison Hegel, Sudha Rao, Asli Celikyilmaz, Bill Dolan
2020 arXiv   pre-print
We propose a novel model for this task based on the generative pre-trained language model (GPT-2) and train on a large number of roughly-aligned recipe pairs (https://github.com/microsoft/document-level-targeted-content-transfer  ...  Both automatic and human evaluations show that our model out-performs existing methods by generating coherent and diverse rewrites that obey the constraint while remaining close to the original document  ...  We would also like to thank Sam Leiboff, Zach Price, and Matt Runchey for their feedback on the recipe content transfer task that informed our modeling approach.  ... 
arXiv:2010.08618v1 fatcat:bg62viilffa5hnj7ihwmnb5u2m

Page 2135 of Mathematical Reviews Vol. , Issue 85e [page]

1985 Mathematical Reviews  
We call such mixed sets of rules and equations ‘equational term rewriting systems’.  ...  However, some questions remain open, for example, whether all context-free languages can be generated by contextual schemes having regular context, only one rewriting point, and regular control language  ... 

Scaling Multi-Domain Dialogue State Tracking via Query Reformulation

Pushpendre Rastogi, Arpit Gupta, Tongfei Chen, Mathias Lambert
2019 Proceedings of the 2019 Conference of the North  
Tracking conversational state is particularly challenging in a multi-domain scenario when there exist multiple spoken language understanding (SLU) sub-systems, and each SLU sub-system operates on its domainspecific  ...  Successful contextual understanding of multi-turn spoken dialogues requires resolving referring expressions across turns and tracking the entities relevant to the conversation across turns.  ...  ., gold-rewrite from our data collection, instead of predicted re-write) to measure the potential of query-rewriting and motivate further research on this topic.  ... 
doi:10.18653/v1/n19-2013 dblp:conf/naacl/RastogiGCM19 fatcat:mzwuunbdb5gmrf5ybksv4zfehe

Conversational Query Rewriting with Self-supervised Learning [article]

Hang Liu, Meng Chen, Youzheng Wu, Xiaodong He, Bowen Zhou
2021 arXiv   pre-print
And the detection of the omitted important information from context can be further improved. Besides, intent consistency constraint between contextual query and rewritten query is also ignored.  ...  Experimental results demonstrate that our proposed model outperforms existing CQR baselines significantly, and also prove the effectiveness of self-supervised learning on improving the CQR performance.  ...  Experimental Results Table 2 shows the experimental results on JDDC-CQR-146K and Restoration-200K.  ... 
arXiv:2102.04708v2 fatcat:c3e5lvrtozaibaoijb2idthcvi

From Search to Computation: Redundancy Criteria and Simplification at Work [chapter]

Thomas Hillenbrand, Ruzica Piskac, Uwe Waldmann, Christoph Weidenbach
2013 Lecture Notes in Computer Science  
This includes a variant of contextual rewriting to decide a subclass of Euclidean geometry, ordered chaining techniques for Church-Rosser and priority queue proofs, contextual rewriting and history-dependent  ...  complexities for the completion of conditional rewrite systems, rewriting with equivalences for theorem proving in set theory, soft typing for the exploration of sort information in the context of equations  ...  The result is the local contextual rewriting rule.  ... 
doi:10.1007/978-3-642-37651-1_7 fatcat:fr4uqtwvubbtvgjepamaamojeu

Factorize Factorization [article]

Beniamino Accattoli, Claudia Faggian, Giulio Guerrieri
2020 arXiv   pre-print
We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which is inspired by the Hindley-Rosen technique for confluence.  ...  We isolate a sufficient condition (called linear swap) for lifting factorization from components to the compound system, and which is compatible with beta-reduction.  ...  Our technique does not require an advanced background in rewriting. Motivations and Further Applications.  ... 
arXiv:2005.01808v2 fatcat:udda4mn64bbqnldb4oipsivb6a

Page 7268 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
Summary: “We consider P systems with string objects which evolve by means of one-sided contextual rules and erasing contextual rules.  ...  Summary: “Generally, in P systems with string-objects one uses the Chomsky way of rewriting for processing the objects.  ... 

Towards Zero-Overhead Disambiguation of Deep Priority Conflicts

Luís Eduardo de Souza Amorim, Michael J. Steindorfer, Eelco Visser
2018 The Art, Science, and Engineering of Programming  
By parsing a corpus of popular open-source repositories written in Java and OCaml, we found that our approach yields speedups of up to 1.73x over a grammar rewriting technique when parsing programs with  ...  The study shows that in a corpus of popular OCaml projects on Github, up to 17 % of the source files contain deep priority conflicts.  ...  We would also like to thank Jasper Denkers for his work on JSGLR , and Peter Mosses and the anonymous reviewers for their detailed feedback.  ... 
doi:10.22152/programming-journal.org/2018/2/13 fatcat:iilbslbbwjdrhhtqgcagyhifui
« Previous Showing results 1 — 15 out of 18,884 results