Results 41 to 50 of about 164 (69)

Indonesian Parsing using Probabilistic Context-Free Grammar (PCFG) and Viterbi-Cocke Younger Kasami (Viterbi-CYK)

2020 3rd International Seminar on Research of Information Technology and Intelligent Systems (ISRITI), 2020
Parsing is a tool for understanding natural grammar patterns. The problem of structural ambiguity in identifying sentence patterns often occurs in parsing. Syntactic parsing is one approach to solving structural ambiguity problems using the Probabilistic Context-Free Grammar (PCFG) and Viterbi-Cocke Younger Kasami (Viterbi-CYK) methods.
Denis Eka Cahyani   +2 more
openaire   +2 more sources

A Recognizer and Parser for Basic Sentences in Telugu using CYK Algorithm

2023 3rd International Conference on Intelligent Technologies (CONIT), 2023
The scientific and technical field of computational linguistics seeks to comprehend spoken and written language from a computational standpoint. The way of describing rules and semantics in linguistics paved the beginning of natural language processing ...
S. Varshini   +2 more
semanticscholar   +1 more source

A System for Recognizing Online Handwritten Mathematical Expressions and Improvement of Structure Analysis

2014 11th IAPR International Workshop on Document Analysis Systems, 2014
This paper presents a system for recognizing online handwritten mathematical expressions (MEs) and improvement of structure analysis. We represent MEs in Context Free Grammars (CFGs) and employ the Cocke-Younger-Kasami (CYK) algorithm to parse 2D ...
A. D. Le, T. V. Phan, M. Nakagawa
semanticscholar   +1 more source

Analisis Kompeksitas Algoritma CYK untuk Aplikasi dalam Pemrosesan Bahasa Indonesia

RIGGS: Journal of Artificial Intelligence and Digital Business
Pemrosesan Bahasa Alami (Natural Language Processing/NLP) memerlukan parser sintaksis yang mampu menganalisis struktur kalimat secara akurat dan transparan.
R. Maulana   +9 more
semanticscholar   +1 more source

On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms

arXiv.org
Asymptotically tight lower bounds are derived for the Input/Output (I/O) complexity of a class of dynamic programming algorithms including matrix chain multiplication, optimal polygon triangulation, and the construction of optimal binary search trees ...
L. Stefani, Vedant Gupta
semanticscholar   +1 more source

A Speech2Text based Recognizer and Probabilistic Parser Application for TeluguSentences

International Conference on Computing Communication and Networking Technologies
Telugu, the largest Dravidian language, is one of the Indian languages that is predominantly spoken in Andhra Pradesh, Telangana and a few parts of southern India.
S. Varshini   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy