Sciweavers

226 search results - page 10 / 46
» Parsing with the Shortest Derivation
Sort
View
IBPRIA
2003
Springer
14 years 3 months ago
Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafa...
WIA
1997
Springer
14 years 1 months ago
Construction of Efficient Generalized LR Parsers
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
Miguel A. Alonso, David Cabrero, Manuel Vilares Fe...
NIPS
2008
13 years 11 months ago
Syntactic Topic Models
We develop the syntactic topic model (STM), a nonparametric Bayesian model of parsed documents. The STM generates words that are both thematically and syntactically constrained, w...
Jordan L. Boyd-Graber, David M. Blei
COLING
2010
13 years 4 months ago
Benchmarking of Statistical Dependency Parsers for French
We compare the performance of three statistical parsing architectures on the problem of deriving typed dependency structures for French. The architectures are based on PCFGs with ...
Marie Candito, Joakim Nivre, Pascal Denis, Enrique...
ACL
2008
13 years 11 months ago
Parsing Noun Phrase Structure with CCG
Statistical parsing of noun phrase (NP) structure has been hampered by a lack of goldstandard data. This is a significant problem for CCGbank, where binary branching NP derivation...
David Vadas, James R. Curran