6 articles for “Parsing algorithm”

Set a search alert

Research ArticleOpen accessIn the keywordsPacked Forest Chart ParserQi Haoliang, Li Sheng, Yang Muyun, Zhao TiejunPacked forest chart parser, like the traditional chart parsing algorithm, uses charts to store all the information produced while parsing to avoid redundant works. Its advantage over the traditional chart parser was the packed forest representation. The algorithm not only shares the non-terminal categories as what was done in the shared parse forest, but also shares the leftmost common elements. … …Journal of Computer Science, Vol. 3, Issue 1 · 31 Jan 2007 · 6,556 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSQL Generation from Natural Language: A Sequence-to-Sequence Model Powered by the Transformers Architecture and Association RulesYoussef Mellah, Abdelkader Rhouati, El Hassane Ettifouri et al.Using Natural Language (NL) to interacting with relational databases allows users from any background to easily query and analyze large amounts of data. This requires a system that understands user questions and automatically converts them into structured query language such as SQL. The best performing Text-to-SQL systems use supervised learning (usually formulated as a classification problem) by approaching this task … …Journal of Computer Science, Vol. 17, Issue 5 · 23 May 2021 · 10,027 accessesView PDF Cite

Research ArticleOpen accessIn the abstractONCObc-ST: An Improved Clinical Reasoning Algorithm Based on Select and Test (ST) Algorithm for Diagnosing Breast CancerOlaide Nathaniel Oyelade, Sunday Adeyemi AdewuyiThe need for an accurate reasoning algorithm is usually necessitated by the sensitivity of domain of (medicine as example) application of such algorithms. Most reasoning algorithms for medical diagnosis are either limited by their techniques or accuracy and efficiency. Even the Select and Test (ST) algorithm which is considered a more approximate reasoning algorithm is also limited by its approach … …Current Research in Bioinformatics, Vol. 8, Issue 1 · 15 Apr 2019 · 7,162 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA New Indexing Technique for Information Retrieval Systems Using Rhetorical Structure Theory (RST)Muhammad Shoaib, Abad Ali ShahEffective information retrieval requires an efficient indexing technique. With the availability of huge volume of information, it has become necessary to capture the semantic of the document, which is almost impossible with the existing techniques. Moreover in the existing technique the weights once assign are remains unchangeable through out the cycle. In this paper an indexing technique assignment using Rhetorical … …Journal of Computer Science, Vol. 2, Issue 3 · 31 Mar 2006 · 7,406 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordTree Rotations for Dependency Trees: Converting the Head-Directionality of Noun PhrasesIka Alfina, Indra Budi, Heru SuhartantoTo overcome the lack of NLP resources for the low-resource languages, we can utilize tools that are already available for other highresource languages and then modify the output to conform to the target language. In this study, we proposed an approach to convert an Indonesian constituency treebank to a dependency treebank by utilizing an English NLP tool (Stanford CoreNLP) to … …Journal of Computer Science, Vol. 16, Issue 11 · 17 Nov 2020 · 7,796 accessesView PDF Cite

Research ArticleOpen accessAll words, across the recordCTSS: A Tool for Efficient Information Extraction with Soft Matching Rules for Text MiningA. Christy, P. ThambiduraiThe abundance of information available digitally in modern world had made a demand for structured information. The problem of text mining which dealt with discovering useful information from unstructured text had attracted the attention of researchers. The role of Information Extraction (IE) software was to identify relevant information from texts, extracting information from a variety of sources and aggregating it … …Journal of Computer Science, Vol. 4, Issue 5 · 31 May 2008 · 6,892 accessesView PDF Cite