Results 21 to 30 of about 13,549 (110)

Modeling Structure‐Building in the Brain With CCG Parsing and Large Language Models

open access: yesCognitive Science, Volume 47, Issue 7, July 2023., 2023
Abstract To model behavioral and neural correlates of language comprehension in naturalistic environments, researchers have turned to broad‐coverage tools from natural‐language processing and machine learning. Where syntactic structure is explicitly modeled, prior work has relied predominantly on context‐free grammars (CFGs), yet such formalisms are ...
Miloš Stanojević   +4 more
wiley   +1 more source

Combining constituent parsers [PDF]

open access: yesProceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers on - NAACL '09, 2009
Combining the 1-best output of multiple parsers via parse selection or parse hybridization improves f-score over the best individual parser (Henderson and Brill, 1999; Sagae and Lavie, 2006). We propose three ways to improve upon existing methods for parser combination.
Victoria Fossum, Kevin Knight
openaire   +2 more sources

Parsing Chinese with Combinatory Categorial Grammar: A Linguistic and Computational Study

open access: yesComplexity, Volume 2022, Issue 1, 2022., 2022
Parsing Chinese language with CCG is very difficult because the architecture and assumptions of CCG do not fit well with facts from Chinese. Based on the concept of “realization” proposed by Zhu Dexi (1920–1992), this study sheds light on the discrepancy between CCG and Chinese syntax and puts forward a refined schema for Chinese compositionality.
Haixia Man   +4 more
wiley   +1 more source

Adapting a WSJ-trained parser to grammatically noisy text [PDF]

open access: yes, 2008
We present a robust parser which is trained on a treebank of ungrammatical sentences. The treebank is created automatically by modifying Penn treebank sentences so that they contain one or more syntactic errors.
Jennifer Foster   +5 more
core   +3 more sources

NP-Completeness of Combinator Optimisation Problem [PDF]

open access: yes, 1995
We consider a deterministic rewrite system for combinatory logic over combinators S, K, I, B, C, S’, B’ and C’. Terms will be represented by graphs so that reduction of a duplicator will cause the duplicated to be "shared" rather than copied.
Rayward-Smith, V. J.   +2 more
core   +1 more source

scala-tptp-parser

open access: yes, 2021
scala-tptp-parser is a library for parsing the input languages of the TPTP infrastructure. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different language of the TPTP, see ...
STEEN, Alexander
core   +1 more source

ParsecCore: A parser combinator library in the C# language

open access: yes, 2023
In this thesis, we implement a parser combinator library in C# inspired by Parsec. Parser combinators refer to a style of parsing where a parser is modeled as function from string to some structured result.
Tichý, Michal
core  

Parser evaluation and the BNC: evaluating 4 constituency parsers with 3 metrics [PDF]

open access: yes, 2008
We evaluate discriminative parse reranking and parser self-training on a new English test set using four versions of the Charniak parser and a variety of parser evaluation metrics. The new test set consists of 1,000 hand-corrected British National Corpus
Foster, Jennifer, van Genabith, Josef
core   +2 more sources

scala-tptp-parser v1.7.1

open access: yes, 2023
scala-tptp-parser is a Scala library (for Scala 2.13.x) for parsing the input languages of the TPTP infrastructure. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different ...
Alexander Steen
core   +1 more source

Parser combinators for Tigrinya and Oromo morphology

open access: yesProceedings of the Language Resources and Evaluation Conference, 2018
We present rule-based morphological parsers in the Tigrinya and Oromo languages, based on a parser-combinator rather than finite-state paradigm. This paradigm allows rapid development and ease of integration with other systems, although at the cost of non-optimal theoretical efficiency.
Littell, Patrick   +7 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy