19 search results - page 1 / 4 » L* Parsing: A General Framework for Syntactic Analysis of Na... |
78
Voted
AAAI
1994
15 years 11 days ago
1994
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...
EMNLP
2009
14 years 8 months ago
2009
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...
103
Voted
IBPRIA
2003
Springer
15 years 4 months ago
2003
Springer
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...
191
click to vote
POPL
2004
ACM
15 years 11 months ago
2004
ACM
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...
88
Voted
DOCENG
2005
ACM
15 years 1 months ago
2005
ACM
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 ...