643 search results - page 47 / 129 » Parsing And Derivational Equivalence |
EMNLP
2009
13 years 5 months ago
2009
We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing...
EMNLP
2009
13 years 5 months ago
2009
We connect two scenarios in structured learning: adapting a parser trained on one corpus to another annotation style, and projecting syntactic annotations from one language to ano...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
Increase in system level modeling has given rise to a need for efficient functional validation of models above cycle accurate level. This paper presents a technique for comparing...
TPHOL
2005
IEEE
14 years 1 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...