Towards a generic graph rewriting system to enrich syntactic structures (Vers un syst\`eme g\'en\'erique de r\'e\'ecriture de graphes pour l'enrichissement de structures syntaxiques) [in French]
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Minimal Macro-Based Rewritings of Formal Languages: Theory and Applications in Ontology Engineering (and beyond)
In this paper, we introduce the problem of rewriting finite formal languages using syntactic macros such that the rewriting is minimal in size. We present polynomial-time algorithms to solve variants of this problem and …
Generic Encodings of Constructor Rewriting Systems
Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewr…
NegationGraph Meets LLM: A Novel Approach to Collaborative Filtering for Robust Conversational Understanding
Conversational AI systems such as Alexa need to understand defective queries to ensure robust conversational understanding and reduce user friction. These defective queries often arise from user ambiguities, mistakes, or…
Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Collaborative FilteringFriction+8StoryLens: Preference-Aligned Story Rewriting via Context-Aware Narrative Enrichment
Story rewriting aims to adapt existing narratives to diverse reader preferences while preserving plot consistency and narrative coherence. Unlike conventional work on style transfer, we argue that effective story rewriti…
Reinforcement LearningStyle TransferDr Genre: Reinforcement Learning from Decoupled LLM Feedback for Generic Text Rewriting
Generic text rewriting is a prevalent large language model (LLM) application that covers diverse real-world tasks, such as style transfer, fact correction, and email editing. These tasks vary in rewriting objectives (e.g…
Instruction FollowingLarge Language ModelStyle Transfer