Sciweavers

113 search results - page 8 / 23
» Deriving tolerant grammars from a base-line grammar
Sort
View
71
Voted
SAS
2001
Springer
15 years 1 months ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
ACL
2009
14 years 7 months ago
Improving data-driven dependency parsing using large-scale LFG grammars
This paper presents experiments which combine a grammar-driven and a datadriven parser. We show how the conversion of LFG output to dependency representation allows for a techniqu...
Lilja Øvrelid, Jonas Kuhn, Kathrin Spreyer
64
Voted
NIPS
2001
14 years 11 months ago
Grammatical Bigrams
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
Mark A. Paskin
ACL
1990
14 years 10 months ago
Automated Inversion of Logic Grammars for Generation
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
Tomek Strzalkowski, Ping Peng
IBPRIA
2003
Springer
15 years 2 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...