14 search results - page 1 / 3 » Incremental Parsing with Parallel Multiple Context-Free Gram... |
EACL
2009
ACL Anthology
14 years 5 months ago
2009
ACL Anthology
FPL
2001
Springer
13 years 9 months ago
2001
Springer
This paper presents an FPGA-based implementation of a syntactic parser that can process languages generated by almost unrestricted real-life context-free grammars (CFGs). More prec...
ICPADS
1998
IEEE
13 years 9 months ago
1998
IEEE
LACL
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
ACL
1997
13 years 6 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...