Levenshtein (editor) distance weighted.

levenshtein.py

import Levenshtein
def levenshtein(s1: str, s2: str) -> float:
    '''
    0.0 means perfect match
    0.1 very possible match
    0.2 less possible match
    0.3 likely not a match
    '''
    def processor(_string: str) -> str:
        _string = _string.upper()
        _string = _string.replace('LIMITED', 'LTD')
        return _string
        
    distance = Levenshtein.distance(s1, s2, processor=standardize_names)
    score = distance / max([len(s1), len(s2)])
    return round(score, 2)