47 search results - page 8 / 10 » Partially-Commutative Context-Free Processes |
LREC
2010
13 years 9 months ago
2010
Abstract. This paper describes recent approaches using text-mining to automatically profile and extract arguments from legal cases. We outline some of the background context and mo...
ACL
2006
13 years 8 months ago
2006
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
COLING
1996
13 years 8 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...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
Generally, web services are provided with different QoS values, so they can be selected dynamically in service composition process. However, the conventional context free composit...
NLPRS
2001
Springer
13 years 12 months ago
2001
Springer
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...