Results 31 to 40 of about 54,892 (219)
, 2006 It is shown how parsing can be described as a problem in the class ISBES, Intersections of Sets and Bags of Extended Substructures, defined in /pubs/1991/161/, by viewing parsing as a generalization of pattern matching in several ways. The resulting description is shown to be a good starting point for the transformational derivation of the Cocke-Kasami-
openaire +2 more sources
(In)variability in the Samoan syntax/prosody interface and consequences for syntactic parsing
Laboratory Phonology, 2017 While it has long been clear that prosody should be part of the grammar influencing the action of the syntactic parser, how to bring prosody into computational models of syntactic parsing has remained unclear.
Kristine Yu
doaj +2 more sources
Proceedings of the 19th annual meeting on Association for Computational Linguistics -, 1981 The questions before this panel presuppose a distinction between parsing and interpretation. There are two other simple and obvious distinctions that I think are necessary for a reasonable discussion of the issues. First, we must clearly distinguish between the static specification of a process and its dynamic execution.
openaire +1 more source
DEVELOPMENT OF A TOOL FOR MAKING EFFECTIVE DECISIONS IN THE FIELD OF INVESTMENT
International Journal of Advanced Studies, 2022 The article discusses the issues of making effective decisions about investing in commercial accounts and currencies. In order to know how much these solutions will be beneficial in the long term, specialized information is needed: data on the dynamics ...
Roman R. Krapivin +3 more
doaj +1 more source
Proceedings of the ACM on Programming Languages, 2022 Random data generators can be thought of as parsers of streams of randomness. This perspective on generators for random data structures is established folklore in the programming languages community, but it has never been formalized, nor have its consequences been deeply explored.
Harrison Goldstein, Benjamin C. Pierce
openaire +1 more source
Proceedings of the 21st annual meeting on Association for Computational Linguistics -, 1983 By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is the basis of the Earley Deduction proof procedure for definite clauses. The efficiency of this approach for an interesting class of grammars is discussed.
Fernando C. N. Pereira +1 more
openaire +1 more source
Detection and Classification of Cross-language Code Clone Types by Filtering the Nodes of ANTLR-generated Parse Tree [PDF]
, 2021 Sanjay B. Ankali, Latha Parthiban
openalex +1 more source
Frontiers in Psychology, 2011 The premise of this study is that current models of speech perception, which are driven by acoustic features alone, are incomplete, and that the role of decoding time during memory access must be incorporated to account for the patterns of observed ...
Oded eGhitza
doaj +1 more source
Proceedings of the 22nd annual meeting on Association for Computational Linguistics -, 1984 It is argued that syntactic preference principles such as Right Association and Minimal Attachment are unsatisfactory as usually formulated. Among the difficulties are: (1) dependence on ill-specified or implausible principles of parser operation; (2) dependence on questionable assumptions about syntax; (3) lack of provision, even in principle, for
openaire +2 more sources
Algorithms, 2016 LR parsing is a popular parsing strategy for variants of Context-Free Grammar (CFG). It has also been used for mildly context-sensitive formalisms, such as Tree-Adjoining Grammar.
Laura Kallmeyer, Wolfgang Maier
doaj +1 more source