Sciweavers

367 search results - page 22 / 74
» Lexicalized Context-Free Grammars
Sort
View
ACL
2011
13 years 3 days ago
Issues Concerning Decoding with Synchronous Context-free Grammar
We discuss some of the practical issues that arise from decoding with general synchronous context-free grammars. We examine problems caused by unary rules and we also examine how ...
Tagyoung Chung, Licheng Fang, Daniel Gildea
EMNLP
2010
13 years 6 months ago
Using Unknown Word Techniques to Learn Known Words
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...
Kostadin Cholakov, Gertjan van Noord
ICGI
2004
Springer
14 years 1 months ago
Learnability of Pregroup Grammars
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
Denis Béchet, Annie Foret, Isabelle Tellier
NIPS
2008
13 years 10 months ago
Bayesian Synchronous Grammar Induction
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of parallel string pairs. SCFGs can model equivalence between strings in terms of su...
Phil Blunsom, Trevor Cohn, Miles Osborne
INFOCOM
2009
IEEE
14 years 3 months ago
Event Recognition in Sensor Networks by Means of Grammatical Inference
Abstract—Modern military and civilian surveillance applications should provide end users with the high level representation of events observed by sensors rather than with the raw...
Sahin Cem Geyik, Boleslaw K. Szymanski