Sciweavers

123 search results - page 3 / 25
» Natural Language Grammar Induction Using a Constituent-Conte...
Sort
View
CEC
2010
IEEE
14 years 10 months ago
Evolving natural language grammars without supervision
Unsupervised grammar induction is one of the most difficult works of language processing. Its goal is to extract a grammar representing the language structure using texts without a...
Lourdes Araujo, Jesus Santamaria
IJCAI
2003
14 years 10 months ago
GRAEL: an agent-based evolutionary computing approach for natural language grammar development
This paper describes an agent-based evolutionary computing technique called GRAEL (Grammar Evolution), that is able to perform different natural language grammar optimization and ...
Guy De Pauw
101
Voted
EMNLP
2011
13 years 9 months ago
Unsupervised Dependency Parsing without Gold Part-of-Speech Tags
We show that categories induced by unsupervised word clustering can surpass the performance of gold part-of-speech tags in dependency grammar induction. Unlike classic clustering ...
Valentin I. Spitkovsky, Hiyan Alshawi, Angel X. Ch...
ICGI
2010
Springer
14 years 8 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
EMNLP
2009
14 years 7 months ago
A Bayesian Model of Syntax-Directed Tree to String Grammar Induction
Tree based translation models are a compelling means of integrating linguistic information into machine translation. Syntax can inform lexical selection and reordering choices and...
Trevor Cohn, Phil Blunsom