Results 21 to 30 of about 75,315 (101)

Automatic evaluation of top-down predictive parsing [PDF]

open access: yes, 2016
We develop efficient methods to check whether two given Context-Free Grammars (CFGs) are transformed into parsers that recognize the same language and construct the same Abstract Syntax Trees (ASTs) for each input. In this setting, we consider a model of
Creus, Carles   +3 more
core   +2 more sources

Top-Down Online Handwritten Mathematical Expression Parsing with Graph Grammar [PDF]

open access: bronze, 2015
In recognition of online handwritten mathematical expressions, symbol segmentation and classification and recognition of relations among symbols is managed through a parsing technique. Most parsing techniques follow a bottom-up approach and adapt grammars typically used to parse strings.
Frank Julca-Aguilar   +3 more
openalex   +4 more sources

Top-Down RST Parsing Utilizing Granularity Levels in Documents

open access: goldProceedings of the AAAI Conference on Artificial Intelligence, 2020
Some downstream NLP tasks exploit discourse dependency trees converted from RST trees. To obtain better discourse dependency trees, we need to improve the accuracy of RST trees at the upper parts of the structures. Thus, we propose a novel neural top-down RST parsing method.
Naoki Kobayashi   +4 more
openalex   +3 more sources

Efficiency of Top-Down Parsing of Recursive Adjunction for Tree Adjoining Grammar [PDF]

open access: yes, 2021
CKY-type parser and Earley-type parser are two widely-used parsing algorithms for Tree Adjoining Grammar (TAG). In contrast, a standard top-down parser is not efficient since the looping problem occurs during both the left and right recursion of standard
Ji, Jing
core   +5 more sources

A new top-down parsing algorithm for left-recursive DCGs [PDF]

open access: closed, 1993
In this paper we introduce a new parsing algorithm, called cancellation parsing. Deterministic cancellation parsing with lookahead k can handle the C(k) grammars, which include the LL(k) grammars and are contained in the LC(k) grammars.
Mark-Jan Nederhof
openalex   +2 more sources

COSMO-Onset: A Neurally-Inspired Computational Model of Spoken Word Recognition, Combining Top-Down Prediction and Bottom-Up Detection of Syllabic Onsets

open access: yesFrontiers in Systems Neuroscience, 2021
Recent neurocognitive models commonly consider speech perception as a hierarchy of processes, each corresponding to specific temporal scales of collective oscillatory processes in the cortex: 30–80 Hz gamma oscillations in charge of phonetic analysis, 4 ...
Mamady Nabé   +3 more
doaj   +1 more source

On Parsing Programming Languages with Turing-Complete Parser

open access: yesMathematics, 2023
A new parsing method based on the semi-Thue system is described. Similar to, but with more efficient implementation than Markov normal algorithms, it can be used for parsing any recursively enumerable language.
Boštjan Slivnik, Marjan Mernik
doaj   +1 more source

Parameters of Cross-linguistic Variation in Expectation-based Minimalist Grammars (e-MGs)

open access: yesIJCoL, 2023
The fact that Parsing and Generation share the same grammatical knowledge is often considered the null hypothesis (Momma and Phillips 2018) but very few algorithms can take advantage of a cognitively plausible incremental procedure that operates roughly ...
Cristiano Chesi
doaj   +1 more source

Statistical Deep Parsing for Spanish: Abridged Version

open access: yesCLEI Electronic Journal, 2022
This document presents the development of a statistical HPSG parser for Spanish. HPSG is a deep linguistic formalism that combines syntactic and semantic information in the same representation, and is capable of elegantly modeling many linguistic ...
Luis Chiruzzo
doaj   +1 more source

Home - About - Disclaimer - Privacy