468 search results - page 39 / 94 » Parsing and Subcategorization Data |
COLING
1996
15 years 1 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
116
click to vote
CISIS
2007
IEEE
14 years 12 months ago
2007
IEEE
Problem determination in today's computing environments consumes between 30 and 70% of an organization’s IT resources and represents from one third to one half of their tot...
102
click to vote
WACV
2005
IEEE
15 years 5 months ago
2005
IEEE
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
NAACL
2003
15 years 1 months ago
2003
This paper investigates adapting a lexicalized probabilistic context-free grammar (PCFG) to a novel domain, using maximum a posteriori (MAP) estimation. The MAP framework is gener...
118
click to vote
NIPS
2001
15 years 1 months ago
2001
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...