268 search results - page 16 / 54 » Linear Context Free Languages |
ACL
2004
13 years 8 months ago
2004
We present a linguistically-motivated algorithm for reconstructing nonlocal dependency in broad-coverage context-free parse trees derived from treebanks. We use an algorithm based...
WIA
2007
Springer
14 years 1 months ago
2007
Springer
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and p...
APLAS
2006
ACM
14 years 1 months ago
2006
ACM
String expression analysis conservatively approximates the possible string values generated by a program. We consider the validation of a context-free grammar obtained by the analy...
IJCNLP
2004
Springer
14 years 22 days ago
2004
Springer
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
MFCS
1998
Springer
13 years 11 months ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...