270 search results - page 10 / 54 » Effective natural language parsing with probabilistic gramma... |
IFIP12
2007
14 years 11 months ago
2007
In this paper an efficient architecture for natural language processing is presented, implemented in hardware using FPGAs (Field Programmable Gate Arrays). The system can receive s...
78
Voted
EMNLP
2010
14 years 7 months ago
2010
Unknown words are a hindrance to the performance of hand-crafted computational grammars of natural language. However, words with incomplete and incorrect lexical entries pose an e...
TAL
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We define Probabilistic Constrained W-grammars (PCWgrammars), a two-level formalism capable of capturing grammatical frameworks used in two state of the art parsers, nam...
EMNLP
2010
14 years 7 months ago
2010
We introduce a novel training algorithm for unsupervised grammar induction, called Zoomed Learning. Given a training set T and a test set S, the goal of our algorithm is to identi...
AAAI
1994
14 years 11 months 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...