First Page | Document Content | |
---|---|---|
![]() Date: 2007-11-01 18:56:14Markov models Estimation theory Bioinformatics Hidden Markov model Levenshtein distance Expectation–maximization algorithm Cross-validation Mixture model Statistics Machine learning Dynamic programming | Add to Reading List |
![]() | String Edit Distance (and intro to dynamic programming) Lecture #4 Computational Linguistics CMPSCI 591N, Spring 2006DocID: 1qMly - View Document |
![]() | CSE 584A Class 15 Jeremy Buhler March 21, 2016 1DocID: 1qArj - View Document |
![]() | Efficient Record Linkage in Large Data Sets Liang Jin, Chen Li, and Sharad Mehrotra Department of Information and Computer Science University of California, Irvine, CA 92697, USA liangj,chenli,sharad@ics.uci.edu AbstracDocID: 1qdYU - View Document |
![]() | Assignment 5 L645 / B659 Due Monday, October 12 I’m going to suggest groups of 2–3 people to work on this assignment. It’s not quite as involved as the Stanford CoreNLP one, but still has some technical start-up tiDocID: 1pDFD - View Document |
![]() | PDF DocumentDocID: 1poUu - View Document |