DanielFillol

Daniel Fillol's repositories

DataJUD_API_CALLER

This API Caller is a Go project designed to automate the retrieval of legal data from Datajud API. It's developed to work with legal cases and utilizes CNJ (Conselho Nacional de Justiça) numbers for data retrieval.

Language:GoApache-2.05 20

Crawler_LawsuitsESAJ

Crawler for lawsuit data in ESAJ systems

Language:GoApache-2.03 10

CNJ_Validate

Extract and Classify all information contained in CNJ format

Language:GoApache-2.02 10

Crawler_LexML

Language:GoApache-2.02 10

Crawler_TRT04

Crawler TRT04

Language:Go1 10

DanielFillol

1 10

goSpider

goSpider is a Go library for automating web navigation and data extraction using the chromedp package. It supports actions like fetching HTML content, clicking buttons, filling forms, handling alerts, interacting with various web elements.

Language:GoApache-2.0100

Java_Fiap

Language:HTMLApache-2.01 10

metaphone-br

This package is is a Go implementation of the Metaphone algorithm for phonetic string matching and comparison in Brazilian Portuguese language. It can be used to encode words or phrases into their phonetic representations, which can then be used for tasks such as fuzzy string matching, spell correction, and text-to-speech applications.

Language:GoApache-2.01 10

API_Names

API for name similarity check

Language:GoApache-2.0010

Document

This Go package provides functions to validate Brazilian CPF and CNPJ numbers. The ValidateCPF function checks if a given string is a valid CPF number, and the ValidateCNPJ function checks if a given string is a valid CNPJ number. Both functions use weighted sum algorithms to calculate verification digits and validate the numbers against them.

Language:GoApache-2.0010

laws

This is a package to search for legal typifications related to a given subject. The package uses a searchable index of legal typifications. The goal of this package is to provide a simple and efficient way to find legal information related to specific subjects.

Language:GoApache-2.0010

Levenshtein

This is a Go package that provides a function to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the difference between two strings, defined as the minimum number of single-character edits (insertions, deletions, or substitutions) required to transform one string into the other.

Language:GoApache-2.0010