How Difficult is it to Develop a Perfect Spell-checker? A Cross-Linguistic Analysis through Complex Network Approach
Monojit Choudhury, Markose Thomas, Animesh Mukherjee, Anupam Basu, Niloy Ganguly
- Anthology ID:
- W07-0212
- Volume:
- Proceedings of the Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing
- Month:
- Year:
- 2007
- Address:
- Rochester, NY, USA
- Editors:
- Chris Biemann, Irina Matveeva, Rada Mihalcea, Dragomir Radev
- Venue:
- TextGraphs
- SIG:
- SIGLEX
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 81–88
- Language:
- URL:
- https://aclanthology.org/W07-0212
- DOI:
- Cite (ACL):
- Monojit Choudhury, Markose Thomas, Animesh Mukherjee, Anupam Basu, and Niloy Ganguly. 2007. How Difficult is it to Develop a Perfect Spell-checker? A Cross-Linguistic Analysis through Complex Network Approach. In Proceedings of the Second Workshop on TextGraphs: Graph-Based Algorithms for Natural Language Processing, pages 81–88, Rochester, NY, USA. Association for Computational Linguistics.
- Cite (Informal):
- How Difficult is it to Develop a Perfect Spell-checker? A Cross-Linguistic Analysis through Complex Network Approach (Choudhury et al., TextGraphs 2007)
- PDF:
- https://preview.aclanthology.org/naacl-24-ws-corrections/W07-0212.pdf