Sciweavers

113 search results - page 7 / 23
» Deriving tolerant grammars from a base-line grammar
Sort
View
74
Voted
COLING
2000
14 years 11 months ago
Exploiting a Probabilistic Hierarchical Model for Generation
Previous stochastic approaches to generation do not include a tree-based representation of syntax. While this may be adequate or even advantageous for some applications, other app...
Srinivas Bangalore, Owen Rambow
77
Voted
POLICY
2005
Springer
15 years 3 months ago
Deriving Semantic Models from Privacy Policies
Natural language policies describe interactions between and across organizations, third-parties and individuals. However, current policy languages are limited in their ability to ...
Travis D. Breaux, Annie I. Antón
ACL
1998
14 years 11 months ago
Conditions on Consistency of Probabilistic Tree Adjoining Grammars
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
Anoop Sarkar
COLING
1996
14 years 10 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
EMNLP
2006
14 years 11 months ago
Priming Effects in Combinatory Categorial Grammar
This paper presents a corpus-based account of structural priming in human sentence processing, focusing on the role that syntactic representations play in such an account. We esti...
David Reitter, Julia Hockenmaier, Frank Keller