Spoken dialogue technology: enabling the conversational user interface
ACM Computing Surveys (CSUR)
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Strength and similarity of affix removal stemming algorithms
ACM SIGIR Forum
Automatic induction of finite state transducers for simple phonological rules
ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Four stemmers and a funeral: stemming in hungarian at CLEF 2005
CLEF'05 Proceedings of the 6th international conference on Cross-Language Evalution Forum: accessing Multilingual Information Repositories
Classification based on logical concept analysis
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
| Hi-index | 0.00 |
The morpheme analysis module is an important component in natural language processing engines. The parser modules are usually based on rule systems created by human experts. In the paper, a novel approach is tested for implementation of the morpheme analyzer module. The proposed structure is based on the theory of formal concept analysis. The word inflection can be considered as a classification problem, where the class label denotes the corresponding transformation rule. The main benefit of the proposed method is the efficient generalization feature. The proposed morpheme analyzer module was implemented in a prototype question generation application.