179 search results - page 19 / 36 » Lambek Grammars Are Context Free |
132
Voted
ICGI
2004
Springer
15 years 7 months ago
2004
Springer
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 ...
NAACL
2007
15 years 3 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
112
Voted
ACL
1998
15 years 3 months ago
1998
We present an empirical study of the applicability of Probabilistic Lexicalized Tree Insertion Grammars (PLTIG), a lexicalized counterpart to Probabilistic Context-Free Grammars (...
125
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Ambiguity is a problem in biosequence analysis that arises in various analysis tasks solved via dynamic programming, and in particular, in the modeling of families of ...
120
click to vote
AAAI
2011
14 years 1 months ago
2011
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...