Results 1 - 10 of 835

Generation of efficient parsers through direct compilation of XML Schema grammars

by Perkins Matsa Kostoulas, M. Matsa, M. G. Kostoulas, A. Heifets, N. Mendelsohn
"... this paper we present a method for generating efficient parsers by using the schema component model itself as the representation of the grammar. We show that the model supports the full expressive power of the XML Schema, and we present results demonstrating significant performance improvements over ..."
Abstract - Add to MetaCart
this paper we present a method for generating efficient parsers by using the schema component model itself as the representation of the grammar. We show that the model supports the full expressive power of the XML Schema, and we present results demonstrating significant performance improvements

Abstract A Robust and Efficient Parser for Non-Canonical Inputs

by unknown authors
"... We present in this paper a parser relying on a constraint-based formalism called Property Grammar. We show how constraints constitute an efficient solution in parsing non canonical material such as spoken language transcription or e-mails. This technique, provided that it is implemented with some co ..."
Abstract - Add to MetaCart
We present in this paper a parser relying on a constraint-based formalism called Property Grammar. We show how constraints constitute an efficient solution in parsing non canonical material such as spoken language transcription or e-mails. This technique, provided that it is implemented with some

Abstract A Robust and Efficient Parser for Non-Canonical Inputs

by unknown authors
"... We present in this paper a parser relying on a constraint-based formalism called Property Grammar. We show how constraints constitute an efficient solution in parsing non canonical material such as spoken language transcription or e-mails. This technique, provided that it is implemented with some co ..."
Abstract - Add to MetaCart
We present in this paper a parser relying on a constraint-based formalism called Property Grammar. We show how constraints constitute an efficient solution in parsing non canonical material such as spoken language transcription or e-mails. This technique, provided that it is implemented with some

Fence — An Efficient Parser with Ambiguity Support for Model-Driven Language Specification

by Luis Quesada, O Berzal, Francisco J. Cortijo
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Online large-margin training of dependency parsers

by Ryan Mcdonald, Koby Crammer, Fernando Pereira - In Proc. ACL , 2005
"... We present an effective training algorithm for linearly-scored dependency parsers that implements online largemargin multi-class training (Crammer and Singer, 2003; Crammer et al., 2003) on top of efficient parsing techniques for dependency trees (Eisner, 1996). The trained parsers achieve a competi ..."
Abstract - Cited by 306 (23 self) - Add to MetaCart
We present an effective training algorithm for linearly-scored dependency parsers that implements online largemargin multi-class training (Crammer and Singer, 2003; Crammer et al., 2003) on top of efficient parsing techniques for dependency trees (Eisner, 1996). The trained parsers achieve a

Discriminative Reranking for Natural Language Parsing

by Michael Collins, Terry Koo , 2005
"... This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. A second model then attempts to improve upon this i ..."
Abstract - Cited by 333 (9 self) - Add to MetaCart
This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. A second model then attempts to improve upon

Efficient third-order dependency parsers

by Terry Koo, Michael Collins - In ACL ’10 , 2010
"... We present algorithms for higher-order dependency parsing that are “third-order” in the sense that they can evaluate substructures containing three dependencies, and “efficient ” in the sense that they require only O(n4) time. Importantly, our new parsers can utilize both sibling-style and grandchil ..."
Abstract - Cited by 68 (1 self) - Add to MetaCart
We present algorithms for higher-order dependency parsing that are “third-order” in the sense that they can evaluate substructures containing three dependencies, and “efficient ” in the sense that they require only O(n4) time. Importantly, our new parsers can utilize both sibling

Wide-coverage efficient statistical parsing with CCG and log-linear models

by Stephen Clark, James R. Curran - COMPUTATIONAL LINGUISTICS , 2007
"... This paper describes a number of log-linear parsing models for an automatically extracted lexicalized grammar. The models are "full" parsing models in the sense that probabilities are defined for complete parses, rather than for independent events derived by decomposing the parse tree. Dis ..."
Abstract - Cited by 218 (43 self) - Add to MetaCart
lexical categories to words in a sentence. The supertagger makes the discriminative training feasible, and also leads to a highly efficient parser. Surprisingly,

A Probabilistic Earley Parser as a Psycholinguistic Model

by John Hale - IN PROCEEDINGS OF NAACL , 2001
"... In human sentence processing, cognitive load can be defined many ways. This report considers a definition of cognitive load in terms of the total probability of structural options that have been disconfirmed at some point in a sentence: the surprisal of word w i given its prefix w 0...i-1 on a phras ..."
Abstract - Cited by 146 (5 self) - Add to MetaCart
phrase-structural language model. These loads can be efficiently calculated using a probabilistic Earley parser (Stolcke, 1995) which is interpreted as generating predictions about reading time on a word-by-word basis. Under grammatical assumptions supported by corpusfrequency data, the operation

Efficient Combinator Parsers

by Pieter Koopman, Rinus Plasmeijer - In Implementation of Functional Languages, LNCS , 1998
"... . Parser combinators enable the construction of recursive descent parsers in a very clear and simple way. Unfortunately, the resulting parsers have a polynomial complexity and are far too slow for realistic inputs. We show how the speed of these parsers can be improved by one order of magnitude usin ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
. Parser combinators enable the construction of recursive descent parsers in a very clear and simple way. Unfortunately, the resulting parsers have a polynomial complexity and are far too slow for realistic inputs. We show how the speed of these parsers can be improved by one order of magnitude
Results 1 - 10 of 835