tommy/libpostal
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

fixed structures

Browse Source
This commit is contained in:
0xflotus
2018-12-30 03:17:50 +01:00
committed by GitHub
parent eae01d3e60
commit 52f6beba35
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@@ -472,7 +472,7 @@ optionally be separated so Rosenstraße and Rosen Straße are equivalent.
for a wide variety of countries and languages, not just US/English. for a wide variety of countries and languages, not just US/English.
The model is trained on over 1 billion addresses and address-like strings, using the The model is trained on over 1 billion addresses and address-like strings, using the
templates in the [OpenCage address formatting repo](https://github.com/OpenCageData/address-formatting) to construct formatted, templates in the [OpenCage address formatting repo](https://github.com/OpenCageData/address-formatting) to construct formatted,
tagged traning examples for every inhabited country in the world. Many types of [normalizations](https://github.com/openvenues/libpostal/blob/master/scripts/geodata/addresses/components.py) tagged training examples for every inhabited country in the world. Many types of [normalizations](https://github.com/openvenues/libpostal/blob/master/scripts/geodata/addresses/components.py)
are performed to make the training data resemble real messy geocoder input as closely as possible. are performed to make the training data resemble real messy geocoder input as closely as possible.
- **Language classification**: multinomial logistic regression - **Language classification**: multinomial logistic regression
@@ -623,7 +623,7 @@ libpostal is written in modern, legible, C99 and uses the following conventions:
- Confines almost all mallocs to *name*_new and all frees to *name*_destroy - Confines almost all mallocs to *name*_new and all frees to *name*_destroy
- Efficient existing implementations for simple things like hashtables - Efficient existing implementations for simple things like hashtables
- Generic containers (via [klib](https://github.com/attractivechaos/klib)) whenever possible - Generic containers (via [klib](https://github.com/attractivechaos/klib)) whenever possible
- Data structrues take advantage of sparsity as much as possible - Data structures take advantage of sparsity as much as possible
- Efficient double-array trie implementation for most string dictionaries - Efficient double-array trie implementation for most string dictionaries
- Cross-platform as much as possible, particularly for *nix - Cross-platform as much as possible, particularly for *nix