1423 search results - page 58 / 285 » Languages of Nested Trees |
108
click to vote
IBPRIA
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
129
click to vote
JOLLI
2006
14 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 ...
180
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Many data integration solutions in the market today include tools for schema mapping, to help users visually relate elements of different schemas. Schema elements are connected wit...
CSL
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
EMNLP
2008
15 years 1 months ago
2008
We show that jointly parsing a bitext can substantially improve parse quality on both sides. In a maximum entropy bitext parsing model, we define a distribution over source trees,...