Results 1 to 10 of about 304,382 (268)
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
An Approach to Analyze the Ambiguity in RNA Structure
Sultan Qaboos University Journal for Science, 2010 DNA and RNA are two very important bio-molecules of the human cell. RNA is the second major form of nucleic acid in human cells that plays an intermediary role between DNA and functional protein. Several classes of RNA’s are found in cells, each with a /
Shailendra Singh, Amardeep Singh
doaj +1 more source
Synthesis of nested loop exercises for practice in introductory programming
Egyptian Informatics Journal, 2023 Novice programmers struggle to comprehend specific programming constructs such as arrays, recursion, and loops. One way to address this challenge is to provide practice problems for students in these topics that are considered difficult to comprehend ...
Chinedu Wilfred Okonkwo +1 more
doaj
Evaluating two methods for Treebank grammar compaction [PDF]
, 1999 Treebanks, such as the Penn Treebank, provide a basis for the automatic creation of broad coverage grammars. In the simplest case, rules can simply be ‘read off’ the parse-annotations of the corpus, producing either a simple or probabilistic context-free
Gaizauskas, R. +3 more
core +1 more source
Synthesizing Program Input Grammars
, 2017 We present an algorithm for synthesizing a context-free grammar encoding the language of valid program inputs from a set of input examples and blackbox access to the program.
Albarghouthi A. +14 more
core +1 more source
Towards Robustness in Parsing - Fuzzifying Context-Free Language Recognition [PDF]
, 1995 We discuss the concept of robustness with respect to parsing a context-free language. Our approach is based on the notions of fuzzy language, (generalized) fuzzy context-free grammar and parser / recognizer for fuzzy languages.
Asveld, Peter R.J.
core +3 more sources
Confluent Orthogonal Drawings of Syntax Diagrams
, 2015 We provide a pipeline for generating syntax diagrams (also called railroad diagrams) from context free grammars. Syntax diagrams are a graphical representation of a context free language, which we formalize abstractly as a set of mutually recursive ...
A Goldberg +13 more
core +1 more source
A matter of time: Implicit acquisition of recursive sequence structures [PDF]
, 2009 A dominant hypothesis in empirical research on the evolution of language is the following: the fundamental difference between animal and human communication systems is captured by the distinction between regular and more complex non-regular grammars ...
Araújo, S. +5 more
core +1 more source
Developing a TT-MCTAG for German with an RCG-based parser [PDF]
, 2008 Developing linguistic resources, in particular grammars, is known to be a complex task in itself, because of (amongst others) redundancy and consistency issues.
Dellert, Johannes +4 more
core +1 more source
A Grammar Compression Algorithm based on Induced Suffix Sorting
, 2017 We introduce GCIS, a grammar compression algorithm based on the induced suffix sorting algorithm SAIS, introduced by Nong et al. in 2009. Our solution builds on the factorization performed by SAIS during suffix sorting.
Ayala-Rincón, Mauricio +4 more
core +1 more source