1380 search results - page 225 / 276 » Decomposable Modeling in Natural Language Processing |
112
click to vote
HASKELL
2005
ACM
15 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...
105
click to vote
IJCNLP
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, a series of window-based methods is proposed for information retrieval. Compared with traditional tf-idf model, our approaches are based on two new key notions. The ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
SIGGRAPH
2000
ACM
15 years 2 months ago
2000
ACM
We present an object-space morphing technique that blends the interiors of given two- or three-dimensional shapes rather than their boundaries. The morph is rigid in the sense tha...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
Speakers in dialogue tend to adapt to each other by starting to use similar lexical items, syntactic structures, or gestures. This behaviour, called alignment, may serve important...