Sciweavers

522 search results - page 6 / 105
» Automating grammar comparison
Sort
View
LICS
1993
IEEE
15 years 2 months ago
Lambek Grammars Are Context Free
In this paper the Chomsky Conjecture is proved: all languages recognized by the Lambek calculus are context free.
Mati Pentus
AINA
2008
IEEE
15 years 14 days ago
Formalization of Link Farm Structure Using Graph Grammar
A link farm is a set of web pages constructed to mislead the importance of target pages in search engine results by boosting their link-based ranking scores. In this paper, we int...
Kiattikun Chobtham, Athasit Surarerks, Arnon Rungs...
EJC
2007
14 years 12 months ago
Comparing the Use of Feature Structures in Nativism and in Database Semantics
Linguistics has always been a field with a great diversity of schools and sub-schools. This has naturally led to the question of whether different grammatical analyses of the sam...
Roland Hausser
GRAMMARS
1998
111views more  GRAMMARS 1998»
14 years 10 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai
EUROGP
2004
Springer
145views Optimization» more  EUROGP 2004»
15 years 3 months ago
Toward an Alternative Comparison between Different Genetic Programming Systems
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...
Nguyen Xuan Hoai, Robert I. McKay, Daryl Essam, Hu...