Sciweavers

675 search results - page 60 / 135
» On Compression of Parse Trees
Sort
View
ACL
2006
13 years 10 months ago
A Fast, Accurate Deterministic Parser for Chinese
We present a novel classifier-based deterministic parser for Chinese constituency parsing. Our parser computes parse trees from bottom up in one pass, and uses classifiers to make...
Mengqiu Wang, Kenji Sagae, Teruko Mitamura
ICDAR
2003
IEEE
14 years 2 months ago
Parsing N-Best Lists of Handwritten Sentences
This paper investigates the application of a probabilistic parser for natural language on the list of the Nbest sentences produced by an off-line recognition system for cursive h...
Matthias Zimmermann, Jean-Cédric Chappelier...
ICML
2000
IEEE
14 years 1 months ago
Discriminative Reranking for Natural Language Parsing
This paper 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 assoc...
Michael Collins
COLING
1999
13 years 8 months ago
Semiring Parsing
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...
Joshua Goodman
EMNLP
2009
13 years 6 months ago
Unsupervised Semantic Parsing
We present the first unsupervised approach to the problem of learning a semantic parser, using Markov logic. Our USP system transforms dependency trees into quasi-logical forms, r...
Hoifung Poon, Pedro Domingos