Results 21 to 30 of about 66,908 (277)
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
openaire +4 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.
Otto Mayer
openaire +4 more sources
Parsing Netlists of Integrated Circuits from Images via Graph Attention Network
Sensors, 2023 A massive number of paper documents that include important information such as circuit schematics can be converted into digital documents by optical sensors like scanners or digital cameras.
Wenxing Hu, Xianke Zhan, Minglei Tong
doaj +1 more source
Less Direct, More Analytical: Eye-Movement Measures of L2 Idiom Reading
Languages, 2022 Idioms (e.g., break the ice, spill the beans) are ubiquitous multiword units that are often semantically non-compositional. Psycholinguistic data suggests that L1 readers process idioms in a hybrid fashion, with early comprehension facilitated by direct ...
Marco S. G. Senaldi, Debra A. Titone
doaj +1 more source
An Interactive Interpreter for Two Dimensional Lucid
IEEE Access, 2022 We present an initial draft of the “Luminous” interactive interpreter for a new dialect of the functional dataflow language Lucid. Luminous is not the first implementation of Lucid but it is novel in several ways.
Omar Alaqeeli, William Wadge
doaj +1 more source
, 1977 A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there exist simple chain grammars which are not LL(k) for any k, this new class of grammars is very close related to the class of LL(1) and simple LL(1) grammars.
Nijholt, Anton
core +3 more sources
An investigation of tightly coupled time synchronous speech language interfaces using a unification grammar [PDF]
, 1994 This paper reports on some experiments on time synchronous interfaces between word recognition and parsing, performed with a beam decoder and a chart parser.
Hauenstein, Andreas, Weber, Hans
core +4 more sources
Proceedings of the 13th conference on Computational linguistics -, 1990 In this paper, we propose an optimized strategy, called Bottom-Up Filtering, for parsing GPSGs. This strategy is based on a particular, high level, interpretation of GPSGs. It permits a significant reduction of the non-determinism inherent to the rule selection process.
Philippe Blache, Jean-Yves Morin
openaire +2 more sources
Frontiers in Psychology, 2016 Speech sound perception is one of the most fascinating tasks performed by the human brain. It involves a mapping from continuous acoustic waveforms onto the discrete phonological units computed to store words in the mental lexicon.
Anna Dora Manca, Mirko Grimaldi
doaj +1 more source
A Contrastive Study of Functional Unification Grammar for Surface Language Generation: A Case Study in Choice of Connectives [PDF]
, 1989 Language generation systems have used a variety of grammatical formalisms for producing syntactic structure and yet, there has been little research evaluating the formalisms for the specifics of the generation task.
Elhadad, Michael, McKeown, Kathleen
core +2 more sources