1187 search results - page 144 / 238 » Unsupervised Natural Language Processing Using Graph Models |
HASKELL
2005
ACM
14 years 3 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
AICCSA
2006
IEEE
14 years 4 months ago
2006
IEEE
The specification, analysis, and administration of business processes have charged great importance in this last time. This has been caused by a competitive industry necessity, dy...
ACL
2012
12 years 21 days ago
2012
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
CONCUR
2006
Springer
14 years 2 months ago
2006
Springer
Event structures have been used for giving true concurrent semantics to languages and models of concurrency such as CCS, Petri nets and graph grammars. Although certain nominal cal...
EMNLP
2009
13 years 8 months ago
2009
Mitchell et al. (2008) demonstrated that corpus-extracted models of semantic knowledge can predict neural activation patterns recorded using fMRI. This could be a very powerful te...