Results 21 to 30 of about 859,079 (303)
J. Autom. Lang. Comb., 2023 Context-free languages can be characterized in several ways. This article studies projective linearisations of languages of simple dependency trees, i. e., dependency trees in which a node can govern at most one node with a given syntactic function. We prove that the projective linearisations of local languages of simple dependency trees coincide with ...
openaire +5 more sources
The FC-rank of a context-free language [PDF]
Information Processing Letters, 2012 We prove that the finite condensation rank (FC-rank) of the lexicographic ordering of a context-free language is strictly less than @w^@w.
Arnaud Carayol, Z. Ésik
semanticscholar +1 more source
On Parsing Programming Languages with Turing-Complete Parser
Mathematics, 2023 A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for parsing any recursively enumerable language.
Boštjan Slivnik, Marjan Mernik
doaj +1 more source
Complexity of Problems of Commutative Grammars [PDF]
Logical Methods in Computer Science, 2015 We consider commutative regular and context-free grammars, or, in other words, Parikh images of regular and context-free languages. By using linear algebra and a branching analog of the classic Euler theorem, we show that, under an assumption that the ...
Eryk Kopczynski
doaj +1 more source
Children, 2022 Autism spectrum disorder (ASD) is characterized by impairments in the use of appropriate interactive language (including structural language and pragmatic skills) in social contexts.
Jinhuan Yang, Wentao Gu, Chen Feng
doaj +1 more source
Context-Free Languages, Coalgebraically [PDF]
, 2011 We give a coalgebraic account of context-free languages using the functor D(X) = 2 × XA for deterministic automata over an alphabet A, in three different but equivalent ways: (i) by viewing context-free grammars as D-coalgebras; (ii) by defining a format for behavioural differential equations (w.r.t.
J. Winter (Joost) +2 more
openaire +5 more sources
Partial Word Order Syntax of Urdu/Sindhi and Linear Specification Language
JISR Management and Social Sciences & Economics, 2007 Like most of the South-Asian languages Urdu and Sindhi are partial word order languages. Conventional syntax representation models like Context Free Grammars are not capable enough to cope with partial word order syntax.
Mutee-u- Rahman +2 more
doaj +1 more source
Towards a Context-Free Machine Universal Grammar (CF-MUG) in Natural Language Processing
IEEE Access, 2020 In natural language processing, semantic document exchange ensures unambiguity and shares the same meaning for documents sender and receiver cross different natural languages (e.g., English to Chinese), this difference makes the translation between ...
Quanyi Hu +3 more
doaj +1 more source
THE LIMITS OF THE FORMAL TREATMENT OF LANGUAGE
Studia Universitatis Babeș-Bolyai. Philosophia, 2019 The Limits of the Formal Treatment of Language. Within the philosophy of language, there is a distinction between the natural language philosophers and the ideal language philosophers. The distinction is drawn based on the way these philosophers reflect
P. Alpár GERGELY
doaj +1 more source
KONTRIBUSI BAHASA ARAB TERHADAP BAHASA INDONESIA
Hunafa: Jurnal Studia Islamika, 2005 The development of a language is not free from the influences of other languages. For example, as an official language, Indonesian language used by Indonesians, is not free from the influences of other languages, either local languages such as Javanese ...
Rusdin Rusdin
doaj +1 more source