Sciweavers

19 search results - page 1 / 4
» L* Parsing: A General Framework for Syntactic Analysis of Na...
Sort
View
AAAI
1994
13 years 6 months ago
L* Parsing: A General Framework for Syntactic Analysis of Natural Language
We describe a new algorithm for table-driven parsing with context-free grammars designed to support efficient syntactic analysis of natural language. The algorithm provides a gene...
Eric K. Jones, Linton M. Miller
EMNLP
2009
13 years 2 months ago
K-Best Combination of Syntactic Parsers
In this paper, we propose a linear model-based general framework to combine k-best parse outputs from multiple parsers. The proposed framework leverages on the strengths of previo...
Hui Zhang, Min Zhang, Chew Lim Tan, Haizhou Li
IBPRIA
2003
Springer
13 years 10 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...
POPL
2004
ACM
14 years 5 months ago
Parsing expression grammars: a recognition-based syntactic foundation
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...
Bryan Ford
DOCENG
2005
ACM
13 years 6 months ago
Managing syntactic variation in text retrieval
Information Retrieval systems are limited by the linguistic variation of language. The use of Natural Language Processing techniques to manage this problem has been studied for a ...
Jesús Vilares, Carlos Gómez-Rodr&iac...