Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 Choudhury2007
%A Choudhury, M.
%A Thomas, M.
%A Mukherjee, A.
%A Basu, A.
%A Ganguly, N.
%B Proceedings of the Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing
%D 2007
%K language linguistics NLP
%P 81-88
%T How Difficult is it to Develop a Perfect Spell-checker? A Cross-linguistic Analysis through Complex Network Approach
@inproceedings{Choudhury2007,
added-at = {2011-03-14T01:02:07.000+0100},
author = {Choudhury, M. and Thomas, M. and Mukherjee, A. and Basu, A. and Ganguly, N.},
biburl = {https://www.bibsonomy.org/bibtex/2e5a86a1b54d1025ee8bc850a0cea9260/lantiq},
booktitle = {Proceedings of the Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing},
file = {full text:Choudhury2007.pdf:PDF},
groups = {public},
interhash = {9f925a2c341ac0c4652ac7e7a7cc03e3},
intrahash = {e5a86a1b54d1025ee8bc850a0cea9260},
keywords = {language linguistics NLP},
pages = {81-88},
timestamp = {2011-08-28T03:05:16.000+0200},
title = {How Difficult is it to Develop a Perfect Spell-checker? A Cross-linguistic Analysis through Complex Network Approach},
username = {lantiq},
year = 2007
}