Sciweavers

1380 search results - page 7 / 276
» Decomposable Modeling in Natural Language Processing
Sort
View
NAACL
2007
13 years 10 months ago
Unsupervised Natural Language Processing Using Graph Models
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
Chris Biemann
FSMNLP
2008
Springer
13 years 10 months ago
Finite State Models for the Generation of Large Corpora of Natural Language Texts
Domenico Cantone, Salvatore Cristofaro, Simone Far...
ACL
2009
13 years 6 months ago
Efficient Inference of CRFs for Large-Scale Natural Language Data
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
Minwoo Jeong, Chin-Yew Lin, Gary Geunbae Lee
EACL
1989
ACL Anthology
13 years 9 months ago
Programming in Logic with Constraints for Natural Language Processing
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISL...
Patrick Saint-Dizier