libpostal

geohash

[utils] geohash

2015-03-03 18:51:49 -05:00

klib

[fix] fixing some formatting

2015-03-03 12:54:27 -05:00

log

[fix] fixing some formatting

2015-03-03 12:54:27 -05:00

murmur

[geodisambig] adding MurmurHash3, used by the Bloom filter

2015-03-11 17:47:57 -04:00

sds

[fix] fixing some formatting

2015-03-03 12:54:27 -05:00

utf8proc

[unicode] Upgrading to JuliaLang's utf8proc (Unicode 7, maintained)

2015-03-17 12:20:08 -04:00

bloom.c

[geodisambig] Bloom filter implementation for quick probabilistic set membership tests before hitting disk. 100% recall and bounded precision, saves disk seeks for keys that definitely do not exist (useful for Geonames disambiguation-related lookups and in-process deduping).

2015-03-11 17:47:15 -04:00

bloom.h

[geodisambig] Bloom filter implementation for quick probabilistic set membership tests before hitting disk. 100% recall and bounded precision, saves disk seeks for keys that definitely do not exist (useful for Geonames disambiguation-related lookups and in-process deduping).

2015-03-11 17:47:15 -04:00

collections.h

[utils] float and double arrays in collections.h

2015-03-11 17:30:26 -04:00

features.c

[features] Feature array, a special case of contiguous string array for adding namespaced features in CRF-like sequence models

2015-03-14 18:37:41 -04:00

features.h

[features] Feature array, a special case of contiguous string array for adding namespaced features in CRF-like sequence models

2015-03-14 18:37:41 -04:00

file_utils.c

[utils] is_relative_path

2015-03-11 17:31:08 -04:00

file_utils.h

[utils] adding tab and comma constants to file_utils for parsing CSV/TSV files

2015-03-17 18:35:45 -04:00

gazetteers.h

[dictionaries] Making address_components bit set a 16 bit int so we can bit pack trie values

2015-03-11 17:36:38 -04:00

scanner.c

[tokenization] Exposing some of the scanner's methods in header for use in the Python scanner so it can avoid the additional allocation

2015-03-17 18:38:30 -04:00

scanner.h

[tokenization] Exposing some of the scanner's methods in header for use in the Python scanner so it can avoid the additional allocation

2015-03-17 18:38:30 -04:00

scanner.re

[fix] removing struct definition from scanner.re for future generation of scanner.c

2015-03-17 19:46:40 -04:00

string_utils.c

[utils] string utils, file utils, contiguous arrays of strings used for storing tokenized strings, klib for generic hashtables and vectors, antirez's sds for certain types of string building, utf8proc for iterating over utf-8 strings and unicode normalization

2015-03-03 12:33:13 -05:00

string_utils.h

[fix] fixing some formatting

2015-03-03 12:54:27 -05:00

token_types.h

[fix] IDEOGRAM class name

2015-03-11 17:33:53 -04:00

tokens.c

[fix] fixing some formatting

2015-03-03 12:54:27 -05:00

tokens.h

[fix] fixing some formatting

2015-03-03 12:54:27 -05:00

trie_search.c

[phrases] trie_search module for searching for millions of patterns in a trie simultanously. Works for strings, token sequences, and can search for suffixes.

2015-03-03 13:51:01 -05:00

trie_search.h

[phrases] trie_search module for searching for millions of patterns in a trie simultanously. Works for strings, token sequences, and can search for suffixes.

2015-03-03 13:51:01 -05:00

trie.c

[phrases] default constructor for a trie uses a default alphabet derived from Wikipedia character frequencies for convenience. In practice the alphabet size/ordering matters only for very small tries or specialized alphabets. Mostly just use trie_new()

2015-03-05 13:40:52 -05:00

trie.h

[phrases] default constructor for a trie uses a default alphabet derived from Wikipedia character frequencies for convenience. In practice the alphabet size/ordering matters only for very small tries or specialized alphabets. Mostly just use trie_new()

2015-03-05 13:40:52 -05:00

vector.h

[fix] fixing some formatting

2015-03-03 12:54:27 -05:00