Results 71 to 80 of about 296,979 (166)
The Meaning Factory at SemEval-2017 Task 9: Producing AMRs with Neural Semantic Parsing [PDF]
arXiv, 2017 We evaluate a semantic parser based on a character-based sequence-to-sequence model in the context of the SemEval-2017 shared task on semantic parsing for AMRs. With data augmentation, super characters, and POS-tagging we gain major improvements in performance compared to a baseline character-level model. Although we improve on previous character-based
arxiv
Parsley: optimising and improving parser combinators
, 2023 Parser combinators are a functional abstraction for parsing that abstracts hand-written recursive-descent parsers behind a high-level set of combinators. While these kinds of parsers are popular in the functional programming community, they have been historically criticised: * Parser combinator performance is sub-par compared with handwritten parsers. *
openaire +2 more sources
Verified Subtyping with Traits and Mixins
, 2014 Traits allow decomposing programs into smaller parts and mixins are a form of composition that resemble multiple inheritance. Unfortunately, in the presence of traits, programming languages like Scala give up on subtyping relation between objects.
Sharma, Asankhaya
core +2 more sources
The computational origin of representation. [PDF]
Minds Mach (Dordr), 2021 Piantadosi ST.
europepmc +1 more source
Parsing methods streamlined [PDF]
arXiv, 2013 This paper has the goals (1) of unifying top-down parsing with shift-reduce parsing to yield a single simple and consistent framework, and (2) of producing provably correct parsing methods, deterministic as well as tabular ones, for extended context-free grammars (EBNF) represented as state-transition networks.
arxiv
A Linear Observed Time Statistical Parser Based on Maximum Entropy Models [PDF]
arXiv, 1997 This paper presents a statistical parser for natural language that obtains a parsing accuracy---roughly 87% precision and 86% recall---which surpasses the best previously published results on the Wall St. Journal domain. The parser itself requires very little human intervention, since the information it uses to make parsing decisions is specified in a ...
arxiv
Grounded Adaptation for Zero-shot Executable Semantic Parsing [PDF]
arXiv, 2020 We propose Grounded Adaptation for Zero-shot Executable Semantic Parsing (GAZP) to adapt an existing semantic parser to new environments (e.g. new database schemas). GAZP combines a forward semantic parser with a backward utterance generator to synthesize data (e.g.
arxiv
Multi-dimensional Type Theory: Rules, Categories, and Combinators for Syntax and Semantics
, 2004 We investigate the possibility of modelling the syntax and semantics of natural language by constraints, or rules, imposed by the multi-dimensional type theory Nabla.
Villadsen, Jørgen
core +2 more sources
Learning an Executable Neural Semantic Parser [PDF]
arXiv, 2017 This paper describes a neural semantic parser that maps natural language utterances onto logical forms which can be executed against a task-specific environment, such as a knowledge base or a database, to produce a response. The parser generates tree-structured logical forms with a transition-based approach which combines a generic tree-generation ...
arxiv