Results 51 to 60 of about 13,549 (110)
"cba to check the spelling" investigating parser performance on discussion forum posts [PDF]
, 2010 We evaluate the Berkeley parser on text from an online discussion forum. We evaluate the parser output with and without gold tokens and spellings (using Sparseval and Parseval), and we compile a list of problematic phenomena for this domain.
Foster, Jennifer
core +2 more sources
The computational origin of representation. [PDF]
Minds Mach (Dordr), 2021 Piantadosi ST.
europepmc +1 more source
rdmpage/wikispecies-parser: Exported Wikispecies references
, 2021 Full Changelog: https://github.com/rdmpage/wikispecies-parser/commits/v0.
Roderic Page
core +1 more source
Exploiting Diversity in Natural Language Processing: Combining Parsers
CoRR, 2000 Three state-of-the-art statistical parsers are combined to produce more accurate parses, as well as new bounds on achievable Treebank parsing accuracy. Two general approaches are presented and two combination techniques are described for each approach. Both parametric and non-parametric models are explored.
John C. Henderson, Eric Brill
openaire +3 more sources
, 2012 This paper presents an ensemble system for dependency parsing: three parsers are separately trained and combined by means of a majority vote. The three parsers are (1) the MATE parser [http://code.google.com/p/mate-tools/], (2) the DeSR parser [http://sites.google.com/site/desrparser/], and (3) the MALT parser [http://maltparser.org/].
MAZZEI, Alessandro, BOSCO, CRISTINA
openaire +1 more source
, 2014 Parsers for context-free grammars can be implemented directly and naturally in a functional style known as “combinator parsing”, using recursion following the structure of the grammar rules.
Tom Ridge, Tom Ridge (7653305)
core +2 more sources
, 2008 Parser combinators are well-known in functional programming languages such as Haskell. In this paper, we describe how they are implemented as a library in Scala, a functional object-oriented language. Thanks to Scala's flexible syntax, we are able to closely approximate the EBNF notation supported by dedicated parser generators. For the uninitiated, we
Moors, Adriaan +2 more
openaire +1 more source
A testsuite for testing parser performance on complex German grammatical constructions [TePaCoC - a corpus for testing parser performance on complex German grammatical constructions] [PDF]
, 2008 Traditionally, parsers are evaluated against gold standard test data. This can cause problems if there is a mismatch between the data structures and representations used by the parser and the gold standard. A particular case in point is German, for which
Kübler, Sandra +2 more
core