Results 1 to 10 of about 6,910 (242)
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-autoregressive Bottom-up Parser (SmBoP) that constructs at decoding step $t$ the top-$K$ sub-trees ...
Ohad Rubin, Jonathan Berant
+7 more sources
Dependency parsing with bottom-up Hierarchical Pointer Networks
Information Fusion, 2022 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 +1 more
openalex +4 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), 2022 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 for bottom-up parsing to tackle both tasks.
Songlin Yang, Kewei Tu
openalex +3 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. The first is a safe but fast method for discarding irrelevant disjunctions from newly-created structures.
David Carter
openalex +3 more sources
Generation of Syntax Parser on South Indian Language using Bottom-Up Parsing Technique and PCFG [PDF]
Journal of Information Technology Management, 2023 In our research, we provide a statistical syntax parsing method experimented on Kannada texts, which is an official language of Karnataka, India. The dataset is downloaded from TDIL website.
M. Rajani Shree, Shambhavi B. R.
doaj +2 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 Processor.
Massimo Marino
openalex +3 more sources
A pipeline model for bottom-up dependency parsing [PDF]
Proceedings of the Tenth Conference on Computational Natural Language Learning - CoNLL-X '06, 2006 We present a new machine learning framework for multi-lingual dependency parsing. The framework uses a linear, pipeline based, bottom-up parsing algorithm, with a look ahead local search that serves to make the local predictions more robust. As shown, the performance of the first generation of this algorithm is promising.
Ming‐Wei Chang, Quang Do, Dan Roth
openalex +2 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.
Bernard Lang
openalex +2 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. Simple Present Tense is one of 16 tenses in English Grammar. It is the first and basic tense which used to express regular and habitual action.
Budanis Dwi Meilani, Muhamad Nasir
openalex +3 more sources
Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy [PDF]
Artificial Intelligence, 2019 Final peer-reviewed manuscript accepted for ...
Daniel Fernández‐González +1 more
openalex +6 more sources