![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Research in Computing Science, Volume 84
Volume 84, 2014
- Alexandra Moreira, Alcione de Paiva Oliveira, Giorgio Torres:
Automatically Clustering Ontological Annotated Sentences to Detect Semantic Frames. 9-16 - Rafaela Blanca Silva-López, Mónica Silva-López, Maricela Bravo, Iris Iddaly Méndez-Gurrola, Víctor Germán Sánchez-Arias:
GODeM: A Graphical Ontology Design Methodology. 17-28 - Mohammad Iman Jamnejad, Ali Heidarzadegan, Mohsen Meshki:
Text Recognition with k-means Clustering. 29-40 - S. Lakshmi, Sobha Lalitha Devi:
Rule Based Case Transfer in Tamil-Malayalam Machine Translation. 41-52 - Tarek Elghazaly, Abdelmawgoud Mohamed Maabid:
Assessment Criteria for Benchmarking Arabic Morphological Analyzers and Generators. 53-64 - Amit Mishra, Sanjay Kumar Jain:
An Approach for Computing Sentiment Polarity Analysis of Complex Why-type Questions on Product Review Sites. 65-76 - Luis Miralles Pechuán, Claudia Sánchez Gómez, María de Lourdes Martínez-Villaseñor:
Ad Exchange Optimization Algorithms on Advertising Networks. 77-88 - Olga Kolesnikova:
Error Patterns for Automatic Error Detection in Computer Assisted Pronunciation Training Systems. 89-112 - Noé Alejandro Castro-Sánchez, Bernardo López-Santiago:
Enriquecimiento automático de un léxico afectivo basado en relaciones semánticas obtenidas de un diccionario explicativo en español. 113-121
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.