Sciweavers

69 search results - page 10 / 14
» Natural Language Generation with Tree Conditional Random Fie...
Sort
View
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 1 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
PAMI
2008
119views more  PAMI 2008»
14 years 9 months ago
Triplet Markov Fields for the Classification of Complex Structure Data
We address the issue of classifying complex data. We focus on three main sources of complexity, namely, the high dimensionality of the observed data, the dependencies between these...
Juliette Blanchet, Florence Forbes
EMNLP
2009
14 years 7 months ago
Generalized Expectation Criteria for Bootstrapping Extractors using Record-Text Alignment
Traditionally, machine learning approaches for information extraction require human annotated data that can be costly and time-consuming to produce. However, in many cases, there ...
Kedar Bellare, Andrew McCallum
ACL
2009
14 years 7 months ago
Semantic Tagging of Web Search Queries
We present a novel approach to parse web search queries for the purpose of automatic tagging of the queries. We will define a set of probabilistic context-free rules, which genera...
Mehdi Manshadi, Xiao Li
ICASSP
2011
IEEE
14 years 1 months ago
Powerful extensions to CRFS for grapheme to phoneme conversion
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...
Stefan Hahn, Patrick Lehnen, Hermann Ney