Sciweavers

138 search results - page 11 / 28
» Probabilistic Frame-Semantic Parsing
Sort
View
IBPRIA
2003
Springer
14 years 20 days 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...
AAAI
1992
13 years 8 months ago
A Probabilistic Parser Applied to Software Testing Documents
We describe an approach to training a statistical parser from a bracketed corpus, and demonstrate its use in a software testing application that translates English speci cations i...
Mark A. Jones, Jason Eisner
COLING
1996
13 years 8 months ago
Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
Khalil Sima'an
ACL
2004
13 years 8 months ago
Alternative approaches for Generating Bodies of Grammar Rules
We compare two approaches for describing and generating bodies of rules used for natural language parsing. In today's parsers rule bodies do not exist a priori but are genera...
Gabriel G. Infante López, Maarten de Rijke