Results 101 to 110 of about 133,940 (200)
Ambiguity resolution in a reductionistic parser [PDF]
arXiv, 1995 We are concerned with dependency-oriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurally unresolvable distinctions in order to optimise on the accuracy of the parser, it also is beneficial for the grammarian to have as expressive a structural representation available as possible.
arxiv
Legally Affective: Mapping the Emotional Grammar of LGBT Rights in Law School. [PDF]
Fem Leg Stud, 2023 Raj S.
europepmc +1 more source
Parallel Architecture: From Problems and Mysteries to Solutions and Explanations
Topics in Cognitive Science, EarlyView.Abstract We argue that Jackendoff's Parallel Architecture (PA) is the right way to think about the architecture of the language faculty. The critical property of this architecture is that it allows for genuine explanation by allocating different aspects of linguistic phenomena to appropriate corresponding representations and capacities.
Peter W. Culicover, Giuseppe Varaschin
wiley +1 more source
Simplified Parsing Expression Derivatives [PDF]
arXiv, 2018 This paper presents a new derivative parsing algorithm for parsing expression grammars; this new algorithm is both simpler and faster than the existing parsing expression derivative algorithm presented by Moss. This new algorithm improves on the worst-case space and runtime bounds of the previous algorithm by a linear factor, as well as decreasing ...
arxiv
Social Development, Volume 34, Issue 3, August 2025.ABSTRACT Across two studies we explore how individual and dyadic factors influence children's (Mage = 61 months; 52% male; 55% White British) use of mental state talk (MST) with peers during shared play. Results from actor‐partner interdependence modelling (APIM; n = 190 children) indicate that children's MST use is significantly linked to the MST use ...
Alexandra Bates +4 more
wiley +1 more source
Fast, Flexible, and Declarative Construction of Abstract Syntax Trees with PEGs [PDF]
arXiv, 2015 We address a declarative construction of abstract syntax trees with Parsing Expression Grammars. AST operators (constructor, connector, and tagging) are newly defined to specify flexible AST constructions. A new challenge coming with PEGs is the consistency management of ASTs in backtracking and packrat parsing.
arxiv
The FCG Editor: An innovative environment for engineering computational construction grammars. [PDF]
PLoS One, 2022 van Trijp R, Beuls K, Van Eecke P.
europepmc +1 more source
Expert Systems, Volume 42, Issue 7, July 2025.ABSTRACT The tourism sector is adopting smart solutions to offer visitors more personalised and sustainable experiences. By leveraging urban infrastructure and new technologies, tourist destinations aim to enhance the interaction between travellers and their environment. Artificial intelligence (AI) and natural language processing (NLP) play a key role
Lamya Benaddi +5 more
wiley +1 more source
Error recovery in parsing expression grammars through labeled failures and its implementation based on a parsing machine [PDF]
, 2018 Sérgio Queiroz de Medeiros +1 more
openalex +1 more source
A Robust Parsing Algorithm For Link Grammars
, 1995 In this paper we present a robust parsing algorithm based on the link grammar formalism for parsing natural languages. Our algorithm is a natural extension of the original dynamic programming recognition algorithm which recursively counts the number of ...
Grinberg, Dennis +2 more
core +2 more sources