1419 search results - page 51 / 284 » Notes on Formalizing Context |
115
click to vote
ECML
2003
Springer
15 years 5 months ago
2003
Springer
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
109
click to vote
MFCS
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
100
Voted
DATE
2004
IEEE
15 years 4 months ago
2004
IEEE
Performance analysis has many advantages in theory compared to simulation for the validation of complex embedded systems, but is rarely used in practice. To make analysis more att...
92
Voted
AAAI
2006
15 years 2 months ago
2006
We consider the iterated belief change that occurs following an alternating sequence of actions and observations. At each instant, an agent has some beliefs about the action that ...
95
Voted
ACL
1997
15 years 1 months ago
1997
Valiant showed that Boolean matrix multiplication (BMM) can be used for CFG parsing. We prove a dual result: CFG parsers running in time O([Gl[w[3-e) on a grammar G and a string w...