Function SuggestKeyword

pkg/errors/hints.go:43–81

SuggestKeyword uses Levenshtein distance to suggest the closest SQL keyword matching the given input token. The suggestion is only returned when the edit distance is within half the length of the input (minimum threshold of 2), which prevents semantically unrelated tokens from being suggested. Resu

(input string)

// Returns the matching keyword in uppercase, or an empty string if no sufficiently
// close match is found.
func SuggestKeyword(input string) string {
	input = strings.ToUpper(input)
	if input == "" {
		return ""
	}

	// Check cache first
	if cached, ok := suggestionCache.get(input); ok {
		return cached
	}

	minDistance := len(input) + 1
	var bestMatch string

	for _, keyword := range commonKeywords {
		distance := levenshteinDistance(input, keyword)
		if distance < minDistance {
			minDistance = distance
			bestMatch = keyword
		}
	}

	// Only suggest if the distance is small relative to input length
	// (avoid suggesting "SELECT" for completely unrelated words)
	threshold := len(input) / 2
	if threshold < 2 {
		threshold = 2
	}

	var result string
	if minDistance <= threshold {
		result = bestMatch
	}

	// Cache the result
	suggestionCache.set(input, result)

	return result
}

// levenshteinDistance calculates the edit distance between two strings
func levenshteinDistance(s1, s2 string) int {