ACL
2012
12 years 1 months ago
2012
Recently, it was shown (KUHLMANN, SATTA: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining gramm...
IJAC
2010
13 years 8 months ago
2010
We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr
JOLLI
2006
13 years 11 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 ...
PODS
2010
ACM
14 years 4 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...