4 citations · 8 across the 6 of their papers we have counts for
Showing cs.CLShow all
3 papers · 1 filter
cs.CL2021
From n-grams to trees in Lindenmayer systems
Diego Gabriel Krivochen
In this paper we present two approaches to Lindenmayer systems: the rule-based (or generative) approach, which focuses on L-systems as Thue rewriting systems and a constraint-based…
cs.CL2018
On Folding and Twisting (and whatknot): towards a characterization of workspaces in syntax
Diego Gabriel Krivochen
Syntactic theory has traditionally adopted a constructivist approach, in which a set of atomic elements are manipulated by combinatory operations to yield derived, complex elements…
cs.CL2016
Divide and...conquer? On the limits of algorithmic approaches to syntactic semantic structure
Diego Gabriel Krivochen
In computer science, divide and conquer (D&C) is an algorithm design paradigm based on multi-branched recursion. A D&C algorithm works by recursively and monotonically breaking dow…