httppayai

Machine Shop

Compare text using deterministic, case-insensitive bag-of-words token-overlap similarity for lexical duplicate screening. Lowercase each input and tokenize with Python Unicode regex \w+ (letters, digits and underscores). Count repeated tokens. Similarity = sum(min(count_a(token),count_b(token))) / max(words_a,words_b,1), rounded to four decimal places. Returns exactly similarity in [0,1], words_a and words_b. Word order and punctuation are ignored; both token-empty inputs score 0, even when equal. Does not measure semantic similarity, Levenshtein edit distance, cosine similarity, or produce a text diff. POST application/json with a and b. Limit: 50000 input Unicode characters per request; for comparison, the lengths of a and b are added. Empty strings are accepted. Extra JSON properties are ignored. Errors after payment verification: 413 for the character limit; 422 for missing/non-string fields or malformed JSON, and for URL parsing errors. Unpaid calls return 402 with a base64 JSON PAYMENT-REQUIRED header before input validation. Handler error responses are not settled.