( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing

, , , и . MDPI Algorithms, 4 (4): 262--284 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Gabriel González López

Gabriel Alejandro López

Federico Infante

Arturo Infante

Otto Infante

 

Другие публикации лиц с тем же именем

Malware Evasion Attack and Defense., , , , , и . DSN Workshops, стр. 34-38. IEEE, (2019)The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing, , , и . MDPI Algorithms, 4 (4): 262--284 (2011)Searching for Part of Speech Tags That Improve Parsing Models., и . GoTAL, том 5221 из Lecture Notes in Computer Science, стр. 126-137. Springer, (2008)PAC-Learning Unambiguous k, l-NTS <= Languages., и . ICGI, том 6339 из Lecture Notes in Computer Science, стр. 122-134. Springer, (2010)Expressive Power and Consistency Properties of State-of-the-Art Natural Language Parsers., и . EsTAL, том 3230 из Lecture Notes in Computer Science, стр. 149-160. Springer, (2004)Controlled Model Exploration., , и . Advances in Modal Logic, стр. 205-220. King's College Publications, (2002)Data-driven computational linguistics at FaMAF-UNC, Argentina., и . NAACL (Young Investigators Workshop), стр. 8-14. Association for Computational Linguistics, (2010)iSat: Structure Visualization for SAT Problems., , и . LPAR, том 7180 из Lecture Notes in Computer Science, стр. 335-342. Springer, (2012)Bounding the Maximal Parsing Performance of Non-Terminally Separated Grammars., и . ICGI, том 6339 из Lecture Notes in Computer Science, стр. 135-147. Springer, (2010)Unsupervised induction of dependency structures using Probabilistic Bilexical Grammars., и . NLPKE, стр. 314-318. IEEE, (2011)