21 search results - page 1 / 5 » Efficient Inference of CRFs for Large-Scale Natural Language... |
ACL
2009
13 years 8 months ago
2009
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...
ICCPOL
2009
Springer
13 years 8 months ago
2009
Springer
Conditional random fields (CRFs) have been quite successful in various machine learning tasks. However, as larger and larger data become acceptable for the current computational ma...
ICDE
2009
IEEE
15 years 17 days ago
2009
IEEE
We present a declarative framework for collective deduplication of entity references in the presence of constraints. Constraints occur naturally in many data cleaning domains and c...
AAAI
2010
14 years 9 days ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
IJCNLP
2005
Springer
14 years 4 months ago
2005
Springer
We present a method of chunking in Korean texts using conditional random fields (CRFs), a recently introduced probabilistic model for labeling and segmenting sequence of data. In a...