Results 41 to 50 of about 84,961 (134)
Systems of Sequential Grammars Applied to Parsing [PDF]
, 2014 Tato práce zkoumá Gramatické systémy jako potenciálně silnější nástroj pro syntaktickou analýzu, nežli obyčejné gramatiky. Hlavním záměrem je aplikace teoretických modelů do praxe, vytvoření syntaktického analyzátoru.
Repík, Tomáš
core
Blackboard Agents for Standard Arabic Language Tokenization and Parsing
Journal of Engineering and Sustainable Development, 2010 The Processing of the Arabic language is a difficult mission comparing it with other languages. Because Sentences in Arabic language are complex, longer than the others in various languages, and have difficult structure with lattices.
Abdul Kareem Murhij Radhi
doaj
Efficient Top-Down BTG Parsing for Machine Translation Preordering [PDF]
Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2015 We present an efficient incremental topdown parsing method for preordering based on Bracketing Transduction Grammar (BTG). The BTG-based preordering framework (Neubig et al., 2012) can be applied to any language using only parallel text, but has the problem of computational efficiency.
openaire +1 more source
High-Level Bottom-Up Cues for Top-Down Parsing of Facade Images [PDF]
, 2012 International audienceWe address the problem of parsing images of building facades. The goal is to segment images, assigning to the resulting regions semantic labels that correspond to the basic architectural elements.
Koziński, Mateusz +3 more
core +2 more sources
Modular and efficient top-down parsing for ambiguous left-recursive grammars [PDF]
Proceedings of the 10th International Conference on Parsing Technologies - IWPT '07, 2007 In functional and logic programming, parsers can be built as modular executable specifications of grammars, using parser combinators and definite clause grammars respectively. These techniques are based on top-down backtracking search. Commonly used implementations are inefficient for ambiguous languages, cannot accommodate left-recursive grammars, and
Frost, R., Hafiz, R., Callaghan, P.
openaire +1 more source
Incremental Parser Generation for Tree Adjoining Grammars
, 1998 This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far.
Sarkar, Anoop
core +1 more source
Grammar Systems and Parsing Based on Them [PDF]
, 2015 Tato práce se věnuje problematice gramatických systémů. Definuje jak kooperující distribuované CD gramatické systémy, tak i paralelně komunikující PC gramatické systémy ve spojení s bezkontextovými gramatikami.
Handlíř, Jaroslav
core
Deep Hierarchical Parsing for Semantic Segmentation
, 2015 This paper proposes a learning-based approach to scene parsing inspired by the deep Recursive Context Propagation Network (RCPN). RCPN is a deep feed-forward neural network that utilizes the contextual information from the entire image, through bottom-up
Jacobs, David W. +2 more
core +1 more source
Effective Inference for Generative Neural Parsing
, 2017 Generative neural models have recently achieved state-of-the-art results for constituency parsing. However, without a feasible search procedure, their use has so far been limited to reranking the output of external parsers in which decoding is more ...
Fried, Daniel +2 more
core +1 more source