Results 151 to 160 of about 146,311 (198)

Paraphrase and translation: the importance of being close. [PDF]

Open Res Eur
Santos D, Barreiro A.
europepmc   +1 more source

Exploring the Association Between Textual Parameters and Psychological and Cognitive Factors. [PDF]

Psychol Res Behav Manag
Uludag K.
europepmc   +1 more source

Unsupervised decomposition of natural monkey behavior into a sequence of motion motifs. [PDF]

Commun Biol
Mimura K, Matsumoto J, Mochihashi D, Nakamura T, Nishijo H, Higuchi M, Hirabayashi T, Minamimoto T.   +7 more
europepmc   +1 more source

Natural language acquisition and gestalt language processing: A critical analysis of their application to autism and speech language therapy. [PDF]

Autism Dev Lang Impair
Hutchins TL, Knox SE, Fletcher EC.
europepmc   +1 more source

Automatic distractor generation in multiple-choice questions: a systematic literature review. [PDF]

PeerJ Comput Sci
Awalurahman HW, Budi I.
europepmc   +1 more source

Business Intent and Network Slicing Correlation Dataset from Data-Driven Perspective. [PDF]

Sci Data
Li J, Zou S, Sun Y, Gao H, Ni W.
europepmc   +1 more source

A concise guide to essential R packages for analyses of DNA, RNA, and proteins. [PDF]

Mol Cells
Chua EW, Ooi J, Nor Muhammad NA.
europepmc   +1 more source

Parsing expression grammars

ACM SIGPLAN Notices, 2004
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ambiguity is crucial to their original purpose of modelling natural languages, but this ...
Bryan Ford
  +6 more sources

Some Aspects of Parsing Expression Grammar

Fundamenta Informaticae, 2008
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a topdown processwith limited backtracking. It can be directly transcribed into a recursive-descent parser. The parser does not require a separate lexer, and backtracking removes the usual LL(1) constraint. This is convenient for many applications, but there are two problems:
Roman R. Redziejowski
  +5 more sources