Hasil untuk "Indo-Iranian languages and literature"

رسول محمد حسین پور, فرزانه باقری

این مطالعه که بر اساس نظریۀ اجتماعی- فرهنگی انجام شده است، به بررسی نگرش، دیدگاه‌ و انگیزۀ زبان­آموزان ایرانی در ارتباط با نگارش مشارکتی می- پردازد. در این پژوهش از یک رویکرد ترکیبی استفاده شده است که جامعه­ای متشکل از ۵۰ زبان‌آموز با سطوح عملکرد متفاوت (پایین و بالا) را شامل می­شود. داده‌های کمی از طریق سه پرسشنامه با تمرکز بر: نگرش، درک و انگیزه جمع‌آوری و با داده‌های کیفی حاصل از یادداشت­های تأملی تکمیل گردید. نتایج پرسشنامه­های نگرش، درک و انگیزه نشان‌دهندۀ دیدگاه مثبت، نسبت به نگارش مشارکتی در هر دو سطح عملکردى بود؛ به خصوص زبان‌آموزان با عملکرد بالا در تمامی سطوح، نمرات به مراتب بالاتری کسب کردند. تحلیل کیفی نیز این موارد را تأیید کرد و نگرش مثبتی نسبت به ارزش آموزشی نگارش مشارکتی را نشان داد. زبان‌آموزان با عملکرد بالا نگرش مشتاقانه‌تری نسبت به نگارش مشارکتی در مقایسه با همتایان خود داشتند. تحلیل موضوعی داده‌های کیفی، هفت مضمون اصلی را نمایان کرد: همکاری با همتایان، ترجیح­ و تمایل­های شخصی و عوامل فردی، تأثیرات و پیامدهای قابل درک، پیشرفت زبان، کارایی و لذت بردن. با وجود اتفاق نظر کلی بر فوائد نگارش مشارکتی، چالش‌هایی مربوط به مدیریت زمان و اختلاف­های فردی نیز شناسایی شدند. یافته‌ها، بینش‌های ارزشمندی در مورد تعامل پیچیده بین عوامل فردی و گروهی، در زمینۀ نگارش مشارکتی ارائه می‌دهند و نشان می‌دهند که ممکن است ارتباطی بین مهارت زبانی موجود و فوائد حاصل از نگارش مشارکتی وجود داشته باشد.

Antoine Amarilli, Mikaël Monet, Paul Raphaël et al.

We study the membership problem to context-free languages L (CFLs) on probabilistic words, that specify for each position a probability distribution on the letters (assuming independence across positions). Our task is to compute, given a probabilistic word, what is the probability that a word drawn according to the distribution belongs to L. This problem generalizes the problem of counting how many words of length n belong to L, or of counting how many completions of a partial word belong to L. We show that this problem is in polynomial time for unambiguous context-free languages (uCFLs), but can be #P-hard already for unions of two linear uCFLs. More generally, we show that the problem is in polynomial time for so-called poly-slicewise-unambiguous languages, where given a length n we can tractably compute an uCFL for the words of length n in the language. This class includes some inherently ambiguous languages, and implies the tractability of bounded CFLs and of languages recognized by unambiguous polynomial-time counter automata; but we show that the problem can be #P-hard for nondeterministic counter automata, even for Parikh automata with a single counter. We then introduce classes of circuits from knowledge compilation which we use for tractable counting, and show that this covers the tractability of poly-slicewise-unambiguous languages and of some CFLs that are not poly-slicewise-unambiguous. Extending these circuits with negation further allows us to show tractability for the language of primitive words, and for the language of concatenations of two palindromes. We finally show the conditional undecidability of the meta-problem that asks, given a CFG, whether the probabilistic membership problem for that CFG is tractable or #P-hard.

Oscar H. Ibarra, Ian McQuillan

There are many types of automata and grammar models that have been studied in the literature, and for these models, it is common to determine whether certain problems are decidable. One problem that has been difficult to answer throughout the history of automata and formal language theory is to decide whether a given system $M$ accepts a bounded language (whether there exist words $w_1, \ldots,w_k$ such that $L(M) \subseteq w_1 \cdots w_k$?). Decidability of this problem has gone unanswered for the majority of automata/grammar models in the literature. Boundedness was only known to be decidable for regular and context-free languages until recently when it was shown to also be decidable for finite-automata and pushdown automata augmented with reversal-bounded counters, and for vector addition systems with states. In this paper, we develop new techniques to show that the boundedness problem is decidable for larger classes of one-way nondeterministic automata and grammar models, by reducing the problem to the decidability of boundedness for simpler classes of automata. One technique involves characterizing the models in terms of multi-tape automata. We give new characterizations of finite-turn Turing machines, finite-turn Turing machines augmented with various storage structures (like a pushdown, multiple reversal-bounded counters, partially-blind counters, etc.), and simple matrix grammars. The characterizations are then used to show that the boundedness problem for these models is decidable. Another technique uses the concept of the store language of an automaton. This is used to show that the boundedness problem is decidable for pushdown automata that can "flip" their pushdown a bounded number of times, and boundedness remains decidable even if we augment this device with additional stores.

Mary Hall, Cosmin Oancea, Anne C. Elster et al.

Scheduling languages express to a compiler a sequence of optimizations to apply. Compilers that support a scheduling language interface allow exploration of compiler optimizations, i.e., exploratory compilers. While scheduling languages have become a common feature of tools for expert users, the proliferation of these languages without unifying common features may be confusing to users. Moreover, we recognize a need to organize the compiler developer community around common exploratory compiler infrastructure, and future advances to address, for example, data layout and data movement. To support a broader set of users may require raising the level of abstraction. This paper provides a taxonomy of scheduling languages, first discussing their origins in iterative compilation and autotuning, noting the common features and how they are used in existing frameworks, and then calling for changes to increase their utility and portability.

Benjamin Newman, Yoonjoo Lee, Aakanksha Naik et al.

When conducting literature reviews, scientists often create literature review tables - tables whose rows are publications and whose columns constitute a schema, a set of aspects used to compare and contrast the papers. Can we automatically generate these tables using language models (LMs)? In this work, we introduce a framework that leverages LMs to perform this task by decomposing it into separate schema and value generation steps. To enable experimentation, we address two main challenges: First, we overcome a lack of high-quality datasets to benchmark table generation by curating and releasing arxivDIGESTables, a new dataset of 2,228 literature review tables extracted from ArXiv papers that synthesize a total of 7,542 research papers. Second, to support scalable evaluation of model generations against human-authored reference tables, we develop DecontextEval, an automatic evaluation method that aligns elements of tables with the same underlying aspects despite differing surface forms. Given these tools, we evaluate LMs' abilities to reconstruct reference tables, finding this task benefits from additional context to ground the generation (e.g. table captions, in-text references). Finally, through a human evaluation study we find that even when LMs fail to fully reconstruct a reference table, their generated novel aspects can still be useful.

David Wadden, Kejian Shi, Jacob Morrison et al.

We present SciRIFF (Scientific Resource for Instruction-Following and Finetuning), a dataset of 137K instruction-following instances for training and evaluation, covering 54 tasks. These tasks span five core scientific literature understanding capabilities: information extraction, summarization, question answering, claim verification, and classification. SciRIFF is unique in being entirely expert-written, high-quality instruction-following dataset for extracting and synthesizing information from research literature across diverse scientific fields. It features complex instructions with long input contexts, detailed task descriptions, and structured outputs. To demonstrate its utility, we finetune a series of large language models (LLMs) using a mix of general-domain and SciRIFF instructions. On nine out-of-distribution held-out tasks (referred to as SciRIFF-Eval), LLMs finetuned on SciRIFF achieve 70.6% average improvement over baselines trained only on general-domain instructions. SciRIFF facilitates the development and evaluation of LLMs to help researchers navigate the rapidly growing body of scientific literature.

Marvin Ködding, Bianca Truthe

In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. We investigate various comet-like types of languages and compare such language families to some other subregular families of languages (finite, monoidal, nilpotent, combinational, (symmetric) definite, ordered, non-counting, power-separating, suffix-closed, commutative, circular, or union-free languages). Further, we compare the language families defined by these types for the selection with each other and with the families of the hierarchy obtained for external contextual grammars. In this way, we extend the existing hierarchy by new language families.

مرجان وثوقی

با هدف بررسی تاثیر میزان حافظه ی فعال (کارا) در عملکرد کلی و مهارت های نوشتاری (خواندن و نوشتن) در زبان خارجی و غیر بومی، مطالعه ای مروری با طرح نظام مند بر روی 22 مقاله ی استخراج شده از سه پایگاه علمی معتبر داخل و خارج شامل نورمگز، ساینس دایرکت و سیج در فاصله سال های 1990 تا 2021 صورت گرفت. تعداد کل شرکت کنندگان در این مطالعه شامل 1466 فراگیر زن و مرد و در تمام محدوده ی سنی خردسال و بزرگسال بودند. در انتخاب مقالات با لحاظ 7 معیار گوناگون، بر روی مطالعات استخراج شده کد گذاری اعمال و پروتکل تحقیق ارایه شد. پس ار بررسی خطای سوگیری انتشار و پیش فرض ها، نتایج نشان داد که حافظه فعال (کارا) در سطح معناری کمتر از 0.05 و با ضریب تاثیر بالایی (1.05) با جهت مثبت در فاصله ی اطمینان 95% روی یادگیری جنبه های یادگیری زبان دوم بسیار موثر است. در وهله ی دوم، حافظه فعال (کارا) در سطح معناری کمتر از 0.05 و با ضریب تاثیر بالایی در مهارت خواندن و درک مفاهیم (0.6) با جهت مثبت در فاصله ی اطمینان 95% تاثیر معنادار داشته است اما این تاثیر در مهارت های نوشتن در زبان دوم معنادار نبود (0.05 < 0.93 (. نتایج در نهایت با استناد به محدودیت های مرور حاضر تحلیل شدند.

Ziyang Li, Jiani Huang, Mayur Naik

We present Scallop, a language which combines the benefits of deep learning and logical reasoning. Scallop enables users to write a wide range of neurosymbolic applications and train them in a data- and compute-efficient manner. It achieves these goals through three key features: 1) a flexible symbolic representation that is based on the relational data model; 2) a declarative logic programming language that is based on Datalog and supports recursion, aggregation, and negation; and 3) a framework for automatic and efficient differentiable reasoning that is based on the theory of provenance semirings. We evaluate Scallop on a suite of eight neurosymbolic applications from the literature. Our evaluation demonstrates that Scallop is capable of expressing algorithmic reasoning in diverse and challenging AI tasks, provides a succinct interface for machine learning programmers to integrate logical domain knowledge, and yields solutions that are comparable or superior to state-of-the-art models in terms of accuracy. Furthermore, Scallop's solutions outperform these models in aspects such as runtime and data efficiency, interpretability, and generalizability.

Florian Frank, Stefan Milius, Henning Urbat

Positive data languages are languages over an infinite alphabet closed under possibly non-injective renamings of data values. Informally, they model properties of data words expressible by assertions about equality, but not inequality, of data values occurring in the word. We investigate the class of positive data languages recognizable by nondeterministic orbit-finite nominal automata, an abstract form of register automata introduced by Bojańczyk, Klin, and Lasota. As our main contribution we provide a number of equivalent characterizations of that class in terms of positive register automata, monadic second-order logic with positive equality tests, and finitely presentable nondeterministic automata in the categories of nominal renaming sets and of presheaves over finite sets.

Adrian Lehmann, Ben Caldwell, Bhakti Shah et al.

Graphical languages are a convenient shorthand to represent computation, with rewrite rules relating one graph to another. In contrast, proof assistants rely heavily on inductive datatypes, particularly when giving semantics to embedded languages. This creates obstacles to formally reasoning about graphical languages, since imposing an inductive structure obfuscates the diagrammatic nature of graphical languages, along with their corresponding equational theories. To address this gap, we present VyZX, a verified library for reasoning about inductively defined graphical languages. These inductive constructs arise naturally from category-theoretic definitions. We developed VyZX to Verify the ZX-calculus, a graphical langauge for reasoning about quantum computation. The ZX-calculus comes with a collection of diagrammatic rewrite rules that preserve the graph's semantic interpretation. We show how inductive graphs in VyZX are used to prove the soundness of the ZX-calculus rewrite rules and apply them in practice using standard proof assistant techniques. We also provide an IDE-integrated visualizer for proof engineers to directly reason about diagrams in graphical form.

Mario Grobler, Sebastian Siebertz

Büchi's theorem states that $ω$-regular languages are characterized as languages of the form $\bigcup_i U_i V_i^ω$, where $U_i$ and $V_i$ are regular languages. Parikh automata are automata on finite words whose transitions are equipped with vectors of positive integers, whose sum can be tested for membership in a given semi-linear set. We give an intuitive automata theoretic characterization of languages of the form $U_i V_i^ω$, where $U_i$ and $V_i$ are Parikh-recognizable. Furthermore, we show that the class of such languages, where $U_i$ is Parikh-recognizable and $V_i$ is regular is exactly captured by a model proposed by Klaedtke and Ruess [Automata, Languages and Programming, 2003], which again is equivalent to (a small modification of) reachability Parikh automata introduced by Guha et al. [FSTTCS, 2022]. We finish this study by introducing a model that captures exactly such languages for regular $U_i$ and Parikh-recognizable $V_i$.

Thomas A. Henzinger, Pavol Kebis, Nicolas Mazzocchi et al.

The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the \textsc{ExpTime}-hard language inclusion problem for OPLs in exponential time.

Somayyeh Rafighi

A group of professors and philosophers have written a series of articles on the full range of Merleau-Ponty's philosophy, introducing the views of this French phenomenological philosopher, a philosopher who tried to overcome the dichotomies between consciousness and the world as well as consciousness and the body by emphasizing the bodily subject. They aim to acquaint academic and non-university audiences with his ideas. This work, which was published by Cambridge University Press in 2005 in the form of a collection of articles entitled The Cambridge Companion to Merleau-ponty, was translated by Ms. Hanieh Yaseri and published by Ghognoos Publications in Iran in 2012. In this article, we intended to critically examine the Persian translation of this work. Although the author has chosen a valid book for translation, the existence of many formal and content problems, such as not using uniform terms, non-observance of Persian grammar rules, and many inaccuracies, has made the translation of this work have not worthy of its original text and its content don’t understand properly.

Mohsen Rahmati

The Qajar dynasty, which seized political power in Iran at the beginning of the thirteenth century AH, had a tribal origin, but despite extensive research, its origins remain unclear. Clarification of this tribal origin can help to better understand the issues of Qajar history, and the book "Historical Origin of the Qajar Tribe" has been written for this purpose. Since the study and explanation of this historical origin from three perspectives of ethnic genealogy can be explained, the evolution of the identity and endeavors of the tribe during the centuries, and the study of the historical conditions, and the leaders of this tribe were changed to a king of Iran during this period, the question is, which perspective that the author has explained the origin of the Qajar tribe through has been able to clarify the origin of the Qajar tribe. This study shows that the author of this work combines the first two fields and despite the importance of the subject and the multiplicity of sources, which is one of the advantages of the book, due to methodological, literary, and content errors in neither of the above two areas, he has not able to clarify the origin of the Qajars.

چنگیز مولایی

در میان آثار فاخر فارسی، درون مایۀ هیچ اثری به اندازۀ شاهنامۀ فردوسی با موضوع «ملیّت ایرانی» و «هویّت ملّی ایرانیان» گره نخورده است. عناصر و نمادهای ملّی نظیر «سرزمین» با مرزهای مشخّص جغرافیایی (خواه اساطیری یا واقعی)، آداب و رسوم و سنن، تاریخ، زبان ملّی مشترک و بالاخره جایگاه مردم و دین و دولت، جای جای در این اثر سترگ و بی همتا تظاهر یافته است و به همین لحاظ شاهنامه را به حق «سند هویّت ملّی ایرانیان» دانسته اند. اما اینکه دوام و بقای «ملیّت ایرانی» تا چه اندازه مدیون حکیم طوس و شاهنامۀ او است، پرسشی است که گرچه در وهلۀ نخست پاسخ بدان دشوار می نماید، لیکن به نظر می رسد با مرور اجمالی تکوین پدیده هایی که به شکل گیری «ملیّت ایرانی» در جهان باستان و به تبع آن تدوین و تنظیم افسانه ها و روایت هایی انجامید که به طریق تاریخ روایی در باب تکوین ملیّت و مظاهر مختلف فرهنگی ایرانیان بازگو شده اند، بتوان پاسخی مناسب برای آن ارائه کرد.

محمدنبی احمدی, حمزه بیغال

یکی از راه‌های تبادل فرهنگی در جوامع، عنصر ترجمه است. بهره‌گیری از زبان‌شناختی و شگردهای ترجمه، موجب پدیداری ترجمه‌ای روان، قابل فهم و همچنین پیشرفت اهداف علمی، اجتماعی و انسان‌شناسی می‌شود. برخی از شگردهای ترجمه، مبتنی بر نگرش مونیلا و البیر (2002) عبارتند از: اقتباس، بسط، وامگیری، گرته‌برداری، توصیف، معادل‌یابی، جایگزینی، جابجایی، تخصیص و ... . پژوهش حاضر، طبق نظریه‌های زبان‌شناختی و شگردهای ترجمه، همانند نظریۀ رومن یاکوبسن (1959/114:2000) به‌نقد و بررسی رمان "اللّیل فی نعمائه" تألیف زید الشهید پرداخته است. ایلیا آل خمیس در ترجمۀ این رمان، به‌خوبی از پس ترجمه‌های توصیفی- تحلیلی برآمده، و برخی از واژه‌ها را بر اساس ساخت دستوری یا مشابه بودن در موقعیت ترجمه کرده و از ترجمۀ مستقیم بین‌زبانی یا ترجمۀ واقعی کلمه، از زبانی ملفوظ ‌به‌یک زبان ملفوظ دیگر استفاده کرده است؛ اما برخی از واژه‌ها را تحت‌اللّفظی ترجمه کرده؛ حتی برخی از جمله‌ها را حذف یا تقطیع کرده است؛ که مناسب و همگام با سیاق رمان نیست. همچنین در ترجمۀ این رمان، از روش‌های ترجمۀ غیرمستقیم کمتر استفاده شده و از شگردهای ترجمه (معادل‌یابی، همانندسازی، جایگزینی و...) به‌درستی و در جای مناسب استفاده نشده است؛ که باعث پایین آمدن بار ادبی رمان شده است. این پژوهش بنابر نظریه‌های زبان‌شناختی و با بهره‌بری از شگردهای ترجمه، ترجمۀ مذکور را مورد بحث و بررسی گذارده و برخی از واژه‌ها را برابریابی یا جایگزین کرده و در صدد بیان کاستی‌های موجود در رمان برآمده است؛ تا رمان را پرمحتوا جلوه دهد.

Zahra Rahmani, Mahoubeh Khorasani, Morteza Rashidi

Abstract Humor in terms of content is a literary genre in which the writer and the poet express the causes and reasons of backwardness, defects, corruptions, and painful inadequacies of a society with an intentionally adjusting look with a taste of laughter in an exaggerated way. The four main elements of "laughter", "exaggeration", "social criticism" and "reformism" are involved in the formation of any humorous writing. Although a humorous look to reveal political and social anomalies and problems has always existed in the Iranian history and literature, it can not be compared, in terms of frequency and stylistic characterization, with the humor of the constitutional era. The relatively free and temporary atmosphere which was created for the writers and poets along with the emerging of newspaper media provided enough appeal for satirists to write. In Isfahan, the Naqour newspaper began to be published, imitating Mollansereddin and Sur Israfil. In the column "Ugly and Beautiful", which was probably written following Dehkhoda's "Nonsense and Birds", interesting humorous content was inserted. This article is qualitative research and examines the text of the column "Ugly and Beautiful" in the whole statistical community published for one year. The method of analysis is documentation (newspaper) and content analysis from a satirical perspective. Naqour newspaper (published in Isfahan from 1326 to 1327) was published under the management of Mirza Masih Tuyserkani. Its first issue was published on the 26th of Rabi al-Awal, 1326 AH, in Isfahan. This newspaper criticized the events of the society of that time and the activities of the Isfahan Provincial Association with a humorous and sometimes satirical expression. In its humor, Naqour, while playing with words and interpreting them, has used allegories and anecdotes to criticize the political situation of the country, and in this way, it has made humorous use of proverbs and presenting the letters of the readers. Most of Naqour's political satires are interpretive and how those satires deal with current events. Its distinctive feature is the use of humor, language, and folklore, especially since this newspaper was one of the local newspapers and was published in Isfahan. It has tried to use the dialect and idioms of Isfahanians and sometimes the Armenian minority. In the ‘Ugly and Beautiful’ column of Naqour newspaper, most of the content is related to the country. The relatively high level of political issues in the newspaper is influenced by the main function of this newspaper as a political tool, and the most important political issue raised in the Naqour newspaper is the criticism of the Isfahan Governors’ Association. In this newspaper, occasionally dealing with religious issues is only for the sake of the judiciary and the unjust behavior of that power. Otherwise, the humor and joke of the newspaper do not include this field, because the writers use religion as a lever of pressure or threat when they want to clarify something that is religiously understandable to the people or to respect the rights of the people by the authorities with a humorous and of course softened look.

Esmaeil Sangari, Alireza Karbasi

The approach of contemporary western historians on the term of “Philhellen” on the coins of the Parthian kings has two types of interpretations. Some consider the superiority of Greek culture to Persian culture in Parthian period, and it is considered as a kind of unconditional and cultural surrender to Greek culture. Some other viewpoints, most of which are based on the later Western historians’ viewpoints, are that this term was used as a "political trick" by Parthian kings in order to control the Greek settlers in their territory. In this view, the use of the term on Parthian coins has not meant the unconditional surrender of Iranian culture to Greek culture, and its whole meaning has not been summed up in political goals, necessarily. What was created during Helenism and especially under the influence of stoic thoughts and its Iranian roots of thought was a global approach to the concept of humanity, which was fundamentally different from that of the Greeks before. This issue was compatible with Iranians’ perception from the global society that was rooted in Zoroastrian thoughts in Achaemenid period. Thus, the Parthian kings, using this interpretation, in fact, admire a kind of Greek culture that has a global and non-transcendental attitude towards human society and so that paved the way for its absorption in Iranian culture. This paper aims to provide a moderate judgment with a cultural-sociological approach by showing the cultural difference between Greeks and Iranians in the Hellenistic period and before that, using literary and archaeological evidence, with a descriptive-analytical method.

Fabian Birkmann, Stefan Milius, Henning Urbat

Eilenberg's variety theorem marked a milestone in the algebraic theory of regular languages by establishing a formal correspondence between properties of regular languages and properties of finite monoids recognizing them. Motivated by classes of languages accepted by quantum finite automata, we introduce basic varieties of regular languages, a weakening of Eilenberg's original concept that does not require closure under any boolean operations, and prove a variety theorem for them. To do so, we investigate the algebraic recognition of languages by lattice bimodules, generalizing Klima and Polak's lattice algebras, and we utilize the duality between algebraic completely distributive lattices and posets.