146 search results - page 2 / 30 » Statistical Parsing with a Context-Free Grammar and Word Sta... |
FPL
2001
Springer
13 years 10 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...
COLING
1999
13 years 5 months ago
1999
IPL
2008
13 years 5 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
NAACL
2010
13 years 3 months ago
2010
The use of well-nested linear context-free rewriting systems has been empirically motivated for modeling of the syntax of languages with discontinuous constituents or relatively f...
COLING
1996
13 years 7 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...