Results 91 to 100 of about 143,606 (204)
ABSTRACT A large part of data science projects is spent on data engineering. Especially in open data contexts, data quality issues are prevalent and are often tackled by non‐professional programmers. We introduce and evaluate Jayvee, a domain‐specific language for data engineering aimed at reducing barriers to building data pipelines.
Philip Heltweg+3 more
wiley +1 more source
On equivalence of grammars through transformation trees
AbstractOne approach to solving the equivalence problem for certain families of context free languages is through the use of ‘transformation trees’. We explore this approach in general. The methods developed provide a clear and complete proof of the decidability of the equivalence problem for ‘simple’ languages.
Michael A. Harrison+2 more
openaire +2 more sources
Higher-Order Nonemptiness Step by Step [PDF]
We show a new simple algorithm that checks whether a given higher-order grammar generates a nonempty language of trees. The algorithm amounts to a procedure that transforms a grammar of order n to a grammar of order n-1, preserving nonemptiness, and increasing the size only exponentially.
arxiv
Abstract The theory of language socialization and its subfield academic discourse socialization consider how newcomers are socialized into the practices and identities of communities through interaction with various communicative partners. Drawing on the framework of individual networks of practice, this case study considers the academic writing ...
John Bankier
wiley +1 more source
Generative AI detection in higher education assessments
Abstract This chapter presents a critical analysis of generative AI (GenAI) detection tools in higher education assessments. The rapid advancement and widespread adoption of GenAI, particularly in education, necessitates a reevaluation of traditional academic integrity mechanisms.
Cesare Giulio Ardito
wiley +1 more source
Charts, Interaction-Free Grammars, and the Compact Representation of Ambiguity [PDF]
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell 96]. This paper clarifies the mathematical foundations of these techniques, provides a uniform framework in which they can be formally studied and eliminates the need for special ...
arxiv
Syntax in Croatian Grammar Books of the 20th Century
The article deals with the syntactic descriptions of the Croatian language in the 20th century grammar books. The first half of the century was marked by the two books- Gramatika i stilistika hrvatskoga ili srpskoga jezika by Tomo Maretić and Gramatika ...
Diana Stolac
doaj
Syntactic Structures: Formal Considerations 60 Years Later
Chomsky (1955), The Logical Structure of Linguistic Theory (henceforth LSLT), laid out in great detail the formal foundations for a rigorous new way of looking at language scientifcally, transformational generative grammar.
Howard Lasnik
doaj +1 more source
ON THE IRRELEVANCE OF TRANSFORMATIONAL GRAMMAR TO SECOND LANGUAGE PEDAGOGY [PDF]
John T. Lamendella
openalex +1 more source
Applications of a computer system for transformational grammar [PDF]
Joyce Friedman
openalex +1 more source