Results 1 to 10 of about 133 (38)
CYK Parsing over Distributed Representations [PDF]
Algorithms, 2020 Parsing is a key task in computer science, with applications in compilers, natural language processing, syntactic pattern matching, and formal language theory.
Fabio Massimo Zanzotto +2 more
doaj +2 more sources
Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2023 Verification of hierarchical plans deals with the problem of whether an action sequence is causally consistent and can be obtained by a decomposition of a goal task.
Simona Ondrčková +3 more
doaj +2 more sources
Generation of Syntax Parser on South Indian Language using Bottom-Up Parsing Technique and PCFG [PDF]
Journal of Information Technology Management, 2023 In our research, we provide a statistical syntax parsing method experimented on Kannada texts, which is an official language of Karnataka, India. The dataset is downloaded from TDIL website.
M. Rajani Shree, Shambhavi B. R.
doaj +1 more source
, 2020 Penggunaan kata baku dan struktur kalimat merupakan salah satu syarat dalam penulisan laporan penelitian, tanpa disadari kesalahan penulisan dapat terjadi baik berupa kesalahan pengetikan maupun pada struktur kalimat, beberapa penyebabnya ialah kebiasaan
B. Prabowo +2 more
semanticscholar +1 more source
String Parsing Using a Fuzzy Context-Free Pattern
Proceedings of Computer Science and Information Technologies 2023 Conference, 2023 This paper is devoted to determining the degree of compliance of a given string with a pattern represented as a context-free grammar, the terminal symbols of which are fuzzy properties of the characters of the base alphabet.
A. Kostanyan, Anna Gevorgyan
semanticscholar +1 more source
Cocke-Younger-Kasami-Schwartz-Zippel algorithm and relatives [PDF]
arXiv.org, 2022 The equivalence problem for unambiguous grammars is an important, but very difficult open question in formal language theory. Consider the limited equivalence problem for unambiguous grammars — for two unambiguous grammars G 1 and G 2 , tell whether or not
V. Makarov
semanticscholar +1 more source
Enhancing the LR Parsing Strategy Using Incremental GPLR Parsing Method
مجلة علوم ذي قار, 2019 Parsers in modern integrated development environments (IDEs) for generalpurpose languages are virtually all of ad hoc, recursive descent variety. While such parsers have many disadvantages when compared with machine-generated LALR(1) parsers but they ...
Mouiad Abid Hani +1 more
doaj +4 more sources
Gentree of Tool for Syntactic Analysis Based On Younger Cocke Kasami Algorithm
, 2017 Syntactic analysis is a series of processes in order to validate a string that is received by a language. Understanding the process of reduction rules to become a tree is the part that is difficult to explain.
Wijanarto +2 more
semanticscholar +1 more source
Certified CYK parsing of context-free languages
J. Log. Algebraic Methods Program., 2014 Denis Firsov, T. Uustalu
semanticscholar +1 more source
Learning CFG using Improved TBL algorithm
, 2012 Nisha Bhalse, Vivek Gupta
semanticscholar +1 more source