Sciweavers

270 search results - page 16 / 54
» Effective natural language parsing with probabilistic gramma...
Sort
View
ACL
1989
14 years 10 months ago
Parsing as Natural Deduction
The logic behind parsers for categorial grammars can be formalized in several different ways. Lambek Calculus (LC) constitutes an example for a natural deduction 1 style parsing m...
Esther König
ICSM
2003
IEEE
15 years 2 months ago
Deriving tolerant grammars from a base-line grammar
A grammar-based approach to tool development in re- and reverse engineering promises precise structure awareness, but it is problematic in two respects. Firstly, it is a considera...
Steven Klusener, Ralf Lämmel
NLPRS
2001
Springer
15 years 2 months ago
GLR Parser with Conditional Action Model(CAM)
There are two different approaches in the LR parsing. The first one is the deterministic approach that performs the only one action using the control rules learned without any LR ...
Yong-Jae Kwak, Young-Sook Hwang, Hoo-Jung Chung, S...
EMNLP
2011
13 years 9 months ago
Inducing Sentence Structure from Parallel Corpora for Reordering
When translating among languages that differ substantially in word order, machine translation (MT) systems benefit from syntactic preordering—an approach that uses features fro...
John DeNero, Jakob Uszkoreit
ALT
2006
Springer
15 years 6 months ago
Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
Takeshi Shibata, Ryo Yoshinaka, Takashi Chikayama