Displaying 1 to 20 from 55 results

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity...

levenshtein-distance cosine-similarity string-distance damerau-levenshtein distance distance-measure jaro-winkler similarity-measures shingles algorithm jvmLibrary to provide basic geospatial operations like distance calculation, conversion of decimal coordinates to sexagesimal and vice versa, etc. Takes 2 or 4 arguments. First 2 arguments must be objects that each have latitude and longitude properties (e.g. {latitude: 52.518611, longitude: 13.408056}). Coordinates can be in sexagesimal or decimal format. 3rd argument is accuracy (in meters). So a calculated distance of 1248 meters with an accuracy of 100 is returned as 1200 (accuracy 10 = 1250 etc.). 4th argument is precision in sub-meters (1 is meter presicion, 2 is decimeters, 3 is centimeters, etc).

geodesy distance latitude longitude elevation geolocation geo geojson geospatial lbs locationUses WiFi signals and machine learning (sklearn's RandomForest) to predict where you are. Even works for small distances like 2-10 meters. Your computer will known whether you are on Couch #1 or Couch #2.

whereami wifi-signal access-point distance cross-platform indoor-positioningTextDistance -- python library for comparing distance between two or more sequences by many algorithms. Work in progress. Now all algorithms compare two strings as array of bits.

distance algorithm textdistance hamming-distance levenshtein-distance damerau-levenshtein damerau-levenshtein-distance algorithms distance-calculation jellyfish"Natural" is a general natural language facility for nodejs. Tokenizing, stemming, classification, phonetics, tf-idf, WordNet, string similarity, and some inflections are currently supported.

natural language porter lancaster stemmer bayes classifier phonetic metaphone inflector wordnet tf-idf logistic regression doublemetaphone double jaro-winkler levenshtein distance taggerThis project was formerly a commercial library maintained by the company "GeoFrameworks" for two components it sold (GPS.NET and GIS.NET) from 2004 to 2009. Classes such as Angle, Distance, Speed, Latitude, Longitude, and Position simplify common geographic programming tasks.

gis angle azimuth bearing calculate distance geospatialThis project was formerly a commercial library maintained by the company "GeoFrameworks" for two components it sold (GPS.NET and GIS.NET) from 2004 to 2009. Classes such as Angle, Distance, Speed, Latitude, Longitude, and Position simplify common geographic programming tasks.

angle azimuth bearing distance gis gps latitudeMeasure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm

leven levenshtein distance algorithm algo string difference diff fast fuzzy similar similarity compare comparison edit text match matchingAn efficient Javascript implementation of the Levenshtein algorithm with locale-specific collator support. If you are not using any module loader system then the API will then be accessible via the window.Levenshtein object.

levenshtein distance stringLength.js was designed to work both in the browser and in Node.js. Length.js is available on unpkg CDN in compressed and uncompressed version.

javascript-library library converter conversion utility npm npm-package open-source measure measurements units convert parser metrics quantities quantity units-of-measure units-of-measurement units-measures-converter length conventer distanceConverts a .ttf font file into multichannel signed distance fields, then outputs packed spritesheets and a json representation of an AngelCode BMfont.Signed distance fields are a method of reproducing vector shapes from a texture representation, popularized in this paper by Valve. This tool uses Chlumsky/msdfgen to generate multichannel signed distance fields to preserve corners. The distance fields are created from vector fonts, then rendered into texture pages. A BMFont object is provided for character layout.

bmfont bitmap font text fonts signed distance field glyph glyphs sdf msdf multichannelVladimir Levenshtein’s edit distance algorithm1 as a C library. There’s also a CLI: levenshtein(1), and a JavaScript version.Or clone the repo.

levenshtein fuzzy-search edit-distance fuzzy-matching string-matching similarity levenshtein-distance vladimir algorithm edit distanceGPS.js is an extensible parser for NMEA sentences, given by any common GPS receiver. The output is tried to be as high-level as possible to make it more useful than simply splitting the information. The aim is, that you don't have to understand NMEA, just plug in your receiver and you're ready to go.The interface of GPS.js is as simple as the following few lines. You need to add an event-listener for the completion of the task and invoke the update method with a sentence you want to process. There are much more examples in the examples folder.

gps nmea satellite protocol serial gps-receiver parser distance geo location rmc gga gll gsa vtg gvaPerforms a distance transform of array in place using Meijster's algorithm.array is updated in place and gets the distance values.

scijs distance transform euclidean manhattan taxicab morphology chebyshev chessboard lp lebesgue metricEasier Canvas2D text rendering.This still has some bugs that is cutting off text in places. If you'd like to contribute, drop me a line in the issues. For now, the current version is unstable 0.x and undocumented until bugs are smoothed out.

sdf text atlas signed distance field alpha test testing smooth font webgl texts label labels fonts wordCommand-line tool which takes a 4-channel RGBA image and generates a signed distance field. The bitmask is determined by pixels with alpha over 128 and any RGB channel over 128.The code has been adpated from libgdx.

sdf bitmap bmp png img jpg image signed distance field text alpha test fonts webgl gl stackgl glsl shaderSimplifies a 2D polyline, first using a radial distance check, and then a recursive Douglas-Peucker algorithm. The code is from simplify-js, but uses arrays for better interoperability with npm modules like stack.gl, parse-svg-path, chaikin-smooth, ndarray, etc.Note: For performance, this does not produce a deep copy of the input.

polyline simplify 2d path poly line douglas radial distance redundant duplicate pointsA collection of very fast approximations to common geodesic measurements. Useful for performance-sensitive code that measures things on a city scale.The approximations are based on an FCC-approved formula of ellipsoidal Earth projection. For distances under 500 kilometers and not on the poles, the results are very precise — within 0.1% margin of error compared to Vincenti formulas, and usually much less for shorter distances.

geodesy measurements distance fast library geospatial measurement approximationPort to C++ of Cheap Ruler, a collection of very fast approximations to common geodesic measurements.All point, line_string, polygon, and box references are mapbox::geometry data structures.

geodesy measurements distance fast cplusplus library
We have large collection of open source products. Follow the tags from
Tag Cloud >>

Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
**Add Projects.**