Results 1 to 10 of about 182,970 (219)

SmBoP: Semi-autoregressive Bottom-up Semantic Parsing [PDF]

Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2021
The de-facto standard decoding method for semantic parsing in recent years has been to autoregressively decode the abstract syntax tree of the target program using a top-down depth-first traversal. In this work, we propose an alternative approach: a Semi-
Ohad Rubin, Jonathan Berant
semanticscholar   +8 more sources

Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networks [PDF]

Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2021
Constituency parsing and nested named entity recognition (NER) are similar tasks since they both aim to predict a collection of nested and non-crossing spans. In this work, we cast nested NER to constituency parsing and propose a novel pointing mechanism
Songlin Yang, Kewei Tu
semanticscholar   +7 more sources

Dependency Parsing with Bottom-up Hierarchical Pointer Networks [PDF]

Information Fusion, 2021
Dependency parsing is a crucial step towards deep language understanding and, therefore, widely demanded by numerous Natural Language Processing applications. In particular, left-to-right and top-down transition-based algorithms that rely on Pointer Networks are among the most accurate approaches for performing dependency parsing.
Daniel Fernández-González, Carlos Gómez-Rodríguez   +1 more
semanticscholar   +7 more sources

Noncanonical Extensions of Bottom-Up Parsing Techniques [PDF]

SIAM Journal on Computing, 1976
A bottom-up parsing technique which can make non-leftmost possible reductions in sentential forms is said to be non-canonical. Nearly every existing parsing technique can be extended to a non-canonical method which operates on larger classes of grammars ...
T. G. Szymanski, John H. Williams
semanticscholar   +5 more sources

Parallel non-deterministic bottom-up parsing [PDF]

Proceedings of the international symposium on Extensible languages -, 1971
The development of translator writing systems and extensible languages has led to a simultaneous development of more efficient and general syntax analyzers, usually for context-free (CF) syntax. Our paper describes a type of parser that can be used with reasonable efficiency for any CF grammar, even one which is ambiguous.
B. Lang
semanticscholar   +5 more sources

Efficient Disjunctive Unification for Bottom-Up Parsing [PDF]

Proceedings of the 13th conference on Computational linguistics -, 1990
This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures.
D. Carter
semanticscholar   +5 more sources

Bottom-Up Parsing Extending Context-Freeness in a Process Grammar Processor [PDF]

Proceedings of the 28th annual meeting on Association for Computational Linguistics -, 1990
A new approach to bottom-up parsing that extends Augmented Context-Free Grammar to a Process Grammar is formally presented. A Processor Grammar (PG) defines a set of rules suited for bottom-up parsing and conceived as processes that are applied by a PG ...
M. Marino
semanticscholar   +5 more sources

A New Design of Prolog-Based Bottom-Up Parsing System With Government-Binding Theory [PDF]

Proceedings of the 12th conference on Computational linguistics -, 1988
This paper addresses the problems of movement transformation in Prolog-based bottom-up parsing system. Three principles of Government-Binding theory are employed to deal with these problems.
Hsin-Hsi Chen, I. Lin, Chien-Ping Wu
semanticscholar   +5 more sources

On Deterministic Canonical Bottom-up-Parsing

Information and Control, 1979
A general framework for producing deterministic canonical bottom-up parsers which contains all these parsers as special cases is described. Then general conditions on the means of construction which guarantee that the obtained parsing methods work correctly are presented.
O. Mayer
semanticscholar   +4 more sources

Penentuan Pola Kalimat Bahasa Inggris Pada Simple Present Tense Menggunakan Metode Bottom Up Parsing

INTEGER: Journal of Information Technology, 2016
English is a language widely used by many countries in the world. It has many grammar rules in which  each has structural pattern regulating composition of clause, phrase, and words in natural language.
Budanis Dwi Meilani, Muhamad Nasir
semanticscholar   +5 more sources