First Page | Document Content | |
---|---|---|
![]() Date: 2002-11-11 09:54:02Pattern matching Science Formal languages Approximate string matching Information retrieval Levenshtein distance Computational linguistics Edit distance String searching algorithm Computing String Dynamic programming | Source URL: www.ling.helsinki.fiDownload Document from Source WebsiteFile Size: 1,14 MBShare Document on Facebook |
![]() | Surname identification and correction in a corpus of forename surname dataset Suresh Veluru, Yogachandran Rahulamathavan, and Muttukrishnan Rajarajan Information Security Group, School of Engineering and Mathematical SciDocID: 1rk7H - View Document |
![]() | A PATTERN EXTRACTION ALGORITHM FOR ABSTRACT MELODIC REPRESENTATIONS THAT ALLOW PARTIAL OVERLAPPING OF INTERVALLIC CATEGORIES Emilios Cambouropoulos1 , Maxime Crochemore2,3 , Costas Iliopoulos3 , Manal Mohamed3 , Marie-FrDocID: 1rgdB - View Document |
![]() | doi:j.insDocID: 1r4I2 - View Document |
![]() | Indexing Mixed Types for Approximate Retrieval Liang Jin Nick Koudas University of California, Irvine, USADocID: 1q5EM - View Document |
![]() | Genome Informatics 12: 175–Indexing Huge Genome Sequences for Solving Various ProblemsDocID: 1pYuy - View Document |