57 search results - page 5 / 12 » Parsing Tree Adjoining Grammars using Evolutionary Algorithm... |
EUROGP
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and sepa...
COLING
2010
14 years 5 months ago
2010
Surface realisation with grammars integrating flat semantics is known to be NP complete. In this paper, we present a new algorithm for surface realisation based on Feature Based T...
ACL
1998
14 years 11 months ago
1998
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting...
ACTA
2000
14 years 9 months ago
2000
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
CEC
2010
IEEE
14 years 11 months ago
2010
IEEE
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...