179 search results - page 24 / 36 » Lambek Grammars Are Context Free |
ESOP
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
NIPS
2008
13 years 9 months ago
2008
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...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
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...
LACL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
UAI
2004
13 years 9 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...