Decision problems for patterns
Journal of Computer and System Sciences
Foundations of computing
Extended finite state models of language
Extended finite state models of language
Implementing and using finite automata toolkits
Extended finite state models of language
Theoretical Computer Science - Special issue on implementing automata
Minimization algorithms for sequential transducers
Theoretical Computer Science
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Finite-State Language Processing
Finite-State Language Processing
Proceedings of the Third International Workshop on Text, Speech and Dialogue
TDS '00 Proceedings of the Third International Workshop on Text, Speech and Dialogue
TDS '00 Proceedings of the Third International Workshop on Text, Speech and Dialogue
The Linguistic Basis of a Rule-Based Tagger of Czech
TDS '00 Proceedings of the Third International Workshop on Text, Speech and Dialogue
Minimal Cover-Automata for Finite Languages
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Word hy-phen-a-tion by com-put-er (hyphenation, computer)
Word hy-phen-a-tion by com-put-er (hyphenation, computer)
Finite-state transducers in language and speech processing
Computational Linguistics
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Regular expressions for language engineering
Natural Language Engineering
The TeXbook
Syntactic analysis using finite patterns: a new parsing system for Czech
LTC'09 Proceedings of the 4th conference on Human language technology: challenges for computer science and linguistics
| Hi-index | 0.00 |
In this paper we describe a method of effective handling of linguistic data by means of covering and inhibiting patterns - patterns that "compete" each other. A methodology of developing such patterns is outlined. Applications in the areas of morphology, hyphenation and part-of-speech tagging are shown. This pattern-driven approach to language engineering allows the combination of linguist expertise with the data learned from corpora - layering of knowledge. Searching for information in pattern database (dictionary problem) is blindingly fast - linear with respect to the length of searching word as with other finite-state approaches.