27 search results - page 1 / 6 » Analyzing Ambiguity of Context-Free Grammars |
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...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
ICTAC
2010
Springer
13 years 3 months ago
2010
Springer
ACL
1989
13 years 6 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
JOLLI
2006
13 years 4 months ago
2006
We examine the expressive power of probabilistic context free grammars (PCFGs), with a special focus on the use of probabilities as a mechanism for reducing ambiguity by filtering ...