中文
相关论文

相关论文: Generating Context-Appropriate Word Orders in Turk…

200 篇论文

Transformer-based language models are effective but complex, and understanding their inner workings and reasoning mechanisms is a significant challenge. Previous research has primarily explored how these models handle simple tasks like name…

计算与语言 · 计算机科学 2025-05-20 Zeyuan Allen-Zhu , Yuanzhi Li

Compound probabilistic context-free grammars (C-PCFGs) have recently established a new state of the art for unsupervised phrase-structure grammar induction. However, due to the high space and time complexities of chart-based representation…

计算与语言 · 计算机科学 2023-10-24 Yanpeng Zhao , Ivan Titov

Due to the limited availability of high quality datasets for training sentence embeddings in Turkish, we propose a training methodology and a regimen to develop a sentence embedding model. The central idea is simple but effective : is to…

计算与语言 · 计算机科学 2023-11-17 Eren Unlu , Unver Ciftci

Generating texts from structured data (e.g., a table) is important for various natural language processing tasks such as question answering and dialog systems. In recent studies, researchers use neural language models and encoder-decoder…

计算与语言 · 计算机科学 2017-09-04 Lei Sha , Lili Mou , Tianyu Liu , Pascal Poupart , Sujian Li , Baobao Chang , Zhifang Sui

The central role of the lexicon in Meaning-Text Theory (MTT) and other dependency-based linguistic theories cannot be replicated in linguistic theories based on context-free grammars (CFGs). We describe Tree Adjoining Grammar (TAG) as a…

cmp-lg · 计算机科学 2008-02-03 Owen Rambow , Aravind Joshi

DisCoCirc is a newly proposed framework for representing the grammar and semantics of texts using compositional, generative circuits. While it constitutes a development of the Categorical Distributional Compositional (DisCoCat) framework,…

计算与语言 · 计算机科学 2022-08-23 Muhammad Hamza Waseem , Jonathon Liu , Vincent Wang-Maścianica , Bob Coecke

Considering the speed in which humans resolve syntactic ambiguity, and the overwhelming evidence that syntactic ambiguity is resolved through selection of the analysis whose interpretation is the most `sensible', one comes to the conclusion…

cmp-lg · 计算机科学 2008-02-03 Michael Niv

A pronoun resolution system which requires limited syntactic knowledge to identify the antecedents of personal and reflexive pronouns in Turkish is presented. As in its counterparts for languages like English, Spanish and French, the core…

计算与语言 · 计算机科学 2015-04-21 Dilek Küçük , Meltem Turhan Yöndem

We present a constraint-based case frame lexicon architecture for bi-directional mapping between a syntactic case frame and a semantic frame. The lexicon uses a semantic sense as the basic unit and employs a multi-tiered constraint…

cmp-lg · 计算机科学 2008-02-03 Kemal Oflazer , Okan Yilmaz

Controlled text generation (CTG) seeks to guide large language model (LLM) output to produce text that conforms to desired criteria. The current study presents a novel CTG algorithm that enforces adherence toward specific rhetorical…

计算与语言 · 计算机科学 2024-02-12 Joshua Zingale , Jugal Kalita

Grammatical Error Detection and Correction (GEC) tools have proven useful for native speakers and second language learners. Developing such tools requires a large amount of parallel, annotated data, which is unavailable for most languages.…

计算与语言 · 计算机科学 2023-09-21 Atakan Kara , Farrin Marouf Sofian , Andrew Bond , Gözde Gül Şahin

We show that if a context-free grammar generates a language whose lexicographic ordering is well-ordered of type less than $\omega^2$, then its order type is effectively computable.

形式语言与自动机理论 · 计算机科学 2019-09-19 Kitti Gelle , Szabolcs Iván

Context-free S grammars are introduced, for arbitrary (storage) type S, as a uniform framework for recursion-based grammars, automata, and transducers, viewed as programs. To each occurrence of a nonterminal of a context-free S grammar an…

形式语言与自动机理论 · 计算机科学 2014-08-05 Joost Engelfriet

Parsing Expression Grammars (PEGs) are a recognition-based formalism which allows to describe the syntactical and the lexical elements of a language. The main difference between Context-Free Grammars (CFGs) and PEGs relies on the…

形式语言与自动机理论 · 计算机科学 2020-11-10 Sérgio Medeiros , Carlos Olarte

In this thesis, morphological description of Turkish is encoded using the two-level model. This description is made up of the phonological component that contains the two-level morphophonemic rules, and the lexicon component which lists the…

cmp-lg · 计算机科学 2008-02-03 S. Murat Oztaner

We describe a Context Free Grammar (CFG) for Bangla language and hence we propose a Bangla parser based on the grammar. Our approach is very much general to apply in Bangla Sentences and the method is well accepted for parsing a language of…

计算与语言 · 计算机科学 2012-01-11 K. M. Azharul Hasan , Al-Mahmud , Amit Mondal , Amit Saha

We continue our study of ordered context-free grammars, a grammar formalism that places an order on the parse trees produced by the corresponding context-free grammar. In particular, we simplify our previous definition of a derivation of a…

形式语言与自动机理论 · 计算机科学 2023-09-19 Brink van der Merwe

Combinatory Category Grammar (CCG) supertagging is a task to assign lexical categories to each word in a sentence. Almost all previous methods use fixed context window sizes as input features. However, it is obvious that different tags…

计算与语言 · 计算机科学 2016-10-11 Huijia Wu , Jiajun Zhang , Chengqing Zong

In this study, we develop and assess new corpus selection and training methodologies to improve the effectiveness of Turkish language models. Specifically, we adapted Large Language Model generated datasets and translated English datasets…

While exam-style questions are a fundamental educational tool serving a variety of purposes, manual construction of questions is a complex process that requires training, experience and resources. Automatic question generation (QG)…

机器学习 · 计算机科学 2022-04-08 Fatih Cagatay Akyon , Devrim Cavusoglu , Cemil Cengiz , Sinan Onur Altinuc , Alptekin Temizel