Results 71 to 80 of about 169,488 (224)
Greedy Transition-Based Dependency Parsing with Stack LSTMs
Computational Linguistics, 2017 We introduce a greedy transition-based parser that learns to represent parser states using recurrent neural networks. Our primary innovation that enables us to do this efficiently is a new control structure for sequential neural networks—the stack long ...
Miguel Ballesteros +3 more
doaj +1 more source
UDapter: Typology-based Language Adapters for Multilingual Dependency Parsing and Sequence Labeling
Computational Linguistics, 2022 Recent advances in multilingual language modeling have brought the idea of a truly universal parser closer to reality. However, such models are still not immune to the “curse of multilinguality”: Cross-language interference and restrained model capacity ...
Ahmet Üstün +3 more
doaj +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
Genabith, Josef van +2 more
core
Visualizing Visual Parser Execution
International Conferences on Distributed Multimedia Systems, 2020 Parsing of visual structures like diagrams and graphs is more complicated than parsing strings. This is so because visual structures are inherently more complex than strings, because visual grammars are more difficult to write than string grammars, and because the algorithms for parsing visual structures are usually more complicated than for parsing ...
Costagliola, Gennaro +2 more
openaire +1 more source
A Stochastic Parts Program and Noun Phrase Parser for Unrestricted Text
Applied Natural Language Processing Conference, 1988 A program that tags each word in an input sentence with the most likely part of speech has been written. The program uses a linear-time dynamic programming algorithm to find an assignment of parts of speech to words that optimizes the product of (a ...
Kenneth Ward Church
semanticscholar +1 more source
Modeling Algorithms in SystemC and ACL2 [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We describe the formal language MASC, based on a subset of SystemC and intended for modeling algorithms to be implemented in hardware. By means of a special-purpose parser, an algorithm coded in SystemC is converted to a MASC model for the purpose of ...
John W. O'Leary, David M. Russinoff
doaj +1 more source
Improving a Strong Neural Parser with Conjunction-Specific Features
, 2017 While dependency parsers reach very high overall accuracy, some dependency relations are much harder than others. In particular, dependency parsers perform poorly in coordination construction (i.e., correctly attaching the "conj" relation).
Ficler, Jessica, Goldberg, Yoav
core +1 more source
Combining constituent parsers [PDF]
Proceedings 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 +1 more source
Looking forwards and backwards: The real-time processing of Strong and Weak Crossover
Glossa, 2017 We investigated the processing of pronouns in Strong and Weak Crossover constructions as a means of probing the extent to which the incremental parser can use syntactic information to guide antecedent retrieval.
Colin Phillips, Dave Kush, Jeffrey Lidz
doaj +2 more sources
Evaluating evaluation measures [PDF]
, 2007 This paper presents a thorough examination of the validity of three evaluation measures on parser output. We assess parser performance of an unlexicalised probabilistic parser trained on two German treebanks with different annotation schemes and evaluate
Rehbein, Ines, van Genabith, Josef
core +2 more sources