Results 221 to 230 of about 226,863 (285)

Coarse classification using a hierarchical decision tree and top down parsing

ICASSP '86. IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005
In this paper, we describe a robust technique for segmenting an utterance into a sequence of coarse phonetic classes. The resulting coarse class string is used to provide contextual information for further phonetic analysis, and in lexical access to limit the number of word candidates.
Lynn Wilcox, B. Lowerre
semanticscholar   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Predictive Top-Down Parsing for Hyperedge Replacement Grammars

International Conference on Graph Transformation, 2015
Graph languages defined by hyperedge replacement grammars can be NP-complete. We invent predictive top-down (PTD) parsers for a subclass of these grammars, similar to recursive descent parsers for string languages. The focus of this paper lies on the grammar analysis that computes neighbor edges of nonterminals, in analogy to the first and follow ...
Mark Minas, Berthold Hoffmann, Frank Drewes   +2 more
openaire   +2 more sources

Top-Down Parsing Error Correction Applied to Part of Speech Tagging

Communication Systems and Applications, 2020
Natural Language Processing (NLP) applications are growing in popularity and importance, all of these applications rely upon the basic steps of tokenization, stemming and Part-of-Speech tagging (POS), and while those steps already work really well on English texts, the same cannot be said for every language.
Alexandre B. Pigozzo, Ygor Henrique de Paula Barros Baêta, Carolina Ribeiro Xavier   +2 more
openaire   +3 more sources

A translation machine with automated top-down parsing

ACM SIGPLAN Notices, 1976
The top-down method of parsing programming languages has been widely used in commercially available compilers. Suprisingly, techniques for automating syntax-directed, top-down parsing have not been <u>widely</u> available. This paper describes a practical top-down parsing method which is a part of a general purpose <u>translation ...
Harold W. Lawson, David R. Doucette
openaire   +3 more sources

A Top-Down Model for Character-Level Chinese Dependency Parsing [PDF]

China National Conference on Chinese Computational Linguistics, 2019
This paper proposes a novel transition-based algorithm for character-level Chinese dependency parsing that straightforwardly models the dependency tree in a top-down manner. Based on the stack-pointer parser, we joint Chinese word segmentation, part-of-speech tagging, and dependency parsing in a new way.
Yufeng Chen, Yujie Zhang, Jinan Xu, Yuanmeng Chen (陈圆梦), Hang Liu   +4 more
openaire   +2 more sources

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

, 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 TAG derivation.
Ji, Jing
openaire   +5 more sources

An integrated bottom-up and top-down computing process for car parsing

SPIE Proceedings, 2009
This paper presents an integrated bottom-up and top-down computing process for parsing cars. By parsing, it means detecting all instances in an input image, and aligning their constituent parts, if appeared. The output of parsing is to construct configurations of car instances.
Xiong Yang, Tianfu Wu, Nong Sang
openalex   +3 more sources