Sciweavers

430 search results - page 28 / 86
» Learning XML Grammars
Sort
View
WWW
2007
ACM
14 years 8 months ago
The use of XML to express a historical knowledge base
Since conventional historical records have been written assuming human readers, they are not well-suited for computers to collect and process automatically. If computers could und...
Katsuko T. Nakahira, Masashi Matsui, Yoshiki Mikam...
CORR
1999
Springer
118views Education» more  CORR 1999»
13 years 7 months ago
Supervised Grammar Induction Using Training Data with Limited Constituent Information
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is...
Rebecca Hwa
ACL
2010
13 years 6 months ago
Blocked Inference in Bayesian Tree Substitution Grammars
Learning a tree substitution grammar is very challenging due to derivational ambiguity. Our recent approach used a Bayesian non-parametric model to induce good derivations from tr...
Trevor Cohn, Phil Blunsom
IGPL
2007
125views more  IGPL 2007»
13 years 7 months ago
Morph Moulder: Teaching Software for HPSG and Description Logics
The graphical software Morph Moulder (MoMo) presented here was originally created for teaching the logical foundations of Head-Driven Phrase Structure Grammar (HPSG) in an e-Learn...
Ekaterina Ovchinnikova, Frank Richter
ICGI
2000
Springer
13 years 11 months ago
Constructive Learning of Context-Free Languages with a Subpansive Tree
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimo...