Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
String Matching with Metric Trees Using an Approximate Distance
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
A maximum entropy approach to named entity recognition
A maximum entropy approach to named entity recognition
Nymble: a high-performance learning name-finder
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Named-entity recognition for polish with SProUT
IMTCI'04 Proceedings of the Second international conference on Intelligent Media Technology for Communicative Intelligence
Web-Based Lemmatisation of Named Entities
TSD '08 Proceedings of the 11th international conference on Text, Speech and Dialogue
Towards the lemmatisation of polish nominal syntactic groups using a shallow grammar
SIIS'11 Proceedings of the 2011 international conference on Security and Intelligent Information Systems
Hi-index | 0.00 |
The paper presents two techniques for lemmatization of Polish person names. First, we apply a rule-based approach which relies on linguistic information and heuristics. Then, we investigate an alternative knowledge-poor method which employs string distance measures. We provide an evaluation of the adopted techniques using a set of newspaper texts.