Results 1 to 10 of about 27,476 (181)
“gnparser”: a powerful parser for scientific names based on Parsing Expression Grammar [PDF]
Background Scientific names in biology act as universal links. They allow us to cross-reference information about organisms globally. However variations in spelling of scientific names greatly diminish their ability to interconnect data.
Dmitry Y. Mozzherin +2 more
doaj +6 more sources
Parsing Expression Grammars and Their Induction Algorithm [PDF]
Grammatical inference (GI), i.e., the task of finding a rule that lies behind given words, can be used in the analyses of amyloidogenic sequence fragments, which are essential in studies of neurodegenerative diseases.
Wojciech Wieczorek +2 more
doaj +6 more sources
Linear Parsing Expression Grammars [PDF]
PEGs were formalized by Ford in 2004, and have several pragmatic operators (such as ordered choice and unlimited lookahead) for better expressing modern programming language syntax.
Nariyoshi Chida, Kimio Kuramitsu
core +5 more sources
Derivatives of Parsing Expression Grammars [PDF]
This paper introduces a new derivative parsing algorithm for recognition of parsing expression grammars. Derivative parsing is shown to have a polynomial worst-case time bound, an improvement on the exponential bound of the recursive descent algorithm ...
Aaron Moss
doaj +5 more sources
Parsing expression grammars made practical [PDF]
Parsing Expression Grammars (PEGs) define languages by specifying recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and ...
Nicolas Laurent, Kim Mens
core +5 more sources
On the relation between context-free grammars and parsing expression grammars [PDF]
Context-Free Grammars (CFGs) and Parsing Expression Grammars (PEGs) have several similarities and a few differences in both their syntax and semantics, but they are usually presented through formalisms that hinder a proper comparison.
Fabio Mascarenhas +2 more
core +6 more sources
TRX: A Formally Verified Parser Interpreter [PDF]
Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser interpreter formally developed in the proof assistant Coq, capable of producing
Adam Koprowski, Henri Binsztok
doaj +4 more sources
الاضطرابات الفكرية في تعدد الأوجه الإعرابية
وقف الباحث على جملة من الشواهد النحوية غير المستأنسة من الفترة التي شهدت نشأة النحو وتقعيده إلى القرن الرابع الهجري، وذلك في مسألة تعدد الأوجه الإعرابية في المسألة الواحدة؛ إذ يرى فيها اضطرابًا بيِّنًا، موضِّحا أسباب ذلك الاضطراب وبواعثه التي تتجلى في ...
يحيى بن محمد بن عبدالله البلوشي
doaj +1 more source
Obtaining valuable clues for noncoding RNA (ribonucleic acid) subsequences remains a significant challenge, acknowledging that most of the human genome transcribes into noncoding RNA parts related to unknown biological operations.
Christos Andrikos +5 more
doaj +1 more source
Open Chinese Entity Relation Extraction Method Based on Dependency Parsing [PDF]
Entity relation extraction is a part of the Information Extraction(IE).Its objective refers to determining whether there is a kind of semantic relationship between entities.To break the limitations of complex Chinese grammar,flexible expression and ...
LI Mingyao,YANG Jing
doaj +1 more source

