Levenshtein distance adalah salah satu cara untuk menghitung jumlah perbedaan karakter dari 2 kata. Berikut adalah langkah-langkah penggunaan extension python-Levenshtein pada Python.
Continue reading
Python Levenshtein Extension
Reply
Keane – Disconnected
The Adams – Konservatif
[Budal] Java Heat
13-14 April 2013
Institut Teknologi Sepuluh Nopember, Surabaya – Gunung Bromo – Lumajang – Tanjung Papuma – Jember – Probolinggo – Malang – Institut Teknologi Sepuluh Nopember, Surabaya
Quote
Today is the day.
From the top to the edge,
i see it, i hear it, i feel it.
Don’t you?
New Radicals – You Get What You Give
Finding Location in a Range
- Based on Haversine Formula – http://s.eamca.com/haversine-formula
- Implementation of Haversine on JavaScript – http://s.eamca.com/calculate-dist-lat-lng
- Using MySQL query – http://s.eamca.com/store-locator-with-php-mysql
Search any point between 10Km from the center point 37,-122
SELECT id, ( 6371 * acos( cos( radians(37) ) * cos( radians( lat ) ) * cos( radians( lng ) - radians(-122) ) + sin( radians(37) ) * sin( radians( lat ) ) ) ) AS distance FROM markers HAVING distance < 10 ORDER BY distance;