Desktop text mining for law enforcement

ISI 2010 - 2010 IEEE International Conference on Intelligence and Security Informatics: Public Safety and Security

Volumn , Issue , 2010, Pages 138-140

  Crawley, Jonathan Brett ^a   Wagner, Gerhard ^a  

^a JOINT RESEARCH CENTRE   (Italy)

Author keywords

Information mining and analysis; Machine learning; Multilingual lightweight approach; Open Source Intelligence; Open source text

Indexed keywords

DESKTOP APPLICATIONS; FINITE STATE MACHINES; INFORMATION EXTRACTION; INFORMATION MINING; MACHINE-LEARNING; OPEN SOURCE INTELLIGENCE; OPEN SOURCES; RULE BASED; SOFTWARE SYSTEMS; SYSTEM DESIGN; TEXT MINING;

INFORMATION SCIENCE; LAW ENFORCEMENT; LEARNING SYSTEMS;

TEXT PROCESSING;

EID: 77954768329     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISI.2010.5484761     Document Type: Conference Paper

References (7)

1. Steinberger, R. and Pouliquen, B. Cross-lingual Named Entity Recognition. Journal Linguisticae Investigationes, Special Issue on Named Entity Recognition and Categorisation, LI 30:1(2007) John Benjamins Publishing Company. ISSN 0378-4169. (2007) 135-162.
2. Piskorski, J. Tanev, H. Atkinson, M. and Van der Goot, E. Online News Event Extraction for Global Crisis Surveillance. International Journal of Intelligent Information and Database Systems, 2009. InderScience Publishers.
3. Piskorski, Jakub ExPRESS - Extraction Pattern Recognition Engine and Specification Suite. In: Proceedings of the International Workshop Finite-State Methods and Natural language Processing 2007 (FSMNLP'2007). Potsdam, Germany, 14-16.09.2007
4. Piskorski, Jakub CORLEONE - Core Linguistic Entity Online Extraction. In: Technical Report EUR 23393 EN, European Commission, 2008
5. Pouliquen, Bruno Similarity of Names Across Scripts: Edit Distance Using Learned Costs of N-Grams. In: Advances in Natural Language Processing - 6th International Conference Proceeedings Bengt Nordström & Aarne Ranta (eds.), 2008
6. Viterbi A. J. (April 1967) Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 13 (2): 260-269
7. Levenshtein V. I. Binary Codes Capable of Correcting Deletions, Insertions, and Reversals translated from Doklady Akademii Nauk SSSR, Vol.163, No.4 pp. 845-848, August, 1965.