Evolving natural language grammars without supervision
Created by W.Langdon from
gp-bibliography.bib Revision:1.8098
- @InProceedings{Araujo:2010:cec,
-
author = "Lourdes Araujo and Jesus Santamaria",
-
title = "Evolving natural language grammars without
supervision",
-
booktitle = "IEEE Congress on Evolutionary Computation (CEC 2010)",
-
year = "2010",
-
address = "Barcelona, Spain",
-
month = "18-23 " # jul,
-
publisher = "IEEE Press",
-
keywords = "genetic algorithms, genetic programming",
-
isbn13 = "978-1-4244-6910-9",
-
abstract = "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 annotations of this structure. We
have devised an evolutionary algorithm which for each
sentence evolves a population of trees that represent
different parse trees of that sentence. Each of these
trees represent a part of a grammar. The evaluation
function takes into account the contexts in which each
sequence of Part-Of-Speech tags (POSseq) appears in the
training corpus, as well as the frequencies of those
POSseqs and contexts. The grammar for the whole
training corpus is constructed in an incremental
manner. The algorithm has been evaluated using a well
known Annotated English corpus, though the annotation
have only been used for evaluation purposes. Results
indicate that the proposed algorithm is able to improve
the results of a classical optimisation algorithm, such
as EM (Expectation Maximisation), for short grammar
constituents (right side of the grammar rules), and its
precision is better in general.",
-
DOI = "doi:10.1109/CEC.2010.5586291",
-
notes = "WCCI 2010. Also known as \cite{5586291}",
- }
Genetic Programming entries for
Lourdes Araujo
Jesus Santamaria
Citations