19 search results - page 1 / 4 » Regular Approximation of Link Grammar |
FINTAL
2006
13 years 9 months ago
2006
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...
DLT
2009
13 years 3 months ago
2009
Abstract. We consider algorithms for approximating context
WIA
2007
Springer
13 years 11 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
13 years 11 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...
ACL
1994
13 years 6 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...