Sciweavers

270 search results - page 47 / 54
» Effective natural language parsing with probabilistic gramma...
Sort
View
ACL
2006
14 years 11 months ago
Exact Decoding for Jointly Labeling and Chunking Sequences
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
Nobuyuki Shimizu, Andrew R. Haas
JMLR
2010
134views more  JMLR 2010»
14 years 4 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
75
Voted
ATAL
2006
Springer
15 years 1 months ago
Learning a common language through an emergent interaction topology
We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and lea...
Samarth Swarup, Kiran Lakkaraju, Les Gasser
ANLP
2000
111views more  ANLP 2000»
14 years 11 months ago
Bagging and Boosting a Treebank Parser
Bagging and boosting, two effective machine learning techniques, are applied to natural language parsing. Experiments using these techniques with a trainable statistical parser ar...
John C. Henderson, Eric Brill
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
15 years 11 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande