Sciweavers

270 search results - page 1 / 54
» Effective natural language parsing with probabilistic gramma...
Sort
View
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...
EACL
1993
ACL Anthology
13 years 6 months ago
Ambiguity resolution in a reductionistic parser
We are concerned with dependencyoriented morphosyntactic parsing of running text. While a parsing grammar should avoid introducing structurallyunresolvable distinctionsin order to...
Atro Voutilainen, Pasi Tapanainen
IJCNLP
2004
Springer
13 years 10 months ago
Iterative CKY Parsing for Probabilistic Context-Free Grammars
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
Yoshimasa Tsuruoka, Jun-ichi Tsujii
GECCO
2003
Springer
111views Optimization» more  GECCO 2003»
13 years 10 months ago
Evolutionary Computing as a Tool for Grammar Development
Abstract. In this paper, an agent-based evolutionary computing technique is introduced, that is geared towards the automatic induction and optimization of grammars for natural lang...
Guy De Pauw